You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
1 line
130 KiB
1 line
130 KiB
<!DOCTYPE html><meta charset="UTF-8"><meta http-equiv="Content-Language" content="en" /><title>array.js</title><link href="../../../../dossier.css" rel="stylesheet" type="text/css"><div id="main-wrapper"><input type="checkbox" id="sidenav-toggle" /><main><header><h1>lib/goog/array/array.js</h1></header><pre><table class="srcfile"><tbody><tr><td><a name="l1" href="#l1">1</a><td>// Copyright 2006 The Closure Library Authors. All Rights Reserved.<tr><td><a name="l2" href="#l2">2</a><td>//<tr><td><a name="l3" href="#l3">3</a><td>// Licensed under the Apache License, Version 2.0 (the "License");<tr><td><a name="l4" href="#l4">4</a><td>// you may not use this file except in compliance with the License.<tr><td><a name="l5" href="#l5">5</a><td>// You may obtain a copy of the License at<tr><td><a name="l6" href="#l6">6</a><td>//<tr><td><a name="l7" href="#l7">7</a><td>// http://www.apache.org/licenses/LICENSE-2.0<tr><td><a name="l8" href="#l8">8</a><td>//<tr><td><a name="l9" href="#l9">9</a><td>// Unless required by applicable law or agreed to in writing, software<tr><td><a name="l10" href="#l10">10</a><td>// distributed under the License is distributed on an "AS-IS" BASIS,<tr><td><a name="l11" href="#l11">11</a><td>// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<tr><td><a name="l12" href="#l12">12</a><td>// See the License for the specific language governing permissions and<tr><td><a name="l13" href="#l13">13</a><td>// limitations under the License.<tr><td><a name="l14" href="#l14">14</a><td><tr><td><a name="l15" href="#l15">15</a><td>/**<tr><td><a name="l16" href="#l16">16</a><td> * @fileoverview Utilities for manipulating arrays.<tr><td><a name="l17" href="#l17">17</a><td> *<tr><td><a name="l18" href="#l18">18</a><td> */<tr><td><a name="l19" href="#l19">19</a><td><tr><td><a name="l20" href="#l20">20</a><td><tr><td><a name="l21" href="#l21">21</a><td>goog.provide('goog.array');<tr><td><a name="l22" href="#l22">22</a><td>goog.provide('goog.array.ArrayLike');<tr><td><a name="l23" href="#l23">23</a><td><tr><td><a name="l24" href="#l24">24</a><td>goog.require('goog.asserts');<tr><td><a name="l25" href="#l25">25</a><td><tr><td><a name="l26" href="#l26">26</a><td><tr><td><a name="l27" href="#l27">27</a><td>/**<tr><td><a name="l28" href="#l28">28</a><td> * @define {boolean} NATIVE_ARRAY_PROTOTYPES indicates whether the code should<tr><td><a name="l29" href="#l29">29</a><td> * rely on Array.prototype functions, if available.<tr><td><a name="l30" href="#l30">30</a><td> *<tr><td><a name="l31" href="#l31">31</a><td> * The Array.prototype functions can be defined by external libraries like<tr><td><a name="l32" href="#l32">32</a><td> * Prototype and setting this flag to false forces closure to use its own<tr><td><a name="l33" href="#l33">33</a><td> * goog.array implementation.<tr><td><a name="l34" href="#l34">34</a><td> *<tr><td><a name="l35" href="#l35">35</a><td> * If your javascript can be loaded by a third party site and you are wary about<tr><td><a name="l36" href="#l36">36</a><td> * relying on the prototype functions, specify<tr><td><a name="l37" href="#l37">37</a><td> * "--define goog.NATIVE_ARRAY_PROTOTYPES=false" to the JSCompiler.<tr><td><a name="l38" href="#l38">38</a><td> *<tr><td><a name="l39" href="#l39">39</a><td> * Setting goog.TRUSTED_SITE to false will automatically set<tr><td><a name="l40" href="#l40">40</a><td> * NATIVE_ARRAY_PROTOTYPES to false.<tr><td><a name="l41" href="#l41">41</a><td> */<tr><td><a name="l42" href="#l42">42</a><td>goog.define('goog.NATIVE_ARRAY_PROTOTYPES', goog.TRUSTED_SITE);<tr><td><a name="l43" href="#l43">43</a><td><tr><td><a name="l44" href="#l44">44</a><td><tr><td><a name="l45" href="#l45">45</a><td>/**<tr><td><a name="l46" href="#l46">46</a><td> * @define {boolean} If true, JSCompiler will use the native implementation of<tr><td><a name="l47" href="#l47">47</a><td> * array functions where appropriate (e.g., {@code Array#filter}) and remove the<tr><td><a name="l48" href="#l48">48</a><td> * unused pure JS implementation.<tr><td><a name="l49" href="#l49">49</a><td> */<tr><td><a name="l50" href="#l50">50</a><td>goog.define('goog.array.ASSUME_NATIVE_FUNCTIONS', false);<tr><td><a name="l51" href="#l51">51</a><td><tr><td><a name="l52" href="#l52">52</a><td><tr><td><a name="l53" href="#l53">53</a><td>/**<tr><td><a name="l54" href="#l54">54</a><td> * @typedef {Array|NodeList|Arguments|{length: number}}<tr><td><a name="l55" href="#l55">55</a><td> */<tr><td><a name="l56" href="#l56">56</a><td>goog.array.ArrayLike;<tr><td><a name="l57" href="#l57">57</a><td><tr><td><a name="l58" href="#l58">58</a><td><tr><td><a name="l59" href="#l59">59</a><td>/**<tr><td><a name="l60" href="#l60">60</a><td> * Returns the last element in an array without removing it.<tr><td><a name="l61" href="#l61">61</a><td> * Same as goog.array.last.<tr><td><a name="l62" href="#l62">62</a><td> * @param {Array.<T>|goog.array.ArrayLike} array The array.<tr><td><a name="l63" href="#l63">63</a><td> * @return {T} Last item in array.<tr><td><a name="l64" href="#l64">64</a><td> * @template T<tr><td><a name="l65" href="#l65">65</a><td> */<tr><td><a name="l66" href="#l66">66</a><td>goog.array.peek = function(array) {<tr><td><a name="l67" href="#l67">67</a><td> return array[array.length - 1];<tr><td><a name="l68" href="#l68">68</a><td>};<tr><td><a name="l69" href="#l69">69</a><td><tr><td><a name="l70" href="#l70">70</a><td><tr><td><a name="l71" href="#l71">71</a><td>/**<tr><td><a name="l72" href="#l72">72</a><td> * Returns the last element in an array without removing it.<tr><td><a name="l73" href="#l73">73</a><td> * Same as goog.array.peek.<tr><td><a name="l74" href="#l74">74</a><td> * @param {Array.<T>|goog.array.ArrayLike} array The array.<tr><td><a name="l75" href="#l75">75</a><td> * @return {T} Last item in array.<tr><td><a name="l76" href="#l76">76</a><td> * @template T<tr><td><a name="l77" href="#l77">77</a><td> */<tr><td><a name="l78" href="#l78">78</a><td>goog.array.last = goog.array.peek;<tr><td><a name="l79" href="#l79">79</a><td><tr><td><a name="l80" href="#l80">80</a><td><tr><td><a name="l81" href="#l81">81</a><td>/**<tr><td><a name="l82" href="#l82">82</a><td> * Reference to the original {@code Array.prototype}.<tr><td><a name="l83" href="#l83">83</a><td> * @private<tr><td><a name="l84" href="#l84">84</a><td> */<tr><td><a name="l85" href="#l85">85</a><td>goog.array.ARRAY_PROTOTYPE_ = Array.prototype;<tr><td><a name="l86" href="#l86">86</a><td><tr><td><a name="l87" href="#l87">87</a><td><tr><td><a name="l88" href="#l88">88</a><td>// NOTE(arv): Since most of the array functions are generic it allows you to<tr><td><a name="l89" href="#l89">89</a><td>// pass an array-like object. Strings have a length and are considered array-<tr><td><a name="l90" href="#l90">90</a><td>// like. However, the 'in' operator does not work on strings so we cannot just<tr><td><a name="l91" href="#l91">91</a><td>// use the array path even if the browser supports indexing into strings. We<tr><td><a name="l92" href="#l92">92</a><td>// therefore end up splitting the string.<tr><td><a name="l93" href="#l93">93</a><td><tr><td><a name="l94" href="#l94">94</a><td><tr><td><a name="l95" href="#l95">95</a><td>/**<tr><td><a name="l96" href="#l96">96</a><td> * Returns the index of the first element of an array with a specified value, or<tr><td><a name="l97" href="#l97">97</a><td> * -1 if the element is not present in the array.<tr><td><a name="l98" href="#l98">98</a><td> *<tr><td><a name="l99" href="#l99">99</a><td> * See {@link http://tinyurl.com/developer-mozilla-org-array-indexof}<tr><td><a name="l100" href="#l100">100</a><td> *<tr><td><a name="l101" href="#l101">101</a><td> * @param {Array.<T>|goog.array.ArrayLike} arr The array to be searched.<tr><td><a name="l102" href="#l102">102</a><td> * @param {T} obj The object for which we are searching.<tr><td><a name="l103" href="#l103">103</a><td> * @param {number=} opt_fromIndex The index at which to start the search. If<tr><td><a name="l104" href="#l104">104</a><td> * omitted the search starts at index 0.<tr><td><a name="l105" href="#l105">105</a><td> * @return {number} The index of the first matching array element.<tr><td><a name="l106" href="#l106">106</a><td> * @template T<tr><td><a name="l107" href="#l107">107</a><td> */<tr><td><a name="l108" href="#l108">108</a><td>goog.array.indexOf = goog.NATIVE_ARRAY_PROTOTYPES &&<tr><td><a name="l109" href="#l109">109</a><td> (goog.array.ASSUME_NATIVE_FUNCTIONS ||<tr><td><a name="l110" href="#l110">110</a><td> goog.array.ARRAY_PROTOTYPE_.indexOf) ?<tr><td><a name="l111" href="#l111">111</a><td> function(arr, obj, opt_fromIndex) {<tr><td><a name="l112" href="#l112">112</a><td> goog.asserts.assert(arr.length != null);<tr><td><a name="l113" href="#l113">113</a><td><tr><td><a name="l114" href="#l114">114</a><td> return goog.array.ARRAY_PROTOTYPE_.indexOf.call(arr, obj, opt_fromIndex);<tr><td><a name="l115" href="#l115">115</a><td> } :<tr><td><a name="l116" href="#l116">116</a><td> function(arr, obj, opt_fromIndex) {<tr><td><a name="l117" href="#l117">117</a><td> var fromIndex = opt_fromIndex == null ?<tr><td><a name="l118" href="#l118">118</a><td> 0 : (opt_fromIndex < 0 ?<tr><td><a name="l119" href="#l119">119</a><td> Math.max(0, arr.length + opt_fromIndex) : opt_fromIndex);<tr><td><a name="l120" href="#l120">120</a><td><tr><td><a name="l121" href="#l121">121</a><td> if (goog.isString(arr)) {<tr><td><a name="l122" href="#l122">122</a><td> // Array.prototype.indexOf uses === so only strings should be found.<tr><td><a name="l123" href="#l123">123</a><td> if (!goog.isString(obj) || obj.length != 1) {<tr><td><a name="l124" href="#l124">124</a><td> return -1;<tr><td><a name="l125" href="#l125">125</a><td> }<tr><td><a name="l126" href="#l126">126</a><td> return arr.indexOf(obj, fromIndex);<tr><td><a name="l127" href="#l127">127</a><td> }<tr><td><a name="l128" href="#l128">128</a><td><tr><td><a name="l129" href="#l129">129</a><td> for (var i = fromIndex; i < arr.length; i++) {<tr><td><a name="l130" href="#l130">130</a><td> if (i in arr && arr[i] === obj)<tr><td><a name="l131" href="#l131">131</a><td> return i;<tr><td><a name="l132" href="#l132">132</a><td> }<tr><td><a name="l133" href="#l133">133</a><td> return -1;<tr><td><a name="l134" href="#l134">134</a><td> };<tr><td><a name="l135" href="#l135">135</a><td><tr><td><a name="l136" href="#l136">136</a><td><tr><td><a name="l137" href="#l137">137</a><td>/**<tr><td><a name="l138" href="#l138">138</a><td> * Returns the index of the last element of an array with a specified value, or<tr><td><a name="l139" href="#l139">139</a><td> * -1 if the element is not present in the array.<tr><td><a name="l140" href="#l140">140</a><td> *<tr><td><a name="l141" href="#l141">141</a><td> * See {@link http://tinyurl.com/developer-mozilla-org-array-lastindexof}<tr><td><a name="l142" href="#l142">142</a><td> *<tr><td><a name="l143" href="#l143">143</a><td> * @param {!Array.<T>|!goog.array.ArrayLike} arr The array to be searched.<tr><td><a name="l144" href="#l144">144</a><td> * @param {T} obj The object for which we are searching.<tr><td><a name="l145" href="#l145">145</a><td> * @param {?number=} opt_fromIndex The index at which to start the search. If<tr><td><a name="l146" href="#l146">146</a><td> * omitted the search starts at the end of the array.<tr><td><a name="l147" href="#l147">147</a><td> * @return {number} The index of the last matching array element.<tr><td><a name="l148" href="#l148">148</a><td> * @template T<tr><td><a name="l149" href="#l149">149</a><td> */<tr><td><a name="l150" href="#l150">150</a><td>goog.array.lastIndexOf = goog.NATIVE_ARRAY_PROTOTYPES &&<tr><td><a name="l151" href="#l151">151</a><td> (goog.array.ASSUME_NATIVE_FUNCTIONS ||<tr><td><a name="l152" href="#l152">152</a><td> goog.array.ARRAY_PROTOTYPE_.lastIndexOf) ?<tr><td><a name="l153" href="#l153">153</a><td> function(arr, obj, opt_fromIndex) {<tr><td><a name="l154" href="#l154">154</a><td> goog.asserts.assert(arr.length != null);<tr><td><a name="l155" href="#l155">155</a><td><tr><td><a name="l156" href="#l156">156</a><td> // Firefox treats undefined and null as 0 in the fromIndex argument which<tr><td><a name="l157" href="#l157">157</a><td> // leads it to always return -1<tr><td><a name="l158" href="#l158">158</a><td> var fromIndex = opt_fromIndex == null ? arr.length - 1 : opt_fromIndex;<tr><td><a name="l159" href="#l159">159</a><td> return goog.array.ARRAY_PROTOTYPE_.lastIndexOf.call(arr, obj, fromIndex);<tr><td><a name="l160" href="#l160">160</a><td> } :<tr><td><a name="l161" href="#l161">161</a><td> function(arr, obj, opt_fromIndex) {<tr><td><a name="l162" href="#l162">162</a><td> var fromIndex = opt_fromIndex == null ? arr.length - 1 : opt_fromIndex;<tr><td><a name="l163" href="#l163">163</a><td><tr><td><a name="l164" href="#l164">164</a><td> if (fromIndex < 0) {<tr><td><a name="l165" href="#l165">165</a><td> fromIndex = Math.max(0, arr.length + fromIndex);<tr><td><a name="l166" href="#l166">166</a><td> }<tr><td><a name="l167" href="#l167">167</a><td><tr><td><a name="l168" href="#l168">168</a><td> if (goog.isString(arr)) {<tr><td><a name="l169" href="#l169">169</a><td> // Array.prototype.lastIndexOf uses === so only strings should be found.<tr><td><a name="l170" href="#l170">170</a><td> if (!goog.isString(obj) || obj.length != 1) {<tr><td><a name="l171" href="#l171">171</a><td> return -1;<tr><td><a name="l172" href="#l172">172</a><td> }<tr><td><a name="l173" href="#l173">173</a><td> return arr.lastIndexOf(obj, fromIndex);<tr><td><a name="l174" href="#l174">174</a><td> }<tr><td><a name="l175" href="#l175">175</a><td><tr><td><a name="l176" href="#l176">176</a><td> for (var i = fromIndex; i >= 0; i--) {<tr><td><a name="l177" href="#l177">177</a><td> if (i in arr && arr[i] === obj)<tr><td><a name="l178" href="#l178">178</a><td> return i;<tr><td><a name="l179" href="#l179">179</a><td> }<tr><td><a name="l180" href="#l180">180</a><td> return -1;<tr><td><a name="l181" href="#l181">181</a><td> };<tr><td><a name="l182" href="#l182">182</a><td><tr><td><a name="l183" href="#l183">183</a><td><tr><td><a name="l184" href="#l184">184</a><td>/**<tr><td><a name="l185" href="#l185">185</a><td> * Calls a function for each element in an array. Skips holes in the array.<tr><td><a name="l186" href="#l186">186</a><td> * See {@link http://tinyurl.com/developer-mozilla-org-array-foreach}<tr><td><a name="l187" href="#l187">187</a><td> *<tr><td><a name="l188" href="#l188">188</a><td> * @param {Array.<T>|goog.array.ArrayLike} arr Array or array like object over<tr><td><a name="l189" href="#l189">189</a><td> * which to iterate.<tr><td><a name="l190" href="#l190">190</a><td> * @param {?function(this: S, T, number, ?): ?} f The function to call for every<tr><td><a name="l191" href="#l191">191</a><td> * element. This function takes 3 arguments (the element, the index and the<tr><td><a name="l192" href="#l192">192</a><td> * array). The return value is ignored.<tr><td><a name="l193" href="#l193">193</a><td> * @param {S=} opt_obj The object to be used as the value of 'this' within f.<tr><td><a name="l194" href="#l194">194</a><td> * @template T,S<tr><td><a name="l195" href="#l195">195</a><td> */<tr><td><a name="l196" href="#l196">196</a><td>goog.array.forEach = goog.NATIVE_ARRAY_PROTOTYPES &&<tr><td><a name="l197" href="#l197">197</a><td> (goog.array.ASSUME_NATIVE_FUNCTIONS ||<tr><td><a name="l198" href="#l198">198</a><td> goog.array.ARRAY_PROTOTYPE_.forEach) ?<tr><td><a name="l199" href="#l199">199</a><td> function(arr, f, opt_obj) {<tr><td><a name="l200" href="#l200">200</a><td> goog.asserts.assert(arr.length != null);<tr><td><a name="l201" href="#l201">201</a><td><tr><td><a name="l202" href="#l202">202</a><td> goog.array.ARRAY_PROTOTYPE_.forEach.call(arr, f, opt_obj);<tr><td><a name="l203" href="#l203">203</a><td> } :<tr><td><a name="l204" href="#l204">204</a><td> function(arr, f, opt_obj) {<tr><td><a name="l205" href="#l205">205</a><td> var l = arr.length; // must be fixed during loop... see docs<tr><td><a name="l206" href="#l206">206</a><td> var arr2 = goog.isString(arr) ? arr.split('') : arr;<tr><td><a name="l207" href="#l207">207</a><td> for (var i = 0; i < l; i++) {<tr><td><a name="l208" href="#l208">208</a><td> if (i in arr2) {<tr><td><a name="l209" href="#l209">209</a><td> f.call(opt_obj, arr2[i], i, arr);<tr><td><a name="l210" href="#l210">210</a><td> }<tr><td><a name="l211" href="#l211">211</a><td> }<tr><td><a name="l212" href="#l212">212</a><td> };<tr><td><a name="l213" href="#l213">213</a><td><tr><td><a name="l214" href="#l214">214</a><td><tr><td><a name="l215" href="#l215">215</a><td>/**<tr><td><a name="l216" href="#l216">216</a><td> * Calls a function for each element in an array, starting from the last<tr><td><a name="l217" href="#l217">217</a><td> * element rather than the first.<tr><td><a name="l218" href="#l218">218</a><td> *<tr><td><a name="l219" href="#l219">219</a><td> * @param {Array.<T>|goog.array.ArrayLike} arr Array or array<tr><td><a name="l220" href="#l220">220</a><td> * like object over which to iterate.<tr><td><a name="l221" href="#l221">221</a><td> * @param {?function(this: S, T, number, ?): ?} f The function to call for every<tr><td><a name="l222" href="#l222">222</a><td> * element. This function<tr><td><a name="l223" href="#l223">223</a><td> * takes 3 arguments (the element, the index and the array). The return<tr><td><a name="l224" href="#l224">224</a><td> * value is ignored.<tr><td><a name="l225" href="#l225">225</a><td> * @param {S=} opt_obj The object to be used as the value of 'this'<tr><td><a name="l226" href="#l226">226</a><td> * within f.<tr><td><a name="l227" href="#l227">227</a><td> * @template T,S<tr><td><a name="l228" href="#l228">228</a><td> */<tr><td><a name="l229" href="#l229">229</a><td>goog.array.forEachRight = function(arr, f, opt_obj) {<tr><td><a name="l230" href="#l230">230</a><td> var l = arr.length; // must be fixed during loop... see docs<tr><td><a name="l231" href="#l231">231</a><td> var arr2 = goog.isString(arr) ? arr.split('') : arr;<tr><td><a name="l232" href="#l232">232</a><td> for (var i = l - 1; i >= 0; --i) {<tr><td><a name="l233" href="#l233">233</a><td> if (i in arr2) {<tr><td><a name="l234" href="#l234">234</a><td> f.call(opt_obj, arr2[i], i, arr);<tr><td><a name="l235" href="#l235">235</a><td> }<tr><td><a name="l236" href="#l236">236</a><td> }<tr><td><a name="l237" href="#l237">237</a><td>};<tr><td><a name="l238" href="#l238">238</a><td><tr><td><a name="l239" href="#l239">239</a><td><tr><td><a name="l240" href="#l240">240</a><td>/**<tr><td><a name="l241" href="#l241">241</a><td> * Calls a function for each element in an array, and if the function returns<tr><td><a name="l242" href="#l242">242</a><td> * true adds the element to a new array.<tr><td><a name="l243" href="#l243">243</a><td> *<tr><td><a name="l244" href="#l244">244</a><td> * See {@link http://tinyurl.com/developer-mozilla-org-array-filter}<tr><td><a name="l245" href="#l245">245</a><td> *<tr><td><a name="l246" href="#l246">246</a><td> * @param {Array.<T>|goog.array.ArrayLike} arr Array or array<tr><td><a name="l247" href="#l247">247</a><td> * like object over which to iterate.<tr><td><a name="l248" href="#l248">248</a><td> * @param {?function(this:S, T, number, ?):boolean} f The function to call for<tr><td><a name="l249" href="#l249">249</a><td> * every element. This function<tr><td><a name="l250" href="#l250">250</a><td> * takes 3 arguments (the element, the index and the array) and must<tr><td><a name="l251" href="#l251">251</a><td> * return a Boolean. If the return value is true the element is added to the<tr><td><a name="l252" href="#l252">252</a><td> * result array. If it is false the element is not included.<tr><td><a name="l253" href="#l253">253</a><td> * @param {S=} opt_obj The object to be used as the value of 'this'<tr><td><a name="l254" href="#l254">254</a><td> * within f.<tr><td><a name="l255" href="#l255">255</a><td> * @return {!Array.<T>} a new array in which only elements that passed the test<tr><td><a name="l256" href="#l256">256</a><td> * are present.<tr><td><a name="l257" href="#l257">257</a><td> * @template T,S<tr><td><a name="l258" href="#l258">258</a><td> */<tr><td><a name="l259" href="#l259">259</a><td>goog.array.filter = goog.NATIVE_ARRAY_PROTOTYPES &&<tr><td><a name="l260" href="#l260">260</a><td> (goog.array.ASSUME_NATIVE_FUNCTIONS ||<tr><td><a name="l261" href="#l261">261</a><td> goog.array.ARRAY_PROTOTYPE_.filter) ?<tr><td><a name="l262" href="#l262">262</a><td> function(arr, f, opt_obj) {<tr><td><a name="l263" href="#l263">263</a><td> goog.asserts.assert(arr.length != null);<tr><td><a name="l264" href="#l264">264</a><td><tr><td><a name="l265" href="#l265">265</a><td> return goog.array.ARRAY_PROTOTYPE_.filter.call(arr, f, opt_obj);<tr><td><a name="l266" href="#l266">266</a><td> } :<tr><td><a name="l267" href="#l267">267</a><td> function(arr, f, opt_obj) {<tr><td><a name="l268" href="#l268">268</a><td> var l = arr.length; // must be fixed during loop... see docs<tr><td><a name="l269" href="#l269">269</a><td> var res = [];<tr><td><a name="l270" href="#l270">270</a><td> var resLength = 0;<tr><td><a name="l271" href="#l271">271</a><td> var arr2 = goog.isString(arr) ? arr.split('') : arr;<tr><td><a name="l272" href="#l272">272</a><td> for (var i = 0; i < l; i++) {<tr><td><a name="l273" href="#l273">273</a><td> if (i in arr2) {<tr><td><a name="l274" href="#l274">274</a><td> var val = arr2[i]; // in case f mutates arr2<tr><td><a name="l275" href="#l275">275</a><td> if (f.call(opt_obj, val, i, arr)) {<tr><td><a name="l276" href="#l276">276</a><td> res[resLength++] = val;<tr><td><a name="l277" href="#l277">277</a><td> }<tr><td><a name="l278" href="#l278">278</a><td> }<tr><td><a name="l279" href="#l279">279</a><td> }<tr><td><a name="l280" href="#l280">280</a><td> return res;<tr><td><a name="l281" href="#l281">281</a><td> };<tr><td><a name="l282" href="#l282">282</a><td><tr><td><a name="l283" href="#l283">283</a><td><tr><td><a name="l284" href="#l284">284</a><td>/**<tr><td><a name="l285" href="#l285">285</a><td> * Calls a function for each element in an array and inserts the result into a<tr><td><a name="l286" href="#l286">286</a><td> * new array.<tr><td><a name="l287" href="#l287">287</a><td> *<tr><td><a name="l288" href="#l288">288</a><td> * See {@link http://tinyurl.com/developer-mozilla-org-array-map}<tr><td><a name="l289" href="#l289">289</a><td> *<tr><td><a name="l290" href="#l290">290</a><td> * @param {Array.<VALUE>|goog.array.ArrayLike} arr Array or array like object<tr><td><a name="l291" href="#l291">291</a><td> * over which to iterate.<tr><td><a name="l292" href="#l292">292</a><td> * @param {function(this:THIS, VALUE, number, ?): RESULT} f The function to call<tr><td><a name="l293" href="#l293">293</a><td> * for every element. This function takes 3 arguments (the element,<tr><td><a name="l294" href="#l294">294</a><td> * the index and the array) and should return something. The result will be<tr><td><a name="l295" href="#l295">295</a><td> * inserted into a new array.<tr><td><a name="l296" href="#l296">296</a><td> * @param {THIS=} opt_obj The object to be used as the value of 'this' within f.<tr><td><a name="l297" href="#l297">297</a><td> * @return {!Array.<RESULT>} a new array with the results from f.<tr><td><a name="l298" href="#l298">298</a><td> * @template THIS, VALUE, RESULT<tr><td><a name="l299" href="#l299">299</a><td> */<tr><td><a name="l300" href="#l300">300</a><td>goog.array.map = goog.NATIVE_ARRAY_PROTOTYPES &&<tr><td><a name="l301" href="#l301">301</a><td> (goog.array.ASSUME_NATIVE_FUNCTIONS ||<tr><td><a name="l302" href="#l302">302</a><td> goog.array.ARRAY_PROTOTYPE_.map) ?<tr><td><a name="l303" href="#l303">303</a><td> function(arr, f, opt_obj) {<tr><td><a name="l304" href="#l304">304</a><td> goog.asserts.assert(arr.length != null);<tr><td><a name="l305" href="#l305">305</a><td><tr><td><a name="l306" href="#l306">306</a><td> return goog.array.ARRAY_PROTOTYPE_.map.call(arr, f, opt_obj);<tr><td><a name="l307" href="#l307">307</a><td> } :<tr><td><a name="l308" href="#l308">308</a><td> function(arr, f, opt_obj) {<tr><td><a name="l309" href="#l309">309</a><td> var l = arr.length; // must be fixed during loop... see docs<tr><td><a name="l310" href="#l310">310</a><td> var res = new Array(l);<tr><td><a name="l311" href="#l311">311</a><td> var arr2 = goog.isString(arr) ? arr.split('') : arr;<tr><td><a name="l312" href="#l312">312</a><td> for (var i = 0; i < l; i++) {<tr><td><a name="l313" href="#l313">313</a><td> if (i in arr2) {<tr><td><a name="l314" href="#l314">314</a><td> res[i] = f.call(opt_obj, arr2[i], i, arr);<tr><td><a name="l315" href="#l315">315</a><td> }<tr><td><a name="l316" href="#l316">316</a><td> }<tr><td><a name="l317" href="#l317">317</a><td> return res;<tr><td><a name="l318" href="#l318">318</a><td> };<tr><td><a name="l319" href="#l319">319</a><td><tr><td><a name="l320" href="#l320">320</a><td><tr><td><a name="l321" href="#l321">321</a><td>/**<tr><td><a name="l322" href="#l322">322</a><td> * Passes every element of an array into a function and accumulates the result.<tr><td><a name="l323" href="#l323">323</a><td> *<tr><td><a name="l324" href="#l324">324</a><td> * See {@link http://tinyurl.com/developer-mozilla-org-array-reduce}<tr><td><a name="l325" href="#l325">325</a><td> *<tr><td><a name="l326" href="#l326">326</a><td> * For example:<tr><td><a name="l327" href="#l327">327</a><td> * var a = [1, 2, 3, 4];<tr><td><a name="l328" href="#l328">328</a><td> * goog.array.reduce(a, function(r, v, i, arr) {return r + v;}, 0);<tr><td><a name="l329" href="#l329">329</a><td> * returns 10<tr><td><a name="l330" href="#l330">330</a><td> *<tr><td><a name="l331" href="#l331">331</a><td> * @param {Array.<T>|goog.array.ArrayLike} arr Array or array<tr><td><a name="l332" href="#l332">332</a><td> * like object over which to iterate.<tr><td><a name="l333" href="#l333">333</a><td> * @param {?function(this:S, R, T, number, ?) : R} f The function to call for<tr><td><a name="l334" href="#l334">334</a><td> * every element. This function<tr><td><a name="l335" href="#l335">335</a><td> * takes 4 arguments (the function's previous result or the initial value,<tr><td><a name="l336" href="#l336">336</a><td> * the value of the current array element, the current array index, and the<tr><td><a name="l337" href="#l337">337</a><td> * array itself)<tr><td><a name="l338" href="#l338">338</a><td> * function(previousValue, currentValue, index, array).<tr><td><a name="l339" href="#l339">339</a><td> * @param {?} val The initial value to pass into the function on the first call.<tr><td><a name="l340" href="#l340">340</a><td> * @param {S=} opt_obj The object to be used as the value of 'this'<tr><td><a name="l341" href="#l341">341</a><td> * within f.<tr><td><a name="l342" href="#l342">342</a><td> * @return {R} Result of evaluating f repeatedly across the values of the array.<tr><td><a name="l343" href="#l343">343</a><td> * @template T,S,R<tr><td><a name="l344" href="#l344">344</a><td> */<tr><td><a name="l345" href="#l345">345</a><td>goog.array.reduce = goog.NATIVE_ARRAY_PROTOTYPES &&<tr><td><a name="l346" href="#l346">346</a><td> (goog.array.ASSUME_NATIVE_FUNCTIONS ||<tr><td><a name="l347" href="#l347">347</a><td> goog.array.ARRAY_PROTOTYPE_.reduce) ?<tr><td><a name="l348" href="#l348">348</a><td> function(arr, f, val, opt_obj) {<tr><td><a name="l349" href="#l349">349</a><td> goog.asserts.assert(arr.length != null);<tr><td><a name="l350" href="#l350">350</a><td> if (opt_obj) {<tr><td><a name="l351" href="#l351">351</a><td> f = goog.bind(f, opt_obj);<tr><td><a name="l352" href="#l352">352</a><td> }<tr><td><a name="l353" href="#l353">353</a><td> return goog.array.ARRAY_PROTOTYPE_.reduce.call(arr, f, val);<tr><td><a name="l354" href="#l354">354</a><td> } :<tr><td><a name="l355" href="#l355">355</a><td> function(arr, f, val, opt_obj) {<tr><td><a name="l356" href="#l356">356</a><td> var rval = val;<tr><td><a name="l357" href="#l357">357</a><td> goog.array.forEach(arr, function(val, index) {<tr><td><a name="l358" href="#l358">358</a><td> rval = f.call(opt_obj, rval, val, index, arr);<tr><td><a name="l359" href="#l359">359</a><td> });<tr><td><a name="l360" href="#l360">360</a><td> return rval;<tr><td><a name="l361" href="#l361">361</a><td> };<tr><td><a name="l362" href="#l362">362</a><td><tr><td><a name="l363" href="#l363">363</a><td><tr><td><a name="l364" href="#l364">364</a><td>/**<tr><td><a name="l365" href="#l365">365</a><td> * Passes every element of an array into a function and accumulates the result,<tr><td><a name="l366" href="#l366">366</a><td> * starting from the last element and working towards the first.<tr><td><a name="l367" href="#l367">367</a><td> *<tr><td><a name="l368" href="#l368">368</a><td> * See {@link http://tinyurl.com/developer-mozilla-org-array-reduceright}<tr><td><a name="l369" href="#l369">369</a><td> *<tr><td><a name="l370" href="#l370">370</a><td> * For example:<tr><td><a name="l371" href="#l371">371</a><td> * var a = ['a', 'b', 'c'];<tr><td><a name="l372" href="#l372">372</a><td> * goog.array.reduceRight(a, function(r, v, i, arr) {return r + v;}, '');<tr><td><a name="l373" href="#l373">373</a><td> * returns 'cba'<tr><td><a name="l374" href="#l374">374</a><td> *<tr><td><a name="l375" href="#l375">375</a><td> * @param {Array.<T>|goog.array.ArrayLike} arr Array or array<tr><td><a name="l376" href="#l376">376</a><td> * like object over which to iterate.<tr><td><a name="l377" href="#l377">377</a><td> * @param {?function(this:S, R, T, number, ?) : R} f The function to call for<tr><td><a name="l378" href="#l378">378</a><td> * every element. This function<tr><td><a name="l379" href="#l379">379</a><td> * takes 4 arguments (the function's previous result or the initial value,<tr><td><a name="l380" href="#l380">380</a><td> * the value of the current array element, the current array index, and the<tr><td><a name="l381" href="#l381">381</a><td> * array itself)<tr><td><a name="l382" href="#l382">382</a><td> * function(previousValue, currentValue, index, array).<tr><td><a name="l383" href="#l383">383</a><td> * @param {?} val The initial value to pass into the function on the first call.<tr><td><a name="l384" href="#l384">384</a><td> * @param {S=} opt_obj The object to be used as the value of 'this'<tr><td><a name="l385" href="#l385">385</a><td> * within f.<tr><td><a name="l386" href="#l386">386</a><td> * @return {R} Object returned as a result of evaluating f repeatedly across the<tr><td><a name="l387" href="#l387">387</a><td> * values of the array.<tr><td><a name="l388" href="#l388">388</a><td> * @template T,S,R<tr><td><a name="l389" href="#l389">389</a><td> */<tr><td><a name="l390" href="#l390">390</a><td>goog.array.reduceRight = goog.NATIVE_ARRAY_PROTOTYPES &&<tr><td><a name="l391" href="#l391">391</a><td> (goog.array.ASSUME_NATIVE_FUNCTIONS ||<tr><td><a name="l392" href="#l392">392</a><td> goog.array.ARRAY_PROTOTYPE_.reduceRight) ?<tr><td><a name="l393" href="#l393">393</a><td> function(arr, f, val, opt_obj) {<tr><td><a name="l394" href="#l394">394</a><td> goog.asserts.assert(arr.length != null);<tr><td><a name="l395" href="#l395">395</a><td> if (opt_obj) {<tr><td><a name="l396" href="#l396">396</a><td> f = goog.bind(f, opt_obj);<tr><td><a name="l397" href="#l397">397</a><td> }<tr><td><a name="l398" href="#l398">398</a><td> return goog.array.ARRAY_PROTOTYPE_.reduceRight.call(arr, f, val);<tr><td><a name="l399" href="#l399">399</a><td> } :<tr><td><a name="l400" href="#l400">400</a><td> function(arr, f, val, opt_obj) {<tr><td><a name="l401" href="#l401">401</a><td> var rval = val;<tr><td><a name="l402" href="#l402">402</a><td> goog.array.forEachRight(arr, function(val, index) {<tr><td><a name="l403" href="#l403">403</a><td> rval = f.call(opt_obj, rval, val, index, arr);<tr><td><a name="l404" href="#l404">404</a><td> });<tr><td><a name="l405" href="#l405">405</a><td> return rval;<tr><td><a name="l406" href="#l406">406</a><td> };<tr><td><a name="l407" href="#l407">407</a><td><tr><td><a name="l408" href="#l408">408</a><td><tr><td><a name="l409" href="#l409">409</a><td>/**<tr><td><a name="l410" href="#l410">410</a><td> * Calls f for each element of an array. If any call returns true, some()<tr><td><a name="l411" href="#l411">411</a><td> * returns true (without checking the remaining elements). If all calls<tr><td><a name="l412" href="#l412">412</a><td> * return false, some() returns false.<tr><td><a name="l413" href="#l413">413</a><td> *<tr><td><a name="l414" href="#l414">414</a><td> * See {@link http://tinyurl.com/developer-mozilla-org-array-some}<tr><td><a name="l415" href="#l415">415</a><td> *<tr><td><a name="l416" href="#l416">416</a><td> * @param {Array.<T>|goog.array.ArrayLike} arr Array or array<tr><td><a name="l417" href="#l417">417</a><td> * like object over which to iterate.<tr><td><a name="l418" href="#l418">418</a><td> * @param {?function(this:S, T, number, ?) : boolean} f The function to call for<tr><td><a name="l419" href="#l419">419</a><td> * for every element. This function takes 3 arguments (the element, the<tr><td><a name="l420" href="#l420">420</a><td> * index and the array) and should return a boolean.<tr><td><a name="l421" href="#l421">421</a><td> * @param {S=} opt_obj The object to be used as the value of 'this'<tr><td><a name="l422" href="#l422">422</a><td> * within f.<tr><td><a name="l423" href="#l423">423</a><td> * @return {boolean} true if any element passes the test.<tr><td><a name="l424" href="#l424">424</a><td> * @template T,S<tr><td><a name="l425" href="#l425">425</a><td> */<tr><td><a name="l426" href="#l426">426</a><td>goog.array.some = goog.NATIVE_ARRAY_PROTOTYPES &&<tr><td><a name="l427" href="#l427">427</a><td> (goog.array.ASSUME_NATIVE_FUNCTIONS ||<tr><td><a name="l428" href="#l428">428</a><td> goog.array.ARRAY_PROTOTYPE_.some) ?<tr><td><a name="l429" href="#l429">429</a><td> function(arr, f, opt_obj) {<tr><td><a name="l430" href="#l430">430</a><td> goog.asserts.assert(arr.length != null);<tr><td><a name="l431" href="#l431">431</a><td><tr><td><a name="l432" href="#l432">432</a><td> return goog.array.ARRAY_PROTOTYPE_.some.call(arr, f, opt_obj);<tr><td><a name="l433" href="#l433">433</a><td> } :<tr><td><a name="l434" href="#l434">434</a><td> function(arr, f, opt_obj) {<tr><td><a name="l435" href="#l435">435</a><td> var l = arr.length; // must be fixed during loop... see docs<tr><td><a name="l436" href="#l436">436</a><td> var arr2 = goog.isString(arr) ? arr.split('') : arr;<tr><td><a name="l437" href="#l437">437</a><td> for (var i = 0; i < l; i++) {<tr><td><a name="l438" href="#l438">438</a><td> if (i in arr2 && f.call(opt_obj, arr2[i], i, arr)) {<tr><td><a name="l439" href="#l439">439</a><td> return true;<tr><td><a name="l440" href="#l440">440</a><td> }<tr><td><a name="l441" href="#l441">441</a><td> }<tr><td><a name="l442" href="#l442">442</a><td> return false;<tr><td><a name="l443" href="#l443">443</a><td> };<tr><td><a name="l444" href="#l444">444</a><td><tr><td><a name="l445" href="#l445">445</a><td><tr><td><a name="l446" href="#l446">446</a><td>/**<tr><td><a name="l447" href="#l447">447</a><td> * Call f for each element of an array. If all calls return true, every()<tr><td><a name="l448" href="#l448">448</a><td> * returns true. If any call returns false, every() returns false and<tr><td><a name="l449" href="#l449">449</a><td> * does not continue to check the remaining elements.<tr><td><a name="l450" href="#l450">450</a><td> *<tr><td><a name="l451" href="#l451">451</a><td> * See {@link http://tinyurl.com/developer-mozilla-org-array-every}<tr><td><a name="l452" href="#l452">452</a><td> *<tr><td><a name="l453" href="#l453">453</a><td> * @param {Array.<T>|goog.array.ArrayLike} arr Array or array<tr><td><a name="l454" href="#l454">454</a><td> * like object over which to iterate.<tr><td><a name="l455" href="#l455">455</a><td> * @param {?function(this:S, T, number, ?) : boolean} f The function to call for<tr><td><a name="l456" href="#l456">456</a><td> * for every element. This function takes 3 arguments (the element, the<tr><td><a name="l457" href="#l457">457</a><td> * index and the array) and should return a boolean.<tr><td><a name="l458" href="#l458">458</a><td> * @param {S=} opt_obj The object to be used as the value of 'this'<tr><td><a name="l459" href="#l459">459</a><td> * within f.<tr><td><a name="l460" href="#l460">460</a><td> * @return {boolean} false if any element fails the test.<tr><td><a name="l461" href="#l461">461</a><td> * @template T,S<tr><td><a name="l462" href="#l462">462</a><td> */<tr><td><a name="l463" href="#l463">463</a><td>goog.array.every = goog.NATIVE_ARRAY_PROTOTYPES &&<tr><td><a name="l464" href="#l464">464</a><td> (goog.array.ASSUME_NATIVE_FUNCTIONS ||<tr><td><a name="l465" href="#l465">465</a><td> goog.array.ARRAY_PROTOTYPE_.every) ?<tr><td><a name="l466" href="#l466">466</a><td> function(arr, f, opt_obj) {<tr><td><a name="l467" href="#l467">467</a><td> goog.asserts.assert(arr.length != null);<tr><td><a name="l468" href="#l468">468</a><td><tr><td><a name="l469" href="#l469">469</a><td> return goog.array.ARRAY_PROTOTYPE_.every.call(arr, f, opt_obj);<tr><td><a name="l470" href="#l470">470</a><td> } :<tr><td><a name="l471" href="#l471">471</a><td> function(arr, f, opt_obj) {<tr><td><a name="l472" href="#l472">472</a><td> var l = arr.length; // must be fixed during loop... see docs<tr><td><a name="l473" href="#l473">473</a><td> var arr2 = goog.isString(arr) ? arr.split('') : arr;<tr><td><a name="l474" href="#l474">474</a><td> for (var i = 0; i < l; i++) {<tr><td><a name="l475" href="#l475">475</a><td> if (i in arr2 && !f.call(opt_obj, arr2[i], i, arr)) {<tr><td><a name="l476" href="#l476">476</a><td> return false;<tr><td><a name="l477" href="#l477">477</a><td> }<tr><td><a name="l478" href="#l478">478</a><td> }<tr><td><a name="l479" href="#l479">479</a><td> return true;<tr><td><a name="l480" href="#l480">480</a><td> };<tr><td><a name="l481" href="#l481">481</a><td><tr><td><a name="l482" href="#l482">482</a><td><tr><td><a name="l483" href="#l483">483</a><td>/**<tr><td><a name="l484" href="#l484">484</a><td> * Counts the array elements that fulfill the predicate, i.e. for which the<tr><td><a name="l485" href="#l485">485</a><td> * callback function returns true. Skips holes in the array.<tr><td><a name="l486" href="#l486">486</a><td> *<tr><td><a name="l487" href="#l487">487</a><td> * @param {!(Array.<T>|goog.array.ArrayLike)} arr Array or array like object<tr><td><a name="l488" href="#l488">488</a><td> * over which to iterate.<tr><td><a name="l489" href="#l489">489</a><td> * @param {function(this: S, T, number, ?): boolean} f The function to call for<tr><td><a name="l490" href="#l490">490</a><td> * every element. Takes 3 arguments (the element, the index and the array).<tr><td><a name="l491" href="#l491">491</a><td> * @param {S=} opt_obj The object to be used as the value of 'this' within f.<tr><td><a name="l492" href="#l492">492</a><td> * @return {number} The number of the matching elements.<tr><td><a name="l493" href="#l493">493</a><td> * @template T,S<tr><td><a name="l494" href="#l494">494</a><td> */<tr><td><a name="l495" href="#l495">495</a><td>goog.array.count = function(arr, f, opt_obj) {<tr><td><a name="l496" href="#l496">496</a><td> var count = 0;<tr><td><a name="l497" href="#l497">497</a><td> goog.array.forEach(arr, function(element, index, arr) {<tr><td><a name="l498" href="#l498">498</a><td> if (f.call(opt_obj, element, index, arr)) {<tr><td><a name="l499" href="#l499">499</a><td> ++count;<tr><td><a name="l500" href="#l500">500</a><td> }<tr><td><a name="l501" href="#l501">501</a><td> }, opt_obj);<tr><td><a name="l502" href="#l502">502</a><td> return count;<tr><td><a name="l503" href="#l503">503</a><td>};<tr><td><a name="l504" href="#l504">504</a><td><tr><td><a name="l505" href="#l505">505</a><td><tr><td><a name="l506" href="#l506">506</a><td>/**<tr><td><a name="l507" href="#l507">507</a><td> * Search an array for the first element that satisfies a given condition and<tr><td><a name="l508" href="#l508">508</a><td> * return that element.<tr><td><a name="l509" href="#l509">509</a><td> * @param {Array.<T>|goog.array.ArrayLike} arr Array or array<tr><td><a name="l510" href="#l510">510</a><td> * like object over which to iterate.<tr><td><a name="l511" href="#l511">511</a><td> * @param {?function(this:S, T, number, ?) : boolean} f The function to call<tr><td><a name="l512" href="#l512">512</a><td> * for every element. This function takes 3 arguments (the element, the<tr><td><a name="l513" href="#l513">513</a><td> * index and the array) and should return a boolean.<tr><td><a name="l514" href="#l514">514</a><td> * @param {S=} opt_obj An optional "this" context for the function.<tr><td><a name="l515" href="#l515">515</a><td> * @return {?T} The first array element that passes the test, or null if no<tr><td><a name="l516" href="#l516">516</a><td> * element is found.<tr><td><a name="l517" href="#l517">517</a><td> * @template T,S<tr><td><a name="l518" href="#l518">518</a><td> */<tr><td><a name="l519" href="#l519">519</a><td>goog.array.find = function(arr, f, opt_obj) {<tr><td><a name="l520" href="#l520">520</a><td> var i = goog.array.findIndex(arr, f, opt_obj);<tr><td><a name="l521" href="#l521">521</a><td> return i < 0 ? null : goog.isString(arr) ? arr.charAt(i) : arr[i];<tr><td><a name="l522" href="#l522">522</a><td>};<tr><td><a name="l523" href="#l523">523</a><td><tr><td><a name="l524" href="#l524">524</a><td><tr><td><a name="l525" href="#l525">525</a><td>/**<tr><td><a name="l526" href="#l526">526</a><td> * Search an array for the first element that satisfies a given condition and<tr><td><a name="l527" href="#l527">527</a><td> * return its index.<tr><td><a name="l528" href="#l528">528</a><td> * @param {Array.<T>|goog.array.ArrayLike} arr Array or array<tr><td><a name="l529" href="#l529">529</a><td> * like object over which to iterate.<tr><td><a name="l530" href="#l530">530</a><td> * @param {?function(this:S, T, number, ?) : boolean} f The function to call for<tr><td><a name="l531" href="#l531">531</a><td> * every element. This function<tr><td><a name="l532" href="#l532">532</a><td> * takes 3 arguments (the element, the index and the array) and should<tr><td><a name="l533" href="#l533">533</a><td> * return a boolean.<tr><td><a name="l534" href="#l534">534</a><td> * @param {S=} opt_obj An optional "this" context for the function.<tr><td><a name="l535" href="#l535">535</a><td> * @return {number} The index of the first array element that passes the test,<tr><td><a name="l536" href="#l536">536</a><td> * or -1 if no element is found.<tr><td><a name="l537" href="#l537">537</a><td> * @template T,S<tr><td><a name="l538" href="#l538">538</a><td> */<tr><td><a name="l539" href="#l539">539</a><td>goog.array.findIndex = function(arr, f, opt_obj) {<tr><td><a name="l540" href="#l540">540</a><td> var l = arr.length; // must be fixed during loop... see docs<tr><td><a name="l541" href="#l541">541</a><td> var arr2 = goog.isString(arr) ? arr.split('') : arr;<tr><td><a name="l542" href="#l542">542</a><td> for (var i = 0; i < l; i++) {<tr><td><a name="l543" href="#l543">543</a><td> if (i in arr2 && f.call(opt_obj, arr2[i], i, arr)) {<tr><td><a name="l544" href="#l544">544</a><td> return i;<tr><td><a name="l545" href="#l545">545</a><td> }<tr><td><a name="l546" href="#l546">546</a><td> }<tr><td><a name="l547" href="#l547">547</a><td> return -1;<tr><td><a name="l548" href="#l548">548</a><td>};<tr><td><a name="l549" href="#l549">549</a><td><tr><td><a name="l550" href="#l550">550</a><td><tr><td><a name="l551" href="#l551">551</a><td>/**<tr><td><a name="l552" href="#l552">552</a><td> * Search an array (in reverse order) for the last element that satisfies a<tr><td><a name="l553" href="#l553">553</a><td> * given condition and return that element.<tr><td><a name="l554" href="#l554">554</a><td> * @param {Array.<T>|goog.array.ArrayLike} arr Array or array<tr><td><a name="l555" href="#l555">555</a><td> * like object over which to iterate.<tr><td><a name="l556" href="#l556">556</a><td> * @param {?function(this:S, T, number, ?) : boolean} f The function to call<tr><td><a name="l557" href="#l557">557</a><td> * for every element. This function<tr><td><a name="l558" href="#l558">558</a><td> * takes 3 arguments (the element, the index and the array) and should<tr><td><a name="l559" href="#l559">559</a><td> * return a boolean.<tr><td><a name="l560" href="#l560">560</a><td> * @param {S=} opt_obj An optional "this" context for the function.<tr><td><a name="l561" href="#l561">561</a><td> * @return {?T} The last array element that passes the test, or null if no<tr><td><a name="l562" href="#l562">562</a><td> * element is found.<tr><td><a name="l563" href="#l563">563</a><td> * @template T,S<tr><td><a name="l564" href="#l564">564</a><td> */<tr><td><a name="l565" href="#l565">565</a><td>goog.array.findRight = function(arr, f, opt_obj) {<tr><td><a name="l566" href="#l566">566</a><td> var i = goog.array.findIndexRight(arr, f, opt_obj);<tr><td><a name="l567" href="#l567">567</a><td> return i < 0 ? null : goog.isString(arr) ? arr.charAt(i) : arr[i];<tr><td><a name="l568" href="#l568">568</a><td>};<tr><td><a name="l569" href="#l569">569</a><td><tr><td><a name="l570" href="#l570">570</a><td><tr><td><a name="l571" href="#l571">571</a><td>/**<tr><td><a name="l572" href="#l572">572</a><td> * Search an array (in reverse order) for the last element that satisfies a<tr><td><a name="l573" href="#l573">573</a><td> * given condition and return its index.<tr><td><a name="l574" href="#l574">574</a><td> * @param {Array.<T>|goog.array.ArrayLike} arr Array or array<tr><td><a name="l575" href="#l575">575</a><td> * like object over which to iterate.<tr><td><a name="l576" href="#l576">576</a><td> * @param {?function(this:S, T, number, ?) : boolean} f The function to call<tr><td><a name="l577" href="#l577">577</a><td> * for every element. This function<tr><td><a name="l578" href="#l578">578</a><td> * takes 3 arguments (the element, the index and the array) and should<tr><td><a name="l579" href="#l579">579</a><td> * return a boolean.<tr><td><a name="l580" href="#l580">580</a><td> * @param {Object=} opt_obj An optional "this" context for the function.<tr><td><a name="l581" href="#l581">581</a><td> * @return {number} The index of the last array element that passes the test,<tr><td><a name="l582" href="#l582">582</a><td> * or -1 if no element is found.<tr><td><a name="l583" href="#l583">583</a><td> * @template T,S<tr><td><a name="l584" href="#l584">584</a><td> */<tr><td><a name="l585" href="#l585">585</a><td>goog.array.findIndexRight = function(arr, f, opt_obj) {<tr><td><a name="l586" href="#l586">586</a><td> var l = arr.length; // must be fixed during loop... see docs<tr><td><a name="l587" href="#l587">587</a><td> var arr2 = goog.isString(arr) ? arr.split('') : arr;<tr><td><a name="l588" href="#l588">588</a><td> for (var i = l - 1; i >= 0; i--) {<tr><td><a name="l589" href="#l589">589</a><td> if (i in arr2 && f.call(opt_obj, arr2[i], i, arr)) {<tr><td><a name="l590" href="#l590">590</a><td> return i;<tr><td><a name="l591" href="#l591">591</a><td> }<tr><td><a name="l592" href="#l592">592</a><td> }<tr><td><a name="l593" href="#l593">593</a><td> return -1;<tr><td><a name="l594" href="#l594">594</a><td>};<tr><td><a name="l595" href="#l595">595</a><td><tr><td><a name="l596" href="#l596">596</a><td><tr><td><a name="l597" href="#l597">597</a><td>/**<tr><td><a name="l598" href="#l598">598</a><td> * Whether the array contains the given object.<tr><td><a name="l599" href="#l599">599</a><td> * @param {goog.array.ArrayLike} arr The array to test for the presence of the<tr><td><a name="l600" href="#l600">600</a><td> * element.<tr><td><a name="l601" href="#l601">601</a><td> * @param {*} obj The object for which to test.<tr><td><a name="l602" href="#l602">602</a><td> * @return {boolean} true if obj is present.<tr><td><a name="l603" href="#l603">603</a><td> */<tr><td><a name="l604" href="#l604">604</a><td>goog.array.contains = function(arr, obj) {<tr><td><a name="l605" href="#l605">605</a><td> return goog.array.indexOf(arr, obj) >= 0;<tr><td><a name="l606" href="#l606">606</a><td>};<tr><td><a name="l607" href="#l607">607</a><td><tr><td><a name="l608" href="#l608">608</a><td><tr><td><a name="l609" href="#l609">609</a><td>/**<tr><td><a name="l610" href="#l610">610</a><td> * Whether the array is empty.<tr><td><a name="l611" href="#l611">611</a><td> * @param {goog.array.ArrayLike} arr The array to test.<tr><td><a name="l612" href="#l612">612</a><td> * @return {boolean} true if empty.<tr><td><a name="l613" href="#l613">613</a><td> */<tr><td><a name="l614" href="#l614">614</a><td>goog.array.isEmpty = function(arr) {<tr><td><a name="l615" href="#l615">615</a><td> return arr.length == 0;<tr><td><a name="l616" href="#l616">616</a><td>};<tr><td><a name="l617" href="#l617">617</a><td><tr><td><a name="l618" href="#l618">618</a><td><tr><td><a name="l619" href="#l619">619</a><td>/**<tr><td><a name="l620" href="#l620">620</a><td> * Clears the array.<tr><td><a name="l621" href="#l621">621</a><td> * @param {goog.array.ArrayLike} arr Array or array like object to clear.<tr><td><a name="l622" href="#l622">622</a><td> */<tr><td><a name="l623" href="#l623">623</a><td>goog.array.clear = function(arr) {<tr><td><a name="l624" href="#l624">624</a><td> // For non real arrays we don't have the magic length so we delete the<tr><td><a name="l625" href="#l625">625</a><td> // indices.<tr><td><a name="l626" href="#l626">626</a><td> if (!goog.isArray(arr)) {<tr><td><a name="l627" href="#l627">627</a><td> for (var i = arr.length - 1; i >= 0; i--) {<tr><td><a name="l628" href="#l628">628</a><td> delete arr[i];<tr><td><a name="l629" href="#l629">629</a><td> }<tr><td><a name="l630" href="#l630">630</a><td> }<tr><td><a name="l631" href="#l631">631</a><td> arr.length = 0;<tr><td><a name="l632" href="#l632">632</a><td>};<tr><td><a name="l633" href="#l633">633</a><td><tr><td><a name="l634" href="#l634">634</a><td><tr><td><a name="l635" href="#l635">635</a><td>/**<tr><td><a name="l636" href="#l636">636</a><td> * Pushes an item into an array, if it's not already in the array.<tr><td><a name="l637" href="#l637">637</a><td> * @param {Array.<T>} arr Array into which to insert the item.<tr><td><a name="l638" href="#l638">638</a><td> * @param {T} obj Value to add.<tr><td><a name="l639" href="#l639">639</a><td> * @template T<tr><td><a name="l640" href="#l640">640</a><td> */<tr><td><a name="l641" href="#l641">641</a><td>goog.array.insert = function(arr, obj) {<tr><td><a name="l642" href="#l642">642</a><td> if (!goog.array.contains(arr, obj)) {<tr><td><a name="l643" href="#l643">643</a><td> arr.push(obj);<tr><td><a name="l644" href="#l644">644</a><td> }<tr><td><a name="l645" href="#l645">645</a><td>};<tr><td><a name="l646" href="#l646">646</a><td><tr><td><a name="l647" href="#l647">647</a><td><tr><td><a name="l648" href="#l648">648</a><td>/**<tr><td><a name="l649" href="#l649">649</a><td> * Inserts an object at the given index of the array.<tr><td><a name="l650" href="#l650">650</a><td> * @param {goog.array.ArrayLike} arr The array to modify.<tr><td><a name="l651" href="#l651">651</a><td> * @param {*} obj The object to insert.<tr><td><a name="l652" href="#l652">652</a><td> * @param {number=} opt_i The index at which to insert the object. If omitted,<tr><td><a name="l653" href="#l653">653</a><td> * treated as 0. A negative index is counted from the end of the array.<tr><td><a name="l654" href="#l654">654</a><td> */<tr><td><a name="l655" href="#l655">655</a><td>goog.array.insertAt = function(arr, obj, opt_i) {<tr><td><a name="l656" href="#l656">656</a><td> goog.array.splice(arr, opt_i, 0, obj);<tr><td><a name="l657" href="#l657">657</a><td>};<tr><td><a name="l658" href="#l658">658</a><td><tr><td><a name="l659" href="#l659">659</a><td><tr><td><a name="l660" href="#l660">660</a><td>/**<tr><td><a name="l661" href="#l661">661</a><td> * Inserts at the given index of the array, all elements of another array.<tr><td><a name="l662" href="#l662">662</a><td> * @param {goog.array.ArrayLike} arr The array to modify.<tr><td><a name="l663" href="#l663">663</a><td> * @param {goog.array.ArrayLike} elementsToAdd The array of elements to add.<tr><td><a name="l664" href="#l664">664</a><td> * @param {number=} opt_i The index at which to insert the object. If omitted,<tr><td><a name="l665" href="#l665">665</a><td> * treated as 0. A negative index is counted from the end of the array.<tr><td><a name="l666" href="#l666">666</a><td> */<tr><td><a name="l667" href="#l667">667</a><td>goog.array.insertArrayAt = function(arr, elementsToAdd, opt_i) {<tr><td><a name="l668" href="#l668">668</a><td> goog.partial(goog.array.splice, arr, opt_i, 0).apply(null, elementsToAdd);<tr><td><a name="l669" href="#l669">669</a><td>};<tr><td><a name="l670" href="#l670">670</a><td><tr><td><a name="l671" href="#l671">671</a><td><tr><td><a name="l672" href="#l672">672</a><td>/**<tr><td><a name="l673" href="#l673">673</a><td> * Inserts an object into an array before a specified object.<tr><td><a name="l674" href="#l674">674</a><td> * @param {Array.<T>} arr The array to modify.<tr><td><a name="l675" href="#l675">675</a><td> * @param {T} obj The object to insert.<tr><td><a name="l676" href="#l676">676</a><td> * @param {T=} opt_obj2 The object before which obj should be inserted. If obj2<tr><td><a name="l677" href="#l677">677</a><td> * is omitted or not found, obj is inserted at the end of the array.<tr><td><a name="l678" href="#l678">678</a><td> * @template T<tr><td><a name="l679" href="#l679">679</a><td> */<tr><td><a name="l680" href="#l680">680</a><td>goog.array.insertBefore = function(arr, obj, opt_obj2) {<tr><td><a name="l681" href="#l681">681</a><td> var i;<tr><td><a name="l682" href="#l682">682</a><td> if (arguments.length == 2 || (i = goog.array.indexOf(arr, opt_obj2)) < 0) {<tr><td><a name="l683" href="#l683">683</a><td> arr.push(obj);<tr><td><a name="l684" href="#l684">684</a><td> } else {<tr><td><a name="l685" href="#l685">685</a><td> goog.array.insertAt(arr, obj, i);<tr><td><a name="l686" href="#l686">686</a><td> }<tr><td><a name="l687" href="#l687">687</a><td>};<tr><td><a name="l688" href="#l688">688</a><td><tr><td><a name="l689" href="#l689">689</a><td><tr><td><a name="l690" href="#l690">690</a><td>/**<tr><td><a name="l691" href="#l691">691</a><td> * Removes the first occurrence of a particular value from an array.<tr><td><a name="l692" href="#l692">692</a><td> * @param {Array.<T>|goog.array.ArrayLike} arr Array from which to remove<tr><td><a name="l693" href="#l693">693</a><td> * value.<tr><td><a name="l694" href="#l694">694</a><td> * @param {T} obj Object to remove.<tr><td><a name="l695" href="#l695">695</a><td> * @return {boolean} True if an element was removed.<tr><td><a name="l696" href="#l696">696</a><td> * @template T<tr><td><a name="l697" href="#l697">697</a><td> */<tr><td><a name="l698" href="#l698">698</a><td>goog.array.remove = function(arr, obj) {<tr><td><a name="l699" href="#l699">699</a><td> var i = goog.array.indexOf(arr, obj);<tr><td><a name="l700" href="#l700">700</a><td> var rv;<tr><td><a name="l701" href="#l701">701</a><td> if ((rv = i >= 0)) {<tr><td><a name="l702" href="#l702">702</a><td> goog.array.removeAt(arr, i);<tr><td><a name="l703" href="#l703">703</a><td> }<tr><td><a name="l704" href="#l704">704</a><td> return rv;<tr><td><a name="l705" href="#l705">705</a><td>};<tr><td><a name="l706" href="#l706">706</a><td><tr><td><a name="l707" href="#l707">707</a><td><tr><td><a name="l708" href="#l708">708</a><td>/**<tr><td><a name="l709" href="#l709">709</a><td> * Removes from an array the element at index i<tr><td><a name="l710" href="#l710">710</a><td> * @param {goog.array.ArrayLike} arr Array or array like object from which to<tr><td><a name="l711" href="#l711">711</a><td> * remove value.<tr><td><a name="l712" href="#l712">712</a><td> * @param {number} i The index to remove.<tr><td><a name="l713" href="#l713">713</a><td> * @return {boolean} True if an element was removed.<tr><td><a name="l714" href="#l714">714</a><td> */<tr><td><a name="l715" href="#l715">715</a><td>goog.array.removeAt = function(arr, i) {<tr><td><a name="l716" href="#l716">716</a><td> goog.asserts.assert(arr.length != null);<tr><td><a name="l717" href="#l717">717</a><td><tr><td><a name="l718" href="#l718">718</a><td> // use generic form of splice<tr><td><a name="l719" href="#l719">719</a><td> // splice returns the removed items and if successful the length of that<tr><td><a name="l720" href="#l720">720</a><td> // will be 1<tr><td><a name="l721" href="#l721">721</a><td> return goog.array.ARRAY_PROTOTYPE_.splice.call(arr, i, 1).length == 1;<tr><td><a name="l722" href="#l722">722</a><td>};<tr><td><a name="l723" href="#l723">723</a><td><tr><td><a name="l724" href="#l724">724</a><td><tr><td><a name="l725" href="#l725">725</a><td>/**<tr><td><a name="l726" href="#l726">726</a><td> * Removes the first value that satisfies the given condition.<tr><td><a name="l727" href="#l727">727</a><td> * @param {Array.<T>|goog.array.ArrayLike} arr Array or array<tr><td><a name="l728" href="#l728">728</a><td> * like object over which to iterate.<tr><td><a name="l729" href="#l729">729</a><td> * @param {?function(this:S, T, number, ?) : boolean} f The function to call<tr><td><a name="l730" href="#l730">730</a><td> * for every element. This function<tr><td><a name="l731" href="#l731">731</a><td> * takes 3 arguments (the element, the index and the array) and should<tr><td><a name="l732" href="#l732">732</a><td> * return a boolean.<tr><td><a name="l733" href="#l733">733</a><td> * @param {S=} opt_obj An optional "this" context for the function.<tr><td><a name="l734" href="#l734">734</a><td> * @return {boolean} True if an element was removed.<tr><td><a name="l735" href="#l735">735</a><td> * @template T,S<tr><td><a name="l736" href="#l736">736</a><td> */<tr><td><a name="l737" href="#l737">737</a><td>goog.array.removeIf = function(arr, f, opt_obj) {<tr><td><a name="l738" href="#l738">738</a><td> var i = goog.array.findIndex(arr, f, opt_obj);<tr><td><a name="l739" href="#l739">739</a><td> if (i >= 0) {<tr><td><a name="l740" href="#l740">740</a><td> goog.array.removeAt(arr, i);<tr><td><a name="l741" href="#l741">741</a><td> return true;<tr><td><a name="l742" href="#l742">742</a><td> }<tr><td><a name="l743" href="#l743">743</a><td> return false;<tr><td><a name="l744" href="#l744">744</a><td>};<tr><td><a name="l745" href="#l745">745</a><td><tr><td><a name="l746" href="#l746">746</a><td><tr><td><a name="l747" href="#l747">747</a><td>/**<tr><td><a name="l748" href="#l748">748</a><td> * Returns a new array that is the result of joining the arguments. If arrays<tr><td><a name="l749" href="#l749">749</a><td> * are passed then their items are added, however, if non-arrays are passed they<tr><td><a name="l750" href="#l750">750</a><td> * will be added to the return array as is.<tr><td><a name="l751" href="#l751">751</a><td> *<tr><td><a name="l752" href="#l752">752</a><td> * Note that ArrayLike objects will be added as is, rather than having their<tr><td><a name="l753" href="#l753">753</a><td> * items added.<tr><td><a name="l754" href="#l754">754</a><td> *<tr><td><a name="l755" href="#l755">755</a><td> * goog.array.concat([1, 2], [3, 4]) -> [1, 2, 3, 4]<tr><td><a name="l756" href="#l756">756</a><td> * goog.array.concat(0, [1, 2]) -> [0, 1, 2]<tr><td><a name="l757" href="#l757">757</a><td> * goog.array.concat([1, 2], null) -> [1, 2, null]<tr><td><a name="l758" href="#l758">758</a><td> *<tr><td><a name="l759" href="#l759">759</a><td> * There is bug in all current versions of IE (6, 7 and 8) where arrays created<tr><td><a name="l760" href="#l760">760</a><td> * in an iframe become corrupted soon (not immediately) after the iframe is<tr><td><a name="l761" href="#l761">761</a><td> * destroyed. This is common if loading data via goog.net.IframeIo, for example.<tr><td><a name="l762" href="#l762">762</a><td> * This corruption only affects the concat method which will start throwing<tr><td><a name="l763" href="#l763">763</a><td> * Catastrophic Errors (#-2147418113).<tr><td><a name="l764" href="#l764">764</a><td> *<tr><td><a name="l765" href="#l765">765</a><td> * See http://endoflow.com/scratch/corrupted-arrays.html for a test case.<tr><td><a name="l766" href="#l766">766</a><td> *<tr><td><a name="l767" href="#l767">767</a><td> * Internally goog.array should use this, so that all methods will continue to<tr><td><a name="l768" href="#l768">768</a><td> * work on these broken array objects.<tr><td><a name="l769" href="#l769">769</a><td> *<tr><td><a name="l770" href="#l770">770</a><td> * @param {...*} var_args Items to concatenate. Arrays will have each item<tr><td><a name="l771" href="#l771">771</a><td> * added, while primitives and objects will be added as is.<tr><td><a name="l772" href="#l772">772</a><td> * @return {!Array} The new resultant array.<tr><td><a name="l773" href="#l773">773</a><td> */<tr><td><a name="l774" href="#l774">774</a><td>goog.array.concat = function(var_args) {<tr><td><a name="l775" href="#l775">775</a><td> return goog.array.ARRAY_PROTOTYPE_.concat.apply(<tr><td><a name="l776" href="#l776">776</a><td> goog.array.ARRAY_PROTOTYPE_, arguments);<tr><td><a name="l777" href="#l777">777</a><td>};<tr><td><a name="l778" href="#l778">778</a><td><tr><td><a name="l779" href="#l779">779</a><td><tr><td><a name="l780" href="#l780">780</a><td>/**<tr><td><a name="l781" href="#l781">781</a><td> * Returns a new array that contains the contents of all the arrays passed.<tr><td><a name="l782" href="#l782">782</a><td> * @param {...!Array.<T>} var_args<tr><td><a name="l783" href="#l783">783</a><td> * @return {!Array.<T>}<tr><td><a name="l784" href="#l784">784</a><td> * @template T<tr><td><a name="l785" href="#l785">785</a><td> */<tr><td><a name="l786" href="#l786">786</a><td>goog.array.join = function(var_args) {<tr><td><a name="l787" href="#l787">787</a><td> return goog.array.ARRAY_PROTOTYPE_.concat.apply(<tr><td><a name="l788" href="#l788">788</a><td> goog.array.ARRAY_PROTOTYPE_, arguments);<tr><td><a name="l789" href="#l789">789</a><td>};<tr><td><a name="l790" href="#l790">790</a><td><tr><td><a name="l791" href="#l791">791</a><td><tr><td><a name="l792" href="#l792">792</a><td>/**<tr><td><a name="l793" href="#l793">793</a><td> * Converts an object to an array.<tr><td><a name="l794" href="#l794">794</a><td> * @param {Array.<T>|goog.array.ArrayLike} object The object to convert to an<tr><td><a name="l795" href="#l795">795</a><td> * array.<tr><td><a name="l796" href="#l796">796</a><td> * @return {!Array.<T>} The object converted into an array. If object has a<tr><td><a name="l797" href="#l797">797</a><td> * length property, every property indexed with a non-negative number<tr><td><a name="l798" href="#l798">798</a><td> * less than length will be included in the result. If object does not<tr><td><a name="l799" href="#l799">799</a><td> * have a length property, an empty array will be returned.<tr><td><a name="l800" href="#l800">800</a><td> * @template T<tr><td><a name="l801" href="#l801">801</a><td> */<tr><td><a name="l802" href="#l802">802</a><td>goog.array.toArray = function(object) {<tr><td><a name="l803" href="#l803">803</a><td> var length = object.length;<tr><td><a name="l804" href="#l804">804</a><td><tr><td><a name="l805" href="#l805">805</a><td> // If length is not a number the following it false. This case is kept for<tr><td><a name="l806" href="#l806">806</a><td> // backwards compatibility since there are callers that pass objects that are<tr><td><a name="l807" href="#l807">807</a><td> // not array like.<tr><td><a name="l808" href="#l808">808</a><td> if (length > 0) {<tr><td><a name="l809" href="#l809">809</a><td> var rv = new Array(length);<tr><td><a name="l810" href="#l810">810</a><td> for (var i = 0; i < length; i++) {<tr><td><a name="l811" href="#l811">811</a><td> rv[i] = object[i];<tr><td><a name="l812" href="#l812">812</a><td> }<tr><td><a name="l813" href="#l813">813</a><td> return rv;<tr><td><a name="l814" href="#l814">814</a><td> }<tr><td><a name="l815" href="#l815">815</a><td> return [];<tr><td><a name="l816" href="#l816">816</a><td>};<tr><td><a name="l817" href="#l817">817</a><td><tr><td><a name="l818" href="#l818">818</a><td><tr><td><a name="l819" href="#l819">819</a><td>/**<tr><td><a name="l820" href="#l820">820</a><td> * Does a shallow copy of an array.<tr><td><a name="l821" href="#l821">821</a><td> * @param {Array.<T>|goog.array.ArrayLike} arr Array or array-like object to<tr><td><a name="l822" href="#l822">822</a><td> * clone.<tr><td><a name="l823" href="#l823">823</a><td> * @return {!Array.<T>} Clone of the input array.<tr><td><a name="l824" href="#l824">824</a><td> * @template T<tr><td><a name="l825" href="#l825">825</a><td> */<tr><td><a name="l826" href="#l826">826</a><td>goog.array.clone = goog.array.toArray;<tr><td><a name="l827" href="#l827">827</a><td><tr><td><a name="l828" href="#l828">828</a><td><tr><td><a name="l829" href="#l829">829</a><td>/**<tr><td><a name="l830" href="#l830">830</a><td> * Extends an array with another array, element, or "array like" object.<tr><td><a name="l831" href="#l831">831</a><td> * This function operates 'in-place', it does not create a new Array.<tr><td><a name="l832" href="#l832">832</a><td> *<tr><td><a name="l833" href="#l833">833</a><td> * Example:<tr><td><a name="l834" href="#l834">834</a><td> * var a = [];<tr><td><a name="l835" href="#l835">835</a><td> * goog.array.extend(a, [0, 1]);<tr><td><a name="l836" href="#l836">836</a><td> * a; // [0, 1]<tr><td><a name="l837" href="#l837">837</a><td> * goog.array.extend(a, 2);<tr><td><a name="l838" href="#l838">838</a><td> * a; // [0, 1, 2]<tr><td><a name="l839" href="#l839">839</a><td> *<tr><td><a name="l840" href="#l840">840</a><td> * @param {Array.<VALUE>} arr1 The array to modify.<tr><td><a name="l841" href="#l841">841</a><td> * @param {...(Array.<VALUE>|VALUE)} var_args The elements or arrays of elements<tr><td><a name="l842" href="#l842">842</a><td> * to add to arr1.<tr><td><a name="l843" href="#l843">843</a><td> * @template VALUE<tr><td><a name="l844" href="#l844">844</a><td> */<tr><td><a name="l845" href="#l845">845</a><td>goog.array.extend = function(arr1, var_args) {<tr><td><a name="l846" href="#l846">846</a><td> for (var i = 1; i < arguments.length; i++) {<tr><td><a name="l847" href="#l847">847</a><td> var arr2 = arguments[i];<tr><td><a name="l848" href="#l848">848</a><td> // If we have an Array or an Arguments object we can just call push<tr><td><a name="l849" href="#l849">849</a><td> // directly.<tr><td><a name="l850" href="#l850">850</a><td> var isArrayLike;<tr><td><a name="l851" href="#l851">851</a><td> if (goog.isArray(arr2) ||<tr><td><a name="l852" href="#l852">852</a><td> // Detect Arguments. ES5 says that the [[Class]] of an Arguments object<tr><td><a name="l853" href="#l853">853</a><td> // is "Arguments" but only V8 and JSC/Safari gets this right. We instead<tr><td><a name="l854" href="#l854">854</a><td> // detect Arguments by checking for array like and presence of "callee".<tr><td><a name="l855" href="#l855">855</a><td> (isArrayLike = goog.isArrayLike(arr2)) &&<tr><td><a name="l856" href="#l856">856</a><td> // The getter for callee throws an exception in strict mode<tr><td><a name="l857" href="#l857">857</a><td> // according to section 10.6 in ES5 so check for presence instead.<tr><td><a name="l858" href="#l858">858</a><td> Object.prototype.hasOwnProperty.call(arr2, 'callee')) {<tr><td><a name="l859" href="#l859">859</a><td> arr1.push.apply(arr1, arr2);<tr><td><a name="l860" href="#l860">860</a><td> } else if (isArrayLike) {<tr><td><a name="l861" href="#l861">861</a><td> // Otherwise loop over arr2 to prevent copying the object.<tr><td><a name="l862" href="#l862">862</a><td> var len1 = arr1.length;<tr><td><a name="l863" href="#l863">863</a><td> var len2 = arr2.length;<tr><td><a name="l864" href="#l864">864</a><td> for (var j = 0; j < len2; j++) {<tr><td><a name="l865" href="#l865">865</a><td> arr1[len1 + j] = arr2[j];<tr><td><a name="l866" href="#l866">866</a><td> }<tr><td><a name="l867" href="#l867">867</a><td> } else {<tr><td><a name="l868" href="#l868">868</a><td> arr1.push(arr2);<tr><td><a name="l869" href="#l869">869</a><td> }<tr><td><a name="l870" href="#l870">870</a><td> }<tr><td><a name="l871" href="#l871">871</a><td>};<tr><td><a name="l872" href="#l872">872</a><td><tr><td><a name="l873" href="#l873">873</a><td><tr><td><a name="l874" href="#l874">874</a><td>/**<tr><td><a name="l875" href="#l875">875</a><td> * Adds or removes elements from an array. This is a generic version of Array<tr><td><a name="l876" href="#l876">876</a><td> * splice. This means that it might work on other objects similar to arrays,<tr><td><a name="l877" href="#l877">877</a><td> * such as the arguments object.<tr><td><a name="l878" href="#l878">878</a><td> *<tr><td><a name="l879" href="#l879">879</a><td> * @param {Array.<T>|goog.array.ArrayLike} arr The array to modify.<tr><td><a name="l880" href="#l880">880</a><td> * @param {number|undefined} index The index at which to start changing the<tr><td><a name="l881" href="#l881">881</a><td> * array. If not defined, treated as 0.<tr><td><a name="l882" href="#l882">882</a><td> * @param {number} howMany How many elements to remove (0 means no removal. A<tr><td><a name="l883" href="#l883">883</a><td> * value below 0 is treated as zero and so is any other non number. Numbers<tr><td><a name="l884" href="#l884">884</a><td> * are floored).<tr><td><a name="l885" href="#l885">885</a><td> * @param {...T} var_args Optional, additional elements to insert into the<tr><td><a name="l886" href="#l886">886</a><td> * array.<tr><td><a name="l887" href="#l887">887</a><td> * @return {!Array.<T>} the removed elements.<tr><td><a name="l888" href="#l888">888</a><td> * @template T<tr><td><a name="l889" href="#l889">889</a><td> */<tr><td><a name="l890" href="#l890">890</a><td>goog.array.splice = function(arr, index, howMany, var_args) {<tr><td><a name="l891" href="#l891">891</a><td> goog.asserts.assert(arr.length != null);<tr><td><a name="l892" href="#l892">892</a><td><tr><td><a name="l893" href="#l893">893</a><td> return goog.array.ARRAY_PROTOTYPE_.splice.apply(<tr><td><a name="l894" href="#l894">894</a><td> arr, goog.array.slice(arguments, 1));<tr><td><a name="l895" href="#l895">895</a><td>};<tr><td><a name="l896" href="#l896">896</a><td><tr><td><a name="l897" href="#l897">897</a><td><tr><td><a name="l898" href="#l898">898</a><td>/**<tr><td><a name="l899" href="#l899">899</a><td> * Returns a new array from a segment of an array. This is a generic version of<tr><td><a name="l900" href="#l900">900</a><td> * Array slice. This means that it might work on other objects similar to<tr><td><a name="l901" href="#l901">901</a><td> * arrays, such as the arguments object.<tr><td><a name="l902" href="#l902">902</a><td> *<tr><td><a name="l903" href="#l903">903</a><td> * @param {Array.<T>|goog.array.ArrayLike} arr The array from<tr><td><a name="l904" href="#l904">904</a><td> * which to copy a segment.<tr><td><a name="l905" href="#l905">905</a><td> * @param {number} start The index of the first element to copy.<tr><td><a name="l906" href="#l906">906</a><td> * @param {number=} opt_end The index after the last element to copy.<tr><td><a name="l907" href="#l907">907</a><td> * @return {!Array.<T>} A new array containing the specified segment of the<tr><td><a name="l908" href="#l908">908</a><td> * original array.<tr><td><a name="l909" href="#l909">909</a><td> * @template T<tr><td><a name="l910" href="#l910">910</a><td> */<tr><td><a name="l911" href="#l911">911</a><td>goog.array.slice = function(arr, start, opt_end) {<tr><td><a name="l912" href="#l912">912</a><td> goog.asserts.assert(arr.length != null);<tr><td><a name="l913" href="#l913">913</a><td><tr><td><a name="l914" href="#l914">914</a><td> // passing 1 arg to slice is not the same as passing 2 where the second is<tr><td><a name="l915" href="#l915">915</a><td> // null or undefined (in that case the second argument is treated as 0).<tr><td><a name="l916" href="#l916">916</a><td> // we could use slice on the arguments object and then use apply instead of<tr><td><a name="l917" href="#l917">917</a><td> // testing the length<tr><td><a name="l918" href="#l918">918</a><td> if (arguments.length <= 2) {<tr><td><a name="l919" href="#l919">919</a><td> return goog.array.ARRAY_PROTOTYPE_.slice.call(arr, start);<tr><td><a name="l920" href="#l920">920</a><td> } else {<tr><td><a name="l921" href="#l921">921</a><td> return goog.array.ARRAY_PROTOTYPE_.slice.call(arr, start, opt_end);<tr><td><a name="l922" href="#l922">922</a><td> }<tr><td><a name="l923" href="#l923">923</a><td>};<tr><td><a name="l924" href="#l924">924</a><td><tr><td><a name="l925" href="#l925">925</a><td><tr><td><a name="l926" href="#l926">926</a><td>/**<tr><td><a name="l927" href="#l927">927</a><td> * Removes all duplicates from an array (retaining only the first<tr><td><a name="l928" href="#l928">928</a><td> * occurrence of each array element). This function modifies the<tr><td><a name="l929" href="#l929">929</a><td> * array in place and doesn't change the order of the non-duplicate items.<tr><td><a name="l930" href="#l930">930</a><td> *<tr><td><a name="l931" href="#l931">931</a><td> * For objects, duplicates are identified as having the same unique ID as<tr><td><a name="l932" href="#l932">932</a><td> * defined by {@link goog.getUid}.<tr><td><a name="l933" href="#l933">933</a><td> *<tr><td><a name="l934" href="#l934">934</a><td> * Alternatively you can specify a custom hash function that returns a unique<tr><td><a name="l935" href="#l935">935</a><td> * value for each item in the array it should consider unique.<tr><td><a name="l936" href="#l936">936</a><td> *<tr><td><a name="l937" href="#l937">937</a><td> * Runtime: N,<tr><td><a name="l938" href="#l938">938</a><td> * Worstcase space: 2N (no dupes)<tr><td><a name="l939" href="#l939">939</a><td> *<tr><td><a name="l940" href="#l940">940</a><td> * @param {Array.<T>|goog.array.ArrayLike} arr The array from which to remove<tr><td><a name="l941" href="#l941">941</a><td> * duplicates.<tr><td><a name="l942" href="#l942">942</a><td> * @param {Array=} opt_rv An optional array in which to return the results,<tr><td><a name="l943" href="#l943">943</a><td> * instead of performing the removal inplace. If specified, the original<tr><td><a name="l944" href="#l944">944</a><td> * array will remain unchanged.<tr><td><a name="l945" href="#l945">945</a><td> * @param {function(T):string=} opt_hashFn An optional function to use to<tr><td><a name="l946" href="#l946">946</a><td> * apply to every item in the array. This function should return a unique<tr><td><a name="l947" href="#l947">947</a><td> * value for each item in the array it should consider unique.<tr><td><a name="l948" href="#l948">948</a><td> * @template T<tr><td><a name="l949" href="#l949">949</a><td> */<tr><td><a name="l950" href="#l950">950</a><td>goog.array.removeDuplicates = function(arr, opt_rv, opt_hashFn) {<tr><td><a name="l951" href="#l951">951</a><td> var returnArray = opt_rv || arr;<tr><td><a name="l952" href="#l952">952</a><td> var defaultHashFn = function(item) {<tr><td><a name="l953" href="#l953">953</a><td> // Prefix each type with a single character representing the type to<tr><td><a name="l954" href="#l954">954</a><td> // prevent conflicting keys (e.g. true and 'true').<tr><td><a name="l955" href="#l955">955</a><td> return goog.isObject(current) ? 'o' + goog.getUid(current) :<tr><td><a name="l956" href="#l956">956</a><td> (typeof current).charAt(0) + current;<tr><td><a name="l957" href="#l957">957</a><td> };<tr><td><a name="l958" href="#l958">958</a><td> var hashFn = opt_hashFn || defaultHashFn;<tr><td><a name="l959" href="#l959">959</a><td><tr><td><a name="l960" href="#l960">960</a><td> var seen = {}, cursorInsert = 0, cursorRead = 0;<tr><td><a name="l961" href="#l961">961</a><td> while (cursorRead < arr.length) {<tr><td><a name="l962" href="#l962">962</a><td> var current = arr[cursorRead++];<tr><td><a name="l963" href="#l963">963</a><td> var key = hashFn(current);<tr><td><a name="l964" href="#l964">964</a><td> if (!Object.prototype.hasOwnProperty.call(seen, key)) {<tr><td><a name="l965" href="#l965">965</a><td> seen[key] = true;<tr><td><a name="l966" href="#l966">966</a><td> returnArray[cursorInsert++] = current;<tr><td><a name="l967" href="#l967">967</a><td> }<tr><td><a name="l968" href="#l968">968</a><td> }<tr><td><a name="l969" href="#l969">969</a><td> returnArray.length = cursorInsert;<tr><td><a name="l970" href="#l970">970</a><td>};<tr><td><a name="l971" href="#l971">971</a><td><tr><td><a name="l972" href="#l972">972</a><td><tr><td><a name="l973" href="#l973">973</a><td>/**<tr><td><a name="l974" href="#l974">974</a><td> * Searches the specified array for the specified target using the binary<tr><td><a name="l975" href="#l975">975</a><td> * search algorithm. If no opt_compareFn is specified, elements are compared<tr><td><a name="l976" href="#l976">976</a><td> * using <code>goog.array.defaultCompare</code>, which compares the elements<tr><td><a name="l977" href="#l977">977</a><td> * using the built in < and > operators. This will produce the expected<tr><td><a name="l978" href="#l978">978</a><td> * behavior for homogeneous arrays of String(s) and Number(s). The array<tr><td><a name="l979" href="#l979">979</a><td> * specified <b>must</b> be sorted in ascending order (as defined by the<tr><td><a name="l980" href="#l980">980</a><td> * comparison function). If the array is not sorted, results are undefined.<tr><td><a name="l981" href="#l981">981</a><td> * If the array contains multiple instances of the specified target value, any<tr><td><a name="l982" href="#l982">982</a><td> * of these instances may be found.<tr><td><a name="l983" href="#l983">983</a><td> *<tr><td><a name="l984" href="#l984">984</a><td> * Runtime: O(log n)<tr><td><a name="l985" href="#l985">985</a><td> *<tr><td><a name="l986" href="#l986">986</a><td> * @param {Array.<VALUE>|goog.array.ArrayLike} arr The array to be searched.<tr><td><a name="l987" href="#l987">987</a><td> * @param {TARGET} target The sought value.<tr><td><a name="l988" href="#l988">988</a><td> * @param {function(TARGET, VALUE): number=} opt_compareFn Optional comparison<tr><td><a name="l989" href="#l989">989</a><td> * function by which the array is ordered. Should take 2 arguments to<tr><td><a name="l990" href="#l990">990</a><td> * compare, and return a negative number, zero, or a positive number<tr><td><a name="l991" href="#l991">991</a><td> * depending on whether the first argument is less than, equal to, or<tr><td><a name="l992" href="#l992">992</a><td> * greater than the second.<tr><td><a name="l993" href="#l993">993</a><td> * @return {number} Lowest index of the target value if found, otherwise<tr><td><a name="l994" href="#l994">994</a><td> * (-(insertion point) - 1). The insertion point is where the value should<tr><td><a name="l995" href="#l995">995</a><td> * be inserted into arr to preserve the sorted property. Return value >= 0<tr><td><a name="l996" href="#l996">996</a><td> * iff target is found.<tr><td><a name="l997" href="#l997">997</a><td> * @template TARGET, VALUE<tr><td><a name="l998" href="#l998">998</a><td> */<tr><td><a name="l999" href="#l999">999</a><td>goog.array.binarySearch = function(arr, target, opt_compareFn) {<tr><td><a name="l1000" href="#l1000">1000</a><td> return goog.array.binarySearch_(arr,<tr><td><a name="l1001" href="#l1001">1001</a><td> opt_compareFn || goog.array.defaultCompare, false /* isEvaluator */,<tr><td><a name="l1002" href="#l1002">1002</a><td> target);<tr><td><a name="l1003" href="#l1003">1003</a><td>};<tr><td><a name="l1004" href="#l1004">1004</a><td><tr><td><a name="l1005" href="#l1005">1005</a><td><tr><td><a name="l1006" href="#l1006">1006</a><td>/**<tr><td><a name="l1007" href="#l1007">1007</a><td> * Selects an index in the specified array using the binary search algorithm.<tr><td><a name="l1008" href="#l1008">1008</a><td> * The evaluator receives an element and determines whether the desired index<tr><td><a name="l1009" href="#l1009">1009</a><td> * is before, at, or after it. The evaluator must be consistent (formally,<tr><td><a name="l1010" href="#l1010">1010</a><td> * goog.array.map(goog.array.map(arr, evaluator, opt_obj), goog.math.sign)<tr><td><a name="l1011" href="#l1011">1011</a><td> * must be monotonically non-increasing).<tr><td><a name="l1012" href="#l1012">1012</a><td> *<tr><td><a name="l1013" href="#l1013">1013</a><td> * Runtime: O(log n)<tr><td><a name="l1014" href="#l1014">1014</a><td> *<tr><td><a name="l1015" href="#l1015">1015</a><td> * @param {Array.<VALUE>|goog.array.ArrayLike} arr The array to be searched.<tr><td><a name="l1016" href="#l1016">1016</a><td> * @param {function(this:THIS, VALUE, number, ?): number} evaluator<tr><td><a name="l1017" href="#l1017">1017</a><td> * Evaluator function that receives 3 arguments (the element, the index and<tr><td><a name="l1018" href="#l1018">1018</a><td> * the array). Should return a negative number, zero, or a positive number<tr><td><a name="l1019" href="#l1019">1019</a><td> * depending on whether the desired index is before, at, or after the<tr><td><a name="l1020" href="#l1020">1020</a><td> * element passed to it.<tr><td><a name="l1021" href="#l1021">1021</a><td> * @param {THIS=} opt_obj The object to be used as the value of 'this'<tr><td><a name="l1022" href="#l1022">1022</a><td> * within evaluator.<tr><td><a name="l1023" href="#l1023">1023</a><td> * @return {number} Index of the leftmost element matched by the evaluator, if<tr><td><a name="l1024" href="#l1024">1024</a><td> * such exists; otherwise (-(insertion point) - 1). The insertion point is<tr><td><a name="l1025" href="#l1025">1025</a><td> * the index of the first element for which the evaluator returns negative,<tr><td><a name="l1026" href="#l1026">1026</a><td> * or arr.length if no such element exists. The return value is non-negative<tr><td><a name="l1027" href="#l1027">1027</a><td> * iff a match is found.<tr><td><a name="l1028" href="#l1028">1028</a><td> * @template THIS, VALUE<tr><td><a name="l1029" href="#l1029">1029</a><td> */<tr><td><a name="l1030" href="#l1030">1030</a><td>goog.array.binarySelect = function(arr, evaluator, opt_obj) {<tr><td><a name="l1031" href="#l1031">1031</a><td> return goog.array.binarySearch_(arr, evaluator, true /* isEvaluator */,<tr><td><a name="l1032" href="#l1032">1032</a><td> undefined /* opt_target */, opt_obj);<tr><td><a name="l1033" href="#l1033">1033</a><td>};<tr><td><a name="l1034" href="#l1034">1034</a><td><tr><td><a name="l1035" href="#l1035">1035</a><td><tr><td><a name="l1036" href="#l1036">1036</a><td>/**<tr><td><a name="l1037" href="#l1037">1037</a><td> * Implementation of a binary search algorithm which knows how to use both<tr><td><a name="l1038" href="#l1038">1038</a><td> * comparison functions and evaluators. If an evaluator is provided, will call<tr><td><a name="l1039" href="#l1039">1039</a><td> * the evaluator with the given optional data object, conforming to the<tr><td><a name="l1040" href="#l1040">1040</a><td> * interface defined in binarySelect. Otherwise, if a comparison function is<tr><td><a name="l1041" href="#l1041">1041</a><td> * provided, will call the comparison function against the given data object.<tr><td><a name="l1042" href="#l1042">1042</a><td> *<tr><td><a name="l1043" href="#l1043">1043</a><td> * This implementation purposefully does not use goog.bind or goog.partial for<tr><td><a name="l1044" href="#l1044">1044</a><td> * performance reasons.<tr><td><a name="l1045" href="#l1045">1045</a><td> *<tr><td><a name="l1046" href="#l1046">1046</a><td> * Runtime: O(log n)<tr><td><a name="l1047" href="#l1047">1047</a><td> *<tr><td><a name="l1048" href="#l1048">1048</a><td> * @param {Array.<VALUE>|goog.array.ArrayLike} arr The array to be searched.<tr><td><a name="l1049" href="#l1049">1049</a><td> * @param {function(TARGET, VALUE): number|<tr><td><a name="l1050" href="#l1050">1050</a><td> * function(this:THIS, VALUE, number, ?): number} compareFn Either an<tr><td><a name="l1051" href="#l1051">1051</a><td> * evaluator or a comparison function, as defined by binarySearch<tr><td><a name="l1052" href="#l1052">1052</a><td> * and binarySelect above.<tr><td><a name="l1053" href="#l1053">1053</a><td> * @param {boolean} isEvaluator Whether the function is an evaluator or a<tr><td><a name="l1054" href="#l1054">1054</a><td> * comparison function.<tr><td><a name="l1055" href="#l1055">1055</a><td> * @param {TARGET=} opt_target If the function is a comparison function, then<tr><td><a name="l1056" href="#l1056">1056</a><td> * this is the target to binary search for.<tr><td><a name="l1057" href="#l1057">1057</a><td> * @param {THIS=} opt_selfObj If the function is an evaluator, this is an<tr><td><a name="l1058" href="#l1058">1058</a><td> * optional this object for the evaluator.<tr><td><a name="l1059" href="#l1059">1059</a><td> * @return {number} Lowest index of the target value if found, otherwise<tr><td><a name="l1060" href="#l1060">1060</a><td> * (-(insertion point) - 1). The insertion point is where the value should<tr><td><a name="l1061" href="#l1061">1061</a><td> * be inserted into arr to preserve the sorted property. Return value >= 0<tr><td><a name="l1062" href="#l1062">1062</a><td> * iff target is found.<tr><td><a name="l1063" href="#l1063">1063</a><td> * @template THIS, VALUE, TARGET<tr><td><a name="l1064" href="#l1064">1064</a><td> * @private<tr><td><a name="l1065" href="#l1065">1065</a><td> */<tr><td><a name="l1066" href="#l1066">1066</a><td>goog.array.binarySearch_ = function(arr, compareFn, isEvaluator, opt_target,<tr><td><a name="l1067" href="#l1067">1067</a><td> opt_selfObj) {<tr><td><a name="l1068" href="#l1068">1068</a><td> var left = 0; // inclusive<tr><td><a name="l1069" href="#l1069">1069</a><td> var right = arr.length; // exclusive<tr><td><a name="l1070" href="#l1070">1070</a><td> var found;<tr><td><a name="l1071" href="#l1071">1071</a><td> while (left < right) {<tr><td><a name="l1072" href="#l1072">1072</a><td> var middle = (left + right) >> 1;<tr><td><a name="l1073" href="#l1073">1073</a><td> var compareResult;<tr><td><a name="l1074" href="#l1074">1074</a><td> if (isEvaluator) {<tr><td><a name="l1075" href="#l1075">1075</a><td> compareResult = compareFn.call(opt_selfObj, arr[middle], middle, arr);<tr><td><a name="l1076" href="#l1076">1076</a><td> } else {<tr><td><a name="l1077" href="#l1077">1077</a><td> compareResult = compareFn(opt_target, arr[middle]);<tr><td><a name="l1078" href="#l1078">1078</a><td> }<tr><td><a name="l1079" href="#l1079">1079</a><td> if (compareResult > 0) {<tr><td><a name="l1080" href="#l1080">1080</a><td> left = middle + 1;<tr><td><a name="l1081" href="#l1081">1081</a><td> } else {<tr><td><a name="l1082" href="#l1082">1082</a><td> right = middle;<tr><td><a name="l1083" href="#l1083">1083</a><td> // We are looking for the lowest index so we can't return immediately.<tr><td><a name="l1084" href="#l1084">1084</a><td> found = !compareResult;<tr><td><a name="l1085" href="#l1085">1085</a><td> }<tr><td><a name="l1086" href="#l1086">1086</a><td> }<tr><td><a name="l1087" href="#l1087">1087</a><td> // left is the index if found, or the insertion point otherwise.<tr><td><a name="l1088" href="#l1088">1088</a><td> // ~left is a shorthand for -left - 1.<tr><td><a name="l1089" href="#l1089">1089</a><td> return found ? left : ~left;<tr><td><a name="l1090" href="#l1090">1090</a><td>};<tr><td><a name="l1091" href="#l1091">1091</a><td><tr><td><a name="l1092" href="#l1092">1092</a><td><tr><td><a name="l1093" href="#l1093">1093</a><td>/**<tr><td><a name="l1094" href="#l1094">1094</a><td> * Sorts the specified array into ascending order. If no opt_compareFn is<tr><td><a name="l1095" href="#l1095">1095</a><td> * specified, elements are compared using<tr><td><a name="l1096" href="#l1096">1096</a><td> * <code>goog.array.defaultCompare</code>, which compares the elements using<tr><td><a name="l1097" href="#l1097">1097</a><td> * the built in < and > operators. This will produce the expected behavior<tr><td><a name="l1098" href="#l1098">1098</a><td> * for homogeneous arrays of String(s) and Number(s), unlike the native sort,<tr><td><a name="l1099" href="#l1099">1099</a><td> * but will give unpredictable results for heterogenous lists of strings and<tr><td><a name="l1100" href="#l1100">1100</a><td> * numbers with different numbers of digits.<tr><td><a name="l1101" href="#l1101">1101</a><td> *<tr><td><a name="l1102" href="#l1102">1102</a><td> * This sort is not guaranteed to be stable.<tr><td><a name="l1103" href="#l1103">1103</a><td> *<tr><td><a name="l1104" href="#l1104">1104</a><td> * Runtime: Same as <code>Array.prototype.sort</code><tr><td><a name="l1105" href="#l1105">1105</a><td> *<tr><td><a name="l1106" href="#l1106">1106</a><td> * @param {Array.<T>} arr The array to be sorted.<tr><td><a name="l1107" href="#l1107">1107</a><td> * @param {?function(T,T):number=} opt_compareFn Optional comparison<tr><td><a name="l1108" href="#l1108">1108</a><td> * function by which the<tr><td><a name="l1109" href="#l1109">1109</a><td> * array is to be ordered. Should take 2 arguments to compare, and return a<tr><td><a name="l1110" href="#l1110">1110</a><td> * negative number, zero, or a positive number depending on whether the<tr><td><a name="l1111" href="#l1111">1111</a><td> * first argument is less than, equal to, or greater than the second.<tr><td><a name="l1112" href="#l1112">1112</a><td> * @template T<tr><td><a name="l1113" href="#l1113">1113</a><td> */<tr><td><a name="l1114" href="#l1114">1114</a><td>goog.array.sort = function(arr, opt_compareFn) {<tr><td><a name="l1115" href="#l1115">1115</a><td> // TODO(arv): Update type annotation since null is not accepted.<tr><td><a name="l1116" href="#l1116">1116</a><td> arr.sort(opt_compareFn || goog.array.defaultCompare);<tr><td><a name="l1117" href="#l1117">1117</a><td>};<tr><td><a name="l1118" href="#l1118">1118</a><td><tr><td><a name="l1119" href="#l1119">1119</a><td><tr><td><a name="l1120" href="#l1120">1120</a><td>/**<tr><td><a name="l1121" href="#l1121">1121</a><td> * Sorts the specified array into ascending order in a stable way. If no<tr><td><a name="l1122" href="#l1122">1122</a><td> * opt_compareFn is specified, elements are compared using<tr><td><a name="l1123" href="#l1123">1123</a><td> * <code>goog.array.defaultCompare</code>, which compares the elements using<tr><td><a name="l1124" href="#l1124">1124</a><td> * the built in < and > operators. This will produce the expected behavior<tr><td><a name="l1125" href="#l1125">1125</a><td> * for homogeneous arrays of String(s) and Number(s).<tr><td><a name="l1126" href="#l1126">1126</a><td> *<tr><td><a name="l1127" href="#l1127">1127</a><td> * Runtime: Same as <code>Array.prototype.sort</code>, plus an additional<tr><td><a name="l1128" href="#l1128">1128</a><td> * O(n) overhead of copying the array twice.<tr><td><a name="l1129" href="#l1129">1129</a><td> *<tr><td><a name="l1130" href="#l1130">1130</a><td> * @param {Array.<T>} arr The array to be sorted.<tr><td><a name="l1131" href="#l1131">1131</a><td> * @param {?function(T, T): number=} opt_compareFn Optional comparison function<tr><td><a name="l1132" href="#l1132">1132</a><td> * by which the array is to be ordered. Should take 2 arguments to compare,<tr><td><a name="l1133" href="#l1133">1133</a><td> * and return a negative number, zero, or a positive number depending on<tr><td><a name="l1134" href="#l1134">1134</a><td> * whether the first argument is less than, equal to, or greater than the<tr><td><a name="l1135" href="#l1135">1135</a><td> * second.<tr><td><a name="l1136" href="#l1136">1136</a><td> * @template T<tr><td><a name="l1137" href="#l1137">1137</a><td> */<tr><td><a name="l1138" href="#l1138">1138</a><td>goog.array.stableSort = function(arr, opt_compareFn) {<tr><td><a name="l1139" href="#l1139">1139</a><td> for (var i = 0; i < arr.length; i++) {<tr><td><a name="l1140" href="#l1140">1140</a><td> arr[i] = {index: i, value: arr[i]};<tr><td><a name="l1141" href="#l1141">1141</a><td> }<tr><td><a name="l1142" href="#l1142">1142</a><td> var valueCompareFn = opt_compareFn || goog.array.defaultCompare;<tr><td><a name="l1143" href="#l1143">1143</a><td> function stableCompareFn(obj1, obj2) {<tr><td><a name="l1144" href="#l1144">1144</a><td> return valueCompareFn(obj1.value, obj2.value) || obj1.index - obj2.index;<tr><td><a name="l1145" href="#l1145">1145</a><td> };<tr><td><a name="l1146" href="#l1146">1146</a><td> goog.array.sort(arr, stableCompareFn);<tr><td><a name="l1147" href="#l1147">1147</a><td> for (var i = 0; i < arr.length; i++) {<tr><td><a name="l1148" href="#l1148">1148</a><td> arr[i] = arr[i].value;<tr><td><a name="l1149" href="#l1149">1149</a><td> }<tr><td><a name="l1150" href="#l1150">1150</a><td>};<tr><td><a name="l1151" href="#l1151">1151</a><td><tr><td><a name="l1152" href="#l1152">1152</a><td><tr><td><a name="l1153" href="#l1153">1153</a><td>/**<tr><td><a name="l1154" href="#l1154">1154</a><td> * Sorts an array of objects by the specified object key and compare<tr><td><a name="l1155" href="#l1155">1155</a><td> * function. If no compare function is provided, the key values are<tr><td><a name="l1156" href="#l1156">1156</a><td> * compared in ascending order using <code>goog.array.defaultCompare</code>.<tr><td><a name="l1157" href="#l1157">1157</a><td> * This won't work for keys that get renamed by the compiler. So use<tr><td><a name="l1158" href="#l1158">1158</a><td> * {'foo': 1, 'bar': 2} rather than {foo: 1, bar: 2}.<tr><td><a name="l1159" href="#l1159">1159</a><td> * @param {Array.<Object>} arr An array of objects to sort.<tr><td><a name="l1160" href="#l1160">1160</a><td> * @param {string} key The object key to sort by.<tr><td><a name="l1161" href="#l1161">1161</a><td> * @param {Function=} opt_compareFn The function to use to compare key<tr><td><a name="l1162" href="#l1162">1162</a><td> * values.<tr><td><a name="l1163" href="#l1163">1163</a><td> */<tr><td><a name="l1164" href="#l1164">1164</a><td>goog.array.sortObjectsByKey = function(arr, key, opt_compareFn) {<tr><td><a name="l1165" href="#l1165">1165</a><td> var compare = opt_compareFn || goog.array.defaultCompare;<tr><td><a name="l1166" href="#l1166">1166</a><td> goog.array.sort(arr, function(a, b) {<tr><td><a name="l1167" href="#l1167">1167</a><td> return compare(a[key], b[key]);<tr><td><a name="l1168" href="#l1168">1168</a><td> });<tr><td><a name="l1169" href="#l1169">1169</a><td>};<tr><td><a name="l1170" href="#l1170">1170</a><td><tr><td><a name="l1171" href="#l1171">1171</a><td><tr><td><a name="l1172" href="#l1172">1172</a><td>/**<tr><td><a name="l1173" href="#l1173">1173</a><td> * Tells if the array is sorted.<tr><td><a name="l1174" href="#l1174">1174</a><td> * @param {!Array.<T>} arr The array.<tr><td><a name="l1175" href="#l1175">1175</a><td> * @param {?function(T,T):number=} opt_compareFn Function to compare the<tr><td><a name="l1176" href="#l1176">1176</a><td> * array elements.<tr><td><a name="l1177" href="#l1177">1177</a><td> * Should take 2 arguments to compare, and return a negative number, zero,<tr><td><a name="l1178" href="#l1178">1178</a><td> * or a positive number depending on whether the first argument is less<tr><td><a name="l1179" href="#l1179">1179</a><td> * than, equal to, or greater than the second.<tr><td><a name="l1180" href="#l1180">1180</a><td> * @param {boolean=} opt_strict If true no equal elements are allowed.<tr><td><a name="l1181" href="#l1181">1181</a><td> * @return {boolean} Whether the array is sorted.<tr><td><a name="l1182" href="#l1182">1182</a><td> * @template T<tr><td><a name="l1183" href="#l1183">1183</a><td> */<tr><td><a name="l1184" href="#l1184">1184</a><td>goog.array.isSorted = function(arr, opt_compareFn, opt_strict) {<tr><td><a name="l1185" href="#l1185">1185</a><td> var compare = opt_compareFn || goog.array.defaultCompare;<tr><td><a name="l1186" href="#l1186">1186</a><td> for (var i = 1; i < arr.length; i++) {<tr><td><a name="l1187" href="#l1187">1187</a><td> var compareResult = compare(arr[i - 1], arr[i]);<tr><td><a name="l1188" href="#l1188">1188</a><td> if (compareResult > 0 || compareResult == 0 && opt_strict) {<tr><td><a name="l1189" href="#l1189">1189</a><td> return false;<tr><td><a name="l1190" href="#l1190">1190</a><td> }<tr><td><a name="l1191" href="#l1191">1191</a><td> }<tr><td><a name="l1192" href="#l1192">1192</a><td> return true;<tr><td><a name="l1193" href="#l1193">1193</a><td>};<tr><td><a name="l1194" href="#l1194">1194</a><td><tr><td><a name="l1195" href="#l1195">1195</a><td><tr><td><a name="l1196" href="#l1196">1196</a><td>/**<tr><td><a name="l1197" href="#l1197">1197</a><td> * Compares two arrays for equality. Two arrays are considered equal if they<tr><td><a name="l1198" href="#l1198">1198</a><td> * have the same length and their corresponding elements are equal according to<tr><td><a name="l1199" href="#l1199">1199</a><td> * the comparison function.<tr><td><a name="l1200" href="#l1200">1200</a><td> *<tr><td><a name="l1201" href="#l1201">1201</a><td> * @param {goog.array.ArrayLike} arr1 The first array to compare.<tr><td><a name="l1202" href="#l1202">1202</a><td> * @param {goog.array.ArrayLike} arr2 The second array to compare.<tr><td><a name="l1203" href="#l1203">1203</a><td> * @param {Function=} opt_equalsFn Optional comparison function.<tr><td><a name="l1204" href="#l1204">1204</a><td> * Should take 2 arguments to compare, and return true if the arguments<tr><td><a name="l1205" href="#l1205">1205</a><td> * are equal. Defaults to {@link goog.array.defaultCompareEquality} which<tr><td><a name="l1206" href="#l1206">1206</a><td> * compares the elements using the built-in '===' operator.<tr><td><a name="l1207" href="#l1207">1207</a><td> * @return {boolean} Whether the two arrays are equal.<tr><td><a name="l1208" href="#l1208">1208</a><td> */<tr><td><a name="l1209" href="#l1209">1209</a><td>goog.array.equals = function(arr1, arr2, opt_equalsFn) {<tr><td><a name="l1210" href="#l1210">1210</a><td> if (!goog.isArrayLike(arr1) || !goog.isArrayLike(arr2) ||<tr><td><a name="l1211" href="#l1211">1211</a><td> arr1.length != arr2.length) {<tr><td><a name="l1212" href="#l1212">1212</a><td> return false;<tr><td><a name="l1213" href="#l1213">1213</a><td> }<tr><td><a name="l1214" href="#l1214">1214</a><td> var l = arr1.length;<tr><td><a name="l1215" href="#l1215">1215</a><td> var equalsFn = opt_equalsFn || goog.array.defaultCompareEquality;<tr><td><a name="l1216" href="#l1216">1216</a><td> for (var i = 0; i < l; i++) {<tr><td><a name="l1217" href="#l1217">1217</a><td> if (!equalsFn(arr1[i], arr2[i])) {<tr><td><a name="l1218" href="#l1218">1218</a><td> return false;<tr><td><a name="l1219" href="#l1219">1219</a><td> }<tr><td><a name="l1220" href="#l1220">1220</a><td> }<tr><td><a name="l1221" href="#l1221">1221</a><td> return true;<tr><td><a name="l1222" href="#l1222">1222</a><td>};<tr><td><a name="l1223" href="#l1223">1223</a><td><tr><td><a name="l1224" href="#l1224">1224</a><td><tr><td><a name="l1225" href="#l1225">1225</a><td>/**<tr><td><a name="l1226" href="#l1226">1226</a><td> * 3-way array compare function.<tr><td><a name="l1227" href="#l1227">1227</a><td> * @param {!Array.<VALUE>|!goog.array.ArrayLike} arr1 The first array to<tr><td><a name="l1228" href="#l1228">1228</a><td> * compare.<tr><td><a name="l1229" href="#l1229">1229</a><td> * @param {!Array.<VALUE>|!goog.array.ArrayLike} arr2 The second array to<tr><td><a name="l1230" href="#l1230">1230</a><td> * compare.<tr><td><a name="l1231" href="#l1231">1231</a><td> * @param {function(VALUE, VALUE): number=} opt_compareFn Optional comparison<tr><td><a name="l1232" href="#l1232">1232</a><td> * function by which the array is to be ordered. Should take 2 arguments to<tr><td><a name="l1233" href="#l1233">1233</a><td> * compare, and return a negative number, zero, or a positive number<tr><td><a name="l1234" href="#l1234">1234</a><td> * depending on whether the first argument is less than, equal to, or<tr><td><a name="l1235" href="#l1235">1235</a><td> * greater than the second.<tr><td><a name="l1236" href="#l1236">1236</a><td> * @return {number} Negative number, zero, or a positive number depending on<tr><td><a name="l1237" href="#l1237">1237</a><td> * whether the first argument is less than, equal to, or greater than the<tr><td><a name="l1238" href="#l1238">1238</a><td> * second.<tr><td><a name="l1239" href="#l1239">1239</a><td> * @template VALUE<tr><td><a name="l1240" href="#l1240">1240</a><td> */<tr><td><a name="l1241" href="#l1241">1241</a><td>goog.array.compare3 = function(arr1, arr2, opt_compareFn) {<tr><td><a name="l1242" href="#l1242">1242</a><td> var compare = opt_compareFn || goog.array.defaultCompare;<tr><td><a name="l1243" href="#l1243">1243</a><td> var l = Math.min(arr1.length, arr2.length);<tr><td><a name="l1244" href="#l1244">1244</a><td> for (var i = 0; i < l; i++) {<tr><td><a name="l1245" href="#l1245">1245</a><td> var result = compare(arr1[i], arr2[i]);<tr><td><a name="l1246" href="#l1246">1246</a><td> if (result != 0) {<tr><td><a name="l1247" href="#l1247">1247</a><td> return result;<tr><td><a name="l1248" href="#l1248">1248</a><td> }<tr><td><a name="l1249" href="#l1249">1249</a><td> }<tr><td><a name="l1250" href="#l1250">1250</a><td> return goog.array.defaultCompare(arr1.length, arr2.length);<tr><td><a name="l1251" href="#l1251">1251</a><td>};<tr><td><a name="l1252" href="#l1252">1252</a><td><tr><td><a name="l1253" href="#l1253">1253</a><td><tr><td><a name="l1254" href="#l1254">1254</a><td>/**<tr><td><a name="l1255" href="#l1255">1255</a><td> * Compares its two arguments for order, using the built in < and ><tr><td><a name="l1256" href="#l1256">1256</a><td> * operators.<tr><td><a name="l1257" href="#l1257">1257</a><td> * @param {VALUE} a The first object to be compared.<tr><td><a name="l1258" href="#l1258">1258</a><td> * @param {VALUE} b The second object to be compared.<tr><td><a name="l1259" href="#l1259">1259</a><td> * @return {number} A negative number, zero, or a positive number as the first<tr><td><a name="l1260" href="#l1260">1260</a><td> * argument is less than, equal to, or greater than the second.<tr><td><a name="l1261" href="#l1261">1261</a><td> * @template VALUE<tr><td><a name="l1262" href="#l1262">1262</a><td> */<tr><td><a name="l1263" href="#l1263">1263</a><td>goog.array.defaultCompare = function(a, b) {<tr><td><a name="l1264" href="#l1264">1264</a><td> return a > b ? 1 : a < b ? -1 : 0;<tr><td><a name="l1265" href="#l1265">1265</a><td>};<tr><td><a name="l1266" href="#l1266">1266</a><td><tr><td><a name="l1267" href="#l1267">1267</a><td><tr><td><a name="l1268" href="#l1268">1268</a><td>/**<tr><td><a name="l1269" href="#l1269">1269</a><td> * Compares its two arguments for equality, using the built in === operator.<tr><td><a name="l1270" href="#l1270">1270</a><td> * @param {*} a The first object to compare.<tr><td><a name="l1271" href="#l1271">1271</a><td> * @param {*} b The second object to compare.<tr><td><a name="l1272" href="#l1272">1272</a><td> * @return {boolean} True if the two arguments are equal, false otherwise.<tr><td><a name="l1273" href="#l1273">1273</a><td> */<tr><td><a name="l1274" href="#l1274">1274</a><td>goog.array.defaultCompareEquality = function(a, b) {<tr><td><a name="l1275" href="#l1275">1275</a><td> return a === b;<tr><td><a name="l1276" href="#l1276">1276</a><td>};<tr><td><a name="l1277" href="#l1277">1277</a><td><tr><td><a name="l1278" href="#l1278">1278</a><td><tr><td><a name="l1279" href="#l1279">1279</a><td>/**<tr><td><a name="l1280" href="#l1280">1280</a><td> * Inserts a value into a sorted array. The array is not modified if the<tr><td><a name="l1281" href="#l1281">1281</a><td> * value is already present.<tr><td><a name="l1282" href="#l1282">1282</a><td> * @param {Array.<VALUE>|goog.array.ArrayLike} array The array to modify.<tr><td><a name="l1283" href="#l1283">1283</a><td> * @param {VALUE} value The object to insert.<tr><td><a name="l1284" href="#l1284">1284</a><td> * @param {function(VALUE, VALUE): number=} opt_compareFn Optional comparison<tr><td><a name="l1285" href="#l1285">1285</a><td> * function by which the array is ordered. Should take 2 arguments to<tr><td><a name="l1286" href="#l1286">1286</a><td> * compare, and return a negative number, zero, or a positive number<tr><td><a name="l1287" href="#l1287">1287</a><td> * depending on whether the first argument is less than, equal to, or<tr><td><a name="l1288" href="#l1288">1288</a><td> * greater than the second.<tr><td><a name="l1289" href="#l1289">1289</a><td> * @return {boolean} True if an element was inserted.<tr><td><a name="l1290" href="#l1290">1290</a><td> * @template VALUE<tr><td><a name="l1291" href="#l1291">1291</a><td> */<tr><td><a name="l1292" href="#l1292">1292</a><td>goog.array.binaryInsert = function(array, value, opt_compareFn) {<tr><td><a name="l1293" href="#l1293">1293</a><td> var index = goog.array.binarySearch(array, value, opt_compareFn);<tr><td><a name="l1294" href="#l1294">1294</a><td> if (index < 0) {<tr><td><a name="l1295" href="#l1295">1295</a><td> goog.array.insertAt(array, value, -(index + 1));<tr><td><a name="l1296" href="#l1296">1296</a><td> return true;<tr><td><a name="l1297" href="#l1297">1297</a><td> }<tr><td><a name="l1298" href="#l1298">1298</a><td> return false;<tr><td><a name="l1299" href="#l1299">1299</a><td>};<tr><td><a name="l1300" href="#l1300">1300</a><td><tr><td><a name="l1301" href="#l1301">1301</a><td><tr><td><a name="l1302" href="#l1302">1302</a><td>/**<tr><td><a name="l1303" href="#l1303">1303</a><td> * Removes a value from a sorted array.<tr><td><a name="l1304" href="#l1304">1304</a><td> * @param {!Array.<VALUE>|!goog.array.ArrayLike} array The array to modify.<tr><td><a name="l1305" href="#l1305">1305</a><td> * @param {VALUE} value The object to remove.<tr><td><a name="l1306" href="#l1306">1306</a><td> * @param {function(VALUE, VALUE): number=} opt_compareFn Optional comparison<tr><td><a name="l1307" href="#l1307">1307</a><td> * function by which the array is ordered. Should take 2 arguments to<tr><td><a name="l1308" href="#l1308">1308</a><td> * compare, and return a negative number, zero, or a positive number<tr><td><a name="l1309" href="#l1309">1309</a><td> * depending on whether the first argument is less than, equal to, or<tr><td><a name="l1310" href="#l1310">1310</a><td> * greater than the second.<tr><td><a name="l1311" href="#l1311">1311</a><td> * @return {boolean} True if an element was removed.<tr><td><a name="l1312" href="#l1312">1312</a><td> * @template VALUE<tr><td><a name="l1313" href="#l1313">1313</a><td> */<tr><td><a name="l1314" href="#l1314">1314</a><td>goog.array.binaryRemove = function(array, value, opt_compareFn) {<tr><td><a name="l1315" href="#l1315">1315</a><td> var index = goog.array.binarySearch(array, value, opt_compareFn);<tr><td><a name="l1316" href="#l1316">1316</a><td> return (index >= 0) ? goog.array.removeAt(array, index) : false;<tr><td><a name="l1317" href="#l1317">1317</a><td>};<tr><td><a name="l1318" href="#l1318">1318</a><td><tr><td><a name="l1319" href="#l1319">1319</a><td><tr><td><a name="l1320" href="#l1320">1320</a><td>/**<tr><td><a name="l1321" href="#l1321">1321</a><td> * Splits an array into disjoint buckets according to a splitting function.<tr><td><a name="l1322" href="#l1322">1322</a><td> * @param {Array.<T>} array The array.<tr><td><a name="l1323" href="#l1323">1323</a><td> * @param {function(this:S, T,number,Array.<T>):?} sorter Function to call for<tr><td><a name="l1324" href="#l1324">1324</a><td> * every element. This takes 3 arguments (the element, the index and the<tr><td><a name="l1325" href="#l1325">1325</a><td> * array) and must return a valid object key (a string, number, etc), or<tr><td><a name="l1326" href="#l1326">1326</a><td> * undefined, if that object should not be placed in a bucket.<tr><td><a name="l1327" href="#l1327">1327</a><td> * @param {S=} opt_obj The object to be used as the value of 'this' within<tr><td><a name="l1328" href="#l1328">1328</a><td> * sorter.<tr><td><a name="l1329" href="#l1329">1329</a><td> * @return {!Object} An object, with keys being all of the unique return values<tr><td><a name="l1330" href="#l1330">1330</a><td> * of sorter, and values being arrays containing the items for<tr><td><a name="l1331" href="#l1331">1331</a><td> * which the splitter returned that key.<tr><td><a name="l1332" href="#l1332">1332</a><td> * @template T,S<tr><td><a name="l1333" href="#l1333">1333</a><td> */<tr><td><a name="l1334" href="#l1334">1334</a><td>goog.array.bucket = function(array, sorter, opt_obj) {<tr><td><a name="l1335" href="#l1335">1335</a><td> var buckets = {};<tr><td><a name="l1336" href="#l1336">1336</a><td><tr><td><a name="l1337" href="#l1337">1337</a><td> for (var i = 0; i < array.length; i++) {<tr><td><a name="l1338" href="#l1338">1338</a><td> var value = array[i];<tr><td><a name="l1339" href="#l1339">1339</a><td> var key = sorter.call(opt_obj, value, i, array);<tr><td><a name="l1340" href="#l1340">1340</a><td> if (goog.isDef(key)) {<tr><td><a name="l1341" href="#l1341">1341</a><td> // Push the value to the right bucket, creating it if necessary.<tr><td><a name="l1342" href="#l1342">1342</a><td> var bucket = buckets[key] || (buckets[key] = []);<tr><td><a name="l1343" href="#l1343">1343</a><td> bucket.push(value);<tr><td><a name="l1344" href="#l1344">1344</a><td> }<tr><td><a name="l1345" href="#l1345">1345</a><td> }<tr><td><a name="l1346" href="#l1346">1346</a><td><tr><td><a name="l1347" href="#l1347">1347</a><td> return buckets;<tr><td><a name="l1348" href="#l1348">1348</a><td>};<tr><td><a name="l1349" href="#l1349">1349</a><td><tr><td><a name="l1350" href="#l1350">1350</a><td><tr><td><a name="l1351" href="#l1351">1351</a><td>/**<tr><td><a name="l1352" href="#l1352">1352</a><td> * Creates a new object built from the provided array and the key-generation<tr><td><a name="l1353" href="#l1353">1353</a><td> * function.<tr><td><a name="l1354" href="#l1354">1354</a><td> * @param {Array.<T>|goog.array.ArrayLike} arr Array or array like object over<tr><td><a name="l1355" href="#l1355">1355</a><td> * which to iterate whose elements will be the values in the new object.<tr><td><a name="l1356" href="#l1356">1356</a><td> * @param {?function(this:S, T, number, ?) : string} keyFunc The function to<tr><td><a name="l1357" href="#l1357">1357</a><td> * call for every element. This function takes 3 arguments (the element, the<tr><td><a name="l1358" href="#l1358">1358</a><td> * index and the array) and should return a string that will be used as the<tr><td><a name="l1359" href="#l1359">1359</a><td> * key for the element in the new object. If the function returns the same<tr><td><a name="l1360" href="#l1360">1360</a><td> * key for more than one element, the value for that key is<tr><td><a name="l1361" href="#l1361">1361</a><td> * implementation-defined.<tr><td><a name="l1362" href="#l1362">1362</a><td> * @param {S=} opt_obj The object to be used as the value of 'this'<tr><td><a name="l1363" href="#l1363">1363</a><td> * within keyFunc.<tr><td><a name="l1364" href="#l1364">1364</a><td> * @return {!Object.<T>} The new object.<tr><td><a name="l1365" href="#l1365">1365</a><td> * @template T,S<tr><td><a name="l1366" href="#l1366">1366</a><td> */<tr><td><a name="l1367" href="#l1367">1367</a><td>goog.array.toObject = function(arr, keyFunc, opt_obj) {<tr><td><a name="l1368" href="#l1368">1368</a><td> var ret = {};<tr><td><a name="l1369" href="#l1369">1369</a><td> goog.array.forEach(arr, function(element, index) {<tr><td><a name="l1370" href="#l1370">1370</a><td> ret[keyFunc.call(opt_obj, element, index, arr)] = element;<tr><td><a name="l1371" href="#l1371">1371</a><td> });<tr><td><a name="l1372" href="#l1372">1372</a><td> return ret;<tr><td><a name="l1373" href="#l1373">1373</a><td>};<tr><td><a name="l1374" href="#l1374">1374</a><td><tr><td><a name="l1375" href="#l1375">1375</a><td><tr><td><a name="l1376" href="#l1376">1376</a><td>/**<tr><td><a name="l1377" href="#l1377">1377</a><td> * Creates a range of numbers in an arithmetic progression.<tr><td><a name="l1378" href="#l1378">1378</a><td> *<tr><td><a name="l1379" href="#l1379">1379</a><td> * Range takes 1, 2, or 3 arguments:<tr><td><a name="l1380" href="#l1380">1380</a><td> * <pre><tr><td><a name="l1381" href="#l1381">1381</a><td> * range(5) is the same as range(0, 5, 1) and produces [0, 1, 2, 3, 4]<tr><td><a name="l1382" href="#l1382">1382</a><td> * range(2, 5) is the same as range(2, 5, 1) and produces [2, 3, 4]<tr><td><a name="l1383" href="#l1383">1383</a><td> * range(-2, -5, -1) produces [-2, -3, -4]<tr><td><a name="l1384" href="#l1384">1384</a><td> * range(-2, -5, 1) produces [], since stepping by 1 wouldn't ever reach -5.<tr><td><a name="l1385" href="#l1385">1385</a><td> * </pre><tr><td><a name="l1386" href="#l1386">1386</a><td> *<tr><td><a name="l1387" href="#l1387">1387</a><td> * @param {number} startOrEnd The starting value of the range if an end argument<tr><td><a name="l1388" href="#l1388">1388</a><td> * is provided. Otherwise, the start value is 0, and this is the end value.<tr><td><a name="l1389" href="#l1389">1389</a><td> * @param {number=} opt_end The optional end value of the range.<tr><td><a name="l1390" href="#l1390">1390</a><td> * @param {number=} opt_step The step size between range values. Defaults to 1<tr><td><a name="l1391" href="#l1391">1391</a><td> * if opt_step is undefined or 0.<tr><td><a name="l1392" href="#l1392">1392</a><td> * @return {!Array.<number>} An array of numbers for the requested range. May be<tr><td><a name="l1393" href="#l1393">1393</a><td> * an empty array if adding the step would not converge toward the end<tr><td><a name="l1394" href="#l1394">1394</a><td> * value.<tr><td><a name="l1395" href="#l1395">1395</a><td> */<tr><td><a name="l1396" href="#l1396">1396</a><td>goog.array.range = function(startOrEnd, opt_end, opt_step) {<tr><td><a name="l1397" href="#l1397">1397</a><td> var array = [];<tr><td><a name="l1398" href="#l1398">1398</a><td> var start = 0;<tr><td><a name="l1399" href="#l1399">1399</a><td> var end = startOrEnd;<tr><td><a name="l1400" href="#l1400">1400</a><td> var step = opt_step || 1;<tr><td><a name="l1401" href="#l1401">1401</a><td> if (opt_end !== undefined) {<tr><td><a name="l1402" href="#l1402">1402</a><td> start = startOrEnd;<tr><td><a name="l1403" href="#l1403">1403</a><td> end = opt_end;<tr><td><a name="l1404" href="#l1404">1404</a><td> }<tr><td><a name="l1405" href="#l1405">1405</a><td><tr><td><a name="l1406" href="#l1406">1406</a><td> if (step * (end - start) < 0) {<tr><td><a name="l1407" href="#l1407">1407</a><td> // Sign mismatch: start + step will never reach the end value.<tr><td><a name="l1408" href="#l1408">1408</a><td> return [];<tr><td><a name="l1409" href="#l1409">1409</a><td> }<tr><td><a name="l1410" href="#l1410">1410</a><td><tr><td><a name="l1411" href="#l1411">1411</a><td> if (step > 0) {<tr><td><a name="l1412" href="#l1412">1412</a><td> for (var i = start; i < end; i += step) {<tr><td><a name="l1413" href="#l1413">1413</a><td> array.push(i);<tr><td><a name="l1414" href="#l1414">1414</a><td> }<tr><td><a name="l1415" href="#l1415">1415</a><td> } else {<tr><td><a name="l1416" href="#l1416">1416</a><td> for (var i = start; i > end; i += step) {<tr><td><a name="l1417" href="#l1417">1417</a><td> array.push(i);<tr><td><a name="l1418" href="#l1418">1418</a><td> }<tr><td><a name="l1419" href="#l1419">1419</a><td> }<tr><td><a name="l1420" href="#l1420">1420</a><td> return array;<tr><td><a name="l1421" href="#l1421">1421</a><td>};<tr><td><a name="l1422" href="#l1422">1422</a><td><tr><td><a name="l1423" href="#l1423">1423</a><td><tr><td><a name="l1424" href="#l1424">1424</a><td>/**<tr><td><a name="l1425" href="#l1425">1425</a><td> * Returns an array consisting of the given value repeated N times.<tr><td><a name="l1426" href="#l1426">1426</a><td> *<tr><td><a name="l1427" href="#l1427">1427</a><td> * @param {VALUE} value The value to repeat.<tr><td><a name="l1428" href="#l1428">1428</a><td> * @param {number} n The repeat count.<tr><td><a name="l1429" href="#l1429">1429</a><td> * @return {!Array.<VALUE>} An array with the repeated value.<tr><td><a name="l1430" href="#l1430">1430</a><td> * @template VALUE<tr><td><a name="l1431" href="#l1431">1431</a><td> */<tr><td><a name="l1432" href="#l1432">1432</a><td>goog.array.repeat = function(value, n) {<tr><td><a name="l1433" href="#l1433">1433</a><td> var array = [];<tr><td><a name="l1434" href="#l1434">1434</a><td> for (var i = 0; i < n; i++) {<tr><td><a name="l1435" href="#l1435">1435</a><td> array[i] = value;<tr><td><a name="l1436" href="#l1436">1436</a><td> }<tr><td><a name="l1437" href="#l1437">1437</a><td> return array;<tr><td><a name="l1438" href="#l1438">1438</a><td>};<tr><td><a name="l1439" href="#l1439">1439</a><td><tr><td><a name="l1440" href="#l1440">1440</a><td><tr><td><a name="l1441" href="#l1441">1441</a><td>/**<tr><td><a name="l1442" href="#l1442">1442</a><td> * Returns an array consisting of every argument with all arrays<tr><td><a name="l1443" href="#l1443">1443</a><td> * expanded in-place recursively.<tr><td><a name="l1444" href="#l1444">1444</a><td> *<tr><td><a name="l1445" href="#l1445">1445</a><td> * @param {...*} var_args The values to flatten.<tr><td><a name="l1446" href="#l1446">1446</a><td> * @return {!Array} An array containing the flattened values.<tr><td><a name="l1447" href="#l1447">1447</a><td> */<tr><td><a name="l1448" href="#l1448">1448</a><td>goog.array.flatten = function(var_args) {<tr><td><a name="l1449" href="#l1449">1449</a><td> var result = [];<tr><td><a name="l1450" href="#l1450">1450</a><td> for (var i = 0; i < arguments.length; i++) {<tr><td><a name="l1451" href="#l1451">1451</a><td> var element = arguments[i];<tr><td><a name="l1452" href="#l1452">1452</a><td> if (goog.isArray(element)) {<tr><td><a name="l1453" href="#l1453">1453</a><td> result.push.apply(result, goog.array.flatten.apply(null, element));<tr><td><a name="l1454" href="#l1454">1454</a><td> } else {<tr><td><a name="l1455" href="#l1455">1455</a><td> result.push(element);<tr><td><a name="l1456" href="#l1456">1456</a><td> }<tr><td><a name="l1457" href="#l1457">1457</a><td> }<tr><td><a name="l1458" href="#l1458">1458</a><td> return result;<tr><td><a name="l1459" href="#l1459">1459</a><td>};<tr><td><a name="l1460" href="#l1460">1460</a><td><tr><td><a name="l1461" href="#l1461">1461</a><td><tr><td><a name="l1462" href="#l1462">1462</a><td>/**<tr><td><a name="l1463" href="#l1463">1463</a><td> * Rotates an array in-place. After calling this method, the element at<tr><td><a name="l1464" href="#l1464">1464</a><td> * index i will be the element previously at index (i - n) %<tr><td><a name="l1465" href="#l1465">1465</a><td> * array.length, for all values of i between 0 and array.length - 1,<tr><td><a name="l1466" href="#l1466">1466</a><td> * inclusive.<tr><td><a name="l1467" href="#l1467">1467</a><td> *<tr><td><a name="l1468" href="#l1468">1468</a><td> * For example, suppose list comprises [t, a, n, k, s]. After invoking<tr><td><a name="l1469" href="#l1469">1469</a><td> * rotate(array, 1) (or rotate(array, -4)), array will comprise [s, t, a, n, k].<tr><td><a name="l1470" href="#l1470">1470</a><td> *<tr><td><a name="l1471" href="#l1471">1471</a><td> * @param {!Array.<T>} array The array to rotate.<tr><td><a name="l1472" href="#l1472">1472</a><td> * @param {number} n The amount to rotate.<tr><td><a name="l1473" href="#l1473">1473</a><td> * @return {!Array.<T>} The array.<tr><td><a name="l1474" href="#l1474">1474</a><td> * @template T<tr><td><a name="l1475" href="#l1475">1475</a><td> */<tr><td><a name="l1476" href="#l1476">1476</a><td>goog.array.rotate = function(array, n) {<tr><td><a name="l1477" href="#l1477">1477</a><td> goog.asserts.assert(array.length != null);<tr><td><a name="l1478" href="#l1478">1478</a><td><tr><td><a name="l1479" href="#l1479">1479</a><td> if (array.length) {<tr><td><a name="l1480" href="#l1480">1480</a><td> n %= array.length;<tr><td><a name="l1481" href="#l1481">1481</a><td> if (n > 0) {<tr><td><a name="l1482" href="#l1482">1482</a><td> goog.array.ARRAY_PROTOTYPE_.unshift.apply(array, array.splice(-n, n));<tr><td><a name="l1483" href="#l1483">1483</a><td> } else if (n < 0) {<tr><td><a name="l1484" href="#l1484">1484</a><td> goog.array.ARRAY_PROTOTYPE_.push.apply(array, array.splice(0, -n));<tr><td><a name="l1485" href="#l1485">1485</a><td> }<tr><td><a name="l1486" href="#l1486">1486</a><td> }<tr><td><a name="l1487" href="#l1487">1487</a><td> return array;<tr><td><a name="l1488" href="#l1488">1488</a><td>};<tr><td><a name="l1489" href="#l1489">1489</a><td><tr><td><a name="l1490" href="#l1490">1490</a><td><tr><td><a name="l1491" href="#l1491">1491</a><td>/**<tr><td><a name="l1492" href="#l1492">1492</a><td> * Moves one item of an array to a new position keeping the order of the rest<tr><td><a name="l1493" href="#l1493">1493</a><td> * of the items. Example use case: keeping a list of JavaScript objects<tr><td><a name="l1494" href="#l1494">1494</a><td> * synchronized with the corresponding list of DOM elements after one of the<tr><td><a name="l1495" href="#l1495">1495</a><td> * elements has been dragged to a new position.<tr><td><a name="l1496" href="#l1496">1496</a><td> * @param {!(Array|Arguments|{length:number})} arr The array to modify.<tr><td><a name="l1497" href="#l1497">1497</a><td> * @param {number} fromIndex Index of the item to move between 0 and<tr><td><a name="l1498" href="#l1498">1498</a><td> * {@code arr.length - 1}.<tr><td><a name="l1499" href="#l1499">1499</a><td> * @param {number} toIndex Target index between 0 and {@code arr.length - 1}.<tr><td><a name="l1500" href="#l1500">1500</a><td> */<tr><td><a name="l1501" href="#l1501">1501</a><td>goog.array.moveItem = function(arr, fromIndex, toIndex) {<tr><td><a name="l1502" href="#l1502">1502</a><td> goog.asserts.assert(fromIndex >= 0 && fromIndex < arr.length);<tr><td><a name="l1503" href="#l1503">1503</a><td> goog.asserts.assert(toIndex >= 0 && toIndex < arr.length);<tr><td><a name="l1504" href="#l1504">1504</a><td> // Remove 1 item at fromIndex.<tr><td><a name="l1505" href="#l1505">1505</a><td> var removedItems = goog.array.ARRAY_PROTOTYPE_.splice.call(arr, fromIndex, 1);<tr><td><a name="l1506" href="#l1506">1506</a><td> // Insert the removed item at toIndex.<tr><td><a name="l1507" href="#l1507">1507</a><td> goog.array.ARRAY_PROTOTYPE_.splice.call(arr, toIndex, 0, removedItems[0]);<tr><td><a name="l1508" href="#l1508">1508</a><td> // We don't use goog.array.insertAt and goog.array.removeAt, because they're<tr><td><a name="l1509" href="#l1509">1509</a><td> // significantly slower than splice.<tr><td><a name="l1510" href="#l1510">1510</a><td>};<tr><td><a name="l1511" href="#l1511">1511</a><td><tr><td><a name="l1512" href="#l1512">1512</a><td><tr><td><a name="l1513" href="#l1513">1513</a><td>/**<tr><td><a name="l1514" href="#l1514">1514</a><td> * Creates a new array for which the element at position i is an array of the<tr><td><a name="l1515" href="#l1515">1515</a><td> * ith element of the provided arrays. The returned array will only be as long<tr><td><a name="l1516" href="#l1516">1516</a><td> * as the shortest array provided; additional values are ignored. For example,<tr><td><a name="l1517" href="#l1517">1517</a><td> * the result of zipping [1, 2] and [3, 4, 5] is [[1,3], [2, 4]].<tr><td><a name="l1518" href="#l1518">1518</a><td> *<tr><td><a name="l1519" href="#l1519">1519</a><td> * This is similar to the zip() function in Python. See {@link<tr><td><a name="l1520" href="#l1520">1520</a><td> * http://docs.python.org/library/functions.html#zip}<tr><td><a name="l1521" href="#l1521">1521</a><td> *<tr><td><a name="l1522" href="#l1522">1522</a><td> * @param {...!goog.array.ArrayLike} var_args Arrays to be combined.<tr><td><a name="l1523" href="#l1523">1523</a><td> * @return {!Array.<!Array>} A new array of arrays created from provided arrays.<tr><td><a name="l1524" href="#l1524">1524</a><td> */<tr><td><a name="l1525" href="#l1525">1525</a><td>goog.array.zip = function(var_args) {<tr><td><a name="l1526" href="#l1526">1526</a><td> if (!arguments.length) {<tr><td><a name="l1527" href="#l1527">1527</a><td> return [];<tr><td><a name="l1528" href="#l1528">1528</a><td> }<tr><td><a name="l1529" href="#l1529">1529</a><td> var result = [];<tr><td><a name="l1530" href="#l1530">1530</a><td> for (var i = 0; true; i++) {<tr><td><a name="l1531" href="#l1531">1531</a><td> var value = [];<tr><td><a name="l1532" href="#l1532">1532</a><td> for (var j = 0; j < arguments.length; j++) {<tr><td><a name="l1533" href="#l1533">1533</a><td> var arr = arguments[j];<tr><td><a name="l1534" href="#l1534">1534</a><td> // If i is larger than the array length, this is the shortest array.<tr><td><a name="l1535" href="#l1535">1535</a><td> if (i >= arr.length) {<tr><td><a name="l1536" href="#l1536">1536</a><td> return result;<tr><td><a name="l1537" href="#l1537">1537</a><td> }<tr><td><a name="l1538" href="#l1538">1538</a><td> value.push(arr[i]);<tr><td><a name="l1539" href="#l1539">1539</a><td> }<tr><td><a name="l1540" href="#l1540">1540</a><td> result.push(value);<tr><td><a name="l1541" href="#l1541">1541</a><td> }<tr><td><a name="l1542" href="#l1542">1542</a><td>};<tr><td><a name="l1543" href="#l1543">1543</a><td><tr><td><a name="l1544" href="#l1544">1544</a><td><tr><td><a name="l1545" href="#l1545">1545</a><td>/**<tr><td><a name="l1546" href="#l1546">1546</a><td> * Shuffles the values in the specified array using the Fisher-Yates in-place<tr><td><a name="l1547" href="#l1547">1547</a><td> * shuffle (also known as the Knuth Shuffle). By default, calls Math.random()<tr><td><a name="l1548" href="#l1548">1548</a><td> * and so resets the state of that random number generator. Similarly, may reset<tr><td><a name="l1549" href="#l1549">1549</a><td> * the state of the any other specified random number generator.<tr><td><a name="l1550" href="#l1550">1550</a><td> *<tr><td><a name="l1551" href="#l1551">1551</a><td> * Runtime: O(n)<tr><td><a name="l1552" href="#l1552">1552</a><td> *<tr><td><a name="l1553" href="#l1553">1553</a><td> * @param {!Array} arr The array to be shuffled.<tr><td><a name="l1554" href="#l1554">1554</a><td> * @param {function():number=} opt_randFn Optional random function to use for<tr><td><a name="l1555" href="#l1555">1555</a><td> * shuffling.<tr><td><a name="l1556" href="#l1556">1556</a><td> * Takes no arguments, and returns a random number on the interval [0, 1).<tr><td><a name="l1557" href="#l1557">1557</a><td> * Defaults to Math.random() using JavaScript's built-in Math library.<tr><td><a name="l1558" href="#l1558">1558</a><td> */<tr><td><a name="l1559" href="#l1559">1559</a><td>goog.array.shuffle = function(arr, opt_randFn) {<tr><td><a name="l1560" href="#l1560">1560</a><td> var randFn = opt_randFn || Math.random;<tr><td><a name="l1561" href="#l1561">1561</a><td><tr><td><a name="l1562" href="#l1562">1562</a><td> for (var i = arr.length - 1; i > 0; i--) {<tr><td><a name="l1563" href="#l1563">1563</a><td> // Choose a random array index in [0, i] (inclusive with i).<tr><td><a name="l1564" href="#l1564">1564</a><td> var j = Math.floor(randFn() * (i + 1));<tr><td><a name="l1565" href="#l1565">1565</a><td><tr><td><a name="l1566" href="#l1566">1566</a><td> var tmp = arr[i];<tr><td><a name="l1567" href="#l1567">1567</a><td> arr[i] = arr[j];<tr><td><a name="l1568" href="#l1568">1568</a><td> arr[j] = tmp;<tr><td><a name="l1569" href="#l1569">1569</a><td> }<tr><td><a name="l1570" href="#l1570">1570</a><td>};</table></pre></main><nav id="topnav"><div><div id="menubutton"><label for="sidenav-toggle">Menu</label></div><form id="searchbox"><div><input type="search" placeholder="Search" tabindex="1"></div></form></div></nav><nav id="sidenav"><input type="checkbox" id="sidenav-types-ctrl" /><input type="checkbox" id="sidenav-files-ctrl" /><input type="checkbox" id="sidenav-modules-ctrl" /><a id="sidenav-overview"><div><h4>Overview</h4></div></a><div id="sidenav-types"><label for="sidenav-types-ctrl"><h4>Types</h4></label><i>No data</i></div><div id="sidenav-modules"><label for="sidenav-modules-ctrl"><h4>Modules</h4></label><i>No data</i></div><div id="sidenav-files"><label for="sidenav-files-ctrl"><h4>Files</h4></label><i>No data</i></div><a href="license.html"><div><h4>License</h4></div></a></nav><div id="push-footer"></div></div><footer><a href="https://github.com/jleyba/js-dossier">Generated by dossier</a></footer><script src="../../../../types.js"></script><script src="../../../../dossier.js"></script> |