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
34 KiB
1 line
34 KiB
<!DOCTYPE html><meta charset="UTF-8"><meta http-equiv="Content-Language" content="en" /><title>map.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/structs/map.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 Datastructure: Hash Map.<tr><td><a name="l17" href="#l17">17</a><td> *<tr><td><a name="l18" href="#l18">18</a><td> * @author arv@google.com (Erik Arvidsson)<tr><td><a name="l19" href="#l19">19</a><td> * @author jonp@google.com (Jon Perlow) Optimized for IE6<tr><td><a name="l20" href="#l20">20</a><td> *<tr><td><a name="l21" href="#l21">21</a><td> * This file contains an implementation of a Map structure. It implements a lot<tr><td><a name="l22" href="#l22">22</a><td> * of the methods used in goog.structs so those functions work on hashes. This<tr><td><a name="l23" href="#l23">23</a><td> * is best suited for complex key types. For simple keys such as numbers and<tr><td><a name="l24" href="#l24">24</a><td> * strings, and where special names like __proto__ are not a concern, consider<tr><td><a name="l25" href="#l25">25</a><td> * using the lighter-weight utilities in goog.object.<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><tr><td><a name="l29" href="#l29">29</a><td>goog.provide('goog.structs.Map');<tr><td><a name="l30" href="#l30">30</a><td><tr><td><a name="l31" href="#l31">31</a><td>goog.require('goog.iter.Iterator');<tr><td><a name="l32" href="#l32">32</a><td>goog.require('goog.iter.StopIteration');<tr><td><a name="l33" href="#l33">33</a><td>goog.require('goog.object');<tr><td><a name="l34" href="#l34">34</a><td><tr><td><a name="l35" href="#l35">35</a><td><tr><td><a name="l36" href="#l36">36</a><td><tr><td><a name="l37" href="#l37">37</a><td>/**<tr><td><a name="l38" href="#l38">38</a><td> * Class for Hash Map datastructure.<tr><td><a name="l39" href="#l39">39</a><td> * @param {*=} opt_map Map or Object to initialize the map with.<tr><td><a name="l40" href="#l40">40</a><td> * @param {...*} var_args If 2 or more arguments are present then they<tr><td><a name="l41" href="#l41">41</a><td> * will be used as key-value pairs.<tr><td><a name="l42" href="#l42">42</a><td> * @constructor<tr><td><a name="l43" href="#l43">43</a><td> * @template K, V<tr><td><a name="l44" href="#l44">44</a><td> */<tr><td><a name="l45" href="#l45">45</a><td>goog.structs.Map = function(opt_map, var_args) {<tr><td><a name="l46" href="#l46">46</a><td><tr><td><a name="l47" href="#l47">47</a><td> /**<tr><td><a name="l48" href="#l48">48</a><td> * Underlying JS object used to implement the map.<tr><td><a name="l49" href="#l49">49</a><td> * @private {!Object}<tr><td><a name="l50" href="#l50">50</a><td> */<tr><td><a name="l51" href="#l51">51</a><td> this.map_ = {};<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> * An array of keys. This is necessary for two reasons:<tr><td><a name="l55" href="#l55">55</a><td> * 1. Iterating the keys using for (var key in this.map_) allocates an<tr><td><a name="l56" href="#l56">56</a><td> * object for every key in IE which is really bad for IE6 GC perf.<tr><td><a name="l57" href="#l57">57</a><td> * 2. Without a side data structure, we would need to escape all the keys<tr><td><a name="l58" href="#l58">58</a><td> * as that would be the only way we could tell during iteration if the<tr><td><a name="l59" href="#l59">59</a><td> * key was an internal key or a property of the object.<tr><td><a name="l60" href="#l60">60</a><td> *<tr><td><a name="l61" href="#l61">61</a><td> * This array can contain deleted keys so it's necessary to check the map<tr><td><a name="l62" href="#l62">62</a><td> * as well to see if the key is still in the map (this doesn't require a<tr><td><a name="l63" href="#l63">63</a><td> * memory allocation in IE).<tr><td><a name="l64" href="#l64">64</a><td> * @private {!Array.<string>}<tr><td><a name="l65" href="#l65">65</a><td> */<tr><td><a name="l66" href="#l66">66</a><td> this.keys_ = [];<tr><td><a name="l67" href="#l67">67</a><td><tr><td><a name="l68" href="#l68">68</a><td> /**<tr><td><a name="l69" href="#l69">69</a><td> * The number of key value pairs in the map.<tr><td><a name="l70" href="#l70">70</a><td> * @private {number}<tr><td><a name="l71" href="#l71">71</a><td> */<tr><td><a name="l72" href="#l72">72</a><td> this.count_ = 0;<tr><td><a name="l73" href="#l73">73</a><td><tr><td><a name="l74" href="#l74">74</a><td> /**<tr><td><a name="l75" href="#l75">75</a><td> * Version used to detect changes while iterating.<tr><td><a name="l76" href="#l76">76</a><td> * @private {number}<tr><td><a name="l77" href="#l77">77</a><td> */<tr><td><a name="l78" href="#l78">78</a><td> this.version_ = 0;<tr><td><a name="l79" href="#l79">79</a><td><tr><td><a name="l80" href="#l80">80</a><td> var argLength = arguments.length;<tr><td><a name="l81" href="#l81">81</a><td><tr><td><a name="l82" href="#l82">82</a><td> if (argLength > 1) {<tr><td><a name="l83" href="#l83">83</a><td> if (argLength % 2) {<tr><td><a name="l84" href="#l84">84</a><td> throw Error('Uneven number of arguments');<tr><td><a name="l85" href="#l85">85</a><td> }<tr><td><a name="l86" href="#l86">86</a><td> for (var i = 0; i < argLength; i += 2) {<tr><td><a name="l87" href="#l87">87</a><td> this.set(arguments[i], arguments[i + 1]);<tr><td><a name="l88" href="#l88">88</a><td> }<tr><td><a name="l89" href="#l89">89</a><td> } else if (opt_map) {<tr><td><a name="l90" href="#l90">90</a><td> this.addAll(/** @type {Object} */ (opt_map));<tr><td><a name="l91" href="#l91">91</a><td> }<tr><td><a name="l92" href="#l92">92</a><td>};<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> * @return {number} The number of key-value pairs in the map.<tr><td><a name="l97" href="#l97">97</a><td> */<tr><td><a name="l98" href="#l98">98</a><td>goog.structs.Map.prototype.getCount = function() {<tr><td><a name="l99" href="#l99">99</a><td> return this.count_;<tr><td><a name="l100" href="#l100">100</a><td>};<tr><td><a name="l101" href="#l101">101</a><td><tr><td><a name="l102" href="#l102">102</a><td><tr><td><a name="l103" href="#l103">103</a><td>/**<tr><td><a name="l104" href="#l104">104</a><td> * Returns the values of the map.<tr><td><a name="l105" href="#l105">105</a><td> * @return {!Array.<V>} The values in the map.<tr><td><a name="l106" href="#l106">106</a><td> */<tr><td><a name="l107" href="#l107">107</a><td>goog.structs.Map.prototype.getValues = function() {<tr><td><a name="l108" href="#l108">108</a><td> this.cleanupKeysArray_();<tr><td><a name="l109" href="#l109">109</a><td><tr><td><a name="l110" href="#l110">110</a><td> var rv = [];<tr><td><a name="l111" href="#l111">111</a><td> for (var i = 0; i < this.keys_.length; i++) {<tr><td><a name="l112" href="#l112">112</a><td> var key = this.keys_[i];<tr><td><a name="l113" href="#l113">113</a><td> rv.push(this.map_[key]);<tr><td><a name="l114" href="#l114">114</a><td> }<tr><td><a name="l115" href="#l115">115</a><td> return rv;<tr><td><a name="l116" href="#l116">116</a><td>};<tr><td><a name="l117" href="#l117">117</a><td><tr><td><a name="l118" href="#l118">118</a><td><tr><td><a name="l119" href="#l119">119</a><td>/**<tr><td><a name="l120" href="#l120">120</a><td> * Returns the keys of the map.<tr><td><a name="l121" href="#l121">121</a><td> * @return {!Array.<string>} Array of string values.<tr><td><a name="l122" href="#l122">122</a><td> */<tr><td><a name="l123" href="#l123">123</a><td>goog.structs.Map.prototype.getKeys = function() {<tr><td><a name="l124" href="#l124">124</a><td> this.cleanupKeysArray_();<tr><td><a name="l125" href="#l125">125</a><td> return /** @type {!Array.<string>} */ (this.keys_.concat());<tr><td><a name="l126" href="#l126">126</a><td>};<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>/**<tr><td><a name="l130" href="#l130">130</a><td> * Whether the map contains the given key.<tr><td><a name="l131" href="#l131">131</a><td> * @param {*} key The key to check for.<tr><td><a name="l132" href="#l132">132</a><td> * @return {boolean} Whether the map contains the key.<tr><td><a name="l133" href="#l133">133</a><td> */<tr><td><a name="l134" href="#l134">134</a><td>goog.structs.Map.prototype.containsKey = function(key) {<tr><td><a name="l135" href="#l135">135</a><td> return goog.structs.Map.hasKey_(this.map_, key);<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><tr><td><a name="l139" href="#l139">139</a><td>/**<tr><td><a name="l140" href="#l140">140</a><td> * Whether the map contains the given value. This is O(n).<tr><td><a name="l141" href="#l141">141</a><td> * @param {V} val The value to check for.<tr><td><a name="l142" href="#l142">142</a><td> * @return {boolean} Whether the map contains the value.<tr><td><a name="l143" href="#l143">143</a><td> */<tr><td><a name="l144" href="#l144">144</a><td>goog.structs.Map.prototype.containsValue = function(val) {<tr><td><a name="l145" href="#l145">145</a><td> for (var i = 0; i < this.keys_.length; i++) {<tr><td><a name="l146" href="#l146">146</a><td> var key = this.keys_[i];<tr><td><a name="l147" href="#l147">147</a><td> if (goog.structs.Map.hasKey_(this.map_, key) && this.map_[key] == val) {<tr><td><a name="l148" href="#l148">148</a><td> return true;<tr><td><a name="l149" href="#l149">149</a><td> }<tr><td><a name="l150" href="#l150">150</a><td> }<tr><td><a name="l151" href="#l151">151</a><td> return false;<tr><td><a name="l152" href="#l152">152</a><td>};<tr><td><a name="l153" href="#l153">153</a><td><tr><td><a name="l154" href="#l154">154</a><td><tr><td><a name="l155" href="#l155">155</a><td>/**<tr><td><a name="l156" href="#l156">156</a><td> * Whether this map is equal to the argument map.<tr><td><a name="l157" href="#l157">157</a><td> * @param {goog.structs.Map} otherMap The map against which to test equality.<tr><td><a name="l158" href="#l158">158</a><td> * @param {function(V, V): boolean=} opt_equalityFn Optional equality function<tr><td><a name="l159" href="#l159">159</a><td> * to test equality of values. If not specified, this will test whether<tr><td><a name="l160" href="#l160">160</a><td> * the values contained in each map are identical objects.<tr><td><a name="l161" href="#l161">161</a><td> * @return {boolean} Whether the maps are equal.<tr><td><a name="l162" href="#l162">162</a><td> */<tr><td><a name="l163" href="#l163">163</a><td>goog.structs.Map.prototype.equals = function(otherMap, opt_equalityFn) {<tr><td><a name="l164" href="#l164">164</a><td> if (this === otherMap) {<tr><td><a name="l165" href="#l165">165</a><td> return true;<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 (this.count_ != otherMap.getCount()) {<tr><td><a name="l169" href="#l169">169</a><td> return false;<tr><td><a name="l170" href="#l170">170</a><td> }<tr><td><a name="l171" href="#l171">171</a><td><tr><td><a name="l172" href="#l172">172</a><td> var equalityFn = opt_equalityFn || goog.structs.Map.defaultEquals;<tr><td><a name="l173" href="#l173">173</a><td><tr><td><a name="l174" href="#l174">174</a><td> this.cleanupKeysArray_();<tr><td><a name="l175" href="#l175">175</a><td> for (var key, i = 0; key = this.keys_[i]; i++) {<tr><td><a name="l176" href="#l176">176</a><td> if (!equalityFn(this.get(key), otherMap.get(key))) {<tr><td><a name="l177" href="#l177">177</a><td> return false;<tr><td><a name="l178" href="#l178">178</a><td> }<tr><td><a name="l179" href="#l179">179</a><td> }<tr><td><a name="l180" href="#l180">180</a><td><tr><td><a name="l181" href="#l181">181</a><td> return true;<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>/**<tr><td><a name="l186" href="#l186">186</a><td> * Default equality test for values.<tr><td><a name="l187" href="#l187">187</a><td> * @param {*} a The first value.<tr><td><a name="l188" href="#l188">188</a><td> * @param {*} b The second value.<tr><td><a name="l189" href="#l189">189</a><td> * @return {boolean} Whether a and b reference the same object.<tr><td><a name="l190" href="#l190">190</a><td> */<tr><td><a name="l191" href="#l191">191</a><td>goog.structs.Map.defaultEquals = function(a, b) {<tr><td><a name="l192" href="#l192">192</a><td> return a === b;<tr><td><a name="l193" href="#l193">193</a><td>};<tr><td><a name="l194" href="#l194">194</a><td><tr><td><a name="l195" href="#l195">195</a><td><tr><td><a name="l196" href="#l196">196</a><td>/**<tr><td><a name="l197" href="#l197">197</a><td> * @return {boolean} Whether the map is empty.<tr><td><a name="l198" href="#l198">198</a><td> */<tr><td><a name="l199" href="#l199">199</a><td>goog.structs.Map.prototype.isEmpty = function() {<tr><td><a name="l200" href="#l200">200</a><td> return this.count_ == 0;<tr><td><a name="l201" href="#l201">201</a><td>};<tr><td><a name="l202" href="#l202">202</a><td><tr><td><a name="l203" href="#l203">203</a><td><tr><td><a name="l204" href="#l204">204</a><td>/**<tr><td><a name="l205" href="#l205">205</a><td> * Removes all key-value pairs from the map.<tr><td><a name="l206" href="#l206">206</a><td> */<tr><td><a name="l207" href="#l207">207</a><td>goog.structs.Map.prototype.clear = function() {<tr><td><a name="l208" href="#l208">208</a><td> this.map_ = {};<tr><td><a name="l209" href="#l209">209</a><td> this.keys_.length = 0;<tr><td><a name="l210" href="#l210">210</a><td> this.count_ = 0;<tr><td><a name="l211" href="#l211">211</a><td> this.version_ = 0;<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> * Removes a key-value pair based on the key. This is O(logN) amortized due to<tr><td><a name="l217" href="#l217">217</a><td> * updating the keys array whenever the count becomes half the size of the keys<tr><td><a name="l218" href="#l218">218</a><td> * in the keys array.<tr><td><a name="l219" href="#l219">219</a><td> * @param {*} key The key to remove.<tr><td><a name="l220" href="#l220">220</a><td> * @return {boolean} Whether object was removed.<tr><td><a name="l221" href="#l221">221</a><td> */<tr><td><a name="l222" href="#l222">222</a><td>goog.structs.Map.prototype.remove = function(key) {<tr><td><a name="l223" href="#l223">223</a><td> if (goog.structs.Map.hasKey_(this.map_, key)) {<tr><td><a name="l224" href="#l224">224</a><td> delete this.map_[key];<tr><td><a name="l225" href="#l225">225</a><td> this.count_--;<tr><td><a name="l226" href="#l226">226</a><td> this.version_++;<tr><td><a name="l227" href="#l227">227</a><td><tr><td><a name="l228" href="#l228">228</a><td> // clean up the keys array if the threshhold is hit<tr><td><a name="l229" href="#l229">229</a><td> if (this.keys_.length > 2 * this.count_) {<tr><td><a name="l230" href="#l230">230</a><td> this.cleanupKeysArray_();<tr><td><a name="l231" href="#l231">231</a><td> }<tr><td><a name="l232" href="#l232">232</a><td><tr><td><a name="l233" href="#l233">233</a><td> return true;<tr><td><a name="l234" href="#l234">234</a><td> }<tr><td><a name="l235" href="#l235">235</a><td> return false;<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> * Cleans up the temp keys array by removing entries that are no longer in the<tr><td><a name="l241" href="#l241">241</a><td> * map.<tr><td><a name="l242" href="#l242">242</a><td> * @private<tr><td><a name="l243" href="#l243">243</a><td> */<tr><td><a name="l244" href="#l244">244</a><td>goog.structs.Map.prototype.cleanupKeysArray_ = function() {<tr><td><a name="l245" href="#l245">245</a><td> if (this.count_ != this.keys_.length) {<tr><td><a name="l246" href="#l246">246</a><td> // First remove keys that are no longer in the map.<tr><td><a name="l247" href="#l247">247</a><td> var srcIndex = 0;<tr><td><a name="l248" href="#l248">248</a><td> var destIndex = 0;<tr><td><a name="l249" href="#l249">249</a><td> while (srcIndex < this.keys_.length) {<tr><td><a name="l250" href="#l250">250</a><td> var key = this.keys_[srcIndex];<tr><td><a name="l251" href="#l251">251</a><td> if (goog.structs.Map.hasKey_(this.map_, key)) {<tr><td><a name="l252" href="#l252">252</a><td> this.keys_[destIndex++] = key;<tr><td><a name="l253" href="#l253">253</a><td> }<tr><td><a name="l254" href="#l254">254</a><td> srcIndex++;<tr><td><a name="l255" href="#l255">255</a><td> }<tr><td><a name="l256" href="#l256">256</a><td> this.keys_.length = destIndex;<tr><td><a name="l257" href="#l257">257</a><td> }<tr><td><a name="l258" href="#l258">258</a><td><tr><td><a name="l259" href="#l259">259</a><td> if (this.count_ != this.keys_.length) {<tr><td><a name="l260" href="#l260">260</a><td> // If the count still isn't correct, that means we have duplicates. This can<tr><td><a name="l261" href="#l261">261</a><td> // happen when the same key is added and removed multiple times. Now we have<tr><td><a name="l262" href="#l262">262</a><td> // to allocate one extra Object to remove the duplicates. This could have<tr><td><a name="l263" href="#l263">263</a><td> // been done in the first pass, but in the common case, we can avoid<tr><td><a name="l264" href="#l264">264</a><td> // allocating an extra object by only doing this when necessary.<tr><td><a name="l265" href="#l265">265</a><td> var seen = {};<tr><td><a name="l266" href="#l266">266</a><td> var srcIndex = 0;<tr><td><a name="l267" href="#l267">267</a><td> var destIndex = 0;<tr><td><a name="l268" href="#l268">268</a><td> while (srcIndex < this.keys_.length) {<tr><td><a name="l269" href="#l269">269</a><td> var key = this.keys_[srcIndex];<tr><td><a name="l270" href="#l270">270</a><td> if (!(goog.structs.Map.hasKey_(seen, key))) {<tr><td><a name="l271" href="#l271">271</a><td> this.keys_[destIndex++] = key;<tr><td><a name="l272" href="#l272">272</a><td> seen[key] = 1;<tr><td><a name="l273" href="#l273">273</a><td> }<tr><td><a name="l274" href="#l274">274</a><td> srcIndex++;<tr><td><a name="l275" href="#l275">275</a><td> }<tr><td><a name="l276" href="#l276">276</a><td> this.keys_.length = destIndex;<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><tr><td><a name="l281" href="#l281">281</a><td>/**<tr><td><a name="l282" href="#l282">282</a><td> * Returns the value for the given key. If the key is not found and the default<tr><td><a name="l283" href="#l283">283</a><td> * value is not given this will return {@code undefined}.<tr><td><a name="l284" href="#l284">284</a><td> * @param {*} key The key to get the value for.<tr><td><a name="l285" href="#l285">285</a><td> * @param {DEFAULT=} opt_val The value to return if no item is found for the<tr><td><a name="l286" href="#l286">286</a><td> * given key, defaults to undefined.<tr><td><a name="l287" href="#l287">287</a><td> * @return {V|DEFAULT} The value for the given key.<tr><td><a name="l288" href="#l288">288</a><td> * @template DEFAULT<tr><td><a name="l289" href="#l289">289</a><td> */<tr><td><a name="l290" href="#l290">290</a><td>goog.structs.Map.prototype.get = function(key, opt_val) {<tr><td><a name="l291" href="#l291">291</a><td> if (goog.structs.Map.hasKey_(this.map_, key)) {<tr><td><a name="l292" href="#l292">292</a><td> return this.map_[key];<tr><td><a name="l293" href="#l293">293</a><td> }<tr><td><a name="l294" href="#l294">294</a><td> return opt_val;<tr><td><a name="l295" href="#l295">295</a><td>};<tr><td><a name="l296" href="#l296">296</a><td><tr><td><a name="l297" href="#l297">297</a><td><tr><td><a name="l298" href="#l298">298</a><td>/**<tr><td><a name="l299" href="#l299">299</a><td> * Adds a key-value pair to the map.<tr><td><a name="l300" href="#l300">300</a><td> * @param {*} key The key.<tr><td><a name="l301" href="#l301">301</a><td> * @param {V} value The value to add.<tr><td><a name="l302" href="#l302">302</a><td> * @return {*} Some subclasses return a value.<tr><td><a name="l303" href="#l303">303</a><td> */<tr><td><a name="l304" href="#l304">304</a><td>goog.structs.Map.prototype.set = function(key, value) {<tr><td><a name="l305" href="#l305">305</a><td> if (!(goog.structs.Map.hasKey_(this.map_, key))) {<tr><td><a name="l306" href="#l306">306</a><td> this.count_++;<tr><td><a name="l307" href="#l307">307</a><td> this.keys_.push(key);<tr><td><a name="l308" href="#l308">308</a><td> // Only change the version if we add a new key.<tr><td><a name="l309" href="#l309">309</a><td> this.version_++;<tr><td><a name="l310" href="#l310">310</a><td> }<tr><td><a name="l311" href="#l311">311</a><td> this.map_[key] = value;<tr><td><a name="l312" href="#l312">312</a><td>};<tr><td><a name="l313" href="#l313">313</a><td><tr><td><a name="l314" href="#l314">314</a><td><tr><td><a name="l315" href="#l315">315</a><td>/**<tr><td><a name="l316" href="#l316">316</a><td> * Adds multiple key-value pairs from another goog.structs.Map or Object.<tr><td><a name="l317" href="#l317">317</a><td> * @param {Object} map Object containing the data to add.<tr><td><a name="l318" href="#l318">318</a><td> */<tr><td><a name="l319" href="#l319">319</a><td>goog.structs.Map.prototype.addAll = function(map) {<tr><td><a name="l320" href="#l320">320</a><td> var keys, values;<tr><td><a name="l321" href="#l321">321</a><td> if (map instanceof goog.structs.Map) {<tr><td><a name="l322" href="#l322">322</a><td> keys = map.getKeys();<tr><td><a name="l323" href="#l323">323</a><td> values = map.getValues();<tr><td><a name="l324" href="#l324">324</a><td> } else {<tr><td><a name="l325" href="#l325">325</a><td> keys = goog.object.getKeys(map);<tr><td><a name="l326" href="#l326">326</a><td> values = goog.object.getValues(map);<tr><td><a name="l327" href="#l327">327</a><td> }<tr><td><a name="l328" href="#l328">328</a><td> // we could use goog.array.forEach here but I don't want to introduce that<tr><td><a name="l329" href="#l329">329</a><td> // dependency just for this.<tr><td><a name="l330" href="#l330">330</a><td> for (var i = 0; i < keys.length; i++) {<tr><td><a name="l331" href="#l331">331</a><td> this.set(keys[i], values[i]);<tr><td><a name="l332" href="#l332">332</a><td> }<tr><td><a name="l333" href="#l333">333</a><td>};<tr><td><a name="l334" href="#l334">334</a><td><tr><td><a name="l335" href="#l335">335</a><td><tr><td><a name="l336" href="#l336">336</a><td>/**<tr><td><a name="l337" href="#l337">337</a><td> * Calls the given function on each entry in the map.<tr><td><a name="l338" href="#l338">338</a><td> * @param {function(this:T, V, K, goog.structs.Map.<K,V>)} f<tr><td><a name="l339" href="#l339">339</a><td> * @param {T=} opt_obj The value of "this" inside f.<tr><td><a name="l340" href="#l340">340</a><td> * @template T<tr><td><a name="l341" href="#l341">341</a><td> */<tr><td><a name="l342" href="#l342">342</a><td>goog.structs.Map.prototype.forEach = function(f, opt_obj) {<tr><td><a name="l343" href="#l343">343</a><td> var keys = this.getKeys();<tr><td><a name="l344" href="#l344">344</a><td> for (var i = 0; i < keys.length; i++) {<tr><td><a name="l345" href="#l345">345</a><td> var key = keys[i];<tr><td><a name="l346" href="#l346">346</a><td> var value = this.get(key);<tr><td><a name="l347" href="#l347">347</a><td> f.call(opt_obj, value, key, this);<tr><td><a name="l348" href="#l348">348</a><td> }<tr><td><a name="l349" href="#l349">349</a><td>};<tr><td><a name="l350" href="#l350">350</a><td><tr><td><a name="l351" href="#l351">351</a><td><tr><td><a name="l352" href="#l352">352</a><td>/**<tr><td><a name="l353" href="#l353">353</a><td> * Clones a map and returns a new map.<tr><td><a name="l354" href="#l354">354</a><td> * @return {!goog.structs.Map} A new map with the same key-value pairs.<tr><td><a name="l355" href="#l355">355</a><td> */<tr><td><a name="l356" href="#l356">356</a><td>goog.structs.Map.prototype.clone = function() {<tr><td><a name="l357" href="#l357">357</a><td> return new goog.structs.Map(this);<tr><td><a name="l358" href="#l358">358</a><td>};<tr><td><a name="l359" href="#l359">359</a><td><tr><td><a name="l360" href="#l360">360</a><td><tr><td><a name="l361" href="#l361">361</a><td>/**<tr><td><a name="l362" href="#l362">362</a><td> * Returns a new map in which all the keys and values are interchanged<tr><td><a name="l363" href="#l363">363</a><td> * (keys become values and values become keys). If multiple keys map to the<tr><td><a name="l364" href="#l364">364</a><td> * same value, the chosen transposed value is implementation-dependent.<tr><td><a name="l365" href="#l365">365</a><td> *<tr><td><a name="l366" href="#l366">366</a><td> * It acts very similarly to {goog.object.transpose(Object)}.<tr><td><a name="l367" href="#l367">367</a><td> *<tr><td><a name="l368" href="#l368">368</a><td> * @return {!goog.structs.Map} The transposed map.<tr><td><a name="l369" href="#l369">369</a><td> */<tr><td><a name="l370" href="#l370">370</a><td>goog.structs.Map.prototype.transpose = function() {<tr><td><a name="l371" href="#l371">371</a><td> var transposed = new goog.structs.Map();<tr><td><a name="l372" href="#l372">372</a><td> for (var i = 0; i < this.keys_.length; i++) {<tr><td><a name="l373" href="#l373">373</a><td> var key = this.keys_[i];<tr><td><a name="l374" href="#l374">374</a><td> var value = this.map_[key];<tr><td><a name="l375" href="#l375">375</a><td> transposed.set(value, key);<tr><td><a name="l376" href="#l376">376</a><td> }<tr><td><a name="l377" href="#l377">377</a><td><tr><td><a name="l378" href="#l378">378</a><td> return transposed;<tr><td><a name="l379" href="#l379">379</a><td>};<tr><td><a name="l380" href="#l380">380</a><td><tr><td><a name="l381" href="#l381">381</a><td><tr><td><a name="l382" href="#l382">382</a><td>/**<tr><td><a name="l383" href="#l383">383</a><td> * @return {!Object} Object representation of the map.<tr><td><a name="l384" href="#l384">384</a><td> */<tr><td><a name="l385" href="#l385">385</a><td>goog.structs.Map.prototype.toObject = function() {<tr><td><a name="l386" href="#l386">386</a><td> this.cleanupKeysArray_();<tr><td><a name="l387" href="#l387">387</a><td> var obj = {};<tr><td><a name="l388" href="#l388">388</a><td> for (var i = 0; i < this.keys_.length; i++) {<tr><td><a name="l389" href="#l389">389</a><td> var key = this.keys_[i];<tr><td><a name="l390" href="#l390">390</a><td> obj[key] = this.map_[key];<tr><td><a name="l391" href="#l391">391</a><td> }<tr><td><a name="l392" href="#l392">392</a><td> return obj;<tr><td><a name="l393" href="#l393">393</a><td>};<tr><td><a name="l394" href="#l394">394</a><td><tr><td><a name="l395" href="#l395">395</a><td><tr><td><a name="l396" href="#l396">396</a><td>/**<tr><td><a name="l397" href="#l397">397</a><td> * Returns an iterator that iterates over the keys in the map. Removal of keys<tr><td><a name="l398" href="#l398">398</a><td> * while iterating might have undesired side effects.<tr><td><a name="l399" href="#l399">399</a><td> * @return {!goog.iter.Iterator} An iterator over the keys in the map.<tr><td><a name="l400" href="#l400">400</a><td> */<tr><td><a name="l401" href="#l401">401</a><td>goog.structs.Map.prototype.getKeyIterator = function() {<tr><td><a name="l402" href="#l402">402</a><td> return this.__iterator__(true);<tr><td><a name="l403" href="#l403">403</a><td>};<tr><td><a name="l404" href="#l404">404</a><td><tr><td><a name="l405" href="#l405">405</a><td><tr><td><a name="l406" href="#l406">406</a><td>/**<tr><td><a name="l407" href="#l407">407</a><td> * Returns an iterator that iterates over the values in the map. Removal of<tr><td><a name="l408" href="#l408">408</a><td> * keys while iterating might have undesired side effects.<tr><td><a name="l409" href="#l409">409</a><td> * @return {!goog.iter.Iterator} An iterator over the values in the map.<tr><td><a name="l410" href="#l410">410</a><td> */<tr><td><a name="l411" href="#l411">411</a><td>goog.structs.Map.prototype.getValueIterator = function() {<tr><td><a name="l412" href="#l412">412</a><td> return this.__iterator__(false);<tr><td><a name="l413" href="#l413">413</a><td>};<tr><td><a name="l414" href="#l414">414</a><td><tr><td><a name="l415" href="#l415">415</a><td><tr><td><a name="l416" href="#l416">416</a><td>/**<tr><td><a name="l417" href="#l417">417</a><td> * Returns an iterator that iterates over the values or the keys in the map.<tr><td><a name="l418" href="#l418">418</a><td> * This throws an exception if the map was mutated since the iterator was<tr><td><a name="l419" href="#l419">419</a><td> * created.<tr><td><a name="l420" href="#l420">420</a><td> * @param {boolean=} opt_keys True to iterate over the keys. False to iterate<tr><td><a name="l421" href="#l421">421</a><td> * over the values. The default value is false.<tr><td><a name="l422" href="#l422">422</a><td> * @return {!goog.iter.Iterator} An iterator over the values or keys in the map.<tr><td><a name="l423" href="#l423">423</a><td> */<tr><td><a name="l424" href="#l424">424</a><td>goog.structs.Map.prototype.__iterator__ = function(opt_keys) {<tr><td><a name="l425" href="#l425">425</a><td> // Clean up keys to minimize the risk of iterating over dead keys.<tr><td><a name="l426" href="#l426">426</a><td> this.cleanupKeysArray_();<tr><td><a name="l427" href="#l427">427</a><td><tr><td><a name="l428" href="#l428">428</a><td> var i = 0;<tr><td><a name="l429" href="#l429">429</a><td> var keys = this.keys_;<tr><td><a name="l430" href="#l430">430</a><td> var map = this.map_;<tr><td><a name="l431" href="#l431">431</a><td> var version = this.version_;<tr><td><a name="l432" href="#l432">432</a><td> var selfObj = this;<tr><td><a name="l433" href="#l433">433</a><td><tr><td><a name="l434" href="#l434">434</a><td> var newIter = new goog.iter.Iterator;<tr><td><a name="l435" href="#l435">435</a><td> newIter.next = function() {<tr><td><a name="l436" href="#l436">436</a><td> while (true) {<tr><td><a name="l437" href="#l437">437</a><td> if (version != selfObj.version_) {<tr><td><a name="l438" href="#l438">438</a><td> throw Error('The map has changed since the iterator was created');<tr><td><a name="l439" href="#l439">439</a><td> }<tr><td><a name="l440" href="#l440">440</a><td> if (i >= keys.length) {<tr><td><a name="l441" href="#l441">441</a><td> throw goog.iter.StopIteration;<tr><td><a name="l442" href="#l442">442</a><td> }<tr><td><a name="l443" href="#l443">443</a><td> var key = keys[i++];<tr><td><a name="l444" href="#l444">444</a><td> return opt_keys ? key : map[key];<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> return newIter;<tr><td><a name="l448" href="#l448">448</a><td>};<tr><td><a name="l449" href="#l449">449</a><td><tr><td><a name="l450" href="#l450">450</a><td><tr><td><a name="l451" href="#l451">451</a><td>/**<tr><td><a name="l452" href="#l452">452</a><td> * Safe way to test for hasOwnProperty. It even allows testing for<tr><td><a name="l453" href="#l453">453</a><td> * 'hasOwnProperty'.<tr><td><a name="l454" href="#l454">454</a><td> * @param {Object} obj The object to test for presence of the given key.<tr><td><a name="l455" href="#l455">455</a><td> * @param {*} key The key to check for.<tr><td><a name="l456" href="#l456">456</a><td> * @return {boolean} Whether the object has the key.<tr><td><a name="l457" href="#l457">457</a><td> * @private<tr><td><a name="l458" href="#l458">458</a><td> */<tr><td><a name="l459" href="#l459">459</a><td>goog.structs.Map.hasKey_ = function(obj, key) {<tr><td><a name="l460" href="#l460">460</a><td> return Object.prototype.hasOwnProperty.call(obj, key);<tr><td><a name="l461" href="#l461">461</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> |