blob: 91f04259e32501e7158d9c3d4b99cc4cf3b05beb [file] [log] [blame]
<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Source of the Rust file `/root/.cargo/registry/src/github.com-1ecc6299db9ec823/hashbrown-0.12.3/src/map.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>map.rs - source</title><link rel="preload" as="font" type="font/woff2" crossorigin href="../../SourceSerif4-Regular.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../FiraSans-Regular.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../FiraSans-Medium.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../SourceCodePro-Regular.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../SourceSerif4-Bold.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../SourceCodePro-Semibold.ttf.woff2"><link rel="stylesheet" href="../../normalize.css"><link rel="stylesheet" href="../../rustdoc.css" id="mainThemeStyle"><link rel="stylesheet" href="../../ayu.css" disabled><link rel="stylesheet" href="../../dark.css" disabled><link rel="stylesheet" href="../../light.css" id="themeStyle"><script id="default-settings" ></script><script src="../../storage.js"></script><script defer src="../../source-script.js"></script><script defer src="../../source-files.js"></script><script defer src="../../main.js"></script><noscript><link rel="stylesheet" href="../../noscript.css"></noscript><link rel="alternate icon" type="image/png" href="../../favicon-16x16.png"><link rel="alternate icon" type="image/png" href="../../favicon-32x32.png"><link rel="icon" type="image/svg+xml" href="../../favicon.svg"></head><body class="rustdoc source"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="sidebar"><a class="sidebar-logo" href="../../hashbrown/index.html"><div class="logo-container"><img class="rust-logo" src="../../rust-logo.svg" alt="logo"></div></a></nav><main><div class="width-limiter"><nav class="sub"><a class="sub-logo-container" href="../../hashbrown/index.html"><img class="rust-logo" src="../../rust-logo.svg" alt="logo"></a><form class="search-form"><div class="search-container"><span></span><input class="search-input" name="search" autocomplete="off" spellcheck="false" placeholder="Click or press ‘S’ to search, ‘?’ for more options…" type="search"><div id="help-button" title="help" tabindex="-1"><a href="../../help.html">?</a></div><div id="settings-menu" tabindex="-1"><a href="../../settings.html" title="settings"><img width="22" height="22" alt="Change settings" src="../../wheel.svg"></a></div></div></form></nav><section id="main-content" class="content"><div class="example-wrap"><pre class="src-line-numbers"><span id="1">1</span>
<span id="2">2</span>
<span id="3">3</span>
<span id="4">4</span>
<span id="5">5</span>
<span id="6">6</span>
<span id="7">7</span>
<span id="8">8</span>
<span id="9">9</span>
<span id="10">10</span>
<span id="11">11</span>
<span id="12">12</span>
<span id="13">13</span>
<span id="14">14</span>
<span id="15">15</span>
<span id="16">16</span>
<span id="17">17</span>
<span id="18">18</span>
<span id="19">19</span>
<span id="20">20</span>
<span id="21">21</span>
<span id="22">22</span>
<span id="23">23</span>
<span id="24">24</span>
<span id="25">25</span>
<span id="26">26</span>
<span id="27">27</span>
<span id="28">28</span>
<span id="29">29</span>
<span id="30">30</span>
<span id="31">31</span>
<span id="32">32</span>
<span id="33">33</span>
<span id="34">34</span>
<span id="35">35</span>
<span id="36">36</span>
<span id="37">37</span>
<span id="38">38</span>
<span id="39">39</span>
<span id="40">40</span>
<span id="41">41</span>
<span id="42">42</span>
<span id="43">43</span>
<span id="44">44</span>
<span id="45">45</span>
<span id="46">46</span>
<span id="47">47</span>
<span id="48">48</span>
<span id="49">49</span>
<span id="50">50</span>
<span id="51">51</span>
<span id="52">52</span>
<span id="53">53</span>
<span id="54">54</span>
<span id="55">55</span>
<span id="56">56</span>
<span id="57">57</span>
<span id="58">58</span>
<span id="59">59</span>
<span id="60">60</span>
<span id="61">61</span>
<span id="62">62</span>
<span id="63">63</span>
<span id="64">64</span>
<span id="65">65</span>
<span id="66">66</span>
<span id="67">67</span>
<span id="68">68</span>
<span id="69">69</span>
<span id="70">70</span>
<span id="71">71</span>
<span id="72">72</span>
<span id="73">73</span>
<span id="74">74</span>
<span id="75">75</span>
<span id="76">76</span>
<span id="77">77</span>
<span id="78">78</span>
<span id="79">79</span>
<span id="80">80</span>
<span id="81">81</span>
<span id="82">82</span>
<span id="83">83</span>
<span id="84">84</span>
<span id="85">85</span>
<span id="86">86</span>
<span id="87">87</span>
<span id="88">88</span>
<span id="89">89</span>
<span id="90">90</span>
<span id="91">91</span>
<span id="92">92</span>
<span id="93">93</span>
<span id="94">94</span>
<span id="95">95</span>
<span id="96">96</span>
<span id="97">97</span>
<span id="98">98</span>
<span id="99">99</span>
<span id="100">100</span>
<span id="101">101</span>
<span id="102">102</span>
<span id="103">103</span>
<span id="104">104</span>
<span id="105">105</span>
<span id="106">106</span>
<span id="107">107</span>
<span id="108">108</span>
<span id="109">109</span>
<span id="110">110</span>
<span id="111">111</span>
<span id="112">112</span>
<span id="113">113</span>
<span id="114">114</span>
<span id="115">115</span>
<span id="116">116</span>
<span id="117">117</span>
<span id="118">118</span>
<span id="119">119</span>
<span id="120">120</span>
<span id="121">121</span>
<span id="122">122</span>
<span id="123">123</span>
<span id="124">124</span>
<span id="125">125</span>
<span id="126">126</span>
<span id="127">127</span>
<span id="128">128</span>
<span id="129">129</span>
<span id="130">130</span>
<span id="131">131</span>
<span id="132">132</span>
<span id="133">133</span>
<span id="134">134</span>
<span id="135">135</span>
<span id="136">136</span>
<span id="137">137</span>
<span id="138">138</span>
<span id="139">139</span>
<span id="140">140</span>
<span id="141">141</span>
<span id="142">142</span>
<span id="143">143</span>
<span id="144">144</span>
<span id="145">145</span>
<span id="146">146</span>
<span id="147">147</span>
<span id="148">148</span>
<span id="149">149</span>
<span id="150">150</span>
<span id="151">151</span>
<span id="152">152</span>
<span id="153">153</span>
<span id="154">154</span>
<span id="155">155</span>
<span id="156">156</span>
<span id="157">157</span>
<span id="158">158</span>
<span id="159">159</span>
<span id="160">160</span>
<span id="161">161</span>
<span id="162">162</span>
<span id="163">163</span>
<span id="164">164</span>
<span id="165">165</span>
<span id="166">166</span>
<span id="167">167</span>
<span id="168">168</span>
<span id="169">169</span>
<span id="170">170</span>
<span id="171">171</span>
<span id="172">172</span>
<span id="173">173</span>
<span id="174">174</span>
<span id="175">175</span>
<span id="176">176</span>
<span id="177">177</span>
<span id="178">178</span>
<span id="179">179</span>
<span id="180">180</span>
<span id="181">181</span>
<span id="182">182</span>
<span id="183">183</span>
<span id="184">184</span>
<span id="185">185</span>
<span id="186">186</span>
<span id="187">187</span>
<span id="188">188</span>
<span id="189">189</span>
<span id="190">190</span>
<span id="191">191</span>
<span id="192">192</span>
<span id="193">193</span>
<span id="194">194</span>
<span id="195">195</span>
<span id="196">196</span>
<span id="197">197</span>
<span id="198">198</span>
<span id="199">199</span>
<span id="200">200</span>
<span id="201">201</span>
<span id="202">202</span>
<span id="203">203</span>
<span id="204">204</span>
<span id="205">205</span>
<span id="206">206</span>
<span id="207">207</span>
<span id="208">208</span>
<span id="209">209</span>
<span id="210">210</span>
<span id="211">211</span>
<span id="212">212</span>
<span id="213">213</span>
<span id="214">214</span>
<span id="215">215</span>
<span id="216">216</span>
<span id="217">217</span>
<span id="218">218</span>
<span id="219">219</span>
<span id="220">220</span>
<span id="221">221</span>
<span id="222">222</span>
<span id="223">223</span>
<span id="224">224</span>
<span id="225">225</span>
<span id="226">226</span>
<span id="227">227</span>
<span id="228">228</span>
<span id="229">229</span>
<span id="230">230</span>
<span id="231">231</span>
<span id="232">232</span>
<span id="233">233</span>
<span id="234">234</span>
<span id="235">235</span>
<span id="236">236</span>
<span id="237">237</span>
<span id="238">238</span>
<span id="239">239</span>
<span id="240">240</span>
<span id="241">241</span>
<span id="242">242</span>
<span id="243">243</span>
<span id="244">244</span>
<span id="245">245</span>
<span id="246">246</span>
<span id="247">247</span>
<span id="248">248</span>
<span id="249">249</span>
<span id="250">250</span>
<span id="251">251</span>
<span id="252">252</span>
<span id="253">253</span>
<span id="254">254</span>
<span id="255">255</span>
<span id="256">256</span>
<span id="257">257</span>
<span id="258">258</span>
<span id="259">259</span>
<span id="260">260</span>
<span id="261">261</span>
<span id="262">262</span>
<span id="263">263</span>
<span id="264">264</span>
<span id="265">265</span>
<span id="266">266</span>
<span id="267">267</span>
<span id="268">268</span>
<span id="269">269</span>
<span id="270">270</span>
<span id="271">271</span>
<span id="272">272</span>
<span id="273">273</span>
<span id="274">274</span>
<span id="275">275</span>
<span id="276">276</span>
<span id="277">277</span>
<span id="278">278</span>
<span id="279">279</span>
<span id="280">280</span>
<span id="281">281</span>
<span id="282">282</span>
<span id="283">283</span>
<span id="284">284</span>
<span id="285">285</span>
<span id="286">286</span>
<span id="287">287</span>
<span id="288">288</span>
<span id="289">289</span>
<span id="290">290</span>
<span id="291">291</span>
<span id="292">292</span>
<span id="293">293</span>
<span id="294">294</span>
<span id="295">295</span>
<span id="296">296</span>
<span id="297">297</span>
<span id="298">298</span>
<span id="299">299</span>
<span id="300">300</span>
<span id="301">301</span>
<span id="302">302</span>
<span id="303">303</span>
<span id="304">304</span>
<span id="305">305</span>
<span id="306">306</span>
<span id="307">307</span>
<span id="308">308</span>
<span id="309">309</span>
<span id="310">310</span>
<span id="311">311</span>
<span id="312">312</span>
<span id="313">313</span>
<span id="314">314</span>
<span id="315">315</span>
<span id="316">316</span>
<span id="317">317</span>
<span id="318">318</span>
<span id="319">319</span>
<span id="320">320</span>
<span id="321">321</span>
<span id="322">322</span>
<span id="323">323</span>
<span id="324">324</span>
<span id="325">325</span>
<span id="326">326</span>
<span id="327">327</span>
<span id="328">328</span>
<span id="329">329</span>
<span id="330">330</span>
<span id="331">331</span>
<span id="332">332</span>
<span id="333">333</span>
<span id="334">334</span>
<span id="335">335</span>
<span id="336">336</span>
<span id="337">337</span>
<span id="338">338</span>
<span id="339">339</span>
<span id="340">340</span>
<span id="341">341</span>
<span id="342">342</span>
<span id="343">343</span>
<span id="344">344</span>
<span id="345">345</span>
<span id="346">346</span>
<span id="347">347</span>
<span id="348">348</span>
<span id="349">349</span>
<span id="350">350</span>
<span id="351">351</span>
<span id="352">352</span>
<span id="353">353</span>
<span id="354">354</span>
<span id="355">355</span>
<span id="356">356</span>
<span id="357">357</span>
<span id="358">358</span>
<span id="359">359</span>
<span id="360">360</span>
<span id="361">361</span>
<span id="362">362</span>
<span id="363">363</span>
<span id="364">364</span>
<span id="365">365</span>
<span id="366">366</span>
<span id="367">367</span>
<span id="368">368</span>
<span id="369">369</span>
<span id="370">370</span>
<span id="371">371</span>
<span id="372">372</span>
<span id="373">373</span>
<span id="374">374</span>
<span id="375">375</span>
<span id="376">376</span>
<span id="377">377</span>
<span id="378">378</span>
<span id="379">379</span>
<span id="380">380</span>
<span id="381">381</span>
<span id="382">382</span>
<span id="383">383</span>
<span id="384">384</span>
<span id="385">385</span>
<span id="386">386</span>
<span id="387">387</span>
<span id="388">388</span>
<span id="389">389</span>
<span id="390">390</span>
<span id="391">391</span>
<span id="392">392</span>
<span id="393">393</span>
<span id="394">394</span>
<span id="395">395</span>
<span id="396">396</span>
<span id="397">397</span>
<span id="398">398</span>
<span id="399">399</span>
<span id="400">400</span>
<span id="401">401</span>
<span id="402">402</span>
<span id="403">403</span>
<span id="404">404</span>
<span id="405">405</span>
<span id="406">406</span>
<span id="407">407</span>
<span id="408">408</span>
<span id="409">409</span>
<span id="410">410</span>
<span id="411">411</span>
<span id="412">412</span>
<span id="413">413</span>
<span id="414">414</span>
<span id="415">415</span>
<span id="416">416</span>
<span id="417">417</span>
<span id="418">418</span>
<span id="419">419</span>
<span id="420">420</span>
<span id="421">421</span>
<span id="422">422</span>
<span id="423">423</span>
<span id="424">424</span>
<span id="425">425</span>
<span id="426">426</span>
<span id="427">427</span>
<span id="428">428</span>
<span id="429">429</span>
<span id="430">430</span>
<span id="431">431</span>
<span id="432">432</span>
<span id="433">433</span>
<span id="434">434</span>
<span id="435">435</span>
<span id="436">436</span>
<span id="437">437</span>
<span id="438">438</span>
<span id="439">439</span>
<span id="440">440</span>
<span id="441">441</span>
<span id="442">442</span>
<span id="443">443</span>
<span id="444">444</span>
<span id="445">445</span>
<span id="446">446</span>
<span id="447">447</span>
<span id="448">448</span>
<span id="449">449</span>
<span id="450">450</span>
<span id="451">451</span>
<span id="452">452</span>
<span id="453">453</span>
<span id="454">454</span>
<span id="455">455</span>
<span id="456">456</span>
<span id="457">457</span>
<span id="458">458</span>
<span id="459">459</span>
<span id="460">460</span>
<span id="461">461</span>
<span id="462">462</span>
<span id="463">463</span>
<span id="464">464</span>
<span id="465">465</span>
<span id="466">466</span>
<span id="467">467</span>
<span id="468">468</span>
<span id="469">469</span>
<span id="470">470</span>
<span id="471">471</span>
<span id="472">472</span>
<span id="473">473</span>
<span id="474">474</span>
<span id="475">475</span>
<span id="476">476</span>
<span id="477">477</span>
<span id="478">478</span>
<span id="479">479</span>
<span id="480">480</span>
<span id="481">481</span>
<span id="482">482</span>
<span id="483">483</span>
<span id="484">484</span>
<span id="485">485</span>
<span id="486">486</span>
<span id="487">487</span>
<span id="488">488</span>
<span id="489">489</span>
<span id="490">490</span>
<span id="491">491</span>
<span id="492">492</span>
<span id="493">493</span>
<span id="494">494</span>
<span id="495">495</span>
<span id="496">496</span>
<span id="497">497</span>
<span id="498">498</span>
<span id="499">499</span>
<span id="500">500</span>
<span id="501">501</span>
<span id="502">502</span>
<span id="503">503</span>
<span id="504">504</span>
<span id="505">505</span>
<span id="506">506</span>
<span id="507">507</span>
<span id="508">508</span>
<span id="509">509</span>
<span id="510">510</span>
<span id="511">511</span>
<span id="512">512</span>
<span id="513">513</span>
<span id="514">514</span>
<span id="515">515</span>
<span id="516">516</span>
<span id="517">517</span>
<span id="518">518</span>
<span id="519">519</span>
<span id="520">520</span>
<span id="521">521</span>
<span id="522">522</span>
<span id="523">523</span>
<span id="524">524</span>
<span id="525">525</span>
<span id="526">526</span>
<span id="527">527</span>
<span id="528">528</span>
<span id="529">529</span>
<span id="530">530</span>
<span id="531">531</span>
<span id="532">532</span>
<span id="533">533</span>
<span id="534">534</span>
<span id="535">535</span>
<span id="536">536</span>
<span id="537">537</span>
<span id="538">538</span>
<span id="539">539</span>
<span id="540">540</span>
<span id="541">541</span>
<span id="542">542</span>
<span id="543">543</span>
<span id="544">544</span>
<span id="545">545</span>
<span id="546">546</span>
<span id="547">547</span>
<span id="548">548</span>
<span id="549">549</span>
<span id="550">550</span>
<span id="551">551</span>
<span id="552">552</span>
<span id="553">553</span>
<span id="554">554</span>
<span id="555">555</span>
<span id="556">556</span>
<span id="557">557</span>
<span id="558">558</span>
<span id="559">559</span>
<span id="560">560</span>
<span id="561">561</span>
<span id="562">562</span>
<span id="563">563</span>
<span id="564">564</span>
<span id="565">565</span>
<span id="566">566</span>
<span id="567">567</span>
<span id="568">568</span>
<span id="569">569</span>
<span id="570">570</span>
<span id="571">571</span>
<span id="572">572</span>
<span id="573">573</span>
<span id="574">574</span>
<span id="575">575</span>
<span id="576">576</span>
<span id="577">577</span>
<span id="578">578</span>
<span id="579">579</span>
<span id="580">580</span>
<span id="581">581</span>
<span id="582">582</span>
<span id="583">583</span>
<span id="584">584</span>
<span id="585">585</span>
<span id="586">586</span>
<span id="587">587</span>
<span id="588">588</span>
<span id="589">589</span>
<span id="590">590</span>
<span id="591">591</span>
<span id="592">592</span>
<span id="593">593</span>
<span id="594">594</span>
<span id="595">595</span>
<span id="596">596</span>
<span id="597">597</span>
<span id="598">598</span>
<span id="599">599</span>
<span id="600">600</span>
<span id="601">601</span>
<span id="602">602</span>
<span id="603">603</span>
<span id="604">604</span>
<span id="605">605</span>
<span id="606">606</span>
<span id="607">607</span>
<span id="608">608</span>
<span id="609">609</span>
<span id="610">610</span>
<span id="611">611</span>
<span id="612">612</span>
<span id="613">613</span>
<span id="614">614</span>
<span id="615">615</span>
<span id="616">616</span>
<span id="617">617</span>
<span id="618">618</span>
<span id="619">619</span>
<span id="620">620</span>
<span id="621">621</span>
<span id="622">622</span>
<span id="623">623</span>
<span id="624">624</span>
<span id="625">625</span>
<span id="626">626</span>
<span id="627">627</span>
<span id="628">628</span>
<span id="629">629</span>
<span id="630">630</span>
<span id="631">631</span>
<span id="632">632</span>
<span id="633">633</span>
<span id="634">634</span>
<span id="635">635</span>
<span id="636">636</span>
<span id="637">637</span>
<span id="638">638</span>
<span id="639">639</span>
<span id="640">640</span>
<span id="641">641</span>
<span id="642">642</span>
<span id="643">643</span>
<span id="644">644</span>
<span id="645">645</span>
<span id="646">646</span>
<span id="647">647</span>
<span id="648">648</span>
<span id="649">649</span>
<span id="650">650</span>
<span id="651">651</span>
<span id="652">652</span>
<span id="653">653</span>
<span id="654">654</span>
<span id="655">655</span>
<span id="656">656</span>
<span id="657">657</span>
<span id="658">658</span>
<span id="659">659</span>
<span id="660">660</span>
<span id="661">661</span>
<span id="662">662</span>
<span id="663">663</span>
<span id="664">664</span>
<span id="665">665</span>
<span id="666">666</span>
<span id="667">667</span>
<span id="668">668</span>
<span id="669">669</span>
<span id="670">670</span>
<span id="671">671</span>
<span id="672">672</span>
<span id="673">673</span>
<span id="674">674</span>
<span id="675">675</span>
<span id="676">676</span>
<span id="677">677</span>
<span id="678">678</span>
<span id="679">679</span>
<span id="680">680</span>
<span id="681">681</span>
<span id="682">682</span>
<span id="683">683</span>
<span id="684">684</span>
<span id="685">685</span>
<span id="686">686</span>
<span id="687">687</span>
<span id="688">688</span>
<span id="689">689</span>
<span id="690">690</span>
<span id="691">691</span>
<span id="692">692</span>
<span id="693">693</span>
<span id="694">694</span>
<span id="695">695</span>
<span id="696">696</span>
<span id="697">697</span>
<span id="698">698</span>
<span id="699">699</span>
<span id="700">700</span>
<span id="701">701</span>
<span id="702">702</span>
<span id="703">703</span>
<span id="704">704</span>
<span id="705">705</span>
<span id="706">706</span>
<span id="707">707</span>
<span id="708">708</span>
<span id="709">709</span>
<span id="710">710</span>
<span id="711">711</span>
<span id="712">712</span>
<span id="713">713</span>
<span id="714">714</span>
<span id="715">715</span>
<span id="716">716</span>
<span id="717">717</span>
<span id="718">718</span>
<span id="719">719</span>
<span id="720">720</span>
<span id="721">721</span>
<span id="722">722</span>
<span id="723">723</span>
<span id="724">724</span>
<span id="725">725</span>
<span id="726">726</span>
<span id="727">727</span>
<span id="728">728</span>
<span id="729">729</span>
<span id="730">730</span>
<span id="731">731</span>
<span id="732">732</span>
<span id="733">733</span>
<span id="734">734</span>
<span id="735">735</span>
<span id="736">736</span>
<span id="737">737</span>
<span id="738">738</span>
<span id="739">739</span>
<span id="740">740</span>
<span id="741">741</span>
<span id="742">742</span>
<span id="743">743</span>
<span id="744">744</span>
<span id="745">745</span>
<span id="746">746</span>
<span id="747">747</span>
<span id="748">748</span>
<span id="749">749</span>
<span id="750">750</span>
<span id="751">751</span>
<span id="752">752</span>
<span id="753">753</span>
<span id="754">754</span>
<span id="755">755</span>
<span id="756">756</span>
<span id="757">757</span>
<span id="758">758</span>
<span id="759">759</span>
<span id="760">760</span>
<span id="761">761</span>
<span id="762">762</span>
<span id="763">763</span>
<span id="764">764</span>
<span id="765">765</span>
<span id="766">766</span>
<span id="767">767</span>
<span id="768">768</span>
<span id="769">769</span>
<span id="770">770</span>
<span id="771">771</span>
<span id="772">772</span>
<span id="773">773</span>
<span id="774">774</span>
<span id="775">775</span>
<span id="776">776</span>
<span id="777">777</span>
<span id="778">778</span>
<span id="779">779</span>
<span id="780">780</span>
<span id="781">781</span>
<span id="782">782</span>
<span id="783">783</span>
<span id="784">784</span>
<span id="785">785</span>
<span id="786">786</span>
<span id="787">787</span>
<span id="788">788</span>
<span id="789">789</span>
<span id="790">790</span>
<span id="791">791</span>
<span id="792">792</span>
<span id="793">793</span>
<span id="794">794</span>
<span id="795">795</span>
<span id="796">796</span>
<span id="797">797</span>
<span id="798">798</span>
<span id="799">799</span>
<span id="800">800</span>
<span id="801">801</span>
<span id="802">802</span>
<span id="803">803</span>
<span id="804">804</span>
<span id="805">805</span>
<span id="806">806</span>
<span id="807">807</span>
<span id="808">808</span>
<span id="809">809</span>
<span id="810">810</span>
<span id="811">811</span>
<span id="812">812</span>
<span id="813">813</span>
<span id="814">814</span>
<span id="815">815</span>
<span id="816">816</span>
<span id="817">817</span>
<span id="818">818</span>
<span id="819">819</span>
<span id="820">820</span>
<span id="821">821</span>
<span id="822">822</span>
<span id="823">823</span>
<span id="824">824</span>
<span id="825">825</span>
<span id="826">826</span>
<span id="827">827</span>
<span id="828">828</span>
<span id="829">829</span>
<span id="830">830</span>
<span id="831">831</span>
<span id="832">832</span>
<span id="833">833</span>
<span id="834">834</span>
<span id="835">835</span>
<span id="836">836</span>
<span id="837">837</span>
<span id="838">838</span>
<span id="839">839</span>
<span id="840">840</span>
<span id="841">841</span>
<span id="842">842</span>
<span id="843">843</span>
<span id="844">844</span>
<span id="845">845</span>
<span id="846">846</span>
<span id="847">847</span>
<span id="848">848</span>
<span id="849">849</span>
<span id="850">850</span>
<span id="851">851</span>
<span id="852">852</span>
<span id="853">853</span>
<span id="854">854</span>
<span id="855">855</span>
<span id="856">856</span>
<span id="857">857</span>
<span id="858">858</span>
<span id="859">859</span>
<span id="860">860</span>
<span id="861">861</span>
<span id="862">862</span>
<span id="863">863</span>
<span id="864">864</span>
<span id="865">865</span>
<span id="866">866</span>
<span id="867">867</span>
<span id="868">868</span>
<span id="869">869</span>
<span id="870">870</span>
<span id="871">871</span>
<span id="872">872</span>
<span id="873">873</span>
<span id="874">874</span>
<span id="875">875</span>
<span id="876">876</span>
<span id="877">877</span>
<span id="878">878</span>
<span id="879">879</span>
<span id="880">880</span>
<span id="881">881</span>
<span id="882">882</span>
<span id="883">883</span>
<span id="884">884</span>
<span id="885">885</span>
<span id="886">886</span>
<span id="887">887</span>
<span id="888">888</span>
<span id="889">889</span>
<span id="890">890</span>
<span id="891">891</span>
<span id="892">892</span>
<span id="893">893</span>
<span id="894">894</span>
<span id="895">895</span>
<span id="896">896</span>
<span id="897">897</span>
<span id="898">898</span>
<span id="899">899</span>
<span id="900">900</span>
<span id="901">901</span>
<span id="902">902</span>
<span id="903">903</span>
<span id="904">904</span>
<span id="905">905</span>
<span id="906">906</span>
<span id="907">907</span>
<span id="908">908</span>
<span id="909">909</span>
<span id="910">910</span>
<span id="911">911</span>
<span id="912">912</span>
<span id="913">913</span>
<span id="914">914</span>
<span id="915">915</span>
<span id="916">916</span>
<span id="917">917</span>
<span id="918">918</span>
<span id="919">919</span>
<span id="920">920</span>
<span id="921">921</span>
<span id="922">922</span>
<span id="923">923</span>
<span id="924">924</span>
<span id="925">925</span>
<span id="926">926</span>
<span id="927">927</span>
<span id="928">928</span>
<span id="929">929</span>
<span id="930">930</span>
<span id="931">931</span>
<span id="932">932</span>
<span id="933">933</span>
<span id="934">934</span>
<span id="935">935</span>
<span id="936">936</span>
<span id="937">937</span>
<span id="938">938</span>
<span id="939">939</span>
<span id="940">940</span>
<span id="941">941</span>
<span id="942">942</span>
<span id="943">943</span>
<span id="944">944</span>
<span id="945">945</span>
<span id="946">946</span>
<span id="947">947</span>
<span id="948">948</span>
<span id="949">949</span>
<span id="950">950</span>
<span id="951">951</span>
<span id="952">952</span>
<span id="953">953</span>
<span id="954">954</span>
<span id="955">955</span>
<span id="956">956</span>
<span id="957">957</span>
<span id="958">958</span>
<span id="959">959</span>
<span id="960">960</span>
<span id="961">961</span>
<span id="962">962</span>
<span id="963">963</span>
<span id="964">964</span>
<span id="965">965</span>
<span id="966">966</span>
<span id="967">967</span>
<span id="968">968</span>
<span id="969">969</span>
<span id="970">970</span>
<span id="971">971</span>
<span id="972">972</span>
<span id="973">973</span>
<span id="974">974</span>
<span id="975">975</span>
<span id="976">976</span>
<span id="977">977</span>
<span id="978">978</span>
<span id="979">979</span>
<span id="980">980</span>
<span id="981">981</span>
<span id="982">982</span>
<span id="983">983</span>
<span id="984">984</span>
<span id="985">985</span>
<span id="986">986</span>
<span id="987">987</span>
<span id="988">988</span>
<span id="989">989</span>
<span id="990">990</span>
<span id="991">991</span>
<span id="992">992</span>
<span id="993">993</span>
<span id="994">994</span>
<span id="995">995</span>
<span id="996">996</span>
<span id="997">997</span>
<span id="998">998</span>
<span id="999">999</span>
<span id="1000">1000</span>
<span id="1001">1001</span>
<span id="1002">1002</span>
<span id="1003">1003</span>
<span id="1004">1004</span>
<span id="1005">1005</span>
<span id="1006">1006</span>
<span id="1007">1007</span>
<span id="1008">1008</span>
<span id="1009">1009</span>
<span id="1010">1010</span>
<span id="1011">1011</span>
<span id="1012">1012</span>
<span id="1013">1013</span>
<span id="1014">1014</span>
<span id="1015">1015</span>
<span id="1016">1016</span>
<span id="1017">1017</span>
<span id="1018">1018</span>
<span id="1019">1019</span>
<span id="1020">1020</span>
<span id="1021">1021</span>
<span id="1022">1022</span>
<span id="1023">1023</span>
<span id="1024">1024</span>
<span id="1025">1025</span>
<span id="1026">1026</span>
<span id="1027">1027</span>
<span id="1028">1028</span>
<span id="1029">1029</span>
<span id="1030">1030</span>
<span id="1031">1031</span>
<span id="1032">1032</span>
<span id="1033">1033</span>
<span id="1034">1034</span>
<span id="1035">1035</span>
<span id="1036">1036</span>
<span id="1037">1037</span>
<span id="1038">1038</span>
<span id="1039">1039</span>
<span id="1040">1040</span>
<span id="1041">1041</span>
<span id="1042">1042</span>
<span id="1043">1043</span>
<span id="1044">1044</span>
<span id="1045">1045</span>
<span id="1046">1046</span>
<span id="1047">1047</span>
<span id="1048">1048</span>
<span id="1049">1049</span>
<span id="1050">1050</span>
<span id="1051">1051</span>
<span id="1052">1052</span>
<span id="1053">1053</span>
<span id="1054">1054</span>
<span id="1055">1055</span>
<span id="1056">1056</span>
<span id="1057">1057</span>
<span id="1058">1058</span>
<span id="1059">1059</span>
<span id="1060">1060</span>
<span id="1061">1061</span>
<span id="1062">1062</span>
<span id="1063">1063</span>
<span id="1064">1064</span>
<span id="1065">1065</span>
<span id="1066">1066</span>
<span id="1067">1067</span>
<span id="1068">1068</span>
<span id="1069">1069</span>
<span id="1070">1070</span>
<span id="1071">1071</span>
<span id="1072">1072</span>
<span id="1073">1073</span>
<span id="1074">1074</span>
<span id="1075">1075</span>
<span id="1076">1076</span>
<span id="1077">1077</span>
<span id="1078">1078</span>
<span id="1079">1079</span>
<span id="1080">1080</span>
<span id="1081">1081</span>
<span id="1082">1082</span>
<span id="1083">1083</span>
<span id="1084">1084</span>
<span id="1085">1085</span>
<span id="1086">1086</span>
<span id="1087">1087</span>
<span id="1088">1088</span>
<span id="1089">1089</span>
<span id="1090">1090</span>
<span id="1091">1091</span>
<span id="1092">1092</span>
<span id="1093">1093</span>
<span id="1094">1094</span>
<span id="1095">1095</span>
<span id="1096">1096</span>
<span id="1097">1097</span>
<span id="1098">1098</span>
<span id="1099">1099</span>
<span id="1100">1100</span>
<span id="1101">1101</span>
<span id="1102">1102</span>
<span id="1103">1103</span>
<span id="1104">1104</span>
<span id="1105">1105</span>
<span id="1106">1106</span>
<span id="1107">1107</span>
<span id="1108">1108</span>
<span id="1109">1109</span>
<span id="1110">1110</span>
<span id="1111">1111</span>
<span id="1112">1112</span>
<span id="1113">1113</span>
<span id="1114">1114</span>
<span id="1115">1115</span>
<span id="1116">1116</span>
<span id="1117">1117</span>
<span id="1118">1118</span>
<span id="1119">1119</span>
<span id="1120">1120</span>
<span id="1121">1121</span>
<span id="1122">1122</span>
<span id="1123">1123</span>
<span id="1124">1124</span>
<span id="1125">1125</span>
<span id="1126">1126</span>
<span id="1127">1127</span>
<span id="1128">1128</span>
<span id="1129">1129</span>
<span id="1130">1130</span>
<span id="1131">1131</span>
<span id="1132">1132</span>
<span id="1133">1133</span>
<span id="1134">1134</span>
<span id="1135">1135</span>
<span id="1136">1136</span>
<span id="1137">1137</span>
<span id="1138">1138</span>
<span id="1139">1139</span>
<span id="1140">1140</span>
<span id="1141">1141</span>
<span id="1142">1142</span>
<span id="1143">1143</span>
<span id="1144">1144</span>
<span id="1145">1145</span>
<span id="1146">1146</span>
<span id="1147">1147</span>
<span id="1148">1148</span>
<span id="1149">1149</span>
<span id="1150">1150</span>
<span id="1151">1151</span>
<span id="1152">1152</span>
<span id="1153">1153</span>
<span id="1154">1154</span>
<span id="1155">1155</span>
<span id="1156">1156</span>
<span id="1157">1157</span>
<span id="1158">1158</span>
<span id="1159">1159</span>
<span id="1160">1160</span>
<span id="1161">1161</span>
<span id="1162">1162</span>
<span id="1163">1163</span>
<span id="1164">1164</span>
<span id="1165">1165</span>
<span id="1166">1166</span>
<span id="1167">1167</span>
<span id="1168">1168</span>
<span id="1169">1169</span>
<span id="1170">1170</span>
<span id="1171">1171</span>
<span id="1172">1172</span>
<span id="1173">1173</span>
<span id="1174">1174</span>
<span id="1175">1175</span>
<span id="1176">1176</span>
<span id="1177">1177</span>
<span id="1178">1178</span>
<span id="1179">1179</span>
<span id="1180">1180</span>
<span id="1181">1181</span>
<span id="1182">1182</span>
<span id="1183">1183</span>
<span id="1184">1184</span>
<span id="1185">1185</span>
<span id="1186">1186</span>
<span id="1187">1187</span>
<span id="1188">1188</span>
<span id="1189">1189</span>
<span id="1190">1190</span>
<span id="1191">1191</span>
<span id="1192">1192</span>
<span id="1193">1193</span>
<span id="1194">1194</span>
<span id="1195">1195</span>
<span id="1196">1196</span>
<span id="1197">1197</span>
<span id="1198">1198</span>
<span id="1199">1199</span>
<span id="1200">1200</span>
<span id="1201">1201</span>
<span id="1202">1202</span>
<span id="1203">1203</span>
<span id="1204">1204</span>
<span id="1205">1205</span>
<span id="1206">1206</span>
<span id="1207">1207</span>
<span id="1208">1208</span>
<span id="1209">1209</span>
<span id="1210">1210</span>
<span id="1211">1211</span>
<span id="1212">1212</span>
<span id="1213">1213</span>
<span id="1214">1214</span>
<span id="1215">1215</span>
<span id="1216">1216</span>
<span id="1217">1217</span>
<span id="1218">1218</span>
<span id="1219">1219</span>
<span id="1220">1220</span>
<span id="1221">1221</span>
<span id="1222">1222</span>
<span id="1223">1223</span>
<span id="1224">1224</span>
<span id="1225">1225</span>
<span id="1226">1226</span>
<span id="1227">1227</span>
<span id="1228">1228</span>
<span id="1229">1229</span>
<span id="1230">1230</span>
<span id="1231">1231</span>
<span id="1232">1232</span>
<span id="1233">1233</span>
<span id="1234">1234</span>
<span id="1235">1235</span>
<span id="1236">1236</span>
<span id="1237">1237</span>
<span id="1238">1238</span>
<span id="1239">1239</span>
<span id="1240">1240</span>
<span id="1241">1241</span>
<span id="1242">1242</span>
<span id="1243">1243</span>
<span id="1244">1244</span>
<span id="1245">1245</span>
<span id="1246">1246</span>
<span id="1247">1247</span>
<span id="1248">1248</span>
<span id="1249">1249</span>
<span id="1250">1250</span>
<span id="1251">1251</span>
<span id="1252">1252</span>
<span id="1253">1253</span>
<span id="1254">1254</span>
<span id="1255">1255</span>
<span id="1256">1256</span>
<span id="1257">1257</span>
<span id="1258">1258</span>
<span id="1259">1259</span>
<span id="1260">1260</span>
<span id="1261">1261</span>
<span id="1262">1262</span>
<span id="1263">1263</span>
<span id="1264">1264</span>
<span id="1265">1265</span>
<span id="1266">1266</span>
<span id="1267">1267</span>
<span id="1268">1268</span>
<span id="1269">1269</span>
<span id="1270">1270</span>
<span id="1271">1271</span>
<span id="1272">1272</span>
<span id="1273">1273</span>
<span id="1274">1274</span>
<span id="1275">1275</span>
<span id="1276">1276</span>
<span id="1277">1277</span>
<span id="1278">1278</span>
<span id="1279">1279</span>
<span id="1280">1280</span>
<span id="1281">1281</span>
<span id="1282">1282</span>
<span id="1283">1283</span>
<span id="1284">1284</span>
<span id="1285">1285</span>
<span id="1286">1286</span>
<span id="1287">1287</span>
<span id="1288">1288</span>
<span id="1289">1289</span>
<span id="1290">1290</span>
<span id="1291">1291</span>
<span id="1292">1292</span>
<span id="1293">1293</span>
<span id="1294">1294</span>
<span id="1295">1295</span>
<span id="1296">1296</span>
<span id="1297">1297</span>
<span id="1298">1298</span>
<span id="1299">1299</span>
<span id="1300">1300</span>
<span id="1301">1301</span>
<span id="1302">1302</span>
<span id="1303">1303</span>
<span id="1304">1304</span>
<span id="1305">1305</span>
<span id="1306">1306</span>
<span id="1307">1307</span>
<span id="1308">1308</span>
<span id="1309">1309</span>
<span id="1310">1310</span>
<span id="1311">1311</span>
<span id="1312">1312</span>
<span id="1313">1313</span>
<span id="1314">1314</span>
<span id="1315">1315</span>
<span id="1316">1316</span>
<span id="1317">1317</span>
<span id="1318">1318</span>
<span id="1319">1319</span>
<span id="1320">1320</span>
<span id="1321">1321</span>
<span id="1322">1322</span>
<span id="1323">1323</span>
<span id="1324">1324</span>
<span id="1325">1325</span>
<span id="1326">1326</span>
<span id="1327">1327</span>
<span id="1328">1328</span>
<span id="1329">1329</span>
<span id="1330">1330</span>
<span id="1331">1331</span>
<span id="1332">1332</span>
<span id="1333">1333</span>
<span id="1334">1334</span>
<span id="1335">1335</span>
<span id="1336">1336</span>
<span id="1337">1337</span>
<span id="1338">1338</span>
<span id="1339">1339</span>
<span id="1340">1340</span>
<span id="1341">1341</span>
<span id="1342">1342</span>
<span id="1343">1343</span>
<span id="1344">1344</span>
<span id="1345">1345</span>
<span id="1346">1346</span>
<span id="1347">1347</span>
<span id="1348">1348</span>
<span id="1349">1349</span>
<span id="1350">1350</span>
<span id="1351">1351</span>
<span id="1352">1352</span>
<span id="1353">1353</span>
<span id="1354">1354</span>
<span id="1355">1355</span>
<span id="1356">1356</span>
<span id="1357">1357</span>
<span id="1358">1358</span>
<span id="1359">1359</span>
<span id="1360">1360</span>
<span id="1361">1361</span>
<span id="1362">1362</span>
<span id="1363">1363</span>
<span id="1364">1364</span>
<span id="1365">1365</span>
<span id="1366">1366</span>
<span id="1367">1367</span>
<span id="1368">1368</span>
<span id="1369">1369</span>
<span id="1370">1370</span>
<span id="1371">1371</span>
<span id="1372">1372</span>
<span id="1373">1373</span>
<span id="1374">1374</span>
<span id="1375">1375</span>
<span id="1376">1376</span>
<span id="1377">1377</span>
<span id="1378">1378</span>
<span id="1379">1379</span>
<span id="1380">1380</span>
<span id="1381">1381</span>
<span id="1382">1382</span>
<span id="1383">1383</span>
<span id="1384">1384</span>
<span id="1385">1385</span>
<span id="1386">1386</span>
<span id="1387">1387</span>
<span id="1388">1388</span>
<span id="1389">1389</span>
<span id="1390">1390</span>
<span id="1391">1391</span>
<span id="1392">1392</span>
<span id="1393">1393</span>
<span id="1394">1394</span>
<span id="1395">1395</span>
<span id="1396">1396</span>
<span id="1397">1397</span>
<span id="1398">1398</span>
<span id="1399">1399</span>
<span id="1400">1400</span>
<span id="1401">1401</span>
<span id="1402">1402</span>
<span id="1403">1403</span>
<span id="1404">1404</span>
<span id="1405">1405</span>
<span id="1406">1406</span>
<span id="1407">1407</span>
<span id="1408">1408</span>
<span id="1409">1409</span>
<span id="1410">1410</span>
<span id="1411">1411</span>
<span id="1412">1412</span>
<span id="1413">1413</span>
<span id="1414">1414</span>
<span id="1415">1415</span>
<span id="1416">1416</span>
<span id="1417">1417</span>
<span id="1418">1418</span>
<span id="1419">1419</span>
<span id="1420">1420</span>
<span id="1421">1421</span>
<span id="1422">1422</span>
<span id="1423">1423</span>
<span id="1424">1424</span>
<span id="1425">1425</span>
<span id="1426">1426</span>
<span id="1427">1427</span>
<span id="1428">1428</span>
<span id="1429">1429</span>
<span id="1430">1430</span>
<span id="1431">1431</span>
<span id="1432">1432</span>
<span id="1433">1433</span>
<span id="1434">1434</span>
<span id="1435">1435</span>
<span id="1436">1436</span>
<span id="1437">1437</span>
<span id="1438">1438</span>
<span id="1439">1439</span>
<span id="1440">1440</span>
<span id="1441">1441</span>
<span id="1442">1442</span>
<span id="1443">1443</span>
<span id="1444">1444</span>
<span id="1445">1445</span>
<span id="1446">1446</span>
<span id="1447">1447</span>
<span id="1448">1448</span>
<span id="1449">1449</span>
<span id="1450">1450</span>
<span id="1451">1451</span>
<span id="1452">1452</span>
<span id="1453">1453</span>
<span id="1454">1454</span>
<span id="1455">1455</span>
<span id="1456">1456</span>
<span id="1457">1457</span>
<span id="1458">1458</span>
<span id="1459">1459</span>
<span id="1460">1460</span>
<span id="1461">1461</span>
<span id="1462">1462</span>
<span id="1463">1463</span>
<span id="1464">1464</span>
<span id="1465">1465</span>
<span id="1466">1466</span>
<span id="1467">1467</span>
<span id="1468">1468</span>
<span id="1469">1469</span>
<span id="1470">1470</span>
<span id="1471">1471</span>
<span id="1472">1472</span>
<span id="1473">1473</span>
<span id="1474">1474</span>
<span id="1475">1475</span>
<span id="1476">1476</span>
<span id="1477">1477</span>
<span id="1478">1478</span>
<span id="1479">1479</span>
<span id="1480">1480</span>
<span id="1481">1481</span>
<span id="1482">1482</span>
<span id="1483">1483</span>
<span id="1484">1484</span>
<span id="1485">1485</span>
<span id="1486">1486</span>
<span id="1487">1487</span>
<span id="1488">1488</span>
<span id="1489">1489</span>
<span id="1490">1490</span>
<span id="1491">1491</span>
<span id="1492">1492</span>
<span id="1493">1493</span>
<span id="1494">1494</span>
<span id="1495">1495</span>
<span id="1496">1496</span>
<span id="1497">1497</span>
<span id="1498">1498</span>
<span id="1499">1499</span>
<span id="1500">1500</span>
<span id="1501">1501</span>
<span id="1502">1502</span>
<span id="1503">1503</span>
<span id="1504">1504</span>
<span id="1505">1505</span>
<span id="1506">1506</span>
<span id="1507">1507</span>
<span id="1508">1508</span>
<span id="1509">1509</span>
<span id="1510">1510</span>
<span id="1511">1511</span>
<span id="1512">1512</span>
<span id="1513">1513</span>
<span id="1514">1514</span>
<span id="1515">1515</span>
<span id="1516">1516</span>
<span id="1517">1517</span>
<span id="1518">1518</span>
<span id="1519">1519</span>
<span id="1520">1520</span>
<span id="1521">1521</span>
<span id="1522">1522</span>
<span id="1523">1523</span>
<span id="1524">1524</span>
<span id="1525">1525</span>
<span id="1526">1526</span>
<span id="1527">1527</span>
<span id="1528">1528</span>
<span id="1529">1529</span>
<span id="1530">1530</span>
<span id="1531">1531</span>
<span id="1532">1532</span>
<span id="1533">1533</span>
<span id="1534">1534</span>
<span id="1535">1535</span>
<span id="1536">1536</span>
<span id="1537">1537</span>
<span id="1538">1538</span>
<span id="1539">1539</span>
<span id="1540">1540</span>
<span id="1541">1541</span>
<span id="1542">1542</span>
<span id="1543">1543</span>
<span id="1544">1544</span>
<span id="1545">1545</span>
<span id="1546">1546</span>
<span id="1547">1547</span>
<span id="1548">1548</span>
<span id="1549">1549</span>
<span id="1550">1550</span>
<span id="1551">1551</span>
<span id="1552">1552</span>
<span id="1553">1553</span>
<span id="1554">1554</span>
<span id="1555">1555</span>
<span id="1556">1556</span>
<span id="1557">1557</span>
<span id="1558">1558</span>
<span id="1559">1559</span>
<span id="1560">1560</span>
<span id="1561">1561</span>
<span id="1562">1562</span>
<span id="1563">1563</span>
<span id="1564">1564</span>
<span id="1565">1565</span>
<span id="1566">1566</span>
<span id="1567">1567</span>
<span id="1568">1568</span>
<span id="1569">1569</span>
<span id="1570">1570</span>
<span id="1571">1571</span>
<span id="1572">1572</span>
<span id="1573">1573</span>
<span id="1574">1574</span>
<span id="1575">1575</span>
<span id="1576">1576</span>
<span id="1577">1577</span>
<span id="1578">1578</span>
<span id="1579">1579</span>
<span id="1580">1580</span>
<span id="1581">1581</span>
<span id="1582">1582</span>
<span id="1583">1583</span>
<span id="1584">1584</span>
<span id="1585">1585</span>
<span id="1586">1586</span>
<span id="1587">1587</span>
<span id="1588">1588</span>
<span id="1589">1589</span>
<span id="1590">1590</span>
<span id="1591">1591</span>
<span id="1592">1592</span>
<span id="1593">1593</span>
<span id="1594">1594</span>
<span id="1595">1595</span>
<span id="1596">1596</span>
<span id="1597">1597</span>
<span id="1598">1598</span>
<span id="1599">1599</span>
<span id="1600">1600</span>
<span id="1601">1601</span>
<span id="1602">1602</span>
<span id="1603">1603</span>
<span id="1604">1604</span>
<span id="1605">1605</span>
<span id="1606">1606</span>
<span id="1607">1607</span>
<span id="1608">1608</span>
<span id="1609">1609</span>
<span id="1610">1610</span>
<span id="1611">1611</span>
<span id="1612">1612</span>
<span id="1613">1613</span>
<span id="1614">1614</span>
<span id="1615">1615</span>
<span id="1616">1616</span>
<span id="1617">1617</span>
<span id="1618">1618</span>
<span id="1619">1619</span>
<span id="1620">1620</span>
<span id="1621">1621</span>
<span id="1622">1622</span>
<span id="1623">1623</span>
<span id="1624">1624</span>
<span id="1625">1625</span>
<span id="1626">1626</span>
<span id="1627">1627</span>
<span id="1628">1628</span>
<span id="1629">1629</span>
<span id="1630">1630</span>
<span id="1631">1631</span>
<span id="1632">1632</span>
<span id="1633">1633</span>
<span id="1634">1634</span>
<span id="1635">1635</span>
<span id="1636">1636</span>
<span id="1637">1637</span>
<span id="1638">1638</span>
<span id="1639">1639</span>
<span id="1640">1640</span>
<span id="1641">1641</span>
<span id="1642">1642</span>
<span id="1643">1643</span>
<span id="1644">1644</span>
<span id="1645">1645</span>
<span id="1646">1646</span>
<span id="1647">1647</span>
<span id="1648">1648</span>
<span id="1649">1649</span>
<span id="1650">1650</span>
<span id="1651">1651</span>
<span id="1652">1652</span>
<span id="1653">1653</span>
<span id="1654">1654</span>
<span id="1655">1655</span>
<span id="1656">1656</span>
<span id="1657">1657</span>
<span id="1658">1658</span>
<span id="1659">1659</span>
<span id="1660">1660</span>
<span id="1661">1661</span>
<span id="1662">1662</span>
<span id="1663">1663</span>
<span id="1664">1664</span>
<span id="1665">1665</span>
<span id="1666">1666</span>
<span id="1667">1667</span>
<span id="1668">1668</span>
<span id="1669">1669</span>
<span id="1670">1670</span>
<span id="1671">1671</span>
<span id="1672">1672</span>
<span id="1673">1673</span>
<span id="1674">1674</span>
<span id="1675">1675</span>
<span id="1676">1676</span>
<span id="1677">1677</span>
<span id="1678">1678</span>
<span id="1679">1679</span>
<span id="1680">1680</span>
<span id="1681">1681</span>
<span id="1682">1682</span>
<span id="1683">1683</span>
<span id="1684">1684</span>
<span id="1685">1685</span>
<span id="1686">1686</span>
<span id="1687">1687</span>
<span id="1688">1688</span>
<span id="1689">1689</span>
<span id="1690">1690</span>
<span id="1691">1691</span>
<span id="1692">1692</span>
<span id="1693">1693</span>
<span id="1694">1694</span>
<span id="1695">1695</span>
<span id="1696">1696</span>
<span id="1697">1697</span>
<span id="1698">1698</span>
<span id="1699">1699</span>
<span id="1700">1700</span>
<span id="1701">1701</span>
<span id="1702">1702</span>
<span id="1703">1703</span>
<span id="1704">1704</span>
<span id="1705">1705</span>
<span id="1706">1706</span>
<span id="1707">1707</span>
<span id="1708">1708</span>
<span id="1709">1709</span>
<span id="1710">1710</span>
<span id="1711">1711</span>
<span id="1712">1712</span>
<span id="1713">1713</span>
<span id="1714">1714</span>
<span id="1715">1715</span>
<span id="1716">1716</span>
<span id="1717">1717</span>
<span id="1718">1718</span>
<span id="1719">1719</span>
<span id="1720">1720</span>
<span id="1721">1721</span>
<span id="1722">1722</span>
<span id="1723">1723</span>
<span id="1724">1724</span>
<span id="1725">1725</span>
<span id="1726">1726</span>
<span id="1727">1727</span>
<span id="1728">1728</span>
<span id="1729">1729</span>
<span id="1730">1730</span>
<span id="1731">1731</span>
<span id="1732">1732</span>
<span id="1733">1733</span>
<span id="1734">1734</span>
<span id="1735">1735</span>
<span id="1736">1736</span>
<span id="1737">1737</span>
<span id="1738">1738</span>
<span id="1739">1739</span>
<span id="1740">1740</span>
<span id="1741">1741</span>
<span id="1742">1742</span>
<span id="1743">1743</span>
<span id="1744">1744</span>
<span id="1745">1745</span>
<span id="1746">1746</span>
<span id="1747">1747</span>
<span id="1748">1748</span>
<span id="1749">1749</span>
<span id="1750">1750</span>
<span id="1751">1751</span>
<span id="1752">1752</span>
<span id="1753">1753</span>
<span id="1754">1754</span>
<span id="1755">1755</span>
<span id="1756">1756</span>
<span id="1757">1757</span>
<span id="1758">1758</span>
<span id="1759">1759</span>
<span id="1760">1760</span>
<span id="1761">1761</span>
<span id="1762">1762</span>
<span id="1763">1763</span>
<span id="1764">1764</span>
<span id="1765">1765</span>
<span id="1766">1766</span>
<span id="1767">1767</span>
<span id="1768">1768</span>
<span id="1769">1769</span>
<span id="1770">1770</span>
<span id="1771">1771</span>
<span id="1772">1772</span>
<span id="1773">1773</span>
<span id="1774">1774</span>
<span id="1775">1775</span>
<span id="1776">1776</span>
<span id="1777">1777</span>
<span id="1778">1778</span>
<span id="1779">1779</span>
<span id="1780">1780</span>
<span id="1781">1781</span>
<span id="1782">1782</span>
<span id="1783">1783</span>
<span id="1784">1784</span>
<span id="1785">1785</span>
<span id="1786">1786</span>
<span id="1787">1787</span>
<span id="1788">1788</span>
<span id="1789">1789</span>
<span id="1790">1790</span>
<span id="1791">1791</span>
<span id="1792">1792</span>
<span id="1793">1793</span>
<span id="1794">1794</span>
<span id="1795">1795</span>
<span id="1796">1796</span>
<span id="1797">1797</span>
<span id="1798">1798</span>
<span id="1799">1799</span>
<span id="1800">1800</span>
<span id="1801">1801</span>
<span id="1802">1802</span>
<span id="1803">1803</span>
<span id="1804">1804</span>
<span id="1805">1805</span>
<span id="1806">1806</span>
<span id="1807">1807</span>
<span id="1808">1808</span>
<span id="1809">1809</span>
<span id="1810">1810</span>
<span id="1811">1811</span>
<span id="1812">1812</span>
<span id="1813">1813</span>
<span id="1814">1814</span>
<span id="1815">1815</span>
<span id="1816">1816</span>
<span id="1817">1817</span>
<span id="1818">1818</span>
<span id="1819">1819</span>
<span id="1820">1820</span>
<span id="1821">1821</span>
<span id="1822">1822</span>
<span id="1823">1823</span>
<span id="1824">1824</span>
<span id="1825">1825</span>
<span id="1826">1826</span>
<span id="1827">1827</span>
<span id="1828">1828</span>
<span id="1829">1829</span>
<span id="1830">1830</span>
<span id="1831">1831</span>
<span id="1832">1832</span>
<span id="1833">1833</span>
<span id="1834">1834</span>
<span id="1835">1835</span>
<span id="1836">1836</span>
<span id="1837">1837</span>
<span id="1838">1838</span>
<span id="1839">1839</span>
<span id="1840">1840</span>
<span id="1841">1841</span>
<span id="1842">1842</span>
<span id="1843">1843</span>
<span id="1844">1844</span>
<span id="1845">1845</span>
<span id="1846">1846</span>
<span id="1847">1847</span>
<span id="1848">1848</span>
<span id="1849">1849</span>
<span id="1850">1850</span>
<span id="1851">1851</span>
<span id="1852">1852</span>
<span id="1853">1853</span>
<span id="1854">1854</span>
<span id="1855">1855</span>
<span id="1856">1856</span>
<span id="1857">1857</span>
<span id="1858">1858</span>
<span id="1859">1859</span>
<span id="1860">1860</span>
<span id="1861">1861</span>
<span id="1862">1862</span>
<span id="1863">1863</span>
<span id="1864">1864</span>
<span id="1865">1865</span>
<span id="1866">1866</span>
<span id="1867">1867</span>
<span id="1868">1868</span>
<span id="1869">1869</span>
<span id="1870">1870</span>
<span id="1871">1871</span>
<span id="1872">1872</span>
<span id="1873">1873</span>
<span id="1874">1874</span>
<span id="1875">1875</span>
<span id="1876">1876</span>
<span id="1877">1877</span>
<span id="1878">1878</span>
<span id="1879">1879</span>
<span id="1880">1880</span>
<span id="1881">1881</span>
<span id="1882">1882</span>
<span id="1883">1883</span>
<span id="1884">1884</span>
<span id="1885">1885</span>
<span id="1886">1886</span>
<span id="1887">1887</span>
<span id="1888">1888</span>
<span id="1889">1889</span>
<span id="1890">1890</span>
<span id="1891">1891</span>
<span id="1892">1892</span>
<span id="1893">1893</span>
<span id="1894">1894</span>
<span id="1895">1895</span>
<span id="1896">1896</span>
<span id="1897">1897</span>
<span id="1898">1898</span>
<span id="1899">1899</span>
<span id="1900">1900</span>
<span id="1901">1901</span>
<span id="1902">1902</span>
<span id="1903">1903</span>
<span id="1904">1904</span>
<span id="1905">1905</span>
<span id="1906">1906</span>
<span id="1907">1907</span>
<span id="1908">1908</span>
<span id="1909">1909</span>
<span id="1910">1910</span>
<span id="1911">1911</span>
<span id="1912">1912</span>
<span id="1913">1913</span>
<span id="1914">1914</span>
<span id="1915">1915</span>
<span id="1916">1916</span>
<span id="1917">1917</span>
<span id="1918">1918</span>
<span id="1919">1919</span>
<span id="1920">1920</span>
<span id="1921">1921</span>
<span id="1922">1922</span>
<span id="1923">1923</span>
<span id="1924">1924</span>
<span id="1925">1925</span>
<span id="1926">1926</span>
<span id="1927">1927</span>
<span id="1928">1928</span>
<span id="1929">1929</span>
<span id="1930">1930</span>
<span id="1931">1931</span>
<span id="1932">1932</span>
<span id="1933">1933</span>
<span id="1934">1934</span>
<span id="1935">1935</span>
<span id="1936">1936</span>
<span id="1937">1937</span>
<span id="1938">1938</span>
<span id="1939">1939</span>
<span id="1940">1940</span>
<span id="1941">1941</span>
<span id="1942">1942</span>
<span id="1943">1943</span>
<span id="1944">1944</span>
<span id="1945">1945</span>
<span id="1946">1946</span>
<span id="1947">1947</span>
<span id="1948">1948</span>
<span id="1949">1949</span>
<span id="1950">1950</span>
<span id="1951">1951</span>
<span id="1952">1952</span>
<span id="1953">1953</span>
<span id="1954">1954</span>
<span id="1955">1955</span>
<span id="1956">1956</span>
<span id="1957">1957</span>
<span id="1958">1958</span>
<span id="1959">1959</span>
<span id="1960">1960</span>
<span id="1961">1961</span>
<span id="1962">1962</span>
<span id="1963">1963</span>
<span id="1964">1964</span>
<span id="1965">1965</span>
<span id="1966">1966</span>
<span id="1967">1967</span>
<span id="1968">1968</span>
<span id="1969">1969</span>
<span id="1970">1970</span>
<span id="1971">1971</span>
<span id="1972">1972</span>
<span id="1973">1973</span>
<span id="1974">1974</span>
<span id="1975">1975</span>
<span id="1976">1976</span>
<span id="1977">1977</span>
<span id="1978">1978</span>
<span id="1979">1979</span>
<span id="1980">1980</span>
<span id="1981">1981</span>
<span id="1982">1982</span>
<span id="1983">1983</span>
<span id="1984">1984</span>
<span id="1985">1985</span>
<span id="1986">1986</span>
<span id="1987">1987</span>
<span id="1988">1988</span>
<span id="1989">1989</span>
<span id="1990">1990</span>
<span id="1991">1991</span>
<span id="1992">1992</span>
<span id="1993">1993</span>
<span id="1994">1994</span>
<span id="1995">1995</span>
<span id="1996">1996</span>
<span id="1997">1997</span>
<span id="1998">1998</span>
<span id="1999">1999</span>
<span id="2000">2000</span>
<span id="2001">2001</span>
<span id="2002">2002</span>
<span id="2003">2003</span>
<span id="2004">2004</span>
<span id="2005">2005</span>
<span id="2006">2006</span>
<span id="2007">2007</span>
<span id="2008">2008</span>
<span id="2009">2009</span>
<span id="2010">2010</span>
<span id="2011">2011</span>
<span id="2012">2012</span>
<span id="2013">2013</span>
<span id="2014">2014</span>
<span id="2015">2015</span>
<span id="2016">2016</span>
<span id="2017">2017</span>
<span id="2018">2018</span>
<span id="2019">2019</span>
<span id="2020">2020</span>
<span id="2021">2021</span>
<span id="2022">2022</span>
<span id="2023">2023</span>
<span id="2024">2024</span>
<span id="2025">2025</span>
<span id="2026">2026</span>
<span id="2027">2027</span>
<span id="2028">2028</span>
<span id="2029">2029</span>
<span id="2030">2030</span>
<span id="2031">2031</span>
<span id="2032">2032</span>
<span id="2033">2033</span>
<span id="2034">2034</span>
<span id="2035">2035</span>
<span id="2036">2036</span>
<span id="2037">2037</span>
<span id="2038">2038</span>
<span id="2039">2039</span>
<span id="2040">2040</span>
<span id="2041">2041</span>
<span id="2042">2042</span>
<span id="2043">2043</span>
<span id="2044">2044</span>
<span id="2045">2045</span>
<span id="2046">2046</span>
<span id="2047">2047</span>
<span id="2048">2048</span>
<span id="2049">2049</span>
<span id="2050">2050</span>
<span id="2051">2051</span>
<span id="2052">2052</span>
<span id="2053">2053</span>
<span id="2054">2054</span>
<span id="2055">2055</span>
<span id="2056">2056</span>
<span id="2057">2057</span>
<span id="2058">2058</span>
<span id="2059">2059</span>
<span id="2060">2060</span>
<span id="2061">2061</span>
<span id="2062">2062</span>
<span id="2063">2063</span>
<span id="2064">2064</span>
<span id="2065">2065</span>
<span id="2066">2066</span>
<span id="2067">2067</span>
<span id="2068">2068</span>
<span id="2069">2069</span>
<span id="2070">2070</span>
<span id="2071">2071</span>
<span id="2072">2072</span>
<span id="2073">2073</span>
<span id="2074">2074</span>
<span id="2075">2075</span>
<span id="2076">2076</span>
<span id="2077">2077</span>
<span id="2078">2078</span>
<span id="2079">2079</span>
<span id="2080">2080</span>
<span id="2081">2081</span>
<span id="2082">2082</span>
<span id="2083">2083</span>
<span id="2084">2084</span>
<span id="2085">2085</span>
<span id="2086">2086</span>
<span id="2087">2087</span>
<span id="2088">2088</span>
<span id="2089">2089</span>
<span id="2090">2090</span>
<span id="2091">2091</span>
<span id="2092">2092</span>
<span id="2093">2093</span>
<span id="2094">2094</span>
<span id="2095">2095</span>
<span id="2096">2096</span>
<span id="2097">2097</span>
<span id="2098">2098</span>
<span id="2099">2099</span>
<span id="2100">2100</span>
<span id="2101">2101</span>
<span id="2102">2102</span>
<span id="2103">2103</span>
<span id="2104">2104</span>
<span id="2105">2105</span>
<span id="2106">2106</span>
<span id="2107">2107</span>
<span id="2108">2108</span>
<span id="2109">2109</span>
<span id="2110">2110</span>
<span id="2111">2111</span>
<span id="2112">2112</span>
<span id="2113">2113</span>
<span id="2114">2114</span>
<span id="2115">2115</span>
<span id="2116">2116</span>
<span id="2117">2117</span>
<span id="2118">2118</span>
<span id="2119">2119</span>
<span id="2120">2120</span>
<span id="2121">2121</span>
<span id="2122">2122</span>
<span id="2123">2123</span>
<span id="2124">2124</span>
<span id="2125">2125</span>
<span id="2126">2126</span>
<span id="2127">2127</span>
<span id="2128">2128</span>
<span id="2129">2129</span>
<span id="2130">2130</span>
<span id="2131">2131</span>
<span id="2132">2132</span>
<span id="2133">2133</span>
<span id="2134">2134</span>
<span id="2135">2135</span>
<span id="2136">2136</span>
<span id="2137">2137</span>
<span id="2138">2138</span>
<span id="2139">2139</span>
<span id="2140">2140</span>
<span id="2141">2141</span>
<span id="2142">2142</span>
<span id="2143">2143</span>
<span id="2144">2144</span>
<span id="2145">2145</span>
<span id="2146">2146</span>
<span id="2147">2147</span>
<span id="2148">2148</span>
<span id="2149">2149</span>
<span id="2150">2150</span>
<span id="2151">2151</span>
<span id="2152">2152</span>
<span id="2153">2153</span>
<span id="2154">2154</span>
<span id="2155">2155</span>
<span id="2156">2156</span>
<span id="2157">2157</span>
<span id="2158">2158</span>
<span id="2159">2159</span>
<span id="2160">2160</span>
<span id="2161">2161</span>
<span id="2162">2162</span>
<span id="2163">2163</span>
<span id="2164">2164</span>
<span id="2165">2165</span>
<span id="2166">2166</span>
<span id="2167">2167</span>
<span id="2168">2168</span>
<span id="2169">2169</span>
<span id="2170">2170</span>
<span id="2171">2171</span>
<span id="2172">2172</span>
<span id="2173">2173</span>
<span id="2174">2174</span>
<span id="2175">2175</span>
<span id="2176">2176</span>
<span id="2177">2177</span>
<span id="2178">2178</span>
<span id="2179">2179</span>
<span id="2180">2180</span>
<span id="2181">2181</span>
<span id="2182">2182</span>
<span id="2183">2183</span>
<span id="2184">2184</span>
<span id="2185">2185</span>
<span id="2186">2186</span>
<span id="2187">2187</span>
<span id="2188">2188</span>
<span id="2189">2189</span>
<span id="2190">2190</span>
<span id="2191">2191</span>
<span id="2192">2192</span>
<span id="2193">2193</span>
<span id="2194">2194</span>
<span id="2195">2195</span>
<span id="2196">2196</span>
<span id="2197">2197</span>
<span id="2198">2198</span>
<span id="2199">2199</span>
<span id="2200">2200</span>
<span id="2201">2201</span>
<span id="2202">2202</span>
<span id="2203">2203</span>
<span id="2204">2204</span>
<span id="2205">2205</span>
<span id="2206">2206</span>
<span id="2207">2207</span>
<span id="2208">2208</span>
<span id="2209">2209</span>
<span id="2210">2210</span>
<span id="2211">2211</span>
<span id="2212">2212</span>
<span id="2213">2213</span>
<span id="2214">2214</span>
<span id="2215">2215</span>
<span id="2216">2216</span>
<span id="2217">2217</span>
<span id="2218">2218</span>
<span id="2219">2219</span>
<span id="2220">2220</span>
<span id="2221">2221</span>
<span id="2222">2222</span>
<span id="2223">2223</span>
<span id="2224">2224</span>
<span id="2225">2225</span>
<span id="2226">2226</span>
<span id="2227">2227</span>
<span id="2228">2228</span>
<span id="2229">2229</span>
<span id="2230">2230</span>
<span id="2231">2231</span>
<span id="2232">2232</span>
<span id="2233">2233</span>
<span id="2234">2234</span>
<span id="2235">2235</span>
<span id="2236">2236</span>
<span id="2237">2237</span>
<span id="2238">2238</span>
<span id="2239">2239</span>
<span id="2240">2240</span>
<span id="2241">2241</span>
<span id="2242">2242</span>
<span id="2243">2243</span>
<span id="2244">2244</span>
<span id="2245">2245</span>
<span id="2246">2246</span>
<span id="2247">2247</span>
<span id="2248">2248</span>
<span id="2249">2249</span>
<span id="2250">2250</span>
<span id="2251">2251</span>
<span id="2252">2252</span>
<span id="2253">2253</span>
<span id="2254">2254</span>
<span id="2255">2255</span>
<span id="2256">2256</span>
<span id="2257">2257</span>
<span id="2258">2258</span>
<span id="2259">2259</span>
<span id="2260">2260</span>
<span id="2261">2261</span>
<span id="2262">2262</span>
<span id="2263">2263</span>
<span id="2264">2264</span>
<span id="2265">2265</span>
<span id="2266">2266</span>
<span id="2267">2267</span>
<span id="2268">2268</span>
<span id="2269">2269</span>
<span id="2270">2270</span>
<span id="2271">2271</span>
<span id="2272">2272</span>
<span id="2273">2273</span>
<span id="2274">2274</span>
<span id="2275">2275</span>
<span id="2276">2276</span>
<span id="2277">2277</span>
<span id="2278">2278</span>
<span id="2279">2279</span>
<span id="2280">2280</span>
<span id="2281">2281</span>
<span id="2282">2282</span>
<span id="2283">2283</span>
<span id="2284">2284</span>
<span id="2285">2285</span>
<span id="2286">2286</span>
<span id="2287">2287</span>
<span id="2288">2288</span>
<span id="2289">2289</span>
<span id="2290">2290</span>
<span id="2291">2291</span>
<span id="2292">2292</span>
<span id="2293">2293</span>
<span id="2294">2294</span>
<span id="2295">2295</span>
<span id="2296">2296</span>
<span id="2297">2297</span>
<span id="2298">2298</span>
<span id="2299">2299</span>
<span id="2300">2300</span>
<span id="2301">2301</span>
<span id="2302">2302</span>
<span id="2303">2303</span>
<span id="2304">2304</span>
<span id="2305">2305</span>
<span id="2306">2306</span>
<span id="2307">2307</span>
<span id="2308">2308</span>
<span id="2309">2309</span>
<span id="2310">2310</span>
<span id="2311">2311</span>
<span id="2312">2312</span>
<span id="2313">2313</span>
<span id="2314">2314</span>
<span id="2315">2315</span>
<span id="2316">2316</span>
<span id="2317">2317</span>
<span id="2318">2318</span>
<span id="2319">2319</span>
<span id="2320">2320</span>
<span id="2321">2321</span>
<span id="2322">2322</span>
<span id="2323">2323</span>
<span id="2324">2324</span>
<span id="2325">2325</span>
<span id="2326">2326</span>
<span id="2327">2327</span>
<span id="2328">2328</span>
<span id="2329">2329</span>
<span id="2330">2330</span>
<span id="2331">2331</span>
<span id="2332">2332</span>
<span id="2333">2333</span>
<span id="2334">2334</span>
<span id="2335">2335</span>
<span id="2336">2336</span>
<span id="2337">2337</span>
<span id="2338">2338</span>
<span id="2339">2339</span>
<span id="2340">2340</span>
<span id="2341">2341</span>
<span id="2342">2342</span>
<span id="2343">2343</span>
<span id="2344">2344</span>
<span id="2345">2345</span>
<span id="2346">2346</span>
<span id="2347">2347</span>
<span id="2348">2348</span>
<span id="2349">2349</span>
<span id="2350">2350</span>
<span id="2351">2351</span>
<span id="2352">2352</span>
<span id="2353">2353</span>
<span id="2354">2354</span>
<span id="2355">2355</span>
<span id="2356">2356</span>
<span id="2357">2357</span>
<span id="2358">2358</span>
<span id="2359">2359</span>
<span id="2360">2360</span>
<span id="2361">2361</span>
<span id="2362">2362</span>
<span id="2363">2363</span>
<span id="2364">2364</span>
<span id="2365">2365</span>
<span id="2366">2366</span>
<span id="2367">2367</span>
<span id="2368">2368</span>
<span id="2369">2369</span>
<span id="2370">2370</span>
<span id="2371">2371</span>
<span id="2372">2372</span>
<span id="2373">2373</span>
<span id="2374">2374</span>
<span id="2375">2375</span>
<span id="2376">2376</span>
<span id="2377">2377</span>
<span id="2378">2378</span>
<span id="2379">2379</span>
<span id="2380">2380</span>
<span id="2381">2381</span>
<span id="2382">2382</span>
<span id="2383">2383</span>
<span id="2384">2384</span>
<span id="2385">2385</span>
<span id="2386">2386</span>
<span id="2387">2387</span>
<span id="2388">2388</span>
<span id="2389">2389</span>
<span id="2390">2390</span>
<span id="2391">2391</span>
<span id="2392">2392</span>
<span id="2393">2393</span>
<span id="2394">2394</span>
<span id="2395">2395</span>
<span id="2396">2396</span>
<span id="2397">2397</span>
<span id="2398">2398</span>
<span id="2399">2399</span>
<span id="2400">2400</span>
<span id="2401">2401</span>
<span id="2402">2402</span>
<span id="2403">2403</span>
<span id="2404">2404</span>
<span id="2405">2405</span>
<span id="2406">2406</span>
<span id="2407">2407</span>
<span id="2408">2408</span>
<span id="2409">2409</span>
<span id="2410">2410</span>
<span id="2411">2411</span>
<span id="2412">2412</span>
<span id="2413">2413</span>
<span id="2414">2414</span>
<span id="2415">2415</span>
<span id="2416">2416</span>
<span id="2417">2417</span>
<span id="2418">2418</span>
<span id="2419">2419</span>
<span id="2420">2420</span>
<span id="2421">2421</span>
<span id="2422">2422</span>
<span id="2423">2423</span>
<span id="2424">2424</span>
<span id="2425">2425</span>
<span id="2426">2426</span>
<span id="2427">2427</span>
<span id="2428">2428</span>
<span id="2429">2429</span>
<span id="2430">2430</span>
<span id="2431">2431</span>
<span id="2432">2432</span>
<span id="2433">2433</span>
<span id="2434">2434</span>
<span id="2435">2435</span>
<span id="2436">2436</span>
<span id="2437">2437</span>
<span id="2438">2438</span>
<span id="2439">2439</span>
<span id="2440">2440</span>
<span id="2441">2441</span>
<span id="2442">2442</span>
<span id="2443">2443</span>
<span id="2444">2444</span>
<span id="2445">2445</span>
<span id="2446">2446</span>
<span id="2447">2447</span>
<span id="2448">2448</span>
<span id="2449">2449</span>
<span id="2450">2450</span>
<span id="2451">2451</span>
<span id="2452">2452</span>
<span id="2453">2453</span>
<span id="2454">2454</span>
<span id="2455">2455</span>
<span id="2456">2456</span>
<span id="2457">2457</span>
<span id="2458">2458</span>
<span id="2459">2459</span>
<span id="2460">2460</span>
<span id="2461">2461</span>
<span id="2462">2462</span>
<span id="2463">2463</span>
<span id="2464">2464</span>
<span id="2465">2465</span>
<span id="2466">2466</span>
<span id="2467">2467</span>
<span id="2468">2468</span>
<span id="2469">2469</span>
<span id="2470">2470</span>
<span id="2471">2471</span>
<span id="2472">2472</span>
<span id="2473">2473</span>
<span id="2474">2474</span>
<span id="2475">2475</span>
<span id="2476">2476</span>
<span id="2477">2477</span>
<span id="2478">2478</span>
<span id="2479">2479</span>
<span id="2480">2480</span>
<span id="2481">2481</span>
<span id="2482">2482</span>
<span id="2483">2483</span>
<span id="2484">2484</span>
<span id="2485">2485</span>
<span id="2486">2486</span>
<span id="2487">2487</span>
<span id="2488">2488</span>
<span id="2489">2489</span>
<span id="2490">2490</span>
<span id="2491">2491</span>
<span id="2492">2492</span>
<span id="2493">2493</span>
<span id="2494">2494</span>
<span id="2495">2495</span>
<span id="2496">2496</span>
<span id="2497">2497</span>
<span id="2498">2498</span>
<span id="2499">2499</span>
<span id="2500">2500</span>
<span id="2501">2501</span>
<span id="2502">2502</span>
<span id="2503">2503</span>
<span id="2504">2504</span>
<span id="2505">2505</span>
<span id="2506">2506</span>
<span id="2507">2507</span>
<span id="2508">2508</span>
<span id="2509">2509</span>
<span id="2510">2510</span>
<span id="2511">2511</span>
<span id="2512">2512</span>
<span id="2513">2513</span>
<span id="2514">2514</span>
<span id="2515">2515</span>
<span id="2516">2516</span>
<span id="2517">2517</span>
<span id="2518">2518</span>
<span id="2519">2519</span>
<span id="2520">2520</span>
<span id="2521">2521</span>
<span id="2522">2522</span>
<span id="2523">2523</span>
<span id="2524">2524</span>
<span id="2525">2525</span>
<span id="2526">2526</span>
<span id="2527">2527</span>
<span id="2528">2528</span>
<span id="2529">2529</span>
<span id="2530">2530</span>
<span id="2531">2531</span>
<span id="2532">2532</span>
<span id="2533">2533</span>
<span id="2534">2534</span>
<span id="2535">2535</span>
<span id="2536">2536</span>
<span id="2537">2537</span>
<span id="2538">2538</span>
<span id="2539">2539</span>
<span id="2540">2540</span>
<span id="2541">2541</span>
<span id="2542">2542</span>
<span id="2543">2543</span>
<span id="2544">2544</span>
<span id="2545">2545</span>
<span id="2546">2546</span>
<span id="2547">2547</span>
<span id="2548">2548</span>
<span id="2549">2549</span>
<span id="2550">2550</span>
<span id="2551">2551</span>
<span id="2552">2552</span>
<span id="2553">2553</span>
<span id="2554">2554</span>
<span id="2555">2555</span>
<span id="2556">2556</span>
<span id="2557">2557</span>
<span id="2558">2558</span>
<span id="2559">2559</span>
<span id="2560">2560</span>
<span id="2561">2561</span>
<span id="2562">2562</span>
<span id="2563">2563</span>
<span id="2564">2564</span>
<span id="2565">2565</span>
<span id="2566">2566</span>
<span id="2567">2567</span>
<span id="2568">2568</span>
<span id="2569">2569</span>
<span id="2570">2570</span>
<span id="2571">2571</span>
<span id="2572">2572</span>
<span id="2573">2573</span>
<span id="2574">2574</span>
<span id="2575">2575</span>
<span id="2576">2576</span>
<span id="2577">2577</span>
<span id="2578">2578</span>
<span id="2579">2579</span>
<span id="2580">2580</span>
<span id="2581">2581</span>
<span id="2582">2582</span>
<span id="2583">2583</span>
<span id="2584">2584</span>
<span id="2585">2585</span>
<span id="2586">2586</span>
<span id="2587">2587</span>
<span id="2588">2588</span>
<span id="2589">2589</span>
<span id="2590">2590</span>
<span id="2591">2591</span>
<span id="2592">2592</span>
<span id="2593">2593</span>
<span id="2594">2594</span>
<span id="2595">2595</span>
<span id="2596">2596</span>
<span id="2597">2597</span>
<span id="2598">2598</span>
<span id="2599">2599</span>
<span id="2600">2600</span>
<span id="2601">2601</span>
<span id="2602">2602</span>
<span id="2603">2603</span>
<span id="2604">2604</span>
<span id="2605">2605</span>
<span id="2606">2606</span>
<span id="2607">2607</span>
<span id="2608">2608</span>
<span id="2609">2609</span>
<span id="2610">2610</span>
<span id="2611">2611</span>
<span id="2612">2612</span>
<span id="2613">2613</span>
<span id="2614">2614</span>
<span id="2615">2615</span>
<span id="2616">2616</span>
<span id="2617">2617</span>
<span id="2618">2618</span>
<span id="2619">2619</span>
<span id="2620">2620</span>
<span id="2621">2621</span>
<span id="2622">2622</span>
<span id="2623">2623</span>
<span id="2624">2624</span>
<span id="2625">2625</span>
<span id="2626">2626</span>
<span id="2627">2627</span>
<span id="2628">2628</span>
<span id="2629">2629</span>
<span id="2630">2630</span>
<span id="2631">2631</span>
<span id="2632">2632</span>
<span id="2633">2633</span>
<span id="2634">2634</span>
<span id="2635">2635</span>
<span id="2636">2636</span>
<span id="2637">2637</span>
<span id="2638">2638</span>
<span id="2639">2639</span>
<span id="2640">2640</span>
<span id="2641">2641</span>
<span id="2642">2642</span>
<span id="2643">2643</span>
<span id="2644">2644</span>
<span id="2645">2645</span>
<span id="2646">2646</span>
<span id="2647">2647</span>
<span id="2648">2648</span>
<span id="2649">2649</span>
<span id="2650">2650</span>
<span id="2651">2651</span>
<span id="2652">2652</span>
<span id="2653">2653</span>
<span id="2654">2654</span>
<span id="2655">2655</span>
<span id="2656">2656</span>
<span id="2657">2657</span>
<span id="2658">2658</span>
<span id="2659">2659</span>
<span id="2660">2660</span>
<span id="2661">2661</span>
<span id="2662">2662</span>
<span id="2663">2663</span>
<span id="2664">2664</span>
<span id="2665">2665</span>
<span id="2666">2666</span>
<span id="2667">2667</span>
<span id="2668">2668</span>
<span id="2669">2669</span>
<span id="2670">2670</span>
<span id="2671">2671</span>
<span id="2672">2672</span>
<span id="2673">2673</span>
<span id="2674">2674</span>
<span id="2675">2675</span>
<span id="2676">2676</span>
<span id="2677">2677</span>
<span id="2678">2678</span>
<span id="2679">2679</span>
<span id="2680">2680</span>
<span id="2681">2681</span>
<span id="2682">2682</span>
<span id="2683">2683</span>
<span id="2684">2684</span>
<span id="2685">2685</span>
<span id="2686">2686</span>
<span id="2687">2687</span>
<span id="2688">2688</span>
<span id="2689">2689</span>
<span id="2690">2690</span>
<span id="2691">2691</span>
<span id="2692">2692</span>
<span id="2693">2693</span>
<span id="2694">2694</span>
<span id="2695">2695</span>
<span id="2696">2696</span>
<span id="2697">2697</span>
<span id="2698">2698</span>
<span id="2699">2699</span>
<span id="2700">2700</span>
<span id="2701">2701</span>
<span id="2702">2702</span>
<span id="2703">2703</span>
<span id="2704">2704</span>
<span id="2705">2705</span>
<span id="2706">2706</span>
<span id="2707">2707</span>
<span id="2708">2708</span>
<span id="2709">2709</span>
<span id="2710">2710</span>
<span id="2711">2711</span>
<span id="2712">2712</span>
<span id="2713">2713</span>
<span id="2714">2714</span>
<span id="2715">2715</span>
<span id="2716">2716</span>
<span id="2717">2717</span>
<span id="2718">2718</span>
<span id="2719">2719</span>
<span id="2720">2720</span>
<span id="2721">2721</span>
<span id="2722">2722</span>
<span id="2723">2723</span>
<span id="2724">2724</span>
<span id="2725">2725</span>
<span id="2726">2726</span>
<span id="2727">2727</span>
<span id="2728">2728</span>
<span id="2729">2729</span>
<span id="2730">2730</span>
<span id="2731">2731</span>
<span id="2732">2732</span>
<span id="2733">2733</span>
<span id="2734">2734</span>
<span id="2735">2735</span>
<span id="2736">2736</span>
<span id="2737">2737</span>
<span id="2738">2738</span>
<span id="2739">2739</span>
<span id="2740">2740</span>
<span id="2741">2741</span>
<span id="2742">2742</span>
<span id="2743">2743</span>
<span id="2744">2744</span>
<span id="2745">2745</span>
<span id="2746">2746</span>
<span id="2747">2747</span>
<span id="2748">2748</span>
<span id="2749">2749</span>
<span id="2750">2750</span>
<span id="2751">2751</span>
<span id="2752">2752</span>
<span id="2753">2753</span>
<span id="2754">2754</span>
<span id="2755">2755</span>
<span id="2756">2756</span>
<span id="2757">2757</span>
<span id="2758">2758</span>
<span id="2759">2759</span>
<span id="2760">2760</span>
<span id="2761">2761</span>
<span id="2762">2762</span>
<span id="2763">2763</span>
<span id="2764">2764</span>
<span id="2765">2765</span>
<span id="2766">2766</span>
<span id="2767">2767</span>
<span id="2768">2768</span>
<span id="2769">2769</span>
<span id="2770">2770</span>
<span id="2771">2771</span>
<span id="2772">2772</span>
<span id="2773">2773</span>
<span id="2774">2774</span>
<span id="2775">2775</span>
<span id="2776">2776</span>
<span id="2777">2777</span>
<span id="2778">2778</span>
<span id="2779">2779</span>
<span id="2780">2780</span>
<span id="2781">2781</span>
<span id="2782">2782</span>
<span id="2783">2783</span>
<span id="2784">2784</span>
<span id="2785">2785</span>
<span id="2786">2786</span>
<span id="2787">2787</span>
<span id="2788">2788</span>
<span id="2789">2789</span>
<span id="2790">2790</span>
<span id="2791">2791</span>
<span id="2792">2792</span>
<span id="2793">2793</span>
<span id="2794">2794</span>
<span id="2795">2795</span>
<span id="2796">2796</span>
<span id="2797">2797</span>
<span id="2798">2798</span>
<span id="2799">2799</span>
<span id="2800">2800</span>
<span id="2801">2801</span>
<span id="2802">2802</span>
<span id="2803">2803</span>
<span id="2804">2804</span>
<span id="2805">2805</span>
<span id="2806">2806</span>
<span id="2807">2807</span>
<span id="2808">2808</span>
<span id="2809">2809</span>
<span id="2810">2810</span>
<span id="2811">2811</span>
<span id="2812">2812</span>
<span id="2813">2813</span>
<span id="2814">2814</span>
<span id="2815">2815</span>
<span id="2816">2816</span>
<span id="2817">2817</span>
<span id="2818">2818</span>
<span id="2819">2819</span>
<span id="2820">2820</span>
<span id="2821">2821</span>
<span id="2822">2822</span>
<span id="2823">2823</span>
<span id="2824">2824</span>
<span id="2825">2825</span>
<span id="2826">2826</span>
<span id="2827">2827</span>
<span id="2828">2828</span>
<span id="2829">2829</span>
<span id="2830">2830</span>
<span id="2831">2831</span>
<span id="2832">2832</span>
<span id="2833">2833</span>
<span id="2834">2834</span>
<span id="2835">2835</span>
<span id="2836">2836</span>
<span id="2837">2837</span>
<span id="2838">2838</span>
<span id="2839">2839</span>
<span id="2840">2840</span>
<span id="2841">2841</span>
<span id="2842">2842</span>
<span id="2843">2843</span>
<span id="2844">2844</span>
<span id="2845">2845</span>
<span id="2846">2846</span>
<span id="2847">2847</span>
<span id="2848">2848</span>
<span id="2849">2849</span>
<span id="2850">2850</span>
<span id="2851">2851</span>
<span id="2852">2852</span>
<span id="2853">2853</span>
<span id="2854">2854</span>
<span id="2855">2855</span>
<span id="2856">2856</span>
<span id="2857">2857</span>
<span id="2858">2858</span>
<span id="2859">2859</span>
<span id="2860">2860</span>
<span id="2861">2861</span>
<span id="2862">2862</span>
<span id="2863">2863</span>
<span id="2864">2864</span>
<span id="2865">2865</span>
<span id="2866">2866</span>
<span id="2867">2867</span>
<span id="2868">2868</span>
<span id="2869">2869</span>
<span id="2870">2870</span>
<span id="2871">2871</span>
<span id="2872">2872</span>
<span id="2873">2873</span>
<span id="2874">2874</span>
<span id="2875">2875</span>
<span id="2876">2876</span>
<span id="2877">2877</span>
<span id="2878">2878</span>
<span id="2879">2879</span>
<span id="2880">2880</span>
<span id="2881">2881</span>
<span id="2882">2882</span>
<span id="2883">2883</span>
<span id="2884">2884</span>
<span id="2885">2885</span>
<span id="2886">2886</span>
<span id="2887">2887</span>
<span id="2888">2888</span>
<span id="2889">2889</span>
<span id="2890">2890</span>
<span id="2891">2891</span>
<span id="2892">2892</span>
<span id="2893">2893</span>
<span id="2894">2894</span>
<span id="2895">2895</span>
<span id="2896">2896</span>
<span id="2897">2897</span>
<span id="2898">2898</span>
<span id="2899">2899</span>
<span id="2900">2900</span>
<span id="2901">2901</span>
<span id="2902">2902</span>
<span id="2903">2903</span>
<span id="2904">2904</span>
<span id="2905">2905</span>
<span id="2906">2906</span>
<span id="2907">2907</span>
<span id="2908">2908</span>
<span id="2909">2909</span>
<span id="2910">2910</span>
<span id="2911">2911</span>
<span id="2912">2912</span>
<span id="2913">2913</span>
<span id="2914">2914</span>
<span id="2915">2915</span>
<span id="2916">2916</span>
<span id="2917">2917</span>
<span id="2918">2918</span>
<span id="2919">2919</span>
<span id="2920">2920</span>
<span id="2921">2921</span>
<span id="2922">2922</span>
<span id="2923">2923</span>
<span id="2924">2924</span>
<span id="2925">2925</span>
<span id="2926">2926</span>
<span id="2927">2927</span>
<span id="2928">2928</span>
<span id="2929">2929</span>
<span id="2930">2930</span>
<span id="2931">2931</span>
<span id="2932">2932</span>
<span id="2933">2933</span>
<span id="2934">2934</span>
<span id="2935">2935</span>
<span id="2936">2936</span>
<span id="2937">2937</span>
<span id="2938">2938</span>
<span id="2939">2939</span>
<span id="2940">2940</span>
<span id="2941">2941</span>
<span id="2942">2942</span>
<span id="2943">2943</span>
<span id="2944">2944</span>
<span id="2945">2945</span>
<span id="2946">2946</span>
<span id="2947">2947</span>
<span id="2948">2948</span>
<span id="2949">2949</span>
<span id="2950">2950</span>
<span id="2951">2951</span>
<span id="2952">2952</span>
<span id="2953">2953</span>
<span id="2954">2954</span>
<span id="2955">2955</span>
<span id="2956">2956</span>
<span id="2957">2957</span>
<span id="2958">2958</span>
<span id="2959">2959</span>
<span id="2960">2960</span>
<span id="2961">2961</span>
<span id="2962">2962</span>
<span id="2963">2963</span>
<span id="2964">2964</span>
<span id="2965">2965</span>
<span id="2966">2966</span>
<span id="2967">2967</span>
<span id="2968">2968</span>
<span id="2969">2969</span>
<span id="2970">2970</span>
<span id="2971">2971</span>
<span id="2972">2972</span>
<span id="2973">2973</span>
<span id="2974">2974</span>
<span id="2975">2975</span>
<span id="2976">2976</span>
<span id="2977">2977</span>
<span id="2978">2978</span>
<span id="2979">2979</span>
<span id="2980">2980</span>
<span id="2981">2981</span>
<span id="2982">2982</span>
<span id="2983">2983</span>
<span id="2984">2984</span>
<span id="2985">2985</span>
<span id="2986">2986</span>
<span id="2987">2987</span>
<span id="2988">2988</span>
<span id="2989">2989</span>
<span id="2990">2990</span>
<span id="2991">2991</span>
<span id="2992">2992</span>
<span id="2993">2993</span>
<span id="2994">2994</span>
<span id="2995">2995</span>
<span id="2996">2996</span>
<span id="2997">2997</span>
<span id="2998">2998</span>
<span id="2999">2999</span>
<span id="3000">3000</span>
<span id="3001">3001</span>
<span id="3002">3002</span>
<span id="3003">3003</span>
<span id="3004">3004</span>
<span id="3005">3005</span>
<span id="3006">3006</span>
<span id="3007">3007</span>
<span id="3008">3008</span>
<span id="3009">3009</span>
<span id="3010">3010</span>
<span id="3011">3011</span>
<span id="3012">3012</span>
<span id="3013">3013</span>
<span id="3014">3014</span>
<span id="3015">3015</span>
<span id="3016">3016</span>
<span id="3017">3017</span>
<span id="3018">3018</span>
<span id="3019">3019</span>
<span id="3020">3020</span>
<span id="3021">3021</span>
<span id="3022">3022</span>
<span id="3023">3023</span>
<span id="3024">3024</span>
<span id="3025">3025</span>
<span id="3026">3026</span>
<span id="3027">3027</span>
<span id="3028">3028</span>
<span id="3029">3029</span>
<span id="3030">3030</span>
<span id="3031">3031</span>
<span id="3032">3032</span>
<span id="3033">3033</span>
<span id="3034">3034</span>
<span id="3035">3035</span>
<span id="3036">3036</span>
<span id="3037">3037</span>
<span id="3038">3038</span>
<span id="3039">3039</span>
<span id="3040">3040</span>
<span id="3041">3041</span>
<span id="3042">3042</span>
<span id="3043">3043</span>
<span id="3044">3044</span>
<span id="3045">3045</span>
<span id="3046">3046</span>
<span id="3047">3047</span>
<span id="3048">3048</span>
<span id="3049">3049</span>
<span id="3050">3050</span>
<span id="3051">3051</span>
<span id="3052">3052</span>
<span id="3053">3053</span>
<span id="3054">3054</span>
<span id="3055">3055</span>
<span id="3056">3056</span>
<span id="3057">3057</span>
<span id="3058">3058</span>
<span id="3059">3059</span>
<span id="3060">3060</span>
<span id="3061">3061</span>
<span id="3062">3062</span>
<span id="3063">3063</span>
<span id="3064">3064</span>
<span id="3065">3065</span>
<span id="3066">3066</span>
<span id="3067">3067</span>
<span id="3068">3068</span>
<span id="3069">3069</span>
<span id="3070">3070</span>
<span id="3071">3071</span>
<span id="3072">3072</span>
<span id="3073">3073</span>
<span id="3074">3074</span>
<span id="3075">3075</span>
<span id="3076">3076</span>
<span id="3077">3077</span>
<span id="3078">3078</span>
<span id="3079">3079</span>
<span id="3080">3080</span>
<span id="3081">3081</span>
<span id="3082">3082</span>
<span id="3083">3083</span>
<span id="3084">3084</span>
<span id="3085">3085</span>
<span id="3086">3086</span>
<span id="3087">3087</span>
<span id="3088">3088</span>
<span id="3089">3089</span>
<span id="3090">3090</span>
<span id="3091">3091</span>
<span id="3092">3092</span>
<span id="3093">3093</span>
<span id="3094">3094</span>
<span id="3095">3095</span>
<span id="3096">3096</span>
<span id="3097">3097</span>
<span id="3098">3098</span>
<span id="3099">3099</span>
<span id="3100">3100</span>
<span id="3101">3101</span>
<span id="3102">3102</span>
<span id="3103">3103</span>
<span id="3104">3104</span>
<span id="3105">3105</span>
<span id="3106">3106</span>
<span id="3107">3107</span>
<span id="3108">3108</span>
<span id="3109">3109</span>
<span id="3110">3110</span>
<span id="3111">3111</span>
<span id="3112">3112</span>
<span id="3113">3113</span>
<span id="3114">3114</span>
<span id="3115">3115</span>
<span id="3116">3116</span>
<span id="3117">3117</span>
<span id="3118">3118</span>
<span id="3119">3119</span>
<span id="3120">3120</span>
<span id="3121">3121</span>
<span id="3122">3122</span>
<span id="3123">3123</span>
<span id="3124">3124</span>
<span id="3125">3125</span>
<span id="3126">3126</span>
<span id="3127">3127</span>
<span id="3128">3128</span>
<span id="3129">3129</span>
<span id="3130">3130</span>
<span id="3131">3131</span>
<span id="3132">3132</span>
<span id="3133">3133</span>
<span id="3134">3134</span>
<span id="3135">3135</span>
<span id="3136">3136</span>
<span id="3137">3137</span>
<span id="3138">3138</span>
<span id="3139">3139</span>
<span id="3140">3140</span>
<span id="3141">3141</span>
<span id="3142">3142</span>
<span id="3143">3143</span>
<span id="3144">3144</span>
<span id="3145">3145</span>
<span id="3146">3146</span>
<span id="3147">3147</span>
<span id="3148">3148</span>
<span id="3149">3149</span>
<span id="3150">3150</span>
<span id="3151">3151</span>
<span id="3152">3152</span>
<span id="3153">3153</span>
<span id="3154">3154</span>
<span id="3155">3155</span>
<span id="3156">3156</span>
<span id="3157">3157</span>
<span id="3158">3158</span>
<span id="3159">3159</span>
<span id="3160">3160</span>
<span id="3161">3161</span>
<span id="3162">3162</span>
<span id="3163">3163</span>
<span id="3164">3164</span>
<span id="3165">3165</span>
<span id="3166">3166</span>
<span id="3167">3167</span>
<span id="3168">3168</span>
<span id="3169">3169</span>
<span id="3170">3170</span>
<span id="3171">3171</span>
<span id="3172">3172</span>
<span id="3173">3173</span>
<span id="3174">3174</span>
<span id="3175">3175</span>
<span id="3176">3176</span>
<span id="3177">3177</span>
<span id="3178">3178</span>
<span id="3179">3179</span>
<span id="3180">3180</span>
<span id="3181">3181</span>
<span id="3182">3182</span>
<span id="3183">3183</span>
<span id="3184">3184</span>
<span id="3185">3185</span>
<span id="3186">3186</span>
<span id="3187">3187</span>
<span id="3188">3188</span>
<span id="3189">3189</span>
<span id="3190">3190</span>
<span id="3191">3191</span>
<span id="3192">3192</span>
<span id="3193">3193</span>
<span id="3194">3194</span>
<span id="3195">3195</span>
<span id="3196">3196</span>
<span id="3197">3197</span>
<span id="3198">3198</span>
<span id="3199">3199</span>
<span id="3200">3200</span>
<span id="3201">3201</span>
<span id="3202">3202</span>
<span id="3203">3203</span>
<span id="3204">3204</span>
<span id="3205">3205</span>
<span id="3206">3206</span>
<span id="3207">3207</span>
<span id="3208">3208</span>
<span id="3209">3209</span>
<span id="3210">3210</span>
<span id="3211">3211</span>
<span id="3212">3212</span>
<span id="3213">3213</span>
<span id="3214">3214</span>
<span id="3215">3215</span>
<span id="3216">3216</span>
<span id="3217">3217</span>
<span id="3218">3218</span>
<span id="3219">3219</span>
<span id="3220">3220</span>
<span id="3221">3221</span>
<span id="3222">3222</span>
<span id="3223">3223</span>
<span id="3224">3224</span>
<span id="3225">3225</span>
<span id="3226">3226</span>
<span id="3227">3227</span>
<span id="3228">3228</span>
<span id="3229">3229</span>
<span id="3230">3230</span>
<span id="3231">3231</span>
<span id="3232">3232</span>
<span id="3233">3233</span>
<span id="3234">3234</span>
<span id="3235">3235</span>
<span id="3236">3236</span>
<span id="3237">3237</span>
<span id="3238">3238</span>
<span id="3239">3239</span>
<span id="3240">3240</span>
<span id="3241">3241</span>
<span id="3242">3242</span>
<span id="3243">3243</span>
<span id="3244">3244</span>
<span id="3245">3245</span>
<span id="3246">3246</span>
<span id="3247">3247</span>
<span id="3248">3248</span>
<span id="3249">3249</span>
<span id="3250">3250</span>
<span id="3251">3251</span>
<span id="3252">3252</span>
<span id="3253">3253</span>
<span id="3254">3254</span>
<span id="3255">3255</span>
<span id="3256">3256</span>
<span id="3257">3257</span>
<span id="3258">3258</span>
<span id="3259">3259</span>
<span id="3260">3260</span>
<span id="3261">3261</span>
<span id="3262">3262</span>
<span id="3263">3263</span>
<span id="3264">3264</span>
<span id="3265">3265</span>
<span id="3266">3266</span>
<span id="3267">3267</span>
<span id="3268">3268</span>
<span id="3269">3269</span>
<span id="3270">3270</span>
<span id="3271">3271</span>
<span id="3272">3272</span>
<span id="3273">3273</span>
<span id="3274">3274</span>
<span id="3275">3275</span>
<span id="3276">3276</span>
<span id="3277">3277</span>
<span id="3278">3278</span>
<span id="3279">3279</span>
<span id="3280">3280</span>
<span id="3281">3281</span>
<span id="3282">3282</span>
<span id="3283">3283</span>
<span id="3284">3284</span>
<span id="3285">3285</span>
<span id="3286">3286</span>
<span id="3287">3287</span>
<span id="3288">3288</span>
<span id="3289">3289</span>
<span id="3290">3290</span>
<span id="3291">3291</span>
<span id="3292">3292</span>
<span id="3293">3293</span>
<span id="3294">3294</span>
<span id="3295">3295</span>
<span id="3296">3296</span>
<span id="3297">3297</span>
<span id="3298">3298</span>
<span id="3299">3299</span>
<span id="3300">3300</span>
<span id="3301">3301</span>
<span id="3302">3302</span>
<span id="3303">3303</span>
<span id="3304">3304</span>
<span id="3305">3305</span>
<span id="3306">3306</span>
<span id="3307">3307</span>
<span id="3308">3308</span>
<span id="3309">3309</span>
<span id="3310">3310</span>
<span id="3311">3311</span>
<span id="3312">3312</span>
<span id="3313">3313</span>
<span id="3314">3314</span>
<span id="3315">3315</span>
<span id="3316">3316</span>
<span id="3317">3317</span>
<span id="3318">3318</span>
<span id="3319">3319</span>
<span id="3320">3320</span>
<span id="3321">3321</span>
<span id="3322">3322</span>
<span id="3323">3323</span>
<span id="3324">3324</span>
<span id="3325">3325</span>
<span id="3326">3326</span>
<span id="3327">3327</span>
<span id="3328">3328</span>
<span id="3329">3329</span>
<span id="3330">3330</span>
<span id="3331">3331</span>
<span id="3332">3332</span>
<span id="3333">3333</span>
<span id="3334">3334</span>
<span id="3335">3335</span>
<span id="3336">3336</span>
<span id="3337">3337</span>
<span id="3338">3338</span>
<span id="3339">3339</span>
<span id="3340">3340</span>
<span id="3341">3341</span>
<span id="3342">3342</span>
<span id="3343">3343</span>
<span id="3344">3344</span>
<span id="3345">3345</span>
<span id="3346">3346</span>
<span id="3347">3347</span>
<span id="3348">3348</span>
<span id="3349">3349</span>
<span id="3350">3350</span>
<span id="3351">3351</span>
<span id="3352">3352</span>
<span id="3353">3353</span>
<span id="3354">3354</span>
<span id="3355">3355</span>
<span id="3356">3356</span>
<span id="3357">3357</span>
<span id="3358">3358</span>
<span id="3359">3359</span>
<span id="3360">3360</span>
<span id="3361">3361</span>
<span id="3362">3362</span>
<span id="3363">3363</span>
<span id="3364">3364</span>
<span id="3365">3365</span>
<span id="3366">3366</span>
<span id="3367">3367</span>
<span id="3368">3368</span>
<span id="3369">3369</span>
<span id="3370">3370</span>
<span id="3371">3371</span>
<span id="3372">3372</span>
<span id="3373">3373</span>
<span id="3374">3374</span>
<span id="3375">3375</span>
<span id="3376">3376</span>
<span id="3377">3377</span>
<span id="3378">3378</span>
<span id="3379">3379</span>
<span id="3380">3380</span>
<span id="3381">3381</span>
<span id="3382">3382</span>
<span id="3383">3383</span>
<span id="3384">3384</span>
<span id="3385">3385</span>
<span id="3386">3386</span>
<span id="3387">3387</span>
<span id="3388">3388</span>
<span id="3389">3389</span>
<span id="3390">3390</span>
<span id="3391">3391</span>
<span id="3392">3392</span>
<span id="3393">3393</span>
<span id="3394">3394</span>
<span id="3395">3395</span>
<span id="3396">3396</span>
<span id="3397">3397</span>
<span id="3398">3398</span>
<span id="3399">3399</span>
<span id="3400">3400</span>
<span id="3401">3401</span>
<span id="3402">3402</span>
<span id="3403">3403</span>
<span id="3404">3404</span>
<span id="3405">3405</span>
<span id="3406">3406</span>
<span id="3407">3407</span>
<span id="3408">3408</span>
<span id="3409">3409</span>
<span id="3410">3410</span>
<span id="3411">3411</span>
<span id="3412">3412</span>
<span id="3413">3413</span>
<span id="3414">3414</span>
<span id="3415">3415</span>
<span id="3416">3416</span>
<span id="3417">3417</span>
<span id="3418">3418</span>
<span id="3419">3419</span>
<span id="3420">3420</span>
<span id="3421">3421</span>
<span id="3422">3422</span>
<span id="3423">3423</span>
<span id="3424">3424</span>
<span id="3425">3425</span>
<span id="3426">3426</span>
<span id="3427">3427</span>
<span id="3428">3428</span>
<span id="3429">3429</span>
<span id="3430">3430</span>
<span id="3431">3431</span>
<span id="3432">3432</span>
<span id="3433">3433</span>
<span id="3434">3434</span>
<span id="3435">3435</span>
<span id="3436">3436</span>
<span id="3437">3437</span>
<span id="3438">3438</span>
<span id="3439">3439</span>
<span id="3440">3440</span>
<span id="3441">3441</span>
<span id="3442">3442</span>
<span id="3443">3443</span>
<span id="3444">3444</span>
<span id="3445">3445</span>
<span id="3446">3446</span>
<span id="3447">3447</span>
<span id="3448">3448</span>
<span id="3449">3449</span>
<span id="3450">3450</span>
<span id="3451">3451</span>
<span id="3452">3452</span>
<span id="3453">3453</span>
<span id="3454">3454</span>
<span id="3455">3455</span>
<span id="3456">3456</span>
<span id="3457">3457</span>
<span id="3458">3458</span>
<span id="3459">3459</span>
<span id="3460">3460</span>
<span id="3461">3461</span>
<span id="3462">3462</span>
<span id="3463">3463</span>
<span id="3464">3464</span>
<span id="3465">3465</span>
<span id="3466">3466</span>
<span id="3467">3467</span>
<span id="3468">3468</span>
<span id="3469">3469</span>
<span id="3470">3470</span>
<span id="3471">3471</span>
<span id="3472">3472</span>
<span id="3473">3473</span>
<span id="3474">3474</span>
<span id="3475">3475</span>
<span id="3476">3476</span>
<span id="3477">3477</span>
<span id="3478">3478</span>
<span id="3479">3479</span>
<span id="3480">3480</span>
<span id="3481">3481</span>
<span id="3482">3482</span>
<span id="3483">3483</span>
<span id="3484">3484</span>
<span id="3485">3485</span>
<span id="3486">3486</span>
<span id="3487">3487</span>
<span id="3488">3488</span>
<span id="3489">3489</span>
<span id="3490">3490</span>
<span id="3491">3491</span>
<span id="3492">3492</span>
<span id="3493">3493</span>
<span id="3494">3494</span>
<span id="3495">3495</span>
<span id="3496">3496</span>
<span id="3497">3497</span>
<span id="3498">3498</span>
<span id="3499">3499</span>
<span id="3500">3500</span>
<span id="3501">3501</span>
<span id="3502">3502</span>
<span id="3503">3503</span>
<span id="3504">3504</span>
<span id="3505">3505</span>
<span id="3506">3506</span>
<span id="3507">3507</span>
<span id="3508">3508</span>
<span id="3509">3509</span>
<span id="3510">3510</span>
<span id="3511">3511</span>
<span id="3512">3512</span>
<span id="3513">3513</span>
<span id="3514">3514</span>
<span id="3515">3515</span>
<span id="3516">3516</span>
<span id="3517">3517</span>
<span id="3518">3518</span>
<span id="3519">3519</span>
<span id="3520">3520</span>
<span id="3521">3521</span>
<span id="3522">3522</span>
<span id="3523">3523</span>
<span id="3524">3524</span>
<span id="3525">3525</span>
<span id="3526">3526</span>
<span id="3527">3527</span>
<span id="3528">3528</span>
<span id="3529">3529</span>
<span id="3530">3530</span>
<span id="3531">3531</span>
<span id="3532">3532</span>
<span id="3533">3533</span>
<span id="3534">3534</span>
<span id="3535">3535</span>
<span id="3536">3536</span>
<span id="3537">3537</span>
<span id="3538">3538</span>
<span id="3539">3539</span>
<span id="3540">3540</span>
<span id="3541">3541</span>
<span id="3542">3542</span>
<span id="3543">3543</span>
<span id="3544">3544</span>
<span id="3545">3545</span>
<span id="3546">3546</span>
<span id="3547">3547</span>
<span id="3548">3548</span>
<span id="3549">3549</span>
<span id="3550">3550</span>
<span id="3551">3551</span>
<span id="3552">3552</span>
<span id="3553">3553</span>
<span id="3554">3554</span>
<span id="3555">3555</span>
<span id="3556">3556</span>
<span id="3557">3557</span>
<span id="3558">3558</span>
<span id="3559">3559</span>
<span id="3560">3560</span>
<span id="3561">3561</span>
<span id="3562">3562</span>
<span id="3563">3563</span>
<span id="3564">3564</span>
<span id="3565">3565</span>
<span id="3566">3566</span>
<span id="3567">3567</span>
<span id="3568">3568</span>
<span id="3569">3569</span>
<span id="3570">3570</span>
<span id="3571">3571</span>
<span id="3572">3572</span>
<span id="3573">3573</span>
<span id="3574">3574</span>
<span id="3575">3575</span>
<span id="3576">3576</span>
<span id="3577">3577</span>
<span id="3578">3578</span>
<span id="3579">3579</span>
<span id="3580">3580</span>
<span id="3581">3581</span>
<span id="3582">3582</span>
<span id="3583">3583</span>
<span id="3584">3584</span>
<span id="3585">3585</span>
<span id="3586">3586</span>
<span id="3587">3587</span>
<span id="3588">3588</span>
<span id="3589">3589</span>
<span id="3590">3590</span>
<span id="3591">3591</span>
<span id="3592">3592</span>
<span id="3593">3593</span>
<span id="3594">3594</span>
<span id="3595">3595</span>
<span id="3596">3596</span>
<span id="3597">3597</span>
<span id="3598">3598</span>
<span id="3599">3599</span>
<span id="3600">3600</span>
<span id="3601">3601</span>
<span id="3602">3602</span>
<span id="3603">3603</span>
<span id="3604">3604</span>
<span id="3605">3605</span>
<span id="3606">3606</span>
<span id="3607">3607</span>
<span id="3608">3608</span>
<span id="3609">3609</span>
<span id="3610">3610</span>
<span id="3611">3611</span>
<span id="3612">3612</span>
<span id="3613">3613</span>
<span id="3614">3614</span>
<span id="3615">3615</span>
<span id="3616">3616</span>
<span id="3617">3617</span>
<span id="3618">3618</span>
<span id="3619">3619</span>
<span id="3620">3620</span>
<span id="3621">3621</span>
<span id="3622">3622</span>
<span id="3623">3623</span>
<span id="3624">3624</span>
<span id="3625">3625</span>
<span id="3626">3626</span>
<span id="3627">3627</span>
<span id="3628">3628</span>
<span id="3629">3629</span>
<span id="3630">3630</span>
<span id="3631">3631</span>
<span id="3632">3632</span>
<span id="3633">3633</span>
<span id="3634">3634</span>
<span id="3635">3635</span>
<span id="3636">3636</span>
<span id="3637">3637</span>
<span id="3638">3638</span>
<span id="3639">3639</span>
<span id="3640">3640</span>
<span id="3641">3641</span>
<span id="3642">3642</span>
<span id="3643">3643</span>
<span id="3644">3644</span>
<span id="3645">3645</span>
<span id="3646">3646</span>
<span id="3647">3647</span>
<span id="3648">3648</span>
<span id="3649">3649</span>
<span id="3650">3650</span>
<span id="3651">3651</span>
<span id="3652">3652</span>
<span id="3653">3653</span>
<span id="3654">3654</span>
<span id="3655">3655</span>
<span id="3656">3656</span>
<span id="3657">3657</span>
<span id="3658">3658</span>
<span id="3659">3659</span>
<span id="3660">3660</span>
<span id="3661">3661</span>
<span id="3662">3662</span>
<span id="3663">3663</span>
<span id="3664">3664</span>
<span id="3665">3665</span>
<span id="3666">3666</span>
<span id="3667">3667</span>
<span id="3668">3668</span>
<span id="3669">3669</span>
<span id="3670">3670</span>
<span id="3671">3671</span>
<span id="3672">3672</span>
<span id="3673">3673</span>
<span id="3674">3674</span>
<span id="3675">3675</span>
<span id="3676">3676</span>
<span id="3677">3677</span>
<span id="3678">3678</span>
<span id="3679">3679</span>
<span id="3680">3680</span>
<span id="3681">3681</span>
<span id="3682">3682</span>
<span id="3683">3683</span>
<span id="3684">3684</span>
<span id="3685">3685</span>
<span id="3686">3686</span>
<span id="3687">3687</span>
<span id="3688">3688</span>
<span id="3689">3689</span>
<span id="3690">3690</span>
<span id="3691">3691</span>
<span id="3692">3692</span>
<span id="3693">3693</span>
<span id="3694">3694</span>
<span id="3695">3695</span>
<span id="3696">3696</span>
<span id="3697">3697</span>
<span id="3698">3698</span>
<span id="3699">3699</span>
<span id="3700">3700</span>
<span id="3701">3701</span>
<span id="3702">3702</span>
<span id="3703">3703</span>
<span id="3704">3704</span>
<span id="3705">3705</span>
<span id="3706">3706</span>
<span id="3707">3707</span>
<span id="3708">3708</span>
<span id="3709">3709</span>
<span id="3710">3710</span>
<span id="3711">3711</span>
<span id="3712">3712</span>
<span id="3713">3713</span>
<span id="3714">3714</span>
<span id="3715">3715</span>
<span id="3716">3716</span>
<span id="3717">3717</span>
<span id="3718">3718</span>
<span id="3719">3719</span>
<span id="3720">3720</span>
<span id="3721">3721</span>
<span id="3722">3722</span>
<span id="3723">3723</span>
<span id="3724">3724</span>
<span id="3725">3725</span>
<span id="3726">3726</span>
<span id="3727">3727</span>
<span id="3728">3728</span>
<span id="3729">3729</span>
<span id="3730">3730</span>
<span id="3731">3731</span>
<span id="3732">3732</span>
<span id="3733">3733</span>
<span id="3734">3734</span>
<span id="3735">3735</span>
<span id="3736">3736</span>
<span id="3737">3737</span>
<span id="3738">3738</span>
<span id="3739">3739</span>
<span id="3740">3740</span>
<span id="3741">3741</span>
<span id="3742">3742</span>
<span id="3743">3743</span>
<span id="3744">3744</span>
<span id="3745">3745</span>
<span id="3746">3746</span>
<span id="3747">3747</span>
<span id="3748">3748</span>
<span id="3749">3749</span>
<span id="3750">3750</span>
<span id="3751">3751</span>
<span id="3752">3752</span>
<span id="3753">3753</span>
<span id="3754">3754</span>
<span id="3755">3755</span>
<span id="3756">3756</span>
<span id="3757">3757</span>
<span id="3758">3758</span>
<span id="3759">3759</span>
<span id="3760">3760</span>
<span id="3761">3761</span>
<span id="3762">3762</span>
<span id="3763">3763</span>
<span id="3764">3764</span>
<span id="3765">3765</span>
<span id="3766">3766</span>
<span id="3767">3767</span>
<span id="3768">3768</span>
<span id="3769">3769</span>
<span id="3770">3770</span>
<span id="3771">3771</span>
<span id="3772">3772</span>
<span id="3773">3773</span>
<span id="3774">3774</span>
<span id="3775">3775</span>
<span id="3776">3776</span>
<span id="3777">3777</span>
<span id="3778">3778</span>
<span id="3779">3779</span>
<span id="3780">3780</span>
<span id="3781">3781</span>
<span id="3782">3782</span>
<span id="3783">3783</span>
<span id="3784">3784</span>
<span id="3785">3785</span>
<span id="3786">3786</span>
<span id="3787">3787</span>
<span id="3788">3788</span>
<span id="3789">3789</span>
<span id="3790">3790</span>
<span id="3791">3791</span>
<span id="3792">3792</span>
<span id="3793">3793</span>
<span id="3794">3794</span>
<span id="3795">3795</span>
<span id="3796">3796</span>
<span id="3797">3797</span>
<span id="3798">3798</span>
<span id="3799">3799</span>
<span id="3800">3800</span>
<span id="3801">3801</span>
<span id="3802">3802</span>
<span id="3803">3803</span>
<span id="3804">3804</span>
<span id="3805">3805</span>
<span id="3806">3806</span>
<span id="3807">3807</span>
<span id="3808">3808</span>
<span id="3809">3809</span>
<span id="3810">3810</span>
<span id="3811">3811</span>
<span id="3812">3812</span>
<span id="3813">3813</span>
<span id="3814">3814</span>
<span id="3815">3815</span>
<span id="3816">3816</span>
<span id="3817">3817</span>
<span id="3818">3818</span>
<span id="3819">3819</span>
<span id="3820">3820</span>
<span id="3821">3821</span>
<span id="3822">3822</span>
<span id="3823">3823</span>
<span id="3824">3824</span>
<span id="3825">3825</span>
<span id="3826">3826</span>
<span id="3827">3827</span>
<span id="3828">3828</span>
<span id="3829">3829</span>
<span id="3830">3830</span>
<span id="3831">3831</span>
<span id="3832">3832</span>
<span id="3833">3833</span>
<span id="3834">3834</span>
<span id="3835">3835</span>
<span id="3836">3836</span>
<span id="3837">3837</span>
<span id="3838">3838</span>
<span id="3839">3839</span>
<span id="3840">3840</span>
<span id="3841">3841</span>
<span id="3842">3842</span>
<span id="3843">3843</span>
<span id="3844">3844</span>
<span id="3845">3845</span>
<span id="3846">3846</span>
<span id="3847">3847</span>
<span id="3848">3848</span>
<span id="3849">3849</span>
<span id="3850">3850</span>
<span id="3851">3851</span>
<span id="3852">3852</span>
<span id="3853">3853</span>
<span id="3854">3854</span>
<span id="3855">3855</span>
<span id="3856">3856</span>
<span id="3857">3857</span>
<span id="3858">3858</span>
<span id="3859">3859</span>
<span id="3860">3860</span>
<span id="3861">3861</span>
<span id="3862">3862</span>
<span id="3863">3863</span>
<span id="3864">3864</span>
<span id="3865">3865</span>
<span id="3866">3866</span>
<span id="3867">3867</span>
<span id="3868">3868</span>
<span id="3869">3869</span>
<span id="3870">3870</span>
<span id="3871">3871</span>
<span id="3872">3872</span>
<span id="3873">3873</span>
<span id="3874">3874</span>
<span id="3875">3875</span>
<span id="3876">3876</span>
<span id="3877">3877</span>
<span id="3878">3878</span>
<span id="3879">3879</span>
<span id="3880">3880</span>
<span id="3881">3881</span>
<span id="3882">3882</span>
<span id="3883">3883</span>
<span id="3884">3884</span>
<span id="3885">3885</span>
<span id="3886">3886</span>
<span id="3887">3887</span>
<span id="3888">3888</span>
<span id="3889">3889</span>
<span id="3890">3890</span>
<span id="3891">3891</span>
<span id="3892">3892</span>
<span id="3893">3893</span>
<span id="3894">3894</span>
<span id="3895">3895</span>
<span id="3896">3896</span>
<span id="3897">3897</span>
<span id="3898">3898</span>
<span id="3899">3899</span>
<span id="3900">3900</span>
<span id="3901">3901</span>
<span id="3902">3902</span>
<span id="3903">3903</span>
<span id="3904">3904</span>
<span id="3905">3905</span>
<span id="3906">3906</span>
<span id="3907">3907</span>
<span id="3908">3908</span>
<span id="3909">3909</span>
<span id="3910">3910</span>
<span id="3911">3911</span>
<span id="3912">3912</span>
<span id="3913">3913</span>
<span id="3914">3914</span>
<span id="3915">3915</span>
<span id="3916">3916</span>
<span id="3917">3917</span>
<span id="3918">3918</span>
<span id="3919">3919</span>
<span id="3920">3920</span>
<span id="3921">3921</span>
<span id="3922">3922</span>
<span id="3923">3923</span>
<span id="3924">3924</span>
<span id="3925">3925</span>
<span id="3926">3926</span>
<span id="3927">3927</span>
<span id="3928">3928</span>
<span id="3929">3929</span>
<span id="3930">3930</span>
<span id="3931">3931</span>
<span id="3932">3932</span>
<span id="3933">3933</span>
<span id="3934">3934</span>
<span id="3935">3935</span>
<span id="3936">3936</span>
<span id="3937">3937</span>
<span id="3938">3938</span>
<span id="3939">3939</span>
<span id="3940">3940</span>
<span id="3941">3941</span>
<span id="3942">3942</span>
<span id="3943">3943</span>
<span id="3944">3944</span>
<span id="3945">3945</span>
<span id="3946">3946</span>
<span id="3947">3947</span>
<span id="3948">3948</span>
<span id="3949">3949</span>
<span id="3950">3950</span>
<span id="3951">3951</span>
<span id="3952">3952</span>
<span id="3953">3953</span>
<span id="3954">3954</span>
<span id="3955">3955</span>
<span id="3956">3956</span>
<span id="3957">3957</span>
<span id="3958">3958</span>
<span id="3959">3959</span>
<span id="3960">3960</span>
<span id="3961">3961</span>
<span id="3962">3962</span>
<span id="3963">3963</span>
<span id="3964">3964</span>
<span id="3965">3965</span>
<span id="3966">3966</span>
<span id="3967">3967</span>
<span id="3968">3968</span>
<span id="3969">3969</span>
<span id="3970">3970</span>
<span id="3971">3971</span>
<span id="3972">3972</span>
<span id="3973">3973</span>
<span id="3974">3974</span>
<span id="3975">3975</span>
<span id="3976">3976</span>
<span id="3977">3977</span>
<span id="3978">3978</span>
<span id="3979">3979</span>
<span id="3980">3980</span>
<span id="3981">3981</span>
<span id="3982">3982</span>
<span id="3983">3983</span>
<span id="3984">3984</span>
<span id="3985">3985</span>
<span id="3986">3986</span>
<span id="3987">3987</span>
<span id="3988">3988</span>
<span id="3989">3989</span>
<span id="3990">3990</span>
<span id="3991">3991</span>
<span id="3992">3992</span>
<span id="3993">3993</span>
<span id="3994">3994</span>
<span id="3995">3995</span>
<span id="3996">3996</span>
<span id="3997">3997</span>
<span id="3998">3998</span>
<span id="3999">3999</span>
<span id="4000">4000</span>
<span id="4001">4001</span>
<span id="4002">4002</span>
<span id="4003">4003</span>
<span id="4004">4004</span>
<span id="4005">4005</span>
<span id="4006">4006</span>
<span id="4007">4007</span>
<span id="4008">4008</span>
<span id="4009">4009</span>
<span id="4010">4010</span>
<span id="4011">4011</span>
<span id="4012">4012</span>
<span id="4013">4013</span>
<span id="4014">4014</span>
<span id="4015">4015</span>
<span id="4016">4016</span>
<span id="4017">4017</span>
<span id="4018">4018</span>
<span id="4019">4019</span>
<span id="4020">4020</span>
<span id="4021">4021</span>
<span id="4022">4022</span>
<span id="4023">4023</span>
<span id="4024">4024</span>
<span id="4025">4025</span>
<span id="4026">4026</span>
<span id="4027">4027</span>
<span id="4028">4028</span>
<span id="4029">4029</span>
<span id="4030">4030</span>
<span id="4031">4031</span>
<span id="4032">4032</span>
<span id="4033">4033</span>
<span id="4034">4034</span>
<span id="4035">4035</span>
<span id="4036">4036</span>
<span id="4037">4037</span>
<span id="4038">4038</span>
<span id="4039">4039</span>
<span id="4040">4040</span>
<span id="4041">4041</span>
<span id="4042">4042</span>
<span id="4043">4043</span>
<span id="4044">4044</span>
<span id="4045">4045</span>
<span id="4046">4046</span>
<span id="4047">4047</span>
<span id="4048">4048</span>
<span id="4049">4049</span>
<span id="4050">4050</span>
<span id="4051">4051</span>
<span id="4052">4052</span>
<span id="4053">4053</span>
<span id="4054">4054</span>
<span id="4055">4055</span>
<span id="4056">4056</span>
<span id="4057">4057</span>
<span id="4058">4058</span>
<span id="4059">4059</span>
<span id="4060">4060</span>
<span id="4061">4061</span>
<span id="4062">4062</span>
<span id="4063">4063</span>
<span id="4064">4064</span>
<span id="4065">4065</span>
<span id="4066">4066</span>
<span id="4067">4067</span>
<span id="4068">4068</span>
<span id="4069">4069</span>
<span id="4070">4070</span>
<span id="4071">4071</span>
<span id="4072">4072</span>
<span id="4073">4073</span>
<span id="4074">4074</span>
<span id="4075">4075</span>
<span id="4076">4076</span>
<span id="4077">4077</span>
<span id="4078">4078</span>
<span id="4079">4079</span>
<span id="4080">4080</span>
<span id="4081">4081</span>
<span id="4082">4082</span>
<span id="4083">4083</span>
<span id="4084">4084</span>
<span id="4085">4085</span>
<span id="4086">4086</span>
<span id="4087">4087</span>
<span id="4088">4088</span>
<span id="4089">4089</span>
<span id="4090">4090</span>
<span id="4091">4091</span>
<span id="4092">4092</span>
<span id="4093">4093</span>
<span id="4094">4094</span>
<span id="4095">4095</span>
<span id="4096">4096</span>
<span id="4097">4097</span>
<span id="4098">4098</span>
<span id="4099">4099</span>
<span id="4100">4100</span>
<span id="4101">4101</span>
<span id="4102">4102</span>
<span id="4103">4103</span>
<span id="4104">4104</span>
<span id="4105">4105</span>
<span id="4106">4106</span>
<span id="4107">4107</span>
<span id="4108">4108</span>
<span id="4109">4109</span>
<span id="4110">4110</span>
<span id="4111">4111</span>
<span id="4112">4112</span>
<span id="4113">4113</span>
<span id="4114">4114</span>
<span id="4115">4115</span>
<span id="4116">4116</span>
<span id="4117">4117</span>
<span id="4118">4118</span>
<span id="4119">4119</span>
<span id="4120">4120</span>
<span id="4121">4121</span>
<span id="4122">4122</span>
<span id="4123">4123</span>
<span id="4124">4124</span>
<span id="4125">4125</span>
<span id="4126">4126</span>
<span id="4127">4127</span>
<span id="4128">4128</span>
<span id="4129">4129</span>
<span id="4130">4130</span>
<span id="4131">4131</span>
<span id="4132">4132</span>
<span id="4133">4133</span>
<span id="4134">4134</span>
<span id="4135">4135</span>
<span id="4136">4136</span>
<span id="4137">4137</span>
<span id="4138">4138</span>
<span id="4139">4139</span>
<span id="4140">4140</span>
<span id="4141">4141</span>
<span id="4142">4142</span>
<span id="4143">4143</span>
<span id="4144">4144</span>
<span id="4145">4145</span>
<span id="4146">4146</span>
<span id="4147">4147</span>
<span id="4148">4148</span>
<span id="4149">4149</span>
<span id="4150">4150</span>
<span id="4151">4151</span>
<span id="4152">4152</span>
<span id="4153">4153</span>
<span id="4154">4154</span>
<span id="4155">4155</span>
<span id="4156">4156</span>
<span id="4157">4157</span>
<span id="4158">4158</span>
<span id="4159">4159</span>
<span id="4160">4160</span>
<span id="4161">4161</span>
<span id="4162">4162</span>
<span id="4163">4163</span>
<span id="4164">4164</span>
<span id="4165">4165</span>
<span id="4166">4166</span>
<span id="4167">4167</span>
<span id="4168">4168</span>
<span id="4169">4169</span>
<span id="4170">4170</span>
<span id="4171">4171</span>
<span id="4172">4172</span>
<span id="4173">4173</span>
<span id="4174">4174</span>
<span id="4175">4175</span>
<span id="4176">4176</span>
<span id="4177">4177</span>
<span id="4178">4178</span>
<span id="4179">4179</span>
<span id="4180">4180</span>
<span id="4181">4181</span>
<span id="4182">4182</span>
<span id="4183">4183</span>
<span id="4184">4184</span>
<span id="4185">4185</span>
<span id="4186">4186</span>
<span id="4187">4187</span>
<span id="4188">4188</span>
<span id="4189">4189</span>
<span id="4190">4190</span>
<span id="4191">4191</span>
<span id="4192">4192</span>
<span id="4193">4193</span>
<span id="4194">4194</span>
<span id="4195">4195</span>
<span id="4196">4196</span>
<span id="4197">4197</span>
<span id="4198">4198</span>
<span id="4199">4199</span>
<span id="4200">4200</span>
<span id="4201">4201</span>
<span id="4202">4202</span>
<span id="4203">4203</span>
<span id="4204">4204</span>
<span id="4205">4205</span>
<span id="4206">4206</span>
<span id="4207">4207</span>
<span id="4208">4208</span>
<span id="4209">4209</span>
<span id="4210">4210</span>
<span id="4211">4211</span>
<span id="4212">4212</span>
<span id="4213">4213</span>
<span id="4214">4214</span>
<span id="4215">4215</span>
<span id="4216">4216</span>
<span id="4217">4217</span>
<span id="4218">4218</span>
<span id="4219">4219</span>
<span id="4220">4220</span>
<span id="4221">4221</span>
<span id="4222">4222</span>
<span id="4223">4223</span>
<span id="4224">4224</span>
<span id="4225">4225</span>
<span id="4226">4226</span>
<span id="4227">4227</span>
<span id="4228">4228</span>
<span id="4229">4229</span>
<span id="4230">4230</span>
<span id="4231">4231</span>
<span id="4232">4232</span>
<span id="4233">4233</span>
<span id="4234">4234</span>
<span id="4235">4235</span>
<span id="4236">4236</span>
<span id="4237">4237</span>
<span id="4238">4238</span>
<span id="4239">4239</span>
<span id="4240">4240</span>
<span id="4241">4241</span>
<span id="4242">4242</span>
<span id="4243">4243</span>
<span id="4244">4244</span>
<span id="4245">4245</span>
<span id="4246">4246</span>
<span id="4247">4247</span>
<span id="4248">4248</span>
<span id="4249">4249</span>
<span id="4250">4250</span>
<span id="4251">4251</span>
<span id="4252">4252</span>
<span id="4253">4253</span>
<span id="4254">4254</span>
<span id="4255">4255</span>
<span id="4256">4256</span>
<span id="4257">4257</span>
<span id="4258">4258</span>
<span id="4259">4259</span>
<span id="4260">4260</span>
<span id="4261">4261</span>
<span id="4262">4262</span>
<span id="4263">4263</span>
<span id="4264">4264</span>
<span id="4265">4265</span>
<span id="4266">4266</span>
<span id="4267">4267</span>
<span id="4268">4268</span>
<span id="4269">4269</span>
<span id="4270">4270</span>
<span id="4271">4271</span>
<span id="4272">4272</span>
<span id="4273">4273</span>
<span id="4274">4274</span>
<span id="4275">4275</span>
<span id="4276">4276</span>
<span id="4277">4277</span>
<span id="4278">4278</span>
<span id="4279">4279</span>
<span id="4280">4280</span>
<span id="4281">4281</span>
<span id="4282">4282</span>
<span id="4283">4283</span>
<span id="4284">4284</span>
<span id="4285">4285</span>
<span id="4286">4286</span>
<span id="4287">4287</span>
<span id="4288">4288</span>
<span id="4289">4289</span>
<span id="4290">4290</span>
<span id="4291">4291</span>
<span id="4292">4292</span>
<span id="4293">4293</span>
<span id="4294">4294</span>
<span id="4295">4295</span>
<span id="4296">4296</span>
<span id="4297">4297</span>
<span id="4298">4298</span>
<span id="4299">4299</span>
<span id="4300">4300</span>
<span id="4301">4301</span>
<span id="4302">4302</span>
<span id="4303">4303</span>
<span id="4304">4304</span>
<span id="4305">4305</span>
<span id="4306">4306</span>
<span id="4307">4307</span>
<span id="4308">4308</span>
<span id="4309">4309</span>
<span id="4310">4310</span>
<span id="4311">4311</span>
<span id="4312">4312</span>
<span id="4313">4313</span>
<span id="4314">4314</span>
<span id="4315">4315</span>
<span id="4316">4316</span>
<span id="4317">4317</span>
<span id="4318">4318</span>
<span id="4319">4319</span>
<span id="4320">4320</span>
<span id="4321">4321</span>
<span id="4322">4322</span>
<span id="4323">4323</span>
<span id="4324">4324</span>
<span id="4325">4325</span>
<span id="4326">4326</span>
<span id="4327">4327</span>
<span id="4328">4328</span>
<span id="4329">4329</span>
<span id="4330">4330</span>
<span id="4331">4331</span>
<span id="4332">4332</span>
<span id="4333">4333</span>
<span id="4334">4334</span>
<span id="4335">4335</span>
<span id="4336">4336</span>
<span id="4337">4337</span>
<span id="4338">4338</span>
<span id="4339">4339</span>
<span id="4340">4340</span>
<span id="4341">4341</span>
<span id="4342">4342</span>
<span id="4343">4343</span>
<span id="4344">4344</span>
<span id="4345">4345</span>
<span id="4346">4346</span>
<span id="4347">4347</span>
<span id="4348">4348</span>
<span id="4349">4349</span>
<span id="4350">4350</span>
<span id="4351">4351</span>
<span id="4352">4352</span>
<span id="4353">4353</span>
<span id="4354">4354</span>
<span id="4355">4355</span>
<span id="4356">4356</span>
<span id="4357">4357</span>
<span id="4358">4358</span>
<span id="4359">4359</span>
<span id="4360">4360</span>
<span id="4361">4361</span>
<span id="4362">4362</span>
<span id="4363">4363</span>
<span id="4364">4364</span>
<span id="4365">4365</span>
<span id="4366">4366</span>
<span id="4367">4367</span>
<span id="4368">4368</span>
<span id="4369">4369</span>
<span id="4370">4370</span>
<span id="4371">4371</span>
<span id="4372">4372</span>
<span id="4373">4373</span>
<span id="4374">4374</span>
<span id="4375">4375</span>
<span id="4376">4376</span>
<span id="4377">4377</span>
<span id="4378">4378</span>
<span id="4379">4379</span>
<span id="4380">4380</span>
<span id="4381">4381</span>
<span id="4382">4382</span>
<span id="4383">4383</span>
<span id="4384">4384</span>
<span id="4385">4385</span>
<span id="4386">4386</span>
<span id="4387">4387</span>
<span id="4388">4388</span>
<span id="4389">4389</span>
<span id="4390">4390</span>
<span id="4391">4391</span>
<span id="4392">4392</span>
<span id="4393">4393</span>
<span id="4394">4394</span>
<span id="4395">4395</span>
<span id="4396">4396</span>
<span id="4397">4397</span>
<span id="4398">4398</span>
<span id="4399">4399</span>
<span id="4400">4400</span>
<span id="4401">4401</span>
<span id="4402">4402</span>
<span id="4403">4403</span>
<span id="4404">4404</span>
<span id="4405">4405</span>
<span id="4406">4406</span>
<span id="4407">4407</span>
<span id="4408">4408</span>
<span id="4409">4409</span>
<span id="4410">4410</span>
<span id="4411">4411</span>
<span id="4412">4412</span>
<span id="4413">4413</span>
<span id="4414">4414</span>
<span id="4415">4415</span>
<span id="4416">4416</span>
<span id="4417">4417</span>
<span id="4418">4418</span>
<span id="4419">4419</span>
<span id="4420">4420</span>
<span id="4421">4421</span>
<span id="4422">4422</span>
<span id="4423">4423</span>
<span id="4424">4424</span>
<span id="4425">4425</span>
<span id="4426">4426</span>
<span id="4427">4427</span>
<span id="4428">4428</span>
<span id="4429">4429</span>
<span id="4430">4430</span>
<span id="4431">4431</span>
<span id="4432">4432</span>
<span id="4433">4433</span>
<span id="4434">4434</span>
<span id="4435">4435</span>
<span id="4436">4436</span>
<span id="4437">4437</span>
<span id="4438">4438</span>
<span id="4439">4439</span>
<span id="4440">4440</span>
<span id="4441">4441</span>
<span id="4442">4442</span>
<span id="4443">4443</span>
<span id="4444">4444</span>
<span id="4445">4445</span>
<span id="4446">4446</span>
<span id="4447">4447</span>
<span id="4448">4448</span>
<span id="4449">4449</span>
<span id="4450">4450</span>
<span id="4451">4451</span>
<span id="4452">4452</span>
<span id="4453">4453</span>
<span id="4454">4454</span>
<span id="4455">4455</span>
<span id="4456">4456</span>
<span id="4457">4457</span>
<span id="4458">4458</span>
<span id="4459">4459</span>
<span id="4460">4460</span>
<span id="4461">4461</span>
<span id="4462">4462</span>
<span id="4463">4463</span>
<span id="4464">4464</span>
<span id="4465">4465</span>
<span id="4466">4466</span>
<span id="4467">4467</span>
<span id="4468">4468</span>
<span id="4469">4469</span>
<span id="4470">4470</span>
<span id="4471">4471</span>
<span id="4472">4472</span>
<span id="4473">4473</span>
<span id="4474">4474</span>
<span id="4475">4475</span>
<span id="4476">4476</span>
<span id="4477">4477</span>
<span id="4478">4478</span>
<span id="4479">4479</span>
<span id="4480">4480</span>
<span id="4481">4481</span>
<span id="4482">4482</span>
<span id="4483">4483</span>
<span id="4484">4484</span>
<span id="4485">4485</span>
<span id="4486">4486</span>
<span id="4487">4487</span>
<span id="4488">4488</span>
<span id="4489">4489</span>
<span id="4490">4490</span>
<span id="4491">4491</span>
<span id="4492">4492</span>
<span id="4493">4493</span>
<span id="4494">4494</span>
<span id="4495">4495</span>
<span id="4496">4496</span>
<span id="4497">4497</span>
<span id="4498">4498</span>
<span id="4499">4499</span>
<span id="4500">4500</span>
<span id="4501">4501</span>
<span id="4502">4502</span>
<span id="4503">4503</span>
<span id="4504">4504</span>
<span id="4505">4505</span>
<span id="4506">4506</span>
<span id="4507">4507</span>
<span id="4508">4508</span>
<span id="4509">4509</span>
<span id="4510">4510</span>
<span id="4511">4511</span>
<span id="4512">4512</span>
<span id="4513">4513</span>
<span id="4514">4514</span>
<span id="4515">4515</span>
<span id="4516">4516</span>
<span id="4517">4517</span>
<span id="4518">4518</span>
<span id="4519">4519</span>
<span id="4520">4520</span>
<span id="4521">4521</span>
<span id="4522">4522</span>
<span id="4523">4523</span>
<span id="4524">4524</span>
<span id="4525">4525</span>
<span id="4526">4526</span>
<span id="4527">4527</span>
<span id="4528">4528</span>
<span id="4529">4529</span>
<span id="4530">4530</span>
<span id="4531">4531</span>
<span id="4532">4532</span>
<span id="4533">4533</span>
<span id="4534">4534</span>
<span id="4535">4535</span>
<span id="4536">4536</span>
<span id="4537">4537</span>
<span id="4538">4538</span>
<span id="4539">4539</span>
<span id="4540">4540</span>
<span id="4541">4541</span>
<span id="4542">4542</span>
<span id="4543">4543</span>
<span id="4544">4544</span>
<span id="4545">4545</span>
<span id="4546">4546</span>
<span id="4547">4547</span>
<span id="4548">4548</span>
<span id="4549">4549</span>
<span id="4550">4550</span>
<span id="4551">4551</span>
<span id="4552">4552</span>
<span id="4553">4553</span>
<span id="4554">4554</span>
<span id="4555">4555</span>
<span id="4556">4556</span>
<span id="4557">4557</span>
<span id="4558">4558</span>
<span id="4559">4559</span>
<span id="4560">4560</span>
<span id="4561">4561</span>
<span id="4562">4562</span>
<span id="4563">4563</span>
<span id="4564">4564</span>
<span id="4565">4565</span>
<span id="4566">4566</span>
<span id="4567">4567</span>
<span id="4568">4568</span>
<span id="4569">4569</span>
<span id="4570">4570</span>
<span id="4571">4571</span>
<span id="4572">4572</span>
<span id="4573">4573</span>
<span id="4574">4574</span>
<span id="4575">4575</span>
<span id="4576">4576</span>
<span id="4577">4577</span>
<span id="4578">4578</span>
<span id="4579">4579</span>
<span id="4580">4580</span>
<span id="4581">4581</span>
<span id="4582">4582</span>
<span id="4583">4583</span>
<span id="4584">4584</span>
<span id="4585">4585</span>
<span id="4586">4586</span>
<span id="4587">4587</span>
<span id="4588">4588</span>
<span id="4589">4589</span>
<span id="4590">4590</span>
<span id="4591">4591</span>
<span id="4592">4592</span>
<span id="4593">4593</span>
<span id="4594">4594</span>
<span id="4595">4595</span>
<span id="4596">4596</span>
<span id="4597">4597</span>
<span id="4598">4598</span>
<span id="4599">4599</span>
<span id="4600">4600</span>
<span id="4601">4601</span>
<span id="4602">4602</span>
<span id="4603">4603</span>
<span id="4604">4604</span>
<span id="4605">4605</span>
<span id="4606">4606</span>
<span id="4607">4607</span>
<span id="4608">4608</span>
<span id="4609">4609</span>
<span id="4610">4610</span>
<span id="4611">4611</span>
<span id="4612">4612</span>
<span id="4613">4613</span>
<span id="4614">4614</span>
<span id="4615">4615</span>
<span id="4616">4616</span>
<span id="4617">4617</span>
<span id="4618">4618</span>
<span id="4619">4619</span>
<span id="4620">4620</span>
<span id="4621">4621</span>
<span id="4622">4622</span>
<span id="4623">4623</span>
<span id="4624">4624</span>
<span id="4625">4625</span>
<span id="4626">4626</span>
<span id="4627">4627</span>
<span id="4628">4628</span>
<span id="4629">4629</span>
<span id="4630">4630</span>
<span id="4631">4631</span>
<span id="4632">4632</span>
<span id="4633">4633</span>
<span id="4634">4634</span>
<span id="4635">4635</span>
<span id="4636">4636</span>
<span id="4637">4637</span>
<span id="4638">4638</span>
<span id="4639">4639</span>
<span id="4640">4640</span>
<span id="4641">4641</span>
<span id="4642">4642</span>
<span id="4643">4643</span>
<span id="4644">4644</span>
<span id="4645">4645</span>
<span id="4646">4646</span>
<span id="4647">4647</span>
<span id="4648">4648</span>
<span id="4649">4649</span>
<span id="4650">4650</span>
<span id="4651">4651</span>
<span id="4652">4652</span>
<span id="4653">4653</span>
<span id="4654">4654</span>
<span id="4655">4655</span>
<span id="4656">4656</span>
<span id="4657">4657</span>
<span id="4658">4658</span>
<span id="4659">4659</span>
<span id="4660">4660</span>
<span id="4661">4661</span>
<span id="4662">4662</span>
<span id="4663">4663</span>
<span id="4664">4664</span>
<span id="4665">4665</span>
<span id="4666">4666</span>
<span id="4667">4667</span>
<span id="4668">4668</span>
<span id="4669">4669</span>
<span id="4670">4670</span>
<span id="4671">4671</span>
<span id="4672">4672</span>
<span id="4673">4673</span>
<span id="4674">4674</span>
<span id="4675">4675</span>
<span id="4676">4676</span>
<span id="4677">4677</span>
<span id="4678">4678</span>
<span id="4679">4679</span>
<span id="4680">4680</span>
<span id="4681">4681</span>
<span id="4682">4682</span>
<span id="4683">4683</span>
<span id="4684">4684</span>
<span id="4685">4685</span>
<span id="4686">4686</span>
<span id="4687">4687</span>
<span id="4688">4688</span>
<span id="4689">4689</span>
<span id="4690">4690</span>
<span id="4691">4691</span>
<span id="4692">4692</span>
<span id="4693">4693</span>
<span id="4694">4694</span>
<span id="4695">4695</span>
<span id="4696">4696</span>
<span id="4697">4697</span>
<span id="4698">4698</span>
<span id="4699">4699</span>
<span id="4700">4700</span>
<span id="4701">4701</span>
<span id="4702">4702</span>
<span id="4703">4703</span>
<span id="4704">4704</span>
<span id="4705">4705</span>
<span id="4706">4706</span>
<span id="4707">4707</span>
<span id="4708">4708</span>
<span id="4709">4709</span>
<span id="4710">4710</span>
<span id="4711">4711</span>
<span id="4712">4712</span>
<span id="4713">4713</span>
<span id="4714">4714</span>
<span id="4715">4715</span>
<span id="4716">4716</span>
<span id="4717">4717</span>
<span id="4718">4718</span>
<span id="4719">4719</span>
<span id="4720">4720</span>
<span id="4721">4721</span>
<span id="4722">4722</span>
<span id="4723">4723</span>
<span id="4724">4724</span>
<span id="4725">4725</span>
<span id="4726">4726</span>
<span id="4727">4727</span>
<span id="4728">4728</span>
<span id="4729">4729</span>
<span id="4730">4730</span>
<span id="4731">4731</span>
<span id="4732">4732</span>
<span id="4733">4733</span>
<span id="4734">4734</span>
<span id="4735">4735</span>
<span id="4736">4736</span>
<span id="4737">4737</span>
<span id="4738">4738</span>
<span id="4739">4739</span>
<span id="4740">4740</span>
<span id="4741">4741</span>
<span id="4742">4742</span>
<span id="4743">4743</span>
<span id="4744">4744</span>
<span id="4745">4745</span>
<span id="4746">4746</span>
<span id="4747">4747</span>
<span id="4748">4748</span>
<span id="4749">4749</span>
<span id="4750">4750</span>
<span id="4751">4751</span>
<span id="4752">4752</span>
<span id="4753">4753</span>
<span id="4754">4754</span>
<span id="4755">4755</span>
<span id="4756">4756</span>
<span id="4757">4757</span>
<span id="4758">4758</span>
<span id="4759">4759</span>
<span id="4760">4760</span>
<span id="4761">4761</span>
<span id="4762">4762</span>
<span id="4763">4763</span>
<span id="4764">4764</span>
<span id="4765">4765</span>
<span id="4766">4766</span>
<span id="4767">4767</span>
<span id="4768">4768</span>
<span id="4769">4769</span>
<span id="4770">4770</span>
<span id="4771">4771</span>
<span id="4772">4772</span>
<span id="4773">4773</span>
<span id="4774">4774</span>
<span id="4775">4775</span>
<span id="4776">4776</span>
<span id="4777">4777</span>
<span id="4778">4778</span>
<span id="4779">4779</span>
<span id="4780">4780</span>
<span id="4781">4781</span>
<span id="4782">4782</span>
<span id="4783">4783</span>
<span id="4784">4784</span>
<span id="4785">4785</span>
<span id="4786">4786</span>
<span id="4787">4787</span>
<span id="4788">4788</span>
<span id="4789">4789</span>
<span id="4790">4790</span>
<span id="4791">4791</span>
<span id="4792">4792</span>
<span id="4793">4793</span>
<span id="4794">4794</span>
<span id="4795">4795</span>
<span id="4796">4796</span>
<span id="4797">4797</span>
<span id="4798">4798</span>
<span id="4799">4799</span>
<span id="4800">4800</span>
<span id="4801">4801</span>
<span id="4802">4802</span>
<span id="4803">4803</span>
<span id="4804">4804</span>
<span id="4805">4805</span>
<span id="4806">4806</span>
<span id="4807">4807</span>
<span id="4808">4808</span>
<span id="4809">4809</span>
<span id="4810">4810</span>
<span id="4811">4811</span>
<span id="4812">4812</span>
<span id="4813">4813</span>
<span id="4814">4814</span>
<span id="4815">4815</span>
<span id="4816">4816</span>
<span id="4817">4817</span>
<span id="4818">4818</span>
<span id="4819">4819</span>
<span id="4820">4820</span>
<span id="4821">4821</span>
<span id="4822">4822</span>
<span id="4823">4823</span>
<span id="4824">4824</span>
<span id="4825">4825</span>
<span id="4826">4826</span>
<span id="4827">4827</span>
<span id="4828">4828</span>
<span id="4829">4829</span>
<span id="4830">4830</span>
<span id="4831">4831</span>
<span id="4832">4832</span>
<span id="4833">4833</span>
<span id="4834">4834</span>
<span id="4835">4835</span>
<span id="4836">4836</span>
<span id="4837">4837</span>
<span id="4838">4838</span>
<span id="4839">4839</span>
<span id="4840">4840</span>
<span id="4841">4841</span>
<span id="4842">4842</span>
<span id="4843">4843</span>
<span id="4844">4844</span>
<span id="4845">4845</span>
<span id="4846">4846</span>
<span id="4847">4847</span>
<span id="4848">4848</span>
<span id="4849">4849</span>
<span id="4850">4850</span>
<span id="4851">4851</span>
<span id="4852">4852</span>
<span id="4853">4853</span>
<span id="4854">4854</span>
<span id="4855">4855</span>
<span id="4856">4856</span>
<span id="4857">4857</span>
<span id="4858">4858</span>
<span id="4859">4859</span>
<span id="4860">4860</span>
<span id="4861">4861</span>
<span id="4862">4862</span>
<span id="4863">4863</span>
<span id="4864">4864</span>
<span id="4865">4865</span>
<span id="4866">4866</span>
<span id="4867">4867</span>
<span id="4868">4868</span>
<span id="4869">4869</span>
<span id="4870">4870</span>
<span id="4871">4871</span>
<span id="4872">4872</span>
<span id="4873">4873</span>
<span id="4874">4874</span>
<span id="4875">4875</span>
<span id="4876">4876</span>
<span id="4877">4877</span>
<span id="4878">4878</span>
<span id="4879">4879</span>
<span id="4880">4880</span>
<span id="4881">4881</span>
<span id="4882">4882</span>
<span id="4883">4883</span>
<span id="4884">4884</span>
<span id="4885">4885</span>
<span id="4886">4886</span>
<span id="4887">4887</span>
<span id="4888">4888</span>
<span id="4889">4889</span>
<span id="4890">4890</span>
<span id="4891">4891</span>
<span id="4892">4892</span>
<span id="4893">4893</span>
<span id="4894">4894</span>
<span id="4895">4895</span>
<span id="4896">4896</span>
<span id="4897">4897</span>
<span id="4898">4898</span>
<span id="4899">4899</span>
<span id="4900">4900</span>
<span id="4901">4901</span>
<span id="4902">4902</span>
<span id="4903">4903</span>
<span id="4904">4904</span>
<span id="4905">4905</span>
<span id="4906">4906</span>
<span id="4907">4907</span>
<span id="4908">4908</span>
<span id="4909">4909</span>
<span id="4910">4910</span>
<span id="4911">4911</span>
<span id="4912">4912</span>
<span id="4913">4913</span>
<span id="4914">4914</span>
<span id="4915">4915</span>
<span id="4916">4916</span>
<span id="4917">4917</span>
<span id="4918">4918</span>
<span id="4919">4919</span>
<span id="4920">4920</span>
<span id="4921">4921</span>
<span id="4922">4922</span>
<span id="4923">4923</span>
<span id="4924">4924</span>
<span id="4925">4925</span>
<span id="4926">4926</span>
<span id="4927">4927</span>
<span id="4928">4928</span>
<span id="4929">4929</span>
<span id="4930">4930</span>
<span id="4931">4931</span>
<span id="4932">4932</span>
<span id="4933">4933</span>
<span id="4934">4934</span>
<span id="4935">4935</span>
<span id="4936">4936</span>
<span id="4937">4937</span>
<span id="4938">4938</span>
<span id="4939">4939</span>
<span id="4940">4940</span>
<span id="4941">4941</span>
<span id="4942">4942</span>
<span id="4943">4943</span>
<span id="4944">4944</span>
<span id="4945">4945</span>
<span id="4946">4946</span>
<span id="4947">4947</span>
<span id="4948">4948</span>
<span id="4949">4949</span>
<span id="4950">4950</span>
<span id="4951">4951</span>
<span id="4952">4952</span>
<span id="4953">4953</span>
<span id="4954">4954</span>
<span id="4955">4955</span>
<span id="4956">4956</span>
<span id="4957">4957</span>
<span id="4958">4958</span>
<span id="4959">4959</span>
<span id="4960">4960</span>
<span id="4961">4961</span>
<span id="4962">4962</span>
<span id="4963">4963</span>
<span id="4964">4964</span>
<span id="4965">4965</span>
<span id="4966">4966</span>
<span id="4967">4967</span>
<span id="4968">4968</span>
<span id="4969">4969</span>
<span id="4970">4970</span>
<span id="4971">4971</span>
<span id="4972">4972</span>
<span id="4973">4973</span>
<span id="4974">4974</span>
<span id="4975">4975</span>
<span id="4976">4976</span>
<span id="4977">4977</span>
<span id="4978">4978</span>
<span id="4979">4979</span>
<span id="4980">4980</span>
<span id="4981">4981</span>
<span id="4982">4982</span>
<span id="4983">4983</span>
<span id="4984">4984</span>
<span id="4985">4985</span>
<span id="4986">4986</span>
<span id="4987">4987</span>
<span id="4988">4988</span>
<span id="4989">4989</span>
<span id="4990">4990</span>
<span id="4991">4991</span>
<span id="4992">4992</span>
<span id="4993">4993</span>
<span id="4994">4994</span>
<span id="4995">4995</span>
<span id="4996">4996</span>
<span id="4997">4997</span>
<span id="4998">4998</span>
<span id="4999">4999</span>
<span id="5000">5000</span>
<span id="5001">5001</span>
<span id="5002">5002</span>
<span id="5003">5003</span>
<span id="5004">5004</span>
<span id="5005">5005</span>
<span id="5006">5006</span>
<span id="5007">5007</span>
<span id="5008">5008</span>
<span id="5009">5009</span>
<span id="5010">5010</span>
<span id="5011">5011</span>
<span id="5012">5012</span>
<span id="5013">5013</span>
<span id="5014">5014</span>
<span id="5015">5015</span>
<span id="5016">5016</span>
<span id="5017">5017</span>
<span id="5018">5018</span>
<span id="5019">5019</span>
<span id="5020">5020</span>
<span id="5021">5021</span>
<span id="5022">5022</span>
<span id="5023">5023</span>
<span id="5024">5024</span>
<span id="5025">5025</span>
<span id="5026">5026</span>
<span id="5027">5027</span>
<span id="5028">5028</span>
<span id="5029">5029</span>
<span id="5030">5030</span>
<span id="5031">5031</span>
<span id="5032">5032</span>
<span id="5033">5033</span>
<span id="5034">5034</span>
<span id="5035">5035</span>
<span id="5036">5036</span>
<span id="5037">5037</span>
<span id="5038">5038</span>
<span id="5039">5039</span>
<span id="5040">5040</span>
<span id="5041">5041</span>
<span id="5042">5042</span>
<span id="5043">5043</span>
<span id="5044">5044</span>
<span id="5045">5045</span>
<span id="5046">5046</span>
<span id="5047">5047</span>
<span id="5048">5048</span>
<span id="5049">5049</span>
<span id="5050">5050</span>
<span id="5051">5051</span>
<span id="5052">5052</span>
<span id="5053">5053</span>
<span id="5054">5054</span>
<span id="5055">5055</span>
<span id="5056">5056</span>
<span id="5057">5057</span>
<span id="5058">5058</span>
<span id="5059">5059</span>
<span id="5060">5060</span>
<span id="5061">5061</span>
<span id="5062">5062</span>
<span id="5063">5063</span>
<span id="5064">5064</span>
<span id="5065">5065</span>
<span id="5066">5066</span>
<span id="5067">5067</span>
<span id="5068">5068</span>
<span id="5069">5069</span>
<span id="5070">5070</span>
<span id="5071">5071</span>
<span id="5072">5072</span>
<span id="5073">5073</span>
<span id="5074">5074</span>
<span id="5075">5075</span>
<span id="5076">5076</span>
<span id="5077">5077</span>
<span id="5078">5078</span>
<span id="5079">5079</span>
<span id="5080">5080</span>
<span id="5081">5081</span>
<span id="5082">5082</span>
<span id="5083">5083</span>
<span id="5084">5084</span>
<span id="5085">5085</span>
<span id="5086">5086</span>
<span id="5087">5087</span>
<span id="5088">5088</span>
<span id="5089">5089</span>
<span id="5090">5090</span>
<span id="5091">5091</span>
<span id="5092">5092</span>
<span id="5093">5093</span>
<span id="5094">5094</span>
<span id="5095">5095</span>
<span id="5096">5096</span>
<span id="5097">5097</span>
<span id="5098">5098</span>
<span id="5099">5099</span>
<span id="5100">5100</span>
<span id="5101">5101</span>
<span id="5102">5102</span>
<span id="5103">5103</span>
<span id="5104">5104</span>
<span id="5105">5105</span>
<span id="5106">5106</span>
<span id="5107">5107</span>
<span id="5108">5108</span>
<span id="5109">5109</span>
<span id="5110">5110</span>
<span id="5111">5111</span>
<span id="5112">5112</span>
<span id="5113">5113</span>
<span id="5114">5114</span>
<span id="5115">5115</span>
<span id="5116">5116</span>
<span id="5117">5117</span>
<span id="5118">5118</span>
<span id="5119">5119</span>
<span id="5120">5120</span>
<span id="5121">5121</span>
<span id="5122">5122</span>
<span id="5123">5123</span>
<span id="5124">5124</span>
<span id="5125">5125</span>
<span id="5126">5126</span>
<span id="5127">5127</span>
<span id="5128">5128</span>
<span id="5129">5129</span>
<span id="5130">5130</span>
<span id="5131">5131</span>
<span id="5132">5132</span>
<span id="5133">5133</span>
<span id="5134">5134</span>
<span id="5135">5135</span>
<span id="5136">5136</span>
<span id="5137">5137</span>
<span id="5138">5138</span>
<span id="5139">5139</span>
<span id="5140">5140</span>
<span id="5141">5141</span>
<span id="5142">5142</span>
<span id="5143">5143</span>
<span id="5144">5144</span>
<span id="5145">5145</span>
<span id="5146">5146</span>
<span id="5147">5147</span>
<span id="5148">5148</span>
<span id="5149">5149</span>
<span id="5150">5150</span>
<span id="5151">5151</span>
<span id="5152">5152</span>
<span id="5153">5153</span>
<span id="5154">5154</span>
<span id="5155">5155</span>
<span id="5156">5156</span>
<span id="5157">5157</span>
<span id="5158">5158</span>
<span id="5159">5159</span>
<span id="5160">5160</span>
<span id="5161">5161</span>
<span id="5162">5162</span>
<span id="5163">5163</span>
<span id="5164">5164</span>
<span id="5165">5165</span>
<span id="5166">5166</span>
<span id="5167">5167</span>
<span id="5168">5168</span>
<span id="5169">5169</span>
<span id="5170">5170</span>
<span id="5171">5171</span>
<span id="5172">5172</span>
<span id="5173">5173</span>
<span id="5174">5174</span>
<span id="5175">5175</span>
<span id="5176">5176</span>
<span id="5177">5177</span>
<span id="5178">5178</span>
<span id="5179">5179</span>
<span id="5180">5180</span>
<span id="5181">5181</span>
<span id="5182">5182</span>
<span id="5183">5183</span>
<span id="5184">5184</span>
<span id="5185">5185</span>
<span id="5186">5186</span>
<span id="5187">5187</span>
<span id="5188">5188</span>
<span id="5189">5189</span>
<span id="5190">5190</span>
<span id="5191">5191</span>
<span id="5192">5192</span>
<span id="5193">5193</span>
<span id="5194">5194</span>
<span id="5195">5195</span>
<span id="5196">5196</span>
<span id="5197">5197</span>
<span id="5198">5198</span>
<span id="5199">5199</span>
<span id="5200">5200</span>
<span id="5201">5201</span>
<span id="5202">5202</span>
<span id="5203">5203</span>
<span id="5204">5204</span>
<span id="5205">5205</span>
<span id="5206">5206</span>
<span id="5207">5207</span>
<span id="5208">5208</span>
<span id="5209">5209</span>
<span id="5210">5210</span>
<span id="5211">5211</span>
<span id="5212">5212</span>
<span id="5213">5213</span>
<span id="5214">5214</span>
<span id="5215">5215</span>
<span id="5216">5216</span>
<span id="5217">5217</span>
<span id="5218">5218</span>
<span id="5219">5219</span>
<span id="5220">5220</span>
<span id="5221">5221</span>
<span id="5222">5222</span>
<span id="5223">5223</span>
<span id="5224">5224</span>
<span id="5225">5225</span>
<span id="5226">5226</span>
<span id="5227">5227</span>
<span id="5228">5228</span>
<span id="5229">5229</span>
<span id="5230">5230</span>
<span id="5231">5231</span>
<span id="5232">5232</span>
<span id="5233">5233</span>
<span id="5234">5234</span>
<span id="5235">5235</span>
<span id="5236">5236</span>
<span id="5237">5237</span>
<span id="5238">5238</span>
<span id="5239">5239</span>
<span id="5240">5240</span>
<span id="5241">5241</span>
<span id="5242">5242</span>
<span id="5243">5243</span>
<span id="5244">5244</span>
<span id="5245">5245</span>
<span id="5246">5246</span>
<span id="5247">5247</span>
<span id="5248">5248</span>
<span id="5249">5249</span>
<span id="5250">5250</span>
<span id="5251">5251</span>
<span id="5252">5252</span>
<span id="5253">5253</span>
<span id="5254">5254</span>
<span id="5255">5255</span>
<span id="5256">5256</span>
<span id="5257">5257</span>
<span id="5258">5258</span>
<span id="5259">5259</span>
<span id="5260">5260</span>
<span id="5261">5261</span>
<span id="5262">5262</span>
<span id="5263">5263</span>
<span id="5264">5264</span>
<span id="5265">5265</span>
<span id="5266">5266</span>
<span id="5267">5267</span>
<span id="5268">5268</span>
<span id="5269">5269</span>
<span id="5270">5270</span>
<span id="5271">5271</span>
<span id="5272">5272</span>
<span id="5273">5273</span>
<span id="5274">5274</span>
<span id="5275">5275</span>
<span id="5276">5276</span>
<span id="5277">5277</span>
<span id="5278">5278</span>
<span id="5279">5279</span>
<span id="5280">5280</span>
<span id="5281">5281</span>
<span id="5282">5282</span>
<span id="5283">5283</span>
<span id="5284">5284</span>
<span id="5285">5285</span>
<span id="5286">5286</span>
<span id="5287">5287</span>
<span id="5288">5288</span>
<span id="5289">5289</span>
<span id="5290">5290</span>
<span id="5291">5291</span>
<span id="5292">5292</span>
<span id="5293">5293</span>
<span id="5294">5294</span>
<span id="5295">5295</span>
<span id="5296">5296</span>
<span id="5297">5297</span>
<span id="5298">5298</span>
<span id="5299">5299</span>
<span id="5300">5300</span>
<span id="5301">5301</span>
<span id="5302">5302</span>
<span id="5303">5303</span>
<span id="5304">5304</span>
<span id="5305">5305</span>
<span id="5306">5306</span>
<span id="5307">5307</span>
<span id="5308">5308</span>
<span id="5309">5309</span>
<span id="5310">5310</span>
<span id="5311">5311</span>
<span id="5312">5312</span>
<span id="5313">5313</span>
<span id="5314">5314</span>
<span id="5315">5315</span>
<span id="5316">5316</span>
<span id="5317">5317</span>
<span id="5318">5318</span>
<span id="5319">5319</span>
<span id="5320">5320</span>
<span id="5321">5321</span>
<span id="5322">5322</span>
<span id="5323">5323</span>
<span id="5324">5324</span>
<span id="5325">5325</span>
<span id="5326">5326</span>
<span id="5327">5327</span>
<span id="5328">5328</span>
<span id="5329">5329</span>
<span id="5330">5330</span>
<span id="5331">5331</span>
<span id="5332">5332</span>
<span id="5333">5333</span>
<span id="5334">5334</span>
<span id="5335">5335</span>
<span id="5336">5336</span>
<span id="5337">5337</span>
<span id="5338">5338</span>
<span id="5339">5339</span>
<span id="5340">5340</span>
<span id="5341">5341</span>
<span id="5342">5342</span>
<span id="5343">5343</span>
<span id="5344">5344</span>
<span id="5345">5345</span>
<span id="5346">5346</span>
<span id="5347">5347</span>
<span id="5348">5348</span>
<span id="5349">5349</span>
<span id="5350">5350</span>
<span id="5351">5351</span>
<span id="5352">5352</span>
<span id="5353">5353</span>
<span id="5354">5354</span>
<span id="5355">5355</span>
<span id="5356">5356</span>
<span id="5357">5357</span>
<span id="5358">5358</span>
<span id="5359">5359</span>
<span id="5360">5360</span>
<span id="5361">5361</span>
<span id="5362">5362</span>
<span id="5363">5363</span>
<span id="5364">5364</span>
<span id="5365">5365</span>
<span id="5366">5366</span>
<span id="5367">5367</span>
<span id="5368">5368</span>
<span id="5369">5369</span>
<span id="5370">5370</span>
<span id="5371">5371</span>
<span id="5372">5372</span>
<span id="5373">5373</span>
<span id="5374">5374</span>
<span id="5375">5375</span>
<span id="5376">5376</span>
<span id="5377">5377</span>
<span id="5378">5378</span>
<span id="5379">5379</span>
<span id="5380">5380</span>
<span id="5381">5381</span>
<span id="5382">5382</span>
<span id="5383">5383</span>
<span id="5384">5384</span>
<span id="5385">5385</span>
<span id="5386">5386</span>
<span id="5387">5387</span>
<span id="5388">5388</span>
<span id="5389">5389</span>
<span id="5390">5390</span>
<span id="5391">5391</span>
<span id="5392">5392</span>
<span id="5393">5393</span>
<span id="5394">5394</span>
<span id="5395">5395</span>
<span id="5396">5396</span>
<span id="5397">5397</span>
<span id="5398">5398</span>
<span id="5399">5399</span>
<span id="5400">5400</span>
<span id="5401">5401</span>
<span id="5402">5402</span>
<span id="5403">5403</span>
<span id="5404">5404</span>
<span id="5405">5405</span>
<span id="5406">5406</span>
<span id="5407">5407</span>
<span id="5408">5408</span>
<span id="5409">5409</span>
<span id="5410">5410</span>
<span id="5411">5411</span>
<span id="5412">5412</span>
<span id="5413">5413</span>
<span id="5414">5414</span>
<span id="5415">5415</span>
<span id="5416">5416</span>
<span id="5417">5417</span>
<span id="5418">5418</span>
<span id="5419">5419</span>
<span id="5420">5420</span>
<span id="5421">5421</span>
<span id="5422">5422</span>
<span id="5423">5423</span>
<span id="5424">5424</span>
<span id="5425">5425</span>
<span id="5426">5426</span>
<span id="5427">5427</span>
<span id="5428">5428</span>
<span id="5429">5429</span>
<span id="5430">5430</span>
<span id="5431">5431</span>
<span id="5432">5432</span>
<span id="5433">5433</span>
<span id="5434">5434</span>
<span id="5435">5435</span>
<span id="5436">5436</span>
<span id="5437">5437</span>
<span id="5438">5438</span>
<span id="5439">5439</span>
<span id="5440">5440</span>
<span id="5441">5441</span>
<span id="5442">5442</span>
<span id="5443">5443</span>
<span id="5444">5444</span>
<span id="5445">5445</span>
<span id="5446">5446</span>
<span id="5447">5447</span>
<span id="5448">5448</span>
<span id="5449">5449</span>
<span id="5450">5450</span>
<span id="5451">5451</span>
<span id="5452">5452</span>
<span id="5453">5453</span>
<span id="5454">5454</span>
<span id="5455">5455</span>
<span id="5456">5456</span>
<span id="5457">5457</span>
<span id="5458">5458</span>
<span id="5459">5459</span>
<span id="5460">5460</span>
<span id="5461">5461</span>
<span id="5462">5462</span>
<span id="5463">5463</span>
<span id="5464">5464</span>
<span id="5465">5465</span>
<span id="5466">5466</span>
<span id="5467">5467</span>
<span id="5468">5468</span>
<span id="5469">5469</span>
<span id="5470">5470</span>
<span id="5471">5471</span>
<span id="5472">5472</span>
<span id="5473">5473</span>
<span id="5474">5474</span>
<span id="5475">5475</span>
<span id="5476">5476</span>
<span id="5477">5477</span>
<span id="5478">5478</span>
<span id="5479">5479</span>
<span id="5480">5480</span>
<span id="5481">5481</span>
<span id="5482">5482</span>
<span id="5483">5483</span>
<span id="5484">5484</span>
<span id="5485">5485</span>
<span id="5486">5486</span>
<span id="5487">5487</span>
<span id="5488">5488</span>
<span id="5489">5489</span>
<span id="5490">5490</span>
<span id="5491">5491</span>
<span id="5492">5492</span>
<span id="5493">5493</span>
<span id="5494">5494</span>
<span id="5495">5495</span>
<span id="5496">5496</span>
<span id="5497">5497</span>
<span id="5498">5498</span>
<span id="5499">5499</span>
<span id="5500">5500</span>
<span id="5501">5501</span>
<span id="5502">5502</span>
<span id="5503">5503</span>
<span id="5504">5504</span>
<span id="5505">5505</span>
<span id="5506">5506</span>
<span id="5507">5507</span>
<span id="5508">5508</span>
<span id="5509">5509</span>
<span id="5510">5510</span>
<span id="5511">5511</span>
<span id="5512">5512</span>
<span id="5513">5513</span>
<span id="5514">5514</span>
<span id="5515">5515</span>
<span id="5516">5516</span>
<span id="5517">5517</span>
<span id="5518">5518</span>
<span id="5519">5519</span>
<span id="5520">5520</span>
<span id="5521">5521</span>
<span id="5522">5522</span>
<span id="5523">5523</span>
<span id="5524">5524</span>
<span id="5525">5525</span>
<span id="5526">5526</span>
<span id="5527">5527</span>
<span id="5528">5528</span>
<span id="5529">5529</span>
<span id="5530">5530</span>
<span id="5531">5531</span>
<span id="5532">5532</span>
<span id="5533">5533</span>
<span id="5534">5534</span>
<span id="5535">5535</span>
<span id="5536">5536</span>
<span id="5537">5537</span>
<span id="5538">5538</span>
<span id="5539">5539</span>
<span id="5540">5540</span>
<span id="5541">5541</span>
<span id="5542">5542</span>
<span id="5543">5543</span>
<span id="5544">5544</span>
<span id="5545">5545</span>
<span id="5546">5546</span>
<span id="5547">5547</span>
<span id="5548">5548</span>
<span id="5549">5549</span>
<span id="5550">5550</span>
<span id="5551">5551</span>
<span id="5552">5552</span>
<span id="5553">5553</span>
<span id="5554">5554</span>
<span id="5555">5555</span>
<span id="5556">5556</span>
<span id="5557">5557</span>
<span id="5558">5558</span>
<span id="5559">5559</span>
<span id="5560">5560</span>
<span id="5561">5561</span>
<span id="5562">5562</span>
<span id="5563">5563</span>
<span id="5564">5564</span>
<span id="5565">5565</span>
<span id="5566">5566</span>
<span id="5567">5567</span>
<span id="5568">5568</span>
<span id="5569">5569</span>
<span id="5570">5570</span>
<span id="5571">5571</span>
<span id="5572">5572</span>
<span id="5573">5573</span>
<span id="5574">5574</span>
<span id="5575">5575</span>
<span id="5576">5576</span>
<span id="5577">5577</span>
<span id="5578">5578</span>
<span id="5579">5579</span>
<span id="5580">5580</span>
<span id="5581">5581</span>
<span id="5582">5582</span>
<span id="5583">5583</span>
<span id="5584">5584</span>
<span id="5585">5585</span>
<span id="5586">5586</span>
<span id="5587">5587</span>
<span id="5588">5588</span>
<span id="5589">5589</span>
<span id="5590">5590</span>
<span id="5591">5591</span>
<span id="5592">5592</span>
<span id="5593">5593</span>
<span id="5594">5594</span>
<span id="5595">5595</span>
<span id="5596">5596</span>
<span id="5597">5597</span>
<span id="5598">5598</span>
<span id="5599">5599</span>
<span id="5600">5600</span>
<span id="5601">5601</span>
<span id="5602">5602</span>
<span id="5603">5603</span>
<span id="5604">5604</span>
<span id="5605">5605</span>
<span id="5606">5606</span>
<span id="5607">5607</span>
<span id="5608">5608</span>
<span id="5609">5609</span>
<span id="5610">5610</span>
<span id="5611">5611</span>
<span id="5612">5612</span>
<span id="5613">5613</span>
<span id="5614">5614</span>
<span id="5615">5615</span>
<span id="5616">5616</span>
<span id="5617">5617</span>
<span id="5618">5618</span>
<span id="5619">5619</span>
<span id="5620">5620</span>
<span id="5621">5621</span>
<span id="5622">5622</span>
<span id="5623">5623</span>
<span id="5624">5624</span>
<span id="5625">5625</span>
<span id="5626">5626</span>
<span id="5627">5627</span>
<span id="5628">5628</span>
<span id="5629">5629</span>
<span id="5630">5630</span>
<span id="5631">5631</span>
<span id="5632">5632</span>
<span id="5633">5633</span>
<span id="5634">5634</span>
<span id="5635">5635</span>
<span id="5636">5636</span>
<span id="5637">5637</span>
<span id="5638">5638</span>
<span id="5639">5639</span>
<span id="5640">5640</span>
<span id="5641">5641</span>
<span id="5642">5642</span>
<span id="5643">5643</span>
<span id="5644">5644</span>
<span id="5645">5645</span>
<span id="5646">5646</span>
<span id="5647">5647</span>
<span id="5648">5648</span>
<span id="5649">5649</span>
<span id="5650">5650</span>
<span id="5651">5651</span>
<span id="5652">5652</span>
<span id="5653">5653</span>
<span id="5654">5654</span>
<span id="5655">5655</span>
<span id="5656">5656</span>
<span id="5657">5657</span>
<span id="5658">5658</span>
<span id="5659">5659</span>
<span id="5660">5660</span>
<span id="5661">5661</span>
<span id="5662">5662</span>
<span id="5663">5663</span>
<span id="5664">5664</span>
<span id="5665">5665</span>
<span id="5666">5666</span>
<span id="5667">5667</span>
<span id="5668">5668</span>
<span id="5669">5669</span>
<span id="5670">5670</span>
<span id="5671">5671</span>
<span id="5672">5672</span>
<span id="5673">5673</span>
<span id="5674">5674</span>
<span id="5675">5675</span>
<span id="5676">5676</span>
<span id="5677">5677</span>
<span id="5678">5678</span>
<span id="5679">5679</span>
<span id="5680">5680</span>
<span id="5681">5681</span>
<span id="5682">5682</span>
<span id="5683">5683</span>
<span id="5684">5684</span>
<span id="5685">5685</span>
<span id="5686">5686</span>
<span id="5687">5687</span>
<span id="5688">5688</span>
<span id="5689">5689</span>
<span id="5690">5690</span>
<span id="5691">5691</span>
<span id="5692">5692</span>
<span id="5693">5693</span>
<span id="5694">5694</span>
<span id="5695">5695</span>
<span id="5696">5696</span>
<span id="5697">5697</span>
<span id="5698">5698</span>
<span id="5699">5699</span>
<span id="5700">5700</span>
<span id="5701">5701</span>
<span id="5702">5702</span>
<span id="5703">5703</span>
<span id="5704">5704</span>
<span id="5705">5705</span>
<span id="5706">5706</span>
<span id="5707">5707</span>
<span id="5708">5708</span>
<span id="5709">5709</span>
<span id="5710">5710</span>
<span id="5711">5711</span>
<span id="5712">5712</span>
<span id="5713">5713</span>
<span id="5714">5714</span>
<span id="5715">5715</span>
<span id="5716">5716</span>
<span id="5717">5717</span>
<span id="5718">5718</span>
<span id="5719">5719</span>
<span id="5720">5720</span>
<span id="5721">5721</span>
<span id="5722">5722</span>
<span id="5723">5723</span>
<span id="5724">5724</span>
<span id="5725">5725</span>
<span id="5726">5726</span>
<span id="5727">5727</span>
<span id="5728">5728</span>
<span id="5729">5729</span>
<span id="5730">5730</span>
<span id="5731">5731</span>
<span id="5732">5732</span>
<span id="5733">5733</span>
<span id="5734">5734</span>
<span id="5735">5735</span>
<span id="5736">5736</span>
<span id="5737">5737</span>
<span id="5738">5738</span>
<span id="5739">5739</span>
<span id="5740">5740</span>
<span id="5741">5741</span>
<span id="5742">5742</span>
<span id="5743">5743</span>
<span id="5744">5744</span>
<span id="5745">5745</span>
<span id="5746">5746</span>
<span id="5747">5747</span>
<span id="5748">5748</span>
<span id="5749">5749</span>
<span id="5750">5750</span>
<span id="5751">5751</span>
<span id="5752">5752</span>
<span id="5753">5753</span>
<span id="5754">5754</span>
<span id="5755">5755</span>
<span id="5756">5756</span>
<span id="5757">5757</span>
<span id="5758">5758</span>
<span id="5759">5759</span>
<span id="5760">5760</span>
<span id="5761">5761</span>
<span id="5762">5762</span>
<span id="5763">5763</span>
<span id="5764">5764</span>
<span id="5765">5765</span>
<span id="5766">5766</span>
<span id="5767">5767</span>
<span id="5768">5768</span>
<span id="5769">5769</span>
<span id="5770">5770</span>
<span id="5771">5771</span>
<span id="5772">5772</span>
<span id="5773">5773</span>
<span id="5774">5774</span>
<span id="5775">5775</span>
<span id="5776">5776</span>
<span id="5777">5777</span>
<span id="5778">5778</span>
<span id="5779">5779</span>
<span id="5780">5780</span>
<span id="5781">5781</span>
<span id="5782">5782</span>
<span id="5783">5783</span>
<span id="5784">5784</span>
<span id="5785">5785</span>
<span id="5786">5786</span>
<span id="5787">5787</span>
<span id="5788">5788</span>
<span id="5789">5789</span>
<span id="5790">5790</span>
<span id="5791">5791</span>
<span id="5792">5792</span>
<span id="5793">5793</span>
<span id="5794">5794</span>
<span id="5795">5795</span>
<span id="5796">5796</span>
<span id="5797">5797</span>
<span id="5798">5798</span>
<span id="5799">5799</span>
<span id="5800">5800</span>
<span id="5801">5801</span>
<span id="5802">5802</span>
<span id="5803">5803</span>
<span id="5804">5804</span>
<span id="5805">5805</span>
<span id="5806">5806</span>
<span id="5807">5807</span>
<span id="5808">5808</span>
<span id="5809">5809</span>
<span id="5810">5810</span>
<span id="5811">5811</span>
<span id="5812">5812</span>
<span id="5813">5813</span>
<span id="5814">5814</span>
<span id="5815">5815</span>
<span id="5816">5816</span>
<span id="5817">5817</span>
<span id="5818">5818</span>
<span id="5819">5819</span>
<span id="5820">5820</span>
<span id="5821">5821</span>
<span id="5822">5822</span>
<span id="5823">5823</span>
<span id="5824">5824</span>
<span id="5825">5825</span>
<span id="5826">5826</span>
<span id="5827">5827</span>
<span id="5828">5828</span>
<span id="5829">5829</span>
<span id="5830">5830</span>
<span id="5831">5831</span>
<span id="5832">5832</span>
<span id="5833">5833</span>
<span id="5834">5834</span>
<span id="5835">5835</span>
<span id="5836">5836</span>
<span id="5837">5837</span>
<span id="5838">5838</span>
<span id="5839">5839</span>
<span id="5840">5840</span>
<span id="5841">5841</span>
<span id="5842">5842</span>
<span id="5843">5843</span>
<span id="5844">5844</span>
<span id="5845">5845</span>
<span id="5846">5846</span>
<span id="5847">5847</span>
<span id="5848">5848</span>
<span id="5849">5849</span>
<span id="5850">5850</span>
<span id="5851">5851</span>
<span id="5852">5852</span>
<span id="5853">5853</span>
<span id="5854">5854</span>
<span id="5855">5855</span>
<span id="5856">5856</span>
<span id="5857">5857</span>
<span id="5858">5858</span>
<span id="5859">5859</span>
<span id="5860">5860</span>
<span id="5861">5861</span>
<span id="5862">5862</span>
<span id="5863">5863</span>
<span id="5864">5864</span>
<span id="5865">5865</span>
<span id="5866">5866</span>
<span id="5867">5867</span>
<span id="5868">5868</span>
<span id="5869">5869</span>
<span id="5870">5870</span>
<span id="5871">5871</span>
<span id="5872">5872</span>
<span id="5873">5873</span>
<span id="5874">5874</span>
<span id="5875">5875</span>
<span id="5876">5876</span>
<span id="5877">5877</span>
<span id="5878">5878</span>
<span id="5879">5879</span>
<span id="5880">5880</span>
<span id="5881">5881</span>
<span id="5882">5882</span>
<span id="5883">5883</span>
<span id="5884">5884</span>
<span id="5885">5885</span>
<span id="5886">5886</span>
<span id="5887">5887</span>
<span id="5888">5888</span>
<span id="5889">5889</span>
<span id="5890">5890</span>
<span id="5891">5891</span>
<span id="5892">5892</span>
<span id="5893">5893</span>
<span id="5894">5894</span>
<span id="5895">5895</span>
<span id="5896">5896</span>
<span id="5897">5897</span>
<span id="5898">5898</span>
<span id="5899">5899</span>
<span id="5900">5900</span>
<span id="5901">5901</span>
<span id="5902">5902</span>
<span id="5903">5903</span>
<span id="5904">5904</span>
<span id="5905">5905</span>
<span id="5906">5906</span>
<span id="5907">5907</span>
<span id="5908">5908</span>
<span id="5909">5909</span>
<span id="5910">5910</span>
<span id="5911">5911</span>
<span id="5912">5912</span>
<span id="5913">5913</span>
<span id="5914">5914</span>
<span id="5915">5915</span>
<span id="5916">5916</span>
<span id="5917">5917</span>
<span id="5918">5918</span>
<span id="5919">5919</span>
<span id="5920">5920</span>
<span id="5921">5921</span>
<span id="5922">5922</span>
<span id="5923">5923</span>
<span id="5924">5924</span>
<span id="5925">5925</span>
<span id="5926">5926</span>
<span id="5927">5927</span>
<span id="5928">5928</span>
<span id="5929">5929</span>
<span id="5930">5930</span>
<span id="5931">5931</span>
<span id="5932">5932</span>
<span id="5933">5933</span>
<span id="5934">5934</span>
<span id="5935">5935</span>
<span id="5936">5936</span>
<span id="5937">5937</span>
<span id="5938">5938</span>
<span id="5939">5939</span>
<span id="5940">5940</span>
<span id="5941">5941</span>
<span id="5942">5942</span>
<span id="5943">5943</span>
<span id="5944">5944</span>
<span id="5945">5945</span>
<span id="5946">5946</span>
<span id="5947">5947</span>
<span id="5948">5948</span>
<span id="5949">5949</span>
<span id="5950">5950</span>
<span id="5951">5951</span>
<span id="5952">5952</span>
<span id="5953">5953</span>
<span id="5954">5954</span>
<span id="5955">5955</span>
<span id="5956">5956</span>
<span id="5957">5957</span>
<span id="5958">5958</span>
<span id="5959">5959</span>
<span id="5960">5960</span>
<span id="5961">5961</span>
<span id="5962">5962</span>
<span id="5963">5963</span>
<span id="5964">5964</span>
<span id="5965">5965</span>
<span id="5966">5966</span>
<span id="5967">5967</span>
<span id="5968">5968</span>
<span id="5969">5969</span>
<span id="5970">5970</span>
<span id="5971">5971</span>
<span id="5972">5972</span>
<span id="5973">5973</span>
<span id="5974">5974</span>
<span id="5975">5975</span>
<span id="5976">5976</span>
<span id="5977">5977</span>
<span id="5978">5978</span>
<span id="5979">5979</span>
<span id="5980">5980</span>
<span id="5981">5981</span>
<span id="5982">5982</span>
<span id="5983">5983</span>
<span id="5984">5984</span>
<span id="5985">5985</span>
<span id="5986">5986</span>
<span id="5987">5987</span>
<span id="5988">5988</span>
<span id="5989">5989</span>
<span id="5990">5990</span>
<span id="5991">5991</span>
<span id="5992">5992</span>
<span id="5993">5993</span>
<span id="5994">5994</span>
<span id="5995">5995</span>
<span id="5996">5996</span>
<span id="5997">5997</span>
<span id="5998">5998</span>
<span id="5999">5999</span>
<span id="6000">6000</span>
<span id="6001">6001</span>
<span id="6002">6002</span>
<span id="6003">6003</span>
<span id="6004">6004</span>
<span id="6005">6005</span>
<span id="6006">6006</span>
<span id="6007">6007</span>
<span id="6008">6008</span>
<span id="6009">6009</span>
<span id="6010">6010</span>
<span id="6011">6011</span>
<span id="6012">6012</span>
<span id="6013">6013</span>
<span id="6014">6014</span>
<span id="6015">6015</span>
<span id="6016">6016</span>
<span id="6017">6017</span>
<span id="6018">6018</span>
<span id="6019">6019</span>
<span id="6020">6020</span>
<span id="6021">6021</span>
<span id="6022">6022</span>
<span id="6023">6023</span>
<span id="6024">6024</span>
<span id="6025">6025</span>
<span id="6026">6026</span>
<span id="6027">6027</span>
<span id="6028">6028</span>
<span id="6029">6029</span>
<span id="6030">6030</span>
<span id="6031">6031</span>
<span id="6032">6032</span>
<span id="6033">6033</span>
<span id="6034">6034</span>
<span id="6035">6035</span>
<span id="6036">6036</span>
<span id="6037">6037</span>
<span id="6038">6038</span>
<span id="6039">6039</span>
<span id="6040">6040</span>
<span id="6041">6041</span>
<span id="6042">6042</span>
<span id="6043">6043</span>
<span id="6044">6044</span>
<span id="6045">6045</span>
<span id="6046">6046</span>
<span id="6047">6047</span>
<span id="6048">6048</span>
<span id="6049">6049</span>
<span id="6050">6050</span>
<span id="6051">6051</span>
<span id="6052">6052</span>
<span id="6053">6053</span>
<span id="6054">6054</span>
<span id="6055">6055</span>
<span id="6056">6056</span>
<span id="6057">6057</span>
<span id="6058">6058</span>
<span id="6059">6059</span>
<span id="6060">6060</span>
<span id="6061">6061</span>
<span id="6062">6062</span>
<span id="6063">6063</span>
<span id="6064">6064</span>
<span id="6065">6065</span>
<span id="6066">6066</span>
<span id="6067">6067</span>
<span id="6068">6068</span>
<span id="6069">6069</span>
<span id="6070">6070</span>
<span id="6071">6071</span>
<span id="6072">6072</span>
<span id="6073">6073</span>
<span id="6074">6074</span>
<span id="6075">6075</span>
<span id="6076">6076</span>
<span id="6077">6077</span>
<span id="6078">6078</span>
<span id="6079">6079</span>
<span id="6080">6080</span>
<span id="6081">6081</span>
<span id="6082">6082</span>
<span id="6083">6083</span>
<span id="6084">6084</span>
<span id="6085">6085</span>
<span id="6086">6086</span>
<span id="6087">6087</span>
<span id="6088">6088</span>
<span id="6089">6089</span>
<span id="6090">6090</span>
<span id="6091">6091</span>
<span id="6092">6092</span>
<span id="6093">6093</span>
<span id="6094">6094</span>
<span id="6095">6095</span>
<span id="6096">6096</span>
<span id="6097">6097</span>
<span id="6098">6098</span>
<span id="6099">6099</span>
<span id="6100">6100</span>
<span id="6101">6101</span>
<span id="6102">6102</span>
<span id="6103">6103</span>
<span id="6104">6104</span>
<span id="6105">6105</span>
<span id="6106">6106</span>
<span id="6107">6107</span>
<span id="6108">6108</span>
<span id="6109">6109</span>
<span id="6110">6110</span>
<span id="6111">6111</span>
<span id="6112">6112</span>
<span id="6113">6113</span>
<span id="6114">6114</span>
<span id="6115">6115</span>
<span id="6116">6116</span>
<span id="6117">6117</span>
<span id="6118">6118</span>
<span id="6119">6119</span>
<span id="6120">6120</span>
<span id="6121">6121</span>
<span id="6122">6122</span>
<span id="6123">6123</span>
<span id="6124">6124</span>
<span id="6125">6125</span>
<span id="6126">6126</span>
<span id="6127">6127</span>
<span id="6128">6128</span>
<span id="6129">6129</span>
<span id="6130">6130</span>
<span id="6131">6131</span>
<span id="6132">6132</span>
<span id="6133">6133</span>
<span id="6134">6134</span>
<span id="6135">6135</span>
<span id="6136">6136</span>
<span id="6137">6137</span>
<span id="6138">6138</span>
<span id="6139">6139</span>
<span id="6140">6140</span>
<span id="6141">6141</span>
<span id="6142">6142</span>
<span id="6143">6143</span>
<span id="6144">6144</span>
<span id="6145">6145</span>
<span id="6146">6146</span>
<span id="6147">6147</span>
<span id="6148">6148</span>
<span id="6149">6149</span>
<span id="6150">6150</span>
<span id="6151">6151</span>
<span id="6152">6152</span>
<span id="6153">6153</span>
<span id="6154">6154</span>
<span id="6155">6155</span>
<span id="6156">6156</span>
<span id="6157">6157</span>
<span id="6158">6158</span>
<span id="6159">6159</span>
<span id="6160">6160</span>
<span id="6161">6161</span>
<span id="6162">6162</span>
<span id="6163">6163</span>
<span id="6164">6164</span>
<span id="6165">6165</span>
<span id="6166">6166</span>
<span id="6167">6167</span>
<span id="6168">6168</span>
<span id="6169">6169</span>
<span id="6170">6170</span>
<span id="6171">6171</span>
<span id="6172">6172</span>
<span id="6173">6173</span>
<span id="6174">6174</span>
<span id="6175">6175</span>
<span id="6176">6176</span>
<span id="6177">6177</span>
<span id="6178">6178</span>
<span id="6179">6179</span>
<span id="6180">6180</span>
<span id="6181">6181</span>
<span id="6182">6182</span>
<span id="6183">6183</span>
<span id="6184">6184</span>
<span id="6185">6185</span>
<span id="6186">6186</span>
<span id="6187">6187</span>
<span id="6188">6188</span>
<span id="6189">6189</span>
<span id="6190">6190</span>
<span id="6191">6191</span>
<span id="6192">6192</span>
<span id="6193">6193</span>
<span id="6194">6194</span>
<span id="6195">6195</span>
<span id="6196">6196</span>
<span id="6197">6197</span>
<span id="6198">6198</span>
<span id="6199">6199</span>
<span id="6200">6200</span>
<span id="6201">6201</span>
<span id="6202">6202</span>
<span id="6203">6203</span>
<span id="6204">6204</span>
<span id="6205">6205</span>
<span id="6206">6206</span>
<span id="6207">6207</span>
<span id="6208">6208</span>
<span id="6209">6209</span>
<span id="6210">6210</span>
<span id="6211">6211</span>
<span id="6212">6212</span>
<span id="6213">6213</span>
<span id="6214">6214</span>
<span id="6215">6215</span>
<span id="6216">6216</span>
<span id="6217">6217</span>
<span id="6218">6218</span>
<span id="6219">6219</span>
<span id="6220">6220</span>
<span id="6221">6221</span>
<span id="6222">6222</span>
<span id="6223">6223</span>
<span id="6224">6224</span>
<span id="6225">6225</span>
<span id="6226">6226</span>
<span id="6227">6227</span>
<span id="6228">6228</span>
<span id="6229">6229</span>
<span id="6230">6230</span>
<span id="6231">6231</span>
<span id="6232">6232</span>
<span id="6233">6233</span>
<span id="6234">6234</span>
<span id="6235">6235</span>
<span id="6236">6236</span>
<span id="6237">6237</span>
<span id="6238">6238</span>
<span id="6239">6239</span>
<span id="6240">6240</span>
<span id="6241">6241</span>
<span id="6242">6242</span>
<span id="6243">6243</span>
<span id="6244">6244</span>
<span id="6245">6245</span>
<span id="6246">6246</span>
<span id="6247">6247</span>
<span id="6248">6248</span>
<span id="6249">6249</span>
<span id="6250">6250</span>
<span id="6251">6251</span>
<span id="6252">6252</span>
<span id="6253">6253</span>
<span id="6254">6254</span>
<span id="6255">6255</span>
<span id="6256">6256</span>
<span id="6257">6257</span>
<span id="6258">6258</span>
<span id="6259">6259</span>
<span id="6260">6260</span>
<span id="6261">6261</span>
<span id="6262">6262</span>
<span id="6263">6263</span>
<span id="6264">6264</span>
<span id="6265">6265</span>
<span id="6266">6266</span>
<span id="6267">6267</span>
<span id="6268">6268</span>
<span id="6269">6269</span>
<span id="6270">6270</span>
<span id="6271">6271</span>
<span id="6272">6272</span>
<span id="6273">6273</span>
<span id="6274">6274</span>
<span id="6275">6275</span>
<span id="6276">6276</span>
<span id="6277">6277</span>
<span id="6278">6278</span>
<span id="6279">6279</span>
<span id="6280">6280</span>
<span id="6281">6281</span>
<span id="6282">6282</span>
<span id="6283">6283</span>
<span id="6284">6284</span>
<span id="6285">6285</span>
<span id="6286">6286</span>
<span id="6287">6287</span>
<span id="6288">6288</span>
<span id="6289">6289</span>
<span id="6290">6290</span>
<span id="6291">6291</span>
<span id="6292">6292</span>
<span id="6293">6293</span>
<span id="6294">6294</span>
<span id="6295">6295</span>
<span id="6296">6296</span>
<span id="6297">6297</span>
<span id="6298">6298</span>
<span id="6299">6299</span>
<span id="6300">6300</span>
<span id="6301">6301</span>
<span id="6302">6302</span>
<span id="6303">6303</span>
<span id="6304">6304</span>
<span id="6305">6305</span>
<span id="6306">6306</span>
<span id="6307">6307</span>
<span id="6308">6308</span>
<span id="6309">6309</span>
<span id="6310">6310</span>
<span id="6311">6311</span>
<span id="6312">6312</span>
<span id="6313">6313</span>
<span id="6314">6314</span>
<span id="6315">6315</span>
<span id="6316">6316</span>
<span id="6317">6317</span>
<span id="6318">6318</span>
<span id="6319">6319</span>
<span id="6320">6320</span>
<span id="6321">6321</span>
<span id="6322">6322</span>
<span id="6323">6323</span>
<span id="6324">6324</span>
<span id="6325">6325</span>
<span id="6326">6326</span>
<span id="6327">6327</span>
<span id="6328">6328</span>
<span id="6329">6329</span>
<span id="6330">6330</span>
<span id="6331">6331</span>
<span id="6332">6332</span>
<span id="6333">6333</span>
<span id="6334">6334</span>
<span id="6335">6335</span>
<span id="6336">6336</span>
<span id="6337">6337</span>
<span id="6338">6338</span>
<span id="6339">6339</span>
<span id="6340">6340</span>
<span id="6341">6341</span>
<span id="6342">6342</span>
<span id="6343">6343</span>
<span id="6344">6344</span>
<span id="6345">6345</span>
<span id="6346">6346</span>
<span id="6347">6347</span>
<span id="6348">6348</span>
<span id="6349">6349</span>
<span id="6350">6350</span>
<span id="6351">6351</span>
<span id="6352">6352</span>
<span id="6353">6353</span>
<span id="6354">6354</span>
<span id="6355">6355</span>
<span id="6356">6356</span>
<span id="6357">6357</span>
<span id="6358">6358</span>
<span id="6359">6359</span>
<span id="6360">6360</span>
<span id="6361">6361</span>
<span id="6362">6362</span>
<span id="6363">6363</span>
<span id="6364">6364</span>
<span id="6365">6365</span>
<span id="6366">6366</span>
<span id="6367">6367</span>
<span id="6368">6368</span>
<span id="6369">6369</span>
<span id="6370">6370</span>
<span id="6371">6371</span>
<span id="6372">6372</span>
<span id="6373">6373</span>
<span id="6374">6374</span>
<span id="6375">6375</span>
<span id="6376">6376</span>
<span id="6377">6377</span>
<span id="6378">6378</span>
<span id="6379">6379</span>
<span id="6380">6380</span>
<span id="6381">6381</span>
<span id="6382">6382</span>
<span id="6383">6383</span>
<span id="6384">6384</span>
<span id="6385">6385</span>
<span id="6386">6386</span>
<span id="6387">6387</span>
<span id="6388">6388</span>
<span id="6389">6389</span>
<span id="6390">6390</span>
<span id="6391">6391</span>
<span id="6392">6392</span>
<span id="6393">6393</span>
<span id="6394">6394</span>
<span id="6395">6395</span>
<span id="6396">6396</span>
<span id="6397">6397</span>
<span id="6398">6398</span>
<span id="6399">6399</span>
<span id="6400">6400</span>
<span id="6401">6401</span>
<span id="6402">6402</span>
<span id="6403">6403</span>
<span id="6404">6404</span>
<span id="6405">6405</span>
<span id="6406">6406</span>
<span id="6407">6407</span>
<span id="6408">6408</span>
<span id="6409">6409</span>
<span id="6410">6410</span>
<span id="6411">6411</span>
<span id="6412">6412</span>
<span id="6413">6413</span>
<span id="6414">6414</span>
<span id="6415">6415</span>
<span id="6416">6416</span>
<span id="6417">6417</span>
<span id="6418">6418</span>
<span id="6419">6419</span>
<span id="6420">6420</span>
<span id="6421">6421</span>
<span id="6422">6422</span>
<span id="6423">6423</span>
<span id="6424">6424</span>
<span id="6425">6425</span>
<span id="6426">6426</span>
<span id="6427">6427</span>
<span id="6428">6428</span>
<span id="6429">6429</span>
<span id="6430">6430</span>
<span id="6431">6431</span>
<span id="6432">6432</span>
<span id="6433">6433</span>
<span id="6434">6434</span>
<span id="6435">6435</span>
<span id="6436">6436</span>
<span id="6437">6437</span>
<span id="6438">6438</span>
<span id="6439">6439</span>
<span id="6440">6440</span>
<span id="6441">6441</span>
<span id="6442">6442</span>
<span id="6443">6443</span>
<span id="6444">6444</span>
<span id="6445">6445</span>
<span id="6446">6446</span>
<span id="6447">6447</span>
<span id="6448">6448</span>
<span id="6449">6449</span>
<span id="6450">6450</span>
<span id="6451">6451</span>
<span id="6452">6452</span>
<span id="6453">6453</span>
<span id="6454">6454</span>
<span id="6455">6455</span>
<span id="6456">6456</span>
<span id="6457">6457</span>
<span id="6458">6458</span>
<span id="6459">6459</span>
<span id="6460">6460</span>
<span id="6461">6461</span>
<span id="6462">6462</span>
<span id="6463">6463</span>
<span id="6464">6464</span>
<span id="6465">6465</span>
<span id="6466">6466</span>
<span id="6467">6467</span>
<span id="6468">6468</span>
<span id="6469">6469</span>
<span id="6470">6470</span>
<span id="6471">6471</span>
<span id="6472">6472</span>
<span id="6473">6473</span>
<span id="6474">6474</span>
<span id="6475">6475</span>
<span id="6476">6476</span>
<span id="6477">6477</span>
<span id="6478">6478</span>
<span id="6479">6479</span>
<span id="6480">6480</span>
<span id="6481">6481</span>
<span id="6482">6482</span>
<span id="6483">6483</span>
<span id="6484">6484</span>
<span id="6485">6485</span>
<span id="6486">6486</span>
<span id="6487">6487</span>
<span id="6488">6488</span>
<span id="6489">6489</span>
<span id="6490">6490</span>
<span id="6491">6491</span>
<span id="6492">6492</span>
<span id="6493">6493</span>
<span id="6494">6494</span>
<span id="6495">6495</span>
<span id="6496">6496</span>
<span id="6497">6497</span>
<span id="6498">6498</span>
<span id="6499">6499</span>
<span id="6500">6500</span>
<span id="6501">6501</span>
<span id="6502">6502</span>
<span id="6503">6503</span>
<span id="6504">6504</span>
<span id="6505">6505</span>
<span id="6506">6506</span>
<span id="6507">6507</span>
<span id="6508">6508</span>
<span id="6509">6509</span>
<span id="6510">6510</span>
<span id="6511">6511</span>
<span id="6512">6512</span>
<span id="6513">6513</span>
<span id="6514">6514</span>
<span id="6515">6515</span>
<span id="6516">6516</span>
<span id="6517">6517</span>
<span id="6518">6518</span>
<span id="6519">6519</span>
<span id="6520">6520</span>
<span id="6521">6521</span>
<span id="6522">6522</span>
<span id="6523">6523</span>
<span id="6524">6524</span>
<span id="6525">6525</span>
<span id="6526">6526</span>
<span id="6527">6527</span>
<span id="6528">6528</span>
<span id="6529">6529</span>
<span id="6530">6530</span>
<span id="6531">6531</span>
<span id="6532">6532</span>
<span id="6533">6533</span>
<span id="6534">6534</span>
<span id="6535">6535</span>
<span id="6536">6536</span>
<span id="6537">6537</span>
<span id="6538">6538</span>
<span id="6539">6539</span>
<span id="6540">6540</span>
<span id="6541">6541</span>
<span id="6542">6542</span>
<span id="6543">6543</span>
<span id="6544">6544</span>
<span id="6545">6545</span>
<span id="6546">6546</span>
<span id="6547">6547</span>
<span id="6548">6548</span>
<span id="6549">6549</span>
<span id="6550">6550</span>
<span id="6551">6551</span>
<span id="6552">6552</span>
<span id="6553">6553</span>
<span id="6554">6554</span>
<span id="6555">6555</span>
<span id="6556">6556</span>
<span id="6557">6557</span>
<span id="6558">6558</span>
<span id="6559">6559</span>
<span id="6560">6560</span>
<span id="6561">6561</span>
<span id="6562">6562</span>
<span id="6563">6563</span>
<span id="6564">6564</span>
<span id="6565">6565</span>
<span id="6566">6566</span>
<span id="6567">6567</span>
<span id="6568">6568</span>
<span id="6569">6569</span>
<span id="6570">6570</span>
<span id="6571">6571</span>
<span id="6572">6572</span>
<span id="6573">6573</span>
<span id="6574">6574</span>
<span id="6575">6575</span>
<span id="6576">6576</span>
<span id="6577">6577</span>
<span id="6578">6578</span>
<span id="6579">6579</span>
<span id="6580">6580</span>
<span id="6581">6581</span>
<span id="6582">6582</span>
<span id="6583">6583</span>
<span id="6584">6584</span>
<span id="6585">6585</span>
<span id="6586">6586</span>
<span id="6587">6587</span>
<span id="6588">6588</span>
<span id="6589">6589</span>
<span id="6590">6590</span>
<span id="6591">6591</span>
<span id="6592">6592</span>
<span id="6593">6593</span>
<span id="6594">6594</span>
<span id="6595">6595</span>
<span id="6596">6596</span>
<span id="6597">6597</span>
<span id="6598">6598</span>
<span id="6599">6599</span>
<span id="6600">6600</span>
<span id="6601">6601</span>
<span id="6602">6602</span>
<span id="6603">6603</span>
<span id="6604">6604</span>
<span id="6605">6605</span>
<span id="6606">6606</span>
<span id="6607">6607</span>
<span id="6608">6608</span>
<span id="6609">6609</span>
<span id="6610">6610</span>
<span id="6611">6611</span>
<span id="6612">6612</span>
<span id="6613">6613</span>
<span id="6614">6614</span>
<span id="6615">6615</span>
<span id="6616">6616</span>
<span id="6617">6617</span>
<span id="6618">6618</span>
<span id="6619">6619</span>
<span id="6620">6620</span>
<span id="6621">6621</span>
<span id="6622">6622</span>
<span id="6623">6623</span>
<span id="6624">6624</span>
<span id="6625">6625</span>
<span id="6626">6626</span>
<span id="6627">6627</span>
<span id="6628">6628</span>
<span id="6629">6629</span>
<span id="6630">6630</span>
<span id="6631">6631</span>
<span id="6632">6632</span>
<span id="6633">6633</span>
<span id="6634">6634</span>
<span id="6635">6635</span>
<span id="6636">6636</span>
<span id="6637">6637</span>
<span id="6638">6638</span>
<span id="6639">6639</span>
<span id="6640">6640</span>
<span id="6641">6641</span>
<span id="6642">6642</span>
<span id="6643">6643</span>
<span id="6644">6644</span>
<span id="6645">6645</span>
<span id="6646">6646</span>
<span id="6647">6647</span>
<span id="6648">6648</span>
<span id="6649">6649</span>
<span id="6650">6650</span>
<span id="6651">6651</span>
<span id="6652">6652</span>
<span id="6653">6653</span>
<span id="6654">6654</span>
<span id="6655">6655</span>
<span id="6656">6656</span>
<span id="6657">6657</span>
<span id="6658">6658</span>
<span id="6659">6659</span>
<span id="6660">6660</span>
<span id="6661">6661</span>
<span id="6662">6662</span>
<span id="6663">6663</span>
<span id="6664">6664</span>
<span id="6665">6665</span>
<span id="6666">6666</span>
<span id="6667">6667</span>
<span id="6668">6668</span>
<span id="6669">6669</span>
<span id="6670">6670</span>
<span id="6671">6671</span>
<span id="6672">6672</span>
<span id="6673">6673</span>
<span id="6674">6674</span>
<span id="6675">6675</span>
<span id="6676">6676</span>
<span id="6677">6677</span>
<span id="6678">6678</span>
<span id="6679">6679</span>
<span id="6680">6680</span>
<span id="6681">6681</span>
<span id="6682">6682</span>
<span id="6683">6683</span>
<span id="6684">6684</span>
<span id="6685">6685</span>
<span id="6686">6686</span>
<span id="6687">6687</span>
<span id="6688">6688</span>
<span id="6689">6689</span>
<span id="6690">6690</span>
<span id="6691">6691</span>
<span id="6692">6692</span>
<span id="6693">6693</span>
<span id="6694">6694</span>
<span id="6695">6695</span>
<span id="6696">6696</span>
<span id="6697">6697</span>
<span id="6698">6698</span>
<span id="6699">6699</span>
<span id="6700">6700</span>
<span id="6701">6701</span>
<span id="6702">6702</span>
<span id="6703">6703</span>
<span id="6704">6704</span>
<span id="6705">6705</span>
<span id="6706">6706</span>
<span id="6707">6707</span>
<span id="6708">6708</span>
<span id="6709">6709</span>
<span id="6710">6710</span>
<span id="6711">6711</span>
<span id="6712">6712</span>
<span id="6713">6713</span>
<span id="6714">6714</span>
<span id="6715">6715</span>
<span id="6716">6716</span>
<span id="6717">6717</span>
<span id="6718">6718</span>
<span id="6719">6719</span>
<span id="6720">6720</span>
<span id="6721">6721</span>
<span id="6722">6722</span>
<span id="6723">6723</span>
<span id="6724">6724</span>
<span id="6725">6725</span>
<span id="6726">6726</span>
<span id="6727">6727</span>
<span id="6728">6728</span>
<span id="6729">6729</span>
<span id="6730">6730</span>
<span id="6731">6731</span>
<span id="6732">6732</span>
<span id="6733">6733</span>
<span id="6734">6734</span>
<span id="6735">6735</span>
<span id="6736">6736</span>
<span id="6737">6737</span>
<span id="6738">6738</span>
<span id="6739">6739</span>
<span id="6740">6740</span>
<span id="6741">6741</span>
<span id="6742">6742</span>
<span id="6743">6743</span>
<span id="6744">6744</span>
<span id="6745">6745</span>
<span id="6746">6746</span>
<span id="6747">6747</span>
<span id="6748">6748</span>
<span id="6749">6749</span>
<span id="6750">6750</span>
<span id="6751">6751</span>
<span id="6752">6752</span>
<span id="6753">6753</span>
<span id="6754">6754</span>
<span id="6755">6755</span>
<span id="6756">6756</span>
<span id="6757">6757</span>
<span id="6758">6758</span>
<span id="6759">6759</span>
<span id="6760">6760</span>
<span id="6761">6761</span>
<span id="6762">6762</span>
<span id="6763">6763</span>
<span id="6764">6764</span>
<span id="6765">6765</span>
<span id="6766">6766</span>
<span id="6767">6767</span>
<span id="6768">6768</span>
<span id="6769">6769</span>
<span id="6770">6770</span>
<span id="6771">6771</span>
<span id="6772">6772</span>
<span id="6773">6773</span>
<span id="6774">6774</span>
<span id="6775">6775</span>
<span id="6776">6776</span>
<span id="6777">6777</span>
<span id="6778">6778</span>
<span id="6779">6779</span>
<span id="6780">6780</span>
<span id="6781">6781</span>
<span id="6782">6782</span>
<span id="6783">6783</span>
<span id="6784">6784</span>
<span id="6785">6785</span>
<span id="6786">6786</span>
<span id="6787">6787</span>
<span id="6788">6788</span>
<span id="6789">6789</span>
<span id="6790">6790</span>
<span id="6791">6791</span>
<span id="6792">6792</span>
<span id="6793">6793</span>
<span id="6794">6794</span>
<span id="6795">6795</span>
<span id="6796">6796</span>
<span id="6797">6797</span>
<span id="6798">6798</span>
<span id="6799">6799</span>
<span id="6800">6800</span>
<span id="6801">6801</span>
<span id="6802">6802</span>
<span id="6803">6803</span>
<span id="6804">6804</span>
<span id="6805">6805</span>
<span id="6806">6806</span>
<span id="6807">6807</span>
<span id="6808">6808</span>
<span id="6809">6809</span>
<span id="6810">6810</span>
<span id="6811">6811</span>
<span id="6812">6812</span>
<span id="6813">6813</span>
<span id="6814">6814</span>
<span id="6815">6815</span>
<span id="6816">6816</span>
<span id="6817">6817</span>
<span id="6818">6818</span>
<span id="6819">6819</span>
<span id="6820">6820</span>
<span id="6821">6821</span>
<span id="6822">6822</span>
<span id="6823">6823</span>
<span id="6824">6824</span>
<span id="6825">6825</span>
<span id="6826">6826</span>
<span id="6827">6827</span>
<span id="6828">6828</span>
<span id="6829">6829</span>
<span id="6830">6830</span>
<span id="6831">6831</span>
<span id="6832">6832</span>
<span id="6833">6833</span>
<span id="6834">6834</span>
<span id="6835">6835</span>
<span id="6836">6836</span>
<span id="6837">6837</span>
<span id="6838">6838</span>
<span id="6839">6839</span>
<span id="6840">6840</span>
<span id="6841">6841</span>
<span id="6842">6842</span>
<span id="6843">6843</span>
<span id="6844">6844</span>
<span id="6845">6845</span>
<span id="6846">6846</span>
<span id="6847">6847</span>
<span id="6848">6848</span>
<span id="6849">6849</span>
<span id="6850">6850</span>
<span id="6851">6851</span>
<span id="6852">6852</span>
<span id="6853">6853</span>
<span id="6854">6854</span>
<span id="6855">6855</span>
<span id="6856">6856</span>
<span id="6857">6857</span>
<span id="6858">6858</span>
<span id="6859">6859</span>
<span id="6860">6860</span>
<span id="6861">6861</span>
<span id="6862">6862</span>
<span id="6863">6863</span>
<span id="6864">6864</span>
<span id="6865">6865</span>
<span id="6866">6866</span>
<span id="6867">6867</span>
<span id="6868">6868</span>
<span id="6869">6869</span>
<span id="6870">6870</span>
<span id="6871">6871</span>
<span id="6872">6872</span>
<span id="6873">6873</span>
<span id="6874">6874</span>
<span id="6875">6875</span>
<span id="6876">6876</span>
<span id="6877">6877</span>
<span id="6878">6878</span>
<span id="6879">6879</span>
<span id="6880">6880</span>
<span id="6881">6881</span>
<span id="6882">6882</span>
<span id="6883">6883</span>
<span id="6884">6884</span>
<span id="6885">6885</span>
<span id="6886">6886</span>
<span id="6887">6887</span>
<span id="6888">6888</span>
<span id="6889">6889</span>
<span id="6890">6890</span>
<span id="6891">6891</span>
<span id="6892">6892</span>
<span id="6893">6893</span>
<span id="6894">6894</span>
<span id="6895">6895</span>
<span id="6896">6896</span>
<span id="6897">6897</span>
<span id="6898">6898</span>
<span id="6899">6899</span>
<span id="6900">6900</span>
<span id="6901">6901</span>
<span id="6902">6902</span>
<span id="6903">6903</span>
<span id="6904">6904</span>
<span id="6905">6905</span>
<span id="6906">6906</span>
<span id="6907">6907</span>
<span id="6908">6908</span>
<span id="6909">6909</span>
<span id="6910">6910</span>
<span id="6911">6911</span>
<span id="6912">6912</span>
<span id="6913">6913</span>
<span id="6914">6914</span>
<span id="6915">6915</span>
<span id="6916">6916</span>
<span id="6917">6917</span>
<span id="6918">6918</span>
<span id="6919">6919</span>
<span id="6920">6920</span>
<span id="6921">6921</span>
<span id="6922">6922</span>
<span id="6923">6923</span>
<span id="6924">6924</span>
<span id="6925">6925</span>
<span id="6926">6926</span>
<span id="6927">6927</span>
<span id="6928">6928</span>
<span id="6929">6929</span>
<span id="6930">6930</span>
<span id="6931">6931</span>
<span id="6932">6932</span>
<span id="6933">6933</span>
<span id="6934">6934</span>
<span id="6935">6935</span>
<span id="6936">6936</span>
<span id="6937">6937</span>
<span id="6938">6938</span>
<span id="6939">6939</span>
<span id="6940">6940</span>
<span id="6941">6941</span>
<span id="6942">6942</span>
<span id="6943">6943</span>
<span id="6944">6944</span>
<span id="6945">6945</span>
<span id="6946">6946</span>
<span id="6947">6947</span>
<span id="6948">6948</span>
<span id="6949">6949</span>
<span id="6950">6950</span>
<span id="6951">6951</span>
<span id="6952">6952</span>
<span id="6953">6953</span>
<span id="6954">6954</span>
<span id="6955">6955</span>
<span id="6956">6956</span>
<span id="6957">6957</span>
<span id="6958">6958</span>
<span id="6959">6959</span>
<span id="6960">6960</span>
<span id="6961">6961</span>
<span id="6962">6962</span>
<span id="6963">6963</span>
<span id="6964">6964</span>
<span id="6965">6965</span>
<span id="6966">6966</span>
<span id="6967">6967</span>
<span id="6968">6968</span>
<span id="6969">6969</span>
<span id="6970">6970</span>
<span id="6971">6971</span>
<span id="6972">6972</span>
<span id="6973">6973</span>
<span id="6974">6974</span>
<span id="6975">6975</span>
<span id="6976">6976</span>
<span id="6977">6977</span>
<span id="6978">6978</span>
<span id="6979">6979</span>
<span id="6980">6980</span>
<span id="6981">6981</span>
<span id="6982">6982</span>
<span id="6983">6983</span>
<span id="6984">6984</span>
<span id="6985">6985</span>
<span id="6986">6986</span>
<span id="6987">6987</span>
<span id="6988">6988</span>
<span id="6989">6989</span>
<span id="6990">6990</span>
<span id="6991">6991</span>
<span id="6992">6992</span>
<span id="6993">6993</span>
<span id="6994">6994</span>
<span id="6995">6995</span>
<span id="6996">6996</span>
<span id="6997">6997</span>
<span id="6998">6998</span>
<span id="6999">6999</span>
<span id="7000">7000</span>
<span id="7001">7001</span>
<span id="7002">7002</span>
<span id="7003">7003</span>
<span id="7004">7004</span>
<span id="7005">7005</span>
<span id="7006">7006</span>
<span id="7007">7007</span>
<span id="7008">7008</span>
<span id="7009">7009</span>
<span id="7010">7010</span>
<span id="7011">7011</span>
<span id="7012">7012</span>
<span id="7013">7013</span>
<span id="7014">7014</span>
<span id="7015">7015</span>
<span id="7016">7016</span>
<span id="7017">7017</span>
<span id="7018">7018</span>
<span id="7019">7019</span>
<span id="7020">7020</span>
<span id="7021">7021</span>
<span id="7022">7022</span>
<span id="7023">7023</span>
<span id="7024">7024</span>
<span id="7025">7025</span>
<span id="7026">7026</span>
<span id="7027">7027</span>
<span id="7028">7028</span>
<span id="7029">7029</span>
<span id="7030">7030</span>
<span id="7031">7031</span>
<span id="7032">7032</span>
<span id="7033">7033</span>
<span id="7034">7034</span>
<span id="7035">7035</span>
<span id="7036">7036</span>
<span id="7037">7037</span>
<span id="7038">7038</span>
<span id="7039">7039</span>
<span id="7040">7040</span>
<span id="7041">7041</span>
<span id="7042">7042</span>
<span id="7043">7043</span>
<span id="7044">7044</span>
<span id="7045">7045</span>
<span id="7046">7046</span>
<span id="7047">7047</span>
<span id="7048">7048</span>
<span id="7049">7049</span>
<span id="7050">7050</span>
<span id="7051">7051</span>
<span id="7052">7052</span>
<span id="7053">7053</span>
<span id="7054">7054</span>
<span id="7055">7055</span>
<span id="7056">7056</span>
<span id="7057">7057</span>
<span id="7058">7058</span>
<span id="7059">7059</span>
<span id="7060">7060</span>
<span id="7061">7061</span>
<span id="7062">7062</span>
<span id="7063">7063</span>
<span id="7064">7064</span>
<span id="7065">7065</span>
<span id="7066">7066</span>
<span id="7067">7067</span>
<span id="7068">7068</span>
<span id="7069">7069</span>
<span id="7070">7070</span>
<span id="7071">7071</span>
<span id="7072">7072</span>
<span id="7073">7073</span>
<span id="7074">7074</span>
<span id="7075">7075</span>
<span id="7076">7076</span>
<span id="7077">7077</span>
<span id="7078">7078</span>
<span id="7079">7079</span>
<span id="7080">7080</span>
<span id="7081">7081</span>
<span id="7082">7082</span>
<span id="7083">7083</span>
<span id="7084">7084</span>
<span id="7085">7085</span>
<span id="7086">7086</span>
<span id="7087">7087</span>
<span id="7088">7088</span>
<span id="7089">7089</span>
<span id="7090">7090</span>
<span id="7091">7091</span>
<span id="7092">7092</span>
<span id="7093">7093</span>
<span id="7094">7094</span>
<span id="7095">7095</span>
<span id="7096">7096</span>
<span id="7097">7097</span>
<span id="7098">7098</span>
<span id="7099">7099</span>
<span id="7100">7100</span>
<span id="7101">7101</span>
<span id="7102">7102</span>
<span id="7103">7103</span>
<span id="7104">7104</span>
<span id="7105">7105</span>
<span id="7106">7106</span>
<span id="7107">7107</span>
<span id="7108">7108</span>
<span id="7109">7109</span>
<span id="7110">7110</span>
<span id="7111">7111</span>
<span id="7112">7112</span>
<span id="7113">7113</span>
<span id="7114">7114</span>
<span id="7115">7115</span>
<span id="7116">7116</span>
<span id="7117">7117</span>
<span id="7118">7118</span>
<span id="7119">7119</span>
<span id="7120">7120</span>
<span id="7121">7121</span>
<span id="7122">7122</span>
<span id="7123">7123</span>
<span id="7124">7124</span>
<span id="7125">7125</span>
<span id="7126">7126</span>
<span id="7127">7127</span>
<span id="7128">7128</span>
<span id="7129">7129</span>
<span id="7130">7130</span>
<span id="7131">7131</span>
<span id="7132">7132</span>
<span id="7133">7133</span>
<span id="7134">7134</span>
<span id="7135">7135</span>
<span id="7136">7136</span>
<span id="7137">7137</span>
<span id="7138">7138</span>
<span id="7139">7139</span>
<span id="7140">7140</span>
<span id="7141">7141</span>
<span id="7142">7142</span>
<span id="7143">7143</span>
<span id="7144">7144</span>
<span id="7145">7145</span>
<span id="7146">7146</span>
<span id="7147">7147</span>
<span id="7148">7148</span>
<span id="7149">7149</span>
<span id="7150">7150</span>
<span id="7151">7151</span>
<span id="7152">7152</span>
<span id="7153">7153</span>
<span id="7154">7154</span>
<span id="7155">7155</span>
<span id="7156">7156</span>
<span id="7157">7157</span>
<span id="7158">7158</span>
<span id="7159">7159</span>
<span id="7160">7160</span>
<span id="7161">7161</span>
<span id="7162">7162</span>
<span id="7163">7163</span>
<span id="7164">7164</span>
<span id="7165">7165</span>
<span id="7166">7166</span>
<span id="7167">7167</span>
<span id="7168">7168</span>
<span id="7169">7169</span>
<span id="7170">7170</span>
<span id="7171">7171</span>
<span id="7172">7172</span>
<span id="7173">7173</span>
<span id="7174">7174</span>
<span id="7175">7175</span>
<span id="7176">7176</span>
<span id="7177">7177</span>
<span id="7178">7178</span>
<span id="7179">7179</span>
<span id="7180">7180</span>
<span id="7181">7181</span>
<span id="7182">7182</span>
<span id="7183">7183</span>
<span id="7184">7184</span>
<span id="7185">7185</span>
<span id="7186">7186</span>
<span id="7187">7187</span>
<span id="7188">7188</span>
<span id="7189">7189</span>
<span id="7190">7190</span>
<span id="7191">7191</span>
<span id="7192">7192</span>
<span id="7193">7193</span>
<span id="7194">7194</span>
<span id="7195">7195</span>
<span id="7196">7196</span>
<span id="7197">7197</span>
<span id="7198">7198</span>
<span id="7199">7199</span>
<span id="7200">7200</span>
<span id="7201">7201</span>
<span id="7202">7202</span>
<span id="7203">7203</span>
<span id="7204">7204</span>
<span id="7205">7205</span>
<span id="7206">7206</span>
<span id="7207">7207</span>
<span id="7208">7208</span>
<span id="7209">7209</span>
<span id="7210">7210</span>
<span id="7211">7211</span>
<span id="7212">7212</span>
<span id="7213">7213</span>
<span id="7214">7214</span>
<span id="7215">7215</span>
<span id="7216">7216</span>
<span id="7217">7217</span>
<span id="7218">7218</span>
<span id="7219">7219</span>
<span id="7220">7220</span>
<span id="7221">7221</span>
<span id="7222">7222</span>
<span id="7223">7223</span>
<span id="7224">7224</span>
<span id="7225">7225</span>
<span id="7226">7226</span>
<span id="7227">7227</span>
<span id="7228">7228</span>
<span id="7229">7229</span>
<span id="7230">7230</span>
<span id="7231">7231</span>
<span id="7232">7232</span>
<span id="7233">7233</span>
<span id="7234">7234</span>
<span id="7235">7235</span>
<span id="7236">7236</span>
<span id="7237">7237</span>
<span id="7238">7238</span>
<span id="7239">7239</span>
<span id="7240">7240</span>
<span id="7241">7241</span>
<span id="7242">7242</span>
<span id="7243">7243</span>
<span id="7244">7244</span>
<span id="7245">7245</span>
<span id="7246">7246</span>
<span id="7247">7247</span>
<span id="7248">7248</span>
<span id="7249">7249</span>
<span id="7250">7250</span>
<span id="7251">7251</span>
<span id="7252">7252</span>
<span id="7253">7253</span>
<span id="7254">7254</span>
<span id="7255">7255</span>
<span id="7256">7256</span>
<span id="7257">7257</span>
<span id="7258">7258</span>
<span id="7259">7259</span>
<span id="7260">7260</span>
<span id="7261">7261</span>
<span id="7262">7262</span>
<span id="7263">7263</span>
<span id="7264">7264</span>
<span id="7265">7265</span>
<span id="7266">7266</span>
<span id="7267">7267</span>
<span id="7268">7268</span>
<span id="7269">7269</span>
<span id="7270">7270</span>
<span id="7271">7271</span>
<span id="7272">7272</span>
<span id="7273">7273</span>
<span id="7274">7274</span>
<span id="7275">7275</span>
<span id="7276">7276</span>
<span id="7277">7277</span>
<span id="7278">7278</span>
<span id="7279">7279</span>
<span id="7280">7280</span>
<span id="7281">7281</span>
<span id="7282">7282</span>
<span id="7283">7283</span>
<span id="7284">7284</span>
<span id="7285">7285</span>
<span id="7286">7286</span>
<span id="7287">7287</span>
<span id="7288">7288</span>
<span id="7289">7289</span>
<span id="7290">7290</span>
<span id="7291">7291</span>
<span id="7292">7292</span>
<span id="7293">7293</span>
<span id="7294">7294</span>
<span id="7295">7295</span>
<span id="7296">7296</span>
<span id="7297">7297</span>
<span id="7298">7298</span>
<span id="7299">7299</span>
<span id="7300">7300</span>
<span id="7301">7301</span>
<span id="7302">7302</span>
<span id="7303">7303</span>
<span id="7304">7304</span>
<span id="7305">7305</span>
<span id="7306">7306</span>
<span id="7307">7307</span>
<span id="7308">7308</span>
<span id="7309">7309</span>
<span id="7310">7310</span>
<span id="7311">7311</span>
<span id="7312">7312</span>
<span id="7313">7313</span>
<span id="7314">7314</span>
<span id="7315">7315</span>
<span id="7316">7316</span>
<span id="7317">7317</span>
<span id="7318">7318</span>
<span id="7319">7319</span>
<span id="7320">7320</span>
<span id="7321">7321</span>
<span id="7322">7322</span>
<span id="7323">7323</span>
<span id="7324">7324</span>
<span id="7325">7325</span>
<span id="7326">7326</span>
<span id="7327">7327</span>
<span id="7328">7328</span>
<span id="7329">7329</span>
<span id="7330">7330</span>
<span id="7331">7331</span>
<span id="7332">7332</span>
<span id="7333">7333</span>
<span id="7334">7334</span>
<span id="7335">7335</span>
<span id="7336">7336</span>
<span id="7337">7337</span>
<span id="7338">7338</span>
<span id="7339">7339</span>
<span id="7340">7340</span>
<span id="7341">7341</span>
<span id="7342">7342</span>
<span id="7343">7343</span>
<span id="7344">7344</span>
<span id="7345">7345</span>
<span id="7346">7346</span>
<span id="7347">7347</span>
<span id="7348">7348</span>
<span id="7349">7349</span>
<span id="7350">7350</span>
<span id="7351">7351</span>
<span id="7352">7352</span>
<span id="7353">7353</span>
<span id="7354">7354</span>
<span id="7355">7355</span>
<span id="7356">7356</span>
<span id="7357">7357</span>
<span id="7358">7358</span>
<span id="7359">7359</span>
<span id="7360">7360</span>
<span id="7361">7361</span>
<span id="7362">7362</span>
<span id="7363">7363</span>
<span id="7364">7364</span>
<span id="7365">7365</span>
<span id="7366">7366</span>
<span id="7367">7367</span>
<span id="7368">7368</span>
<span id="7369">7369</span>
<span id="7370">7370</span>
<span id="7371">7371</span>
<span id="7372">7372</span>
<span id="7373">7373</span>
<span id="7374">7374</span>
<span id="7375">7375</span>
<span id="7376">7376</span>
<span id="7377">7377</span>
<span id="7378">7378</span>
<span id="7379">7379</span>
<span id="7380">7380</span>
<span id="7381">7381</span>
<span id="7382">7382</span>
<span id="7383">7383</span>
<span id="7384">7384</span>
<span id="7385">7385</span>
<span id="7386">7386</span>
<span id="7387">7387</span>
<span id="7388">7388</span>
<span id="7389">7389</span>
<span id="7390">7390</span>
<span id="7391">7391</span>
<span id="7392">7392</span>
<span id="7393">7393</span>
<span id="7394">7394</span>
<span id="7395">7395</span>
<span id="7396">7396</span>
<span id="7397">7397</span>
<span id="7398">7398</span>
<span id="7399">7399</span>
<span id="7400">7400</span>
<span id="7401">7401</span>
<span id="7402">7402</span>
<span id="7403">7403</span>
<span id="7404">7404</span>
<span id="7405">7405</span>
<span id="7406">7406</span>
<span id="7407">7407</span>
<span id="7408">7408</span>
<span id="7409">7409</span>
<span id="7410">7410</span>
<span id="7411">7411</span>
<span id="7412">7412</span>
<span id="7413">7413</span>
<span id="7414">7414</span>
<span id="7415">7415</span>
<span id="7416">7416</span>
<span id="7417">7417</span>
<span id="7418">7418</span>
<span id="7419">7419</span>
<span id="7420">7420</span>
<span id="7421">7421</span>
<span id="7422">7422</span>
<span id="7423">7423</span>
<span id="7424">7424</span>
<span id="7425">7425</span>
<span id="7426">7426</span>
<span id="7427">7427</span>
<span id="7428">7428</span>
<span id="7429">7429</span>
<span id="7430">7430</span>
<span id="7431">7431</span>
<span id="7432">7432</span>
<span id="7433">7433</span>
<span id="7434">7434</span>
<span id="7435">7435</span>
<span id="7436">7436</span>
<span id="7437">7437</span>
<span id="7438">7438</span>
<span id="7439">7439</span>
<span id="7440">7440</span>
<span id="7441">7441</span>
<span id="7442">7442</span>
<span id="7443">7443</span>
<span id="7444">7444</span>
<span id="7445">7445</span>
<span id="7446">7446</span>
<span id="7447">7447</span>
<span id="7448">7448</span>
<span id="7449">7449</span>
<span id="7450">7450</span>
<span id="7451">7451</span>
<span id="7452">7452</span>
<span id="7453">7453</span>
<span id="7454">7454</span>
<span id="7455">7455</span>
<span id="7456">7456</span>
<span id="7457">7457</span>
<span id="7458">7458</span>
<span id="7459">7459</span>
<span id="7460">7460</span>
<span id="7461">7461</span>
<span id="7462">7462</span>
<span id="7463">7463</span>
<span id="7464">7464</span>
<span id="7465">7465</span>
<span id="7466">7466</span>
<span id="7467">7467</span>
<span id="7468">7468</span>
<span id="7469">7469</span>
<span id="7470">7470</span>
<span id="7471">7471</span>
<span id="7472">7472</span>
<span id="7473">7473</span>
<span id="7474">7474</span>
<span id="7475">7475</span>
<span id="7476">7476</span>
<span id="7477">7477</span>
<span id="7478">7478</span>
<span id="7479">7479</span>
<span id="7480">7480</span>
<span id="7481">7481</span>
<span id="7482">7482</span>
<span id="7483">7483</span>
<span id="7484">7484</span>
<span id="7485">7485</span>
<span id="7486">7486</span>
<span id="7487">7487</span>
<span id="7488">7488</span>
<span id="7489">7489</span>
<span id="7490">7490</span>
<span id="7491">7491</span>
<span id="7492">7492</span>
<span id="7493">7493</span>
<span id="7494">7494</span>
<span id="7495">7495</span>
<span id="7496">7496</span>
<span id="7497">7497</span>
<span id="7498">7498</span>
<span id="7499">7499</span>
<span id="7500">7500</span>
<span id="7501">7501</span>
<span id="7502">7502</span>
<span id="7503">7503</span>
<span id="7504">7504</span>
<span id="7505">7505</span>
<span id="7506">7506</span>
<span id="7507">7507</span>
<span id="7508">7508</span>
<span id="7509">7509</span>
<span id="7510">7510</span>
<span id="7511">7511</span>
<span id="7512">7512</span>
<span id="7513">7513</span>
<span id="7514">7514</span>
<span id="7515">7515</span>
<span id="7516">7516</span>
<span id="7517">7517</span>
<span id="7518">7518</span>
<span id="7519">7519</span>
<span id="7520">7520</span>
<span id="7521">7521</span>
<span id="7522">7522</span>
<span id="7523">7523</span>
<span id="7524">7524</span>
<span id="7525">7525</span>
<span id="7526">7526</span>
<span id="7527">7527</span>
<span id="7528">7528</span>
<span id="7529">7529</span>
<span id="7530">7530</span>
<span id="7531">7531</span>
<span id="7532">7532</span>
<span id="7533">7533</span>
<span id="7534">7534</span>
<span id="7535">7535</span>
<span id="7536">7536</span>
<span id="7537">7537</span>
<span id="7538">7538</span>
<span id="7539">7539</span>
<span id="7540">7540</span>
<span id="7541">7541</span>
<span id="7542">7542</span>
<span id="7543">7543</span>
<span id="7544">7544</span>
<span id="7545">7545</span>
<span id="7546">7546</span>
<span id="7547">7547</span>
<span id="7548">7548</span>
<span id="7549">7549</span>
<span id="7550">7550</span>
<span id="7551">7551</span>
<span id="7552">7552</span>
<span id="7553">7553</span>
<span id="7554">7554</span>
<span id="7555">7555</span>
<span id="7556">7556</span>
<span id="7557">7557</span>
<span id="7558">7558</span>
<span id="7559">7559</span>
<span id="7560">7560</span>
<span id="7561">7561</span>
<span id="7562">7562</span>
<span id="7563">7563</span>
<span id="7564">7564</span>
<span id="7565">7565</span>
<span id="7566">7566</span>
<span id="7567">7567</span>
<span id="7568">7568</span>
<span id="7569">7569</span>
<span id="7570">7570</span>
<span id="7571">7571</span>
<span id="7572">7572</span>
<span id="7573">7573</span>
<span id="7574">7574</span>
<span id="7575">7575</span>
<span id="7576">7576</span>
<span id="7577">7577</span>
<span id="7578">7578</span>
<span id="7579">7579</span>
<span id="7580">7580</span>
<span id="7581">7581</span>
<span id="7582">7582</span>
<span id="7583">7583</span>
<span id="7584">7584</span>
<span id="7585">7585</span>
<span id="7586">7586</span>
<span id="7587">7587</span>
<span id="7588">7588</span>
<span id="7589">7589</span>
<span id="7590">7590</span>
<span id="7591">7591</span>
<span id="7592">7592</span>
<span id="7593">7593</span>
<span id="7594">7594</span>
<span id="7595">7595</span>
<span id="7596">7596</span>
<span id="7597">7597</span>
<span id="7598">7598</span>
<span id="7599">7599</span>
<span id="7600">7600</span>
<span id="7601">7601</span>
<span id="7602">7602</span>
<span id="7603">7603</span>
<span id="7604">7604</span>
<span id="7605">7605</span>
<span id="7606">7606</span>
<span id="7607">7607</span>
<span id="7608">7608</span>
<span id="7609">7609</span>
<span id="7610">7610</span>
<span id="7611">7611</span>
<span id="7612">7612</span>
<span id="7613">7613</span>
<span id="7614">7614</span>
<span id="7615">7615</span>
<span id="7616">7616</span>
<span id="7617">7617</span>
<span id="7618">7618</span>
<span id="7619">7619</span>
<span id="7620">7620</span>
<span id="7621">7621</span>
<span id="7622">7622</span>
<span id="7623">7623</span>
<span id="7624">7624</span>
<span id="7625">7625</span>
<span id="7626">7626</span>
<span id="7627">7627</span>
<span id="7628">7628</span>
<span id="7629">7629</span>
<span id="7630">7630</span>
<span id="7631">7631</span>
<span id="7632">7632</span>
<span id="7633">7633</span>
<span id="7634">7634</span>
<span id="7635">7635</span>
<span id="7636">7636</span>
<span id="7637">7637</span>
<span id="7638">7638</span>
<span id="7639">7639</span>
<span id="7640">7640</span>
<span id="7641">7641</span>
<span id="7642">7642</span>
<span id="7643">7643</span>
<span id="7644">7644</span>
<span id="7645">7645</span>
<span id="7646">7646</span>
<span id="7647">7647</span>
<span id="7648">7648</span>
<span id="7649">7649</span>
<span id="7650">7650</span>
<span id="7651">7651</span>
<span id="7652">7652</span>
<span id="7653">7653</span>
<span id="7654">7654</span>
<span id="7655">7655</span>
<span id="7656">7656</span>
<span id="7657">7657</span>
<span id="7658">7658</span>
<span id="7659">7659</span>
<span id="7660">7660</span>
<span id="7661">7661</span>
<span id="7662">7662</span>
<span id="7663">7663</span>
<span id="7664">7664</span>
<span id="7665">7665</span>
<span id="7666">7666</span>
<span id="7667">7667</span>
<span id="7668">7668</span>
<span id="7669">7669</span>
<span id="7670">7670</span>
<span id="7671">7671</span>
<span id="7672">7672</span>
<span id="7673">7673</span>
<span id="7674">7674</span>
<span id="7675">7675</span>
<span id="7676">7676</span>
<span id="7677">7677</span>
<span id="7678">7678</span>
<span id="7679">7679</span>
<span id="7680">7680</span>
<span id="7681">7681</span>
<span id="7682">7682</span>
<span id="7683">7683</span>
<span id="7684">7684</span>
<span id="7685">7685</span>
<span id="7686">7686</span>
<span id="7687">7687</span>
<span id="7688">7688</span>
<span id="7689">7689</span>
<span id="7690">7690</span>
<span id="7691">7691</span>
<span id="7692">7692</span>
<span id="7693">7693</span>
<span id="7694">7694</span>
<span id="7695">7695</span>
<span id="7696">7696</span>
<span id="7697">7697</span>
<span id="7698">7698</span>
<span id="7699">7699</span>
<span id="7700">7700</span>
<span id="7701">7701</span>
<span id="7702">7702</span>
<span id="7703">7703</span>
<span id="7704">7704</span>
<span id="7705">7705</span>
<span id="7706">7706</span>
<span id="7707">7707</span>
<span id="7708">7708</span>
<span id="7709">7709</span>
<span id="7710">7710</span>
<span id="7711">7711</span>
<span id="7712">7712</span>
<span id="7713">7713</span>
<span id="7714">7714</span>
<span id="7715">7715</span>
<span id="7716">7716</span>
<span id="7717">7717</span>
<span id="7718">7718</span>
<span id="7719">7719</span>
<span id="7720">7720</span>
<span id="7721">7721</span>
<span id="7722">7722</span>
<span id="7723">7723</span>
<span id="7724">7724</span>
<span id="7725">7725</span>
<span id="7726">7726</span>
<span id="7727">7727</span>
<span id="7728">7728</span>
<span id="7729">7729</span>
<span id="7730">7730</span>
<span id="7731">7731</span>
<span id="7732">7732</span>
<span id="7733">7733</span>
<span id="7734">7734</span>
<span id="7735">7735</span>
<span id="7736">7736</span>
<span id="7737">7737</span>
<span id="7738">7738</span>
<span id="7739">7739</span>
<span id="7740">7740</span>
<span id="7741">7741</span>
<span id="7742">7742</span>
<span id="7743">7743</span>
<span id="7744">7744</span>
<span id="7745">7745</span>
<span id="7746">7746</span>
<span id="7747">7747</span>
<span id="7748">7748</span>
<span id="7749">7749</span>
<span id="7750">7750</span>
<span id="7751">7751</span>
<span id="7752">7752</span>
<span id="7753">7753</span>
<span id="7754">7754</span>
<span id="7755">7755</span>
<span id="7756">7756</span>
<span id="7757">7757</span>
<span id="7758">7758</span>
<span id="7759">7759</span>
<span id="7760">7760</span>
<span id="7761">7761</span>
<span id="7762">7762</span>
<span id="7763">7763</span>
<span id="7764">7764</span>
<span id="7765">7765</span>
<span id="7766">7766</span>
<span id="7767">7767</span>
<span id="7768">7768</span>
<span id="7769">7769</span>
<span id="7770">7770</span>
<span id="7771">7771</span>
<span id="7772">7772</span>
<span id="7773">7773</span>
<span id="7774">7774</span>
<span id="7775">7775</span>
<span id="7776">7776</span>
<span id="7777">7777</span>
<span id="7778">7778</span>
<span id="7779">7779</span>
<span id="7780">7780</span>
<span id="7781">7781</span>
<span id="7782">7782</span>
<span id="7783">7783</span>
<span id="7784">7784</span>
<span id="7785">7785</span>
<span id="7786">7786</span>
<span id="7787">7787</span>
<span id="7788">7788</span>
<span id="7789">7789</span>
<span id="7790">7790</span>
<span id="7791">7791</span>
<span id="7792">7792</span>
<span id="7793">7793</span>
<span id="7794">7794</span>
<span id="7795">7795</span>
<span id="7796">7796</span>
<span id="7797">7797</span>
<span id="7798">7798</span>
<span id="7799">7799</span>
<span id="7800">7800</span>
<span id="7801">7801</span>
<span id="7802">7802</span>
<span id="7803">7803</span>
<span id="7804">7804</span>
<span id="7805">7805</span>
<span id="7806">7806</span>
<span id="7807">7807</span>
<span id="7808">7808</span>
<span id="7809">7809</span>
<span id="7810">7810</span>
<span id="7811">7811</span>
<span id="7812">7812</span>
<span id="7813">7813</span>
<span id="7814">7814</span>
<span id="7815">7815</span>
<span id="7816">7816</span>
<span id="7817">7817</span>
<span id="7818">7818</span>
<span id="7819">7819</span>
<span id="7820">7820</span>
<span id="7821">7821</span>
<span id="7822">7822</span>
<span id="7823">7823</span>
<span id="7824">7824</span>
<span id="7825">7825</span>
<span id="7826">7826</span>
<span id="7827">7827</span>
<span id="7828">7828</span>
<span id="7829">7829</span>
<span id="7830">7830</span>
<span id="7831">7831</span>
<span id="7832">7832</span>
<span id="7833">7833</span>
<span id="7834">7834</span>
<span id="7835">7835</span>
<span id="7836">7836</span>
<span id="7837">7837</span>
<span id="7838">7838</span>
<span id="7839">7839</span>
<span id="7840">7840</span>
<span id="7841">7841</span>
<span id="7842">7842</span>
<span id="7843">7843</span>
<span id="7844">7844</span>
<span id="7845">7845</span>
<span id="7846">7846</span>
<span id="7847">7847</span>
<span id="7848">7848</span>
<span id="7849">7849</span>
<span id="7850">7850</span>
<span id="7851">7851</span>
<span id="7852">7852</span>
<span id="7853">7853</span>
<span id="7854">7854</span>
<span id="7855">7855</span>
<span id="7856">7856</span>
<span id="7857">7857</span>
<span id="7858">7858</span>
<span id="7859">7859</span>
<span id="7860">7860</span>
<span id="7861">7861</span>
<span id="7862">7862</span>
<span id="7863">7863</span>
<span id="7864">7864</span>
<span id="7865">7865</span>
<span id="7866">7866</span>
<span id="7867">7867</span>
<span id="7868">7868</span>
<span id="7869">7869</span>
<span id="7870">7870</span>
<span id="7871">7871</span>
<span id="7872">7872</span>
<span id="7873">7873</span>
<span id="7874">7874</span>
<span id="7875">7875</span>
<span id="7876">7876</span>
<span id="7877">7877</span>
<span id="7878">7878</span>
<span id="7879">7879</span>
<span id="7880">7880</span>
<span id="7881">7881</span>
<span id="7882">7882</span>
<span id="7883">7883</span>
<span id="7884">7884</span>
<span id="7885">7885</span>
<span id="7886">7886</span>
<span id="7887">7887</span>
<span id="7888">7888</span>
<span id="7889">7889</span>
<span id="7890">7890</span>
<span id="7891">7891</span>
<span id="7892">7892</span>
<span id="7893">7893</span>
<span id="7894">7894</span>
<span id="7895">7895</span>
<span id="7896">7896</span>
<span id="7897">7897</span>
<span id="7898">7898</span>
<span id="7899">7899</span>
<span id="7900">7900</span>
<span id="7901">7901</span>
<span id="7902">7902</span>
<span id="7903">7903</span>
<span id="7904">7904</span>
<span id="7905">7905</span>
<span id="7906">7906</span>
<span id="7907">7907</span>
<span id="7908">7908</span>
<span id="7909">7909</span>
<span id="7910">7910</span>
<span id="7911">7911</span>
<span id="7912">7912</span>
<span id="7913">7913</span>
<span id="7914">7914</span>
<span id="7915">7915</span>
<span id="7916">7916</span>
<span id="7917">7917</span>
<span id="7918">7918</span>
<span id="7919">7919</span>
<span id="7920">7920</span>
<span id="7921">7921</span>
<span id="7922">7922</span>
<span id="7923">7923</span>
<span id="7924">7924</span>
<span id="7925">7925</span>
<span id="7926">7926</span>
<span id="7927">7927</span>
<span id="7928">7928</span>
<span id="7929">7929</span>
<span id="7930">7930</span>
<span id="7931">7931</span>
<span id="7932">7932</span>
<span id="7933">7933</span>
<span id="7934">7934</span>
<span id="7935">7935</span>
<span id="7936">7936</span>
<span id="7937">7937</span>
<span id="7938">7938</span>
<span id="7939">7939</span>
<span id="7940">7940</span>
<span id="7941">7941</span>
<span id="7942">7942</span>
<span id="7943">7943</span>
<span id="7944">7944</span>
<span id="7945">7945</span>
<span id="7946">7946</span>
<span id="7947">7947</span>
<span id="7948">7948</span>
<span id="7949">7949</span>
<span id="7950">7950</span>
<span id="7951">7951</span>
<span id="7952">7952</span>
<span id="7953">7953</span>
<span id="7954">7954</span>
<span id="7955">7955</span>
<span id="7956">7956</span>
<span id="7957">7957</span>
<span id="7958">7958</span>
<span id="7959">7959</span>
<span id="7960">7960</span>
<span id="7961">7961</span>
<span id="7962">7962</span>
<span id="7963">7963</span>
<span id="7964">7964</span>
<span id="7965">7965</span>
<span id="7966">7966</span>
<span id="7967">7967</span>
<span id="7968">7968</span>
<span id="7969">7969</span>
<span id="7970">7970</span>
<span id="7971">7971</span>
<span id="7972">7972</span>
<span id="7973">7973</span>
<span id="7974">7974</span>
<span id="7975">7975</span>
<span id="7976">7976</span>
<span id="7977">7977</span>
<span id="7978">7978</span>
<span id="7979">7979</span>
<span id="7980">7980</span>
<span id="7981">7981</span>
<span id="7982">7982</span>
<span id="7983">7983</span>
<span id="7984">7984</span>
<span id="7985">7985</span>
<span id="7986">7986</span>
<span id="7987">7987</span>
<span id="7988">7988</span>
<span id="7989">7989</span>
<span id="7990">7990</span>
<span id="7991">7991</span>
<span id="7992">7992</span>
<span id="7993">7993</span>
<span id="7994">7994</span>
<span id="7995">7995</span>
<span id="7996">7996</span>
<span id="7997">7997</span>
<span id="7998">7998</span>
<span id="7999">7999</span>
<span id="8000">8000</span>
<span id="8001">8001</span>
<span id="8002">8002</span>
<span id="8003">8003</span>
<span id="8004">8004</span>
<span id="8005">8005</span>
<span id="8006">8006</span>
<span id="8007">8007</span>
<span id="8008">8008</span>
<span id="8009">8009</span>
<span id="8010">8010</span>
<span id="8011">8011</span>
<span id="8012">8012</span>
<span id="8013">8013</span>
<span id="8014">8014</span>
<span id="8015">8015</span>
<span id="8016">8016</span>
<span id="8017">8017</span>
<span id="8018">8018</span>
<span id="8019">8019</span>
<span id="8020">8020</span>
<span id="8021">8021</span>
<span id="8022">8022</span>
<span id="8023">8023</span>
<span id="8024">8024</span>
<span id="8025">8025</span>
<span id="8026">8026</span>
<span id="8027">8027</span>
<span id="8028">8028</span>
<span id="8029">8029</span>
<span id="8030">8030</span>
<span id="8031">8031</span>
<span id="8032">8032</span>
<span id="8033">8033</span>
<span id="8034">8034</span>
<span id="8035">8035</span>
<span id="8036">8036</span>
<span id="8037">8037</span>
<span id="8038">8038</span>
<span id="8039">8039</span>
<span id="8040">8040</span>
<span id="8041">8041</span>
<span id="8042">8042</span>
<span id="8043">8043</span>
<span id="8044">8044</span>
<span id="8045">8045</span>
<span id="8046">8046</span>
<span id="8047">8047</span>
<span id="8048">8048</span>
<span id="8049">8049</span>
<span id="8050">8050</span>
<span id="8051">8051</span>
<span id="8052">8052</span>
<span id="8053">8053</span>
<span id="8054">8054</span>
<span id="8055">8055</span>
<span id="8056">8056</span>
<span id="8057">8057</span>
<span id="8058">8058</span>
<span id="8059">8059</span>
<span id="8060">8060</span>
<span id="8061">8061</span>
<span id="8062">8062</span>
<span id="8063">8063</span>
<span id="8064">8064</span>
<span id="8065">8065</span>
<span id="8066">8066</span>
<span id="8067">8067</span>
<span id="8068">8068</span>
<span id="8069">8069</span>
<span id="8070">8070</span>
<span id="8071">8071</span>
<span id="8072">8072</span>
<span id="8073">8073</span>
<span id="8074">8074</span>
<span id="8075">8075</span>
<span id="8076">8076</span>
<span id="8077">8077</span>
<span id="8078">8078</span>
<span id="8079">8079</span>
<span id="8080">8080</span>
<span id="8081">8081</span>
<span id="8082">8082</span>
<span id="8083">8083</span>
<span id="8084">8084</span>
<span id="8085">8085</span>
<span id="8086">8086</span>
<span id="8087">8087</span>
<span id="8088">8088</span>
<span id="8089">8089</span>
<span id="8090">8090</span>
<span id="8091">8091</span>
<span id="8092">8092</span>
<span id="8093">8093</span>
<span id="8094">8094</span>
<span id="8095">8095</span>
<span id="8096">8096</span>
<span id="8097">8097</span>
<span id="8098">8098</span>
<span id="8099">8099</span>
<span id="8100">8100</span>
<span id="8101">8101</span>
<span id="8102">8102</span>
<span id="8103">8103</span>
<span id="8104">8104</span>
<span id="8105">8105</span>
<span id="8106">8106</span>
<span id="8107">8107</span>
<span id="8108">8108</span>
<span id="8109">8109</span>
<span id="8110">8110</span>
<span id="8111">8111</span>
<span id="8112">8112</span>
<span id="8113">8113</span>
<span id="8114">8114</span>
<span id="8115">8115</span>
<span id="8116">8116</span>
<span id="8117">8117</span>
<span id="8118">8118</span>
<span id="8119">8119</span>
<span id="8120">8120</span>
<span id="8121">8121</span>
<span id="8122">8122</span>
<span id="8123">8123</span>
<span id="8124">8124</span>
<span id="8125">8125</span>
<span id="8126">8126</span>
<span id="8127">8127</span>
<span id="8128">8128</span>
<span id="8129">8129</span>
<span id="8130">8130</span>
<span id="8131">8131</span>
<span id="8132">8132</span>
<span id="8133">8133</span>
<span id="8134">8134</span>
<span id="8135">8135</span>
<span id="8136">8136</span>
<span id="8137">8137</span>
<span id="8138">8138</span>
<span id="8139">8139</span>
<span id="8140">8140</span>
<span id="8141">8141</span>
<span id="8142">8142</span>
<span id="8143">8143</span>
<span id="8144">8144</span>
<span id="8145">8145</span>
<span id="8146">8146</span>
<span id="8147">8147</span>
<span id="8148">8148</span>
<span id="8149">8149</span>
<span id="8150">8150</span>
<span id="8151">8151</span>
<span id="8152">8152</span>
<span id="8153">8153</span>
<span id="8154">8154</span>
<span id="8155">8155</span>
<span id="8156">8156</span>
<span id="8157">8157</span>
<span id="8158">8158</span>
<span id="8159">8159</span>
<span id="8160">8160</span>
<span id="8161">8161</span>
<span id="8162">8162</span>
<span id="8163">8163</span>
<span id="8164">8164</span>
<span id="8165">8165</span>
<span id="8166">8166</span>
<span id="8167">8167</span>
<span id="8168">8168</span>
<span id="8169">8169</span>
<span id="8170">8170</span>
<span id="8171">8171</span>
<span id="8172">8172</span>
<span id="8173">8173</span>
<span id="8174">8174</span>
<span id="8175">8175</span>
<span id="8176">8176</span>
<span id="8177">8177</span>
<span id="8178">8178</span>
<span id="8179">8179</span>
<span id="8180">8180</span>
<span id="8181">8181</span>
<span id="8182">8182</span>
<span id="8183">8183</span>
<span id="8184">8184</span>
<span id="8185">8185</span>
<span id="8186">8186</span>
<span id="8187">8187</span>
<span id="8188">8188</span>
<span id="8189">8189</span>
<span id="8190">8190</span>
<span id="8191">8191</span>
<span id="8192">8192</span>
<span id="8193">8193</span>
<span id="8194">8194</span>
<span id="8195">8195</span>
<span id="8196">8196</span>
<span id="8197">8197</span>
<span id="8198">8198</span>
<span id="8199">8199</span>
<span id="8200">8200</span>
<span id="8201">8201</span>
<span id="8202">8202</span>
<span id="8203">8203</span>
<span id="8204">8204</span>
<span id="8205">8205</span>
<span id="8206">8206</span>
<span id="8207">8207</span>
<span id="8208">8208</span>
<span id="8209">8209</span>
<span id="8210">8210</span>
<span id="8211">8211</span>
<span id="8212">8212</span>
<span id="8213">8213</span>
<span id="8214">8214</span>
<span id="8215">8215</span>
<span id="8216">8216</span>
<span id="8217">8217</span>
<span id="8218">8218</span>
<span id="8219">8219</span>
<span id="8220">8220</span>
<span id="8221">8221</span>
<span id="8222">8222</span>
<span id="8223">8223</span>
<span id="8224">8224</span>
<span id="8225">8225</span>
<span id="8226">8226</span>
<span id="8227">8227</span>
<span id="8228">8228</span>
<span id="8229">8229</span>
<span id="8230">8230</span>
<span id="8231">8231</span>
<span id="8232">8232</span>
<span id="8233">8233</span>
<span id="8234">8234</span>
<span id="8235">8235</span>
<span id="8236">8236</span>
<span id="8237">8237</span>
<span id="8238">8238</span>
<span id="8239">8239</span>
<span id="8240">8240</span>
<span id="8241">8241</span>
<span id="8242">8242</span>
<span id="8243">8243</span>
<span id="8244">8244</span>
<span id="8245">8245</span>
<span id="8246">8246</span>
<span id="8247">8247</span>
<span id="8248">8248</span>
<span id="8249">8249</span>
<span id="8250">8250</span>
<span id="8251">8251</span>
<span id="8252">8252</span>
<span id="8253">8253</span>
<span id="8254">8254</span>
<span id="8255">8255</span>
<span id="8256">8256</span>
<span id="8257">8257</span>
<span id="8258">8258</span>
<span id="8259">8259</span>
<span id="8260">8260</span>
<span id="8261">8261</span>
<span id="8262">8262</span>
<span id="8263">8263</span>
<span id="8264">8264</span>
<span id="8265">8265</span>
<span id="8266">8266</span>
<span id="8267">8267</span>
<span id="8268">8268</span>
<span id="8269">8269</span>
<span id="8270">8270</span>
<span id="8271">8271</span>
<span id="8272">8272</span>
<span id="8273">8273</span>
<span id="8274">8274</span>
<span id="8275">8275</span>
<span id="8276">8276</span>
<span id="8277">8277</span>
<span id="8278">8278</span>
<span id="8279">8279</span>
<span id="8280">8280</span>
<span id="8281">8281</span>
<span id="8282">8282</span>
<span id="8283">8283</span>
<span id="8284">8284</span>
<span id="8285">8285</span>
<span id="8286">8286</span>
<span id="8287">8287</span>
<span id="8288">8288</span>
<span id="8289">8289</span>
<span id="8290">8290</span>
<span id="8291">8291</span>
<span id="8292">8292</span>
<span id="8293">8293</span>
<span id="8294">8294</span>
<span id="8295">8295</span>
<span id="8296">8296</span>
<span id="8297">8297</span>
<span id="8298">8298</span>
<span id="8299">8299</span>
<span id="8300">8300</span>
<span id="8301">8301</span>
<span id="8302">8302</span>
<span id="8303">8303</span>
<span id="8304">8304</span>
<span id="8305">8305</span>
<span id="8306">8306</span>
<span id="8307">8307</span>
<span id="8308">8308</span>
<span id="8309">8309</span>
<span id="8310">8310</span>
<span id="8311">8311</span>
<span id="8312">8312</span>
<span id="8313">8313</span>
<span id="8314">8314</span>
<span id="8315">8315</span>
<span id="8316">8316</span>
<span id="8317">8317</span>
<span id="8318">8318</span>
<span id="8319">8319</span>
<span id="8320">8320</span>
<span id="8321">8321</span>
<span id="8322">8322</span>
<span id="8323">8323</span>
<span id="8324">8324</span>
<span id="8325">8325</span>
<span id="8326">8326</span>
<span id="8327">8327</span>
<span id="8328">8328</span>
<span id="8329">8329</span>
<span id="8330">8330</span>
<span id="8331">8331</span>
<span id="8332">8332</span>
<span id="8333">8333</span>
<span id="8334">8334</span>
<span id="8335">8335</span>
<span id="8336">8336</span>
<span id="8337">8337</span>
<span id="8338">8338</span>
<span id="8339">8339</span>
<span id="8340">8340</span>
<span id="8341">8341</span>
<span id="8342">8342</span>
<span id="8343">8343</span>
<span id="8344">8344</span>
<span id="8345">8345</span>
<span id="8346">8346</span>
<span id="8347">8347</span>
<span id="8348">8348</span>
<span id="8349">8349</span>
<span id="8350">8350</span>
<span id="8351">8351</span>
<span id="8352">8352</span>
<span id="8353">8353</span>
<span id="8354">8354</span>
<span id="8355">8355</span>
<span id="8356">8356</span>
<span id="8357">8357</span>
<span id="8358">8358</span>
<span id="8359">8359</span>
<span id="8360">8360</span>
<span id="8361">8361</span>
<span id="8362">8362</span>
<span id="8363">8363</span>
<span id="8364">8364</span>
<span id="8365">8365</span>
<span id="8366">8366</span>
<span id="8367">8367</span>
<span id="8368">8368</span>
<span id="8369">8369</span>
<span id="8370">8370</span>
<span id="8371">8371</span>
<span id="8372">8372</span>
<span id="8373">8373</span>
<span id="8374">8374</span>
<span id="8375">8375</span>
<span id="8376">8376</span>
<span id="8377">8377</span>
<span id="8378">8378</span>
<span id="8379">8379</span>
<span id="8380">8380</span>
<span id="8381">8381</span>
<span id="8382">8382</span>
<span id="8383">8383</span>
<span id="8384">8384</span>
<span id="8385">8385</span>
<span id="8386">8386</span>
<span id="8387">8387</span>
<span id="8388">8388</span>
<span id="8389">8389</span>
<span id="8390">8390</span>
<span id="8391">8391</span>
<span id="8392">8392</span>
<span id="8393">8393</span>
<span id="8394">8394</span>
<span id="8395">8395</span>
<span id="8396">8396</span>
<span id="8397">8397</span>
<span id="8398">8398</span>
<span id="8399">8399</span>
<span id="8400">8400</span>
<span id="8401">8401</span>
<span id="8402">8402</span>
<span id="8403">8403</span>
<span id="8404">8404</span>
<span id="8405">8405</span>
<span id="8406">8406</span>
<span id="8407">8407</span>
<span id="8408">8408</span>
</pre><pre class="rust"><code><span class="kw">use </span><span class="kw">crate</span>::raw::{Allocator, Bucket, Global, RawDrain, RawIntoIter, RawIter, RawTable};
<span class="kw">use </span><span class="kw">crate</span>::TryReserveError;
<span class="kw">use </span>core::borrow::Borrow;
<span class="kw">use </span>core::fmt::{<span class="self">self</span>, Debug};
<span class="kw">use </span>core::hash::{BuildHasher, Hash};
<span class="kw">use </span>core::iter::{FromIterator, FusedIterator};
<span class="kw">use </span>core::marker::PhantomData;
<span class="kw">use </span>core::mem;
<span class="kw">use </span>core::ops::Index;
<span class="doccomment">/// Default hasher for `HashMap`.
</span><span class="attribute">#[cfg(feature = <span class="string">&quot;ahash&quot;</span>)]
</span><span class="kw">pub type </span>DefaultHashBuilder = ahash::RandomState;
<span class="doccomment">/// Dummy default hasher for `HashMap`.
</span><span class="attribute">#[cfg(not(feature = <span class="string">&quot;ahash&quot;</span>))]
</span><span class="kw">pub enum </span>DefaultHashBuilder {}
<span class="doccomment">/// A hash map implemented with quadratic probing and SIMD lookup.
///
/// The default hashing algorithm is currently [`AHash`], though this is
/// subject to change at any point in the future. This hash function is very
/// fast for all types of keys, but this algorithm will typically *not* protect
/// against attacks such as HashDoS.
///
/// The hashing algorithm can be replaced on a per-`HashMap` basis using the
/// [`default`], [`with_hasher`], and [`with_capacity_and_hasher`] methods. Many
/// alternative algorithms are available on crates.io, such as the [`fnv`] crate.
///
/// It is required that the keys implement the [`Eq`] and [`Hash`] traits, although
/// this can frequently be achieved by using `#[derive(PartialEq, Eq, Hash)]`.
/// If you implement these yourself, it is important that the following
/// property holds:
///
/// ```text
/// k1 == k2 -&gt; hash(k1) == hash(k2)
/// ```
///
/// In other words, if two keys are equal, their hashes must be equal.
///
/// It is a logic error for a key to be modified in such a way that the key&#39;s
/// hash, as determined by the [`Hash`] trait, or its equality, as determined by
/// the [`Eq`] trait, changes while it is in the map. This is normally only
/// possible through [`Cell`], [`RefCell`], global state, I/O, or unsafe code.
///
/// It is also a logic error for the [`Hash`] implementation of a key to panic.
/// This is generally only possible if the trait is implemented manually. If a
/// panic does occur then the contents of the `HashMap` may become corrupted and
/// some items may be dropped from the table.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// // Type inference lets us omit an explicit type signature (which
/// // would be `HashMap&lt;String, String&gt;` in this example).
/// let mut book_reviews = HashMap::new();
///
/// // Review some books.
/// book_reviews.insert(
/// &quot;Adventures of Huckleberry Finn&quot;.to_string(),
/// &quot;My favorite book.&quot;.to_string(),
/// );
/// book_reviews.insert(
/// &quot;Grimms&#39; Fairy Tales&quot;.to_string(),
/// &quot;Masterpiece.&quot;.to_string(),
/// );
/// book_reviews.insert(
/// &quot;Pride and Prejudice&quot;.to_string(),
/// &quot;Very enjoyable.&quot;.to_string(),
/// );
/// book_reviews.insert(
/// &quot;The Adventures of Sherlock Holmes&quot;.to_string(),
/// &quot;Eye lyked it alot.&quot;.to_string(),
/// );
///
/// // Check for a specific one.
/// // When collections store owned values (String), they can still be
/// // queried using references (&amp;str).
/// if !book_reviews.contains_key(&quot;Les Misérables&quot;) {
/// println!(&quot;We&#39;ve got {} reviews, but Les Misérables ain&#39;t one.&quot;,
/// book_reviews.len());
/// }
///
/// // oops, this review has a lot of spelling mistakes, let&#39;s delete it.
/// book_reviews.remove(&quot;The Adventures of Sherlock Holmes&quot;);
///
/// // Look up the values associated with some keys.
/// let to_find = [&quot;Pride and Prejudice&quot;, &quot;Alice&#39;s Adventure in Wonderland&quot;];
/// for &amp;book in &amp;to_find {
/// match book_reviews.get(book) {
/// Some(review) =&gt; println!(&quot;{}: {}&quot;, book, review),
/// None =&gt; println!(&quot;{} is unreviewed.&quot;, book)
/// }
/// }
///
/// // Look up the value for a key (will panic if the key is not found).
/// println!(&quot;Review for Jane: {}&quot;, book_reviews[&quot;Pride and Prejudice&quot;]);
///
/// // Iterate over everything.
/// for (book, review) in &amp;book_reviews {
/// println!(&quot;{}: \&quot;{}\&quot;&quot;, book, review);
/// }
/// ```
///
/// `HashMap` also implements an [`Entry API`](#method.entry), which allows
/// for more complex methods of getting, setting, updating and removing keys and
/// their values:
///
/// ```
/// use hashbrown::HashMap;
///
/// // type inference lets us omit an explicit type signature (which
/// // would be `HashMap&lt;&amp;str, u8&gt;` in this example).
/// let mut player_stats = HashMap::new();
///
/// fn random_stat_buff() -&gt; u8 {
/// // could actually return some random value here - let&#39;s just return
/// // some fixed value for now
/// 42
/// }
///
/// // insert a key only if it doesn&#39;t already exist
/// player_stats.entry(&quot;health&quot;).or_insert(100);
///
/// // insert a key using a function that provides a new value only if it
/// // doesn&#39;t already exist
/// player_stats.entry(&quot;defence&quot;).or_insert_with(random_stat_buff);
///
/// // update a key, guarding against the key possibly not being set
/// let stat = player_stats.entry(&quot;attack&quot;).or_insert(100);
/// *stat += random_stat_buff();
/// ```
///
/// The easiest way to use `HashMap` with a custom key type is to derive [`Eq`] and [`Hash`].
/// We must also derive [`PartialEq`].
///
/// [`Eq`]: https://doc.rust-lang.org/std/cmp/trait.Eq.html
/// [`Hash`]: https://doc.rust-lang.org/std/hash/trait.Hash.html
/// [`PartialEq`]: https://doc.rust-lang.org/std/cmp/trait.PartialEq.html
/// [`RefCell`]: https://doc.rust-lang.org/std/cell/struct.RefCell.html
/// [`Cell`]: https://doc.rust-lang.org/std/cell/struct.Cell.html
/// [`default`]: #method.default
/// [`with_hasher`]: #method.with_hasher
/// [`with_capacity_and_hasher`]: #method.with_capacity_and_hasher
/// [`fnv`]: https://crates.io/crates/fnv
/// [`AHash`]: https://crates.io/crates/ahash
///
/// ```
/// use hashbrown::HashMap;
///
/// #[derive(Hash, Eq, PartialEq, Debug)]
/// struct Viking {
/// name: String,
/// country: String,
/// }
///
/// impl Viking {
/// /// Creates a new Viking.
/// fn new(name: &amp;str, country: &amp;str) -&gt; Viking {
/// Viking { name: name.to_string(), country: country.to_string() }
/// }
/// }
///
/// // Use a HashMap to store the vikings&#39; health points.
/// let mut vikings = HashMap::new();
///
/// vikings.insert(Viking::new(&quot;Einar&quot;, &quot;Norway&quot;), 25);
/// vikings.insert(Viking::new(&quot;Olaf&quot;, &quot;Denmark&quot;), 24);
/// vikings.insert(Viking::new(&quot;Harald&quot;, &quot;Iceland&quot;), 12);
///
/// // Use derived implementation to print the status of the vikings.
/// for (viking, health) in &amp;vikings {
/// println!(&quot;{:?} has {} hp&quot;, viking, health);
/// }
/// ```
///
/// A `HashMap` with fixed list of elements can be initialized from an array:
///
/// ```
/// use hashbrown::HashMap;
///
/// let timber_resources: HashMap&lt;&amp;str, i32&gt; = [(&quot;Norway&quot;, 100), (&quot;Denmark&quot;, 50), (&quot;Iceland&quot;, 10)]
/// .iter().cloned().collect();
/// // use the values stored in map
/// ```
</span><span class="kw">pub struct </span>HashMap&lt;K, V, S = DefaultHashBuilder, A: Allocator + Clone = Global&gt; {
<span class="kw">pub</span>(<span class="kw">crate</span>) hash_builder: S,
<span class="kw">pub</span>(<span class="kw">crate</span>) table: RawTable&lt;(K, V), A&gt;,
}
<span class="kw">impl</span>&lt;K: Clone, V: Clone, S: Clone, A: Allocator + Clone&gt; Clone <span class="kw">for </span>HashMap&lt;K, V, S, A&gt; {
<span class="kw">fn </span>clone(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="self">Self </span>{
HashMap {
hash_builder: <span class="self">self</span>.hash_builder.clone(),
table: <span class="self">self</span>.table.clone(),
}
}
<span class="kw">fn </span>clone_from(<span class="kw-2">&amp;mut </span><span class="self">self</span>, source: <span class="kw-2">&amp;</span><span class="self">Self</span>) {
<span class="self">self</span>.table.clone_from(<span class="kw-2">&amp;</span>source.table);
<span class="comment">// Update hash_builder only if we successfully cloned all elements.
</span><span class="self">self</span>.hash_builder.clone_from(<span class="kw-2">&amp;</span>source.hash_builder);
}
}
<span class="doccomment">/// Ensures that a single closure type across uses of this which, in turn prevents multiple
/// instances of any functions like RawTable::reserve from being generated
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>make_hasher&lt;K, Q, V, S&gt;(hash_builder: <span class="kw-2">&amp;</span>S) -&gt; <span class="kw">impl </span>Fn(<span class="kw-2">&amp;</span>(Q, V)) -&gt; u64 + <span class="lifetime">&#39;_
</span><span class="kw">where
</span>K: Borrow&lt;Q&gt;,
Q: Hash,
S: BuildHasher,
{
<span class="kw">move </span>|val| make_hash::&lt;K, Q, S&gt;(hash_builder, <span class="kw-2">&amp;</span>val.<span class="number">0</span>)
}
<span class="doccomment">/// Ensures that a single closure type across uses of this which, in turn prevents multiple
/// instances of any functions like RawTable::reserve from being generated
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>equivalent_key&lt;Q, K, V&gt;(k: <span class="kw-2">&amp;</span>Q) -&gt; <span class="kw">impl </span>Fn(<span class="kw-2">&amp;</span>(K, V)) -&gt; bool + <span class="lifetime">&#39;_
</span><span class="kw">where
</span>K: Borrow&lt;Q&gt;,
Q: <span class="question-mark">?</span>Sized + Eq,
{
<span class="kw">move </span>|x| k.eq(x.<span class="number">0</span>.borrow())
}
<span class="doccomment">/// Ensures that a single closure type across uses of this which, in turn prevents multiple
/// instances of any functions like RawTable::reserve from being generated
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>equivalent&lt;Q, K&gt;(k: <span class="kw-2">&amp;</span>Q) -&gt; <span class="kw">impl </span>Fn(<span class="kw-2">&amp;</span>K) -&gt; bool + <span class="lifetime">&#39;_
</span><span class="kw">where
</span>K: Borrow&lt;Q&gt;,
Q: <span class="question-mark">?</span>Sized + Eq,
{
<span class="kw">move </span>|x| k.eq(x.borrow())
}
<span class="attribute">#[cfg(not(feature = <span class="string">&quot;nightly&quot;</span>))]
#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>make_hash&lt;K, Q, S&gt;(hash_builder: <span class="kw-2">&amp;</span>S, val: <span class="kw-2">&amp;</span>Q) -&gt; u64
<span class="kw">where
</span>K: Borrow&lt;Q&gt;,
Q: Hash + <span class="question-mark">?</span>Sized,
S: BuildHasher,
{
<span class="kw">use </span>core::hash::Hasher;
<span class="kw">let </span><span class="kw-2">mut </span>state = hash_builder.build_hasher();
val.hash(<span class="kw-2">&amp;mut </span>state);
state.finish()
}
<span class="attribute">#[cfg(feature = <span class="string">&quot;nightly&quot;</span>)]
#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>make_hash&lt;K, Q, S&gt;(hash_builder: <span class="kw-2">&amp;</span>S, val: <span class="kw-2">&amp;</span>Q) -&gt; u64
<span class="kw">where
</span>K: Borrow&lt;Q&gt;,
Q: Hash + <span class="question-mark">?</span>Sized,
S: BuildHasher,
{
hash_builder.hash_one(val)
}
<span class="attribute">#[cfg(not(feature = <span class="string">&quot;nightly&quot;</span>))]
#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>make_insert_hash&lt;K, S&gt;(hash_builder: <span class="kw-2">&amp;</span>S, val: <span class="kw-2">&amp;</span>K) -&gt; u64
<span class="kw">where
</span>K: Hash,
S: BuildHasher,
{
<span class="kw">use </span>core::hash::Hasher;
<span class="kw">let </span><span class="kw-2">mut </span>state = hash_builder.build_hasher();
val.hash(<span class="kw-2">&amp;mut </span>state);
state.finish()
}
<span class="attribute">#[cfg(feature = <span class="string">&quot;nightly&quot;</span>)]
#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>make_insert_hash&lt;K, S&gt;(hash_builder: <span class="kw-2">&amp;</span>S, val: <span class="kw-2">&amp;</span>K) -&gt; u64
<span class="kw">where
</span>K: Hash,
S: BuildHasher,
{
hash_builder.hash_one(val)
}
<span class="attribute">#[cfg(feature = <span class="string">&quot;ahash&quot;</span>)]
</span><span class="kw">impl</span>&lt;K, V&gt; HashMap&lt;K, V, DefaultHashBuilder&gt; {
<span class="doccomment">/// Creates an empty `HashMap`.
///
/// The hash map is initially created with a capacity of 0, so it will not allocate until it
/// is first inserted into.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// let mut map: HashMap&lt;&amp;str, i32&gt; = HashMap::new();
/// assert_eq!(map.len(), 0);
/// assert_eq!(map.capacity(), 0);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>new() -&gt; <span class="self">Self </span>{
<span class="self">Self</span>::default()
}
<span class="doccomment">/// Creates an empty `HashMap` with the specified capacity.
///
/// The hash map will be able to hold at least `capacity` elements without
/// reallocating. If `capacity` is 0, the hash map will not allocate.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// let mut map: HashMap&lt;&amp;str, i32&gt; = HashMap::with_capacity(10);
/// assert_eq!(map.len(), 0);
/// assert!(map.capacity() &gt;= 10);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>with_capacity(capacity: usize) -&gt; <span class="self">Self </span>{
<span class="self">Self</span>::with_capacity_and_hasher(capacity, DefaultHashBuilder::default())
}
}
<span class="attribute">#[cfg(feature = <span class="string">&quot;ahash&quot;</span>)]
</span><span class="kw">impl</span>&lt;K, V, A: Allocator + Clone&gt; HashMap&lt;K, V, DefaultHashBuilder, A&gt; {
<span class="doccomment">/// Creates an empty `HashMap` using the given allocator.
///
/// The hash map is initially created with a capacity of 0, so it will not allocate until it
/// is first inserted into.
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>new_in(alloc: A) -&gt; <span class="self">Self </span>{
<span class="self">Self</span>::with_hasher_in(DefaultHashBuilder::default(), alloc)
}
<span class="doccomment">/// Creates an empty `HashMap` with the specified capacity using the given allocator.
///
/// The hash map will be able to hold at least `capacity` elements without
/// reallocating. If `capacity` is 0, the hash map will not allocate.
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>with_capacity_in(capacity: usize, alloc: A) -&gt; <span class="self">Self </span>{
<span class="self">Self</span>::with_capacity_and_hasher_in(capacity, DefaultHashBuilder::default(), alloc)
}
}
<span class="kw">impl</span>&lt;K, V, S&gt; HashMap&lt;K, V, S&gt; {
<span class="doccomment">/// Creates an empty `HashMap` which will use the given hash builder to hash
/// keys.
///
/// The hash map is initially created with a capacity of 0, so it will not
/// allocate until it is first inserted into.
///
/// Warning: `hash_builder` is normally randomly generated, and
/// is designed to allow HashMaps to be resistant to attacks that
/// cause many collisions and very poor performance. Setting it
/// manually using this function can expose a DoS attack vector.
///
/// The `hash_builder` passed should implement the [`BuildHasher`] trait for
/// the HashMap to be useful, see its documentation for details.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// use hashbrown::hash_map::DefaultHashBuilder;
///
/// let s = DefaultHashBuilder::default();
/// let mut map = HashMap::with_hasher(s);
/// assert_eq!(map.len(), 0);
/// assert_eq!(map.capacity(), 0);
///
/// map.insert(1, 2);
/// ```
///
/// [`BuildHasher`]: https://doc.rust-lang.org/std/hash/trait.BuildHasher.html
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub const fn </span>with_hasher(hash_builder: S) -&gt; <span class="self">Self </span>{
<span class="self">Self </span>{
hash_builder,
table: RawTable::new(),
}
}
<span class="doccomment">/// Creates an empty `HashMap` with the specified capacity, using `hash_builder`
/// to hash the keys.
///
/// The hash map will be able to hold at least `capacity` elements without
/// reallocating. If `capacity` is 0, the hash map will not allocate.
///
/// Warning: `hash_builder` is normally randomly generated, and
/// is designed to allow HashMaps to be resistant to attacks that
/// cause many collisions and very poor performance. Setting it
/// manually using this function can expose a DoS attack vector.
///
/// The `hash_builder` passed should implement the [`BuildHasher`] trait for
/// the HashMap to be useful, see its documentation for details.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// use hashbrown::hash_map::DefaultHashBuilder;
///
/// let s = DefaultHashBuilder::default();
/// let mut map = HashMap::with_capacity_and_hasher(10, s);
/// assert_eq!(map.len(), 0);
/// assert!(map.capacity() &gt;= 10);
///
/// map.insert(1, 2);
/// ```
///
/// [`BuildHasher`]: https://doc.rust-lang.org/std/hash/trait.BuildHasher.html
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>with_capacity_and_hasher(capacity: usize, hash_builder: S) -&gt; <span class="self">Self </span>{
<span class="self">Self </span>{
hash_builder,
table: RawTable::with_capacity(capacity),
}
}
}
<span class="kw">impl</span>&lt;K, V, S, A: Allocator + Clone&gt; HashMap&lt;K, V, S, A&gt; {
<span class="doccomment">/// Returns a reference to the underlying allocator.
</span><span class="attribute">#[inline]
</span><span class="kw">pub fn </span>allocator(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>A {
<span class="self">self</span>.table.allocator()
}
<span class="doccomment">/// Creates an empty `HashMap` which will use the given hash builder to hash
/// keys. It will be allocated with the given allocator.
///
/// The created map has the default initial capacity.
///
/// Warning: `hash_builder` is normally randomly generated, and
/// is designed to allow HashMaps to be resistant to attacks that
/// cause many collisions and very poor performance. Setting it
/// manually using this function can expose a DoS attack vector.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// use hashbrown::hash_map::DefaultHashBuilder;
///
/// let s = DefaultHashBuilder::default();
/// let mut map = HashMap::with_hasher(s);
/// map.insert(1, 2);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>with_hasher_in(hash_builder: S, alloc: A) -&gt; <span class="self">Self </span>{
<span class="self">Self </span>{
hash_builder,
table: RawTable::new_in(alloc),
}
}
<span class="doccomment">/// Creates an empty `HashMap` with the specified capacity, using `hash_builder`
/// to hash the keys. It will be allocated with the given allocator.
///
/// The hash map will be able to hold at least `capacity` elements without
/// reallocating. If `capacity` is 0, the hash map will not allocate.
///
/// Warning: `hash_builder` is normally randomly generated, and
/// is designed to allow HashMaps to be resistant to attacks that
/// cause many collisions and very poor performance. Setting it
/// manually using this function can expose a DoS attack vector.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// use hashbrown::hash_map::DefaultHashBuilder;
///
/// let s = DefaultHashBuilder::default();
/// let mut map = HashMap::with_capacity_and_hasher(10, s);
/// map.insert(1, 2);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>with_capacity_and_hasher_in(capacity: usize, hash_builder: S, alloc: A) -&gt; <span class="self">Self </span>{
<span class="self">Self </span>{
hash_builder,
table: RawTable::with_capacity_in(capacity, alloc),
}
}
<span class="doccomment">/// Returns a reference to the map&#39;s [`BuildHasher`].
///
/// [`BuildHasher`]: https://doc.rust-lang.org/std/hash/trait.BuildHasher.html
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// use hashbrown::hash_map::DefaultHashBuilder;
///
/// let hasher = DefaultHashBuilder::default();
/// let map: HashMap&lt;i32, i32&gt; = HashMap::with_hasher(hasher);
/// let hasher: &amp;DefaultHashBuilder = map.hasher();
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>hasher(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>S {
<span class="kw-2">&amp;</span><span class="self">self</span>.hash_builder
}
<span class="doccomment">/// Returns the number of elements the map can hold without reallocating.
///
/// This number is a lower bound; the `HashMap&lt;K, V&gt;` might be able to hold
/// more, but is guaranteed to be able to hold at least this many.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// let map: HashMap&lt;i32, i32&gt; = HashMap::with_capacity(100);
/// assert_eq!(map.len(), 0);
/// assert!(map.capacity() &gt;= 100);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>capacity(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
<span class="self">self</span>.table.capacity()
}
<span class="doccomment">/// An iterator visiting all keys in arbitrary order.
/// The iterator element type is `&amp;&#39;a K`.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map = HashMap::new();
/// map.insert(&quot;a&quot;, 1);
/// map.insert(&quot;b&quot;, 2);
/// map.insert(&quot;c&quot;, 3);
/// assert_eq!(map.len(), 3);
/// let mut vec: Vec&lt;&amp;str&gt; = Vec::new();
///
/// for key in map.keys() {
/// println!(&quot;{}&quot;, key);
/// vec.push(*key);
/// }
///
/// // The `Keys` iterator produces keys in arbitrary order, so the
/// // keys must be sorted to test them against a sorted array.
/// vec.sort_unstable();
/// assert_eq!(vec, [&quot;a&quot;, &quot;b&quot;, &quot;c&quot;]);
///
/// assert_eq!(map.len(), 3);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>keys(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; Keys&lt;<span class="lifetime">&#39;_</span>, K, V&gt; {
Keys { inner: <span class="self">self</span>.iter() }
}
<span class="doccomment">/// An iterator visiting all values in arbitrary order.
/// The iterator element type is `&amp;&#39;a V`.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map = HashMap::new();
/// map.insert(&quot;a&quot;, 1);
/// map.insert(&quot;b&quot;, 2);
/// map.insert(&quot;c&quot;, 3);
/// assert_eq!(map.len(), 3);
/// let mut vec: Vec&lt;i32&gt; = Vec::new();
///
/// for val in map.values() {
/// println!(&quot;{}&quot;, val);
/// vec.push(*val);
/// }
///
/// // The `Values` iterator produces values in arbitrary order, so the
/// // values must be sorted to test them against a sorted array.
/// vec.sort_unstable();
/// assert_eq!(vec, [1, 2, 3]);
///
/// assert_eq!(map.len(), 3);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>values(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; Values&lt;<span class="lifetime">&#39;_</span>, K, V&gt; {
Values { inner: <span class="self">self</span>.iter() }
}
<span class="doccomment">/// An iterator visiting all values mutably in arbitrary order.
/// The iterator element type is `&amp;&#39;a mut V`.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map = HashMap::new();
///
/// map.insert(&quot;a&quot;, 1);
/// map.insert(&quot;b&quot;, 2);
/// map.insert(&quot;c&quot;, 3);
///
/// for val in map.values_mut() {
/// *val = *val + 10;
/// }
///
/// assert_eq!(map.len(), 3);
/// let mut vec: Vec&lt;i32&gt; = Vec::new();
///
/// for val in map.values() {
/// println!(&quot;{}&quot;, val);
/// vec.push(*val);
/// }
///
/// // The `Values` iterator produces values in arbitrary order, so the
/// // values must be sorted to test them against a sorted array.
/// vec.sort_unstable();
/// assert_eq!(vec, [11, 12, 13]);
///
/// assert_eq!(map.len(), 3);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>values_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; ValuesMut&lt;<span class="lifetime">&#39;_</span>, K, V&gt; {
ValuesMut {
inner: <span class="self">self</span>.iter_mut(),
}
}
<span class="doccomment">/// An iterator visiting all key-value pairs in arbitrary order.
/// The iterator element type is `(&amp;&#39;a K, &amp;&#39;a V)`.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map = HashMap::new();
/// map.insert(&quot;a&quot;, 1);
/// map.insert(&quot;b&quot;, 2);
/// map.insert(&quot;c&quot;, 3);
/// assert_eq!(map.len(), 3);
/// let mut vec: Vec&lt;(&amp;str, i32)&gt; = Vec::new();
///
/// for (key, val) in map.iter() {
/// println!(&quot;key: {} val: {}&quot;, key, val);
/// vec.push((*key, *val));
/// }
///
/// // The `Iter` iterator produces items in arbitrary order, so the
/// // items must be sorted to test them against a sorted array.
/// vec.sort_unstable();
/// assert_eq!(vec, [(&quot;a&quot;, 1), (&quot;b&quot;, 2), (&quot;c&quot;, 3)]);
///
/// assert_eq!(map.len(), 3);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>iter(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; Iter&lt;<span class="lifetime">&#39;_</span>, K, V&gt; {
<span class="comment">// Here we tie the lifetime of self to the iter.
</span><span class="kw">unsafe </span>{
Iter {
inner: <span class="self">self</span>.table.iter(),
marker: PhantomData,
}
}
}
<span class="doccomment">/// An iterator visiting all key-value pairs in arbitrary order,
/// with mutable references to the values.
/// The iterator element type is `(&amp;&#39;a K, &amp;&#39;a mut V)`.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map = HashMap::new();
/// map.insert(&quot;a&quot;, 1);
/// map.insert(&quot;b&quot;, 2);
/// map.insert(&quot;c&quot;, 3);
///
/// // Update all values
/// for (_, val) in map.iter_mut() {
/// *val *= 2;
/// }
///
/// assert_eq!(map.len(), 3);
/// let mut vec: Vec&lt;(&amp;str, i32)&gt; = Vec::new();
///
/// for (key, val) in &amp;map {
/// println!(&quot;key: {} val: {}&quot;, key, val);
/// vec.push((*key, *val));
/// }
///
/// // The `Iter` iterator produces items in arbitrary order, so the
/// // items must be sorted to test them against a sorted array.
/// vec.sort_unstable();
/// assert_eq!(vec, [(&quot;a&quot;, 2), (&quot;b&quot;, 4), (&quot;c&quot;, 6)]);
///
/// assert_eq!(map.len(), 3);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>iter_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; IterMut&lt;<span class="lifetime">&#39;_</span>, K, V&gt; {
<span class="comment">// Here we tie the lifetime of self to the iter.
</span><span class="kw">unsafe </span>{
IterMut {
inner: <span class="self">self</span>.table.iter(),
marker: PhantomData,
}
}
}
<span class="attribute">#[cfg(test)]
#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>raw_capacity(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
<span class="self">self</span>.table.buckets()
}
<span class="doccomment">/// Returns the number of elements in the map.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut a = HashMap::new();
/// assert_eq!(a.len(), 0);
/// a.insert(1, &quot;a&quot;);
/// assert_eq!(a.len(), 1);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>len(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
<span class="self">self</span>.table.len()
}
<span class="doccomment">/// Returns `true` if the map contains no elements.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut a = HashMap::new();
/// assert!(a.is_empty());
/// a.insert(1, &quot;a&quot;);
/// assert!(!a.is_empty());
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>is_empty(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; bool {
<span class="self">self</span>.len() == <span class="number">0
</span>}
<span class="doccomment">/// Clears the map, returning all key-value pairs as an iterator. Keeps the
/// allocated memory for reuse.
///
/// If the returned iterator is dropped before being fully consumed, it
/// drops the remaining key-value pairs. The returned iterator keeps a
/// mutable borrow on the vector to optimize its implementation.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut a = HashMap::new();
/// a.insert(1, &quot;a&quot;);
/// a.insert(2, &quot;b&quot;);
/// let capacity_before_drain = a.capacity();
///
/// for (k, v) in a.drain().take(1) {
/// assert!(k == 1 || k == 2);
/// assert!(v == &quot;a&quot; || v == &quot;b&quot;);
/// }
///
/// // As we can see, the map is empty and contains no element.
/// assert!(a.is_empty() &amp;&amp; a.len() == 0);
/// // But map capacity is equal to old one.
/// assert_eq!(a.capacity(), capacity_before_drain);
///
/// let mut a = HashMap::new();
/// a.insert(1, &quot;a&quot;);
/// a.insert(2, &quot;b&quot;);
///
/// { // Iterator is dropped without being consumed.
/// let d = a.drain();
/// }
///
/// // But the map is empty even if we do not use Drain iterator.
/// assert!(a.is_empty());
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>drain(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; Drain&lt;<span class="lifetime">&#39;_</span>, K, V, A&gt; {
Drain {
inner: <span class="self">self</span>.table.drain(),
}
}
<span class="doccomment">/// Retains only the elements specified by the predicate. Keeps the
/// allocated memory for reuse.
///
/// In other words, remove all pairs `(k, v)` such that `f(&amp;k, &amp;mut v)` returns `false`.
/// The elements are visited in unsorted (and unspecified) order.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map: HashMap&lt;i32, i32&gt; = (0..8).map(|x|(x, x*10)).collect();
/// assert_eq!(map.len(), 8);
/// let capacity_before_retain = map.capacity();
///
/// map.retain(|&amp;k, _| k % 2 == 0);
///
/// // We can see, that the number of elements inside map is changed.
/// assert_eq!(map.len(), 4);
/// // But map capacity is equal to old one.
/// assert_eq!(map.capacity(), capacity_before_retain);
///
/// let mut vec: Vec&lt;(i32, i32)&gt; = map.iter().map(|(&amp;k, &amp;v)| (k, v)).collect();
/// vec.sort_unstable();
/// assert_eq!(vec, [(0, 0), (2, 20), (4, 40), (6, 60)]);
/// ```
</span><span class="kw">pub fn </span>retain&lt;F&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, <span class="kw-2">mut </span>f: F)
<span class="kw">where
</span>F: FnMut(<span class="kw-2">&amp;</span>K, <span class="kw-2">&amp;mut </span>V) -&gt; bool,
{
<span class="comment">// Here we only use `iter` as a temporary, preventing use-after-free
</span><span class="kw">unsafe </span>{
<span class="kw">for </span>item <span class="kw">in </span><span class="self">self</span>.table.iter() {
<span class="kw">let </span><span class="kw-2">&amp;mut </span>(<span class="kw-2">ref </span>key, <span class="kw-2">ref mut </span>value) = item.as_mut();
<span class="kw">if </span>!f(key, value) {
<span class="self">self</span>.table.erase(item);
}
}
}
}
<span class="doccomment">/// Drains elements which are true under the given predicate,
/// and returns an iterator over the removed items.
///
/// In other words, move all pairs `(k, v)` such that `f(&amp;k, &amp;mut v)` returns `true` out
/// into another iterator.
///
/// Note that `drain_filter` lets you mutate every value in the filter closure, regardless of
/// whether you choose to keep or remove it.
///
/// When the returned DrainedFilter is dropped, any remaining elements that satisfy
/// the predicate are dropped from the table.
///
/// It is unspecified how many more elements will be subjected to the closure
/// if a panic occurs in the closure, or a panic occurs while dropping an element,
/// or if the `DrainFilter` value is leaked.
///
/// Keeps the allocated memory for reuse.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map: HashMap&lt;i32, i32&gt; = (0..8).map(|x| (x, x)).collect();
/// let capacity_before_drain_filter = map.capacity();
/// let drained: HashMap&lt;i32, i32&gt; = map.drain_filter(|k, _v| k % 2 == 0).collect();
///
/// let mut evens = drained.keys().cloned().collect::&lt;Vec&lt;_&gt;&gt;();
/// let mut odds = map.keys().cloned().collect::&lt;Vec&lt;_&gt;&gt;();
/// evens.sort();
/// odds.sort();
///
/// assert_eq!(evens, vec![0, 2, 4, 6]);
/// assert_eq!(odds, vec![1, 3, 5, 7]);
/// // Map capacity is equal to old one.
/// assert_eq!(map.capacity(), capacity_before_drain_filter);
///
/// let mut map: HashMap&lt;i32, i32&gt; = (0..8).map(|x| (x, x)).collect();
///
/// { // Iterator is dropped without being consumed.
/// let d = map.drain_filter(|k, _v| k % 2 != 0);
/// }
///
/// // But the map lens have been reduced by half
/// // even if we do not use DrainFilter iterator.
/// assert_eq!(map.len(), 4);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>drain_filter&lt;F&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, f: F) -&gt; DrainFilter&lt;<span class="lifetime">&#39;_</span>, K, V, F, A&gt;
<span class="kw">where
</span>F: FnMut(<span class="kw-2">&amp;</span>K, <span class="kw-2">&amp;mut </span>V) -&gt; bool,
{
DrainFilter {
f,
inner: DrainFilterInner {
iter: <span class="kw">unsafe </span>{ <span class="self">self</span>.table.iter() },
table: <span class="kw-2">&amp;mut </span><span class="self">self</span>.table,
},
}
}
<span class="doccomment">/// Clears the map, removing all key-value pairs. Keeps the allocated memory
/// for reuse.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut a = HashMap::new();
/// a.insert(1, &quot;a&quot;);
/// let capacity_before_clear = a.capacity();
///
/// a.clear();
///
/// // Map is empty.
/// assert!(a.is_empty());
/// // But map capacity is equal to old one.
/// assert_eq!(a.capacity(), capacity_before_clear);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>clear(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
<span class="self">self</span>.table.clear();
}
<span class="doccomment">/// Creates a consuming iterator visiting all the keys in arbitrary order.
/// The map cannot be used after calling this.
/// The iterator element type is `K`.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map = HashMap::new();
/// map.insert(&quot;a&quot;, 1);
/// map.insert(&quot;b&quot;, 2);
/// map.insert(&quot;c&quot;, 3);
///
/// let mut vec: Vec&lt;&amp;str&gt; = map.into_keys().collect();
///
/// // The `IntoKeys` iterator produces keys in arbitrary order, so the
/// // keys must be sorted to test them against a sorted array.
/// vec.sort_unstable();
/// assert_eq!(vec, [&quot;a&quot;, &quot;b&quot;, &quot;c&quot;]);
/// ```
</span><span class="attribute">#[inline]
</span><span class="kw">pub fn </span>into_keys(<span class="self">self</span>) -&gt; IntoKeys&lt;K, V, A&gt; {
IntoKeys {
inner: <span class="self">self</span>.into_iter(),
}
}
<span class="doccomment">/// Creates a consuming iterator visiting all the values in arbitrary order.
/// The map cannot be used after calling this.
/// The iterator element type is `V`.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map = HashMap::new();
/// map.insert(&quot;a&quot;, 1);
/// map.insert(&quot;b&quot;, 2);
/// map.insert(&quot;c&quot;, 3);
///
/// let mut vec: Vec&lt;i32&gt; = map.into_values().collect();
///
/// // The `IntoValues` iterator produces values in arbitrary order, so
/// // the values must be sorted to test them against a sorted array.
/// vec.sort_unstable();
/// assert_eq!(vec, [1, 2, 3]);
/// ```
</span><span class="attribute">#[inline]
</span><span class="kw">pub fn </span>into_values(<span class="self">self</span>) -&gt; IntoValues&lt;K, V, A&gt; {
IntoValues {
inner: <span class="self">self</span>.into_iter(),
}
}
}
<span class="kw">impl</span>&lt;K, V, S, A&gt; HashMap&lt;K, V, S, A&gt;
<span class="kw">where
</span>K: Eq + Hash,
S: BuildHasher,
A: Allocator + Clone,
{
<span class="doccomment">/// Reserves capacity for at least `additional` more elements to be inserted
/// in the `HashMap`. The collection may reserve more space to avoid
/// frequent reallocations.
///
/// # Panics
///
/// Panics if the new allocation size overflows [`usize`].
///
/// [`usize`]: https://doc.rust-lang.org/std/primitive.usize.html
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// let mut map: HashMap&lt;&amp;str, i32&gt; = HashMap::new();
/// // Map is empty and doesn&#39;t allocate memory
/// assert_eq!(map.capacity(), 0);
///
/// map.reserve(10);
///
/// // And now map can hold at least 10 elements
/// assert!(map.capacity() &gt;= 10);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>reserve(<span class="kw-2">&amp;mut </span><span class="self">self</span>, additional: usize) {
<span class="self">self</span>.table
.reserve(additional, make_hasher::&lt;K, <span class="kw">_</span>, V, S&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>.hash_builder));
}
<span class="doccomment">/// Tries to reserve capacity for at least `additional` more elements to be inserted
/// in the given `HashMap&lt;K,V&gt;`. The collection may reserve more space to avoid
/// frequent reallocations.
///
/// # Errors
///
/// If the capacity overflows, or the allocator reports a failure, then an error
/// is returned.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map: HashMap&lt;&amp;str, isize&gt; = HashMap::new();
/// // Map is empty and doesn&#39;t allocate memory
/// assert_eq!(map.capacity(), 0);
///
/// map.try_reserve(10).expect(&quot;why is the test harness OOMing on 10 bytes?&quot;);
///
/// // And now map can hold at least 10 elements
/// assert!(map.capacity() &gt;= 10);
/// ```
/// If the capacity overflows, or the allocator reports a failure, then an error
/// is returned:
/// ```
/// # fn test() {
/// use hashbrown::HashMap;
/// use hashbrown::TryReserveError;
/// let mut map: HashMap&lt;i32, i32&gt; = HashMap::new();
///
/// match map.try_reserve(usize::MAX) {
/// Err(error) =&gt; match error {
/// TryReserveError::CapacityOverflow =&gt; {}
/// _ =&gt; panic!(&quot;TryReserveError::AllocError ?&quot;),
/// },
/// _ =&gt; panic!(),
/// }
/// # }
/// # fn main() {
/// # #[cfg(not(miri))]
/// # test()
/// # }
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>try_reserve(<span class="kw-2">&amp;mut </span><span class="self">self</span>, additional: usize) -&gt; <span class="prelude-ty">Result</span>&lt;(), TryReserveError&gt; {
<span class="self">self</span>.table
.try_reserve(additional, make_hasher::&lt;K, <span class="kw">_</span>, V, S&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>.hash_builder))
}
<span class="doccomment">/// Shrinks the capacity of the map as much as possible. It will drop
/// down as much as possible while maintaining the internal rules
/// and possibly leaving some space in accordance with the resize policy.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map: HashMap&lt;i32, i32&gt; = HashMap::with_capacity(100);
/// map.insert(1, 2);
/// map.insert(3, 4);
/// assert!(map.capacity() &gt;= 100);
/// map.shrink_to_fit();
/// assert!(map.capacity() &gt;= 2);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>shrink_to_fit(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
<span class="self">self</span>.table
.shrink_to(<span class="number">0</span>, make_hasher::&lt;K, <span class="kw">_</span>, V, S&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>.hash_builder));
}
<span class="doccomment">/// Shrinks the capacity of the map with a lower limit. It will drop
/// down no lower than the supplied limit while maintaining the internal rules
/// and possibly leaving some space in accordance with the resize policy.
///
/// This function does nothing if the current capacity is smaller than the
/// supplied minimum capacity.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map: HashMap&lt;i32, i32&gt; = HashMap::with_capacity(100);
/// map.insert(1, 2);
/// map.insert(3, 4);
/// assert!(map.capacity() &gt;= 100);
/// map.shrink_to(10);
/// assert!(map.capacity() &gt;= 10);
/// map.shrink_to(0);
/// assert!(map.capacity() &gt;= 2);
/// map.shrink_to(10);
/// assert!(map.capacity() &gt;= 2);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>shrink_to(<span class="kw-2">&amp;mut </span><span class="self">self</span>, min_capacity: usize) {
<span class="self">self</span>.table
.shrink_to(min_capacity, make_hasher::&lt;K, <span class="kw">_</span>, V, S&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>.hash_builder));
}
<span class="doccomment">/// Gets the given key&#39;s corresponding entry in the map for in-place manipulation.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut letters = HashMap::new();
///
/// for ch in &quot;a short treatise on fungi&quot;.chars() {
/// let counter = letters.entry(ch).or_insert(0);
/// *counter += 1;
/// }
///
/// assert_eq!(letters[&amp;&#39;s&#39;], 2);
/// assert_eq!(letters[&amp;&#39;t&#39;], 3);
/// assert_eq!(letters[&amp;&#39;u&#39;], 1);
/// assert_eq!(letters.get(&amp;&#39;y&#39;), None);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>entry(<span class="kw-2">&amp;mut </span><span class="self">self</span>, key: K) -&gt; Entry&lt;<span class="lifetime">&#39;_</span>, K, V, S, A&gt; {
<span class="kw">let </span>hash = make_insert_hash::&lt;K, S&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>.hash_builder, <span class="kw-2">&amp;</span>key);
<span class="kw">if let </span><span class="prelude-val">Some</span>(elem) = <span class="self">self</span>.table.find(hash, equivalent_key(<span class="kw-2">&amp;</span>key)) {
Entry::Occupied(OccupiedEntry {
hash,
key: <span class="prelude-val">Some</span>(key),
elem,
table: <span class="self">self</span>,
})
} <span class="kw">else </span>{
Entry::Vacant(VacantEntry {
hash,
key,
table: <span class="self">self</span>,
})
}
}
<span class="doccomment">/// Gets the given key&#39;s corresponding entry by reference in the map for in-place manipulation.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut words: HashMap&lt;String, usize&gt; = HashMap::new();
/// let source = [&quot;poneyland&quot;, &quot;horseyland&quot;, &quot;poneyland&quot;, &quot;poneyland&quot;];
/// for (i, &amp;s) in source.iter().enumerate() {
/// let counter = words.entry_ref(s).or_insert(0);
/// *counter += 1;
/// }
///
/// assert_eq!(words[&quot;poneyland&quot;], 3);
/// assert_eq!(words[&quot;horseyland&quot;], 1);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>entry_ref&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;b</span>, Q: <span class="question-mark">?</span>Sized&gt;(<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span><span class="self">self</span>, key: <span class="kw-2">&amp;</span><span class="lifetime">&#39;b </span>Q) -&gt; EntryRef&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;b</span>, K, Q, V, S, A&gt;
<span class="kw">where
</span>K: Borrow&lt;Q&gt;,
Q: Hash + Eq,
{
<span class="kw">let </span>hash = make_hash::&lt;K, Q, S&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>.hash_builder, key);
<span class="kw">if let </span><span class="prelude-val">Some</span>(elem) = <span class="self">self</span>.table.find(hash, equivalent_key(key)) {
EntryRef::Occupied(OccupiedEntryRef {
hash,
key: <span class="prelude-val">Some</span>(KeyOrRef::Borrowed(key)),
elem,
table: <span class="self">self</span>,
})
} <span class="kw">else </span>{
EntryRef::Vacant(VacantEntryRef {
hash,
key: KeyOrRef::Borrowed(key),
table: <span class="self">self</span>,
})
}
}
<span class="doccomment">/// Returns a reference to the value corresponding to the key.
///
/// The key may be any borrowed form of the map&#39;s key type, but
/// [`Hash`] and [`Eq`] on the borrowed form *must* match those for
/// the key type.
///
/// [`Eq`]: https://doc.rust-lang.org/std/cmp/trait.Eq.html
/// [`Hash`]: https://doc.rust-lang.org/std/hash/trait.Hash.html
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map = HashMap::new();
/// map.insert(1, &quot;a&quot;);
/// assert_eq!(map.get(&amp;1), Some(&amp;&quot;a&quot;));
/// assert_eq!(map.get(&amp;2), None);
/// ```
</span><span class="attribute">#[inline]
</span><span class="kw">pub fn </span>get&lt;Q: <span class="question-mark">?</span>Sized&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, k: <span class="kw-2">&amp;</span>Q) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="kw-2">&amp;</span>V&gt;
<span class="kw">where
</span>K: Borrow&lt;Q&gt;,
Q: Hash + Eq,
{
<span class="comment">// Avoid `Option::map` because it bloats LLVM IR.
</span><span class="kw">match </span><span class="self">self</span>.get_inner(k) {
<span class="prelude-val">Some</span>(<span class="kw-2">&amp;</span>(<span class="kw">_</span>, <span class="kw-2">ref </span>v)) =&gt; <span class="prelude-val">Some</span>(v),
<span class="prelude-val">None </span>=&gt; <span class="prelude-val">None</span>,
}
}
<span class="doccomment">/// Returns the key-value pair corresponding to the supplied key.
///
/// The supplied key may be any borrowed form of the map&#39;s key type, but
/// [`Hash`] and [`Eq`] on the borrowed form *must* match those for
/// the key type.
///
/// [`Eq`]: https://doc.rust-lang.org/std/cmp/trait.Eq.html
/// [`Hash`]: https://doc.rust-lang.org/std/hash/trait.Hash.html
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map = HashMap::new();
/// map.insert(1, &quot;a&quot;);
/// assert_eq!(map.get_key_value(&amp;1), Some((&amp;1, &amp;&quot;a&quot;)));
/// assert_eq!(map.get_key_value(&amp;2), None);
/// ```
</span><span class="attribute">#[inline]
</span><span class="kw">pub fn </span>get_key_value&lt;Q: <span class="question-mark">?</span>Sized&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, k: <span class="kw-2">&amp;</span>Q) -&gt; <span class="prelude-ty">Option</span>&lt;(<span class="kw-2">&amp;</span>K, <span class="kw-2">&amp;</span>V)&gt;
<span class="kw">where
</span>K: Borrow&lt;Q&gt;,
Q: Hash + Eq,
{
<span class="comment">// Avoid `Option::map` because it bloats LLVM IR.
</span><span class="kw">match </span><span class="self">self</span>.get_inner(k) {
<span class="prelude-val">Some</span>(<span class="kw-2">&amp;</span>(<span class="kw-2">ref </span>key, <span class="kw-2">ref </span>value)) =&gt; <span class="prelude-val">Some</span>((key, value)),
<span class="prelude-val">None </span>=&gt; <span class="prelude-val">None</span>,
}
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>get_inner&lt;Q: <span class="question-mark">?</span>Sized&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, k: <span class="kw-2">&amp;</span>Q) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="kw-2">&amp;</span>(K, V)&gt;
<span class="kw">where
</span>K: Borrow&lt;Q&gt;,
Q: Hash + Eq,
{
<span class="kw">if </span><span class="self">self</span>.table.is_empty() {
<span class="prelude-val">None
</span>} <span class="kw">else </span>{
<span class="kw">let </span>hash = make_hash::&lt;K, Q, S&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>.hash_builder, k);
<span class="self">self</span>.table.get(hash, equivalent_key(k))
}
}
<span class="doccomment">/// Returns the key-value pair corresponding to the supplied key, with a mutable reference to value.
///
/// The supplied key may be any borrowed form of the map&#39;s key type, but
/// [`Hash`] and [`Eq`] on the borrowed form *must* match those for
/// the key type.
///
/// [`Eq`]: https://doc.rust-lang.org/std/cmp/trait.Eq.html
/// [`Hash`]: https://doc.rust-lang.org/std/hash/trait.Hash.html
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map = HashMap::new();
/// map.insert(1, &quot;a&quot;);
/// let (k, v) = map.get_key_value_mut(&amp;1).unwrap();
/// assert_eq!(k, &amp;1);
/// assert_eq!(v, &amp;mut &quot;a&quot;);
/// *v = &quot;b&quot;;
/// assert_eq!(map.get_key_value_mut(&amp;1), Some((&amp;1, &amp;mut &quot;b&quot;)));
/// assert_eq!(map.get_key_value_mut(&amp;2), None);
/// ```
</span><span class="attribute">#[inline]
</span><span class="kw">pub fn </span>get_key_value_mut&lt;Q: <span class="question-mark">?</span>Sized&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, k: <span class="kw-2">&amp;</span>Q) -&gt; <span class="prelude-ty">Option</span>&lt;(<span class="kw-2">&amp;</span>K, <span class="kw-2">&amp;mut </span>V)&gt;
<span class="kw">where
</span>K: Borrow&lt;Q&gt;,
Q: Hash + Eq,
{
<span class="comment">// Avoid `Option::map` because it bloats LLVM IR.
</span><span class="kw">match </span><span class="self">self</span>.get_inner_mut(k) {
<span class="prelude-val">Some</span>(<span class="kw-2">&amp;mut </span>(<span class="kw-2">ref </span>key, <span class="kw-2">ref mut </span>value)) =&gt; <span class="prelude-val">Some</span>((key, value)),
<span class="prelude-val">None </span>=&gt; <span class="prelude-val">None</span>,
}
}
<span class="doccomment">/// Returns `true` if the map contains a value for the specified key.
///
/// The key may be any borrowed form of the map&#39;s key type, but
/// [`Hash`] and [`Eq`] on the borrowed form *must* match those for
/// the key type.
///
/// [`Eq`]: https://doc.rust-lang.org/std/cmp/trait.Eq.html
/// [`Hash`]: https://doc.rust-lang.org/std/hash/trait.Hash.html
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map = HashMap::new();
/// map.insert(1, &quot;a&quot;);
/// assert_eq!(map.contains_key(&amp;1), true);
/// assert_eq!(map.contains_key(&amp;2), false);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>contains_key&lt;Q: <span class="question-mark">?</span>Sized&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, k: <span class="kw-2">&amp;</span>Q) -&gt; bool
<span class="kw">where
</span>K: Borrow&lt;Q&gt;,
Q: Hash + Eq,
{
<span class="self">self</span>.get_inner(k).is_some()
}
<span class="doccomment">/// Returns a mutable reference to the value corresponding to the key.
///
/// The key may be any borrowed form of the map&#39;s key type, but
/// [`Hash`] and [`Eq`] on the borrowed form *must* match those for
/// the key type.
///
/// [`Eq`]: https://doc.rust-lang.org/std/cmp/trait.Eq.html
/// [`Hash`]: https://doc.rust-lang.org/std/hash/trait.Hash.html
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map = HashMap::new();
/// map.insert(1, &quot;a&quot;);
/// if let Some(x) = map.get_mut(&amp;1) {
/// *x = &quot;b&quot;;
/// }
/// assert_eq!(map[&amp;1], &quot;b&quot;);
///
/// assert_eq!(map.get_mut(&amp;2), None);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>get_mut&lt;Q: <span class="question-mark">?</span>Sized&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, k: <span class="kw-2">&amp;</span>Q) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="kw-2">&amp;mut </span>V&gt;
<span class="kw">where
</span>K: Borrow&lt;Q&gt;,
Q: Hash + Eq,
{
<span class="comment">// Avoid `Option::map` because it bloats LLVM IR.
</span><span class="kw">match </span><span class="self">self</span>.get_inner_mut(k) {
<span class="prelude-val">Some</span>(<span class="kw-2">&amp;mut </span>(<span class="kw">_</span>, <span class="kw-2">ref mut </span>v)) =&gt; <span class="prelude-val">Some</span>(v),
<span class="prelude-val">None </span>=&gt; <span class="prelude-val">None</span>,
}
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>get_inner_mut&lt;Q: <span class="question-mark">?</span>Sized&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, k: <span class="kw-2">&amp;</span>Q) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="kw-2">&amp;mut </span>(K, V)&gt;
<span class="kw">where
</span>K: Borrow&lt;Q&gt;,
Q: Hash + Eq,
{
<span class="kw">if </span><span class="self">self</span>.table.is_empty() {
<span class="prelude-val">None
</span>} <span class="kw">else </span>{
<span class="kw">let </span>hash = make_hash::&lt;K, Q, S&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>.hash_builder, k);
<span class="self">self</span>.table.get_mut(hash, equivalent_key(k))
}
}
<span class="doccomment">/// Attempts to get mutable references to `N` values in the map at once.
///
/// Returns an array of length `N` with the results of each query. For soundness, at most one
/// mutable reference will be returned to any value. `None` will be returned if any of the
/// keys are duplicates or missing.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut libraries = HashMap::new();
/// libraries.insert(&quot;Bodleian Library&quot;.to_string(), 1602);
/// libraries.insert(&quot;Athenæum&quot;.to_string(), 1807);
/// libraries.insert(&quot;Herzogin-Anna-Amalia-Bibliothek&quot;.to_string(), 1691);
/// libraries.insert(&quot;Library of Congress&quot;.to_string(), 1800);
///
/// let got = libraries.get_many_mut([
/// &quot;Athenæum&quot;,
/// &quot;Library of Congress&quot;,
/// ]);
/// assert_eq!(
/// got,
/// Some([
/// &amp;mut 1807,
/// &amp;mut 1800,
/// ]),
/// );
///
/// // Missing keys result in None
/// let got = libraries.get_many_mut([
/// &quot;Athenæum&quot;,
/// &quot;New York Public Library&quot;,
/// ]);
/// assert_eq!(got, None);
///
/// // Duplicate keys result in None
/// let got = libraries.get_many_mut([
/// &quot;Athenæum&quot;,
/// &quot;Athenæum&quot;,
/// ]);
/// assert_eq!(got, None);
/// ```
</span><span class="kw">pub fn </span>get_many_mut&lt;Q: <span class="question-mark">?</span>Sized, <span class="kw">const </span>N: usize&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, ks: [<span class="kw-2">&amp;</span>Q; N]) -&gt; <span class="prelude-ty">Option</span>&lt;[<span class="kw-2">&amp;</span><span class="lifetime">&#39;_ </span><span class="kw-2">mut </span>V; N]&gt;
<span class="kw">where
</span>K: Borrow&lt;Q&gt;,
Q: Hash + Eq,
{
<span class="self">self</span>.get_many_mut_inner(ks).map(|res| res.map(|(<span class="kw">_</span>, v)| v))
}
<span class="doccomment">/// Attempts to get mutable references to `N` values in the map at once, without validating that
/// the values are unique.
///
/// Returns an array of length `N` with the results of each query. `None` will be returned if
/// any of the keys are missing.
///
/// For a safe alternative see [`get_many_mut`](`HashMap::get_many_mut`).
///
/// # Safety
///
/// Calling this method with overlapping keys is *[undefined behavior]* even if the resulting
/// references are not used.
///
/// [undefined behavior]: https://doc.rust-lang.org/reference/behavior-considered-undefined.html
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut libraries = HashMap::new();
/// libraries.insert(&quot;Bodleian Library&quot;.to_string(), 1602);
/// libraries.insert(&quot;Athenæum&quot;.to_string(), 1807);
/// libraries.insert(&quot;Herzogin-Anna-Amalia-Bibliothek&quot;.to_string(), 1691);
/// libraries.insert(&quot;Library of Congress&quot;.to_string(), 1800);
///
/// let got = libraries.get_many_mut([
/// &quot;Athenæum&quot;,
/// &quot;Library of Congress&quot;,
/// ]);
/// assert_eq!(
/// got,
/// Some([
/// &amp;mut 1807,
/// &amp;mut 1800,
/// ]),
/// );
///
/// // Missing keys result in None
/// let got = libraries.get_many_mut([
/// &quot;Athenæum&quot;,
/// &quot;New York Public Library&quot;,
/// ]);
/// assert_eq!(got, None);
/// ```
</span><span class="kw">pub unsafe fn </span>get_many_unchecked_mut&lt;Q: <span class="question-mark">?</span>Sized, <span class="kw">const </span>N: usize&gt;(
<span class="kw-2">&amp;mut </span><span class="self">self</span>,
ks: [<span class="kw-2">&amp;</span>Q; N],
) -&gt; <span class="prelude-ty">Option</span>&lt;[<span class="kw-2">&amp;</span><span class="lifetime">&#39;_ </span><span class="kw-2">mut </span>V; N]&gt;
<span class="kw">where
</span>K: Borrow&lt;Q&gt;,
Q: Hash + Eq,
{
<span class="self">self</span>.get_many_unchecked_mut_inner(ks)
.map(|res| res.map(|(<span class="kw">_</span>, v)| v))
}
<span class="doccomment">/// Attempts to get mutable references to `N` values in the map at once, with immutable
/// references to the corresponding keys.
///
/// Returns an array of length `N` with the results of each query. For soundness, at most one
/// mutable reference will be returned to any value. `None` will be returned if any of the keys
/// are duplicates or missing.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut libraries = HashMap::new();
/// libraries.insert(&quot;Bodleian Library&quot;.to_string(), 1602);
/// libraries.insert(&quot;Athenæum&quot;.to_string(), 1807);
/// libraries.insert(&quot;Herzogin-Anna-Amalia-Bibliothek&quot;.to_string(), 1691);
/// libraries.insert(&quot;Library of Congress&quot;.to_string(), 1800);
///
/// let got = libraries.get_many_key_value_mut([
/// &quot;Bodleian Library&quot;,
/// &quot;Herzogin-Anna-Amalia-Bibliothek&quot;,
/// ]);
/// assert_eq!(
/// got,
/// Some([
/// (&amp;&quot;Bodleian Library&quot;.to_string(), &amp;mut 1602),
/// (&amp;&quot;Herzogin-Anna-Amalia-Bibliothek&quot;.to_string(), &amp;mut 1691),
/// ]),
/// );
/// // Missing keys result in None
/// let got = libraries.get_many_key_value_mut([
/// &quot;Bodleian Library&quot;,
/// &quot;Gewandhaus&quot;,
/// ]);
/// assert_eq!(got, None);
///
/// // Duplicate keys result in None
/// let got = libraries.get_many_key_value_mut([
/// &quot;Bodleian Library&quot;,
/// &quot;Herzogin-Anna-Amalia-Bibliothek&quot;,
/// &quot;Herzogin-Anna-Amalia-Bibliothek&quot;,
/// ]);
/// assert_eq!(got, None);
/// ```
</span><span class="kw">pub fn </span>get_many_key_value_mut&lt;Q: <span class="question-mark">?</span>Sized, <span class="kw">const </span>N: usize&gt;(
<span class="kw-2">&amp;mut </span><span class="self">self</span>,
ks: [<span class="kw-2">&amp;</span>Q; N],
) -&gt; <span class="prelude-ty">Option</span>&lt;[(<span class="kw-2">&amp;</span><span class="lifetime">&#39;_ </span>K, <span class="kw-2">&amp;</span><span class="lifetime">&#39;_ </span><span class="kw-2">mut </span>V); N]&gt;
<span class="kw">where
</span>K: Borrow&lt;Q&gt;,
Q: Hash + Eq,
{
<span class="self">self</span>.get_many_mut_inner(ks)
.map(|res| res.map(|(k, v)| (<span class="kw-2">&amp;*</span>k, v)))
}
<span class="doccomment">/// Attempts to get mutable references to `N` values in the map at once, with immutable
/// references to the corresponding keys, without validating that the values are unique.
///
/// Returns an array of length `N` with the results of each query. `None` will be returned if
/// any of the keys are missing.
///
/// For a safe alternative see [`get_many_key_value_mut`](`HashMap::get_many_key_value_mut`).
///
/// # Safety
///
/// Calling this method with overlapping keys is *[undefined behavior]* even if the resulting
/// references are not used.
///
/// [undefined behavior]: https://doc.rust-lang.org/reference/behavior-considered-undefined.html
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut libraries = HashMap::new();
/// libraries.insert(&quot;Bodleian Library&quot;.to_string(), 1602);
/// libraries.insert(&quot;Athenæum&quot;.to_string(), 1807);
/// libraries.insert(&quot;Herzogin-Anna-Amalia-Bibliothek&quot;.to_string(), 1691);
/// libraries.insert(&quot;Library of Congress&quot;.to_string(), 1800);
///
/// let got = libraries.get_many_key_value_mut([
/// &quot;Bodleian Library&quot;,
/// &quot;Herzogin-Anna-Amalia-Bibliothek&quot;,
/// ]);
/// assert_eq!(
/// got,
/// Some([
/// (&amp;&quot;Bodleian Library&quot;.to_string(), &amp;mut 1602),
/// (&amp;&quot;Herzogin-Anna-Amalia-Bibliothek&quot;.to_string(), &amp;mut 1691),
/// ]),
/// );
/// // Missing keys result in None
/// let got = libraries.get_many_key_value_mut([
/// &quot;Bodleian Library&quot;,
/// &quot;Gewandhaus&quot;,
/// ]);
/// assert_eq!(got, None);
/// ```
</span><span class="kw">pub unsafe fn </span>get_many_key_value_unchecked_mut&lt;Q: <span class="question-mark">?</span>Sized, <span class="kw">const </span>N: usize&gt;(
<span class="kw-2">&amp;mut </span><span class="self">self</span>,
ks: [<span class="kw-2">&amp;</span>Q; N],
) -&gt; <span class="prelude-ty">Option</span>&lt;[(<span class="kw-2">&amp;</span><span class="lifetime">&#39;_ </span>K, <span class="kw-2">&amp;</span><span class="lifetime">&#39;_ </span><span class="kw-2">mut </span>V); N]&gt;
<span class="kw">where
</span>K: Borrow&lt;Q&gt;,
Q: Hash + Eq,
{
<span class="self">self</span>.get_many_unchecked_mut_inner(ks)
.map(|res| res.map(|(k, v)| (<span class="kw-2">&amp;*</span>k, v)))
}
<span class="kw">fn </span>get_many_mut_inner&lt;Q: <span class="question-mark">?</span>Sized, <span class="kw">const </span>N: usize&gt;(
<span class="kw-2">&amp;mut </span><span class="self">self</span>,
ks: [<span class="kw-2">&amp;</span>Q; N],
) -&gt; <span class="prelude-ty">Option</span>&lt;[<span class="kw-2">&amp;</span><span class="lifetime">&#39;_ </span><span class="kw-2">mut </span>(K, V); N]&gt;
<span class="kw">where
</span>K: Borrow&lt;Q&gt;,
Q: Hash + Eq,
{
<span class="kw">let </span>hashes = <span class="self">self</span>.build_hashes_inner(ks);
<span class="self">self</span>.table
.get_many_mut(hashes, |i, (k, <span class="kw">_</span>)| ks[i].eq(k.borrow()))
}
<span class="kw">unsafe fn </span>get_many_unchecked_mut_inner&lt;Q: <span class="question-mark">?</span>Sized, <span class="kw">const </span>N: usize&gt;(
<span class="kw-2">&amp;mut </span><span class="self">self</span>,
ks: [<span class="kw-2">&amp;</span>Q; N],
) -&gt; <span class="prelude-ty">Option</span>&lt;[<span class="kw-2">&amp;</span><span class="lifetime">&#39;_ </span><span class="kw-2">mut </span>(K, V); N]&gt;
<span class="kw">where
</span>K: Borrow&lt;Q&gt;,
Q: Hash + Eq,
{
<span class="kw">let </span>hashes = <span class="self">self</span>.build_hashes_inner(ks);
<span class="self">self</span>.table
.get_many_unchecked_mut(hashes, |i, (k, <span class="kw">_</span>)| ks[i].eq(k.borrow()))
}
<span class="kw">fn </span>build_hashes_inner&lt;Q: <span class="question-mark">?</span>Sized, <span class="kw">const </span>N: usize&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, ks: [<span class="kw-2">&amp;</span>Q; N]) -&gt; [u64; N]
<span class="kw">where
</span>K: Borrow&lt;Q&gt;,
Q: Hash + Eq,
{
<span class="kw">let </span><span class="kw-2">mut </span>hashes = [<span class="number">0_u64</span>; N];
<span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..N {
hashes[i] = make_hash::&lt;K, Q, S&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>.hash_builder, ks[i]);
}
hashes
}
<span class="doccomment">/// Inserts a key-value pair into the map.
///
/// If the map did not have this key present, [`None`] is returned.
///
/// If the map did have this key present, the value is updated, and the old
/// value is returned. The key is not updated, though; this matters for
/// types that can be `==` without being identical. See the [`std::collections`]
/// [module-level documentation] for more.
///
/// [`None`]: https://doc.rust-lang.org/std/option/enum.Option.html#variant.None
/// [`std::collections`]: https://doc.rust-lang.org/std/collections/index.html
/// [module-level documentation]: https://doc.rust-lang.org/std/collections/index.html#insert-and-complex-keys
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map = HashMap::new();
/// assert_eq!(map.insert(37, &quot;a&quot;), None);
/// assert_eq!(map.is_empty(), false);
///
/// map.insert(37, &quot;b&quot;);
/// assert_eq!(map.insert(37, &quot;c&quot;), Some(&quot;b&quot;));
/// assert_eq!(map[&amp;37], &quot;c&quot;);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>insert(<span class="kw-2">&amp;mut </span><span class="self">self</span>, k: K, v: V) -&gt; <span class="prelude-ty">Option</span>&lt;V&gt; {
<span class="kw">let </span>hash = make_insert_hash::&lt;K, S&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>.hash_builder, <span class="kw-2">&amp;</span>k);
<span class="kw">if let </span><span class="prelude-val">Some</span>((<span class="kw">_</span>, item)) = <span class="self">self</span>.table.get_mut(hash, equivalent_key(<span class="kw-2">&amp;</span>k)) {
<span class="prelude-val">Some</span>(mem::replace(item, v))
} <span class="kw">else </span>{
<span class="self">self</span>.table
.insert(hash, (k, v), make_hasher::&lt;K, <span class="kw">_</span>, V, S&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>.hash_builder));
<span class="prelude-val">None
</span>}
}
<span class="doccomment">/// Insert a key-value pair into the map without checking
/// if the key already exists in the map.
///
/// Returns a reference to the key and value just inserted.
///
/// This operation is safe if a key does not exist in the map.
///
/// However, if a key exists in the map already, the behavior is unspecified:
/// this operation may panic, loop forever, or any following operation with the map
/// may panic, loop forever or return arbitrary result.
///
/// That said, this operation (and following operations) are guaranteed to
/// not violate memory safety.
///
/// This operation is faster than regular insert, because it does not perform
/// lookup before insertion.
///
/// This operation is useful during initial population of the map.
/// For example, when constructing a map from another map, we know
/// that keys are unique.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map1 = HashMap::new();
/// assert_eq!(map1.insert(1, &quot;a&quot;), None);
/// assert_eq!(map1.insert(2, &quot;b&quot;), None);
/// assert_eq!(map1.insert(3, &quot;c&quot;), None);
/// assert_eq!(map1.len(), 3);
///
/// let mut map2 = HashMap::new();
///
/// for (key, value) in map1.into_iter() {
/// map2.insert_unique_unchecked(key, value);
/// }
///
/// let (key, value) = map2.insert_unique_unchecked(4, &quot;d&quot;);
/// assert_eq!(key, &amp;4);
/// assert_eq!(value, &amp;mut &quot;d&quot;);
/// *value = &quot;e&quot;;
///
/// assert_eq!(map2[&amp;1], &quot;a&quot;);
/// assert_eq!(map2[&amp;2], &quot;b&quot;);
/// assert_eq!(map2[&amp;3], &quot;c&quot;);
/// assert_eq!(map2[&amp;4], &quot;e&quot;);
/// assert_eq!(map2.len(), 4);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>insert_unique_unchecked(<span class="kw-2">&amp;mut </span><span class="self">self</span>, k: K, v: V) -&gt; (<span class="kw-2">&amp;</span>K, <span class="kw-2">&amp;mut </span>V) {
<span class="kw">let </span>hash = make_insert_hash::&lt;K, S&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>.hash_builder, <span class="kw-2">&amp;</span>k);
<span class="kw">let </span>bucket = <span class="self">self
</span>.table
.insert(hash, (k, v), make_hasher::&lt;K, <span class="kw">_</span>, V, S&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>.hash_builder));
<span class="kw">let </span>(k_ref, v_ref) = <span class="kw">unsafe </span>{ bucket.as_mut() };
(k_ref, v_ref)
}
<span class="doccomment">/// Tries to insert a key-value pair into the map, and returns
/// a mutable reference to the value in the entry.
///
/// # Errors
///
/// If the map already had this key present, nothing is updated, and
/// an error containing the occupied entry and the value is returned.
///
/// # Examples
///
/// Basic usage:
///
/// ```
/// use hashbrown::HashMap;
/// use hashbrown::hash_map::OccupiedError;
///
/// let mut map = HashMap::new();
/// assert_eq!(map.try_insert(37, &quot;a&quot;).unwrap(), &amp;&quot;a&quot;);
///
/// match map.try_insert(37, &quot;b&quot;) {
/// Err(OccupiedError { entry, value }) =&gt; {
/// assert_eq!(entry.key(), &amp;37);
/// assert_eq!(entry.get(), &amp;&quot;a&quot;);
/// assert_eq!(value, &quot;b&quot;);
/// }
/// _ =&gt; panic!()
/// }
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>try_insert(
<span class="kw-2">&amp;mut </span><span class="self">self</span>,
key: K,
value: V,
) -&gt; <span class="prelude-ty">Result</span>&lt;<span class="kw-2">&amp;mut </span>V, OccupiedError&lt;<span class="lifetime">&#39;_</span>, K, V, S, A&gt;&gt; {
<span class="kw">match </span><span class="self">self</span>.entry(key) {
Entry::Occupied(entry) =&gt; <span class="prelude-val">Err</span>(OccupiedError { entry, value }),
Entry::Vacant(entry) =&gt; <span class="prelude-val">Ok</span>(entry.insert(value)),
}
}
<span class="doccomment">/// Removes a key from the map, returning the value at the key if the key
/// was previously in the map. Keeps the allocated memory for reuse.
///
/// The key may be any borrowed form of the map&#39;s key type, but
/// [`Hash`] and [`Eq`] on the borrowed form *must* match those for
/// the key type.
///
/// [`Eq`]: https://doc.rust-lang.org/std/cmp/trait.Eq.html
/// [`Hash`]: https://doc.rust-lang.org/std/hash/trait.Hash.html
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map = HashMap::new();
/// // The map is empty
/// assert!(map.is_empty() &amp;&amp; map.capacity() == 0);
///
/// map.insert(1, &quot;a&quot;);
/// let capacity_before_remove = map.capacity();
///
/// assert_eq!(map.remove(&amp;1), Some(&quot;a&quot;));
/// assert_eq!(map.remove(&amp;1), None);
///
/// // Now map holds none elements but capacity is equal to the old one
/// assert!(map.len() == 0 &amp;&amp; map.capacity() == capacity_before_remove);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>remove&lt;Q: <span class="question-mark">?</span>Sized&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, k: <span class="kw-2">&amp;</span>Q) -&gt; <span class="prelude-ty">Option</span>&lt;V&gt;
<span class="kw">where
</span>K: Borrow&lt;Q&gt;,
Q: Hash + Eq,
{
<span class="comment">// Avoid `Option::map` because it bloats LLVM IR.
</span><span class="kw">match </span><span class="self">self</span>.remove_entry(k) {
<span class="prelude-val">Some</span>((<span class="kw">_</span>, v)) =&gt; <span class="prelude-val">Some</span>(v),
<span class="prelude-val">None </span>=&gt; <span class="prelude-val">None</span>,
}
}
<span class="doccomment">/// Removes a key from the map, returning the stored key and value if the
/// key was previously in the map. Keeps the allocated memory for reuse.
///
/// The key may be any borrowed form of the map&#39;s key type, but
/// [`Hash`] and [`Eq`] on the borrowed form *must* match those for
/// the key type.
///
/// [`Eq`]: https://doc.rust-lang.org/std/cmp/trait.Eq.html
/// [`Hash`]: https://doc.rust-lang.org/std/hash/trait.Hash.html
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map = HashMap::new();
/// // The map is empty
/// assert!(map.is_empty() &amp;&amp; map.capacity() == 0);
///
/// map.insert(1, &quot;a&quot;);
/// let capacity_before_remove = map.capacity();
///
/// assert_eq!(map.remove_entry(&amp;1), Some((1, &quot;a&quot;)));
/// assert_eq!(map.remove(&amp;1), None);
///
/// // Now map hold none elements but capacity is equal to the old one
/// assert!(map.len() == 0 &amp;&amp; map.capacity() == capacity_before_remove);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>remove_entry&lt;Q: <span class="question-mark">?</span>Sized&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, k: <span class="kw-2">&amp;</span>Q) -&gt; <span class="prelude-ty">Option</span>&lt;(K, V)&gt;
<span class="kw">where
</span>K: Borrow&lt;Q&gt;,
Q: Hash + Eq,
{
<span class="kw">let </span>hash = make_hash::&lt;K, Q, S&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>.hash_builder, k);
<span class="self">self</span>.table.remove_entry(hash, equivalent_key(k))
}
}
<span class="kw">impl</span>&lt;K, V, S, A: Allocator + Clone&gt; HashMap&lt;K, V, S, A&gt; {
<span class="doccomment">/// Creates a raw entry builder for the HashMap.
///
/// Raw entries provide the lowest level of control for searching and
/// manipulating a map. They must be manually initialized with a hash and
/// then manually searched. After this, insertions into a vacant entry
/// still require an owned key to be provided.
///
/// Raw entries are useful for such exotic situations as:
///
/// * Hash memoization
/// * Deferring the creation of an owned key until it is known to be required
/// * Using a search key that doesn&#39;t work with the Borrow trait
/// * Using custom comparison logic without newtype wrappers
///
/// Because raw entries provide much more low-level control, it&#39;s much easier
/// to put the HashMap into an inconsistent state which, while memory-safe,
/// will cause the map to produce seemingly random results. Higher-level and
/// more foolproof APIs like `entry` should be preferred when possible.
///
/// In particular, the hash used to initialized the raw entry must still be
/// consistent with the hash of the key that is ultimately stored in the entry.
/// This is because implementations of HashMap may need to recompute hashes
/// when resizing, at which point only the keys are available.
///
/// Raw entries give mutable access to the keys. This must not be used
/// to modify how the key would compare or hash, as the map will not re-evaluate
/// where the key should go, meaning the keys may become &quot;lost&quot; if their
/// location does not reflect their state. For instance, if you change a key
/// so that the map now contains keys which compare equal, search may start
/// acting erratically, with two keys randomly masking each other. Implementations
/// are free to assume this doesn&#39;t happen (within the limits of memory-safety).
///
/// # Examples
///
/// ```
/// use core::hash::{BuildHasher, Hash};
/// use hashbrown::hash_map::{HashMap, RawEntryMut};
///
/// let mut map = HashMap::new();
/// map.extend([(&quot;a&quot;, 100), (&quot;b&quot;, 200), (&quot;c&quot;, 300)]);
///
/// fn compute_hash&lt;K: Hash + ?Sized, S: BuildHasher&gt;(hash_builder: &amp;S, key: &amp;K) -&gt; u64 {
/// use core::hash::Hasher;
/// let mut state = hash_builder.build_hasher();
/// key.hash(&amp;mut state);
/// state.finish()
/// }
///
/// // Existing key (insert and update)
/// match map.raw_entry_mut().from_key(&amp;&quot;a&quot;) {
/// RawEntryMut::Vacant(_) =&gt; unreachable!(),
/// RawEntryMut::Occupied(mut view) =&gt; {
/// assert_eq!(view.get(), &amp;100);
/// let v = view.get_mut();
/// let new_v = (*v) * 10;
/// *v = new_v;
/// assert_eq!(view.insert(1111), 1000);
/// }
/// }
///
/// assert_eq!(map[&amp;&quot;a&quot;], 1111);
/// assert_eq!(map.len(), 3);
///
/// // Existing key (take)
/// let hash = compute_hash(map.hasher(), &amp;&quot;c&quot;);
/// match map.raw_entry_mut().from_key_hashed_nocheck(hash, &amp;&quot;c&quot;) {
/// RawEntryMut::Vacant(_) =&gt; unreachable!(),
/// RawEntryMut::Occupied(view) =&gt; {
/// assert_eq!(view.remove_entry(), (&quot;c&quot;, 300));
/// }
/// }
/// assert_eq!(map.raw_entry().from_key(&amp;&quot;c&quot;), None);
/// assert_eq!(map.len(), 2);
///
/// // Nonexistent key (insert and update)
/// let key = &quot;d&quot;;
/// let hash = compute_hash(map.hasher(), &amp;key);
/// match map.raw_entry_mut().from_hash(hash, |q| *q == key) {
/// RawEntryMut::Occupied(_) =&gt; unreachable!(),
/// RawEntryMut::Vacant(view) =&gt; {
/// let (k, value) = view.insert(&quot;d&quot;, 4000);
/// assert_eq!((*k, *value), (&quot;d&quot;, 4000));
/// *value = 40000;
/// }
/// }
/// assert_eq!(map[&amp;&quot;d&quot;], 40000);
/// assert_eq!(map.len(), 3);
///
/// match map.raw_entry_mut().from_hash(hash, |q| *q == key) {
/// RawEntryMut::Vacant(_) =&gt; unreachable!(),
/// RawEntryMut::Occupied(view) =&gt; {
/// assert_eq!(view.remove_entry(), (&quot;d&quot;, 40000));
/// }
/// }
/// assert_eq!(map.get(&amp;&quot;d&quot;), None);
/// assert_eq!(map.len(), 2);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>raw_entry_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; RawEntryBuilderMut&lt;<span class="lifetime">&#39;_</span>, K, V, S, A&gt; {
RawEntryBuilderMut { map: <span class="self">self </span>}
}
<span class="doccomment">/// Creates a raw immutable entry builder for the HashMap.
///
/// Raw entries provide the lowest level of control for searching and
/// manipulating a map. They must be manually initialized with a hash and
/// then manually searched.
///
/// This is useful for
/// * Hash memoization
/// * Using a search key that doesn&#39;t work with the Borrow trait
/// * Using custom comparison logic without newtype wrappers
///
/// Unless you are in such a situation, higher-level and more foolproof APIs like
/// `get` should be preferred.
///
/// Immutable raw entries have very limited use; you might instead want `raw_entry_mut`.
///
/// # Examples
///
/// ```
/// use core::hash::{BuildHasher, Hash};
/// use hashbrown::HashMap;
///
/// let mut map = HashMap::new();
/// map.extend([(&quot;a&quot;, 100), (&quot;b&quot;, 200), (&quot;c&quot;, 300)]);
///
/// fn compute_hash&lt;K: Hash + ?Sized, S: BuildHasher&gt;(hash_builder: &amp;S, key: &amp;K) -&gt; u64 {
/// use core::hash::Hasher;
/// let mut state = hash_builder.build_hasher();
/// key.hash(&amp;mut state);
/// state.finish()
/// }
///
/// for k in [&quot;a&quot;, &quot;b&quot;, &quot;c&quot;, &quot;d&quot;, &quot;e&quot;, &quot;f&quot;] {
/// let hash = compute_hash(map.hasher(), k);
/// let v = map.get(&amp;k).cloned();
/// let kv = v.as_ref().map(|v| (&amp;k, v));
///
/// println!(&quot;Key: {} and value: {:?}&quot;, k, v);
///
/// assert_eq!(map.raw_entry().from_key(&amp;k), kv);
/// assert_eq!(map.raw_entry().from_hash(hash, |q| *q == k), kv);
/// assert_eq!(map.raw_entry().from_key_hashed_nocheck(hash, &amp;k), kv);
/// }
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>raw_entry(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; RawEntryBuilder&lt;<span class="lifetime">&#39;_</span>, K, V, S, A&gt; {
RawEntryBuilder { map: <span class="self">self </span>}
}
<span class="doccomment">/// Returns a mutable reference to the [`RawTable`] used underneath [`HashMap`].
/// This function is only available if the `raw` feature of the crate is enabled.
///
/// # Note
///
/// Calling the function safe, but using raw hash table API&#39;s may require
/// unsafe functions or blocks.
///
/// `RawTable` API gives the lowest level of control under the map that can be useful
/// for extending the HashMap&#39;s API, but may lead to *[undefined behavior]*.
///
/// [`HashMap`]: struct.HashMap.html
/// [`RawTable`]: raw/struct.RawTable.html
/// [undefined behavior]: https://doc.rust-lang.org/reference/behavior-considered-undefined.html
///
/// # Examples
///
/// ```
/// use core::hash::{BuildHasher, Hash};
/// use hashbrown::HashMap;
///
/// let mut map = HashMap::new();
/// map.extend([(&quot;a&quot;, 10), (&quot;b&quot;, 20), (&quot;c&quot;, 30)]);
/// assert_eq!(map.len(), 3);
///
/// // Let&#39;s imagine that we have a value and a hash of the key, but not the key itself.
/// // However, if you want to remove the value from the map by hash and value, and you
/// // know exactly that the value is unique, then you can create a function like this:
/// fn remove_by_hash&lt;K, V, S, F&gt;(
/// map: &amp;mut HashMap&lt;K, V, S&gt;,
/// hash: u64,
/// is_match: F,
/// ) -&gt; Option&lt;(K, V)&gt;
/// where
/// F: Fn(&amp;(K, V)) -&gt; bool,
/// {
/// let raw_table = map.raw_table();
/// match raw_table.find(hash, is_match) {
/// Some(bucket) =&gt; Some(unsafe { raw_table.remove(bucket) }),
/// None =&gt; None,
/// }
/// }
///
/// fn compute_hash&lt;K: Hash + ?Sized, S: BuildHasher&gt;(hash_builder: &amp;S, key: &amp;K) -&gt; u64 {
/// use core::hash::Hasher;
/// let mut state = hash_builder.build_hasher();
/// key.hash(&amp;mut state);
/// state.finish()
/// }
///
/// let hash = compute_hash(map.hasher(), &quot;a&quot;);
/// assert_eq!(remove_by_hash(&amp;mut map, hash, |(_, v)| *v == 10), Some((&quot;a&quot;, 10)));
/// assert_eq!(map.get(&amp;&quot;a&quot;), None);
/// assert_eq!(map.len(), 2);
/// ```
</span><span class="attribute">#[cfg(feature = <span class="string">&quot;raw&quot;</span>)]
#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>raw_table(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;mut </span>RawTable&lt;(K, V), A&gt; {
<span class="kw-2">&amp;mut </span><span class="self">self</span>.table
}
}
<span class="kw">impl</span>&lt;K, V, S, A&gt; PartialEq <span class="kw">for </span>HashMap&lt;K, V, S, A&gt;
<span class="kw">where
</span>K: Eq + Hash,
V: PartialEq,
S: BuildHasher,
A: Allocator + Clone,
{
<span class="kw">fn </span>eq(<span class="kw-2">&amp;</span><span class="self">self</span>, other: <span class="kw-2">&amp;</span><span class="self">Self</span>) -&gt; bool {
<span class="kw">if </span><span class="self">self</span>.len() != other.len() {
<span class="kw">return </span><span class="bool-val">false</span>;
}
<span class="self">self</span>.iter()
.all(|(key, value)| other.get(key).map_or(<span class="bool-val">false</span>, |v| <span class="kw-2">*</span>value == <span class="kw-2">*</span>v))
}
}
<span class="kw">impl</span>&lt;K, V, S, A&gt; Eq <span class="kw">for </span>HashMap&lt;K, V, S, A&gt;
<span class="kw">where
</span>K: Eq + Hash,
V: Eq,
S: BuildHasher,
A: Allocator + Clone,
{
}
<span class="kw">impl</span>&lt;K, V, S, A&gt; Debug <span class="kw">for </span>HashMap&lt;K, V, S, A&gt;
<span class="kw">where
</span>K: Debug,
V: Debug,
A: Allocator + Clone,
{
<span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>fmt::Formatter&lt;<span class="lifetime">&#39;_</span>&gt;) -&gt; fmt::Result {
f.debug_map().entries(<span class="self">self</span>.iter()).finish()
}
}
<span class="kw">impl</span>&lt;K, V, S, A&gt; Default <span class="kw">for </span>HashMap&lt;K, V, S, A&gt;
<span class="kw">where
</span>S: Default,
A: Default + Allocator + Clone,
{
<span class="doccomment">/// Creates an empty `HashMap&lt;K, V, S, A&gt;`, with the `Default` value for the hasher and allocator.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// use std::collections::hash_map::RandomState;
///
/// // You can specify all types of HashMap, including hasher and allocator.
/// // Created map is empty and don&#39;t allocate memory
/// let map: HashMap&lt;u32, String&gt; = Default::default();
/// assert_eq!(map.capacity(), 0);
/// let map: HashMap&lt;u32, String, RandomState&gt; = HashMap::default();
/// assert_eq!(map.capacity(), 0);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>default() -&gt; <span class="self">Self </span>{
<span class="self">Self</span>::with_hasher_in(Default::default(), Default::default())
}
}
<span class="kw">impl</span>&lt;K, Q: <span class="question-mark">?</span>Sized, V, S, A&gt; Index&lt;<span class="kw-2">&amp;</span>Q&gt; <span class="kw">for </span>HashMap&lt;K, V, S, A&gt;
<span class="kw">where
</span>K: Eq + Hash + Borrow&lt;Q&gt;,
Q: Eq + Hash,
S: BuildHasher,
A: Allocator + Clone,
{
<span class="kw">type </span>Output = V;
<span class="doccomment">/// Returns a reference to the value corresponding to the supplied key.
///
/// # Panics
///
/// Panics if the key is not present in the `HashMap`.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let map: HashMap&lt;_, _&gt; = [(&quot;a&quot;, &quot;One&quot;), (&quot;b&quot;, &quot;Two&quot;)].into();
///
/// assert_eq!(map[&amp;&quot;a&quot;], &quot;One&quot;);
/// assert_eq!(map[&amp;&quot;b&quot;], &quot;Two&quot;);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>index(<span class="kw-2">&amp;</span><span class="self">self</span>, key: <span class="kw-2">&amp;</span>Q) -&gt; <span class="kw-2">&amp;</span>V {
<span class="self">self</span>.get(key).expect(<span class="string">&quot;no entry found for key&quot;</span>)
}
}
<span class="comment">// The default hasher is used to match the std implementation signature
</span><span class="attribute">#[cfg(feature = <span class="string">&quot;ahash&quot;</span>)]
</span><span class="kw">impl</span>&lt;K, V, A, <span class="kw">const </span>N: usize&gt; From&lt;[(K, V); N]&gt; <span class="kw">for </span>HashMap&lt;K, V, DefaultHashBuilder, A&gt;
<span class="kw">where
</span>K: Eq + Hash,
A: Default + Allocator + Clone,
{
<span class="doccomment">/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let map1 = HashMap::from([(1, 2), (3, 4)]);
/// let map2: HashMap&lt;_, _&gt; = [(1, 2), (3, 4)].into();
/// assert_eq!(map1, map2);
/// ```
</span><span class="kw">fn </span>from(arr: [(K, V); N]) -&gt; <span class="self">Self </span>{
arr.into_iter().collect()
}
}
<span class="doccomment">/// An iterator over the entries of a `HashMap` in arbitrary order.
/// The iterator element type is `(&amp;&#39;a K, &amp;&#39;a V)`.
///
/// This `struct` is created by the [`iter`] method on [`HashMap`]. See its
/// documentation for more.
///
/// [`iter`]: struct.HashMap.html#method.iter
/// [`HashMap`]: struct.HashMap.html
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let map: HashMap&lt;_, _&gt; = [(1, &quot;a&quot;), (2, &quot;b&quot;), (3, &quot;c&quot;)].into();
///
/// let mut iter = map.iter();
/// let mut vec = vec![iter.next(), iter.next(), iter.next()];
///
/// // The `Iter` iterator produces items in arbitrary order, so the
/// // items must be sorted to test them against a sorted array.
/// vec.sort_unstable();
/// assert_eq!(vec, [Some((&amp;1, &amp;&quot;a&quot;)), Some((&amp;2, &amp;&quot;b&quot;)), Some((&amp;3, &amp;&quot;c&quot;))]);
///
/// // It is fused iterator
/// assert_eq!(iter.next(), None);
/// assert_eq!(iter.next(), None);
/// ```
</span><span class="kw">pub struct </span>Iter&lt;<span class="lifetime">&#39;a</span>, K, V&gt; {
inner: RawIter&lt;(K, V)&gt;,
marker: PhantomData&lt;(<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>K, <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>V)&gt;,
}
<span class="comment">// FIXME(#26925) Remove in favor of `#[derive(Clone)]`
</span><span class="kw">impl</span>&lt;K, V&gt; Clone <span class="kw">for </span>Iter&lt;<span class="lifetime">&#39;_</span>, K, V&gt; {
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>clone(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="self">Self </span>{
Iter {
inner: <span class="self">self</span>.inner.clone(),
marker: PhantomData,
}
}
}
<span class="kw">impl</span>&lt;K: Debug, V: Debug&gt; fmt::Debug <span class="kw">for </span>Iter&lt;<span class="lifetime">&#39;_</span>, K, V&gt; {
<span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>fmt::Formatter&lt;<span class="lifetime">&#39;_</span>&gt;) -&gt; fmt::Result {
f.debug_list().entries(<span class="self">self</span>.clone()).finish()
}
}
<span class="doccomment">/// A mutable iterator over the entries of a `HashMap` in arbitrary order.
/// The iterator element type is `(&amp;&#39;a K, &amp;&#39;a mut V)`.
///
/// This `struct` is created by the [`iter_mut`] method on [`HashMap`]. See its
/// documentation for more.
///
/// [`iter_mut`]: struct.HashMap.html#method.iter_mut
/// [`HashMap`]: struct.HashMap.html
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map: HashMap&lt;_, _&gt; = [(1, &quot;One&quot;.to_owned()), (2, &quot;Two&quot;.into())].into();
///
/// let mut iter = map.iter_mut();
/// iter.next().map(|(_, v)| v.push_str(&quot; Mississippi&quot;));
/// iter.next().map(|(_, v)| v.push_str(&quot; Mississippi&quot;));
///
/// // It is fused iterator
/// assert_eq!(iter.next(), None);
/// assert_eq!(iter.next(), None);
///
/// assert_eq!(map.get(&amp;1).unwrap(), &amp;&quot;One Mississippi&quot;.to_owned());
/// assert_eq!(map.get(&amp;2).unwrap(), &amp;&quot;Two Mississippi&quot;.to_owned());
/// ```
</span><span class="kw">pub struct </span>IterMut&lt;<span class="lifetime">&#39;a</span>, K, V&gt; {
inner: RawIter&lt;(K, V)&gt;,
<span class="comment">// To ensure invariance with respect to V
</span>marker: PhantomData&lt;(<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>K, <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>V)&gt;,
}
<span class="comment">// We override the default Send impl which has K: Sync instead of K: Send. Both
// are correct, but this one is more general since it allows keys which
// implement Send but not Sync.
</span><span class="kw">unsafe impl</span>&lt;K: Send, V: Send&gt; Send <span class="kw">for </span>IterMut&lt;<span class="lifetime">&#39;_</span>, K, V&gt; {}
<span class="kw">impl</span>&lt;K, V&gt; IterMut&lt;<span class="lifetime">&#39;_</span>, K, V&gt; {
<span class="doccomment">/// Returns a iterator of references over the remaining items.
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub</span>(<span class="kw">super</span>) <span class="kw">fn </span>iter(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; Iter&lt;<span class="lifetime">&#39;_</span>, K, V&gt; {
Iter {
inner: <span class="self">self</span>.inner.clone(),
marker: PhantomData,
}
}
}
<span class="doccomment">/// An owning iterator over the entries of a `HashMap` in arbitrary order.
/// The iterator element type is `(K, V)`.
///
/// This `struct` is created by the [`into_iter`] method on [`HashMap`]
/// (provided by the [`IntoIterator`] trait). See its documentation for more.
/// The map cannot be used after calling that method.
///
/// [`into_iter`]: struct.HashMap.html#method.into_iter
/// [`HashMap`]: struct.HashMap.html
/// [`IntoIterator`]: https://doc.rust-lang.org/core/iter/trait.IntoIterator.html
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let map: HashMap&lt;_, _&gt; = [(1, &quot;a&quot;), (2, &quot;b&quot;), (3, &quot;c&quot;)].into();
///
/// let mut iter = map.into_iter();
/// let mut vec = vec![iter.next(), iter.next(), iter.next()];
///
/// // The `IntoIter` iterator produces items in arbitrary order, so the
/// // items must be sorted to test them against a sorted array.
/// vec.sort_unstable();
/// assert_eq!(vec, [Some((1, &quot;a&quot;)), Some((2, &quot;b&quot;)), Some((3, &quot;c&quot;))]);
///
/// // It is fused iterator
/// assert_eq!(iter.next(), None);
/// assert_eq!(iter.next(), None);
/// ```
</span><span class="kw">pub struct </span>IntoIter&lt;K, V, A: Allocator + Clone = Global&gt; {
inner: RawIntoIter&lt;(K, V), A&gt;,
}
<span class="kw">impl</span>&lt;K, V, A: Allocator + Clone&gt; IntoIter&lt;K, V, A&gt; {
<span class="doccomment">/// Returns a iterator of references over the remaining items.
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub</span>(<span class="kw">super</span>) <span class="kw">fn </span>iter(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; Iter&lt;<span class="lifetime">&#39;_</span>, K, V&gt; {
Iter {
inner: <span class="self">self</span>.inner.iter(),
marker: PhantomData,
}
}
}
<span class="doccomment">/// An owning iterator over the keys of a `HashMap` in arbitrary order.
/// The iterator element type is `K`.
///
/// This `struct` is created by the [`into_keys`] method on [`HashMap`].
/// See its documentation for more.
/// The map cannot be used after calling that method.
///
/// [`into_keys`]: struct.HashMap.html#method.into_keys
/// [`HashMap`]: struct.HashMap.html
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let map: HashMap&lt;_, _&gt; = [(1, &quot;a&quot;), (2, &quot;b&quot;), (3, &quot;c&quot;)].into();
///
/// let mut keys = map.into_keys();
/// let mut vec = vec![keys.next(), keys.next(), keys.next()];
///
/// // The `IntoKeys` iterator produces keys in arbitrary order, so the
/// // keys must be sorted to test them against a sorted array.
/// vec.sort_unstable();
/// assert_eq!(vec, [Some(1), Some(2), Some(3)]);
///
/// // It is fused iterator
/// assert_eq!(keys.next(), None);
/// assert_eq!(keys.next(), None);
/// ```
</span><span class="kw">pub struct </span>IntoKeys&lt;K, V, A: Allocator + Clone = Global&gt; {
inner: IntoIter&lt;K, V, A&gt;,
}
<span class="kw">impl</span>&lt;K, V, A: Allocator + Clone&gt; Iterator <span class="kw">for </span>IntoKeys&lt;K, V, A&gt; {
<span class="kw">type </span>Item = K;
<span class="attribute">#[inline]
</span><span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;K&gt; {
<span class="self">self</span>.inner.next().map(|(k, <span class="kw">_</span>)| k)
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>size_hint(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; (usize, <span class="prelude-ty">Option</span>&lt;usize&gt;) {
<span class="self">self</span>.inner.size_hint()
}
}
<span class="kw">impl</span>&lt;K, V, A: Allocator + Clone&gt; ExactSizeIterator <span class="kw">for </span>IntoKeys&lt;K, V, A&gt; {
<span class="attribute">#[inline]
</span><span class="kw">fn </span>len(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
<span class="self">self</span>.inner.len()
}
}
<span class="kw">impl</span>&lt;K, V, A: Allocator + Clone&gt; FusedIterator <span class="kw">for </span>IntoKeys&lt;K, V, A&gt; {}
<span class="kw">impl</span>&lt;K: Debug, V: Debug, A: Allocator + Clone&gt; fmt::Debug <span class="kw">for </span>IntoKeys&lt;K, V, A&gt; {
<span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>fmt::Formatter&lt;<span class="lifetime">&#39;_</span>&gt;) -&gt; fmt::Result {
f.debug_list()
.entries(<span class="self">self</span>.inner.iter().map(|(k, <span class="kw">_</span>)| k))
.finish()
}
}
<span class="doccomment">/// An owning iterator over the values of a `HashMap` in arbitrary order.
/// The iterator element type is `V`.
///
/// This `struct` is created by the [`into_values`] method on [`HashMap`].
/// See its documentation for more. The map cannot be used after calling that method.
///
/// [`into_values`]: struct.HashMap.html#method.into_values
/// [`HashMap`]: struct.HashMap.html
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let map: HashMap&lt;_, _&gt; = [(1, &quot;a&quot;), (2, &quot;b&quot;), (3, &quot;c&quot;)].into();
///
/// let mut values = map.into_values();
/// let mut vec = vec![values.next(), values.next(), values.next()];
///
/// // The `IntoValues` iterator produces values in arbitrary order, so
/// // the values must be sorted to test them against a sorted array.
/// vec.sort_unstable();
/// assert_eq!(vec, [Some(&quot;a&quot;), Some(&quot;b&quot;), Some(&quot;c&quot;)]);
///
/// // It is fused iterator
/// assert_eq!(values.next(), None);
/// assert_eq!(values.next(), None);
/// ```
</span><span class="kw">pub struct </span>IntoValues&lt;K, V, A: Allocator + Clone = Global&gt; {
inner: IntoIter&lt;K, V, A&gt;,
}
<span class="kw">impl</span>&lt;K, V, A: Allocator + Clone&gt; Iterator <span class="kw">for </span>IntoValues&lt;K, V, A&gt; {
<span class="kw">type </span>Item = V;
<span class="attribute">#[inline]
</span><span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;V&gt; {
<span class="self">self</span>.inner.next().map(|(<span class="kw">_</span>, v)| v)
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>size_hint(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; (usize, <span class="prelude-ty">Option</span>&lt;usize&gt;) {
<span class="self">self</span>.inner.size_hint()
}
}
<span class="kw">impl</span>&lt;K, V, A: Allocator + Clone&gt; ExactSizeIterator <span class="kw">for </span>IntoValues&lt;K, V, A&gt; {
<span class="attribute">#[inline]
</span><span class="kw">fn </span>len(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
<span class="self">self</span>.inner.len()
}
}
<span class="kw">impl</span>&lt;K, V, A: Allocator + Clone&gt; FusedIterator <span class="kw">for </span>IntoValues&lt;K, V, A&gt; {}
<span class="kw">impl</span>&lt;K, V: Debug, A: Allocator + Clone&gt; fmt::Debug <span class="kw">for </span>IntoValues&lt;K, V, A&gt; {
<span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>fmt::Formatter&lt;<span class="lifetime">&#39;_</span>&gt;) -&gt; fmt::Result {
f.debug_list()
.entries(<span class="self">self</span>.inner.iter().map(|(<span class="kw">_</span>, v)| v))
.finish()
}
}
<span class="doccomment">/// An iterator over the keys of a `HashMap` in arbitrary order.
/// The iterator element type is `&amp;&#39;a K`.
///
/// This `struct` is created by the [`keys`] method on [`HashMap`]. See its
/// documentation for more.
///
/// [`keys`]: struct.HashMap.html#method.keys
/// [`HashMap`]: struct.HashMap.html
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let map: HashMap&lt;_, _&gt; = [(1, &quot;a&quot;), (2, &quot;b&quot;), (3, &quot;c&quot;)].into();
///
/// let mut keys = map.keys();
/// let mut vec = vec![keys.next(), keys.next(), keys.next()];
///
/// // The `Keys` iterator produces keys in arbitrary order, so the
/// // keys must be sorted to test them against a sorted array.
/// vec.sort_unstable();
/// assert_eq!(vec, [Some(&amp;1), Some(&amp;2), Some(&amp;3)]);
///
/// // It is fused iterator
/// assert_eq!(keys.next(), None);
/// assert_eq!(keys.next(), None);
/// ```
</span><span class="kw">pub struct </span>Keys&lt;<span class="lifetime">&#39;a</span>, K, V&gt; {
inner: Iter&lt;<span class="lifetime">&#39;a</span>, K, V&gt;,
}
<span class="comment">// FIXME(#26925) Remove in favor of `#[derive(Clone)]`
</span><span class="kw">impl</span>&lt;K, V&gt; Clone <span class="kw">for </span>Keys&lt;<span class="lifetime">&#39;_</span>, K, V&gt; {
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>clone(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="self">Self </span>{
Keys {
inner: <span class="self">self</span>.inner.clone(),
}
}
}
<span class="kw">impl</span>&lt;K: Debug, V&gt; fmt::Debug <span class="kw">for </span>Keys&lt;<span class="lifetime">&#39;_</span>, K, V&gt; {
<span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>fmt::Formatter&lt;<span class="lifetime">&#39;_</span>&gt;) -&gt; fmt::Result {
f.debug_list().entries(<span class="self">self</span>.clone()).finish()
}
}
<span class="doccomment">/// An iterator over the values of a `HashMap` in arbitrary order.
/// The iterator element type is `&amp;&#39;a V`.
///
/// This `struct` is created by the [`values`] method on [`HashMap`]. See its
/// documentation for more.
///
/// [`values`]: struct.HashMap.html#method.values
/// [`HashMap`]: struct.HashMap.html
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let map: HashMap&lt;_, _&gt; = [(1, &quot;a&quot;), (2, &quot;b&quot;), (3, &quot;c&quot;)].into();
///
/// let mut values = map.values();
/// let mut vec = vec![values.next(), values.next(), values.next()];
///
/// // The `Values` iterator produces values in arbitrary order, so the
/// // values must be sorted to test them against a sorted array.
/// vec.sort_unstable();
/// assert_eq!(vec, [Some(&amp;&quot;a&quot;), Some(&amp;&quot;b&quot;), Some(&amp;&quot;c&quot;)]);
///
/// // It is fused iterator
/// assert_eq!(values.next(), None);
/// assert_eq!(values.next(), None);
/// ```
</span><span class="kw">pub struct </span>Values&lt;<span class="lifetime">&#39;a</span>, K, V&gt; {
inner: Iter&lt;<span class="lifetime">&#39;a</span>, K, V&gt;,
}
<span class="comment">// FIXME(#26925) Remove in favor of `#[derive(Clone)]`
</span><span class="kw">impl</span>&lt;K, V&gt; Clone <span class="kw">for </span>Values&lt;<span class="lifetime">&#39;_</span>, K, V&gt; {
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>clone(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="self">Self </span>{
Values {
inner: <span class="self">self</span>.inner.clone(),
}
}
}
<span class="kw">impl</span>&lt;K, V: Debug&gt; fmt::Debug <span class="kw">for </span>Values&lt;<span class="lifetime">&#39;_</span>, K, V&gt; {
<span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>fmt::Formatter&lt;<span class="lifetime">&#39;_</span>&gt;) -&gt; fmt::Result {
f.debug_list().entries(<span class="self">self</span>.clone()).finish()
}
}
<span class="doccomment">/// A draining iterator over the entries of a `HashMap` in arbitrary
/// order. The iterator element type is `(K, V)`.
///
/// This `struct` is created by the [`drain`] method on [`HashMap`]. See its
/// documentation for more.
///
/// [`drain`]: struct.HashMap.html#method.drain
/// [`HashMap`]: struct.HashMap.html
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map: HashMap&lt;_, _&gt; = [(1, &quot;a&quot;), (2, &quot;b&quot;), (3, &quot;c&quot;)].into();
///
/// let mut drain_iter = map.drain();
/// let mut vec = vec![drain_iter.next(), drain_iter.next(), drain_iter.next()];
///
/// // The `Drain` iterator produces items in arbitrary order, so the
/// // items must be sorted to test them against a sorted array.
/// vec.sort_unstable();
/// assert_eq!(vec, [Some((1, &quot;a&quot;)), Some((2, &quot;b&quot;)), Some((3, &quot;c&quot;))]);
///
/// // It is fused iterator
/// assert_eq!(drain_iter.next(), None);
/// assert_eq!(drain_iter.next(), None);
/// ```
</span><span class="kw">pub struct </span>Drain&lt;<span class="lifetime">&#39;a</span>, K, V, A: Allocator + Clone = Global&gt; {
inner: RawDrain&lt;<span class="lifetime">&#39;a</span>, (K, V), A&gt;,
}
<span class="kw">impl</span>&lt;K, V, A: Allocator + Clone&gt; Drain&lt;<span class="lifetime">&#39;_</span>, K, V, A&gt; {
<span class="doccomment">/// Returns a iterator of references over the remaining items.
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub</span>(<span class="kw">super</span>) <span class="kw">fn </span>iter(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; Iter&lt;<span class="lifetime">&#39;_</span>, K, V&gt; {
Iter {
inner: <span class="self">self</span>.inner.iter(),
marker: PhantomData,
}
}
}
<span class="doccomment">/// A draining iterator over entries of a `HashMap` which don&#39;t satisfy the predicate
/// `f(&amp;k, &amp;mut v)` in arbitrary order. The iterator element type is `(K, V)`.
///
/// This `struct` is created by the [`drain_filter`] method on [`HashMap`]. See its
/// documentation for more.
///
/// [`drain_filter`]: struct.HashMap.html#method.drain_filter
/// [`HashMap`]: struct.HashMap.html
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map: HashMap&lt;i32, &amp;str&gt; = [(1, &quot;a&quot;), (2, &quot;b&quot;), (3, &quot;c&quot;)].into();
///
/// let mut drain_filter = map.drain_filter(|k, _v| k % 2 != 0);
/// let mut vec = vec![drain_filter.next(), drain_filter.next()];
///
/// // The `DrainFilter` iterator produces items in arbitrary order, so the
/// // items must be sorted to test them against a sorted array.
/// vec.sort_unstable();
/// assert_eq!(vec, [Some((1, &quot;a&quot;)),Some((3, &quot;c&quot;))]);
///
/// // It is fused iterator
/// assert_eq!(drain_filter.next(), None);
/// assert_eq!(drain_filter.next(), None);
/// drop(drain_filter);
///
/// assert_eq!(map.len(), 1);
/// ```
</span><span class="kw">pub struct </span>DrainFilter&lt;<span class="lifetime">&#39;a</span>, K, V, F, A: Allocator + Clone = Global&gt;
<span class="kw">where
</span>F: FnMut(<span class="kw-2">&amp;</span>K, <span class="kw-2">&amp;mut </span>V) -&gt; bool,
{
f: F,
inner: DrainFilterInner&lt;<span class="lifetime">&#39;a</span>, K, V, A&gt;,
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, K, V, F, A&gt; Drop <span class="kw">for </span>DrainFilter&lt;<span class="lifetime">&#39;a</span>, K, V, F, A&gt;
<span class="kw">where
</span>F: FnMut(<span class="kw-2">&amp;</span>K, <span class="kw-2">&amp;mut </span>V) -&gt; bool,
A: Allocator + Clone,
{
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>drop(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
<span class="kw">while let </span><span class="prelude-val">Some</span>(item) = <span class="self">self</span>.next() {
<span class="kw">let </span>guard = ConsumeAllOnDrop(<span class="self">self</span>);
drop(item);
mem::forget(guard);
}
}
}
<span class="kw">pub</span>(<span class="kw">super</span>) <span class="kw">struct </span>ConsumeAllOnDrop&lt;<span class="lifetime">&#39;a</span>, T: Iterator&gt;(<span class="kw">pub </span><span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>T);
<span class="kw">impl</span>&lt;T: Iterator&gt; Drop <span class="kw">for </span>ConsumeAllOnDrop&lt;<span class="lifetime">&#39;_</span>, T&gt; {
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>drop(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
<span class="self">self</span>.<span class="number">0</span>.for_each(drop);
}
}
<span class="kw">impl</span>&lt;K, V, F, A&gt; Iterator <span class="kw">for </span>DrainFilter&lt;<span class="lifetime">&#39;_</span>, K, V, F, A&gt;
<span class="kw">where
</span>F: FnMut(<span class="kw-2">&amp;</span>K, <span class="kw-2">&amp;mut </span>V) -&gt; bool,
A: Allocator + Clone,
{
<span class="kw">type </span>Item = (K, V);
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="self">Self</span>::Item&gt; {
<span class="self">self</span>.inner.next(<span class="kw-2">&amp;mut </span><span class="self">self</span>.f)
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>size_hint(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; (usize, <span class="prelude-ty">Option</span>&lt;usize&gt;) {
(<span class="number">0</span>, <span class="self">self</span>.inner.iter.size_hint().<span class="number">1</span>)
}
}
<span class="kw">impl</span>&lt;K, V, F&gt; FusedIterator <span class="kw">for </span>DrainFilter&lt;<span class="lifetime">&#39;_</span>, K, V, F&gt; <span class="kw">where </span>F: FnMut(<span class="kw-2">&amp;</span>K, <span class="kw-2">&amp;mut </span>V) -&gt; bool {}
<span class="doccomment">/// Portions of `DrainFilter` shared with `set::DrainFilter`
</span><span class="kw">pub</span>(<span class="kw">super</span>) <span class="kw">struct </span>DrainFilterInner&lt;<span class="lifetime">&#39;a</span>, K, V, A: Allocator + Clone&gt; {
<span class="kw">pub </span>iter: RawIter&lt;(K, V)&gt;,
<span class="kw">pub </span>table: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>RawTable&lt;(K, V), A&gt;,
}
<span class="kw">impl</span>&lt;K, V, A: Allocator + Clone&gt; DrainFilterInner&lt;<span class="lifetime">&#39;_</span>, K, V, A&gt; {
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub</span>(<span class="kw">super</span>) <span class="kw">fn </span>next&lt;F&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>F) -&gt; <span class="prelude-ty">Option</span>&lt;(K, V)&gt;
<span class="kw">where
</span>F: FnMut(<span class="kw-2">&amp;</span>K, <span class="kw-2">&amp;mut </span>V) -&gt; bool,
{
<span class="kw">unsafe </span>{
<span class="kw">for </span>item <span class="kw">in </span><span class="kw-2">&amp;mut </span><span class="self">self</span>.iter {
<span class="kw">let </span><span class="kw-2">&amp;mut </span>(<span class="kw-2">ref </span>key, <span class="kw-2">ref mut </span>value) = item.as_mut();
<span class="kw">if </span>f(key, value) {
<span class="kw">return </span><span class="prelude-val">Some</span>(<span class="self">self</span>.table.remove(item));
}
}
}
<span class="prelude-val">None
</span>}
}
<span class="doccomment">/// A mutable iterator over the values of a `HashMap` in arbitrary order.
/// The iterator element type is `&amp;&#39;a mut V`.
///
/// This `struct` is created by the [`values_mut`] method on [`HashMap`]. See its
/// documentation for more.
///
/// [`values_mut`]: struct.HashMap.html#method.values_mut
/// [`HashMap`]: struct.HashMap.html
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map: HashMap&lt;_, _&gt; = [(1, &quot;One&quot;.to_owned()), (2, &quot;Two&quot;.into())].into();
///
/// let mut values = map.values_mut();
/// values.next().map(|v| v.push_str(&quot; Mississippi&quot;));
/// values.next().map(|v| v.push_str(&quot; Mississippi&quot;));
///
/// // It is fused iterator
/// assert_eq!(values.next(), None);
/// assert_eq!(values.next(), None);
///
/// assert_eq!(map.get(&amp;1).unwrap(), &amp;&quot;One Mississippi&quot;.to_owned());
/// assert_eq!(map.get(&amp;2).unwrap(), &amp;&quot;Two Mississippi&quot;.to_owned());
/// ```
</span><span class="kw">pub struct </span>ValuesMut&lt;<span class="lifetime">&#39;a</span>, K, V&gt; {
inner: IterMut&lt;<span class="lifetime">&#39;a</span>, K, V&gt;,
}
<span class="doccomment">/// A builder for computing where in a [`HashMap`] a key-value pair would be stored.
///
/// See the [`HashMap::raw_entry_mut`] docs for usage examples.
///
/// [`HashMap::raw_entry_mut`]: struct.HashMap.html#method.raw_entry_mut
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{RawEntryBuilderMut, RawEntryMut::Vacant, RawEntryMut::Occupied};
/// use hashbrown::HashMap;
/// use core::hash::{BuildHasher, Hash};
///
/// let mut map = HashMap::new();
/// map.extend([(1, 11), (2, 12), (3, 13), (4, 14), (5, 15), (6, 16)]);
/// assert_eq!(map.len(), 6);
///
/// fn compute_hash&lt;K: Hash + ?Sized, S: BuildHasher&gt;(hash_builder: &amp;S, key: &amp;K) -&gt; u64 {
/// use core::hash::Hasher;
/// let mut state = hash_builder.build_hasher();
/// key.hash(&amp;mut state);
/// state.finish()
/// }
///
/// let builder: RawEntryBuilderMut&lt;_, _, _&gt; = map.raw_entry_mut();
///
/// // Existing key
/// match builder.from_key(&amp;6) {
/// Vacant(_) =&gt; unreachable!(),
/// Occupied(view) =&gt; assert_eq!(view.get(), &amp;16),
/// }
///
/// for key in 0..12 {
/// let hash = compute_hash(map.hasher(), &amp;key);
/// let value = map.get(&amp;key).cloned();
/// let key_value = value.as_ref().map(|v| (&amp;key, v));
///
/// println!(&quot;Key: {} and value: {:?}&quot;, key, value);
///
/// match map.raw_entry_mut().from_key(&amp;key) {
/// Occupied(mut o) =&gt; assert_eq!(Some(o.get_key_value()), key_value),
/// Vacant(_) =&gt; assert_eq!(value, None),
/// }
/// match map.raw_entry_mut().from_key_hashed_nocheck(hash, &amp;key) {
/// Occupied(mut o) =&gt; assert_eq!(Some(o.get_key_value()), key_value),
/// Vacant(_) =&gt; assert_eq!(value, None),
/// }
/// match map.raw_entry_mut().from_hash(hash, |q| *q == key) {
/// Occupied(mut o) =&gt; assert_eq!(Some(o.get_key_value()), key_value),
/// Vacant(_) =&gt; assert_eq!(value, None),
/// }
/// }
///
/// assert_eq!(map.len(), 6);
/// ```
</span><span class="kw">pub struct </span>RawEntryBuilderMut&lt;<span class="lifetime">&#39;a</span>, K, V, S, A: Allocator + Clone = Global&gt; {
map: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>HashMap&lt;K, V, S, A&gt;,
}
<span class="doccomment">/// A view into a single entry in a map, which may either be vacant or occupied.
///
/// This is a lower-level version of [`Entry`].
///
/// This `enum` is constructed through the [`raw_entry_mut`] method on [`HashMap`],
/// then calling one of the methods of that [`RawEntryBuilderMut`].
///
/// [`HashMap`]: struct.HashMap.html
/// [`Entry`]: enum.Entry.html
/// [`raw_entry_mut`]: struct.HashMap.html#method.raw_entry_mut
/// [`RawEntryBuilderMut`]: struct.RawEntryBuilderMut.html
///
/// # Examples
///
/// ```
/// use core::hash::{BuildHasher, Hash};
/// use hashbrown::hash_map::{HashMap, RawEntryMut, RawOccupiedEntryMut};
///
/// let mut map = HashMap::new();
/// map.extend([(&#39;a&#39;, 1), (&#39;b&#39;, 2), (&#39;c&#39;, 3)]);
/// assert_eq!(map.len(), 3);
///
/// fn compute_hash&lt;K: Hash + ?Sized, S: BuildHasher&gt;(hash_builder: &amp;S, key: &amp;K) -&gt; u64 {
/// use core::hash::Hasher;
/// let mut state = hash_builder.build_hasher();
/// key.hash(&amp;mut state);
/// state.finish()
/// }
///
/// // Existing key (insert)
/// let raw: RawEntryMut&lt;_, _, _&gt; = map.raw_entry_mut().from_key(&amp;&#39;a&#39;);
/// let _raw_o: RawOccupiedEntryMut&lt;_, _, _&gt; = raw.insert(&#39;a&#39;, 10);
/// assert_eq!(map.len(), 3);
///
/// // Nonexistent key (insert)
/// map.raw_entry_mut().from_key(&amp;&#39;d&#39;).insert(&#39;d&#39;, 40);
/// assert_eq!(map.len(), 4);
///
/// // Existing key (or_insert)
/// let hash = compute_hash(map.hasher(), &amp;&#39;b&#39;);
/// let kv = map
/// .raw_entry_mut()
/// .from_key_hashed_nocheck(hash, &amp;&#39;b&#39;)
/// .or_insert(&#39;b&#39;, 20);
/// assert_eq!(kv, (&amp;mut &#39;b&#39;, &amp;mut 2));
/// *kv.1 = 20;
/// assert_eq!(map.len(), 4);
///
/// // Nonexistent key (or_insert)
/// let hash = compute_hash(map.hasher(), &amp;&#39;e&#39;);
/// let kv = map
/// .raw_entry_mut()
/// .from_key_hashed_nocheck(hash, &amp;&#39;e&#39;)
/// .or_insert(&#39;e&#39;, 50);
/// assert_eq!(kv, (&amp;mut &#39;e&#39;, &amp;mut 50));
/// assert_eq!(map.len(), 5);
///
/// // Existing key (or_insert_with)
/// let hash = compute_hash(map.hasher(), &amp;&#39;c&#39;);
/// let kv = map
/// .raw_entry_mut()
/// .from_hash(hash, |q| q == &amp;&#39;c&#39;)
/// .or_insert_with(|| (&#39;c&#39;, 30));
/// assert_eq!(kv, (&amp;mut &#39;c&#39;, &amp;mut 3));
/// *kv.1 = 30;
/// assert_eq!(map.len(), 5);
///
/// // Nonexistent key (or_insert_with)
/// let hash = compute_hash(map.hasher(), &amp;&#39;f&#39;);
/// let kv = map
/// .raw_entry_mut()
/// .from_hash(hash, |q| q == &amp;&#39;f&#39;)
/// .or_insert_with(|| (&#39;f&#39;, 60));
/// assert_eq!(kv, (&amp;mut &#39;f&#39;, &amp;mut 60));
/// assert_eq!(map.len(), 6);
///
/// println!(&quot;Our HashMap: {:?}&quot;, map);
///
/// let mut vec: Vec&lt;_&gt; = map.iter().map(|(&amp;k, &amp;v)| (k, v)).collect();
/// // The `Iter` iterator produces items in arbitrary order, so the
/// // items must be sorted to test them against a sorted array.
/// vec.sort_unstable();
/// assert_eq!(vec, [(&#39;a&#39;, 10), (&#39;b&#39;, 20), (&#39;c&#39;, 30), (&#39;d&#39;, 40), (&#39;e&#39;, 50), (&#39;f&#39;, 60)]);
/// ```
</span><span class="kw">pub enum </span>RawEntryMut&lt;<span class="lifetime">&#39;a</span>, K, V, S, A: Allocator + Clone = Global&gt; {
<span class="doccomment">/// An occupied entry.
///
/// # Examples
///
/// ```
/// use hashbrown::{hash_map::RawEntryMut, HashMap};
/// let mut map: HashMap&lt;_, _&gt; = [(&quot;a&quot;, 100), (&quot;b&quot;, 200)].into();
///
/// match map.raw_entry_mut().from_key(&amp;&quot;a&quot;) {
/// RawEntryMut::Vacant(_) =&gt; unreachable!(),
/// RawEntryMut::Occupied(_) =&gt; { }
/// }
/// ```
</span>Occupied(RawOccupiedEntryMut&lt;<span class="lifetime">&#39;a</span>, K, V, S, A&gt;),
<span class="doccomment">/// A vacant entry.
///
/// # Examples
///
/// ```
/// use hashbrown::{hash_map::RawEntryMut, HashMap};
/// let mut map: HashMap&lt;&amp;str, i32&gt; = HashMap::new();
///
/// match map.raw_entry_mut().from_key(&quot;a&quot;) {
/// RawEntryMut::Occupied(_) =&gt; unreachable!(),
/// RawEntryMut::Vacant(_) =&gt; { }
/// }
/// ```
</span>Vacant(RawVacantEntryMut&lt;<span class="lifetime">&#39;a</span>, K, V, S, A&gt;),
}
<span class="doccomment">/// A view into an occupied entry in a `HashMap`.
/// It is part of the [`RawEntryMut`] enum.
///
/// [`RawEntryMut`]: enum.RawEntryMut.html
///
/// # Examples
///
/// ```
/// use core::hash::{BuildHasher, Hash};
/// use hashbrown::hash_map::{HashMap, RawEntryMut, RawOccupiedEntryMut};
///
/// let mut map = HashMap::new();
/// map.extend([(&quot;a&quot;, 10), (&quot;b&quot;, 20), (&quot;c&quot;, 30)]);
///
/// fn compute_hash&lt;K: Hash + ?Sized, S: BuildHasher&gt;(hash_builder: &amp;S, key: &amp;K) -&gt; u64 {
/// use core::hash::Hasher;
/// let mut state = hash_builder.build_hasher();
/// key.hash(&amp;mut state);
/// state.finish()
/// }
///
/// let _raw_o: RawOccupiedEntryMut&lt;_, _, _&gt; = map.raw_entry_mut().from_key(&amp;&quot;a&quot;).insert(&quot;a&quot;, 100);
/// assert_eq!(map.len(), 3);
///
/// // Existing key (insert and update)
/// match map.raw_entry_mut().from_key(&amp;&quot;a&quot;) {
/// RawEntryMut::Vacant(_) =&gt; unreachable!(),
/// RawEntryMut::Occupied(mut view) =&gt; {
/// assert_eq!(view.get(), &amp;100);
/// let v = view.get_mut();
/// let new_v = (*v) * 10;
/// *v = new_v;
/// assert_eq!(view.insert(1111), 1000);
/// }
/// }
///
/// assert_eq!(map[&amp;&quot;a&quot;], 1111);
/// assert_eq!(map.len(), 3);
///
/// // Existing key (take)
/// let hash = compute_hash(map.hasher(), &amp;&quot;c&quot;);
/// match map.raw_entry_mut().from_key_hashed_nocheck(hash, &amp;&quot;c&quot;) {
/// RawEntryMut::Vacant(_) =&gt; unreachable!(),
/// RawEntryMut::Occupied(view) =&gt; {
/// assert_eq!(view.remove_entry(), (&quot;c&quot;, 30));
/// }
/// }
/// assert_eq!(map.raw_entry().from_key(&amp;&quot;c&quot;), None);
/// assert_eq!(map.len(), 2);
///
/// let hash = compute_hash(map.hasher(), &amp;&quot;b&quot;);
/// match map.raw_entry_mut().from_hash(hash, |q| *q == &quot;b&quot;) {
/// RawEntryMut::Vacant(_) =&gt; unreachable!(),
/// RawEntryMut::Occupied(view) =&gt; {
/// assert_eq!(view.remove_entry(), (&quot;b&quot;, 20));
/// }
/// }
/// assert_eq!(map.get(&amp;&quot;b&quot;), None);
/// assert_eq!(map.len(), 1);
/// ```
</span><span class="kw">pub struct </span>RawOccupiedEntryMut&lt;<span class="lifetime">&#39;a</span>, K, V, S, A: Allocator + Clone = Global&gt; {
elem: Bucket&lt;(K, V)&gt;,
table: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>RawTable&lt;(K, V), A&gt;,
hash_builder: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>S,
}
<span class="kw">unsafe impl</span>&lt;K, V, S, A&gt; Send <span class="kw">for </span>RawOccupiedEntryMut&lt;<span class="lifetime">&#39;_</span>, K, V, S, A&gt;
<span class="kw">where
</span>K: Send,
V: Send,
S: Send,
A: Send + Allocator + Clone,
{
}
<span class="kw">unsafe impl</span>&lt;K, V, S, A&gt; Sync <span class="kw">for </span>RawOccupiedEntryMut&lt;<span class="lifetime">&#39;_</span>, K, V, S, A&gt;
<span class="kw">where
</span>K: Sync,
V: Sync,
S: Sync,
A: Sync + Allocator + Clone,
{
}
<span class="doccomment">/// A view into a vacant entry in a `HashMap`.
/// It is part of the [`RawEntryMut`] enum.
///
/// [`RawEntryMut`]: enum.RawEntryMut.html
///
/// # Examples
///
/// ```
/// use core::hash::{BuildHasher, Hash};
/// use hashbrown::hash_map::{HashMap, RawEntryMut, RawVacantEntryMut};
///
/// let mut map = HashMap::&lt;&amp;str, i32&gt;::new();
///
/// fn compute_hash&lt;K: Hash + ?Sized, S: BuildHasher&gt;(hash_builder: &amp;S, key: &amp;K) -&gt; u64 {
/// use core::hash::Hasher;
/// let mut state = hash_builder.build_hasher();
/// key.hash(&amp;mut state);
/// state.finish()
/// }
///
/// let raw_v: RawVacantEntryMut&lt;_, _, _&gt; = match map.raw_entry_mut().from_key(&amp;&quot;a&quot;) {
/// RawEntryMut::Vacant(view) =&gt; view,
/// RawEntryMut::Occupied(_) =&gt; unreachable!(),
/// };
/// raw_v.insert(&quot;a&quot;, 10);
/// assert!(map[&amp;&quot;a&quot;] == 10 &amp;&amp; map.len() == 1);
///
/// // Nonexistent key (insert and update)
/// let hash = compute_hash(map.hasher(), &amp;&quot;b&quot;);
/// match map.raw_entry_mut().from_key_hashed_nocheck(hash, &amp;&quot;b&quot;) {
/// RawEntryMut::Occupied(_) =&gt; unreachable!(),
/// RawEntryMut::Vacant(view) =&gt; {
/// let (k, value) = view.insert(&quot;b&quot;, 2);
/// assert_eq!((*k, *value), (&quot;b&quot;, 2));
/// *value = 20;
/// }
/// }
/// assert!(map[&amp;&quot;b&quot;] == 20 &amp;&amp; map.len() == 2);
///
/// let hash = compute_hash(map.hasher(), &amp;&quot;c&quot;);
/// match map.raw_entry_mut().from_hash(hash, |q| *q == &quot;c&quot;) {
/// RawEntryMut::Occupied(_) =&gt; unreachable!(),
/// RawEntryMut::Vacant(view) =&gt; {
/// assert_eq!(view.insert(&quot;c&quot;, 30), (&amp;mut &quot;c&quot;, &amp;mut 30));
/// }
/// }
/// assert!(map[&amp;&quot;c&quot;] == 30 &amp;&amp; map.len() == 3);
/// ```
</span><span class="kw">pub struct </span>RawVacantEntryMut&lt;<span class="lifetime">&#39;a</span>, K, V, S, A: Allocator + Clone = Global&gt; {
table: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>RawTable&lt;(K, V), A&gt;,
hash_builder: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>S,
}
<span class="doccomment">/// A builder for computing where in a [`HashMap`] a key-value pair would be stored.
///
/// See the [`HashMap::raw_entry`] docs for usage examples.
///
/// [`HashMap::raw_entry`]: struct.HashMap.html#method.raw_entry
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{HashMap, RawEntryBuilder};
/// use core::hash::{BuildHasher, Hash};
///
/// let mut map = HashMap::new();
/// map.extend([(1, 10), (2, 20), (3, 30)]);
///
/// fn compute_hash&lt;K: Hash + ?Sized, S: BuildHasher&gt;(hash_builder: &amp;S, key: &amp;K) -&gt; u64 {
/// use core::hash::Hasher;
/// let mut state = hash_builder.build_hasher();
/// key.hash(&amp;mut state);
/// state.finish()
/// }
///
/// for k in 0..6 {
/// let hash = compute_hash(map.hasher(), &amp;k);
/// let v = map.get(&amp;k).cloned();
/// let kv = v.as_ref().map(|v| (&amp;k, v));
///
/// println!(&quot;Key: {} and value: {:?}&quot;, k, v);
/// let builder: RawEntryBuilder&lt;_, _, _&gt; = map.raw_entry();
/// assert_eq!(builder.from_key(&amp;k), kv);
/// assert_eq!(map.raw_entry().from_hash(hash, |q| *q == k), kv);
/// assert_eq!(map.raw_entry().from_key_hashed_nocheck(hash, &amp;k), kv);
/// }
/// ```
</span><span class="kw">pub struct </span>RawEntryBuilder&lt;<span class="lifetime">&#39;a</span>, K, V, S, A: Allocator + Clone = Global&gt; {
map: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>HashMap&lt;K, V, S, A&gt;,
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, K, V, S, A: Allocator + Clone&gt; RawEntryBuilderMut&lt;<span class="lifetime">&#39;a</span>, K, V, S, A&gt; {
<span class="doccomment">/// Creates a `RawEntryMut` from the given key.
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{HashMap, RawEntryMut};
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = HashMap::new();
/// let key = &quot;a&quot;;
/// let entry: RawEntryMut&lt;&amp;str, u32, _&gt; = map.raw_entry_mut().from_key(&amp;key);
/// entry.insert(key, 100);
/// assert_eq!(map[&amp;&quot;a&quot;], 100);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
#[allow(clippy::wrong_self_convention)]
</span><span class="kw">pub fn </span>from_key&lt;Q: <span class="question-mark">?</span>Sized&gt;(<span class="self">self</span>, k: <span class="kw-2">&amp;</span>Q) -&gt; RawEntryMut&lt;<span class="lifetime">&#39;a</span>, K, V, S, A&gt;
<span class="kw">where
</span>S: BuildHasher,
K: Borrow&lt;Q&gt;,
Q: Hash + Eq,
{
<span class="kw">let </span>hash = make_hash::&lt;K, Q, S&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>.map.hash_builder, k);
<span class="self">self</span>.from_key_hashed_nocheck(hash, k)
}
<span class="doccomment">/// Creates a `RawEntryMut` from the given key and its hash.
///
/// # Examples
///
/// ```
/// use core::hash::{BuildHasher, Hash};
/// use hashbrown::hash_map::{HashMap, RawEntryMut};
///
/// fn compute_hash&lt;K: Hash + ?Sized, S: BuildHasher&gt;(hash_builder: &amp;S, key: &amp;K) -&gt; u64 {
/// use core::hash::Hasher;
/// let mut state = hash_builder.build_hasher();
/// key.hash(&amp;mut state);
/// state.finish()
/// }
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = HashMap::new();
/// let key = &quot;a&quot;;
/// let hash = compute_hash(map.hasher(), &amp;key);
/// let entry: RawEntryMut&lt;&amp;str, u32, _&gt; = map.raw_entry_mut().from_key_hashed_nocheck(hash, &amp;key);
/// entry.insert(key, 100);
/// assert_eq!(map[&amp;&quot;a&quot;], 100);
/// ```
</span><span class="attribute">#[inline]
#[allow(clippy::wrong_self_convention)]
</span><span class="kw">pub fn </span>from_key_hashed_nocheck&lt;Q: <span class="question-mark">?</span>Sized&gt;(<span class="self">self</span>, hash: u64, k: <span class="kw-2">&amp;</span>Q) -&gt; RawEntryMut&lt;<span class="lifetime">&#39;a</span>, K, V, S, A&gt;
<span class="kw">where
</span>K: Borrow&lt;Q&gt;,
Q: Eq,
{
<span class="self">self</span>.from_hash(hash, equivalent(k))
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, K, V, S, A: Allocator + Clone&gt; RawEntryBuilderMut&lt;<span class="lifetime">&#39;a</span>, K, V, S, A&gt; {
<span class="doccomment">/// Creates a `RawEntryMut` from the given hash and matching function.
///
/// # Examples
///
/// ```
/// use core::hash::{BuildHasher, Hash};
/// use hashbrown::hash_map::{HashMap, RawEntryMut};
///
/// fn compute_hash&lt;K: Hash + ?Sized, S: BuildHasher&gt;(hash_builder: &amp;S, key: &amp;K) -&gt; u64 {
/// use core::hash::Hasher;
/// let mut state = hash_builder.build_hasher();
/// key.hash(&amp;mut state);
/// state.finish()
/// }
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = HashMap::new();
/// let key = &quot;a&quot;;
/// let hash = compute_hash(map.hasher(), &amp;key);
/// let entry: RawEntryMut&lt;&amp;str, u32, _&gt; = map.raw_entry_mut().from_hash(hash, |k| k == &amp;key);
/// entry.insert(key, 100);
/// assert_eq!(map[&amp;&quot;a&quot;], 100);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
#[allow(clippy::wrong_self_convention)]
</span><span class="kw">pub fn </span>from_hash&lt;F&gt;(<span class="self">self</span>, hash: u64, is_match: F) -&gt; RawEntryMut&lt;<span class="lifetime">&#39;a</span>, K, V, S, A&gt;
<span class="kw">where
for</span>&lt;<span class="lifetime">&#39;b</span>&gt; F: FnMut(<span class="kw-2">&amp;</span><span class="lifetime">&#39;b </span>K) -&gt; bool,
{
<span class="self">self</span>.search(hash, is_match)
}
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>search&lt;F&gt;(<span class="self">self</span>, hash: u64, <span class="kw-2">mut </span>is_match: F) -&gt; RawEntryMut&lt;<span class="lifetime">&#39;a</span>, K, V, S, A&gt;
<span class="kw">where
for</span>&lt;<span class="lifetime">&#39;b</span>&gt; F: FnMut(<span class="kw-2">&amp;</span><span class="lifetime">&#39;b </span>K) -&gt; bool,
{
<span class="kw">match </span><span class="self">self</span>.map.table.find(hash, |(k, <span class="kw">_</span>)| is_match(k)) {
<span class="prelude-val">Some</span>(elem) =&gt; RawEntryMut::Occupied(RawOccupiedEntryMut {
elem,
table: <span class="kw-2">&amp;mut </span><span class="self">self</span>.map.table,
hash_builder: <span class="kw-2">&amp;</span><span class="self">self</span>.map.hash_builder,
}),
<span class="prelude-val">None </span>=&gt; RawEntryMut::Vacant(RawVacantEntryMut {
table: <span class="kw-2">&amp;mut </span><span class="self">self</span>.map.table,
hash_builder: <span class="kw-2">&amp;</span><span class="self">self</span>.map.hash_builder,
}),
}
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, K, V, S, A: Allocator + Clone&gt; RawEntryBuilder&lt;<span class="lifetime">&#39;a</span>, K, V, S, A&gt; {
<span class="doccomment">/// Access an immutable entry by key.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let map: HashMap&lt;&amp;str, u32&gt; = [(&quot;a&quot;, 100), (&quot;b&quot;, 200)].into();
/// let key = &quot;a&quot;;
/// assert_eq!(map.raw_entry().from_key(&amp;key), Some((&amp;&quot;a&quot;, &amp;100)));
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
#[allow(clippy::wrong_self_convention)]
</span><span class="kw">pub fn </span>from_key&lt;Q: <span class="question-mark">?</span>Sized&gt;(<span class="self">self</span>, k: <span class="kw-2">&amp;</span>Q) -&gt; <span class="prelude-ty">Option</span>&lt;(<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>K, <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>V)&gt;
<span class="kw">where
</span>S: BuildHasher,
K: Borrow&lt;Q&gt;,
Q: Hash + Eq,
{
<span class="kw">let </span>hash = make_hash::&lt;K, Q, S&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>.map.hash_builder, k);
<span class="self">self</span>.from_key_hashed_nocheck(hash, k)
}
<span class="doccomment">/// Access an immutable entry by a key and its hash.
///
/// # Examples
///
/// ```
/// use core::hash::{BuildHasher, Hash};
/// use hashbrown::HashMap;
///
/// fn compute_hash&lt;K: Hash + ?Sized, S: BuildHasher&gt;(hash_builder: &amp;S, key: &amp;K) -&gt; u64 {
/// use core::hash::Hasher;
/// let mut state = hash_builder.build_hasher();
/// key.hash(&amp;mut state);
/// state.finish()
/// }
///
/// let map: HashMap&lt;&amp;str, u32&gt; = [(&quot;a&quot;, 100), (&quot;b&quot;, 200)].into();
/// let key = &quot;a&quot;;
/// let hash = compute_hash(map.hasher(), &amp;key);
/// assert_eq!(map.raw_entry().from_key_hashed_nocheck(hash, &amp;key), Some((&amp;&quot;a&quot;, &amp;100)));
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
#[allow(clippy::wrong_self_convention)]
</span><span class="kw">pub fn </span>from_key_hashed_nocheck&lt;Q: <span class="question-mark">?</span>Sized&gt;(<span class="self">self</span>, hash: u64, k: <span class="kw-2">&amp;</span>Q) -&gt; <span class="prelude-ty">Option</span>&lt;(<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>K, <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>V)&gt;
<span class="kw">where
</span>K: Borrow&lt;Q&gt;,
Q: Eq,
{
<span class="self">self</span>.from_hash(hash, equivalent(k))
}
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>search&lt;F&gt;(<span class="self">self</span>, hash: u64, <span class="kw-2">mut </span>is_match: F) -&gt; <span class="prelude-ty">Option</span>&lt;(<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>K, <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>V)&gt;
<span class="kw">where
</span>F: FnMut(<span class="kw-2">&amp;</span>K) -&gt; bool,
{
<span class="kw">match </span><span class="self">self</span>.map.table.get(hash, |(k, <span class="kw">_</span>)| is_match(k)) {
<span class="prelude-val">Some</span>(<span class="kw-2">&amp;</span>(<span class="kw-2">ref </span>key, <span class="kw-2">ref </span>value)) =&gt; <span class="prelude-val">Some</span>((key, value)),
<span class="prelude-val">None </span>=&gt; <span class="prelude-val">None</span>,
}
}
<span class="doccomment">/// Access an immutable entry by hash and matching function.
///
/// # Examples
///
/// ```
/// use core::hash::{BuildHasher, Hash};
/// use hashbrown::HashMap;
///
/// fn compute_hash&lt;K: Hash + ?Sized, S: BuildHasher&gt;(hash_builder: &amp;S, key: &amp;K) -&gt; u64 {
/// use core::hash::Hasher;
/// let mut state = hash_builder.build_hasher();
/// key.hash(&amp;mut state);
/// state.finish()
/// }
///
/// let map: HashMap&lt;&amp;str, u32&gt; = [(&quot;a&quot;, 100), (&quot;b&quot;, 200)].into();
/// let key = &quot;a&quot;;
/// let hash = compute_hash(map.hasher(), &amp;key);
/// assert_eq!(map.raw_entry().from_hash(hash, |k| k == &amp;key), Some((&amp;&quot;a&quot;, &amp;100)));
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
#[allow(clippy::wrong_self_convention)]
</span><span class="kw">pub fn </span>from_hash&lt;F&gt;(<span class="self">self</span>, hash: u64, is_match: F) -&gt; <span class="prelude-ty">Option</span>&lt;(<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>K, <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>V)&gt;
<span class="kw">where
</span>F: FnMut(<span class="kw-2">&amp;</span>K) -&gt; bool,
{
<span class="self">self</span>.search(hash, is_match)
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, K, V, S, A: Allocator + Clone&gt; RawEntryMut&lt;<span class="lifetime">&#39;a</span>, K, V, S, A&gt; {
<span class="doccomment">/// Sets the value of the entry, and returns a RawOccupiedEntryMut.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = HashMap::new();
/// let entry = map.raw_entry_mut().from_key(&quot;horseyland&quot;).insert(&quot;horseyland&quot;, 37);
///
/// assert_eq!(entry.remove_entry(), (&quot;horseyland&quot;, 37));
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>insert(<span class="self">self</span>, key: K, value: V) -&gt; RawOccupiedEntryMut&lt;<span class="lifetime">&#39;a</span>, K, V, S, A&gt;
<span class="kw">where
</span>K: Hash,
S: BuildHasher,
{
<span class="kw">match </span><span class="self">self </span>{
RawEntryMut::Occupied(<span class="kw-2">mut </span>entry) =&gt; {
entry.insert(value);
entry
}
RawEntryMut::Vacant(entry) =&gt; entry.insert_entry(key, value),
}
}
<span class="doccomment">/// Ensures a value is in the entry by inserting the default if empty, and returns
/// mutable references to the key and value in the entry.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = HashMap::new();
///
/// map.raw_entry_mut().from_key(&quot;poneyland&quot;).or_insert(&quot;poneyland&quot;, 3);
/// assert_eq!(map[&quot;poneyland&quot;], 3);
///
/// *map.raw_entry_mut().from_key(&quot;poneyland&quot;).or_insert(&quot;poneyland&quot;, 10).1 *= 2;
/// assert_eq!(map[&quot;poneyland&quot;], 6);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>or_insert(<span class="self">self</span>, default_key: K, default_val: V) -&gt; (<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>K, <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>V)
<span class="kw">where
</span>K: Hash,
S: BuildHasher,
{
<span class="kw">match </span><span class="self">self </span>{
RawEntryMut::Occupied(entry) =&gt; entry.into_key_value(),
RawEntryMut::Vacant(entry) =&gt; entry.insert(default_key, default_val),
}
}
<span class="doccomment">/// Ensures a value is in the entry by inserting the result of the default function if empty,
/// and returns mutable references to the key and value in the entry.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map: HashMap&lt;&amp;str, String&gt; = HashMap::new();
///
/// map.raw_entry_mut().from_key(&quot;poneyland&quot;).or_insert_with(|| {
/// (&quot;poneyland&quot;, &quot;hoho&quot;.to_string())
/// });
///
/// assert_eq!(map[&quot;poneyland&quot;], &quot;hoho&quot;.to_string());
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>or_insert_with&lt;F&gt;(<span class="self">self</span>, default: F) -&gt; (<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>K, <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>V)
<span class="kw">where
</span>F: FnOnce() -&gt; (K, V),
K: Hash,
S: BuildHasher,
{
<span class="kw">match </span><span class="self">self </span>{
RawEntryMut::Occupied(entry) =&gt; entry.into_key_value(),
RawEntryMut::Vacant(entry) =&gt; {
<span class="kw">let </span>(k, v) = default();
entry.insert(k, v)
}
}
}
<span class="doccomment">/// Provides in-place mutable access to an occupied entry before any
/// potential inserts into the map.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = HashMap::new();
///
/// map.raw_entry_mut()
/// .from_key(&quot;poneyland&quot;)
/// .and_modify(|_k, v| { *v += 1 })
/// .or_insert(&quot;poneyland&quot;, 42);
/// assert_eq!(map[&quot;poneyland&quot;], 42);
///
/// map.raw_entry_mut()
/// .from_key(&quot;poneyland&quot;)
/// .and_modify(|_k, v| { *v += 1 })
/// .or_insert(&quot;poneyland&quot;, 0);
/// assert_eq!(map[&quot;poneyland&quot;], 43);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>and_modify&lt;F&gt;(<span class="self">self</span>, f: F) -&gt; <span class="self">Self
</span><span class="kw">where
</span>F: FnOnce(<span class="kw-2">&amp;mut </span>K, <span class="kw-2">&amp;mut </span>V),
{
<span class="kw">match </span><span class="self">self </span>{
RawEntryMut::Occupied(<span class="kw-2">mut </span>entry) =&gt; {
{
<span class="kw">let </span>(k, v) = entry.get_key_value_mut();
f(k, v);
}
RawEntryMut::Occupied(entry)
}
RawEntryMut::Vacant(entry) =&gt; RawEntryMut::Vacant(entry),
}
}
<span class="doccomment">/// Provides shared access to the key and owned access to the value of
/// an occupied entry and allows to replace or remove it based on the
/// value of the returned option.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// use hashbrown::hash_map::RawEntryMut;
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = HashMap::new();
///
/// let entry = map
/// .raw_entry_mut()
/// .from_key(&quot;poneyland&quot;)
/// .and_replace_entry_with(|_k, _v| panic!());
///
/// match entry {
/// RawEntryMut::Vacant(_) =&gt; {},
/// RawEntryMut::Occupied(_) =&gt; panic!(),
/// }
///
/// map.insert(&quot;poneyland&quot;, 42);
///
/// let entry = map
/// .raw_entry_mut()
/// .from_key(&quot;poneyland&quot;)
/// .and_replace_entry_with(|k, v| {
/// assert_eq!(k, &amp;&quot;poneyland&quot;);
/// assert_eq!(v, 42);
/// Some(v + 1)
/// });
///
/// match entry {
/// RawEntryMut::Occupied(e) =&gt; {
/// assert_eq!(e.key(), &amp;&quot;poneyland&quot;);
/// assert_eq!(e.get(), &amp;43);
/// },
/// RawEntryMut::Vacant(_) =&gt; panic!(),
/// }
///
/// assert_eq!(map[&quot;poneyland&quot;], 43);
///
/// let entry = map
/// .raw_entry_mut()
/// .from_key(&quot;poneyland&quot;)
/// .and_replace_entry_with(|_k, _v| None);
///
/// match entry {
/// RawEntryMut::Vacant(_) =&gt; {},
/// RawEntryMut::Occupied(_) =&gt; panic!(),
/// }
///
/// assert!(!map.contains_key(&quot;poneyland&quot;));
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>and_replace_entry_with&lt;F&gt;(<span class="self">self</span>, f: F) -&gt; <span class="self">Self
</span><span class="kw">where
</span>F: FnOnce(<span class="kw-2">&amp;</span>K, V) -&gt; <span class="prelude-ty">Option</span>&lt;V&gt;,
{
<span class="kw">match </span><span class="self">self </span>{
RawEntryMut::Occupied(entry) =&gt; entry.replace_entry_with(f),
RawEntryMut::Vacant(<span class="kw">_</span>) =&gt; <span class="self">self</span>,
}
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, K, V, S, A: Allocator + Clone&gt; RawOccupiedEntryMut&lt;<span class="lifetime">&#39;a</span>, K, V, S, A&gt; {
<span class="doccomment">/// Gets a reference to the key in the entry.
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{HashMap, RawEntryMut};
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = [(&quot;a&quot;, 100), (&quot;b&quot;, 200)].into();
///
/// match map.raw_entry_mut().from_key(&amp;&quot;a&quot;) {
/// RawEntryMut::Vacant(_) =&gt; panic!(),
/// RawEntryMut::Occupied(o) =&gt; assert_eq!(o.key(), &amp;&quot;a&quot;)
/// }
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>key(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>K {
<span class="kw">unsafe </span>{ <span class="kw-2">&amp;</span><span class="self">self</span>.elem.as_ref().<span class="number">0 </span>}
}
<span class="doccomment">/// Gets a mutable reference to the key in the entry.
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{HashMap, RawEntryMut};
/// use std::rc::Rc;
///
/// let key_one = Rc::new(&quot;a&quot;);
/// let key_two = Rc::new(&quot;a&quot;);
///
/// let mut map: HashMap&lt;Rc&lt;&amp;str&gt;, u32&gt; = HashMap::new();
/// map.insert(key_one.clone(), 10);
///
/// assert_eq!(map[&amp;key_one], 10);
/// assert!(Rc::strong_count(&amp;key_one) == 2 &amp;&amp; Rc::strong_count(&amp;key_two) == 1);
///
/// match map.raw_entry_mut().from_key(&amp;key_one) {
/// RawEntryMut::Vacant(_) =&gt; panic!(),
/// RawEntryMut::Occupied(mut o) =&gt; {
/// *o.key_mut() = key_two.clone();
/// }
/// }
/// assert_eq!(map[&amp;key_two], 10);
/// assert!(Rc::strong_count(&amp;key_one) == 1 &amp;&amp; Rc::strong_count(&amp;key_two) == 2);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>key_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;mut </span>K {
<span class="kw">unsafe </span>{ <span class="kw-2">&amp;mut </span><span class="self">self</span>.elem.as_mut().<span class="number">0 </span>}
}
<span class="doccomment">/// Converts the entry into a mutable reference to the key in the entry
/// with a lifetime bound to the map itself.
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{HashMap, RawEntryMut};
/// use std::rc::Rc;
///
/// let key_one = Rc::new(&quot;a&quot;);
/// let key_two = Rc::new(&quot;a&quot;);
///
/// let mut map: HashMap&lt;Rc&lt;&amp;str&gt;, u32&gt; = HashMap::new();
/// map.insert(key_one.clone(), 10);
///
/// assert_eq!(map[&amp;key_one], 10);
/// assert!(Rc::strong_count(&amp;key_one) == 2 &amp;&amp; Rc::strong_count(&amp;key_two) == 1);
///
/// let inside_key: &amp;mut Rc&lt;&amp;str&gt;;
///
/// match map.raw_entry_mut().from_key(&amp;key_one) {
/// RawEntryMut::Vacant(_) =&gt; panic!(),
/// RawEntryMut::Occupied(o) =&gt; inside_key = o.into_key(),
/// }
/// *inside_key = key_two.clone();
///
/// assert_eq!(map[&amp;key_two], 10);
/// assert!(Rc::strong_count(&amp;key_one) == 1 &amp;&amp; Rc::strong_count(&amp;key_two) == 2);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>into_key(<span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>K {
<span class="kw">unsafe </span>{ <span class="kw-2">&amp;mut </span><span class="self">self</span>.elem.as_mut().<span class="number">0 </span>}
}
<span class="doccomment">/// Gets a reference to the value in the entry.
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{HashMap, RawEntryMut};
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = [(&quot;a&quot;, 100), (&quot;b&quot;, 200)].into();
///
/// match map.raw_entry_mut().from_key(&amp;&quot;a&quot;) {
/// RawEntryMut::Vacant(_) =&gt; panic!(),
/// RawEntryMut::Occupied(o) =&gt; assert_eq!(o.get(), &amp;100),
/// }
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>get(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>V {
<span class="kw">unsafe </span>{ <span class="kw-2">&amp;</span><span class="self">self</span>.elem.as_ref().<span class="number">1 </span>}
}
<span class="doccomment">/// Converts the OccupiedEntry into a mutable reference to the value in the entry
/// with a lifetime bound to the map itself.
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{HashMap, RawEntryMut};
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = [(&quot;a&quot;, 100), (&quot;b&quot;, 200)].into();
///
/// let value: &amp;mut u32;
///
/// match map.raw_entry_mut().from_key(&amp;&quot;a&quot;) {
/// RawEntryMut::Vacant(_) =&gt; panic!(),
/// RawEntryMut::Occupied(o) =&gt; value = o.into_mut(),
/// }
/// *value += 900;
///
/// assert_eq!(map[&amp;&quot;a&quot;], 1000);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>into_mut(<span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>V {
<span class="kw">unsafe </span>{ <span class="kw-2">&amp;mut </span><span class="self">self</span>.elem.as_mut().<span class="number">1 </span>}
}
<span class="doccomment">/// Gets a mutable reference to the value in the entry.
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{HashMap, RawEntryMut};
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = [(&quot;a&quot;, 100), (&quot;b&quot;, 200)].into();
///
/// match map.raw_entry_mut().from_key(&amp;&quot;a&quot;) {
/// RawEntryMut::Vacant(_) =&gt; panic!(),
/// RawEntryMut::Occupied(mut o) =&gt; *o.get_mut() += 900,
/// }
///
/// assert_eq!(map[&amp;&quot;a&quot;], 1000);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>get_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;mut </span>V {
<span class="kw">unsafe </span>{ <span class="kw-2">&amp;mut </span><span class="self">self</span>.elem.as_mut().<span class="number">1 </span>}
}
<span class="doccomment">/// Gets a reference to the key and value in the entry.
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{HashMap, RawEntryMut};
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = [(&quot;a&quot;, 100), (&quot;b&quot;, 200)].into();
///
/// match map.raw_entry_mut().from_key(&amp;&quot;a&quot;) {
/// RawEntryMut::Vacant(_) =&gt; panic!(),
/// RawEntryMut::Occupied(o) =&gt; assert_eq!(o.get_key_value(), (&amp;&quot;a&quot;, &amp;100)),
/// }
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>get_key_value(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; (<span class="kw-2">&amp;</span>K, <span class="kw-2">&amp;</span>V) {
<span class="kw">unsafe </span>{
<span class="kw">let </span><span class="kw-2">&amp;</span>(<span class="kw-2">ref </span>key, <span class="kw-2">ref </span>value) = <span class="self">self</span>.elem.as_ref();
(key, value)
}
}
<span class="doccomment">/// Gets a mutable reference to the key and value in the entry.
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{HashMap, RawEntryMut};
/// use std::rc::Rc;
///
/// let key_one = Rc::new(&quot;a&quot;);
/// let key_two = Rc::new(&quot;a&quot;);
///
/// let mut map: HashMap&lt;Rc&lt;&amp;str&gt;, u32&gt; = HashMap::new();
/// map.insert(key_one.clone(), 10);
///
/// assert_eq!(map[&amp;key_one], 10);
/// assert!(Rc::strong_count(&amp;key_one) == 2 &amp;&amp; Rc::strong_count(&amp;key_two) == 1);
///
/// match map.raw_entry_mut().from_key(&amp;key_one) {
/// RawEntryMut::Vacant(_) =&gt; panic!(),
/// RawEntryMut::Occupied(mut o) =&gt; {
/// let (inside_key, inside_value) = o.get_key_value_mut();
/// *inside_key = key_two.clone();
/// *inside_value = 100;
/// }
/// }
/// assert_eq!(map[&amp;key_two], 100);
/// assert!(Rc::strong_count(&amp;key_one) == 1 &amp;&amp; Rc::strong_count(&amp;key_two) == 2);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>get_key_value_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; (<span class="kw-2">&amp;mut </span>K, <span class="kw-2">&amp;mut </span>V) {
<span class="kw">unsafe </span>{
<span class="kw">let </span><span class="kw-2">&amp;mut </span>(<span class="kw-2">ref mut </span>key, <span class="kw-2">ref mut </span>value) = <span class="self">self</span>.elem.as_mut();
(key, value)
}
}
<span class="doccomment">/// Converts the OccupiedEntry into a mutable reference to the key and value in the entry
/// with a lifetime bound to the map itself.
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{HashMap, RawEntryMut};
/// use std::rc::Rc;
///
/// let key_one = Rc::new(&quot;a&quot;);
/// let key_two = Rc::new(&quot;a&quot;);
///
/// let mut map: HashMap&lt;Rc&lt;&amp;str&gt;, u32&gt; = HashMap::new();
/// map.insert(key_one.clone(), 10);
///
/// assert_eq!(map[&amp;key_one], 10);
/// assert!(Rc::strong_count(&amp;key_one) == 2 &amp;&amp; Rc::strong_count(&amp;key_two) == 1);
///
/// let inside_key: &amp;mut Rc&lt;&amp;str&gt;;
/// let inside_value: &amp;mut u32;
/// match map.raw_entry_mut().from_key(&amp;key_one) {
/// RawEntryMut::Vacant(_) =&gt; panic!(),
/// RawEntryMut::Occupied(o) =&gt; {
/// let tuple = o.into_key_value();
/// inside_key = tuple.0;
/// inside_value = tuple.1;
/// }
/// }
/// *inside_key = key_two.clone();
/// *inside_value = 100;
/// assert_eq!(map[&amp;key_two], 100);
/// assert!(Rc::strong_count(&amp;key_one) == 1 &amp;&amp; Rc::strong_count(&amp;key_two) == 2);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>into_key_value(<span class="self">self</span>) -&gt; (<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>K, <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>V) {
<span class="kw">unsafe </span>{
<span class="kw">let </span><span class="kw-2">&amp;mut </span>(<span class="kw-2">ref mut </span>key, <span class="kw-2">ref mut </span>value) = <span class="self">self</span>.elem.as_mut();
(key, value)
}
}
<span class="doccomment">/// Sets the value of the entry, and returns the entry&#39;s old value.
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{HashMap, RawEntryMut};
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = [(&quot;a&quot;, 100), (&quot;b&quot;, 200)].into();
///
/// match map.raw_entry_mut().from_key(&amp;&quot;a&quot;) {
/// RawEntryMut::Vacant(_) =&gt; panic!(),
/// RawEntryMut::Occupied(mut o) =&gt; assert_eq!(o.insert(1000), 100),
/// }
///
/// assert_eq!(map[&amp;&quot;a&quot;], 1000);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>insert(<span class="kw-2">&amp;mut </span><span class="self">self</span>, value: V) -&gt; V {
mem::replace(<span class="self">self</span>.get_mut(), value)
}
<span class="doccomment">/// Sets the value of the entry, and returns the entry&#39;s old value.
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{HashMap, RawEntryMut};
/// use std::rc::Rc;
///
/// let key_one = Rc::new(&quot;a&quot;);
/// let key_two = Rc::new(&quot;a&quot;);
///
/// let mut map: HashMap&lt;Rc&lt;&amp;str&gt;, u32&gt; = HashMap::new();
/// map.insert(key_one.clone(), 10);
///
/// assert_eq!(map[&amp;key_one], 10);
/// assert!(Rc::strong_count(&amp;key_one) == 2 &amp;&amp; Rc::strong_count(&amp;key_two) == 1);
///
/// match map.raw_entry_mut().from_key(&amp;key_one) {
/// RawEntryMut::Vacant(_) =&gt; panic!(),
/// RawEntryMut::Occupied(mut o) =&gt; {
/// let old_key = o.insert_key(key_two.clone());
/// assert!(Rc::ptr_eq(&amp;old_key, &amp;key_one));
/// }
/// }
/// assert_eq!(map[&amp;key_two], 10);
/// assert!(Rc::strong_count(&amp;key_one) == 1 &amp;&amp; Rc::strong_count(&amp;key_two) == 2);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>insert_key(<span class="kw-2">&amp;mut </span><span class="self">self</span>, key: K) -&gt; K {
mem::replace(<span class="self">self</span>.key_mut(), key)
}
<span class="doccomment">/// Takes the value out of the entry, and returns it.
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{HashMap, RawEntryMut};
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = [(&quot;a&quot;, 100), (&quot;b&quot;, 200)].into();
///
/// match map.raw_entry_mut().from_key(&amp;&quot;a&quot;) {
/// RawEntryMut::Vacant(_) =&gt; panic!(),
/// RawEntryMut::Occupied(o) =&gt; assert_eq!(o.remove(), 100),
/// }
/// assert_eq!(map.get(&amp;&quot;a&quot;), None);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>remove(<span class="self">self</span>) -&gt; V {
<span class="self">self</span>.remove_entry().<span class="number">1
</span>}
<span class="doccomment">/// Take the ownership of the key and value from the map.
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{HashMap, RawEntryMut};
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = [(&quot;a&quot;, 100), (&quot;b&quot;, 200)].into();
///
/// match map.raw_entry_mut().from_key(&amp;&quot;a&quot;) {
/// RawEntryMut::Vacant(_) =&gt; panic!(),
/// RawEntryMut::Occupied(o) =&gt; assert_eq!(o.remove_entry(), (&quot;a&quot;, 100)),
/// }
/// assert_eq!(map.get(&amp;&quot;a&quot;), None);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>remove_entry(<span class="self">self</span>) -&gt; (K, V) {
<span class="kw">unsafe </span>{ <span class="self">self</span>.table.remove(<span class="self">self</span>.elem) }
}
<span class="doccomment">/// Provides shared access to the key and owned access to the value of
/// the entry and allows to replace or remove it based on the
/// value of the returned option.
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{HashMap, RawEntryMut};
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = [(&quot;a&quot;, 100), (&quot;b&quot;, 200)].into();
///
/// let raw_entry = match map.raw_entry_mut().from_key(&amp;&quot;a&quot;) {
/// RawEntryMut::Vacant(_) =&gt; panic!(),
/// RawEntryMut::Occupied(o) =&gt; o.replace_entry_with(|k, v| {
/// assert_eq!(k, &amp;&quot;a&quot;);
/// assert_eq!(v, 100);
/// Some(v + 900)
/// }),
/// };
/// let raw_entry = match raw_entry {
/// RawEntryMut::Vacant(_) =&gt; panic!(),
/// RawEntryMut::Occupied(o) =&gt; o.replace_entry_with(|k, v| {
/// assert_eq!(k, &amp;&quot;a&quot;);
/// assert_eq!(v, 1000);
/// None
/// }),
/// };
/// match raw_entry {
/// RawEntryMut::Vacant(_) =&gt; { },
/// RawEntryMut::Occupied(_) =&gt; panic!(),
/// };
/// assert_eq!(map.get(&amp;&quot;a&quot;), None);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>replace_entry_with&lt;F&gt;(<span class="self">self</span>, f: F) -&gt; RawEntryMut&lt;<span class="lifetime">&#39;a</span>, K, V, S, A&gt;
<span class="kw">where
</span>F: FnOnce(<span class="kw-2">&amp;</span>K, V) -&gt; <span class="prelude-ty">Option</span>&lt;V&gt;,
{
<span class="kw">unsafe </span>{
<span class="kw">let </span>still_occupied = <span class="self">self
</span>.table
.replace_bucket_with(<span class="self">self</span>.elem.clone(), |(key, value)| {
f(<span class="kw-2">&amp;</span>key, value).map(|new_value| (key, new_value))
});
<span class="kw">if </span>still_occupied {
RawEntryMut::Occupied(<span class="self">self</span>)
} <span class="kw">else </span>{
RawEntryMut::Vacant(RawVacantEntryMut {
table: <span class="self">self</span>.table,
hash_builder: <span class="self">self</span>.hash_builder,
})
}
}
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, K, V, S, A: Allocator + Clone&gt; RawVacantEntryMut&lt;<span class="lifetime">&#39;a</span>, K, V, S, A&gt; {
<span class="doccomment">/// Sets the value of the entry with the VacantEntry&#39;s key,
/// and returns a mutable reference to it.
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{HashMap, RawEntryMut};
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = [(&quot;a&quot;, 100), (&quot;b&quot;, 200)].into();
///
/// match map.raw_entry_mut().from_key(&amp;&quot;c&quot;) {
/// RawEntryMut::Occupied(_) =&gt; panic!(),
/// RawEntryMut::Vacant(v) =&gt; assert_eq!(v.insert(&quot;c&quot;, 300), (&amp;mut &quot;c&quot;, &amp;mut 300)),
/// }
///
/// assert_eq!(map[&amp;&quot;c&quot;], 300);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>insert(<span class="self">self</span>, key: K, value: V) -&gt; (<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>K, <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>V)
<span class="kw">where
</span>K: Hash,
S: BuildHasher,
{
<span class="kw">let </span>hash = make_insert_hash::&lt;K, S&gt;(<span class="self">self</span>.hash_builder, <span class="kw-2">&amp;</span>key);
<span class="self">self</span>.insert_hashed_nocheck(hash, key, value)
}
<span class="doccomment">/// Sets the value of the entry with the VacantEntry&#39;s key,
/// and returns a mutable reference to it.
///
/// # Examples
///
/// ```
/// use core::hash::{BuildHasher, Hash};
/// use hashbrown::hash_map::{HashMap, RawEntryMut};
///
/// fn compute_hash&lt;K: Hash + ?Sized, S: BuildHasher&gt;(hash_builder: &amp;S, key: &amp;K) -&gt; u64 {
/// use core::hash::Hasher;
/// let mut state = hash_builder.build_hasher();
/// key.hash(&amp;mut state);
/// state.finish()
/// }
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = [(&quot;a&quot;, 100), (&quot;b&quot;, 200)].into();
/// let key = &quot;c&quot;;
/// let hash = compute_hash(map.hasher(), &amp;key);
///
/// match map.raw_entry_mut().from_key_hashed_nocheck(hash, &amp;key) {
/// RawEntryMut::Occupied(_) =&gt; panic!(),
/// RawEntryMut::Vacant(v) =&gt; assert_eq!(
/// v.insert_hashed_nocheck(hash, key, 300),
/// (&amp;mut &quot;c&quot;, &amp;mut 300)
/// ),
/// }
///
/// assert_eq!(map[&amp;&quot;c&quot;], 300);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
#[allow(clippy::shadow_unrelated)]
</span><span class="kw">pub fn </span>insert_hashed_nocheck(<span class="self">self</span>, hash: u64, key: K, value: V) -&gt; (<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>K, <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>V)
<span class="kw">where
</span>K: Hash,
S: BuildHasher,
{
<span class="kw">let </span><span class="kw-2">&amp;mut </span>(<span class="kw-2">ref mut </span>k, <span class="kw-2">ref mut </span>v) = <span class="self">self</span>.table.insert_entry(
hash,
(key, value),
make_hasher::&lt;K, <span class="kw">_</span>, V, S&gt;(<span class="self">self</span>.hash_builder),
);
(k, v)
}
<span class="doccomment">/// Set the value of an entry with a custom hasher function.
///
/// # Examples
///
/// ```
/// use core::hash::{BuildHasher, Hash};
/// use hashbrown::hash_map::{HashMap, RawEntryMut};
///
/// fn make_hasher&lt;K, S&gt;(hash_builder: &amp;S) -&gt; impl Fn(&amp;K) -&gt; u64 + &#39;_
/// where
/// K: Hash + ?Sized,
/// S: BuildHasher,
/// {
/// move |key: &amp;K| {
/// use core::hash::Hasher;
/// let mut state = hash_builder.build_hasher();
/// key.hash(&amp;mut state);
/// state.finish()
/// }
/// }
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = HashMap::new();
/// let key = &quot;a&quot;;
/// let hash_builder = map.hasher().clone();
/// let hash = make_hasher(&amp;hash_builder)(&amp;key);
///
/// match map.raw_entry_mut().from_hash(hash, |q| q == &amp;key) {
/// RawEntryMut::Occupied(_) =&gt; panic!(),
/// RawEntryMut::Vacant(v) =&gt; assert_eq!(
/// v.insert_with_hasher(hash, key, 100, make_hasher(&amp;hash_builder)),
/// (&amp;mut &quot;a&quot;, &amp;mut 100)
/// ),
/// }
/// map.extend([(&quot;b&quot;, 200), (&quot;c&quot;, 300), (&quot;d&quot;, 400), (&quot;e&quot;, 500), (&quot;f&quot;, 600)]);
/// assert_eq!(map[&amp;&quot;a&quot;], 100);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>insert_with_hasher&lt;H&gt;(
<span class="self">self</span>,
hash: u64,
key: K,
value: V,
hasher: H,
) -&gt; (<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>K, <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>V)
<span class="kw">where
</span>H: Fn(<span class="kw-2">&amp;</span>K) -&gt; u64,
{
<span class="kw">let </span><span class="kw-2">&amp;mut </span>(<span class="kw-2">ref mut </span>k, <span class="kw-2">ref mut </span>v) = <span class="self">self
</span>.table
.insert_entry(hash, (key, value), |x| hasher(<span class="kw-2">&amp;</span>x.<span class="number">0</span>));
(k, v)
}
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>insert_entry(<span class="self">self</span>, key: K, value: V) -&gt; RawOccupiedEntryMut&lt;<span class="lifetime">&#39;a</span>, K, V, S, A&gt;
<span class="kw">where
</span>K: Hash,
S: BuildHasher,
{
<span class="kw">let </span>hash = make_insert_hash::&lt;K, S&gt;(<span class="self">self</span>.hash_builder, <span class="kw-2">&amp;</span>key);
<span class="kw">let </span>elem = <span class="self">self</span>.table.insert(
hash,
(key, value),
make_hasher::&lt;K, <span class="kw">_</span>, V, S&gt;(<span class="self">self</span>.hash_builder),
);
RawOccupiedEntryMut {
elem,
table: <span class="self">self</span>.table,
hash_builder: <span class="self">self</span>.hash_builder,
}
}
}
<span class="kw">impl</span>&lt;K, V, S, A: Allocator + Clone&gt; Debug <span class="kw">for </span>RawEntryBuilderMut&lt;<span class="lifetime">&#39;_</span>, K, V, S, A&gt; {
<span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>fmt::Formatter&lt;<span class="lifetime">&#39;_</span>&gt;) -&gt; fmt::Result {
f.debug_struct(<span class="string">&quot;RawEntryBuilder&quot;</span>).finish()
}
}
<span class="kw">impl</span>&lt;K: Debug, V: Debug, S, A: Allocator + Clone&gt; Debug <span class="kw">for </span>RawEntryMut&lt;<span class="lifetime">&#39;_</span>, K, V, S, A&gt; {
<span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>fmt::Formatter&lt;<span class="lifetime">&#39;_</span>&gt;) -&gt; fmt::Result {
<span class="kw">match </span><span class="kw-2">*</span><span class="self">self </span>{
RawEntryMut::Vacant(<span class="kw-2">ref </span>v) =&gt; f.debug_tuple(<span class="string">&quot;RawEntry&quot;</span>).field(v).finish(),
RawEntryMut::Occupied(<span class="kw-2">ref </span>o) =&gt; f.debug_tuple(<span class="string">&quot;RawEntry&quot;</span>).field(o).finish(),
}
}
}
<span class="kw">impl</span>&lt;K: Debug, V: Debug, S, A: Allocator + Clone&gt; Debug <span class="kw">for </span>RawOccupiedEntryMut&lt;<span class="lifetime">&#39;_</span>, K, V, S, A&gt; {
<span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>fmt::Formatter&lt;<span class="lifetime">&#39;_</span>&gt;) -&gt; fmt::Result {
f.debug_struct(<span class="string">&quot;RawOccupiedEntryMut&quot;</span>)
.field(<span class="string">&quot;key&quot;</span>, <span class="self">self</span>.key())
.field(<span class="string">&quot;value&quot;</span>, <span class="self">self</span>.get())
.finish()
}
}
<span class="kw">impl</span>&lt;K, V, S, A: Allocator + Clone&gt; Debug <span class="kw">for </span>RawVacantEntryMut&lt;<span class="lifetime">&#39;_</span>, K, V, S, A&gt; {
<span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>fmt::Formatter&lt;<span class="lifetime">&#39;_</span>&gt;) -&gt; fmt::Result {
f.debug_struct(<span class="string">&quot;RawVacantEntryMut&quot;</span>).finish()
}
}
<span class="kw">impl</span>&lt;K, V, S, A: Allocator + Clone&gt; Debug <span class="kw">for </span>RawEntryBuilder&lt;<span class="lifetime">&#39;_</span>, K, V, S, A&gt; {
<span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>fmt::Formatter&lt;<span class="lifetime">&#39;_</span>&gt;) -&gt; fmt::Result {
f.debug_struct(<span class="string">&quot;RawEntryBuilder&quot;</span>).finish()
}
}
<span class="doccomment">/// A view into a single entry in a map, which may either be vacant or occupied.
///
/// This `enum` is constructed from the [`entry`] method on [`HashMap`].
///
/// [`HashMap`]: struct.HashMap.html
/// [`entry`]: struct.HashMap.html#method.entry
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{Entry, HashMap, OccupiedEntry};
///
/// let mut map = HashMap::new();
/// map.extend([(&quot;a&quot;, 10), (&quot;b&quot;, 20), (&quot;c&quot;, 30)]);
/// assert_eq!(map.len(), 3);
///
/// // Existing key (insert)
/// let entry: Entry&lt;_, _, _&gt; = map.entry(&quot;a&quot;);
/// let _raw_o: OccupiedEntry&lt;_, _, _&gt; = entry.insert(1);
/// assert_eq!(map.len(), 3);
/// // Nonexistent key (insert)
/// map.entry(&quot;d&quot;).insert(4);
///
/// // Existing key (or_insert)
/// let v = map.entry(&quot;b&quot;).or_insert(2);
/// assert_eq!(std::mem::replace(v, 2), 20);
/// // Nonexistent key (or_insert)
/// map.entry(&quot;e&quot;).or_insert(5);
///
/// // Existing key (or_insert_with)
/// let v = map.entry(&quot;c&quot;).or_insert_with(|| 3);
/// assert_eq!(std::mem::replace(v, 3), 30);
/// // Nonexistent key (or_insert_with)
/// map.entry(&quot;f&quot;).or_insert_with(|| 6);
///
/// println!(&quot;Our HashMap: {:?}&quot;, map);
///
/// let mut vec: Vec&lt;_&gt; = map.iter().map(|(&amp;k, &amp;v)| (k, v)).collect();
/// // The `Iter` iterator produces items in arbitrary order, so the
/// // items must be sorted to test them against a sorted array.
/// vec.sort_unstable();
/// assert_eq!(vec, [(&quot;a&quot;, 1), (&quot;b&quot;, 2), (&quot;c&quot;, 3), (&quot;d&quot;, 4), (&quot;e&quot;, 5), (&quot;f&quot;, 6)]);
/// ```
</span><span class="kw">pub enum </span>Entry&lt;<span class="lifetime">&#39;a</span>, K, V, S, A = Global&gt;
<span class="kw">where
</span>A: Allocator + Clone,
{
<span class="doccomment">/// An occupied entry.
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{Entry, HashMap};
/// let mut map: HashMap&lt;_, _&gt; = [(&quot;a&quot;, 100), (&quot;b&quot;, 200)].into();
///
/// match map.entry(&quot;a&quot;) {
/// Entry::Vacant(_) =&gt; unreachable!(),
/// Entry::Occupied(_) =&gt; { }
/// }
/// ```
</span>Occupied(OccupiedEntry&lt;<span class="lifetime">&#39;a</span>, K, V, S, A&gt;),
<span class="doccomment">/// A vacant entry.
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{Entry, HashMap};
/// let mut map: HashMap&lt;&amp;str, i32&gt; = HashMap::new();
///
/// match map.entry(&quot;a&quot;) {
/// Entry::Occupied(_) =&gt; unreachable!(),
/// Entry::Vacant(_) =&gt; { }
/// }
/// ```
</span>Vacant(VacantEntry&lt;<span class="lifetime">&#39;a</span>, K, V, S, A&gt;),
}
<span class="kw">impl</span>&lt;K: Debug, V: Debug, S, A: Allocator + Clone&gt; Debug <span class="kw">for </span>Entry&lt;<span class="lifetime">&#39;_</span>, K, V, S, A&gt; {
<span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>fmt::Formatter&lt;<span class="lifetime">&#39;_</span>&gt;) -&gt; fmt::Result {
<span class="kw">match </span><span class="kw-2">*</span><span class="self">self </span>{
Entry::Vacant(<span class="kw-2">ref </span>v) =&gt; f.debug_tuple(<span class="string">&quot;Entry&quot;</span>).field(v).finish(),
Entry::Occupied(<span class="kw-2">ref </span>o) =&gt; f.debug_tuple(<span class="string">&quot;Entry&quot;</span>).field(o).finish(),
}
}
}
<span class="doccomment">/// A view into an occupied entry in a `HashMap`.
/// It is part of the [`Entry`] enum.
///
/// [`Entry`]: enum.Entry.html
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{Entry, HashMap, OccupiedEntry};
///
/// let mut map = HashMap::new();
/// map.extend([(&quot;a&quot;, 10), (&quot;b&quot;, 20), (&quot;c&quot;, 30)]);
///
/// let _entry_o: OccupiedEntry&lt;_, _, _&gt; = map.entry(&quot;a&quot;).insert(100);
/// assert_eq!(map.len(), 3);
///
/// // Existing key (insert and update)
/// match map.entry(&quot;a&quot;) {
/// Entry::Vacant(_) =&gt; unreachable!(),
/// Entry::Occupied(mut view) =&gt; {
/// assert_eq!(view.get(), &amp;100);
/// let v = view.get_mut();
/// *v *= 10;
/// assert_eq!(view.insert(1111), 1000);
/// }
/// }
///
/// assert_eq!(map[&amp;&quot;a&quot;], 1111);
/// assert_eq!(map.len(), 3);
///
/// // Existing key (take)
/// match map.entry(&quot;c&quot;) {
/// Entry::Vacant(_) =&gt; unreachable!(),
/// Entry::Occupied(view) =&gt; {
/// assert_eq!(view.remove_entry(), (&quot;c&quot;, 30));
/// }
/// }
/// assert_eq!(map.get(&amp;&quot;c&quot;), None);
/// assert_eq!(map.len(), 2);
/// ```
</span><span class="kw">pub struct </span>OccupiedEntry&lt;<span class="lifetime">&#39;a</span>, K, V, S, A: Allocator + Clone = Global&gt; {
hash: u64,
key: <span class="prelude-ty">Option</span>&lt;K&gt;,
elem: Bucket&lt;(K, V)&gt;,
table: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>HashMap&lt;K, V, S, A&gt;,
}
<span class="kw">unsafe impl</span>&lt;K, V, S, A&gt; Send <span class="kw">for </span>OccupiedEntry&lt;<span class="lifetime">&#39;_</span>, K, V, S, A&gt;
<span class="kw">where
</span>K: Send,
V: Send,
S: Send,
A: Send + Allocator + Clone,
{
}
<span class="kw">unsafe impl</span>&lt;K, V, S, A&gt; Sync <span class="kw">for </span>OccupiedEntry&lt;<span class="lifetime">&#39;_</span>, K, V, S, A&gt;
<span class="kw">where
</span>K: Sync,
V: Sync,
S: Sync,
A: Sync + Allocator + Clone,
{
}
<span class="kw">impl</span>&lt;K: Debug, V: Debug, S, A: Allocator + Clone&gt; Debug <span class="kw">for </span>OccupiedEntry&lt;<span class="lifetime">&#39;_</span>, K, V, S, A&gt; {
<span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>fmt::Formatter&lt;<span class="lifetime">&#39;_</span>&gt;) -&gt; fmt::Result {
f.debug_struct(<span class="string">&quot;OccupiedEntry&quot;</span>)
.field(<span class="string">&quot;key&quot;</span>, <span class="self">self</span>.key())
.field(<span class="string">&quot;value&quot;</span>, <span class="self">self</span>.get())
.finish()
}
}
<span class="doccomment">/// A view into a vacant entry in a `HashMap`.
/// It is part of the [`Entry`] enum.
///
/// [`Entry`]: enum.Entry.html
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{Entry, HashMap, VacantEntry};
///
/// let mut map = HashMap::&lt;&amp;str, i32&gt;::new();
///
/// let entry_v: VacantEntry&lt;_, _, _&gt; = match map.entry(&quot;a&quot;) {
/// Entry::Vacant(view) =&gt; view,
/// Entry::Occupied(_) =&gt; unreachable!(),
/// };
/// entry_v.insert(10);
/// assert!(map[&amp;&quot;a&quot;] == 10 &amp;&amp; map.len() == 1);
///
/// // Nonexistent key (insert and update)
/// match map.entry(&quot;b&quot;) {
/// Entry::Occupied(_) =&gt; unreachable!(),
/// Entry::Vacant(view) =&gt; {
/// let value = view.insert(2);
/// assert_eq!(*value, 2);
/// *value = 20;
/// }
/// }
/// assert!(map[&amp;&quot;b&quot;] == 20 &amp;&amp; map.len() == 2);
/// ```
</span><span class="kw">pub struct </span>VacantEntry&lt;<span class="lifetime">&#39;a</span>, K, V, S, A: Allocator + Clone = Global&gt; {
hash: u64,
key: K,
table: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>HashMap&lt;K, V, S, A&gt;,
}
<span class="kw">impl</span>&lt;K: Debug, V, S, A: Allocator + Clone&gt; Debug <span class="kw">for </span>VacantEntry&lt;<span class="lifetime">&#39;_</span>, K, V, S, A&gt; {
<span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>fmt::Formatter&lt;<span class="lifetime">&#39;_</span>&gt;) -&gt; fmt::Result {
f.debug_tuple(<span class="string">&quot;VacantEntry&quot;</span>).field(<span class="self">self</span>.key()).finish()
}
}
<span class="doccomment">/// A view into a single entry in a map, which may either be vacant or occupied,
/// with any borrowed form of the map&#39;s key type.
///
///
/// This `enum` is constructed from the [`entry_ref`] method on [`HashMap`].
///
/// [`Hash`] and [`Eq`] on the borrowed form of the map&#39;s key type *must* match those
/// for the key type. It also require that key may be constructed from the borrowed
/// form through the [`From`] trait.
///
/// [`HashMap`]: struct.HashMap.html
/// [`entry_ref`]: struct.HashMap.html#method.entry_ref
/// [`Eq`]: https://doc.rust-lang.org/std/cmp/trait.Eq.html
/// [`Hash`]: https://doc.rust-lang.org/std/hash/trait.Hash.html
/// [`From`]: https://doc.rust-lang.org/std/convert/trait.From.html
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{EntryRef, HashMap, OccupiedEntryRef};
///
/// let mut map = HashMap::new();
/// map.extend([(&quot;a&quot;.to_owned(), 10), (&quot;b&quot;.into(), 20), (&quot;c&quot;.into(), 30)]);
/// assert_eq!(map.len(), 3);
///
/// // Existing key (insert)
/// let key = String::from(&quot;a&quot;);
/// let entry: EntryRef&lt;_, _, _, _&gt; = map.entry_ref(&amp;key);
/// let _raw_o: OccupiedEntryRef&lt;_, _, _, _&gt; = entry.insert(1);
/// assert_eq!(map.len(), 3);
/// // Nonexistent key (insert)
/// map.entry_ref(&quot;d&quot;).insert(4);
///
/// // Existing key (or_insert)
/// let v = map.entry_ref(&quot;b&quot;).or_insert(2);
/// assert_eq!(std::mem::replace(v, 2), 20);
/// // Nonexistent key (or_insert)
/// map.entry_ref(&quot;e&quot;).or_insert(5);
///
/// // Existing key (or_insert_with)
/// let v = map.entry_ref(&quot;c&quot;).or_insert_with(|| 3);
/// assert_eq!(std::mem::replace(v, 3), 30);
/// // Nonexistent key (or_insert_with)
/// map.entry_ref(&quot;f&quot;).or_insert_with(|| 6);
///
/// println!(&quot;Our HashMap: {:?}&quot;, map);
///
/// for (key, value) in [&quot;a&quot;, &quot;b&quot;, &quot;c&quot;, &quot;d&quot;, &quot;e&quot;, &quot;f&quot;].into_iter().zip(1..=6) {
/// assert_eq!(map[key], value)
/// }
/// assert_eq!(map.len(), 6);
/// ```
</span><span class="kw">pub enum </span>EntryRef&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;b</span>, K, Q: <span class="question-mark">?</span>Sized, V, S, A = Global&gt;
<span class="kw">where
</span>A: Allocator + Clone,
{
<span class="doccomment">/// An occupied entry.
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{EntryRef, HashMap};
/// let mut map: HashMap&lt;_, _&gt; = [(&quot;a&quot;.to_owned(), 100), (&quot;b&quot;.into(), 200)].into();
///
/// match map.entry_ref(&quot;a&quot;) {
/// EntryRef::Vacant(_) =&gt; unreachable!(),
/// EntryRef::Occupied(_) =&gt; { }
/// }
/// ```
</span>Occupied(OccupiedEntryRef&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;b</span>, K, Q, V, S, A&gt;),
<span class="doccomment">/// A vacant entry.
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{EntryRef, HashMap};
/// let mut map: HashMap&lt;String, i32&gt; = HashMap::new();
///
/// match map.entry_ref(&quot;a&quot;) {
/// EntryRef::Occupied(_) =&gt; unreachable!(),
/// EntryRef::Vacant(_) =&gt; { }
/// }
/// ```
</span>Vacant(VacantEntryRef&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;b</span>, K, Q, V, S, A&gt;),
}
<span class="kw">impl</span>&lt;K: Borrow&lt;Q&gt;, Q: <span class="question-mark">?</span>Sized + Debug, V: Debug, S, A: Allocator + Clone&gt; Debug
<span class="kw">for </span>EntryRef&lt;<span class="lifetime">&#39;_</span>, <span class="lifetime">&#39;_</span>, K, Q, V, S, A&gt;
{
<span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>fmt::Formatter&lt;<span class="lifetime">&#39;_</span>&gt;) -&gt; fmt::Result {
<span class="kw">match </span><span class="kw-2">*</span><span class="self">self </span>{
EntryRef::Vacant(<span class="kw-2">ref </span>v) =&gt; f.debug_tuple(<span class="string">&quot;EntryRef&quot;</span>).field(v).finish(),
EntryRef::Occupied(<span class="kw-2">ref </span>o) =&gt; f.debug_tuple(<span class="string">&quot;EntryRef&quot;</span>).field(o).finish(),
}
}
}
<span class="kw">enum </span>KeyOrRef&lt;<span class="lifetime">&#39;a</span>, K, Q: <span class="question-mark">?</span>Sized&gt; {
Borrowed(<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>Q),
Owned(K),
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, K, Q: <span class="question-mark">?</span>Sized&gt; KeyOrRef&lt;<span class="lifetime">&#39;a</span>, K, Q&gt; {
<span class="kw">fn </span>into_owned(<span class="self">self</span>) -&gt; K
<span class="kw">where
</span>K: From&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>Q&gt;,
{
<span class="kw">match </span><span class="self">self </span>{
<span class="self">Self</span>::Borrowed(borrowed) =&gt; borrowed.into(),
<span class="self">Self</span>::Owned(owned) =&gt; owned,
}
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, K: Borrow&lt;Q&gt;, Q: <span class="question-mark">?</span>Sized&gt; AsRef&lt;Q&gt; <span class="kw">for </span>KeyOrRef&lt;<span class="lifetime">&#39;a</span>, K, Q&gt; {
<span class="kw">fn </span>as_ref(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>Q {
<span class="kw">match </span><span class="self">self </span>{
<span class="self">Self</span>::Borrowed(borrowed) =&gt; borrowed,
<span class="self">Self</span>::Owned(owned) =&gt; owned.borrow(),
}
}
}
<span class="doccomment">/// A view into an occupied entry in a `HashMap`.
/// It is part of the [`EntryRef`] enum.
///
/// [`EntryRef`]: enum.EntryRef.html
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{EntryRef, HashMap, OccupiedEntryRef};
///
/// let mut map = HashMap::new();
/// map.extend([(&quot;a&quot;.to_owned(), 10), (&quot;b&quot;.into(), 20), (&quot;c&quot;.into(), 30)]);
///
/// let key = String::from(&quot;a&quot;);
/// let _entry_o: OccupiedEntryRef&lt;_, _, _, _&gt; = map.entry_ref(&amp;key).insert(100);
/// assert_eq!(map.len(), 3);
///
/// // Existing key (insert and update)
/// match map.entry_ref(&quot;a&quot;) {
/// EntryRef::Vacant(_) =&gt; unreachable!(),
/// EntryRef::Occupied(mut view) =&gt; {
/// assert_eq!(view.get(), &amp;100);
/// let v = view.get_mut();
/// *v *= 10;
/// assert_eq!(view.insert(1111), 1000);
/// }
/// }
///
/// assert_eq!(map[&quot;a&quot;], 1111);
/// assert_eq!(map.len(), 3);
///
/// // Existing key (take)
/// match map.entry_ref(&quot;c&quot;) {
/// EntryRef::Vacant(_) =&gt; unreachable!(),
/// EntryRef::Occupied(view) =&gt; {
/// assert_eq!(view.remove_entry(), (&quot;c&quot;.to_owned(), 30));
/// }
/// }
/// assert_eq!(map.get(&quot;c&quot;), None);
/// assert_eq!(map.len(), 2);
/// ```
</span><span class="kw">pub struct </span>OccupiedEntryRef&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;b</span>, K, Q: <span class="question-mark">?</span>Sized, V, S, A: Allocator + Clone = Global&gt; {
hash: u64,
key: <span class="prelude-ty">Option</span>&lt;KeyOrRef&lt;<span class="lifetime">&#39;b</span>, K, Q&gt;&gt;,
elem: Bucket&lt;(K, V)&gt;,
table: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>HashMap&lt;K, V, S, A&gt;,
}
<span class="kw">unsafe impl</span>&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;b</span>, K, Q, V, S, A&gt; Send <span class="kw">for </span>OccupiedEntryRef&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;b</span>, K, Q, V, S, A&gt;
<span class="kw">where
</span>K: Send,
Q: Sync + <span class="question-mark">?</span>Sized,
V: Send,
S: Send,
A: Send + Allocator + Clone,
{
}
<span class="kw">unsafe impl</span>&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;b</span>, K, Q, V, S, A&gt; Sync <span class="kw">for </span>OccupiedEntryRef&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;b</span>, K, Q, V, S, A&gt;
<span class="kw">where
</span>K: Sync,
Q: Sync + <span class="question-mark">?</span>Sized,
V: Sync,
S: Sync,
A: Sync + Allocator + Clone,
{
}
<span class="kw">impl</span>&lt;K: Borrow&lt;Q&gt;, Q: <span class="question-mark">?</span>Sized + Debug, V: Debug, S, A: Allocator + Clone&gt; Debug
<span class="kw">for </span>OccupiedEntryRef&lt;<span class="lifetime">&#39;_</span>, <span class="lifetime">&#39;_</span>, K, Q, V, S, A&gt;
{
<span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>fmt::Formatter&lt;<span class="lifetime">&#39;_</span>&gt;) -&gt; fmt::Result {
f.debug_struct(<span class="string">&quot;OccupiedEntryRef&quot;</span>)
.field(<span class="string">&quot;key&quot;</span>, <span class="kw-2">&amp;</span><span class="self">self</span>.key())
.field(<span class="string">&quot;value&quot;</span>, <span class="kw-2">&amp;</span><span class="self">self</span>.get())
.finish()
}
}
<span class="doccomment">/// A view into a vacant entry in a `HashMap`.
/// It is part of the [`EntryRef`] enum.
///
/// [`EntryRef`]: enum.EntryRef.html
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{EntryRef, HashMap, VacantEntryRef};
///
/// let mut map = HashMap::&lt;String, i32&gt;::new();
///
/// let entry_v: VacantEntryRef&lt;_, _, _, _&gt; = match map.entry_ref(&quot;a&quot;) {
/// EntryRef::Vacant(view) =&gt; view,
/// EntryRef::Occupied(_) =&gt; unreachable!(),
/// };
/// entry_v.insert(10);
/// assert!(map[&quot;a&quot;] == 10 &amp;&amp; map.len() == 1);
///
/// // Nonexistent key (insert and update)
/// match map.entry_ref(&quot;b&quot;) {
/// EntryRef::Occupied(_) =&gt; unreachable!(),
/// EntryRef::Vacant(view) =&gt; {
/// let value = view.insert(2);
/// assert_eq!(*value, 2);
/// *value = 20;
/// }
/// }
/// assert!(map[&quot;b&quot;] == 20 &amp;&amp; map.len() == 2);
/// ```
</span><span class="kw">pub struct </span>VacantEntryRef&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;b</span>, K, Q: <span class="question-mark">?</span>Sized, V, S, A: Allocator + Clone = Global&gt; {
hash: u64,
key: KeyOrRef&lt;<span class="lifetime">&#39;b</span>, K, Q&gt;,
table: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>HashMap&lt;K, V, S, A&gt;,
}
<span class="kw">impl</span>&lt;K: Borrow&lt;Q&gt;, Q: <span class="question-mark">?</span>Sized + Debug, V, S, A: Allocator + Clone&gt; Debug
<span class="kw">for </span>VacantEntryRef&lt;<span class="lifetime">&#39;_</span>, <span class="lifetime">&#39;_</span>, K, Q, V, S, A&gt;
{
<span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>fmt::Formatter&lt;<span class="lifetime">&#39;_</span>&gt;) -&gt; fmt::Result {
f.debug_tuple(<span class="string">&quot;VacantEntryRef&quot;</span>).field(<span class="kw-2">&amp;</span><span class="self">self</span>.key()).finish()
}
}
<span class="doccomment">/// The error returned by [`try_insert`](HashMap::try_insert) when the key already exists.
///
/// Contains the occupied entry, and the value that was not inserted.
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{HashMap, OccupiedError};
///
/// let mut map: HashMap&lt;_, _&gt; = [(&quot;a&quot;, 10), (&quot;b&quot;, 20)].into();
///
/// // try_insert method returns mutable reference to the value if keys are vacant,
/// // but if the map did have key present, nothing is updated, and the provided
/// // value is returned inside `Err(_)` variant
/// match map.try_insert(&quot;a&quot;, 100) {
/// Err(OccupiedError { mut entry, value }) =&gt; {
/// assert_eq!(entry.key(), &amp;&quot;a&quot;);
/// assert_eq!(value, 100);
/// assert_eq!(entry.insert(100), 10)
/// }
/// _ =&gt; unreachable!(),
/// }
/// assert_eq!(map[&amp;&quot;a&quot;], 100);
/// ```
</span><span class="kw">pub struct </span>OccupiedError&lt;<span class="lifetime">&#39;a</span>, K, V, S, A: Allocator + Clone = Global&gt; {
<span class="doccomment">/// The entry in the map that was already occupied.
</span><span class="kw">pub </span>entry: OccupiedEntry&lt;<span class="lifetime">&#39;a</span>, K, V, S, A&gt;,
<span class="doccomment">/// The value which was not inserted, because the entry was already occupied.
</span><span class="kw">pub </span>value: V,
}
<span class="kw">impl</span>&lt;K: Debug, V: Debug, S, A: Allocator + Clone&gt; Debug <span class="kw">for </span>OccupiedError&lt;<span class="lifetime">&#39;_</span>, K, V, S, A&gt; {
<span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>fmt::Formatter&lt;<span class="lifetime">&#39;_</span>&gt;) -&gt; fmt::Result {
f.debug_struct(<span class="string">&quot;OccupiedError&quot;</span>)
.field(<span class="string">&quot;key&quot;</span>, <span class="self">self</span>.entry.key())
.field(<span class="string">&quot;old_value&quot;</span>, <span class="self">self</span>.entry.get())
.field(<span class="string">&quot;new_value&quot;</span>, <span class="kw-2">&amp;</span><span class="self">self</span>.value)
.finish()
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, K: Debug, V: Debug, S, A: Allocator + Clone&gt; fmt::Display
<span class="kw">for </span>OccupiedError&lt;<span class="lifetime">&#39;a</span>, K, V, S, A&gt;
{
<span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>fmt::Formatter&lt;<span class="lifetime">&#39;_</span>&gt;) -&gt; fmt::Result {
<span class="macro">write!</span>(
f,
<span class="string">&quot;failed to insert {:?}, key {:?} already exists with value {:?}&quot;</span>,
<span class="self">self</span>.value,
<span class="self">self</span>.entry.key(),
<span class="self">self</span>.entry.get(),
)
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, K, V, S, A: Allocator + Clone&gt; IntoIterator <span class="kw">for </span><span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>HashMap&lt;K, V, S, A&gt; {
<span class="kw">type </span>Item = (<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>K, <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>V);
<span class="kw">type </span>IntoIter = Iter&lt;<span class="lifetime">&#39;a</span>, K, V&gt;;
<span class="doccomment">/// Creates an iterator over the entries of a `HashMap` in arbitrary order.
/// The iterator element type is `(&amp;&#39;a K, &amp;&#39;a V)`.
///
/// Return the same `Iter` struct as by the [`iter`] method on [`HashMap`].
///
/// [`iter`]: struct.HashMap.html#method.iter
/// [`HashMap`]: struct.HashMap.html
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// let map_one: HashMap&lt;_, _&gt; = [(1, &quot;a&quot;), (2, &quot;b&quot;), (3, &quot;c&quot;)].into();
/// let mut map_two = HashMap::new();
///
/// for (key, value) in &amp;map_one {
/// println!(&quot;Key: {}, Value: {}&quot;, key, value);
/// map_two.insert_unique_unchecked(*key, *value);
/// }
///
/// assert_eq!(map_one, map_two);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>into_iter(<span class="self">self</span>) -&gt; Iter&lt;<span class="lifetime">&#39;a</span>, K, V&gt; {
<span class="self">self</span>.iter()
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, K, V, S, A: Allocator + Clone&gt; IntoIterator <span class="kw">for </span><span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>HashMap&lt;K, V, S, A&gt; {
<span class="kw">type </span>Item = (<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>K, <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>V);
<span class="kw">type </span>IntoIter = IterMut&lt;<span class="lifetime">&#39;a</span>, K, V&gt;;
<span class="doccomment">/// Creates an iterator over the entries of a `HashMap` in arbitrary order
/// with mutable references to the values. The iterator element type is
/// `(&amp;&#39;a K, &amp;&#39;a mut V)`.
///
/// Return the same `IterMut` struct as by the [`iter_mut`] method on
/// [`HashMap`].
///
/// [`iter_mut`]: struct.HashMap.html#method.iter_mut
/// [`HashMap`]: struct.HashMap.html
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// let mut map: HashMap&lt;_, _&gt; = [(&quot;a&quot;, 1), (&quot;b&quot;, 2), (&quot;c&quot;, 3)].into();
///
/// for (key, value) in &amp;mut map {
/// println!(&quot;Key: {}, Value: {}&quot;, key, value);
/// *value *= 2;
/// }
///
/// let mut vec = map.iter().collect::&lt;Vec&lt;_&gt;&gt;();
/// // The `Iter` iterator produces items in arbitrary order, so the
/// // items must be sorted to test them against a sorted array.
/// vec.sort_unstable();
/// assert_eq!(vec, [(&amp;&quot;a&quot;, &amp;2), (&amp;&quot;b&quot;, &amp;4), (&amp;&quot;c&quot;, &amp;6)]);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>into_iter(<span class="self">self</span>) -&gt; IterMut&lt;<span class="lifetime">&#39;a</span>, K, V&gt; {
<span class="self">self</span>.iter_mut()
}
}
<span class="kw">impl</span>&lt;K, V, S, A: Allocator + Clone&gt; IntoIterator <span class="kw">for </span>HashMap&lt;K, V, S, A&gt; {
<span class="kw">type </span>Item = (K, V);
<span class="kw">type </span>IntoIter = IntoIter&lt;K, V, A&gt;;
<span class="doccomment">/// Creates a consuming iterator, that is, one that moves each key-value
/// pair out of the map in arbitrary order. The map cannot be used after
/// calling this.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let map: HashMap&lt;_, _&gt; = [(&quot;a&quot;, 1), (&quot;b&quot;, 2), (&quot;c&quot;, 3)].into();
///
/// // Not possible with .iter()
/// let mut vec: Vec&lt;(&amp;str, i32)&gt; = map.into_iter().collect();
/// // The `IntoIter` iterator produces items in arbitrary order, so
/// // the items must be sorted to test them against a sorted array.
/// vec.sort_unstable();
/// assert_eq!(vec, [(&quot;a&quot;, 1), (&quot;b&quot;, 2), (&quot;c&quot;, 3)]);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>into_iter(<span class="self">self</span>) -&gt; IntoIter&lt;K, V, A&gt; {
IntoIter {
inner: <span class="self">self</span>.table.into_iter(),
}
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, K, V&gt; Iterator <span class="kw">for </span>Iter&lt;<span class="lifetime">&#39;a</span>, K, V&gt; {
<span class="kw">type </span>Item = (<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>K, <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>V);
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;(<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>K, <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>V)&gt; {
<span class="comment">// Avoid `Option::map` because it bloats LLVM IR.
</span><span class="kw">match </span><span class="self">self</span>.inner.next() {
<span class="prelude-val">Some</span>(x) =&gt; <span class="kw">unsafe </span>{
<span class="kw">let </span>r = x.as_ref();
<span class="prelude-val">Some</span>((<span class="kw-2">&amp;</span>r.<span class="number">0</span>, <span class="kw-2">&amp;</span>r.<span class="number">1</span>))
},
<span class="prelude-val">None </span>=&gt; <span class="prelude-val">None</span>,
}
}
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>size_hint(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; (usize, <span class="prelude-ty">Option</span>&lt;usize&gt;) {
<span class="self">self</span>.inner.size_hint()
}
}
<span class="kw">impl</span>&lt;K, V&gt; ExactSizeIterator <span class="kw">for </span>Iter&lt;<span class="lifetime">&#39;_</span>, K, V&gt; {
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>len(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
<span class="self">self</span>.inner.len()
}
}
<span class="kw">impl</span>&lt;K, V&gt; FusedIterator <span class="kw">for </span>Iter&lt;<span class="lifetime">&#39;_</span>, K, V&gt; {}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, K, V&gt; Iterator <span class="kw">for </span>IterMut&lt;<span class="lifetime">&#39;a</span>, K, V&gt; {
<span class="kw">type </span>Item = (<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>K, <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>V);
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;(<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>K, <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>V)&gt; {
<span class="comment">// Avoid `Option::map` because it bloats LLVM IR.
</span><span class="kw">match </span><span class="self">self</span>.inner.next() {
<span class="prelude-val">Some</span>(x) =&gt; <span class="kw">unsafe </span>{
<span class="kw">let </span>r = x.as_mut();
<span class="prelude-val">Some</span>((<span class="kw-2">&amp;</span>r.<span class="number">0</span>, <span class="kw-2">&amp;mut </span>r.<span class="number">1</span>))
},
<span class="prelude-val">None </span>=&gt; <span class="prelude-val">None</span>,
}
}
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>size_hint(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; (usize, <span class="prelude-ty">Option</span>&lt;usize&gt;) {
<span class="self">self</span>.inner.size_hint()
}
}
<span class="kw">impl</span>&lt;K, V&gt; ExactSizeIterator <span class="kw">for </span>IterMut&lt;<span class="lifetime">&#39;_</span>, K, V&gt; {
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>len(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
<span class="self">self</span>.inner.len()
}
}
<span class="kw">impl</span>&lt;K, V&gt; FusedIterator <span class="kw">for </span>IterMut&lt;<span class="lifetime">&#39;_</span>, K, V&gt; {}
<span class="kw">impl</span>&lt;K, V&gt; fmt::Debug <span class="kw">for </span>IterMut&lt;<span class="lifetime">&#39;_</span>, K, V&gt;
<span class="kw">where
</span>K: fmt::Debug,
V: fmt::Debug,
{
<span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>fmt::Formatter&lt;<span class="lifetime">&#39;_</span>&gt;) -&gt; fmt::Result {
f.debug_list().entries(<span class="self">self</span>.iter()).finish()
}
}
<span class="kw">impl</span>&lt;K, V, A: Allocator + Clone&gt; Iterator <span class="kw">for </span>IntoIter&lt;K, V, A&gt; {
<span class="kw">type </span>Item = (K, V);
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;(K, V)&gt; {
<span class="self">self</span>.inner.next()
}
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>size_hint(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; (usize, <span class="prelude-ty">Option</span>&lt;usize&gt;) {
<span class="self">self</span>.inner.size_hint()
}
}
<span class="kw">impl</span>&lt;K, V, A: Allocator + Clone&gt; ExactSizeIterator <span class="kw">for </span>IntoIter&lt;K, V, A&gt; {
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>len(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
<span class="self">self</span>.inner.len()
}
}
<span class="kw">impl</span>&lt;K, V, A: Allocator + Clone&gt; FusedIterator <span class="kw">for </span>IntoIter&lt;K, V, A&gt; {}
<span class="kw">impl</span>&lt;K: Debug, V: Debug, A: Allocator + Clone&gt; fmt::Debug <span class="kw">for </span>IntoIter&lt;K, V, A&gt; {
<span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>fmt::Formatter&lt;<span class="lifetime">&#39;_</span>&gt;) -&gt; fmt::Result {
f.debug_list().entries(<span class="self">self</span>.iter()).finish()
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, K, V&gt; Iterator <span class="kw">for </span>Keys&lt;<span class="lifetime">&#39;a</span>, K, V&gt; {
<span class="kw">type </span>Item = <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>K;
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>K&gt; {
<span class="comment">// Avoid `Option::map` because it bloats LLVM IR.
</span><span class="kw">match </span><span class="self">self</span>.inner.next() {
<span class="prelude-val">Some</span>((k, <span class="kw">_</span>)) =&gt; <span class="prelude-val">Some</span>(k),
<span class="prelude-val">None </span>=&gt; <span class="prelude-val">None</span>,
}
}
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>size_hint(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; (usize, <span class="prelude-ty">Option</span>&lt;usize&gt;) {
<span class="self">self</span>.inner.size_hint()
}
}
<span class="kw">impl</span>&lt;K, V&gt; ExactSizeIterator <span class="kw">for </span>Keys&lt;<span class="lifetime">&#39;_</span>, K, V&gt; {
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>len(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
<span class="self">self</span>.inner.len()
}
}
<span class="kw">impl</span>&lt;K, V&gt; FusedIterator <span class="kw">for </span>Keys&lt;<span class="lifetime">&#39;_</span>, K, V&gt; {}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, K, V&gt; Iterator <span class="kw">for </span>Values&lt;<span class="lifetime">&#39;a</span>, K, V&gt; {
<span class="kw">type </span>Item = <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>V;
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>V&gt; {
<span class="comment">// Avoid `Option::map` because it bloats LLVM IR.
</span><span class="kw">match </span><span class="self">self</span>.inner.next() {
<span class="prelude-val">Some</span>((<span class="kw">_</span>, v)) =&gt; <span class="prelude-val">Some</span>(v),
<span class="prelude-val">None </span>=&gt; <span class="prelude-val">None</span>,
}
}
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>size_hint(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; (usize, <span class="prelude-ty">Option</span>&lt;usize&gt;) {
<span class="self">self</span>.inner.size_hint()
}
}
<span class="kw">impl</span>&lt;K, V&gt; ExactSizeIterator <span class="kw">for </span>Values&lt;<span class="lifetime">&#39;_</span>, K, V&gt; {
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>len(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
<span class="self">self</span>.inner.len()
}
}
<span class="kw">impl</span>&lt;K, V&gt; FusedIterator <span class="kw">for </span>Values&lt;<span class="lifetime">&#39;_</span>, K, V&gt; {}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, K, V&gt; Iterator <span class="kw">for </span>ValuesMut&lt;<span class="lifetime">&#39;a</span>, K, V&gt; {
<span class="kw">type </span>Item = <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>V;
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>V&gt; {
<span class="comment">// Avoid `Option::map` because it bloats LLVM IR.
</span><span class="kw">match </span><span class="self">self</span>.inner.next() {
<span class="prelude-val">Some</span>((<span class="kw">_</span>, v)) =&gt; <span class="prelude-val">Some</span>(v),
<span class="prelude-val">None </span>=&gt; <span class="prelude-val">None</span>,
}
}
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>size_hint(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; (usize, <span class="prelude-ty">Option</span>&lt;usize&gt;) {
<span class="self">self</span>.inner.size_hint()
}
}
<span class="kw">impl</span>&lt;K, V&gt; ExactSizeIterator <span class="kw">for </span>ValuesMut&lt;<span class="lifetime">&#39;_</span>, K, V&gt; {
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>len(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
<span class="self">self</span>.inner.len()
}
}
<span class="kw">impl</span>&lt;K, V&gt; FusedIterator <span class="kw">for </span>ValuesMut&lt;<span class="lifetime">&#39;_</span>, K, V&gt; {}
<span class="kw">impl</span>&lt;K, V: Debug&gt; fmt::Debug <span class="kw">for </span>ValuesMut&lt;<span class="lifetime">&#39;_</span>, K, V&gt; {
<span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>fmt::Formatter&lt;<span class="lifetime">&#39;_</span>&gt;) -&gt; fmt::Result {
f.debug_list()
.entries(<span class="self">self</span>.inner.iter().map(|(<span class="kw">_</span>, val)| val))
.finish()
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, K, V, A: Allocator + Clone&gt; Iterator <span class="kw">for </span>Drain&lt;<span class="lifetime">&#39;a</span>, K, V, A&gt; {
<span class="kw">type </span>Item = (K, V);
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;(K, V)&gt; {
<span class="self">self</span>.inner.next()
}
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>size_hint(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; (usize, <span class="prelude-ty">Option</span>&lt;usize&gt;) {
<span class="self">self</span>.inner.size_hint()
}
}
<span class="kw">impl</span>&lt;K, V, A: Allocator + Clone&gt; ExactSizeIterator <span class="kw">for </span>Drain&lt;<span class="lifetime">&#39;_</span>, K, V, A&gt; {
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>len(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
<span class="self">self</span>.inner.len()
}
}
<span class="kw">impl</span>&lt;K, V, A: Allocator + Clone&gt; FusedIterator <span class="kw">for </span>Drain&lt;<span class="lifetime">&#39;_</span>, K, V, A&gt; {}
<span class="kw">impl</span>&lt;K, V, A&gt; fmt::Debug <span class="kw">for </span>Drain&lt;<span class="lifetime">&#39;_</span>, K, V, A&gt;
<span class="kw">where
</span>K: fmt::Debug,
V: fmt::Debug,
A: Allocator + Clone,
{
<span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>fmt::Formatter&lt;<span class="lifetime">&#39;_</span>&gt;) -&gt; fmt::Result {
f.debug_list().entries(<span class="self">self</span>.iter()).finish()
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, K, V, S, A: Allocator + Clone&gt; Entry&lt;<span class="lifetime">&#39;a</span>, K, V, S, A&gt; {
<span class="doccomment">/// Sets the value of the entry, and returns an OccupiedEntry.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = HashMap::new();
/// let entry = map.entry(&quot;horseyland&quot;).insert(37);
///
/// assert_eq!(entry.key(), &amp;&quot;horseyland&quot;);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>insert(<span class="self">self</span>, value: V) -&gt; OccupiedEntry&lt;<span class="lifetime">&#39;a</span>, K, V, S, A&gt;
<span class="kw">where
</span>K: Hash,
S: BuildHasher,
{
<span class="kw">match </span><span class="self">self </span>{
Entry::Occupied(<span class="kw-2">mut </span>entry) =&gt; {
entry.insert(value);
entry
}
Entry::Vacant(entry) =&gt; entry.insert_entry(value),
}
}
<span class="doccomment">/// Ensures a value is in the entry by inserting the default if empty, and returns
/// a mutable reference to the value in the entry.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = HashMap::new();
///
/// // nonexistent key
/// map.entry(&quot;poneyland&quot;).or_insert(3);
/// assert_eq!(map[&quot;poneyland&quot;], 3);
///
/// // existing key
/// *map.entry(&quot;poneyland&quot;).or_insert(10) *= 2;
/// assert_eq!(map[&quot;poneyland&quot;], 6);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>or_insert(<span class="self">self</span>, default: V) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>V
<span class="kw">where
</span>K: Hash,
S: BuildHasher,
{
<span class="kw">match </span><span class="self">self </span>{
Entry::Occupied(entry) =&gt; entry.into_mut(),
Entry::Vacant(entry) =&gt; entry.insert(default),
}
}
<span class="doccomment">/// Ensures a value is in the entry by inserting the result of the default function if empty,
/// and returns a mutable reference to the value in the entry.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = HashMap::new();
///
/// // nonexistent key
/// map.entry(&quot;poneyland&quot;).or_insert_with(|| 3);
/// assert_eq!(map[&quot;poneyland&quot;], 3);
///
/// // existing key
/// *map.entry(&quot;poneyland&quot;).or_insert_with(|| 10) *= 2;
/// assert_eq!(map[&quot;poneyland&quot;], 6);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>or_insert_with&lt;F: FnOnce() -&gt; V&gt;(<span class="self">self</span>, default: F) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>V
<span class="kw">where
</span>K: Hash,
S: BuildHasher,
{
<span class="kw">match </span><span class="self">self </span>{
Entry::Occupied(entry) =&gt; entry.into_mut(),
Entry::Vacant(entry) =&gt; entry.insert(default()),
}
}
<span class="doccomment">/// Ensures a value is in the entry by inserting, if empty, the result of the default function.
/// This method allows for generating key-derived values for insertion by providing the default
/// function a reference to the key that was moved during the `.entry(key)` method call.
///
/// The reference to the moved key is provided so that cloning or copying the key is
/// unnecessary, unlike with `.or_insert_with(|| ... )`.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map: HashMap&lt;&amp;str, usize&gt; = HashMap::new();
///
/// // nonexistent key
/// map.entry(&quot;poneyland&quot;).or_insert_with_key(|key| key.chars().count());
/// assert_eq!(map[&quot;poneyland&quot;], 9);
///
/// // existing key
/// *map.entry(&quot;poneyland&quot;).or_insert_with_key(|key| key.chars().count() * 10) *= 2;
/// assert_eq!(map[&quot;poneyland&quot;], 18);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>or_insert_with_key&lt;F: FnOnce(<span class="kw-2">&amp;</span>K) -&gt; V&gt;(<span class="self">self</span>, default: F) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>V
<span class="kw">where
</span>K: Hash,
S: BuildHasher,
{
<span class="kw">match </span><span class="self">self </span>{
Entry::Occupied(entry) =&gt; entry.into_mut(),
Entry::Vacant(entry) =&gt; {
<span class="kw">let </span>value = default(entry.key());
entry.insert(value)
}
}
}
<span class="doccomment">/// Returns a reference to this entry&#39;s key.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = HashMap::new();
/// map.entry(&quot;poneyland&quot;).or_insert(3);
/// // existing key
/// assert_eq!(map.entry(&quot;poneyland&quot;).key(), &amp;&quot;poneyland&quot;);
/// // nonexistent key
/// assert_eq!(map.entry(&quot;horseland&quot;).key(), &amp;&quot;horseland&quot;);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>key(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>K {
<span class="kw">match </span><span class="kw-2">*</span><span class="self">self </span>{
Entry::Occupied(<span class="kw-2">ref </span>entry) =&gt; entry.key(),
Entry::Vacant(<span class="kw-2">ref </span>entry) =&gt; entry.key(),
}
}
<span class="doccomment">/// Provides in-place mutable access to an occupied entry before any
/// potential inserts into the map.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = HashMap::new();
///
/// map.entry(&quot;poneyland&quot;)
/// .and_modify(|e| { *e += 1 })
/// .or_insert(42);
/// assert_eq!(map[&quot;poneyland&quot;], 42);
///
/// map.entry(&quot;poneyland&quot;)
/// .and_modify(|e| { *e += 1 })
/// .or_insert(42);
/// assert_eq!(map[&quot;poneyland&quot;], 43);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>and_modify&lt;F&gt;(<span class="self">self</span>, f: F) -&gt; <span class="self">Self
</span><span class="kw">where
</span>F: FnOnce(<span class="kw-2">&amp;mut </span>V),
{
<span class="kw">match </span><span class="self">self </span>{
Entry::Occupied(<span class="kw-2">mut </span>entry) =&gt; {
f(entry.get_mut());
Entry::Occupied(entry)
}
Entry::Vacant(entry) =&gt; Entry::Vacant(entry),
}
}
<span class="doccomment">/// Provides shared access to the key and owned access to the value of
/// an occupied entry and allows to replace or remove it based on the
/// value of the returned option.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// use hashbrown::hash_map::Entry;
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = HashMap::new();
///
/// let entry = map
/// .entry(&quot;poneyland&quot;)
/// .and_replace_entry_with(|_k, _v| panic!());
///
/// match entry {
/// Entry::Vacant(e) =&gt; {
/// assert_eq!(e.key(), &amp;&quot;poneyland&quot;);
/// }
/// Entry::Occupied(_) =&gt; panic!(),
/// }
///
/// map.insert(&quot;poneyland&quot;, 42);
///
/// let entry = map
/// .entry(&quot;poneyland&quot;)
/// .and_replace_entry_with(|k, v| {
/// assert_eq!(k, &amp;&quot;poneyland&quot;);
/// assert_eq!(v, 42);
/// Some(v + 1)
/// });
///
/// match entry {
/// Entry::Occupied(e) =&gt; {
/// assert_eq!(e.key(), &amp;&quot;poneyland&quot;);
/// assert_eq!(e.get(), &amp;43);
/// }
/// Entry::Vacant(_) =&gt; panic!(),
/// }
///
/// assert_eq!(map[&quot;poneyland&quot;], 43);
///
/// let entry = map
/// .entry(&quot;poneyland&quot;)
/// .and_replace_entry_with(|_k, _v| None);
///
/// match entry {
/// Entry::Vacant(e) =&gt; assert_eq!(e.key(), &amp;&quot;poneyland&quot;),
/// Entry::Occupied(_) =&gt; panic!(),
/// }
///
/// assert!(!map.contains_key(&quot;poneyland&quot;));
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>and_replace_entry_with&lt;F&gt;(<span class="self">self</span>, f: F) -&gt; <span class="self">Self
</span><span class="kw">where
</span>F: FnOnce(<span class="kw-2">&amp;</span>K, V) -&gt; <span class="prelude-ty">Option</span>&lt;V&gt;,
{
<span class="kw">match </span><span class="self">self </span>{
Entry::Occupied(entry) =&gt; entry.replace_entry_with(f),
Entry::Vacant(<span class="kw">_</span>) =&gt; <span class="self">self</span>,
}
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, K, V: Default, S, A: Allocator + Clone&gt; Entry&lt;<span class="lifetime">&#39;a</span>, K, V, S, A&gt; {
<span class="doccomment">/// Ensures a value is in the entry by inserting the default value if empty,
/// and returns a mutable reference to the value in the entry.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map: HashMap&lt;&amp;str, Option&lt;u32&gt;&gt; = HashMap::new();
///
/// // nonexistent key
/// map.entry(&quot;poneyland&quot;).or_default();
/// assert_eq!(map[&quot;poneyland&quot;], None);
///
/// map.insert(&quot;horseland&quot;, Some(3));
///
/// // existing key
/// assert_eq!(map.entry(&quot;horseland&quot;).or_default(), &amp;mut Some(3));
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>or_default(<span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>V
<span class="kw">where
</span>K: Hash,
S: BuildHasher,
{
<span class="kw">match </span><span class="self">self </span>{
Entry::Occupied(entry) =&gt; entry.into_mut(),
Entry::Vacant(entry) =&gt; entry.insert(Default::default()),
}
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, K, V, S, A: Allocator + Clone&gt; OccupiedEntry&lt;<span class="lifetime">&#39;a</span>, K, V, S, A&gt; {
<span class="doccomment">/// Gets a reference to the key in the entry.
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{Entry, HashMap};
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = HashMap::new();
/// map.entry(&quot;poneyland&quot;).or_insert(12);
///
/// match map.entry(&quot;poneyland&quot;) {
/// Entry::Vacant(_) =&gt; panic!(),
/// Entry::Occupied(entry) =&gt; assert_eq!(entry.key(), &amp;&quot;poneyland&quot;),
/// }
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>key(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>K {
<span class="kw">unsafe </span>{ <span class="kw-2">&amp;</span><span class="self">self</span>.elem.as_ref().<span class="number">0 </span>}
}
<span class="doccomment">/// Take the ownership of the key and value from the map.
/// Keeps the allocated memory for reuse.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// use hashbrown::hash_map::Entry;
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = HashMap::new();
/// // The map is empty
/// assert!(map.is_empty() &amp;&amp; map.capacity() == 0);
///
/// map.entry(&quot;poneyland&quot;).or_insert(12);
/// let capacity_before_remove = map.capacity();
///
/// if let Entry::Occupied(o) = map.entry(&quot;poneyland&quot;) {
/// // We delete the entry from the map.
/// assert_eq!(o.remove_entry(), (&quot;poneyland&quot;, 12));
/// }
///
/// assert_eq!(map.contains_key(&quot;poneyland&quot;), false);
/// // Now map hold none elements but capacity is equal to the old one
/// assert!(map.len() == 0 &amp;&amp; map.capacity() == capacity_before_remove);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>remove_entry(<span class="self">self</span>) -&gt; (K, V) {
<span class="kw">unsafe </span>{ <span class="self">self</span>.table.table.remove(<span class="self">self</span>.elem) }
}
<span class="doccomment">/// Gets a reference to the value in the entry.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// use hashbrown::hash_map::Entry;
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = HashMap::new();
/// map.entry(&quot;poneyland&quot;).or_insert(12);
///
/// match map.entry(&quot;poneyland&quot;) {
/// Entry::Vacant(_) =&gt; panic!(),
/// Entry::Occupied(entry) =&gt; assert_eq!(entry.get(), &amp;12),
/// }
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>get(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>V {
<span class="kw">unsafe </span>{ <span class="kw-2">&amp;</span><span class="self">self</span>.elem.as_ref().<span class="number">1 </span>}
}
<span class="doccomment">/// Gets a mutable reference to the value in the entry.
///
/// If you need a reference to the `OccupiedEntry` which may outlive the
/// destruction of the `Entry` value, see [`into_mut`].
///
/// [`into_mut`]: #method.into_mut
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// use hashbrown::hash_map::Entry;
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = HashMap::new();
/// map.entry(&quot;poneyland&quot;).or_insert(12);
///
/// assert_eq!(map[&quot;poneyland&quot;], 12);
/// if let Entry::Occupied(mut o) = map.entry(&quot;poneyland&quot;) {
/// *o.get_mut() += 10;
/// assert_eq!(*o.get(), 22);
///
/// // We can use the same Entry multiple times.
/// *o.get_mut() += 2;
/// }
///
/// assert_eq!(map[&quot;poneyland&quot;], 24);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>get_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;mut </span>V {
<span class="kw">unsafe </span>{ <span class="kw-2">&amp;mut </span><span class="self">self</span>.elem.as_mut().<span class="number">1 </span>}
}
<span class="doccomment">/// Converts the OccupiedEntry into a mutable reference to the value in the entry
/// with a lifetime bound to the map itself.
///
/// If you need multiple references to the `OccupiedEntry`, see [`get_mut`].
///
/// [`get_mut`]: #method.get_mut
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{Entry, HashMap};
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = HashMap::new();
/// map.entry(&quot;poneyland&quot;).or_insert(12);
///
/// assert_eq!(map[&quot;poneyland&quot;], 12);
///
/// let value: &amp;mut u32;
/// match map.entry(&quot;poneyland&quot;) {
/// Entry::Occupied(entry) =&gt; value = entry.into_mut(),
/// Entry::Vacant(_) =&gt; panic!(),
/// }
/// *value += 10;
///
/// assert_eq!(map[&quot;poneyland&quot;], 22);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>into_mut(<span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>V {
<span class="kw">unsafe </span>{ <span class="kw-2">&amp;mut </span><span class="self">self</span>.elem.as_mut().<span class="number">1 </span>}
}
<span class="doccomment">/// Sets the value of the entry, and returns the entry&#39;s old value.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// use hashbrown::hash_map::Entry;
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = HashMap::new();
/// map.entry(&quot;poneyland&quot;).or_insert(12);
///
/// if let Entry::Occupied(mut o) = map.entry(&quot;poneyland&quot;) {
/// assert_eq!(o.insert(15), 12);
/// }
///
/// assert_eq!(map[&quot;poneyland&quot;], 15);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>insert(<span class="kw-2">&amp;mut </span><span class="self">self</span>, value: V) -&gt; V {
mem::replace(<span class="self">self</span>.get_mut(), value)
}
<span class="doccomment">/// Takes the value out of the entry, and returns it.
/// Keeps the allocated memory for reuse.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// use hashbrown::hash_map::Entry;
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = HashMap::new();
/// // The map is empty
/// assert!(map.is_empty() &amp;&amp; map.capacity() == 0);
///
/// map.entry(&quot;poneyland&quot;).or_insert(12);
/// let capacity_before_remove = map.capacity();
///
/// if let Entry::Occupied(o) = map.entry(&quot;poneyland&quot;) {
/// assert_eq!(o.remove(), 12);
/// }
///
/// assert_eq!(map.contains_key(&quot;poneyland&quot;), false);
/// // Now map hold none elements but capacity is equal to the old one
/// assert!(map.len() == 0 &amp;&amp; map.capacity() == capacity_before_remove);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>remove(<span class="self">self</span>) -&gt; V {
<span class="self">self</span>.remove_entry().<span class="number">1
</span>}
<span class="doccomment">/// Replaces the entry, returning the old key and value. The new key in the hash map will be
/// the key used to create this entry.
///
/// # Panics
///
/// Will panic if this OccupiedEntry was created through [`Entry::insert`].
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{Entry, HashMap};
/// use std::rc::Rc;
///
/// let mut map: HashMap&lt;Rc&lt;String&gt;, u32&gt; = HashMap::new();
/// let key_one = Rc::new(&quot;Stringthing&quot;.to_string());
/// let key_two = Rc::new(&quot;Stringthing&quot;.to_string());
///
/// map.insert(key_one.clone(), 15);
/// assert!(Rc::strong_count(&amp;key_one) == 2 &amp;&amp; Rc::strong_count(&amp;key_two) == 1);
///
/// match map.entry(key_two.clone()) {
/// Entry::Occupied(entry) =&gt; {
/// let (old_key, old_value): (Rc&lt;String&gt;, u32) = entry.replace_entry(16);
/// assert!(Rc::ptr_eq(&amp;key_one, &amp;old_key) &amp;&amp; old_value == 15);
/// }
/// Entry::Vacant(_) =&gt; panic!(),
/// }
///
/// assert!(Rc::strong_count(&amp;key_one) == 1 &amp;&amp; Rc::strong_count(&amp;key_two) == 2);
/// assert_eq!(map[&amp;&quot;Stringthing&quot;.to_owned()], 16);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>replace_entry(<span class="self">self</span>, value: V) -&gt; (K, V) {
<span class="kw">let </span>entry = <span class="kw">unsafe </span>{ <span class="self">self</span>.elem.as_mut() };
<span class="kw">let </span>old_key = mem::replace(<span class="kw-2">&amp;mut </span>entry.<span class="number">0</span>, <span class="self">self</span>.key.unwrap());
<span class="kw">let </span>old_value = mem::replace(<span class="kw-2">&amp;mut </span>entry.<span class="number">1</span>, value);
(old_key, old_value)
}
<span class="doccomment">/// Replaces the key in the hash map with the key used to create this entry.
///
/// # Panics
///
/// Will panic if this OccupiedEntry was created through [`Entry::insert`].
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{Entry, HashMap};
/// use std::rc::Rc;
///
/// let mut map: HashMap&lt;Rc&lt;String&gt;, usize&gt; = HashMap::with_capacity(6);
/// let mut keys_one: Vec&lt;Rc&lt;String&gt;&gt; = Vec::with_capacity(6);
/// let mut keys_two: Vec&lt;Rc&lt;String&gt;&gt; = Vec::with_capacity(6);
///
/// for (value, key) in [&quot;a&quot;, &quot;b&quot;, &quot;c&quot;, &quot;d&quot;, &quot;e&quot;, &quot;f&quot;].into_iter().enumerate() {
/// let rc_key = Rc::new(key.to_owned());
/// keys_one.push(rc_key.clone());
/// map.insert(rc_key.clone(), value);
/// keys_two.push(Rc::new(key.to_owned()));
/// }
///
/// assert!(
/// keys_one.iter().all(|key| Rc::strong_count(key) == 2)
/// &amp;&amp; keys_two.iter().all(|key| Rc::strong_count(key) == 1)
/// );
///
/// reclaim_memory(&amp;mut map, &amp;keys_two);
///
/// assert!(
/// keys_one.iter().all(|key| Rc::strong_count(key) == 1)
/// &amp;&amp; keys_two.iter().all(|key| Rc::strong_count(key) == 2)
/// );
///
/// fn reclaim_memory(map: &amp;mut HashMap&lt;Rc&lt;String&gt;, usize&gt;, keys: &amp;[Rc&lt;String&gt;]) {
/// for key in keys {
/// if let Entry::Occupied(entry) = map.entry(key.clone()) {
/// // Replaces the entry&#39;s key with our version of it in `keys`.
/// entry.replace_key();
/// }
/// }
/// }
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>replace_key(<span class="self">self</span>) -&gt; K {
<span class="kw">let </span>entry = <span class="kw">unsafe </span>{ <span class="self">self</span>.elem.as_mut() };
mem::replace(<span class="kw-2">&amp;mut </span>entry.<span class="number">0</span>, <span class="self">self</span>.key.unwrap())
}
<span class="doccomment">/// Provides shared access to the key and owned access to the value of
/// the entry and allows to replace or remove it based on the
/// value of the returned option.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// use hashbrown::hash_map::Entry;
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = HashMap::new();
/// map.insert(&quot;poneyland&quot;, 42);
///
/// let entry = match map.entry(&quot;poneyland&quot;) {
/// Entry::Occupied(e) =&gt; {
/// e.replace_entry_with(|k, v| {
/// assert_eq!(k, &amp;&quot;poneyland&quot;);
/// assert_eq!(v, 42);
/// Some(v + 1)
/// })
/// }
/// Entry::Vacant(_) =&gt; panic!(),
/// };
///
/// match entry {
/// Entry::Occupied(e) =&gt; {
/// assert_eq!(e.key(), &amp;&quot;poneyland&quot;);
/// assert_eq!(e.get(), &amp;43);
/// }
/// Entry::Vacant(_) =&gt; panic!(),
/// }
///
/// assert_eq!(map[&quot;poneyland&quot;], 43);
///
/// let entry = match map.entry(&quot;poneyland&quot;) {
/// Entry::Occupied(e) =&gt; e.replace_entry_with(|_k, _v| None),
/// Entry::Vacant(_) =&gt; panic!(),
/// };
///
/// match entry {
/// Entry::Vacant(e) =&gt; {
/// assert_eq!(e.key(), &amp;&quot;poneyland&quot;);
/// }
/// Entry::Occupied(_) =&gt; panic!(),
/// }
///
/// assert!(!map.contains_key(&quot;poneyland&quot;));
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>replace_entry_with&lt;F&gt;(<span class="self">self</span>, f: F) -&gt; Entry&lt;<span class="lifetime">&#39;a</span>, K, V, S, A&gt;
<span class="kw">where
</span>F: FnOnce(<span class="kw-2">&amp;</span>K, V) -&gt; <span class="prelude-ty">Option</span>&lt;V&gt;,
{
<span class="kw">unsafe </span>{
<span class="kw">let </span><span class="kw-2">mut </span>spare_key = <span class="prelude-val">None</span>;
<span class="self">self</span>.table
.table
.replace_bucket_with(<span class="self">self</span>.elem.clone(), |(key, value)| {
<span class="kw">if let </span><span class="prelude-val">Some</span>(new_value) = f(<span class="kw-2">&amp;</span>key, value) {
<span class="prelude-val">Some</span>((key, new_value))
} <span class="kw">else </span>{
spare_key = <span class="prelude-val">Some</span>(key);
<span class="prelude-val">None
</span>}
});
<span class="kw">if let </span><span class="prelude-val">Some</span>(key) = spare_key {
Entry::Vacant(VacantEntry {
hash: <span class="self">self</span>.hash,
key,
table: <span class="self">self</span>.table,
})
} <span class="kw">else </span>{
Entry::Occupied(<span class="self">self</span>)
}
}
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, K, V, S, A: Allocator + Clone&gt; VacantEntry&lt;<span class="lifetime">&#39;a</span>, K, V, S, A&gt; {
<span class="doccomment">/// Gets a reference to the key that would be used when inserting a value
/// through the `VacantEntry`.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = HashMap::new();
/// assert_eq!(map.entry(&quot;poneyland&quot;).key(), &amp;&quot;poneyland&quot;);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>key(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>K {
<span class="kw-2">&amp;</span><span class="self">self</span>.key
}
<span class="doccomment">/// Take ownership of the key.
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{Entry, HashMap};
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = HashMap::new();
///
/// match map.entry(&quot;poneyland&quot;) {
/// Entry::Occupied(_) =&gt; panic!(),
/// Entry::Vacant(v) =&gt; assert_eq!(v.into_key(), &quot;poneyland&quot;),
/// }
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>into_key(<span class="self">self</span>) -&gt; K {
<span class="self">self</span>.key
}
<span class="doccomment">/// Sets the value of the entry with the VacantEntry&#39;s key,
/// and returns a mutable reference to it.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// use hashbrown::hash_map::Entry;
///
/// let mut map: HashMap&lt;&amp;str, u32&gt; = HashMap::new();
///
/// if let Entry::Vacant(o) = map.entry(&quot;poneyland&quot;) {
/// o.insert(37);
/// }
/// assert_eq!(map[&quot;poneyland&quot;], 37);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>insert(<span class="self">self</span>, value: V) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>V
<span class="kw">where
</span>K: Hash,
S: BuildHasher,
{
<span class="kw">let </span>table = <span class="kw-2">&amp;mut </span><span class="self">self</span>.table.table;
<span class="kw">let </span>entry = table.insert_entry(
<span class="self">self</span>.hash,
(<span class="self">self</span>.key, value),
make_hasher::&lt;K, <span class="kw">_</span>, V, S&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>.table.hash_builder),
);
<span class="kw-2">&amp;mut </span>entry.<span class="number">1
</span>}
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>insert_entry(<span class="self">self</span>, value: V) -&gt; OccupiedEntry&lt;<span class="lifetime">&#39;a</span>, K, V, S, A&gt;
<span class="kw">where
</span>K: Hash,
S: BuildHasher,
{
<span class="kw">let </span>elem = <span class="self">self</span>.table.table.insert(
<span class="self">self</span>.hash,
(<span class="self">self</span>.key, value),
make_hasher::&lt;K, <span class="kw">_</span>, V, S&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>.table.hash_builder),
);
OccupiedEntry {
hash: <span class="self">self</span>.hash,
key: <span class="prelude-val">None</span>,
elem,
table: <span class="self">self</span>.table,
}
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;b</span>, K, Q: <span class="question-mark">?</span>Sized, V, S, A: Allocator + Clone&gt; EntryRef&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;b</span>, K, Q, V, S, A&gt; {
<span class="doccomment">/// Sets the value of the entry, and returns an OccupiedEntryRef.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map: HashMap&lt;String, u32&gt; = HashMap::new();
/// let entry = map.entry_ref(&quot;horseyland&quot;).insert(37);
///
/// assert_eq!(entry.key(), &quot;horseyland&quot;);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>insert(<span class="self">self</span>, value: V) -&gt; OccupiedEntryRef&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;b</span>, K, Q, V, S, A&gt;
<span class="kw">where
</span>K: Hash + From&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;b </span>Q&gt;,
S: BuildHasher,
{
<span class="kw">match </span><span class="self">self </span>{
EntryRef::Occupied(<span class="kw-2">mut </span>entry) =&gt; {
entry.insert(value);
entry
}
EntryRef::Vacant(entry) =&gt; entry.insert_entry(value),
}
}
<span class="doccomment">/// Ensures a value is in the entry by inserting the default if empty, and returns
/// a mutable reference to the value in the entry.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map: HashMap&lt;String, u32&gt; = HashMap::new();
///
/// // nonexistent key
/// map.entry_ref(&quot;poneyland&quot;).or_insert(3);
/// assert_eq!(map[&quot;poneyland&quot;], 3);
///
/// // existing key
/// *map.entry_ref(&quot;poneyland&quot;).or_insert(10) *= 2;
/// assert_eq!(map[&quot;poneyland&quot;], 6);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>or_insert(<span class="self">self</span>, default: V) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>V
<span class="kw">where
</span>K: Hash + From&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;b </span>Q&gt;,
S: BuildHasher,
{
<span class="kw">match </span><span class="self">self </span>{
EntryRef::Occupied(entry) =&gt; entry.into_mut(),
EntryRef::Vacant(entry) =&gt; entry.insert(default),
}
}
<span class="doccomment">/// Ensures a value is in the entry by inserting the result of the default function if empty,
/// and returns a mutable reference to the value in the entry.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map: HashMap&lt;String, u32&gt; = HashMap::new();
///
/// // nonexistent key
/// map.entry_ref(&quot;poneyland&quot;).or_insert_with(|| 3);
/// assert_eq!(map[&quot;poneyland&quot;], 3);
///
/// // existing key
/// *map.entry_ref(&quot;poneyland&quot;).or_insert_with(|| 10) *= 2;
/// assert_eq!(map[&quot;poneyland&quot;], 6);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>or_insert_with&lt;F: FnOnce() -&gt; V&gt;(<span class="self">self</span>, default: F) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>V
<span class="kw">where
</span>K: Hash + From&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;b </span>Q&gt;,
S: BuildHasher,
{
<span class="kw">match </span><span class="self">self </span>{
EntryRef::Occupied(entry) =&gt; entry.into_mut(),
EntryRef::Vacant(entry) =&gt; entry.insert(default()),
}
}
<span class="doccomment">/// Ensures a value is in the entry by inserting, if empty, the result of the default function.
/// This method allows for generating key-derived values for insertion by providing the default
/// function a reference to the key that was moved during the `.entry_ref(key)` method call.
///
/// The reference to the moved key is provided so that cloning or copying the key is
/// unnecessary, unlike with `.or_insert_with(|| ... )`.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map: HashMap&lt;String, usize&gt; = HashMap::new();
///
/// // nonexistent key
/// map.entry_ref(&quot;poneyland&quot;).or_insert_with_key(|key| key.chars().count());
/// assert_eq!(map[&quot;poneyland&quot;], 9);
///
/// // existing key
/// *map.entry_ref(&quot;poneyland&quot;).or_insert_with_key(|key| key.chars().count() * 10) *= 2;
/// assert_eq!(map[&quot;poneyland&quot;], 18);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>or_insert_with_key&lt;F: FnOnce(<span class="kw-2">&amp;</span>Q) -&gt; V&gt;(<span class="self">self</span>, default: F) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>V
<span class="kw">where
</span>K: Hash + Borrow&lt;Q&gt; + From&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;b </span>Q&gt;,
S: BuildHasher,
{
<span class="kw">match </span><span class="self">self </span>{
EntryRef::Occupied(entry) =&gt; entry.into_mut(),
EntryRef::Vacant(entry) =&gt; {
<span class="kw">let </span>value = default(entry.key.as_ref());
entry.insert(value)
}
}
}
<span class="doccomment">/// Returns a reference to this entry&#39;s key.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map: HashMap&lt;String, u32&gt; = HashMap::new();
/// map.entry_ref(&quot;poneyland&quot;).or_insert(3);
/// // existing key
/// assert_eq!(map.entry_ref(&quot;poneyland&quot;).key(), &quot;poneyland&quot;);
/// // nonexistent key
/// assert_eq!(map.entry_ref(&quot;horseland&quot;).key(), &quot;horseland&quot;);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>key(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>Q
<span class="kw">where
</span>K: Borrow&lt;Q&gt;,
{
<span class="kw">match </span><span class="kw-2">*</span><span class="self">self </span>{
EntryRef::Occupied(<span class="kw-2">ref </span>entry) =&gt; entry.key(),
EntryRef::Vacant(<span class="kw-2">ref </span>entry) =&gt; entry.key(),
}
}
<span class="doccomment">/// Provides in-place mutable access to an occupied entry before any
/// potential inserts into the map.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map: HashMap&lt;String, u32&gt; = HashMap::new();
///
/// map.entry_ref(&quot;poneyland&quot;)
/// .and_modify(|e| { *e += 1 })
/// .or_insert(42);
/// assert_eq!(map[&quot;poneyland&quot;], 42);
///
/// map.entry_ref(&quot;poneyland&quot;)
/// .and_modify(|e| { *e += 1 })
/// .or_insert(42);
/// assert_eq!(map[&quot;poneyland&quot;], 43);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>and_modify&lt;F&gt;(<span class="self">self</span>, f: F) -&gt; <span class="self">Self
</span><span class="kw">where
</span>F: FnOnce(<span class="kw-2">&amp;mut </span>V),
{
<span class="kw">match </span><span class="self">self </span>{
EntryRef::Occupied(<span class="kw-2">mut </span>entry) =&gt; {
f(entry.get_mut());
EntryRef::Occupied(entry)
}
EntryRef::Vacant(entry) =&gt; EntryRef::Vacant(entry),
}
}
<span class="doccomment">/// Provides shared access to the key and owned access to the value of
/// an occupied entry and allows to replace or remove it based on the
/// value of the returned option.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// use hashbrown::hash_map::EntryRef;
///
/// let mut map: HashMap&lt;String, u32&gt; = HashMap::new();
///
/// let entry = map
/// .entry_ref(&quot;poneyland&quot;)
/// .and_replace_entry_with(|_k, _v| panic!());
///
/// match entry {
/// EntryRef::Vacant(e) =&gt; {
/// assert_eq!(e.key(), &quot;poneyland&quot;);
/// }
/// EntryRef::Occupied(_) =&gt; panic!(),
/// }
///
/// map.insert(&quot;poneyland&quot;.to_string(), 42);
///
/// let entry = map
/// .entry_ref(&quot;poneyland&quot;)
/// .and_replace_entry_with(|k, v| {
/// assert_eq!(k, &quot;poneyland&quot;);
/// assert_eq!(v, 42);
/// Some(v + 1)
/// });
///
/// match entry {
/// EntryRef::Occupied(e) =&gt; {
/// assert_eq!(e.key(), &quot;poneyland&quot;);
/// assert_eq!(e.get(), &amp;43);
/// }
/// EntryRef::Vacant(_) =&gt; panic!(),
/// }
///
/// assert_eq!(map[&quot;poneyland&quot;], 43);
///
/// let entry = map
/// .entry_ref(&quot;poneyland&quot;)
/// .and_replace_entry_with(|_k, _v| None);
///
/// match entry {
/// EntryRef::Vacant(e) =&gt; assert_eq!(e.key(), &quot;poneyland&quot;),
/// EntryRef::Occupied(_) =&gt; panic!(),
/// }
///
/// assert!(!map.contains_key(&quot;poneyland&quot;));
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>and_replace_entry_with&lt;F&gt;(<span class="self">self</span>, f: F) -&gt; <span class="self">Self
</span><span class="kw">where
</span>F: FnOnce(<span class="kw-2">&amp;</span>Q, V) -&gt; <span class="prelude-ty">Option</span>&lt;V&gt;,
K: Borrow&lt;Q&gt;,
{
<span class="kw">match </span><span class="self">self </span>{
EntryRef::Occupied(entry) =&gt; entry.replace_entry_with(f),
EntryRef::Vacant(<span class="kw">_</span>) =&gt; <span class="self">self</span>,
}
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;b</span>, K, Q: <span class="question-mark">?</span>Sized, V: Default, S, A: Allocator + Clone&gt; EntryRef&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;b</span>, K, Q, V, S, A&gt; {
<span class="doccomment">/// Ensures a value is in the entry by inserting the default value if empty,
/// and returns a mutable reference to the value in the entry.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map: HashMap&lt;String, Option&lt;u32&gt;&gt; = HashMap::new();
///
/// // nonexistent key
/// map.entry_ref(&quot;poneyland&quot;).or_default();
/// assert_eq!(map[&quot;poneyland&quot;], None);
///
/// map.insert(&quot;horseland&quot;.to_string(), Some(3));
///
/// // existing key
/// assert_eq!(map.entry_ref(&quot;horseland&quot;).or_default(), &amp;mut Some(3));
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>or_default(<span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>V
<span class="kw">where
</span>K: Hash + From&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;b </span>Q&gt;,
S: BuildHasher,
{
<span class="kw">match </span><span class="self">self </span>{
EntryRef::Occupied(entry) =&gt; entry.into_mut(),
EntryRef::Vacant(entry) =&gt; entry.insert(Default::default()),
}
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;b</span>, K, Q: <span class="question-mark">?</span>Sized, V, S, A: Allocator + Clone&gt; OccupiedEntryRef&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;b</span>, K, Q, V, S, A&gt; {
<span class="doccomment">/// Gets a reference to the key in the entry.
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{EntryRef, HashMap};
///
/// let mut map: HashMap&lt;String, u32&gt; = HashMap::new();
/// map.entry_ref(&quot;poneyland&quot;).or_insert(12);
///
/// match map.entry_ref(&quot;poneyland&quot;) {
/// EntryRef::Vacant(_) =&gt; panic!(),
/// EntryRef::Occupied(entry) =&gt; assert_eq!(entry.key(), &quot;poneyland&quot;),
/// }
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>key(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>Q
<span class="kw">where
</span>K: Borrow&lt;Q&gt;,
{
<span class="kw">unsafe </span>{ <span class="kw-2">&amp;</span><span class="self">self</span>.elem.as_ref().<span class="number">0 </span>}.borrow()
}
<span class="doccomment">/// Take the ownership of the key and value from the map.
/// Keeps the allocated memory for reuse.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// use hashbrown::hash_map::EntryRef;
///
/// let mut map: HashMap&lt;String, u32&gt; = HashMap::new();
/// // The map is empty
/// assert!(map.is_empty() &amp;&amp; map.capacity() == 0);
///
/// map.entry_ref(&quot;poneyland&quot;).or_insert(12);
/// let capacity_before_remove = map.capacity();
///
/// if let EntryRef::Occupied(o) = map.entry_ref(&quot;poneyland&quot;) {
/// // We delete the entry from the map.
/// assert_eq!(o.remove_entry(), (&quot;poneyland&quot;.to_owned(), 12));
/// }
///
/// assert_eq!(map.contains_key(&quot;poneyland&quot;), false);
/// // Now map hold none elements but capacity is equal to the old one
/// assert!(map.len() == 0 &amp;&amp; map.capacity() == capacity_before_remove);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>remove_entry(<span class="self">self</span>) -&gt; (K, V) {
<span class="kw">unsafe </span>{ <span class="self">self</span>.table.table.remove(<span class="self">self</span>.elem) }
}
<span class="doccomment">/// Gets a reference to the value in the entry.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// use hashbrown::hash_map::EntryRef;
///
/// let mut map: HashMap&lt;String, u32&gt; = HashMap::new();
/// map.entry_ref(&quot;poneyland&quot;).or_insert(12);
///
/// match map.entry_ref(&quot;poneyland&quot;) {
/// EntryRef::Vacant(_) =&gt; panic!(),
/// EntryRef::Occupied(entry) =&gt; assert_eq!(entry.get(), &amp;12),
/// }
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>get(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>V {
<span class="kw">unsafe </span>{ <span class="kw-2">&amp;</span><span class="self">self</span>.elem.as_ref().<span class="number">1 </span>}
}
<span class="doccomment">/// Gets a mutable reference to the value in the entry.
///
/// If you need a reference to the `OccupiedEntryRef` which may outlive the
/// destruction of the `EntryRef` value, see [`into_mut`].
///
/// [`into_mut`]: #method.into_mut
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// use hashbrown::hash_map::EntryRef;
///
/// let mut map: HashMap&lt;String, u32&gt; = HashMap::new();
/// map.entry_ref(&quot;poneyland&quot;).or_insert(12);
///
/// assert_eq!(map[&quot;poneyland&quot;], 12);
/// if let EntryRef::Occupied(mut o) = map.entry_ref(&quot;poneyland&quot;) {
/// *o.get_mut() += 10;
/// assert_eq!(*o.get(), 22);
///
/// // We can use the same Entry multiple times.
/// *o.get_mut() += 2;
/// }
///
/// assert_eq!(map[&quot;poneyland&quot;], 24);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>get_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;mut </span>V {
<span class="kw">unsafe </span>{ <span class="kw-2">&amp;mut </span><span class="self">self</span>.elem.as_mut().<span class="number">1 </span>}
}
<span class="doccomment">/// Converts the OccupiedEntryRef into a mutable reference to the value in the entry
/// with a lifetime bound to the map itself.
///
/// If you need multiple references to the `OccupiedEntryRef`, see [`get_mut`].
///
/// [`get_mut`]: #method.get_mut
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{EntryRef, HashMap};
///
/// let mut map: HashMap&lt;String, u32&gt; = HashMap::new();
/// map.entry_ref(&quot;poneyland&quot;).or_insert(12);
///
/// let value: &amp;mut u32;
/// match map.entry_ref(&quot;poneyland&quot;) {
/// EntryRef::Occupied(entry) =&gt; value = entry.into_mut(),
/// EntryRef::Vacant(_) =&gt; panic!(),
/// }
/// *value += 10;
///
/// assert_eq!(map[&quot;poneyland&quot;], 22);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>into_mut(<span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>V {
<span class="kw">unsafe </span>{ <span class="kw-2">&amp;mut </span><span class="self">self</span>.elem.as_mut().<span class="number">1 </span>}
}
<span class="doccomment">/// Sets the value of the entry, and returns the entry&#39;s old value.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// use hashbrown::hash_map::EntryRef;
///
/// let mut map: HashMap&lt;String, u32&gt; = HashMap::new();
/// map.entry_ref(&quot;poneyland&quot;).or_insert(12);
///
/// if let EntryRef::Occupied(mut o) = map.entry_ref(&quot;poneyland&quot;) {
/// assert_eq!(o.insert(15), 12);
/// }
///
/// assert_eq!(map[&quot;poneyland&quot;], 15);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>insert(<span class="kw-2">&amp;mut </span><span class="self">self</span>, value: V) -&gt; V {
mem::replace(<span class="self">self</span>.get_mut(), value)
}
<span class="doccomment">/// Takes the value out of the entry, and returns it.
/// Keeps the allocated memory for reuse.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// use hashbrown::hash_map::EntryRef;
///
/// let mut map: HashMap&lt;String, u32&gt; = HashMap::new();
/// // The map is empty
/// assert!(map.is_empty() &amp;&amp; map.capacity() == 0);
///
/// map.entry_ref(&quot;poneyland&quot;).or_insert(12);
/// let capacity_before_remove = map.capacity();
///
/// if let EntryRef::Occupied(o) = map.entry_ref(&quot;poneyland&quot;) {
/// assert_eq!(o.remove(), 12);
/// }
///
/// assert_eq!(map.contains_key(&quot;poneyland&quot;), false);
/// // Now map hold none elements but capacity is equal to the old one
/// assert!(map.len() == 0 &amp;&amp; map.capacity() == capacity_before_remove);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>remove(<span class="self">self</span>) -&gt; V {
<span class="self">self</span>.remove_entry().<span class="number">1
</span>}
<span class="doccomment">/// Replaces the entry, returning the old key and value. The new key in the hash map will be
/// the key used to create this entry.
///
/// # Panics
///
/// Will panic if this OccupiedEntry was created through [`EntryRef::insert`].
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{EntryRef, HashMap};
/// use std::rc::Rc;
///
/// let mut map: HashMap&lt;Rc&lt;str&gt;, u32&gt; = HashMap::new();
/// let key: Rc&lt;str&gt; = Rc::from(&quot;Stringthing&quot;);
///
/// map.insert(key.clone(), 15);
/// assert_eq!(Rc::strong_count(&amp;key), 2);
///
/// match map.entry_ref(&quot;Stringthing&quot;) {
/// EntryRef::Occupied(entry) =&gt; {
/// let (old_key, old_value): (Rc&lt;str&gt;, u32) = entry.replace_entry(16);
/// assert!(Rc::ptr_eq(&amp;key, &amp;old_key) &amp;&amp; old_value == 15);
/// }
/// EntryRef::Vacant(_) =&gt; panic!(),
/// }
///
/// assert_eq!(Rc::strong_count(&amp;key), 1);
/// assert_eq!(map[&quot;Stringthing&quot;], 16);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>replace_entry(<span class="self">self</span>, value: V) -&gt; (K, V)
<span class="kw">where
</span>K: From&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;b </span>Q&gt;,
{
<span class="kw">let </span>entry = <span class="kw">unsafe </span>{ <span class="self">self</span>.elem.as_mut() };
<span class="kw">let </span>old_key = mem::replace(<span class="kw-2">&amp;mut </span>entry.<span class="number">0</span>, <span class="self">self</span>.key.unwrap().into_owned());
<span class="kw">let </span>old_value = mem::replace(<span class="kw-2">&amp;mut </span>entry.<span class="number">1</span>, value);
(old_key, old_value)
}
<span class="doccomment">/// Replaces the key in the hash map with the key used to create this entry.
///
/// # Panics
///
/// Will panic if this OccupiedEntry was created through [`Entry::insert`].
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{EntryRef, HashMap};
/// use std::rc::Rc;
///
/// let mut map: HashMap&lt;Rc&lt;str&gt;, usize&gt; = HashMap::with_capacity(6);
/// let mut keys: Vec&lt;Rc&lt;str&gt;&gt; = Vec::with_capacity(6);
///
/// for (value, key) in [&quot;a&quot;, &quot;b&quot;, &quot;c&quot;, &quot;d&quot;, &quot;e&quot;, &quot;f&quot;].into_iter().enumerate() {
/// let rc_key: Rc&lt;str&gt; = Rc::from(key);
/// keys.push(rc_key.clone());
/// map.insert(rc_key.clone(), value);
/// }
///
/// assert!(keys.iter().all(|key| Rc::strong_count(key) == 2));
///
/// // It doesn&#39;t matter that we kind of use a vector with the same keys,
/// // because all keys will be newly created from the references
/// reclaim_memory(&amp;mut map, &amp;keys);
///
/// assert!(keys.iter().all(|key| Rc::strong_count(key) == 1));
///
/// fn reclaim_memory(map: &amp;mut HashMap&lt;Rc&lt;str&gt;, usize&gt;, keys: &amp;[Rc&lt;str&gt;]) {
/// for key in keys {
/// if let EntryRef::Occupied(entry) = map.entry_ref(key.as_ref()) {
/// /// Replaces the entry&#39;s key with our version of it in `keys`.
/// entry.replace_key();
/// }
/// }
/// }
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>replace_key(<span class="self">self</span>) -&gt; K
<span class="kw">where
</span>K: From&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;b </span>Q&gt;,
{
<span class="kw">let </span>entry = <span class="kw">unsafe </span>{ <span class="self">self</span>.elem.as_mut() };
mem::replace(<span class="kw-2">&amp;mut </span>entry.<span class="number">0</span>, <span class="self">self</span>.key.unwrap().into_owned())
}
<span class="doccomment">/// Provides shared access to the key and owned access to the value of
/// the entry and allows to replace or remove it based on the
/// value of the returned option.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// use hashbrown::hash_map::EntryRef;
///
/// let mut map: HashMap&lt;String, u32&gt; = HashMap::new();
/// map.insert(&quot;poneyland&quot;.to_string(), 42);
///
/// let entry = match map.entry_ref(&quot;poneyland&quot;) {
/// EntryRef::Occupied(e) =&gt; {
/// e.replace_entry_with(|k, v| {
/// assert_eq!(k, &quot;poneyland&quot;);
/// assert_eq!(v, 42);
/// Some(v + 1)
/// })
/// }
/// EntryRef::Vacant(_) =&gt; panic!(),
/// };
///
/// match entry {
/// EntryRef::Occupied(e) =&gt; {
/// assert_eq!(e.key(), &quot;poneyland&quot;);
/// assert_eq!(e.get(), &amp;43);
/// }
/// EntryRef::Vacant(_) =&gt; panic!(),
/// }
///
/// assert_eq!(map[&quot;poneyland&quot;], 43);
///
/// let entry = match map.entry_ref(&quot;poneyland&quot;) {
/// EntryRef::Occupied(e) =&gt; e.replace_entry_with(|_k, _v| None),
/// EntryRef::Vacant(_) =&gt; panic!(),
/// };
///
/// match entry {
/// EntryRef::Vacant(e) =&gt; {
/// assert_eq!(e.key(), &quot;poneyland&quot;);
/// }
/// EntryRef::Occupied(_) =&gt; panic!(),
/// }
///
/// assert!(!map.contains_key(&quot;poneyland&quot;));
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>replace_entry_with&lt;F&gt;(<span class="self">self</span>, f: F) -&gt; EntryRef&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;b</span>, K, Q, V, S, A&gt;
<span class="kw">where
</span>F: FnOnce(<span class="kw-2">&amp;</span>Q, V) -&gt; <span class="prelude-ty">Option</span>&lt;V&gt;,
K: Borrow&lt;Q&gt;,
{
<span class="kw">unsafe </span>{
<span class="kw">let </span><span class="kw-2">mut </span>spare_key = <span class="prelude-val">None</span>;
<span class="self">self</span>.table
.table
.replace_bucket_with(<span class="self">self</span>.elem.clone(), |(key, value)| {
<span class="kw">if let </span><span class="prelude-val">Some</span>(new_value) = f(key.borrow(), value) {
<span class="prelude-val">Some</span>((key, new_value))
} <span class="kw">else </span>{
spare_key = <span class="prelude-val">Some</span>(KeyOrRef::Owned(key));
<span class="prelude-val">None
</span>}
});
<span class="kw">if let </span><span class="prelude-val">Some</span>(key) = spare_key {
EntryRef::Vacant(VacantEntryRef {
hash: <span class="self">self</span>.hash,
key,
table: <span class="self">self</span>.table,
})
} <span class="kw">else </span>{
EntryRef::Occupied(<span class="self">self</span>)
}
}
}
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;b</span>, K, Q: <span class="question-mark">?</span>Sized, V, S, A: Allocator + Clone&gt; VacantEntryRef&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;b</span>, K, Q, V, S, A&gt; {
<span class="doccomment">/// Gets a reference to the key that would be used when inserting a value
/// through the `VacantEntryRef`.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
///
/// let mut map: HashMap&lt;String, u32&gt; = HashMap::new();
/// let key: &amp;str = &quot;poneyland&quot;;
/// assert_eq!(map.entry_ref(key).key(), &quot;poneyland&quot;);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>key(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>Q
<span class="kw">where
</span>K: Borrow&lt;Q&gt;,
{
<span class="self">self</span>.key.as_ref()
}
<span class="doccomment">/// Take ownership of the key.
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::{EntryRef, HashMap};
///
/// let mut map: HashMap&lt;String, u32&gt; = HashMap::new();
/// let key: &amp;str = &quot;poneyland&quot;;
///
/// match map.entry_ref(key) {
/// EntryRef::Occupied(_) =&gt; panic!(),
/// EntryRef::Vacant(v) =&gt; assert_eq!(v.into_key(), &quot;poneyland&quot;.to_owned()),
/// }
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>into_key(<span class="self">self</span>) -&gt; K
<span class="kw">where
</span>K: From&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;b </span>Q&gt;,
{
<span class="self">self</span>.key.into_owned()
}
<span class="doccomment">/// Sets the value of the entry with the VacantEntryRef&#39;s key,
/// and returns a mutable reference to it.
///
/// # Examples
///
/// ```
/// use hashbrown::HashMap;
/// use hashbrown::hash_map::EntryRef;
///
/// let mut map: HashMap&lt;String, u32&gt; = HashMap::new();
/// let key: &amp;str = &quot;poneyland&quot;;
///
/// if let EntryRef::Vacant(o) = map.entry_ref(key) {
/// o.insert(37);
/// }
/// assert_eq!(map[&quot;poneyland&quot;], 37);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">pub fn </span>insert(<span class="self">self</span>, value: V) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>V
<span class="kw">where
</span>K: Hash + From&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;b </span>Q&gt;,
S: BuildHasher,
{
<span class="kw">let </span>table = <span class="kw-2">&amp;mut </span><span class="self">self</span>.table.table;
<span class="kw">let </span>entry = table.insert_entry(
<span class="self">self</span>.hash,
(<span class="self">self</span>.key.into_owned(), value),
make_hasher::&lt;K, <span class="kw">_</span>, V, S&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>.table.hash_builder),
);
<span class="kw-2">&amp;mut </span>entry.<span class="number">1
</span>}
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>insert_entry(<span class="self">self</span>, value: V) -&gt; OccupiedEntryRef&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;b</span>, K, Q, V, S, A&gt;
<span class="kw">where
</span>K: Hash + From&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;b </span>Q&gt;,
S: BuildHasher,
{
<span class="kw">let </span>elem = <span class="self">self</span>.table.table.insert(
<span class="self">self</span>.hash,
(<span class="self">self</span>.key.into_owned(), value),
make_hasher::&lt;K, <span class="kw">_</span>, V, S&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>.table.hash_builder),
);
OccupiedEntryRef {
hash: <span class="self">self</span>.hash,
key: <span class="prelude-val">None</span>,
elem,
table: <span class="self">self</span>.table,
}
}
}
<span class="kw">impl</span>&lt;K, V, S, A&gt; FromIterator&lt;(K, V)&gt; <span class="kw">for </span>HashMap&lt;K, V, S, A&gt;
<span class="kw">where
</span>K: Eq + Hash,
S: BuildHasher + Default,
A: Default + Allocator + Clone,
{
<span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>from_iter&lt;T: IntoIterator&lt;Item = (K, V)&gt;&gt;(iter: T) -&gt; <span class="self">Self </span>{
<span class="kw">let </span>iter = iter.into_iter();
<span class="kw">let </span><span class="kw-2">mut </span>map =
<span class="self">Self</span>::with_capacity_and_hasher_in(iter.size_hint().<span class="number">0</span>, S::default(), A::default());
iter.for_each(|(k, v)| {
map.insert(k, v);
});
map
}
}
<span class="doccomment">/// Inserts all new key-values from the iterator and replaces values with existing
/// keys with new values returned from the iterator.
</span><span class="kw">impl</span>&lt;K, V, S, A&gt; Extend&lt;(K, V)&gt; <span class="kw">for </span>HashMap&lt;K, V, S, A&gt;
<span class="kw">where
</span>K: Eq + Hash,
S: BuildHasher,
A: Allocator + Clone,
{
<span class="doccomment">/// Inserts all new key-values from the iterator to existing `HashMap&lt;K, V, S, A&gt;`.
/// Replace values with existing keys with new values returned from the iterator.
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::HashMap;
///
/// let mut map = HashMap::new();
/// map.insert(1, 100);
///
/// let some_iter = [(1, 1), (2, 2)].into_iter();
/// map.extend(some_iter);
/// // Replace values with existing keys with new values returned from the iterator.
/// // So that the map.get(&amp;1) doesn&#39;t return Some(&amp;100).
/// assert_eq!(map.get(&amp;1), Some(&amp;1));
///
/// let some_vec: Vec&lt;_&gt; = vec![(3, 3), (4, 4)];
/// map.extend(some_vec);
///
/// let some_arr = [(5, 5), (6, 6)];
/// map.extend(some_arr);
/// let old_map_len = map.len();
///
/// // You can also extend from another HashMap
/// let mut new_map = HashMap::new();
/// new_map.extend(map);
/// assert_eq!(new_map.len(), old_map_len);
///
/// let mut vec: Vec&lt;_&gt; = new_map.into_iter().collect();
/// // The `IntoIter` iterator produces items in arbitrary order, so the
/// // items must be sorted to test them against a sorted array.
/// vec.sort_unstable();
/// assert_eq!(vec, [(1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6)]);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>extend&lt;T: IntoIterator&lt;Item = (K, V)&gt;&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, iter: T) {
<span class="comment">// Keys may be already present or show multiple times in the iterator.
// Reserve the entire hint lower bound if the map is empty.
// Otherwise reserve half the hint (rounded up), so the map
// will only resize twice in the worst case.
</span><span class="kw">let </span>iter = iter.into_iter();
<span class="kw">let </span>reserve = <span class="kw">if </span><span class="self">self</span>.is_empty() {
iter.size_hint().<span class="number">0
</span>} <span class="kw">else </span>{
(iter.size_hint().<span class="number">0 </span>+ <span class="number">1</span>) / <span class="number">2
</span>};
<span class="self">self</span>.reserve(reserve);
iter.for_each(<span class="kw">move </span>|(k, v)| {
<span class="self">self</span>.insert(k, v);
});
}
<span class="attribute">#[inline]
#[cfg(feature = <span class="string">&quot;nightly&quot;</span>)]
</span><span class="kw">fn </span>extend_one(<span class="kw-2">&amp;mut </span><span class="self">self</span>, (k, v): (K, V)) {
<span class="self">self</span>.insert(k, v);
}
<span class="attribute">#[inline]
#[cfg(feature = <span class="string">&quot;nightly&quot;</span>)]
</span><span class="kw">fn </span>extend_reserve(<span class="kw-2">&amp;mut </span><span class="self">self</span>, additional: usize) {
<span class="comment">// Keys may be already present or show multiple times in the iterator.
// Reserve the entire hint lower bound if the map is empty.
// Otherwise reserve half the hint (rounded up), so the map
// will only resize twice in the worst case.
</span><span class="kw">let </span>reserve = <span class="kw">if </span><span class="self">self</span>.is_empty() {
additional
} <span class="kw">else </span>{
(additional + <span class="number">1</span>) / <span class="number">2
</span>};
<span class="self">self</span>.reserve(reserve);
}
}
<span class="doccomment">/// Inserts all new key-values from the iterator and replaces values with existing
/// keys with new values returned from the iterator.
</span><span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, K, V, S, A&gt; Extend&lt;(<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>K, <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>V)&gt; <span class="kw">for </span>HashMap&lt;K, V, S, A&gt;
<span class="kw">where
</span>K: Eq + Hash + Copy,
V: Copy,
S: BuildHasher,
A: Allocator + Clone,
{
<span class="doccomment">/// Inserts all new key-values from the iterator to existing `HashMap&lt;K, V, S, A&gt;`.
/// Replace values with existing keys with new values returned from the iterator.
/// The keys and values must implement [`Copy`] trait.
///
/// [`Copy`]: https://doc.rust-lang.org/core/marker/trait.Copy.html
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::HashMap;
///
/// let mut map = HashMap::new();
/// map.insert(1, 100);
///
/// let arr = [(1, 1), (2, 2)];
/// let some_iter = arr.iter().map(|&amp;(k, v)| (k, v));
/// map.extend(some_iter);
/// // Replace values with existing keys with new values returned from the iterator.
/// // So that the map.get(&amp;1) doesn&#39;t return Some(&amp;100).
/// assert_eq!(map.get(&amp;1), Some(&amp;1));
///
/// let some_vec: Vec&lt;_&gt; = vec![(3, 3), (4, 4)];
/// map.extend(some_vec.iter().map(|&amp;(k, v)| (k, v)));
///
/// let some_arr = [(5, 5), (6, 6)];
/// map.extend(some_arr.iter().map(|&amp;(k, v)| (k, v)));
///
/// // You can also extend from another HashMap
/// let mut new_map = HashMap::new();
/// new_map.extend(&amp;map);
/// assert_eq!(new_map, map);
///
/// let mut vec: Vec&lt;_&gt; = new_map.into_iter().collect();
/// // The `IntoIter` iterator produces items in arbitrary order, so the
/// // items must be sorted to test them against a sorted array.
/// vec.sort_unstable();
/// assert_eq!(vec, [(1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6)]);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>extend&lt;T: IntoIterator&lt;Item = (<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>K, <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>V)&gt;&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, iter: T) {
<span class="self">self</span>.extend(iter.into_iter().map(|(<span class="kw-2">&amp;</span>key, <span class="kw-2">&amp;</span>value)| (key, value)));
}
<span class="attribute">#[inline]
#[cfg(feature = <span class="string">&quot;nightly&quot;</span>)]
</span><span class="kw">fn </span>extend_one(<span class="kw-2">&amp;mut </span><span class="self">self</span>, (k, v): (<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>K, <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>V)) {
<span class="self">self</span>.insert(<span class="kw-2">*</span>k, <span class="kw-2">*</span>v);
}
<span class="attribute">#[inline]
#[cfg(feature = <span class="string">&quot;nightly&quot;</span>)]
</span><span class="kw">fn </span>extend_reserve(<span class="kw-2">&amp;mut </span><span class="self">self</span>, additional: usize) {
Extend::&lt;(K, V)&gt;::extend_reserve(<span class="self">self</span>, additional);
}
}
<span class="doccomment">/// Inserts all new key-values from the iterator and replaces values with existing
/// keys with new values returned from the iterator.
</span><span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, K, V, S, A&gt; Extend&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>(K, V)&gt; <span class="kw">for </span>HashMap&lt;K, V, S, A&gt;
<span class="kw">where
</span>K: Eq + Hash + Copy,
V: Copy,
S: BuildHasher,
A: Allocator + Clone,
{
<span class="doccomment">/// Inserts all new key-values from the iterator to existing `HashMap&lt;K, V, S, A&gt;`.
/// Replace values with existing keys with new values returned from the iterator.
/// The keys and values must implement [`Copy`] trait.
///
/// [`Copy`]: https://doc.rust-lang.org/core/marker/trait.Copy.html
///
/// # Examples
///
/// ```
/// use hashbrown::hash_map::HashMap;
///
/// let mut map = HashMap::new();
/// map.insert(1, 100);
///
/// let arr = [(1, 1), (2, 2)];
/// let some_iter = arr.iter();
/// map.extend(some_iter);
/// // Replace values with existing keys with new values returned from the iterator.
/// // So that the map.get(&amp;1) doesn&#39;t return Some(&amp;100).
/// assert_eq!(map.get(&amp;1), Some(&amp;1));
///
/// let some_vec: Vec&lt;_&gt; = vec![(3, 3), (4, 4)];
/// map.extend(&amp;some_vec);
///
/// let some_arr = [(5, 5), (6, 6)];
/// map.extend(&amp;some_arr);
///
/// let mut vec: Vec&lt;_&gt; = map.into_iter().collect();
/// // The `IntoIter` iterator produces items in arbitrary order, so the
/// // items must be sorted to test them against a sorted array.
/// vec.sort_unstable();
/// assert_eq!(vec, [(1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6)]);
/// ```
</span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
</span><span class="kw">fn </span>extend&lt;T: IntoIterator&lt;Item = <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>(K, V)&gt;&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, iter: T) {
<span class="self">self</span>.extend(iter.into_iter().map(|<span class="kw-2">&amp;</span>(key, value)| (key, value)));
}
<span class="attribute">#[inline]
#[cfg(feature = <span class="string">&quot;nightly&quot;</span>)]
</span><span class="kw">fn </span>extend_one(<span class="kw-2">&amp;mut </span><span class="self">self</span>, <span class="kw-2">&amp;</span>(k, v): <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>(K, V)) {
<span class="self">self</span>.insert(k, v);
}
<span class="attribute">#[inline]
#[cfg(feature = <span class="string">&quot;nightly&quot;</span>)]
</span><span class="kw">fn </span>extend_reserve(<span class="kw-2">&amp;mut </span><span class="self">self</span>, additional: usize) {
Extend::&lt;(K, V)&gt;::extend_reserve(<span class="self">self</span>, additional);
}
}
<span class="attribute">#[allow(dead_code)]
</span><span class="kw">fn </span>assert_covariance() {
<span class="kw">fn </span>map_key&lt;<span class="lifetime">&#39;new</span>&gt;(v: HashMap&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;static </span>str, u8&gt;) -&gt; HashMap&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;new </span>str, u8&gt; {
v
}
<span class="kw">fn </span>map_val&lt;<span class="lifetime">&#39;new</span>&gt;(v: HashMap&lt;u8, <span class="kw-2">&amp;</span><span class="lifetime">&#39;static </span>str&gt;) -&gt; HashMap&lt;u8, <span class="kw-2">&amp;</span><span class="lifetime">&#39;new </span>str&gt; {
v
}
<span class="kw">fn </span>iter_key&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;new</span>&gt;(v: Iter&lt;<span class="lifetime">&#39;a</span>, <span class="kw-2">&amp;</span><span class="lifetime">&#39;static </span>str, u8&gt;) -&gt; Iter&lt;<span class="lifetime">&#39;a</span>, <span class="kw-2">&amp;</span><span class="lifetime">&#39;new </span>str, u8&gt; {
v
}
<span class="kw">fn </span>iter_val&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;new</span>&gt;(v: Iter&lt;<span class="lifetime">&#39;a</span>, u8, <span class="kw-2">&amp;</span><span class="lifetime">&#39;static </span>str&gt;) -&gt; Iter&lt;<span class="lifetime">&#39;a</span>, u8, <span class="kw-2">&amp;</span><span class="lifetime">&#39;new </span>str&gt; {
v
}
<span class="kw">fn </span>into_iter_key&lt;<span class="lifetime">&#39;new</span>, A: Allocator + Clone&gt;(
v: IntoIter&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;static </span>str, u8, A&gt;,
) -&gt; IntoIter&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;new </span>str, u8, A&gt; {
v
}
<span class="kw">fn </span>into_iter_val&lt;<span class="lifetime">&#39;new</span>, A: Allocator + Clone&gt;(
v: IntoIter&lt;u8, <span class="kw-2">&amp;</span><span class="lifetime">&#39;static </span>str, A&gt;,
) -&gt; IntoIter&lt;u8, <span class="kw-2">&amp;</span><span class="lifetime">&#39;new </span>str, A&gt; {
v
}
<span class="kw">fn </span>keys_key&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;new</span>&gt;(v: Keys&lt;<span class="lifetime">&#39;a</span>, <span class="kw-2">&amp;</span><span class="lifetime">&#39;static </span>str, u8&gt;) -&gt; Keys&lt;<span class="lifetime">&#39;a</span>, <span class="kw-2">&amp;</span><span class="lifetime">&#39;new </span>str, u8&gt; {
v
}
<span class="kw">fn </span>keys_val&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;new</span>&gt;(v: Keys&lt;<span class="lifetime">&#39;a</span>, u8, <span class="kw-2">&amp;</span><span class="lifetime">&#39;static </span>str&gt;) -&gt; Keys&lt;<span class="lifetime">&#39;a</span>, u8, <span class="kw-2">&amp;</span><span class="lifetime">&#39;new </span>str&gt; {
v
}
<span class="kw">fn </span>values_key&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;new</span>&gt;(v: Values&lt;<span class="lifetime">&#39;a</span>, <span class="kw-2">&amp;</span><span class="lifetime">&#39;static </span>str, u8&gt;) -&gt; Values&lt;<span class="lifetime">&#39;a</span>, <span class="kw-2">&amp;</span><span class="lifetime">&#39;new </span>str, u8&gt; {
v
}
<span class="kw">fn </span>values_val&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;new</span>&gt;(v: Values&lt;<span class="lifetime">&#39;a</span>, u8, <span class="kw-2">&amp;</span><span class="lifetime">&#39;static </span>str&gt;) -&gt; Values&lt;<span class="lifetime">&#39;a</span>, u8, <span class="kw-2">&amp;</span><span class="lifetime">&#39;new </span>str&gt; {
v
}
<span class="kw">fn </span>drain&lt;<span class="lifetime">&#39;new</span>&gt;(
d: Drain&lt;<span class="lifetime">&#39;static</span>, <span class="kw-2">&amp;</span><span class="lifetime">&#39;static </span>str, <span class="kw-2">&amp;</span><span class="lifetime">&#39;static </span>str&gt;,
) -&gt; Drain&lt;<span class="lifetime">&#39;new</span>, <span class="kw-2">&amp;</span><span class="lifetime">&#39;new </span>str, <span class="kw-2">&amp;</span><span class="lifetime">&#39;new </span>str&gt; {
d
}
}
<span class="attribute">#[cfg(test)]
</span><span class="kw">mod </span>test_map {
<span class="kw">use </span><span class="kw">super</span>::DefaultHashBuilder;
<span class="kw">use </span><span class="kw">super</span>::Entry::{Occupied, Vacant};
<span class="kw">use </span><span class="kw">super</span>::EntryRef;
<span class="kw">use super</span>::{HashMap, RawEntryMut};
<span class="kw">use </span>rand::{rngs::SmallRng, Rng, SeedableRng};
<span class="kw">use </span>std::borrow::ToOwned;
<span class="kw">use </span>std::cell::RefCell;
<span class="kw">use </span>std::usize;
<span class="kw">use </span>std::vec::Vec;
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_zero_capacities() {
<span class="kw">type </span>HM = HashMap&lt;i32, i32&gt;;
<span class="kw">let </span>m = HM::new();
<span class="macro">assert_eq!</span>(m.capacity(), <span class="number">0</span>);
<span class="kw">let </span>m = HM::default();
<span class="macro">assert_eq!</span>(m.capacity(), <span class="number">0</span>);
<span class="kw">let </span>m = HM::with_hasher(DefaultHashBuilder::default());
<span class="macro">assert_eq!</span>(m.capacity(), <span class="number">0</span>);
<span class="kw">let </span>m = HM::with_capacity(<span class="number">0</span>);
<span class="macro">assert_eq!</span>(m.capacity(), <span class="number">0</span>);
<span class="kw">let </span>m = HM::with_capacity_and_hasher(<span class="number">0</span>, DefaultHashBuilder::default());
<span class="macro">assert_eq!</span>(m.capacity(), <span class="number">0</span>);
<span class="kw">let </span><span class="kw-2">mut </span>m = HM::new();
m.insert(<span class="number">1</span>, <span class="number">1</span>);
m.insert(<span class="number">2</span>, <span class="number">2</span>);
m.remove(<span class="kw-2">&amp;</span><span class="number">1</span>);
m.remove(<span class="kw-2">&amp;</span><span class="number">2</span>);
m.shrink_to_fit();
<span class="macro">assert_eq!</span>(m.capacity(), <span class="number">0</span>);
<span class="kw">let </span><span class="kw-2">mut </span>m = HM::new();
m.reserve(<span class="number">0</span>);
<span class="macro">assert_eq!</span>(m.capacity(), <span class="number">0</span>);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_create_capacity_zero() {
<span class="kw">let </span><span class="kw-2">mut </span>m = HashMap::with_capacity(<span class="number">0</span>);
<span class="macro">assert!</span>(m.insert(<span class="number">1</span>, <span class="number">1</span>).is_none());
<span class="macro">assert!</span>(m.contains_key(<span class="kw-2">&amp;</span><span class="number">1</span>));
<span class="macro">assert!</span>(!m.contains_key(<span class="kw-2">&amp;</span><span class="number">0</span>));
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_insert() {
<span class="kw">let </span><span class="kw-2">mut </span>m = HashMap::new();
<span class="macro">assert_eq!</span>(m.len(), <span class="number">0</span>);
<span class="macro">assert!</span>(m.insert(<span class="number">1</span>, <span class="number">2</span>).is_none());
<span class="macro">assert_eq!</span>(m.len(), <span class="number">1</span>);
<span class="macro">assert!</span>(m.insert(<span class="number">2</span>, <span class="number">4</span>).is_none());
<span class="macro">assert_eq!</span>(m.len(), <span class="number">2</span>);
<span class="macro">assert_eq!</span>(<span class="kw-2">*</span>m.get(<span class="kw-2">&amp;</span><span class="number">1</span>).unwrap(), <span class="number">2</span>);
<span class="macro">assert_eq!</span>(<span class="kw-2">*</span>m.get(<span class="kw-2">&amp;</span><span class="number">2</span>).unwrap(), <span class="number">4</span>);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_clone() {
<span class="kw">let </span><span class="kw-2">mut </span>m = HashMap::new();
<span class="macro">assert_eq!</span>(m.len(), <span class="number">0</span>);
<span class="macro">assert!</span>(m.insert(<span class="number">1</span>, <span class="number">2</span>).is_none());
<span class="macro">assert_eq!</span>(m.len(), <span class="number">1</span>);
<span class="macro">assert!</span>(m.insert(<span class="number">2</span>, <span class="number">4</span>).is_none());
<span class="macro">assert_eq!</span>(m.len(), <span class="number">2</span>);
<span class="attribute">#[allow(clippy::redundant_clone)]
</span><span class="kw">let </span>m2 = m.clone();
<span class="macro">assert_eq!</span>(<span class="kw-2">*</span>m2.get(<span class="kw-2">&amp;</span><span class="number">1</span>).unwrap(), <span class="number">2</span>);
<span class="macro">assert_eq!</span>(<span class="kw-2">*</span>m2.get(<span class="kw-2">&amp;</span><span class="number">2</span>).unwrap(), <span class="number">4</span>);
<span class="macro">assert_eq!</span>(m2.len(), <span class="number">2</span>);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_clone_from() {
<span class="kw">let </span><span class="kw-2">mut </span>m = HashMap::new();
<span class="kw">let </span><span class="kw-2">mut </span>m2 = HashMap::new();
<span class="macro">assert_eq!</span>(m.len(), <span class="number">0</span>);
<span class="macro">assert!</span>(m.insert(<span class="number">1</span>, <span class="number">2</span>).is_none());
<span class="macro">assert_eq!</span>(m.len(), <span class="number">1</span>);
<span class="macro">assert!</span>(m.insert(<span class="number">2</span>, <span class="number">4</span>).is_none());
<span class="macro">assert_eq!</span>(m.len(), <span class="number">2</span>);
m2.clone_from(<span class="kw-2">&amp;</span>m);
<span class="macro">assert_eq!</span>(<span class="kw-2">*</span>m2.get(<span class="kw-2">&amp;</span><span class="number">1</span>).unwrap(), <span class="number">2</span>);
<span class="macro">assert_eq!</span>(<span class="kw-2">*</span>m2.get(<span class="kw-2">&amp;</span><span class="number">2</span>).unwrap(), <span class="number">4</span>);
<span class="macro">assert_eq!</span>(m2.len(), <span class="number">2</span>);
}
<span class="macro">thread_local! </span>{ <span class="kw">static </span>DROP_VECTOR: RefCell&lt;Vec&lt;i32&gt;&gt; = RefCell::new(Vec::new()) }
<span class="attribute">#[derive(Hash, PartialEq, Eq)]
</span><span class="kw">struct </span>Droppable {
k: usize,
}
<span class="kw">impl </span>Droppable {
<span class="kw">fn </span>new(k: usize) -&gt; Droppable {
DROP_VECTOR.with(|slot| {
slot.borrow_mut()[k] += <span class="number">1</span>;
});
Droppable { k }
}
}
<span class="kw">impl </span>Drop <span class="kw">for </span>Droppable {
<span class="kw">fn </span>drop(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
DROP_VECTOR.with(|slot| {
slot.borrow_mut()[<span class="self">self</span>.k] -= <span class="number">1</span>;
});
}
}
<span class="kw">impl </span>Clone <span class="kw">for </span>Droppable {
<span class="kw">fn </span>clone(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="self">Self </span>{
Droppable::new(<span class="self">self</span>.k)
}
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_drops() {
DROP_VECTOR.with(|slot| {
<span class="kw-2">*</span>slot.borrow_mut() = <span class="macro">vec!</span>[<span class="number">0</span>; <span class="number">200</span>];
});
{
<span class="kw">let </span><span class="kw-2">mut </span>m = HashMap::new();
DROP_VECTOR.with(|v| {
<span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..<span class="number">200 </span>{
<span class="macro">assert_eq!</span>(v.borrow()[i], <span class="number">0</span>);
}
});
<span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..<span class="number">100 </span>{
<span class="kw">let </span>d1 = Droppable::new(i);
<span class="kw">let </span>d2 = Droppable::new(i + <span class="number">100</span>);
m.insert(d1, d2);
}
DROP_VECTOR.with(|v| {
<span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..<span class="number">200 </span>{
<span class="macro">assert_eq!</span>(v.borrow()[i], <span class="number">1</span>);
}
});
<span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..<span class="number">50 </span>{
<span class="kw">let </span>k = Droppable::new(i);
<span class="kw">let </span>v = m.remove(<span class="kw-2">&amp;</span>k);
<span class="macro">assert!</span>(v.is_some());
DROP_VECTOR.with(|v| {
<span class="macro">assert_eq!</span>(v.borrow()[i], <span class="number">1</span>);
<span class="macro">assert_eq!</span>(v.borrow()[i + <span class="number">100</span>], <span class="number">1</span>);
});
}
DROP_VECTOR.with(|v| {
<span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..<span class="number">50 </span>{
<span class="macro">assert_eq!</span>(v.borrow()[i], <span class="number">0</span>);
<span class="macro">assert_eq!</span>(v.borrow()[i + <span class="number">100</span>], <span class="number">0</span>);
}
<span class="kw">for </span>i <span class="kw">in </span><span class="number">50</span>..<span class="number">100 </span>{
<span class="macro">assert_eq!</span>(v.borrow()[i], <span class="number">1</span>);
<span class="macro">assert_eq!</span>(v.borrow()[i + <span class="number">100</span>], <span class="number">1</span>);
}
});
}
DROP_VECTOR.with(|v| {
<span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..<span class="number">200 </span>{
<span class="macro">assert_eq!</span>(v.borrow()[i], <span class="number">0</span>);
}
});
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_into_iter_drops() {
DROP_VECTOR.with(|v| {
<span class="kw-2">*</span>v.borrow_mut() = <span class="macro">vec!</span>[<span class="number">0</span>; <span class="number">200</span>];
});
<span class="kw">let </span>hm = {
<span class="kw">let </span><span class="kw-2">mut </span>hm = HashMap::new();
DROP_VECTOR.with(|v| {
<span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..<span class="number">200 </span>{
<span class="macro">assert_eq!</span>(v.borrow()[i], <span class="number">0</span>);
}
});
<span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..<span class="number">100 </span>{
<span class="kw">let </span>d1 = Droppable::new(i);
<span class="kw">let </span>d2 = Droppable::new(i + <span class="number">100</span>);
hm.insert(d1, d2);
}
DROP_VECTOR.with(|v| {
<span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..<span class="number">200 </span>{
<span class="macro">assert_eq!</span>(v.borrow()[i], <span class="number">1</span>);
}
});
hm
};
<span class="comment">// By the way, ensure that cloning doesn&#39;t screw up the dropping.
</span>drop(hm.clone());
{
<span class="kw">let </span><span class="kw-2">mut </span>half = hm.into_iter().take(<span class="number">50</span>);
DROP_VECTOR.with(|v| {
<span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..<span class="number">200 </span>{
<span class="macro">assert_eq!</span>(v.borrow()[i], <span class="number">1</span>);
}
});
<span class="attribute">#[allow(clippy::let_underscore_drop)] </span><span class="comment">// kind-of a false positive
</span><span class="kw">for _ in </span>half.by_ref() {}
DROP_VECTOR.with(|v| {
<span class="kw">let </span>nk = (<span class="number">0</span>..<span class="number">100</span>).filter(|<span class="kw-2">&amp;</span>i| v.borrow()[i] == <span class="number">1</span>).count();
<span class="kw">let </span>nv = (<span class="number">0</span>..<span class="number">100</span>).filter(|<span class="kw-2">&amp;</span>i| v.borrow()[i + <span class="number">100</span>] == <span class="number">1</span>).count();
<span class="macro">assert_eq!</span>(nk, <span class="number">50</span>);
<span class="macro">assert_eq!</span>(nv, <span class="number">50</span>);
});
};
DROP_VECTOR.with(|v| {
<span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..<span class="number">200 </span>{
<span class="macro">assert_eq!</span>(v.borrow()[i], <span class="number">0</span>);
}
});
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_empty_remove() {
<span class="kw">let </span><span class="kw-2">mut </span>m: HashMap&lt;i32, bool&gt; = HashMap::new();
<span class="macro">assert_eq!</span>(m.remove(<span class="kw-2">&amp;</span><span class="number">0</span>), <span class="prelude-val">None</span>);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_empty_entry() {
<span class="kw">let </span><span class="kw-2">mut </span>m: HashMap&lt;i32, bool&gt; = HashMap::new();
<span class="kw">match </span>m.entry(<span class="number">0</span>) {
Occupied(<span class="kw">_</span>) =&gt; <span class="macro">panic!</span>(),
Vacant(<span class="kw">_</span>) =&gt; {}
}
<span class="macro">assert!</span>(<span class="kw-2">*</span>m.entry(<span class="number">0</span>).or_insert(<span class="bool-val">true</span>));
<span class="macro">assert_eq!</span>(m.len(), <span class="number">1</span>);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_empty_entry_ref() {
<span class="kw">let </span><span class="kw-2">mut </span>m: HashMap&lt;std::string::String, bool&gt; = HashMap::new();
<span class="kw">match </span>m.entry_ref(<span class="string">&quot;poneyland&quot;</span>) {
EntryRef::Occupied(<span class="kw">_</span>) =&gt; <span class="macro">panic!</span>(),
EntryRef::Vacant(<span class="kw">_</span>) =&gt; {}
}
<span class="macro">assert!</span>(<span class="kw-2">*</span>m.entry_ref(<span class="string">&quot;poneyland&quot;</span>).or_insert(<span class="bool-val">true</span>));
<span class="macro">assert_eq!</span>(m.len(), <span class="number">1</span>);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_empty_iter() {
<span class="kw">let </span><span class="kw-2">mut </span>m: HashMap&lt;i32, bool&gt; = HashMap::new();
<span class="macro">assert_eq!</span>(m.drain().next(), <span class="prelude-val">None</span>);
<span class="macro">assert_eq!</span>(m.keys().next(), <span class="prelude-val">None</span>);
<span class="macro">assert_eq!</span>(m.values().next(), <span class="prelude-val">None</span>);
<span class="macro">assert_eq!</span>(m.values_mut().next(), <span class="prelude-val">None</span>);
<span class="macro">assert_eq!</span>(m.iter().next(), <span class="prelude-val">None</span>);
<span class="macro">assert_eq!</span>(m.iter_mut().next(), <span class="prelude-val">None</span>);
<span class="macro">assert_eq!</span>(m.len(), <span class="number">0</span>);
<span class="macro">assert!</span>(m.is_empty());
<span class="macro">assert_eq!</span>(m.into_iter().next(), <span class="prelude-val">None</span>);
}
<span class="attribute">#[test]
#[cfg_attr(miri, ignore)] </span><span class="comment">// FIXME: takes too long
</span><span class="kw">fn </span>test_lots_of_insertions() {
<span class="kw">let </span><span class="kw-2">mut </span>m = HashMap::new();
<span class="comment">// Try this a few times to make sure we never screw up the hashmap&#39;s
// internal state.
</span><span class="kw">for _ in </span><span class="number">0</span>..<span class="number">10 </span>{
<span class="macro">assert!</span>(m.is_empty());
<span class="kw">for </span>i <span class="kw">in </span><span class="number">1</span>..<span class="number">1001 </span>{
<span class="macro">assert!</span>(m.insert(i, i).is_none());
<span class="kw">for </span>j <span class="kw">in </span><span class="number">1</span>..=i {
<span class="kw">let </span>r = m.get(<span class="kw-2">&amp;</span>j);
<span class="macro">assert_eq!</span>(r, <span class="prelude-val">Some</span>(<span class="kw-2">&amp;</span>j));
}
<span class="kw">for </span>j <span class="kw">in </span>i + <span class="number">1</span>..<span class="number">1001 </span>{
<span class="kw">let </span>r = m.get(<span class="kw-2">&amp;</span>j);
<span class="macro">assert_eq!</span>(r, <span class="prelude-val">None</span>);
}
}
<span class="kw">for </span>i <span class="kw">in </span><span class="number">1001</span>..<span class="number">2001 </span>{
<span class="macro">assert!</span>(!m.contains_key(<span class="kw-2">&amp;</span>i));
}
<span class="comment">// remove forwards
</span><span class="kw">for </span>i <span class="kw">in </span><span class="number">1</span>..<span class="number">1001 </span>{
<span class="macro">assert!</span>(m.remove(<span class="kw-2">&amp;</span>i).is_some());
<span class="kw">for </span>j <span class="kw">in </span><span class="number">1</span>..=i {
<span class="macro">assert!</span>(!m.contains_key(<span class="kw-2">&amp;</span>j));
}
<span class="kw">for </span>j <span class="kw">in </span>i + <span class="number">1</span>..<span class="number">1001 </span>{
<span class="macro">assert!</span>(m.contains_key(<span class="kw-2">&amp;</span>j));
}
}
<span class="kw">for </span>i <span class="kw">in </span><span class="number">1</span>..<span class="number">1001 </span>{
<span class="macro">assert!</span>(!m.contains_key(<span class="kw-2">&amp;</span>i));
}
<span class="kw">for </span>i <span class="kw">in </span><span class="number">1</span>..<span class="number">1001 </span>{
<span class="macro">assert!</span>(m.insert(i, i).is_none());
}
<span class="comment">// remove backwards
</span><span class="kw">for </span>i <span class="kw">in </span>(<span class="number">1</span>..<span class="number">1001</span>).rev() {
<span class="macro">assert!</span>(m.remove(<span class="kw-2">&amp;</span>i).is_some());
<span class="kw">for </span>j <span class="kw">in </span>i..<span class="number">1001 </span>{
<span class="macro">assert!</span>(!m.contains_key(<span class="kw-2">&amp;</span>j));
}
<span class="kw">for </span>j <span class="kw">in </span><span class="number">1</span>..i {
<span class="macro">assert!</span>(m.contains_key(<span class="kw-2">&amp;</span>j));
}
}
}
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_find_mut() {
<span class="kw">let </span><span class="kw-2">mut </span>m = HashMap::new();
<span class="macro">assert!</span>(m.insert(<span class="number">1</span>, <span class="number">12</span>).is_none());
<span class="macro">assert!</span>(m.insert(<span class="number">2</span>, <span class="number">8</span>).is_none());
<span class="macro">assert!</span>(m.insert(<span class="number">5</span>, <span class="number">14</span>).is_none());
<span class="kw">let </span>new = <span class="number">100</span>;
<span class="kw">match </span>m.get_mut(<span class="kw-2">&amp;</span><span class="number">5</span>) {
<span class="prelude-val">None </span>=&gt; <span class="macro">panic!</span>(),
<span class="prelude-val">Some</span>(x) =&gt; <span class="kw-2">*</span>x = new,
}
<span class="macro">assert_eq!</span>(m.get(<span class="kw-2">&amp;</span><span class="number">5</span>), <span class="prelude-val">Some</span>(<span class="kw-2">&amp;</span>new));
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_insert_overwrite() {
<span class="kw">let </span><span class="kw-2">mut </span>m = HashMap::new();
<span class="macro">assert!</span>(m.insert(<span class="number">1</span>, <span class="number">2</span>).is_none());
<span class="macro">assert_eq!</span>(<span class="kw-2">*</span>m.get(<span class="kw-2">&amp;</span><span class="number">1</span>).unwrap(), <span class="number">2</span>);
<span class="macro">assert!</span>(m.insert(<span class="number">1</span>, <span class="number">3</span>).is_some());
<span class="macro">assert_eq!</span>(<span class="kw-2">*</span>m.get(<span class="kw-2">&amp;</span><span class="number">1</span>).unwrap(), <span class="number">3</span>);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_insert_conflicts() {
<span class="kw">let </span><span class="kw-2">mut </span>m = HashMap::with_capacity(<span class="number">4</span>);
<span class="macro">assert!</span>(m.insert(<span class="number">1</span>, <span class="number">2</span>).is_none());
<span class="macro">assert!</span>(m.insert(<span class="number">5</span>, <span class="number">3</span>).is_none());
<span class="macro">assert!</span>(m.insert(<span class="number">9</span>, <span class="number">4</span>).is_none());
<span class="macro">assert_eq!</span>(<span class="kw-2">*</span>m.get(<span class="kw-2">&amp;</span><span class="number">9</span>).unwrap(), <span class="number">4</span>);
<span class="macro">assert_eq!</span>(<span class="kw-2">*</span>m.get(<span class="kw-2">&amp;</span><span class="number">5</span>).unwrap(), <span class="number">3</span>);
<span class="macro">assert_eq!</span>(<span class="kw-2">*</span>m.get(<span class="kw-2">&amp;</span><span class="number">1</span>).unwrap(), <span class="number">2</span>);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_conflict_remove() {
<span class="kw">let </span><span class="kw-2">mut </span>m = HashMap::with_capacity(<span class="number">4</span>);
<span class="macro">assert!</span>(m.insert(<span class="number">1</span>, <span class="number">2</span>).is_none());
<span class="macro">assert_eq!</span>(<span class="kw-2">*</span>m.get(<span class="kw-2">&amp;</span><span class="number">1</span>).unwrap(), <span class="number">2</span>);
<span class="macro">assert!</span>(m.insert(<span class="number">5</span>, <span class="number">3</span>).is_none());
<span class="macro">assert_eq!</span>(<span class="kw-2">*</span>m.get(<span class="kw-2">&amp;</span><span class="number">1</span>).unwrap(), <span class="number">2</span>);
<span class="macro">assert_eq!</span>(<span class="kw-2">*</span>m.get(<span class="kw-2">&amp;</span><span class="number">5</span>).unwrap(), <span class="number">3</span>);
<span class="macro">assert!</span>(m.insert(<span class="number">9</span>, <span class="number">4</span>).is_none());
<span class="macro">assert_eq!</span>(<span class="kw-2">*</span>m.get(<span class="kw-2">&amp;</span><span class="number">1</span>).unwrap(), <span class="number">2</span>);
<span class="macro">assert_eq!</span>(<span class="kw-2">*</span>m.get(<span class="kw-2">&amp;</span><span class="number">5</span>).unwrap(), <span class="number">3</span>);
<span class="macro">assert_eq!</span>(<span class="kw-2">*</span>m.get(<span class="kw-2">&amp;</span><span class="number">9</span>).unwrap(), <span class="number">4</span>);
<span class="macro">assert!</span>(m.remove(<span class="kw-2">&amp;</span><span class="number">1</span>).is_some());
<span class="macro">assert_eq!</span>(<span class="kw-2">*</span>m.get(<span class="kw-2">&amp;</span><span class="number">9</span>).unwrap(), <span class="number">4</span>);
<span class="macro">assert_eq!</span>(<span class="kw-2">*</span>m.get(<span class="kw-2">&amp;</span><span class="number">5</span>).unwrap(), <span class="number">3</span>);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_insert_unique_unchecked() {
<span class="kw">let </span><span class="kw-2">mut </span>map = HashMap::new();
<span class="kw">let </span>(k1, v1) = map.insert_unique_unchecked(<span class="number">10</span>, <span class="number">11</span>);
<span class="macro">assert_eq!</span>((<span class="kw-2">&amp;</span><span class="number">10</span>, <span class="kw-2">&amp;mut </span><span class="number">11</span>), (k1, v1));
<span class="kw">let </span>(k2, v2) = map.insert_unique_unchecked(<span class="number">20</span>, <span class="number">21</span>);
<span class="macro">assert_eq!</span>((<span class="kw-2">&amp;</span><span class="number">20</span>, <span class="kw-2">&amp;mut </span><span class="number">21</span>), (k2, v2));
<span class="macro">assert_eq!</span>(<span class="prelude-val">Some</span>(<span class="kw-2">&amp;</span><span class="number">11</span>), map.get(<span class="kw-2">&amp;</span><span class="number">10</span>));
<span class="macro">assert_eq!</span>(<span class="prelude-val">Some</span>(<span class="kw-2">&amp;</span><span class="number">21</span>), map.get(<span class="kw-2">&amp;</span><span class="number">20</span>));
<span class="macro">assert_eq!</span>(<span class="prelude-val">None</span>, map.get(<span class="kw-2">&amp;</span><span class="number">30</span>));
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_is_empty() {
<span class="kw">let </span><span class="kw-2">mut </span>m = HashMap::with_capacity(<span class="number">4</span>);
<span class="macro">assert!</span>(m.insert(<span class="number">1</span>, <span class="number">2</span>).is_none());
<span class="macro">assert!</span>(!m.is_empty());
<span class="macro">assert!</span>(m.remove(<span class="kw-2">&amp;</span><span class="number">1</span>).is_some());
<span class="macro">assert!</span>(m.is_empty());
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_remove() {
<span class="kw">let </span><span class="kw-2">mut </span>m = HashMap::new();
m.insert(<span class="number">1</span>, <span class="number">2</span>);
<span class="macro">assert_eq!</span>(m.remove(<span class="kw-2">&amp;</span><span class="number">1</span>), <span class="prelude-val">Some</span>(<span class="number">2</span>));
<span class="macro">assert_eq!</span>(m.remove(<span class="kw-2">&amp;</span><span class="number">1</span>), <span class="prelude-val">None</span>);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_remove_entry() {
<span class="kw">let </span><span class="kw-2">mut </span>m = HashMap::new();
m.insert(<span class="number">1</span>, <span class="number">2</span>);
<span class="macro">assert_eq!</span>(m.remove_entry(<span class="kw-2">&amp;</span><span class="number">1</span>), <span class="prelude-val">Some</span>((<span class="number">1</span>, <span class="number">2</span>)));
<span class="macro">assert_eq!</span>(m.remove(<span class="kw-2">&amp;</span><span class="number">1</span>), <span class="prelude-val">None</span>);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_iterate() {
<span class="kw">let </span><span class="kw-2">mut </span>m = HashMap::with_capacity(<span class="number">4</span>);
<span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..<span class="number">32 </span>{
<span class="macro">assert!</span>(m.insert(i, i * <span class="number">2</span>).is_none());
}
<span class="macro">assert_eq!</span>(m.len(), <span class="number">32</span>);
<span class="kw">let </span><span class="kw-2">mut </span>observed: u32 = <span class="number">0</span>;
<span class="kw">for </span>(k, v) <span class="kw">in </span><span class="kw-2">&amp;</span>m {
<span class="macro">assert_eq!</span>(<span class="kw-2">*</span>v, <span class="kw-2">*</span>k * <span class="number">2</span>);
observed |= <span class="number">1 </span>&lt;&lt; <span class="kw-2">*</span>k;
}
<span class="macro">assert_eq!</span>(observed, <span class="number">0xFFFF_FFFF</span>);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_keys() {
<span class="kw">let </span>vec = <span class="macro">vec!</span>[(<span class="number">1</span>, <span class="string">&#39;a&#39;</span>), (<span class="number">2</span>, <span class="string">&#39;b&#39;</span>), (<span class="number">3</span>, <span class="string">&#39;c&#39;</span>)];
<span class="kw">let </span>map: HashMap&lt;<span class="kw">_</span>, <span class="kw">_</span>&gt; = vec.into_iter().collect();
<span class="kw">let </span>keys: Vec&lt;<span class="kw">_</span>&gt; = map.keys().copied().collect();
<span class="macro">assert_eq!</span>(keys.len(), <span class="number">3</span>);
<span class="macro">assert!</span>(keys.contains(<span class="kw-2">&amp;</span><span class="number">1</span>));
<span class="macro">assert!</span>(keys.contains(<span class="kw-2">&amp;</span><span class="number">2</span>));
<span class="macro">assert!</span>(keys.contains(<span class="kw-2">&amp;</span><span class="number">3</span>));
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_values() {
<span class="kw">let </span>vec = <span class="macro">vec!</span>[(<span class="number">1</span>, <span class="string">&#39;a&#39;</span>), (<span class="number">2</span>, <span class="string">&#39;b&#39;</span>), (<span class="number">3</span>, <span class="string">&#39;c&#39;</span>)];
<span class="kw">let </span>map: HashMap&lt;<span class="kw">_</span>, <span class="kw">_</span>&gt; = vec.into_iter().collect();
<span class="kw">let </span>values: Vec&lt;<span class="kw">_</span>&gt; = map.values().copied().collect();
<span class="macro">assert_eq!</span>(values.len(), <span class="number">3</span>);
<span class="macro">assert!</span>(values.contains(<span class="kw-2">&amp;</span><span class="string">&#39;a&#39;</span>));
<span class="macro">assert!</span>(values.contains(<span class="kw-2">&amp;</span><span class="string">&#39;b&#39;</span>));
<span class="macro">assert!</span>(values.contains(<span class="kw-2">&amp;</span><span class="string">&#39;c&#39;</span>));
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_values_mut() {
<span class="kw">let </span>vec = <span class="macro">vec!</span>[(<span class="number">1</span>, <span class="number">1</span>), (<span class="number">2</span>, <span class="number">2</span>), (<span class="number">3</span>, <span class="number">3</span>)];
<span class="kw">let </span><span class="kw-2">mut </span>map: HashMap&lt;<span class="kw">_</span>, <span class="kw">_</span>&gt; = vec.into_iter().collect();
<span class="kw">for </span>value <span class="kw">in </span>map.values_mut() {
<span class="kw-2">*</span>value <span class="kw-2">*</span>= <span class="number">2</span>;
}
<span class="kw">let </span>values: Vec&lt;<span class="kw">_</span>&gt; = map.values().copied().collect();
<span class="macro">assert_eq!</span>(values.len(), <span class="number">3</span>);
<span class="macro">assert!</span>(values.contains(<span class="kw-2">&amp;</span><span class="number">2</span>));
<span class="macro">assert!</span>(values.contains(<span class="kw-2">&amp;</span><span class="number">4</span>));
<span class="macro">assert!</span>(values.contains(<span class="kw-2">&amp;</span><span class="number">6</span>));
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_into_keys() {
<span class="kw">let </span>vec = <span class="macro">vec!</span>[(<span class="number">1</span>, <span class="string">&#39;a&#39;</span>), (<span class="number">2</span>, <span class="string">&#39;b&#39;</span>), (<span class="number">3</span>, <span class="string">&#39;c&#39;</span>)];
<span class="kw">let </span>map: HashMap&lt;<span class="kw">_</span>, <span class="kw">_</span>&gt; = vec.into_iter().collect();
<span class="kw">let </span>keys: Vec&lt;<span class="kw">_</span>&gt; = map.into_keys().collect();
<span class="macro">assert_eq!</span>(keys.len(), <span class="number">3</span>);
<span class="macro">assert!</span>(keys.contains(<span class="kw-2">&amp;</span><span class="number">1</span>));
<span class="macro">assert!</span>(keys.contains(<span class="kw-2">&amp;</span><span class="number">2</span>));
<span class="macro">assert!</span>(keys.contains(<span class="kw-2">&amp;</span><span class="number">3</span>));
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_into_values() {
<span class="kw">let </span>vec = <span class="macro">vec!</span>[(<span class="number">1</span>, <span class="string">&#39;a&#39;</span>), (<span class="number">2</span>, <span class="string">&#39;b&#39;</span>), (<span class="number">3</span>, <span class="string">&#39;c&#39;</span>)];
<span class="kw">let </span>map: HashMap&lt;<span class="kw">_</span>, <span class="kw">_</span>&gt; = vec.into_iter().collect();
<span class="kw">let </span>values: Vec&lt;<span class="kw">_</span>&gt; = map.into_values().collect();
<span class="macro">assert_eq!</span>(values.len(), <span class="number">3</span>);
<span class="macro">assert!</span>(values.contains(<span class="kw-2">&amp;</span><span class="string">&#39;a&#39;</span>));
<span class="macro">assert!</span>(values.contains(<span class="kw-2">&amp;</span><span class="string">&#39;b&#39;</span>));
<span class="macro">assert!</span>(values.contains(<span class="kw-2">&amp;</span><span class="string">&#39;c&#39;</span>));
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_find() {
<span class="kw">let </span><span class="kw-2">mut </span>m = HashMap::new();
<span class="macro">assert!</span>(m.get(<span class="kw-2">&amp;</span><span class="number">1</span>).is_none());
m.insert(<span class="number">1</span>, <span class="number">2</span>);
<span class="kw">match </span>m.get(<span class="kw-2">&amp;</span><span class="number">1</span>) {
<span class="prelude-val">None </span>=&gt; <span class="macro">panic!</span>(),
<span class="prelude-val">Some</span>(v) =&gt; <span class="macro">assert_eq!</span>(<span class="kw-2">*</span>v, <span class="number">2</span>),
}
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_eq() {
<span class="kw">let </span><span class="kw-2">mut </span>m1 = HashMap::new();
m1.insert(<span class="number">1</span>, <span class="number">2</span>);
m1.insert(<span class="number">2</span>, <span class="number">3</span>);
m1.insert(<span class="number">3</span>, <span class="number">4</span>);
<span class="kw">let </span><span class="kw-2">mut </span>m2 = HashMap::new();
m2.insert(<span class="number">1</span>, <span class="number">2</span>);
m2.insert(<span class="number">2</span>, <span class="number">3</span>);
<span class="macro">assert!</span>(m1 != m2);
m2.insert(<span class="number">3</span>, <span class="number">4</span>);
<span class="macro">assert_eq!</span>(m1, m2);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_show() {
<span class="kw">let </span><span class="kw-2">mut </span>map = HashMap::new();
<span class="kw">let </span>empty: HashMap&lt;i32, i32&gt; = HashMap::new();
map.insert(<span class="number">1</span>, <span class="number">2</span>);
map.insert(<span class="number">3</span>, <span class="number">4</span>);
<span class="kw">let </span>map_str = <span class="macro">format!</span>(<span class="string">&quot;{:?}&quot;</span>, map);
<span class="macro">assert!</span>(map_str == <span class="string">&quot;{1: 2, 3: 4}&quot; </span>|| map_str == <span class="string">&quot;{3: 4, 1: 2}&quot;</span>);
<span class="macro">assert_eq!</span>(<span class="macro">format!</span>(<span class="string">&quot;{:?}&quot;</span>, empty), <span class="string">&quot;{}&quot;</span>);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_expand() {
<span class="kw">let </span><span class="kw-2">mut </span>m = HashMap::new();
<span class="macro">assert_eq!</span>(m.len(), <span class="number">0</span>);
<span class="macro">assert!</span>(m.is_empty());
<span class="kw">let </span><span class="kw-2">mut </span>i = <span class="number">0</span>;
<span class="kw">let </span>old_raw_cap = m.raw_capacity();
<span class="kw">while </span>old_raw_cap == m.raw_capacity() {
m.insert(i, i);
i += <span class="number">1</span>;
}
<span class="macro">assert_eq!</span>(m.len(), i);
<span class="macro">assert!</span>(!m.is_empty());
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_behavior_resize_policy() {
<span class="kw">let </span><span class="kw-2">mut </span>m = HashMap::new();
<span class="macro">assert_eq!</span>(m.len(), <span class="number">0</span>);
<span class="macro">assert_eq!</span>(m.raw_capacity(), <span class="number">1</span>);
<span class="macro">assert!</span>(m.is_empty());
m.insert(<span class="number">0</span>, <span class="number">0</span>);
m.remove(<span class="kw-2">&amp;</span><span class="number">0</span>);
<span class="macro">assert!</span>(m.is_empty());
<span class="kw">let </span>initial_raw_cap = m.raw_capacity();
m.reserve(initial_raw_cap);
<span class="kw">let </span>raw_cap = m.raw_capacity();
<span class="macro">assert_eq!</span>(raw_cap, initial_raw_cap * <span class="number">2</span>);
<span class="kw">let </span><span class="kw-2">mut </span>i = <span class="number">0</span>;
<span class="kw">for _ in </span><span class="number">0</span>..raw_cap * <span class="number">3 </span>/ <span class="number">4 </span>{
m.insert(i, i);
i += <span class="number">1</span>;
}
<span class="comment">// three quarters full
</span><span class="macro">assert_eq!</span>(m.len(), i);
<span class="macro">assert_eq!</span>(m.raw_capacity(), raw_cap);
<span class="kw">for _ in </span><span class="number">0</span>..raw_cap / <span class="number">4 </span>{
m.insert(i, i);
i += <span class="number">1</span>;
}
<span class="comment">// half full
</span><span class="kw">let </span>new_raw_cap = m.raw_capacity();
<span class="macro">assert_eq!</span>(new_raw_cap, raw_cap * <span class="number">2</span>);
<span class="kw">for _ in </span><span class="number">0</span>..raw_cap / <span class="number">2 </span>- <span class="number">1 </span>{
i -= <span class="number">1</span>;
m.remove(<span class="kw-2">&amp;</span>i);
<span class="macro">assert_eq!</span>(m.raw_capacity(), new_raw_cap);
}
<span class="comment">// A little more than one quarter full.
</span>m.shrink_to_fit();
<span class="macro">assert_eq!</span>(m.raw_capacity(), raw_cap);
<span class="comment">// again, a little more than half full
</span><span class="kw">for _ in </span><span class="number">0</span>..raw_cap / <span class="number">2 </span>{
i -= <span class="number">1</span>;
m.remove(<span class="kw-2">&amp;</span>i);
}
m.shrink_to_fit();
<span class="macro">assert_eq!</span>(m.len(), i);
<span class="macro">assert!</span>(!m.is_empty());
<span class="macro">assert_eq!</span>(m.raw_capacity(), initial_raw_cap);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_reserve_shrink_to_fit() {
<span class="kw">let </span><span class="kw-2">mut </span>m = HashMap::new();
m.insert(<span class="number">0</span>, <span class="number">0</span>);
m.remove(<span class="kw-2">&amp;</span><span class="number">0</span>);
<span class="macro">assert!</span>(m.capacity() &gt;= m.len());
<span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..<span class="number">128 </span>{
m.insert(i, i);
}
m.reserve(<span class="number">256</span>);
<span class="kw">let </span>usable_cap = m.capacity();
<span class="kw">for </span>i <span class="kw">in </span><span class="number">128</span>..(<span class="number">128 </span>+ <span class="number">256</span>) {
m.insert(i, i);
<span class="macro">assert_eq!</span>(m.capacity(), usable_cap);
}
<span class="kw">for </span>i <span class="kw">in </span><span class="number">100</span>..(<span class="number">128 </span>+ <span class="number">256</span>) {
<span class="macro">assert_eq!</span>(m.remove(<span class="kw-2">&amp;</span>i), <span class="prelude-val">Some</span>(i));
}
m.shrink_to_fit();
<span class="macro">assert_eq!</span>(m.len(), <span class="number">100</span>);
<span class="macro">assert!</span>(!m.is_empty());
<span class="macro">assert!</span>(m.capacity() &gt;= m.len());
<span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..<span class="number">100 </span>{
<span class="macro">assert_eq!</span>(m.remove(<span class="kw-2">&amp;</span>i), <span class="prelude-val">Some</span>(i));
}
m.shrink_to_fit();
m.insert(<span class="number">0</span>, <span class="number">0</span>);
<span class="macro">assert_eq!</span>(m.len(), <span class="number">1</span>);
<span class="macro">assert!</span>(m.capacity() &gt;= m.len());
<span class="macro">assert_eq!</span>(m.remove(<span class="kw-2">&amp;</span><span class="number">0</span>), <span class="prelude-val">Some</span>(<span class="number">0</span>));
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_from_iter() {
<span class="kw">let </span>xs = [(<span class="number">1</span>, <span class="number">1</span>), (<span class="number">2</span>, <span class="number">2</span>), (<span class="number">2</span>, <span class="number">2</span>), (<span class="number">3</span>, <span class="number">3</span>), (<span class="number">4</span>, <span class="number">4</span>), (<span class="number">5</span>, <span class="number">5</span>), (<span class="number">6</span>, <span class="number">6</span>)];
<span class="kw">let </span>map: HashMap&lt;<span class="kw">_</span>, <span class="kw">_</span>&gt; = xs.iter().copied().collect();
<span class="kw">for </span><span class="kw-2">&amp;</span>(k, v) <span class="kw">in </span><span class="kw-2">&amp;</span>xs {
<span class="macro">assert_eq!</span>(map.get(<span class="kw-2">&amp;</span>k), <span class="prelude-val">Some</span>(<span class="kw-2">&amp;</span>v));
}
<span class="macro">assert_eq!</span>(map.iter().len(), xs.len() - <span class="number">1</span>);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_size_hint() {
<span class="kw">let </span>xs = [(<span class="number">1</span>, <span class="number">1</span>), (<span class="number">2</span>, <span class="number">2</span>), (<span class="number">3</span>, <span class="number">3</span>), (<span class="number">4</span>, <span class="number">4</span>), (<span class="number">5</span>, <span class="number">5</span>), (<span class="number">6</span>, <span class="number">6</span>)];
<span class="kw">let </span>map: HashMap&lt;<span class="kw">_</span>, <span class="kw">_</span>&gt; = xs.iter().copied().collect();
<span class="kw">let </span><span class="kw-2">mut </span>iter = map.iter();
<span class="kw">for _ in </span>iter.by_ref().take(<span class="number">3</span>) {}
<span class="macro">assert_eq!</span>(iter.size_hint(), (<span class="number">3</span>, <span class="prelude-val">Some</span>(<span class="number">3</span>)));
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_iter_len() {
<span class="kw">let </span>xs = [(<span class="number">1</span>, <span class="number">1</span>), (<span class="number">2</span>, <span class="number">2</span>), (<span class="number">3</span>, <span class="number">3</span>), (<span class="number">4</span>, <span class="number">4</span>), (<span class="number">5</span>, <span class="number">5</span>), (<span class="number">6</span>, <span class="number">6</span>)];
<span class="kw">let </span>map: HashMap&lt;<span class="kw">_</span>, <span class="kw">_</span>&gt; = xs.iter().copied().collect();
<span class="kw">let </span><span class="kw-2">mut </span>iter = map.iter();
<span class="kw">for _ in </span>iter.by_ref().take(<span class="number">3</span>) {}
<span class="macro">assert_eq!</span>(iter.len(), <span class="number">3</span>);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_mut_size_hint() {
<span class="kw">let </span>xs = [(<span class="number">1</span>, <span class="number">1</span>), (<span class="number">2</span>, <span class="number">2</span>), (<span class="number">3</span>, <span class="number">3</span>), (<span class="number">4</span>, <span class="number">4</span>), (<span class="number">5</span>, <span class="number">5</span>), (<span class="number">6</span>, <span class="number">6</span>)];
<span class="kw">let </span><span class="kw-2">mut </span>map: HashMap&lt;<span class="kw">_</span>, <span class="kw">_</span>&gt; = xs.iter().copied().collect();
<span class="kw">let </span><span class="kw-2">mut </span>iter = map.iter_mut();
<span class="kw">for _ in </span>iter.by_ref().take(<span class="number">3</span>) {}
<span class="macro">assert_eq!</span>(iter.size_hint(), (<span class="number">3</span>, <span class="prelude-val">Some</span>(<span class="number">3</span>)));
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_iter_mut_len() {
<span class="kw">let </span>xs = [(<span class="number">1</span>, <span class="number">1</span>), (<span class="number">2</span>, <span class="number">2</span>), (<span class="number">3</span>, <span class="number">3</span>), (<span class="number">4</span>, <span class="number">4</span>), (<span class="number">5</span>, <span class="number">5</span>), (<span class="number">6</span>, <span class="number">6</span>)];
<span class="kw">let </span><span class="kw-2">mut </span>map: HashMap&lt;<span class="kw">_</span>, <span class="kw">_</span>&gt; = xs.iter().copied().collect();
<span class="kw">let </span><span class="kw-2">mut </span>iter = map.iter_mut();
<span class="kw">for _ in </span>iter.by_ref().take(<span class="number">3</span>) {}
<span class="macro">assert_eq!</span>(iter.len(), <span class="number">3</span>);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_index() {
<span class="kw">let </span><span class="kw-2">mut </span>map = HashMap::new();
map.insert(<span class="number">1</span>, <span class="number">2</span>);
map.insert(<span class="number">2</span>, <span class="number">1</span>);
map.insert(<span class="number">3</span>, <span class="number">4</span>);
<span class="macro">assert_eq!</span>(map[<span class="kw-2">&amp;</span><span class="number">2</span>], <span class="number">1</span>);
}
<span class="attribute">#[test]
#[should_panic]
</span><span class="kw">fn </span>test_index_nonexistent() {
<span class="kw">let </span><span class="kw-2">mut </span>map = HashMap::new();
map.insert(<span class="number">1</span>, <span class="number">2</span>);
map.insert(<span class="number">2</span>, <span class="number">1</span>);
map.insert(<span class="number">3</span>, <span class="number">4</span>);
<span class="attribute">#[allow(clippy::no_effect)] </span><span class="comment">// false positive lint
</span>map[<span class="kw-2">&amp;</span><span class="number">4</span>];
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_entry() {
<span class="kw">let </span>xs = [(<span class="number">1</span>, <span class="number">10</span>), (<span class="number">2</span>, <span class="number">20</span>), (<span class="number">3</span>, <span class="number">30</span>), (<span class="number">4</span>, <span class="number">40</span>), (<span class="number">5</span>, <span class="number">50</span>), (<span class="number">6</span>, <span class="number">60</span>)];
<span class="kw">let </span><span class="kw-2">mut </span>map: HashMap&lt;<span class="kw">_</span>, <span class="kw">_</span>&gt; = xs.iter().copied().collect();
<span class="comment">// Existing key (insert)
</span><span class="kw">match </span>map.entry(<span class="number">1</span>) {
Vacant(<span class="kw">_</span>) =&gt; <span class="macro">unreachable!</span>(),
Occupied(<span class="kw-2">mut </span>view) =&gt; {
<span class="macro">assert_eq!</span>(view.get(), <span class="kw-2">&amp;</span><span class="number">10</span>);
<span class="macro">assert_eq!</span>(view.insert(<span class="number">100</span>), <span class="number">10</span>);
}
}
<span class="macro">assert_eq!</span>(map.get(<span class="kw-2">&amp;</span><span class="number">1</span>).unwrap(), <span class="kw-2">&amp;</span><span class="number">100</span>);
<span class="macro">assert_eq!</span>(map.len(), <span class="number">6</span>);
<span class="comment">// Existing key (update)
</span><span class="kw">match </span>map.entry(<span class="number">2</span>) {
Vacant(<span class="kw">_</span>) =&gt; <span class="macro">unreachable!</span>(),
Occupied(<span class="kw-2">mut </span>view) =&gt; {
<span class="kw">let </span>v = view.get_mut();
<span class="kw">let </span>new_v = (<span class="kw-2">*</span>v) * <span class="number">10</span>;
<span class="kw-2">*</span>v = new_v;
}
}
<span class="macro">assert_eq!</span>(map.get(<span class="kw-2">&amp;</span><span class="number">2</span>).unwrap(), <span class="kw-2">&amp;</span><span class="number">200</span>);
<span class="macro">assert_eq!</span>(map.len(), <span class="number">6</span>);
<span class="comment">// Existing key (take)
</span><span class="kw">match </span>map.entry(<span class="number">3</span>) {
Vacant(<span class="kw">_</span>) =&gt; <span class="macro">unreachable!</span>(),
Occupied(view) =&gt; {
<span class="macro">assert_eq!</span>(view.remove(), <span class="number">30</span>);
}
}
<span class="macro">assert_eq!</span>(map.get(<span class="kw-2">&amp;</span><span class="number">3</span>), <span class="prelude-val">None</span>);
<span class="macro">assert_eq!</span>(map.len(), <span class="number">5</span>);
<span class="comment">// Inexistent key (insert)
</span><span class="kw">match </span>map.entry(<span class="number">10</span>) {
Occupied(<span class="kw">_</span>) =&gt; <span class="macro">unreachable!</span>(),
Vacant(view) =&gt; {
<span class="macro">assert_eq!</span>(<span class="kw-2">*</span>view.insert(<span class="number">1000</span>), <span class="number">1000</span>);
}
}
<span class="macro">assert_eq!</span>(map.get(<span class="kw-2">&amp;</span><span class="number">10</span>).unwrap(), <span class="kw-2">&amp;</span><span class="number">1000</span>);
<span class="macro">assert_eq!</span>(map.len(), <span class="number">6</span>);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_entry_ref() {
<span class="kw">let </span>xs = [
(<span class="string">&quot;One&quot;</span>.to_owned(), <span class="number">10</span>),
(<span class="string">&quot;Two&quot;</span>.to_owned(), <span class="number">20</span>),
(<span class="string">&quot;Three&quot;</span>.to_owned(), <span class="number">30</span>),
(<span class="string">&quot;Four&quot;</span>.to_owned(), <span class="number">40</span>),
(<span class="string">&quot;Five&quot;</span>.to_owned(), <span class="number">50</span>),
(<span class="string">&quot;Six&quot;</span>.to_owned(), <span class="number">60</span>),
];
<span class="kw">let </span><span class="kw-2">mut </span>map: HashMap&lt;<span class="kw">_</span>, <span class="kw">_</span>&gt; = xs.iter().cloned().collect();
<span class="comment">// Existing key (insert)
</span><span class="kw">match </span>map.entry_ref(<span class="string">&quot;One&quot;</span>) {
EntryRef::Vacant(<span class="kw">_</span>) =&gt; <span class="macro">unreachable!</span>(),
EntryRef::Occupied(<span class="kw-2">mut </span>view) =&gt; {
<span class="macro">assert_eq!</span>(view.get(), <span class="kw-2">&amp;</span><span class="number">10</span>);
<span class="macro">assert_eq!</span>(view.insert(<span class="number">100</span>), <span class="number">10</span>);
}
}
<span class="macro">assert_eq!</span>(map.get(<span class="string">&quot;One&quot;</span>).unwrap(), <span class="kw-2">&amp;</span><span class="number">100</span>);
<span class="macro">assert_eq!</span>(map.len(), <span class="number">6</span>);
<span class="comment">// Existing key (update)
</span><span class="kw">match </span>map.entry_ref(<span class="string">&quot;Two&quot;</span>) {
EntryRef::Vacant(<span class="kw">_</span>) =&gt; <span class="macro">unreachable!</span>(),
EntryRef::Occupied(<span class="kw-2">mut </span>view) =&gt; {
<span class="kw">let </span>v = view.get_mut();
<span class="kw">let </span>new_v = (<span class="kw-2">*</span>v) * <span class="number">10</span>;
<span class="kw-2">*</span>v = new_v;
}
}
<span class="macro">assert_eq!</span>(map.get(<span class="string">&quot;Two&quot;</span>).unwrap(), <span class="kw-2">&amp;</span><span class="number">200</span>);
<span class="macro">assert_eq!</span>(map.len(), <span class="number">6</span>);
<span class="comment">// Existing key (take)
</span><span class="kw">match </span>map.entry_ref(<span class="string">&quot;Three&quot;</span>) {
EntryRef::Vacant(<span class="kw">_</span>) =&gt; <span class="macro">unreachable!</span>(),
EntryRef::Occupied(view) =&gt; {
<span class="macro">assert_eq!</span>(view.remove(), <span class="number">30</span>);
}
}
<span class="macro">assert_eq!</span>(map.get(<span class="string">&quot;Three&quot;</span>), <span class="prelude-val">None</span>);
<span class="macro">assert_eq!</span>(map.len(), <span class="number">5</span>);
<span class="comment">// Inexistent key (insert)
</span><span class="kw">match </span>map.entry_ref(<span class="string">&quot;Ten&quot;</span>) {
EntryRef::Occupied(<span class="kw">_</span>) =&gt; <span class="macro">unreachable!</span>(),
EntryRef::Vacant(view) =&gt; {
<span class="macro">assert_eq!</span>(<span class="kw-2">*</span>view.insert(<span class="number">1000</span>), <span class="number">1000</span>);
}
}
<span class="macro">assert_eq!</span>(map.get(<span class="string">&quot;Ten&quot;</span>).unwrap(), <span class="kw-2">&amp;</span><span class="number">1000</span>);
<span class="macro">assert_eq!</span>(map.len(), <span class="number">6</span>);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_entry_take_doesnt_corrupt() {
<span class="attribute">#![allow(deprecated)] </span><span class="comment">//rand
// Test for #19292
</span><span class="kw">fn </span>check(m: <span class="kw-2">&amp;</span>HashMap&lt;i32, ()&gt;) {
<span class="kw">for </span>k <span class="kw">in </span>m.keys() {
<span class="macro">assert!</span>(m.contains_key(k), <span class="string">&quot;{} is in keys() but not in the map?&quot;</span>, k);
}
}
<span class="kw">let </span><span class="kw-2">mut </span>m = HashMap::new();
<span class="kw">let </span><span class="kw-2">mut </span>rng = {
<span class="kw">let </span>seed = u64::from_le_bytes(<span class="kw-2">*</span><span class="string">b&quot;testseed&quot;</span>);
SmallRng::seed_from_u64(seed)
};
<span class="comment">// Populate the map with some items.
</span><span class="kw">for _ in </span><span class="number">0</span>..<span class="number">50 </span>{
<span class="kw">let </span>x = rng.gen_range(-<span class="number">10</span>..<span class="number">10</span>);
m.insert(x, ());
}
<span class="kw">for _ in </span><span class="number">0</span>..<span class="number">1000 </span>{
<span class="kw">let </span>x = rng.gen_range(-<span class="number">10</span>..<span class="number">10</span>);
<span class="kw">match </span>m.entry(x) {
Vacant(<span class="kw">_</span>) =&gt; {}
Occupied(e) =&gt; {
e.remove();
}
}
check(<span class="kw-2">&amp;</span>m);
}
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_entry_ref_take_doesnt_corrupt() {
<span class="attribute">#![allow(deprecated)] </span><span class="comment">//rand
// Test for #19292
</span><span class="kw">fn </span>check(m: <span class="kw-2">&amp;</span>HashMap&lt;std::string::String, ()&gt;) {
<span class="kw">for </span>k <span class="kw">in </span>m.keys() {
<span class="macro">assert!</span>(m.contains_key(k), <span class="string">&quot;{} is in keys() but not in the map?&quot;</span>, k);
}
}
<span class="kw">let </span><span class="kw-2">mut </span>m = HashMap::new();
<span class="kw">let </span><span class="kw-2">mut </span>rng = {
<span class="kw">let </span>seed = u64::from_le_bytes(<span class="kw-2">*</span><span class="string">b&quot;testseed&quot;</span>);
SmallRng::seed_from_u64(seed)
};
<span class="comment">// Populate the map with some items.
</span><span class="kw">for _ in </span><span class="number">0</span>..<span class="number">50 </span>{
<span class="kw">let </span><span class="kw-2">mut </span>x = std::string::String::with_capacity(<span class="number">1</span>);
x.push(rng.gen_range(<span class="string">&#39;a&#39;</span>..=<span class="string">&#39;z&#39;</span>));
m.insert(x, ());
}
<span class="kw">for _ in </span><span class="number">0</span>..<span class="number">1000 </span>{
<span class="kw">let </span><span class="kw-2">mut </span>x = std::string::String::with_capacity(<span class="number">1</span>);
x.push(rng.gen_range(<span class="string">&#39;a&#39;</span>..=<span class="string">&#39;z&#39;</span>));
<span class="kw">match </span>m.entry_ref(x.as_str()) {
EntryRef::Vacant(<span class="kw">_</span>) =&gt; {}
EntryRef::Occupied(e) =&gt; {
e.remove();
}
}
check(<span class="kw-2">&amp;</span>m);
}
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_extend_ref_k_ref_v() {
<span class="kw">let </span><span class="kw-2">mut </span>a = HashMap::new();
a.insert(<span class="number">1</span>, <span class="string">&quot;one&quot;</span>);
<span class="kw">let </span><span class="kw-2">mut </span>b = HashMap::new();
b.insert(<span class="number">2</span>, <span class="string">&quot;two&quot;</span>);
b.insert(<span class="number">3</span>, <span class="string">&quot;three&quot;</span>);
a.extend(<span class="kw-2">&amp;</span>b);
<span class="macro">assert_eq!</span>(a.len(), <span class="number">3</span>);
<span class="macro">assert_eq!</span>(a[<span class="kw-2">&amp;</span><span class="number">1</span>], <span class="string">&quot;one&quot;</span>);
<span class="macro">assert_eq!</span>(a[<span class="kw-2">&amp;</span><span class="number">2</span>], <span class="string">&quot;two&quot;</span>);
<span class="macro">assert_eq!</span>(a[<span class="kw-2">&amp;</span><span class="number">3</span>], <span class="string">&quot;three&quot;</span>);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_extend_ref_kv_tuple() {
<span class="kw">use </span>std::ops::AddAssign;
<span class="kw">let </span><span class="kw-2">mut </span>a = HashMap::new();
a.insert(<span class="number">0</span>, <span class="number">0</span>);
<span class="kw">fn </span>create_arr&lt;T: AddAssign&lt;T&gt; + Copy, <span class="kw">const </span>N: usize&gt;(start: T, step: T) -&gt; [(T, T); N] {
<span class="kw">let </span><span class="kw-2">mut </span>outs: [(T, T); N] = [(start, start); N];
<span class="kw">let </span><span class="kw-2">mut </span>element = step;
outs.iter_mut().skip(<span class="number">1</span>).for_each(|(k, v)| {
<span class="kw-2">*</span>k += element;
<span class="kw-2">*</span>v += element;
element += step;
});
outs
}
<span class="kw">let </span>for_iter: Vec&lt;<span class="kw">_</span>&gt; = (<span class="number">0</span>..<span class="number">100</span>).map(|i| (i, i)).collect();
<span class="kw">let </span>iter = for_iter.iter();
<span class="kw">let </span>vec: Vec&lt;<span class="kw">_</span>&gt; = (<span class="number">100</span>..<span class="number">200</span>).map(|i| (i, i)).collect();
a.extend(iter);
a.extend(<span class="kw-2">&amp;</span>vec);
a.extend(<span class="kw-2">&amp;</span>create_arr::&lt;i32, <span class="number">100</span>&gt;(<span class="number">200</span>, <span class="number">1</span>));
<span class="macro">assert_eq!</span>(a.len(), <span class="number">300</span>);
<span class="kw">for </span>item <span class="kw">in </span><span class="number">0</span>..<span class="number">300 </span>{
<span class="macro">assert_eq!</span>(a[<span class="kw-2">&amp;</span>item], item);
}
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_capacity_not_less_than_len() {
<span class="kw">let </span><span class="kw-2">mut </span>a = HashMap::new();
<span class="kw">let </span><span class="kw-2">mut </span>item = <span class="number">0</span>;
<span class="kw">for _ in </span><span class="number">0</span>..<span class="number">116 </span>{
a.insert(item, <span class="number">0</span>);
item += <span class="number">1</span>;
}
<span class="macro">assert!</span>(a.capacity() &gt; a.len());
<span class="kw">let </span>free = a.capacity() - a.len();
<span class="kw">for _ in </span><span class="number">0</span>..free {
a.insert(item, <span class="number">0</span>);
item += <span class="number">1</span>;
}
<span class="macro">assert_eq!</span>(a.len(), a.capacity());
<span class="comment">// Insert at capacity should cause allocation.
</span>a.insert(item, <span class="number">0</span>);
<span class="macro">assert!</span>(a.capacity() &gt; a.len());
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_occupied_entry_key() {
<span class="kw">let </span><span class="kw-2">mut </span>a = HashMap::new();
<span class="kw">let </span>key = <span class="string">&quot;hello there&quot;</span>;
<span class="kw">let </span>value = <span class="string">&quot;value goes here&quot;</span>;
<span class="macro">assert!</span>(a.is_empty());
a.insert(key, value);
<span class="macro">assert_eq!</span>(a.len(), <span class="number">1</span>);
<span class="macro">assert_eq!</span>(a[key], value);
<span class="kw">match </span>a.entry(key) {
Vacant(<span class="kw">_</span>) =&gt; <span class="macro">panic!</span>(),
Occupied(e) =&gt; <span class="macro">assert_eq!</span>(key, <span class="kw-2">*</span>e.key()),
}
<span class="macro">assert_eq!</span>(a.len(), <span class="number">1</span>);
<span class="macro">assert_eq!</span>(a[key], value);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_occupied_entry_ref_key() {
<span class="kw">let </span><span class="kw-2">mut </span>a = HashMap::new();
<span class="kw">let </span>key = <span class="string">&quot;hello there&quot;</span>;
<span class="kw">let </span>value = <span class="string">&quot;value goes here&quot;</span>;
<span class="macro">assert!</span>(a.is_empty());
a.insert(key.to_owned(), value);
<span class="macro">assert_eq!</span>(a.len(), <span class="number">1</span>);
<span class="macro">assert_eq!</span>(a[key], value);
<span class="kw">match </span>a.entry_ref(key) {
EntryRef::Vacant(<span class="kw">_</span>) =&gt; <span class="macro">panic!</span>(),
EntryRef::Occupied(e) =&gt; <span class="macro">assert_eq!</span>(key, e.key()),
}
<span class="macro">assert_eq!</span>(a.len(), <span class="number">1</span>);
<span class="macro">assert_eq!</span>(a[key], value);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_vacant_entry_key() {
<span class="kw">let </span><span class="kw-2">mut </span>a = HashMap::new();
<span class="kw">let </span>key = <span class="string">&quot;hello there&quot;</span>;
<span class="kw">let </span>value = <span class="string">&quot;value goes here&quot;</span>;
<span class="macro">assert!</span>(a.is_empty());
<span class="kw">match </span>a.entry(key) {
Occupied(<span class="kw">_</span>) =&gt; <span class="macro">panic!</span>(),
Vacant(e) =&gt; {
<span class="macro">assert_eq!</span>(key, <span class="kw-2">*</span>e.key());
e.insert(value);
}
}
<span class="macro">assert_eq!</span>(a.len(), <span class="number">1</span>);
<span class="macro">assert_eq!</span>(a[key], value);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_vacant_entry_ref_key() {
<span class="kw">let </span><span class="kw-2">mut </span>a: HashMap&lt;std::string::String, <span class="kw-2">&amp;</span>str&gt; = HashMap::new();
<span class="kw">let </span>key = <span class="string">&quot;hello there&quot;</span>;
<span class="kw">let </span>value = <span class="string">&quot;value goes here&quot;</span>;
<span class="macro">assert!</span>(a.is_empty());
<span class="kw">match </span>a.entry_ref(key) {
EntryRef::Occupied(<span class="kw">_</span>) =&gt; <span class="macro">panic!</span>(),
EntryRef::Vacant(e) =&gt; {
<span class="macro">assert_eq!</span>(key, e.key());
e.insert(value);
}
}
<span class="macro">assert_eq!</span>(a.len(), <span class="number">1</span>);
<span class="macro">assert_eq!</span>(a[key], value);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_occupied_entry_replace_entry_with() {
<span class="kw">let </span><span class="kw-2">mut </span>a = HashMap::new();
<span class="kw">let </span>key = <span class="string">&quot;a key&quot;</span>;
<span class="kw">let </span>value = <span class="string">&quot;an initial value&quot;</span>;
<span class="kw">let </span>new_value = <span class="string">&quot;a new value&quot;</span>;
<span class="kw">let </span>entry = a.entry(key).insert(value).replace_entry_with(|k, v| {
<span class="macro">assert_eq!</span>(k, <span class="kw-2">&amp;</span>key);
<span class="macro">assert_eq!</span>(v, value);
<span class="prelude-val">Some</span>(new_value)
});
<span class="kw">match </span>entry {
Occupied(e) =&gt; {
<span class="macro">assert_eq!</span>(e.key(), <span class="kw-2">&amp;</span>key);
<span class="macro">assert_eq!</span>(e.get(), <span class="kw-2">&amp;</span>new_value);
}
Vacant(<span class="kw">_</span>) =&gt; <span class="macro">panic!</span>(),
}
<span class="macro">assert_eq!</span>(a[key], new_value);
<span class="macro">assert_eq!</span>(a.len(), <span class="number">1</span>);
<span class="kw">let </span>entry = <span class="kw">match </span>a.entry(key) {
Occupied(e) =&gt; e.replace_entry_with(|k, v| {
<span class="macro">assert_eq!</span>(k, <span class="kw-2">&amp;</span>key);
<span class="macro">assert_eq!</span>(v, new_value);
<span class="prelude-val">None
</span>}),
Vacant(<span class="kw">_</span>) =&gt; <span class="macro">panic!</span>(),
};
<span class="kw">match </span>entry {
Vacant(e) =&gt; <span class="macro">assert_eq!</span>(e.key(), <span class="kw-2">&amp;</span>key),
Occupied(<span class="kw">_</span>) =&gt; <span class="macro">panic!</span>(),
}
<span class="macro">assert!</span>(!a.contains_key(key));
<span class="macro">assert_eq!</span>(a.len(), <span class="number">0</span>);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_occupied_entry_ref_replace_entry_with() {
<span class="kw">let </span><span class="kw-2">mut </span>a: HashMap&lt;std::string::String, <span class="kw-2">&amp;</span>str&gt; = HashMap::new();
<span class="kw">let </span>key = <span class="string">&quot;a key&quot;</span>;
<span class="kw">let </span>value = <span class="string">&quot;an initial value&quot;</span>;
<span class="kw">let </span>new_value = <span class="string">&quot;a new value&quot;</span>;
<span class="kw">let </span>entry = a.entry_ref(key).insert(value).replace_entry_with(|k, v| {
<span class="macro">assert_eq!</span>(k, key);
<span class="macro">assert_eq!</span>(v, value);
<span class="prelude-val">Some</span>(new_value)
});
<span class="kw">match </span>entry {
EntryRef::Occupied(e) =&gt; {
<span class="macro">assert_eq!</span>(e.key(), key);
<span class="macro">assert_eq!</span>(e.get(), <span class="kw-2">&amp;</span>new_value);
}
EntryRef::Vacant(<span class="kw">_</span>) =&gt; <span class="macro">panic!</span>(),
}
<span class="macro">assert_eq!</span>(a[key], new_value);
<span class="macro">assert_eq!</span>(a.len(), <span class="number">1</span>);
<span class="kw">let </span>entry = <span class="kw">match </span>a.entry_ref(key) {
EntryRef::Occupied(e) =&gt; e.replace_entry_with(|k, v| {
<span class="macro">assert_eq!</span>(k, key);
<span class="macro">assert_eq!</span>(v, new_value);
<span class="prelude-val">None
</span>}),
EntryRef::Vacant(<span class="kw">_</span>) =&gt; <span class="macro">panic!</span>(),
};
<span class="kw">match </span>entry {
EntryRef::Vacant(e) =&gt; <span class="macro">assert_eq!</span>(e.key(), key),
EntryRef::Occupied(<span class="kw">_</span>) =&gt; <span class="macro">panic!</span>(),
}
<span class="macro">assert!</span>(!a.contains_key(key));
<span class="macro">assert_eq!</span>(a.len(), <span class="number">0</span>);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_entry_and_replace_entry_with() {
<span class="kw">let </span><span class="kw-2">mut </span>a = HashMap::new();
<span class="kw">let </span>key = <span class="string">&quot;a key&quot;</span>;
<span class="kw">let </span>value = <span class="string">&quot;an initial value&quot;</span>;
<span class="kw">let </span>new_value = <span class="string">&quot;a new value&quot;</span>;
<span class="kw">let </span>entry = a.entry(key).and_replace_entry_with(|<span class="kw">_</span>, <span class="kw">_</span>| <span class="macro">panic!</span>());
<span class="kw">match </span>entry {
Vacant(e) =&gt; <span class="macro">assert_eq!</span>(e.key(), <span class="kw-2">&amp;</span>key),
Occupied(<span class="kw">_</span>) =&gt; <span class="macro">panic!</span>(),
}
a.insert(key, value);
<span class="kw">let </span>entry = a.entry(key).and_replace_entry_with(|k, v| {
<span class="macro">assert_eq!</span>(k, <span class="kw-2">&amp;</span>key);
<span class="macro">assert_eq!</span>(v, value);
<span class="prelude-val">Some</span>(new_value)
});
<span class="kw">match </span>entry {
Occupied(e) =&gt; {
<span class="macro">assert_eq!</span>(e.key(), <span class="kw-2">&amp;</span>key);
<span class="macro">assert_eq!</span>(e.get(), <span class="kw-2">&amp;</span>new_value);
}
Vacant(<span class="kw">_</span>) =&gt; <span class="macro">panic!</span>(),
}
<span class="macro">assert_eq!</span>(a[key], new_value);
<span class="macro">assert_eq!</span>(a.len(), <span class="number">1</span>);
<span class="kw">let </span>entry = a.entry(key).and_replace_entry_with(|k, v| {
<span class="macro">assert_eq!</span>(k, <span class="kw-2">&amp;</span>key);
<span class="macro">assert_eq!</span>(v, new_value);
<span class="prelude-val">None
</span>});
<span class="kw">match </span>entry {
Vacant(e) =&gt; <span class="macro">assert_eq!</span>(e.key(), <span class="kw-2">&amp;</span>key),
Occupied(<span class="kw">_</span>) =&gt; <span class="macro">panic!</span>(),
}
<span class="macro">assert!</span>(!a.contains_key(key));
<span class="macro">assert_eq!</span>(a.len(), <span class="number">0</span>);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_entry_ref_and_replace_entry_with() {
<span class="kw">let </span><span class="kw-2">mut </span>a = HashMap::new();
<span class="kw">let </span>key = <span class="string">&quot;a key&quot;</span>;
<span class="kw">let </span>value = <span class="string">&quot;an initial value&quot;</span>;
<span class="kw">let </span>new_value = <span class="string">&quot;a new value&quot;</span>;
<span class="kw">let </span>entry = a.entry_ref(key).and_replace_entry_with(|<span class="kw">_</span>, <span class="kw">_</span>| <span class="macro">panic!</span>());
<span class="kw">match </span>entry {
EntryRef::Vacant(e) =&gt; <span class="macro">assert_eq!</span>(e.key(), key),
EntryRef::Occupied(<span class="kw">_</span>) =&gt; <span class="macro">panic!</span>(),
}
a.insert(key.to_owned(), value);
<span class="kw">let </span>entry = a.entry_ref(key).and_replace_entry_with(|k, v| {
<span class="macro">assert_eq!</span>(k, key);
<span class="macro">assert_eq!</span>(v, value);
<span class="prelude-val">Some</span>(new_value)
});
<span class="kw">match </span>entry {
EntryRef::Occupied(e) =&gt; {
<span class="macro">assert_eq!</span>(e.key(), key);
<span class="macro">assert_eq!</span>(e.get(), <span class="kw-2">&amp;</span>new_value);
}
EntryRef::Vacant(<span class="kw">_</span>) =&gt; <span class="macro">panic!</span>(),
}
<span class="macro">assert_eq!</span>(a[key], new_value);
<span class="macro">assert_eq!</span>(a.len(), <span class="number">1</span>);
<span class="kw">let </span>entry = a.entry_ref(key).and_replace_entry_with(|k, v| {
<span class="macro">assert_eq!</span>(k, key);
<span class="macro">assert_eq!</span>(v, new_value);
<span class="prelude-val">None
</span>});
<span class="kw">match </span>entry {
EntryRef::Vacant(e) =&gt; <span class="macro">assert_eq!</span>(e.key(), key),
EntryRef::Occupied(<span class="kw">_</span>) =&gt; <span class="macro">panic!</span>(),
}
<span class="macro">assert!</span>(!a.contains_key(key));
<span class="macro">assert_eq!</span>(a.len(), <span class="number">0</span>);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_raw_occupied_entry_replace_entry_with() {
<span class="kw">let </span><span class="kw-2">mut </span>a = HashMap::new();
<span class="kw">let </span>key = <span class="string">&quot;a key&quot;</span>;
<span class="kw">let </span>value = <span class="string">&quot;an initial value&quot;</span>;
<span class="kw">let </span>new_value = <span class="string">&quot;a new value&quot;</span>;
<span class="kw">let </span>entry = a
.raw_entry_mut()
.from_key(<span class="kw-2">&amp;</span>key)
.insert(key, value)
.replace_entry_with(|k, v| {
<span class="macro">assert_eq!</span>(k, <span class="kw-2">&amp;</span>key);
<span class="macro">assert_eq!</span>(v, value);
<span class="prelude-val">Some</span>(new_value)
});
<span class="kw">match </span>entry {
RawEntryMut::Occupied(e) =&gt; {
<span class="macro">assert_eq!</span>(e.key(), <span class="kw-2">&amp;</span>key);
<span class="macro">assert_eq!</span>(e.get(), <span class="kw-2">&amp;</span>new_value);
}
RawEntryMut::Vacant(<span class="kw">_</span>) =&gt; <span class="macro">panic!</span>(),
}
<span class="macro">assert_eq!</span>(a[key], new_value);
<span class="macro">assert_eq!</span>(a.len(), <span class="number">1</span>);
<span class="kw">let </span>entry = <span class="kw">match </span>a.raw_entry_mut().from_key(<span class="kw-2">&amp;</span>key) {
RawEntryMut::Occupied(e) =&gt; e.replace_entry_with(|k, v| {
<span class="macro">assert_eq!</span>(k, <span class="kw-2">&amp;</span>key);
<span class="macro">assert_eq!</span>(v, new_value);
<span class="prelude-val">None
</span>}),
RawEntryMut::Vacant(<span class="kw">_</span>) =&gt; <span class="macro">panic!</span>(),
};
<span class="kw">match </span>entry {
RawEntryMut::Vacant(<span class="kw">_</span>) =&gt; {}
RawEntryMut::Occupied(<span class="kw">_</span>) =&gt; <span class="macro">panic!</span>(),
}
<span class="macro">assert!</span>(!a.contains_key(key));
<span class="macro">assert_eq!</span>(a.len(), <span class="number">0</span>);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_raw_entry_and_replace_entry_with() {
<span class="kw">let </span><span class="kw-2">mut </span>a = HashMap::new();
<span class="kw">let </span>key = <span class="string">&quot;a key&quot;</span>;
<span class="kw">let </span>value = <span class="string">&quot;an initial value&quot;</span>;
<span class="kw">let </span>new_value = <span class="string">&quot;a new value&quot;</span>;
<span class="kw">let </span>entry = a
.raw_entry_mut()
.from_key(<span class="kw-2">&amp;</span>key)
.and_replace_entry_with(|<span class="kw">_</span>, <span class="kw">_</span>| <span class="macro">panic!</span>());
<span class="kw">match </span>entry {
RawEntryMut::Vacant(<span class="kw">_</span>) =&gt; {}
RawEntryMut::Occupied(<span class="kw">_</span>) =&gt; <span class="macro">panic!</span>(),
}
a.insert(key, value);
<span class="kw">let </span>entry = a
.raw_entry_mut()
.from_key(<span class="kw-2">&amp;</span>key)
.and_replace_entry_with(|k, v| {
<span class="macro">assert_eq!</span>(k, <span class="kw-2">&amp;</span>key);
<span class="macro">assert_eq!</span>(v, value);
<span class="prelude-val">Some</span>(new_value)
});
<span class="kw">match </span>entry {
RawEntryMut::Occupied(e) =&gt; {
<span class="macro">assert_eq!</span>(e.key(), <span class="kw-2">&amp;</span>key);
<span class="macro">assert_eq!</span>(e.get(), <span class="kw-2">&amp;</span>new_value);
}
RawEntryMut::Vacant(<span class="kw">_</span>) =&gt; <span class="macro">panic!</span>(),
}
<span class="macro">assert_eq!</span>(a[key], new_value);
<span class="macro">assert_eq!</span>(a.len(), <span class="number">1</span>);
<span class="kw">let </span>entry = a
.raw_entry_mut()
.from_key(<span class="kw-2">&amp;</span>key)
.and_replace_entry_with(|k, v| {
<span class="macro">assert_eq!</span>(k, <span class="kw-2">&amp;</span>key);
<span class="macro">assert_eq!</span>(v, new_value);
<span class="prelude-val">None
</span>});
<span class="kw">match </span>entry {
RawEntryMut::Vacant(<span class="kw">_</span>) =&gt; {}
RawEntryMut::Occupied(<span class="kw">_</span>) =&gt; <span class="macro">panic!</span>(),
}
<span class="macro">assert!</span>(!a.contains_key(key));
<span class="macro">assert_eq!</span>(a.len(), <span class="number">0</span>);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_replace_entry_with_doesnt_corrupt() {
<span class="attribute">#![allow(deprecated)] </span><span class="comment">//rand
// Test for #19292
</span><span class="kw">fn </span>check(m: <span class="kw-2">&amp;</span>HashMap&lt;i32, ()&gt;) {
<span class="kw">for </span>k <span class="kw">in </span>m.keys() {
<span class="macro">assert!</span>(m.contains_key(k), <span class="string">&quot;{} is in keys() but not in the map?&quot;</span>, k);
}
}
<span class="kw">let </span><span class="kw-2">mut </span>m = HashMap::new();
<span class="kw">let </span><span class="kw-2">mut </span>rng = {
<span class="kw">let </span>seed = u64::from_le_bytes(<span class="kw-2">*</span><span class="string">b&quot;testseed&quot;</span>);
SmallRng::seed_from_u64(seed)
};
<span class="comment">// Populate the map with some items.
</span><span class="kw">for _ in </span><span class="number">0</span>..<span class="number">50 </span>{
<span class="kw">let </span>x = rng.gen_range(-<span class="number">10</span>..<span class="number">10</span>);
m.insert(x, ());
}
<span class="kw">for _ in </span><span class="number">0</span>..<span class="number">1000 </span>{
<span class="kw">let </span>x = rng.gen_range(-<span class="number">10</span>..<span class="number">10</span>);
m.entry(x).and_replace_entry_with(|<span class="kw">_</span>, <span class="kw">_</span>| <span class="prelude-val">None</span>);
check(<span class="kw-2">&amp;</span>m);
}
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_replace_entry_ref_with_doesnt_corrupt() {
<span class="attribute">#![allow(deprecated)] </span><span class="comment">//rand
// Test for #19292
</span><span class="kw">fn </span>check(m: <span class="kw-2">&amp;</span>HashMap&lt;std::string::String, ()&gt;) {
<span class="kw">for </span>k <span class="kw">in </span>m.keys() {
<span class="macro">assert!</span>(m.contains_key(k), <span class="string">&quot;{} is in keys() but not in the map?&quot;</span>, k);
}
}
<span class="kw">let </span><span class="kw-2">mut </span>m = HashMap::new();
<span class="kw">let </span><span class="kw-2">mut </span>rng = {
<span class="kw">let </span>seed = u64::from_le_bytes(<span class="kw-2">*</span><span class="string">b&quot;testseed&quot;</span>);
SmallRng::seed_from_u64(seed)
};
<span class="comment">// Populate the map with some items.
</span><span class="kw">for _ in </span><span class="number">0</span>..<span class="number">50 </span>{
<span class="kw">let </span><span class="kw-2">mut </span>x = std::string::String::with_capacity(<span class="number">1</span>);
x.push(rng.gen_range(<span class="string">&#39;a&#39;</span>..=<span class="string">&#39;z&#39;</span>));
m.insert(x, ());
}
<span class="kw">for _ in </span><span class="number">0</span>..<span class="number">1000 </span>{
<span class="kw">let </span><span class="kw-2">mut </span>x = std::string::String::with_capacity(<span class="number">1</span>);
x.push(rng.gen_range(<span class="string">&#39;a&#39;</span>..=<span class="string">&#39;z&#39;</span>));
m.entry_ref(x.as_str()).and_replace_entry_with(|<span class="kw">_</span>, <span class="kw">_</span>| <span class="prelude-val">None</span>);
check(<span class="kw-2">&amp;</span>m);
}
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_retain() {
<span class="kw">let </span><span class="kw-2">mut </span>map: HashMap&lt;i32, i32&gt; = (<span class="number">0</span>..<span class="number">100</span>).map(|x| (x, x * <span class="number">10</span>)).collect();
map.retain(|<span class="kw-2">&amp;</span>k, <span class="kw">_</span>| k % <span class="number">2 </span>== <span class="number">0</span>);
<span class="macro">assert_eq!</span>(map.len(), <span class="number">50</span>);
<span class="macro">assert_eq!</span>(map[<span class="kw-2">&amp;</span><span class="number">2</span>], <span class="number">20</span>);
<span class="macro">assert_eq!</span>(map[<span class="kw-2">&amp;</span><span class="number">4</span>], <span class="number">40</span>);
<span class="macro">assert_eq!</span>(map[<span class="kw-2">&amp;</span><span class="number">6</span>], <span class="number">60</span>);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_drain_filter() {
{
<span class="kw">let </span><span class="kw-2">mut </span>map: HashMap&lt;i32, i32&gt; = (<span class="number">0</span>..<span class="number">8</span>).map(|x| (x, x * <span class="number">10</span>)).collect();
<span class="kw">let </span>drained = map.drain_filter(|<span class="kw-2">&amp;</span>k, <span class="kw">_</span>| k % <span class="number">2 </span>== <span class="number">0</span>);
<span class="kw">let </span><span class="kw-2">mut </span>out = drained.collect::&lt;Vec&lt;<span class="kw">_</span>&gt;&gt;();
out.sort_unstable();
<span class="macro">assert_eq!</span>(<span class="macro">vec!</span>[(<span class="number">0</span>, <span class="number">0</span>), (<span class="number">2</span>, <span class="number">20</span>), (<span class="number">4</span>, <span class="number">40</span>), (<span class="number">6</span>, <span class="number">60</span>)], out);
<span class="macro">assert_eq!</span>(map.len(), <span class="number">4</span>);
}
{
<span class="kw">let </span><span class="kw-2">mut </span>map: HashMap&lt;i32, i32&gt; = (<span class="number">0</span>..<span class="number">8</span>).map(|x| (x, x * <span class="number">10</span>)).collect();
drop(map.drain_filter(|<span class="kw-2">&amp;</span>k, <span class="kw">_</span>| k % <span class="number">2 </span>== <span class="number">0</span>));
<span class="macro">assert_eq!</span>(map.len(), <span class="number">4</span>);
}
}
<span class="attribute">#[test]
#[cfg_attr(miri, ignore)] </span><span class="comment">// FIXME: no OOM signalling (https://github.com/rust-lang/miri/issues/613)
</span><span class="kw">fn </span>test_try_reserve() {
<span class="kw">use </span><span class="kw">crate</span>::TryReserveError::{AllocError, CapacityOverflow};
<span class="kw">const </span>MAX_USIZE: usize = usize::MAX;
<span class="kw">let </span><span class="kw-2">mut </span>empty_bytes: HashMap&lt;u8, u8&gt; = HashMap::new();
<span class="kw">if let </span><span class="prelude-val">Err</span>(CapacityOverflow) = empty_bytes.try_reserve(MAX_USIZE) {
} <span class="kw">else </span>{
<span class="macro">panic!</span>(<span class="string">&quot;usize::MAX should trigger an overflow!&quot;</span>);
}
<span class="kw">if let </span><span class="prelude-val">Err</span>(AllocError { .. }) = empty_bytes.try_reserve(MAX_USIZE / <span class="number">16</span>) {
} <span class="kw">else </span>{
<span class="comment">// This may succeed if there is enough free memory. Attempt to
// allocate a few more hashmaps to ensure the allocation will fail.
</span><span class="kw">let </span><span class="kw-2">mut </span>empty_bytes2: HashMap&lt;u8, u8&gt; = HashMap::new();
<span class="kw">let _ </span>= empty_bytes2.try_reserve(MAX_USIZE / <span class="number">16</span>);
<span class="kw">let </span><span class="kw-2">mut </span>empty_bytes3: HashMap&lt;u8, u8&gt; = HashMap::new();
<span class="kw">let _ </span>= empty_bytes3.try_reserve(MAX_USIZE / <span class="number">16</span>);
<span class="kw">let </span><span class="kw-2">mut </span>empty_bytes4: HashMap&lt;u8, u8&gt; = HashMap::new();
<span class="kw">if let </span><span class="prelude-val">Err</span>(AllocError { .. }) = empty_bytes4.try_reserve(MAX_USIZE / <span class="number">16</span>) {
} <span class="kw">else </span>{
<span class="macro">panic!</span>(<span class="string">&quot;usize::MAX / 8 should trigger an OOM!&quot;</span>);
}
}
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_raw_entry() {
<span class="kw">use </span><span class="kw">super</span>::RawEntryMut::{Occupied, Vacant};
<span class="kw">let </span>xs = [(<span class="number">1_i32</span>, <span class="number">10_i32</span>), (<span class="number">2</span>, <span class="number">20</span>), (<span class="number">3</span>, <span class="number">30</span>), (<span class="number">4</span>, <span class="number">40</span>), (<span class="number">5</span>, <span class="number">50</span>), (<span class="number">6</span>, <span class="number">60</span>)];
<span class="kw">let </span><span class="kw-2">mut </span>map: HashMap&lt;<span class="kw">_</span>, <span class="kw">_</span>&gt; = xs.iter().copied().collect();
<span class="kw">let </span>compute_hash = |map: <span class="kw-2">&amp;</span>HashMap&lt;i32, i32&gt;, k: i32| -&gt; u64 {
<span class="kw">super</span>::make_insert_hash::&lt;i32, <span class="kw">_</span>&gt;(map.hasher(), <span class="kw-2">&amp;</span>k)
};
<span class="comment">// Existing key (insert)
</span><span class="kw">match </span>map.raw_entry_mut().from_key(<span class="kw-2">&amp;</span><span class="number">1</span>) {
Vacant(<span class="kw">_</span>) =&gt; <span class="macro">unreachable!</span>(),
Occupied(<span class="kw-2">mut </span>view) =&gt; {
<span class="macro">assert_eq!</span>(view.get(), <span class="kw-2">&amp;</span><span class="number">10</span>);
<span class="macro">assert_eq!</span>(view.insert(<span class="number">100</span>), <span class="number">10</span>);
}
}
<span class="kw">let </span>hash1 = compute_hash(<span class="kw-2">&amp;</span>map, <span class="number">1</span>);
<span class="macro">assert_eq!</span>(map.raw_entry().from_key(<span class="kw-2">&amp;</span><span class="number">1</span>).unwrap(), (<span class="kw-2">&amp;</span><span class="number">1</span>, <span class="kw-2">&amp;</span><span class="number">100</span>));
<span class="macro">assert_eq!</span>(
map.raw_entry().from_hash(hash1, |k| <span class="kw-2">*</span>k == <span class="number">1</span>).unwrap(),
(<span class="kw-2">&amp;</span><span class="number">1</span>, <span class="kw-2">&amp;</span><span class="number">100</span>)
);
<span class="macro">assert_eq!</span>(
map.raw_entry().from_key_hashed_nocheck(hash1, <span class="kw-2">&amp;</span><span class="number">1</span>).unwrap(),
(<span class="kw-2">&amp;</span><span class="number">1</span>, <span class="kw-2">&amp;</span><span class="number">100</span>)
);
<span class="macro">assert_eq!</span>(map.len(), <span class="number">6</span>);
<span class="comment">// Existing key (update)
</span><span class="kw">match </span>map.raw_entry_mut().from_key(<span class="kw-2">&amp;</span><span class="number">2</span>) {
Vacant(<span class="kw">_</span>) =&gt; <span class="macro">unreachable!</span>(),
Occupied(<span class="kw-2">mut </span>view) =&gt; {
<span class="kw">let </span>v = view.get_mut();
<span class="kw">let </span>new_v = (<span class="kw-2">*</span>v) * <span class="number">10</span>;
<span class="kw-2">*</span>v = new_v;
}
}
<span class="kw">let </span>hash2 = compute_hash(<span class="kw-2">&amp;</span>map, <span class="number">2</span>);
<span class="macro">assert_eq!</span>(map.raw_entry().from_key(<span class="kw-2">&amp;</span><span class="number">2</span>).unwrap(), (<span class="kw-2">&amp;</span><span class="number">2</span>, <span class="kw-2">&amp;</span><span class="number">200</span>));
<span class="macro">assert_eq!</span>(
map.raw_entry().from_hash(hash2, |k| <span class="kw-2">*</span>k == <span class="number">2</span>).unwrap(),
(<span class="kw-2">&amp;</span><span class="number">2</span>, <span class="kw-2">&amp;</span><span class="number">200</span>)
);
<span class="macro">assert_eq!</span>(
map.raw_entry().from_key_hashed_nocheck(hash2, <span class="kw-2">&amp;</span><span class="number">2</span>).unwrap(),
(<span class="kw-2">&amp;</span><span class="number">2</span>, <span class="kw-2">&amp;</span><span class="number">200</span>)
);
<span class="macro">assert_eq!</span>(map.len(), <span class="number">6</span>);
<span class="comment">// Existing key (take)
</span><span class="kw">let </span>hash3 = compute_hash(<span class="kw-2">&amp;</span>map, <span class="number">3</span>);
<span class="kw">match </span>map.raw_entry_mut().from_key_hashed_nocheck(hash3, <span class="kw-2">&amp;</span><span class="number">3</span>) {
Vacant(<span class="kw">_</span>) =&gt; <span class="macro">unreachable!</span>(),
Occupied(view) =&gt; {
<span class="macro">assert_eq!</span>(view.remove_entry(), (<span class="number">3</span>, <span class="number">30</span>));
}
}
<span class="macro">assert_eq!</span>(map.raw_entry().from_key(<span class="kw-2">&amp;</span><span class="number">3</span>), <span class="prelude-val">None</span>);
<span class="macro">assert_eq!</span>(map.raw_entry().from_hash(hash3, |k| <span class="kw-2">*</span>k == <span class="number">3</span>), <span class="prelude-val">None</span>);
<span class="macro">assert_eq!</span>(map.raw_entry().from_key_hashed_nocheck(hash3, <span class="kw-2">&amp;</span><span class="number">3</span>), <span class="prelude-val">None</span>);
<span class="macro">assert_eq!</span>(map.len(), <span class="number">5</span>);
<span class="comment">// Nonexistent key (insert)
</span><span class="kw">match </span>map.raw_entry_mut().from_key(<span class="kw-2">&amp;</span><span class="number">10</span>) {
Occupied(<span class="kw">_</span>) =&gt; <span class="macro">unreachable!</span>(),
Vacant(view) =&gt; {
<span class="macro">assert_eq!</span>(view.insert(<span class="number">10</span>, <span class="number">1000</span>), (<span class="kw-2">&amp;mut </span><span class="number">10</span>, <span class="kw-2">&amp;mut </span><span class="number">1000</span>));
}
}
<span class="macro">assert_eq!</span>(map.raw_entry().from_key(<span class="kw-2">&amp;</span><span class="number">10</span>).unwrap(), (<span class="kw-2">&amp;</span><span class="number">10</span>, <span class="kw-2">&amp;</span><span class="number">1000</span>));
<span class="macro">assert_eq!</span>(map.len(), <span class="number">6</span>);
<span class="comment">// Ensure all lookup methods produce equivalent results.
</span><span class="kw">for </span>k <span class="kw">in </span><span class="number">0</span>..<span class="number">12 </span>{
<span class="kw">let </span>hash = compute_hash(<span class="kw-2">&amp;</span>map, k);
<span class="kw">let </span>v = map.get(<span class="kw-2">&amp;</span>k).copied();
<span class="kw">let </span>kv = v.as_ref().map(|v| (<span class="kw-2">&amp;</span>k, v));
<span class="macro">assert_eq!</span>(map.raw_entry().from_key(<span class="kw-2">&amp;</span>k), kv);
<span class="macro">assert_eq!</span>(map.raw_entry().from_hash(hash, |q| <span class="kw-2">*</span>q == k), kv);
<span class="macro">assert_eq!</span>(map.raw_entry().from_key_hashed_nocheck(hash, <span class="kw-2">&amp;</span>k), kv);
<span class="kw">match </span>map.raw_entry_mut().from_key(<span class="kw-2">&amp;</span>k) {
Occupied(o) =&gt; <span class="macro">assert_eq!</span>(<span class="prelude-val">Some</span>(o.get_key_value()), kv),
Vacant(<span class="kw">_</span>) =&gt; <span class="macro">assert_eq!</span>(v, <span class="prelude-val">None</span>),
}
<span class="kw">match </span>map.raw_entry_mut().from_key_hashed_nocheck(hash, <span class="kw-2">&amp;</span>k) {
Occupied(o) =&gt; <span class="macro">assert_eq!</span>(<span class="prelude-val">Some</span>(o.get_key_value()), kv),
Vacant(<span class="kw">_</span>) =&gt; <span class="macro">assert_eq!</span>(v, <span class="prelude-val">None</span>),
}
<span class="kw">match </span>map.raw_entry_mut().from_hash(hash, |q| <span class="kw-2">*</span>q == k) {
Occupied(o) =&gt; <span class="macro">assert_eq!</span>(<span class="prelude-val">Some</span>(o.get_key_value()), kv),
Vacant(<span class="kw">_</span>) =&gt; <span class="macro">assert_eq!</span>(v, <span class="prelude-val">None</span>),
}
}
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_key_without_hash_impl() {
<span class="attribute">#[derive(Debug)]
</span><span class="kw">struct </span>IntWrapper(u64);
<span class="kw">let </span><span class="kw-2">mut </span>m: HashMap&lt;IntWrapper, (), ()&gt; = HashMap::default();
{
<span class="macro">assert!</span>(m.raw_entry().from_hash(<span class="number">0</span>, |k| k.<span class="number">0 </span>== <span class="number">0</span>).is_none());
}
{
<span class="kw">let </span>vacant_entry = <span class="kw">match </span>m.raw_entry_mut().from_hash(<span class="number">0</span>, |k| k.<span class="number">0 </span>== <span class="number">0</span>) {
RawEntryMut::Occupied(..) =&gt; <span class="macro">panic!</span>(<span class="string">&quot;Found entry for key 0&quot;</span>),
RawEntryMut::Vacant(e) =&gt; e,
};
vacant_entry.insert_with_hasher(<span class="number">0</span>, IntWrapper(<span class="number">0</span>), (), |k| k.<span class="number">0</span>);
}
{
<span class="macro">assert!</span>(m.raw_entry().from_hash(<span class="number">0</span>, |k| k.<span class="number">0 </span>== <span class="number">0</span>).is_some());
<span class="macro">assert!</span>(m.raw_entry().from_hash(<span class="number">1</span>, |k| k.<span class="number">0 </span>== <span class="number">1</span>).is_none());
<span class="macro">assert!</span>(m.raw_entry().from_hash(<span class="number">2</span>, |k| k.<span class="number">0 </span>== <span class="number">2</span>).is_none());
}
{
<span class="kw">let </span>vacant_entry = <span class="kw">match </span>m.raw_entry_mut().from_hash(<span class="number">1</span>, |k| k.<span class="number">0 </span>== <span class="number">1</span>) {
RawEntryMut::Occupied(..) =&gt; <span class="macro">panic!</span>(<span class="string">&quot;Found entry for key 1&quot;</span>),
RawEntryMut::Vacant(e) =&gt; e,
};
vacant_entry.insert_with_hasher(<span class="number">1</span>, IntWrapper(<span class="number">1</span>), (), |k| k.<span class="number">0</span>);
}
{
<span class="macro">assert!</span>(m.raw_entry().from_hash(<span class="number">0</span>, |k| k.<span class="number">0 </span>== <span class="number">0</span>).is_some());
<span class="macro">assert!</span>(m.raw_entry().from_hash(<span class="number">1</span>, |k| k.<span class="number">0 </span>== <span class="number">1</span>).is_some());
<span class="macro">assert!</span>(m.raw_entry().from_hash(<span class="number">2</span>, |k| k.<span class="number">0 </span>== <span class="number">2</span>).is_none());
}
{
<span class="kw">let </span>occupied_entry = <span class="kw">match </span>m.raw_entry_mut().from_hash(<span class="number">0</span>, |k| k.<span class="number">0 </span>== <span class="number">0</span>) {
RawEntryMut::Occupied(e) =&gt; e,
RawEntryMut::Vacant(..) =&gt; <span class="macro">panic!</span>(<span class="string">&quot;Couldn&#39;t find entry for key 0&quot;</span>),
};
occupied_entry.remove();
}
<span class="macro">assert!</span>(m.raw_entry().from_hash(<span class="number">0</span>, |k| k.<span class="number">0 </span>== <span class="number">0</span>).is_none());
<span class="macro">assert!</span>(m.raw_entry().from_hash(<span class="number">1</span>, |k| k.<span class="number">0 </span>== <span class="number">1</span>).is_some());
<span class="macro">assert!</span>(m.raw_entry().from_hash(<span class="number">2</span>, |k| k.<span class="number">0 </span>== <span class="number">2</span>).is_none());
}
<span class="attribute">#[test]
#[cfg(feature = <span class="string">&quot;raw&quot;</span>)]
</span><span class="kw">fn </span>test_into_iter_refresh() {
<span class="attribute">#[cfg(miri)]
</span><span class="kw">const </span>N: usize = <span class="number">32</span>;
<span class="attribute">#[cfg(not(miri))]
</span><span class="kw">const </span>N: usize = <span class="number">128</span>;
<span class="kw">let </span><span class="kw-2">mut </span>rng = rand::thread_rng();
<span class="kw">for </span>n <span class="kw">in </span><span class="number">0</span>..N {
<span class="kw">let </span><span class="kw-2">mut </span>map = HashMap::new();
<span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..n {
<span class="macro">assert!</span>(map.insert(i, <span class="number">2 </span>* i).is_none());
}
<span class="kw">let </span>hash_builder = map.hasher().clone();
<span class="kw">let </span><span class="kw-2">mut </span>it = <span class="kw">unsafe </span>{ map.table.iter() };
<span class="macro">assert_eq!</span>(it.len(), n);
<span class="kw">let </span><span class="kw-2">mut </span>i = <span class="number">0</span>;
<span class="kw">let </span><span class="kw-2">mut </span>left = n;
<span class="kw">let </span><span class="kw-2">mut </span>removed = Vec::new();
<span class="kw">loop </span>{
<span class="comment">// occasionally remove some elements
</span><span class="kw">if </span>i &lt; n &amp;&amp; rng.gen_bool(<span class="number">0.1</span>) {
<span class="kw">let </span>hash_value = <span class="kw">super</span>::make_insert_hash(<span class="kw-2">&amp;</span>hash_builder, <span class="kw-2">&amp;</span>i);
<span class="kw">unsafe </span>{
<span class="kw">let </span>e = map.table.find(hash_value, |q| q.<span class="number">0</span>.eq(<span class="kw-2">&amp;</span>i));
<span class="kw">if let </span><span class="prelude-val">Some</span>(e) = e {
it.reflect_remove(<span class="kw-2">&amp;</span>e);
<span class="kw">let </span>t = map.table.remove(e);
removed.push(t);
left -= <span class="number">1</span>;
} <span class="kw">else </span>{
<span class="macro">assert!</span>(removed.contains(<span class="kw-2">&amp;</span>(i, <span class="number">2 </span>* i)), <span class="string">&quot;{} not in {:?}&quot;</span>, i, removed);
<span class="kw">let </span>e = map.table.insert(
hash_value,
(i, <span class="number">2 </span>* i),
<span class="kw">super</span>::make_hasher::&lt;usize, <span class="kw">_</span>, usize, <span class="kw">_</span>&gt;(<span class="kw-2">&amp;</span>hash_builder),
);
it.reflect_insert(<span class="kw-2">&amp;</span>e);
<span class="kw">if let </span><span class="prelude-val">Some</span>(p) = removed.iter().position(|e| e == <span class="kw-2">&amp;</span>(i, <span class="number">2 </span>* i)) {
removed.swap_remove(p);
}
left += <span class="number">1</span>;
}
}
}
<span class="kw">let </span>e = it.next();
<span class="kw">if </span>e.is_none() {
<span class="kw">break</span>;
}
<span class="macro">assert!</span>(i &lt; n);
<span class="kw">let </span>t = <span class="kw">unsafe </span>{ e.unwrap().as_ref() };
<span class="macro">assert!</span>(!removed.contains(t));
<span class="kw">let </span>(key, value) = t;
<span class="macro">assert_eq!</span>(<span class="kw-2">*</span>value, <span class="number">2 </span>* key);
i += <span class="number">1</span>;
}
<span class="macro">assert!</span>(i &lt;= n);
<span class="comment">// just for safety:
</span><span class="macro">assert_eq!</span>(map.table.len(), left);
}
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_const_with_hasher() {
<span class="kw">use </span>core::hash::BuildHasher;
<span class="kw">use </span>std::collections::hash_map::DefaultHasher;
<span class="attribute">#[derive(Clone)]
</span><span class="kw">struct </span>MyHasher;
<span class="kw">impl </span>BuildHasher <span class="kw">for </span>MyHasher {
<span class="kw">type </span>Hasher = DefaultHasher;
<span class="kw">fn </span>build_hasher(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; DefaultHasher {
DefaultHasher::new()
}
}
<span class="kw">const </span>EMPTY_MAP: HashMap&lt;u32, std::string::String, MyHasher&gt; =
HashMap::with_hasher(MyHasher);
<span class="kw">let </span><span class="kw-2">mut </span>map = EMPTY_MAP;
map.insert(<span class="number">17</span>, <span class="string">&quot;seventeen&quot;</span>.to_owned());
<span class="macro">assert_eq!</span>(<span class="string">&quot;seventeen&quot;</span>, map[<span class="kw-2">&amp;</span><span class="number">17</span>]);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_get_each_mut() {
<span class="kw">let </span><span class="kw-2">mut </span>map = HashMap::new();
map.insert(<span class="string">&quot;foo&quot;</span>.to_owned(), <span class="number">0</span>);
map.insert(<span class="string">&quot;bar&quot;</span>.to_owned(), <span class="number">10</span>);
map.insert(<span class="string">&quot;baz&quot;</span>.to_owned(), <span class="number">20</span>);
map.insert(<span class="string">&quot;qux&quot;</span>.to_owned(), <span class="number">30</span>);
<span class="kw">let </span>xs = map.get_many_mut([<span class="string">&quot;foo&quot;</span>, <span class="string">&quot;qux&quot;</span>]);
<span class="macro">assert_eq!</span>(xs, <span class="prelude-val">Some</span>([<span class="kw-2">&amp;mut </span><span class="number">0</span>, <span class="kw-2">&amp;mut </span><span class="number">30</span>]));
<span class="kw">let </span>xs = map.get_many_mut([<span class="string">&quot;foo&quot;</span>, <span class="string">&quot;dud&quot;</span>]);
<span class="macro">assert_eq!</span>(xs, <span class="prelude-val">None</span>);
<span class="kw">let </span>xs = map.get_many_mut([<span class="string">&quot;foo&quot;</span>, <span class="string">&quot;foo&quot;</span>]);
<span class="macro">assert_eq!</span>(xs, <span class="prelude-val">None</span>);
<span class="kw">let </span>ys = map.get_many_key_value_mut([<span class="string">&quot;bar&quot;</span>, <span class="string">&quot;baz&quot;</span>]);
<span class="macro">assert_eq!</span>(
ys,
<span class="prelude-val">Some</span>([(<span class="kw-2">&amp;</span><span class="string">&quot;bar&quot;</span>.to_owned(), <span class="kw-2">&amp;mut </span><span class="number">10</span>), (<span class="kw-2">&amp;</span><span class="string">&quot;baz&quot;</span>.to_owned(), <span class="kw-2">&amp;mut </span><span class="number">20</span>),]),
);
<span class="kw">let </span>ys = map.get_many_key_value_mut([<span class="string">&quot;bar&quot;</span>, <span class="string">&quot;dip&quot;</span>]);
<span class="macro">assert_eq!</span>(ys, <span class="prelude-val">None</span>);
<span class="kw">let </span>ys = map.get_many_key_value_mut([<span class="string">&quot;baz&quot;</span>, <span class="string">&quot;baz&quot;</span>]);
<span class="macro">assert_eq!</span>(ys, <span class="prelude-val">None</span>);
}
<span class="attribute">#[test]
#[should_panic = <span class="string">&quot;panic in drop&quot;</span>]
</span><span class="kw">fn </span>test_clone_from_double_drop() {
<span class="attribute">#[derive(Clone)]
</span><span class="kw">struct </span>CheckedDrop {
panic_in_drop: bool,
dropped: bool,
}
<span class="kw">impl </span>Drop <span class="kw">for </span>CheckedDrop {
<span class="kw">fn </span>drop(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
<span class="kw">if </span><span class="self">self</span>.panic_in_drop {
<span class="self">self</span>.dropped = <span class="bool-val">true</span>;
<span class="macro">panic!</span>(<span class="string">&quot;panic in drop&quot;</span>);
}
<span class="kw">if </span><span class="self">self</span>.dropped {
<span class="macro">panic!</span>(<span class="string">&quot;double drop&quot;</span>);
}
<span class="self">self</span>.dropped = <span class="bool-val">true</span>;
}
}
<span class="kw">const </span>DISARMED: CheckedDrop = CheckedDrop {
panic_in_drop: <span class="bool-val">false</span>,
dropped: <span class="bool-val">false</span>,
};
<span class="kw">const </span>ARMED: CheckedDrop = CheckedDrop {
panic_in_drop: <span class="bool-val">true</span>,
dropped: <span class="bool-val">false</span>,
};
<span class="kw">let </span><span class="kw-2">mut </span>map1 = HashMap::new();
map1.insert(<span class="number">1</span>, DISARMED);
map1.insert(<span class="number">2</span>, DISARMED);
map1.insert(<span class="number">3</span>, DISARMED);
map1.insert(<span class="number">4</span>, DISARMED);
<span class="kw">let </span><span class="kw-2">mut </span>map2 = HashMap::new();
map2.insert(<span class="number">1</span>, DISARMED);
map2.insert(<span class="number">2</span>, ARMED);
map2.insert(<span class="number">3</span>, DISARMED);
map2.insert(<span class="number">4</span>, DISARMED);
map2.clone_from(<span class="kw-2">&amp;</span>map1);
}
}
</code></pre></div>
</section></div></main><div id="rustdoc-vars" data-root-path="../../" data-current-crate="hashbrown" data-themes="ayu,dark,light" data-resource-suffix="" data-rustdoc-version="1.66.0-nightly (5c8bff74b 2022-10-21)" ></div></body></html>