| <!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/set.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>set.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> |
| </pre><pre class="rust"><code><span class="kw">use </span><span class="kw">crate</span>::TryReserveError; |
| <span class="kw">use </span>alloc::borrow::ToOwned; |
| <span class="kw">use </span>core::borrow::Borrow; |
| <span class="kw">use </span>core::fmt; |
| <span class="kw">use </span>core::hash::{BuildHasher, Hash}; |
| <span class="kw">use </span>core::iter::{Chain, FromIterator, FusedIterator}; |
| <span class="kw">use </span>core::mem; |
| <span class="kw">use </span>core::ops::{BitAnd, BitOr, BitXor, Sub}; |
| |
| <span class="kw">use </span><span class="kw">super</span>::map::{<span class="self">self</span>, ConsumeAllOnDrop, DefaultHashBuilder, DrainFilterInner, HashMap, Keys}; |
| <span class="kw">use </span><span class="kw">crate</span>::raw::{Allocator, Global}; |
| |
| <span class="comment">// Future Optimization (FIXME!) |
| // ============================= |
| // |
| // Iteration over zero sized values is a noop. There is no need |
| // for `bucket.val` in the case of HashSet. I suppose we would need HKT |
| // to get rid of it properly. |
| |
| </span><span class="doccomment">/// A hash set implemented as a `HashMap` where the value is `()`. |
| /// |
| /// As with the [`HashMap`] type, a `HashSet` requires that the elements |
| /// implement the [`Eq`] and [`Hash`] traits. 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 -> hash(k1) == hash(k2) |
| /// ``` |
| /// |
| /// In other words, if two keys are equal, their hashes must be equal. |
| /// |
| /// |
| /// It is a logic error for an item to be modified in such a way that the |
| /// item's hash, as determined by the [`Hash`] trait, or its equality, as |
| /// determined by the [`Eq`] trait, changes while it is in the set. 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 `HashSet` may become corrupted and |
| /// some items may be dropped from the table. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// // Type inference lets us omit an explicit type signature (which |
| /// // would be `HashSet<String>` in this example). |
| /// let mut books = HashSet::new(); |
| /// |
| /// // Add some books. |
| /// books.insert("A Dance With Dragons".to_string()); |
| /// books.insert("To Kill a Mockingbird".to_string()); |
| /// books.insert("The Odyssey".to_string()); |
| /// books.insert("The Great Gatsby".to_string()); |
| /// |
| /// // Check for a specific one. |
| /// if !books.contains("The Winds of Winter") { |
| /// println!("We have {} books, but The Winds of Winter ain't one.", |
| /// books.len()); |
| /// } |
| /// |
| /// // Remove a book. |
| /// books.remove("The Odyssey"); |
| /// |
| /// // Iterate over everything. |
| /// for book in &books { |
| /// println!("{}", book); |
| /// } |
| /// ``` |
| /// |
| /// The easiest way to use `HashSet` with a custom type is to derive |
| /// [`Eq`] and [`Hash`]. We must also derive [`PartialEq`]. This will in the |
| /// future be implied by [`Eq`]. |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// #[derive(Hash, Eq, PartialEq, Debug)] |
| /// struct Viking { |
| /// name: String, |
| /// power: usize, |
| /// } |
| /// |
| /// let mut vikings = HashSet::new(); |
| /// |
| /// vikings.insert(Viking { name: "Einar".to_string(), power: 9 }); |
| /// vikings.insert(Viking { name: "Einar".to_string(), power: 9 }); |
| /// vikings.insert(Viking { name: "Olaf".to_string(), power: 4 }); |
| /// vikings.insert(Viking { name: "Harald".to_string(), power: 8 }); |
| /// |
| /// // Use derived implementation to print the vikings. |
| /// for x in &vikings { |
| /// println!("{:?}", x); |
| /// } |
| /// ``` |
| /// |
| /// A `HashSet` with fixed list of elements can be initialized from an array: |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// |
| /// let viking_names: HashSet<&'static str> = |
| /// [ "Einar", "Olaf", "Harald" ].iter().cloned().collect(); |
| /// // use the values stored in the set |
| /// ``` |
| /// |
| /// [`Cell`]: https://doc.rust-lang.org/std/cell/struct.Cell.html |
| /// [`Eq`]: https://doc.rust-lang.org/std/cmp/trait.Eq.html |
| /// [`Hash`]: https://doc.rust-lang.org/std/hash/trait.Hash.html |
| /// [`HashMap`]: struct.HashMap.html |
| /// [`PartialEq`]: https://doc.rust-lang.org/std/cmp/trait.PartialEq.html |
| /// [`RefCell`]: https://doc.rust-lang.org/std/cell/struct.RefCell.html |
| </span><span class="kw">pub struct </span>HashSet<T, S = DefaultHashBuilder, A: Allocator + Clone = Global> { |
| <span class="kw">pub</span>(<span class="kw">crate</span>) map: HashMap<T, (), S, A>, |
| } |
| |
| <span class="kw">impl</span><T: Clone, S: Clone, A: Allocator + Clone> Clone <span class="kw">for </span>HashSet<T, S, A> { |
| <span class="kw">fn </span>clone(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="self">Self </span>{ |
| HashSet { |
| map: <span class="self">self</span>.map.clone(), |
| } |
| } |
| |
| <span class="kw">fn </span>clone_from(<span class="kw-2">&mut </span><span class="self">self</span>, source: <span class="kw-2">&</span><span class="self">Self</span>) { |
| <span class="self">self</span>.map.clone_from(<span class="kw-2">&</span>source.map); |
| } |
| } |
| |
| <span class="attribute">#[cfg(feature = <span class="string">"ahash"</span>)] |
| </span><span class="kw">impl</span><T> HashSet<T, DefaultHashBuilder> { |
| <span class="doccomment">/// Creates an empty `HashSet`. |
| /// |
| /// The hash set is initially created with a capacity of 0, so it will not allocate until it |
| /// is first inserted into. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// let set: HashSet<i32> = HashSet::new(); |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>new() -> <span class="self">Self </span>{ |
| <span class="self">Self </span>{ |
| map: HashMap::new(), |
| } |
| } |
| |
| <span class="doccomment">/// Creates an empty `HashSet` with the specified capacity. |
| /// |
| /// The hash set will be able to hold at least `capacity` elements without |
| /// reallocating. If `capacity` is 0, the hash set will not allocate. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// let set: HashSet<i32> = HashSet::with_capacity(10); |
| /// assert!(set.capacity() >= 10); |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>with_capacity(capacity: usize) -> <span class="self">Self </span>{ |
| <span class="self">Self </span>{ |
| map: HashMap::with_capacity(capacity), |
| } |
| } |
| } |
| |
| <span class="attribute">#[cfg(feature = <span class="string">"ahash"</span>)] |
| </span><span class="kw">impl</span><T: Hash + Eq, A: Allocator + Clone> HashSet<T, DefaultHashBuilder, A> { |
| <span class="doccomment">/// Creates an empty `HashSet`. |
| /// |
| /// The hash set is initially created with a capacity of 0, so it will not allocate until it |
| /// is first inserted into. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// let set: HashSet<i32> = HashSet::new(); |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>new_in(alloc: A) -> <span class="self">Self </span>{ |
| <span class="self">Self </span>{ |
| map: HashMap::new_in(alloc), |
| } |
| } |
| |
| <span class="doccomment">/// Creates an empty `HashSet` with the specified capacity. |
| /// |
| /// The hash set will be able to hold at least `capacity` elements without |
| /// reallocating. If `capacity` is 0, the hash set will not allocate. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// let set: HashSet<i32> = HashSet::with_capacity(10); |
| /// assert!(set.capacity() >= 10); |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>with_capacity_in(capacity: usize, alloc: A) -> <span class="self">Self </span>{ |
| <span class="self">Self </span>{ |
| map: HashMap::with_capacity_in(capacity, alloc), |
| } |
| } |
| } |
| |
| <span class="kw">impl</span><T, S, A: Allocator + Clone> HashSet<T, S, A> { |
| <span class="doccomment">/// Returns the number of elements the set can hold without reallocating. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// let set: HashSet<i32> = HashSet::with_capacity(100); |
| /// assert!(set.capacity() >= 100); |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>capacity(<span class="kw-2">&</span><span class="self">self</span>) -> usize { |
| <span class="self">self</span>.map.capacity() |
| } |
| |
| <span class="doccomment">/// An iterator visiting all elements in arbitrary order. |
| /// The iterator element type is `&'a T`. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// let mut set = HashSet::new(); |
| /// set.insert("a"); |
| /// set.insert("b"); |
| /// |
| /// // Will print in an arbitrary order. |
| /// for x in set.iter() { |
| /// println!("{}", x); |
| /// } |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>iter(<span class="kw-2">&</span><span class="self">self</span>) -> Iter<<span class="lifetime">'_</span>, T> { |
| Iter { |
| iter: <span class="self">self</span>.map.keys(), |
| } |
| } |
| |
| <span class="doccomment">/// Returns the number of elements in the set. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// |
| /// let mut v = HashSet::new(); |
| /// assert_eq!(v.len(), 0); |
| /// v.insert(1); |
| /// assert_eq!(v.len(), 1); |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>len(<span class="kw-2">&</span><span class="self">self</span>) -> usize { |
| <span class="self">self</span>.map.len() |
| } |
| |
| <span class="doccomment">/// Returns `true` if the set contains no elements. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// |
| /// let mut v = HashSet::new(); |
| /// assert!(v.is_empty()); |
| /// v.insert(1); |
| /// assert!(!v.is_empty()); |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>is_empty(<span class="kw-2">&</span><span class="self">self</span>) -> bool { |
| <span class="self">self</span>.map.is_empty() |
| } |
| |
| <span class="doccomment">/// Clears the set, returning all elements in an iterator. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// |
| /// let mut set: HashSet<_> = [1, 2, 3].iter().cloned().collect(); |
| /// assert!(!set.is_empty()); |
| /// |
| /// // print 1, 2, 3 in an arbitrary order |
| /// for i in set.drain() { |
| /// println!("{}", i); |
| /// } |
| /// |
| /// assert!(set.is_empty()); |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>drain(<span class="kw-2">&mut </span><span class="self">self</span>) -> Drain<<span class="lifetime">'_</span>, T, A> { |
| Drain { |
| iter: <span class="self">self</span>.map.drain(), |
| } |
| } |
| |
| <span class="doccomment">/// Retains only the elements specified by the predicate. |
| /// |
| /// In other words, remove all elements `e` such that `f(&e)` returns `false`. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// |
| /// let xs = [1,2,3,4,5,6]; |
| /// let mut set: HashSet<i32> = xs.iter().cloned().collect(); |
| /// set.retain(|&k| k % 2 == 0); |
| /// assert_eq!(set.len(), 3); |
| /// ``` |
| </span><span class="kw">pub fn </span>retain<F>(<span class="kw-2">&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">&</span>T) -> bool, |
| { |
| <span class="self">self</span>.map.retain(|k, <span class="kw">_</span>| f(k)); |
| } |
| |
| <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 elements `e` such that `f(&e)` returns `true` out |
| /// into another iterator. |
| /// |
| /// When the returned DrainedFilter is dropped, any remaining elements that satisfy |
| /// the predicate are dropped from the set. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// |
| /// let mut set: HashSet<i32> = (0..8).collect(); |
| /// let drained: HashSet<i32> = set.drain_filter(|v| v % 2 == 0).collect(); |
| /// |
| /// let mut evens = drained.into_iter().collect::<Vec<_>>(); |
| /// let mut odds = set.into_iter().collect::<Vec<_>>(); |
| /// evens.sort(); |
| /// odds.sort(); |
| /// |
| /// assert_eq!(evens, vec![0, 2, 4, 6]); |
| /// assert_eq!(odds, vec![1, 3, 5, 7]); |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>drain_filter<F>(<span class="kw-2">&mut </span><span class="self">self</span>, f: F) -> DrainFilter<<span class="lifetime">'_</span>, T, F, A> |
| <span class="kw">where |
| </span>F: FnMut(<span class="kw-2">&</span>T) -> bool, |
| { |
| DrainFilter { |
| f, |
| inner: DrainFilterInner { |
| iter: <span class="kw">unsafe </span>{ <span class="self">self</span>.map.table.iter() }, |
| table: <span class="kw-2">&mut </span><span class="self">self</span>.map.table, |
| }, |
| } |
| } |
| |
| <span class="doccomment">/// Clears the set, removing all values. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// |
| /// let mut v = HashSet::new(); |
| /// v.insert(1); |
| /// v.clear(); |
| /// assert!(v.is_empty()); |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>clear(<span class="kw-2">&mut </span><span class="self">self</span>) { |
| <span class="self">self</span>.map.clear(); |
| } |
| } |
| |
| <span class="kw">impl</span><T, S> HashSet<T, S, Global> { |
| <span class="doccomment">/// Creates a new empty hash set which will use the given hasher to hash |
| /// keys. |
| /// |
| /// The hash set is also created with the default initial capacity. |
| /// |
| /// Warning: `hasher` is normally randomly generated, and |
| /// is designed to allow `HashSet`s 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::HashSet; |
| /// use hashbrown::hash_map::DefaultHashBuilder; |
| /// |
| /// let s = DefaultHashBuilder::default(); |
| /// let mut set = HashSet::with_hasher(s); |
| /// set.insert(2); |
| /// ``` |
| /// |
| /// [`BuildHasher`]: ../../std/hash/trait.BuildHasher.html |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub const fn </span>with_hasher(hasher: S) -> <span class="self">Self </span>{ |
| <span class="self">Self </span>{ |
| map: HashMap::with_hasher(hasher), |
| } |
| } |
| |
| <span class="doccomment">/// Creates an empty `HashSet` with the specified capacity, using |
| /// `hasher` to hash the keys. |
| /// |
| /// The hash set will be able to hold at least `capacity` elements without |
| /// reallocating. If `capacity` is 0, the hash set will not allocate. |
| /// |
| /// Warning: `hasher` is normally randomly generated, and |
| /// is designed to allow `HashSet`s 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::HashSet; |
| /// use hashbrown::hash_map::DefaultHashBuilder; |
| /// |
| /// let s = DefaultHashBuilder::default(); |
| /// let mut set = HashSet::with_capacity_and_hasher(10, s); |
| /// set.insert(1); |
| /// ``` |
| /// |
| /// [`BuildHasher`]: ../../std/hash/trait.BuildHasher.html |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>with_capacity_and_hasher(capacity: usize, hasher: S) -> <span class="self">Self </span>{ |
| <span class="self">Self </span>{ |
| map: HashMap::with_capacity_and_hasher(capacity, hasher), |
| } |
| } |
| } |
| |
| <span class="kw">impl</span><T, S, A> HashSet<T, S, A> |
| <span class="kw">where |
| </span>A: Allocator + Clone, |
| { |
| <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">&</span><span class="self">self</span>) -> <span class="kw-2">&</span>A { |
| <span class="self">self</span>.map.allocator() |
| } |
| |
| <span class="doccomment">/// Creates a new empty hash set which will use the given hasher to hash |
| /// keys. |
| /// |
| /// The hash set is also created with the default initial capacity. |
| /// |
| /// Warning: `hasher` is normally randomly generated, and |
| /// is designed to allow `HashSet`s 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::HashSet; |
| /// use hashbrown::hash_map::DefaultHashBuilder; |
| /// |
| /// let s = DefaultHashBuilder::default(); |
| /// let mut set = HashSet::with_hasher(s); |
| /// set.insert(2); |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>with_hasher_in(hasher: S, alloc: A) -> <span class="self">Self </span>{ |
| <span class="self">Self </span>{ |
| map: HashMap::with_hasher_in(hasher, alloc), |
| } |
| } |
| |
| <span class="doccomment">/// Creates an empty `HashSet` with the specified capacity, using |
| /// `hasher` to hash the keys. |
| /// |
| /// The hash set will be able to hold at least `capacity` elements without |
| /// reallocating. If `capacity` is 0, the hash set will not allocate. |
| /// |
| /// Warning: `hasher` is normally randomly generated, and |
| /// is designed to allow `HashSet`s 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::HashSet; |
| /// use hashbrown::hash_map::DefaultHashBuilder; |
| /// |
| /// let s = DefaultHashBuilder::default(); |
| /// let mut set = HashSet::with_capacity_and_hasher(10, s); |
| /// set.insert(1); |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>with_capacity_and_hasher_in(capacity: usize, hasher: S, alloc: A) -> <span class="self">Self </span>{ |
| <span class="self">Self </span>{ |
| map: HashMap::with_capacity_and_hasher_in(capacity, hasher, alloc), |
| } |
| } |
| |
| <span class="doccomment">/// Returns a reference to the set's [`BuildHasher`]. |
| /// |
| /// [`BuildHasher`]: https://doc.rust-lang.org/std/hash/trait.BuildHasher.html |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// use hashbrown::hash_map::DefaultHashBuilder; |
| /// |
| /// let hasher = DefaultHashBuilder::default(); |
| /// let set: HashSet<i32> = HashSet::with_hasher(hasher); |
| /// let hasher: &DefaultHashBuilder = set.hasher(); |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>hasher(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="kw-2">&</span>S { |
| <span class="self">self</span>.map.hasher() |
| } |
| } |
| |
| <span class="kw">impl</span><T, S, A> HashSet<T, S, A> |
| <span class="kw">where |
| </span>T: Eq + Hash, |
| S: BuildHasher, |
| A: Allocator + Clone, |
| { |
| <span class="doccomment">/// Reserves capacity for at least `additional` more elements to be inserted |
| /// in the `HashSet`. The collection may reserve more space to avoid |
| /// frequent reallocations. |
| /// |
| /// # Panics |
| /// |
| /// Panics if the new allocation size overflows `usize`. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// let mut set: HashSet<i32> = HashSet::new(); |
| /// set.reserve(10); |
| /// assert!(set.capacity() >= 10); |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>reserve(<span class="kw-2">&mut </span><span class="self">self</span>, additional: usize) { |
| <span class="self">self</span>.map.reserve(additional); |
| } |
| |
| <span class="doccomment">/// Tries to reserve capacity for at least `additional` more elements to be inserted |
| /// in the given `HashSet<K,V>`. 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::HashSet; |
| /// let mut set: HashSet<i32> = HashSet::new(); |
| /// set.try_reserve(10).expect("why is the test harness OOMing on 10 bytes?"); |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>try_reserve(<span class="kw-2">&mut </span><span class="self">self</span>, additional: usize) -> <span class="prelude-ty">Result</span><(), TryReserveError> { |
| <span class="self">self</span>.map.try_reserve(additional) |
| } |
| |
| <span class="doccomment">/// Shrinks the capacity of the set 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::HashSet; |
| /// |
| /// let mut set = HashSet::with_capacity(100); |
| /// set.insert(1); |
| /// set.insert(2); |
| /// assert!(set.capacity() >= 100); |
| /// set.shrink_to_fit(); |
| /// assert!(set.capacity() >= 2); |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>shrink_to_fit(<span class="kw-2">&mut </span><span class="self">self</span>) { |
| <span class="self">self</span>.map.shrink_to_fit(); |
| } |
| |
| <span class="doccomment">/// Shrinks the capacity of the set 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. |
| /// |
| /// Panics if the current capacity is smaller than the supplied |
| /// minimum capacity. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// |
| /// let mut set = HashSet::with_capacity(100); |
| /// set.insert(1); |
| /// set.insert(2); |
| /// assert!(set.capacity() >= 100); |
| /// set.shrink_to(10); |
| /// assert!(set.capacity() >= 10); |
| /// set.shrink_to(0); |
| /// assert!(set.capacity() >= 2); |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>shrink_to(<span class="kw-2">&mut </span><span class="self">self</span>, min_capacity: usize) { |
| <span class="self">self</span>.map.shrink_to(min_capacity); |
| } |
| |
| <span class="doccomment">/// Visits the values representing the difference, |
| /// i.e., the values that are in `self` but not in `other`. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// let a: HashSet<_> = [1, 2, 3].iter().cloned().collect(); |
| /// let b: HashSet<_> = [4, 2, 3, 4].iter().cloned().collect(); |
| /// |
| /// // Can be seen as `a - b`. |
| /// for x in a.difference(&b) { |
| /// println!("{}", x); // Print 1 |
| /// } |
| /// |
| /// let diff: HashSet<_> = a.difference(&b).collect(); |
| /// assert_eq!(diff, [1].iter().collect()); |
| /// |
| /// // Note that difference is not symmetric, |
| /// // and `b - a` means something else: |
| /// let diff: HashSet<_> = b.difference(&a).collect(); |
| /// assert_eq!(diff, [4].iter().collect()); |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>difference<<span class="lifetime">'a</span>>(<span class="kw-2">&</span><span class="lifetime">'a </span><span class="self">self</span>, other: <span class="kw-2">&</span><span class="lifetime">'a </span><span class="self">Self</span>) -> Difference<<span class="lifetime">'a</span>, T, S, A> { |
| Difference { |
| iter: <span class="self">self</span>.iter(), |
| other, |
| } |
| } |
| |
| <span class="doccomment">/// Visits the values representing the symmetric difference, |
| /// i.e., the values that are in `self` or in `other` but not in both. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// let a: HashSet<_> = [1, 2, 3].iter().cloned().collect(); |
| /// let b: HashSet<_> = [4, 2, 3, 4].iter().cloned().collect(); |
| /// |
| /// // Print 1, 4 in arbitrary order. |
| /// for x in a.symmetric_difference(&b) { |
| /// println!("{}", x); |
| /// } |
| /// |
| /// let diff1: HashSet<_> = a.symmetric_difference(&b).collect(); |
| /// let diff2: HashSet<_> = b.symmetric_difference(&a).collect(); |
| /// |
| /// assert_eq!(diff1, diff2); |
| /// assert_eq!(diff1, [1, 4].iter().collect()); |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>symmetric_difference<<span class="lifetime">'a</span>>(<span class="kw-2">&</span><span class="lifetime">'a </span><span class="self">self</span>, other: <span class="kw-2">&</span><span class="lifetime">'a </span><span class="self">Self</span>) -> SymmetricDifference<<span class="lifetime">'a</span>, T, S, A> { |
| SymmetricDifference { |
| iter: <span class="self">self</span>.difference(other).chain(other.difference(<span class="self">self</span>)), |
| } |
| } |
| |
| <span class="doccomment">/// Visits the values representing the intersection, |
| /// i.e., the values that are both in `self` and `other`. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// let a: HashSet<_> = [1, 2, 3].iter().cloned().collect(); |
| /// let b: HashSet<_> = [4, 2, 3, 4].iter().cloned().collect(); |
| /// |
| /// // Print 2, 3 in arbitrary order. |
| /// for x in a.intersection(&b) { |
| /// println!("{}", x); |
| /// } |
| /// |
| /// let intersection: HashSet<_> = a.intersection(&b).collect(); |
| /// assert_eq!(intersection, [2, 3].iter().collect()); |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>intersection<<span class="lifetime">'a</span>>(<span class="kw-2">&</span><span class="lifetime">'a </span><span class="self">self</span>, other: <span class="kw-2">&</span><span class="lifetime">'a </span><span class="self">Self</span>) -> Intersection<<span class="lifetime">'a</span>, T, S, A> { |
| <span class="kw">let </span>(smaller, larger) = <span class="kw">if </span><span class="self">self</span>.len() <= other.len() { |
| (<span class="self">self</span>, other) |
| } <span class="kw">else </span>{ |
| (other, <span class="self">self</span>) |
| }; |
| Intersection { |
| iter: smaller.iter(), |
| other: larger, |
| } |
| } |
| |
| <span class="doccomment">/// Visits the values representing the union, |
| /// i.e., all the values in `self` or `other`, without duplicates. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// let a: HashSet<_> = [1, 2, 3].iter().cloned().collect(); |
| /// let b: HashSet<_> = [4, 2, 3, 4].iter().cloned().collect(); |
| /// |
| /// // Print 1, 2, 3, 4 in arbitrary order. |
| /// for x in a.union(&b) { |
| /// println!("{}", x); |
| /// } |
| /// |
| /// let union: HashSet<_> = a.union(&b).collect(); |
| /// assert_eq!(union, [1, 2, 3, 4].iter().collect()); |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>union<<span class="lifetime">'a</span>>(<span class="kw-2">&</span><span class="lifetime">'a </span><span class="self">self</span>, other: <span class="kw-2">&</span><span class="lifetime">'a </span><span class="self">Self</span>) -> Union<<span class="lifetime">'a</span>, T, S, A> { |
| <span class="comment">// We'll iterate one set in full, and only the remaining difference from the other. |
| // Use the smaller set for the difference in order to reduce hash lookups. |
| </span><span class="kw">let </span>(smaller, larger) = <span class="kw">if </span><span class="self">self</span>.len() <= other.len() { |
| (<span class="self">self</span>, other) |
| } <span class="kw">else </span>{ |
| (other, <span class="self">self</span>) |
| }; |
| Union { |
| iter: larger.iter().chain(smaller.difference(larger)), |
| } |
| } |
| |
| <span class="doccomment">/// Returns `true` if the set contains a value. |
| /// |
| /// The value may be any borrowed form of the set's value type, but |
| /// [`Hash`] and [`Eq`] on the borrowed form *must* match those for |
| /// the value type. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// |
| /// let set: HashSet<_> = [1, 2, 3].iter().cloned().collect(); |
| /// assert_eq!(set.contains(&1), true); |
| /// assert_eq!(set.contains(&4), false); |
| /// ``` |
| /// |
| /// [`Eq`]: https://doc.rust-lang.org/std/cmp/trait.Eq.html |
| /// [`Hash`]: https://doc.rust-lang.org/std/hash/trait.Hash.html |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>contains<Q: <span class="question-mark">?</span>Sized>(<span class="kw-2">&</span><span class="self">self</span>, value: <span class="kw-2">&</span>Q) -> bool |
| <span class="kw">where |
| </span>T: Borrow<Q>, |
| Q: Hash + Eq, |
| { |
| <span class="self">self</span>.map.contains_key(value) |
| } |
| |
| <span class="doccomment">/// Returns a reference to the value in the set, if any, that is equal to the given value. |
| /// |
| /// The value may be any borrowed form of the set's value type, but |
| /// [`Hash`] and [`Eq`] on the borrowed form *must* match those for |
| /// the value type. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// |
| /// let set: HashSet<_> = [1, 2, 3].iter().cloned().collect(); |
| /// assert_eq!(set.get(&2), Some(&2)); |
| /// assert_eq!(set.get(&4), None); |
| /// ``` |
| /// |
| /// [`Eq`]: https://doc.rust-lang.org/std/cmp/trait.Eq.html |
| /// [`Hash`]: https://doc.rust-lang.org/std/hash/trait.Hash.html |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>get<Q: <span class="question-mark">?</span>Sized>(<span class="kw-2">&</span><span class="self">self</span>, value: <span class="kw-2">&</span>Q) -> <span class="prelude-ty">Option</span><<span class="kw-2">&</span>T> |
| <span class="kw">where |
| </span>T: Borrow<Q>, |
| 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>.map.get_key_value(value) { |
| <span class="prelude-val">Some</span>((k, <span class="kw">_</span>)) => <span class="prelude-val">Some</span>(k), |
| <span class="prelude-val">None </span>=> <span class="prelude-val">None</span>, |
| } |
| } |
| |
| <span class="doccomment">/// Inserts the given `value` into the set if it is not present, then |
| /// returns a reference to the value in the set. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// |
| /// let mut set: HashSet<_> = [1, 2, 3].iter().cloned().collect(); |
| /// assert_eq!(set.len(), 3); |
| /// assert_eq!(set.get_or_insert(2), &2); |
| /// assert_eq!(set.get_or_insert(100), &100); |
| /// assert_eq!(set.len(), 4); // 100 was inserted |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>get_or_insert(<span class="kw-2">&mut </span><span class="self">self</span>, value: T) -> <span class="kw-2">&</span>T { |
| <span class="comment">// Although the raw entry gives us `&mut T`, we only return `&T` to be consistent with |
| // `get`. Key mutation is "raw" because you're not supposed to affect `Eq` or `Hash`. |
| </span><span class="self">self</span>.map |
| .raw_entry_mut() |
| .from_key(<span class="kw-2">&</span>value) |
| .or_insert(value, ()) |
| .<span class="number">0 |
| </span>} |
| |
| <span class="doccomment">/// Inserts an owned copy of the given `value` into the set if it is not |
| /// present, then returns a reference to the value in the set. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// |
| /// let mut set: HashSet<String> = ["cat", "dog", "horse"] |
| /// .iter().map(|&pet| pet.to_owned()).collect(); |
| /// |
| /// assert_eq!(set.len(), 3); |
| /// for &pet in &["cat", "dog", "fish"] { |
| /// let value = set.get_or_insert_owned(pet); |
| /// assert_eq!(value, pet); |
| /// } |
| /// assert_eq!(set.len(), 4); // a new "fish" was inserted |
| /// ``` |
| </span><span class="attribute">#[inline] |
| </span><span class="kw">pub fn </span>get_or_insert_owned<Q: <span class="question-mark">?</span>Sized>(<span class="kw-2">&mut </span><span class="self">self</span>, value: <span class="kw-2">&</span>Q) -> <span class="kw-2">&</span>T |
| <span class="kw">where |
| </span>T: Borrow<Q>, |
| Q: Hash + Eq + ToOwned<Owned = T>, |
| { |
| <span class="comment">// Although the raw entry gives us `&mut T`, we only return `&T` to be consistent with |
| // `get`. Key mutation is "raw" because you're not supposed to affect `Eq` or `Hash`. |
| </span><span class="self">self</span>.map |
| .raw_entry_mut() |
| .from_key(value) |
| .or_insert_with(|| (value.to_owned(), ())) |
| .<span class="number">0 |
| </span>} |
| |
| <span class="doccomment">/// Inserts a value computed from `f` into the set if the given `value` is |
| /// not present, then returns a reference to the value in the set. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// |
| /// let mut set: HashSet<String> = ["cat", "dog", "horse"] |
| /// .iter().map(|&pet| pet.to_owned()).collect(); |
| /// |
| /// assert_eq!(set.len(), 3); |
| /// for &pet in &["cat", "dog", "fish"] { |
| /// let value = set.get_or_insert_with(pet, str::to_owned); |
| /// assert_eq!(value, pet); |
| /// } |
| /// assert_eq!(set.len(), 4); // a new "fish" was inserted |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>get_or_insert_with<Q: <span class="question-mark">?</span>Sized, F>(<span class="kw-2">&mut </span><span class="self">self</span>, value: <span class="kw-2">&</span>Q, f: F) -> <span class="kw-2">&</span>T |
| <span class="kw">where |
| </span>T: Borrow<Q>, |
| Q: Hash + Eq, |
| F: FnOnce(<span class="kw-2">&</span>Q) -> T, |
| { |
| <span class="comment">// Although the raw entry gives us `&mut T`, we only return `&T` to be consistent with |
| // `get`. Key mutation is "raw" because you're not supposed to affect `Eq` or `Hash`. |
| </span><span class="self">self</span>.map |
| .raw_entry_mut() |
| .from_key(value) |
| .or_insert_with(|| (f(value), ())) |
| .<span class="number">0 |
| </span>} |
| |
| <span class="doccomment">/// Gets the given value's corresponding entry in the set for in-place manipulation. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// use hashbrown::hash_set::Entry::*; |
| /// |
| /// let mut singles = HashSet::new(); |
| /// let mut dupes = HashSet::new(); |
| /// |
| /// for ch in "a short treatise on fungi".chars() { |
| /// if let Vacant(dupe_entry) = dupes.entry(ch) { |
| /// // We haven't already seen a duplicate, so |
| /// // check if we've at least seen it once. |
| /// match singles.entry(ch) { |
| /// Vacant(single_entry) => { |
| /// // We found a new character for the first time. |
| /// single_entry.insert() |
| /// } |
| /// Occupied(single_entry) => { |
| /// // We've already seen this once, "move" it to dupes. |
| /// single_entry.remove(); |
| /// dupe_entry.insert(); |
| /// } |
| /// } |
| /// } |
| /// } |
| /// |
| /// assert!(!singles.contains(&'t') && dupes.contains(&'t')); |
| /// assert!(singles.contains(&'u') && !dupes.contains(&'u')); |
| /// assert!(!singles.contains(&'v') && !dupes.contains(&'v')); |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>entry(<span class="kw-2">&mut </span><span class="self">self</span>, value: T) -> Entry<<span class="lifetime">'_</span>, T, S, A> { |
| <span class="kw">match </span><span class="self">self</span>.map.entry(value) { |
| map::Entry::Occupied(entry) => Entry::Occupied(OccupiedEntry { inner: entry }), |
| map::Entry::Vacant(entry) => Entry::Vacant(VacantEntry { inner: entry }), |
| } |
| } |
| |
| <span class="doccomment">/// Returns `true` if `self` has no elements in common with `other`. |
| /// This is equivalent to checking for an empty intersection. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// |
| /// let a: HashSet<_> = [1, 2, 3].iter().cloned().collect(); |
| /// let mut b = HashSet::new(); |
| /// |
| /// assert_eq!(a.is_disjoint(&b), true); |
| /// b.insert(4); |
| /// assert_eq!(a.is_disjoint(&b), true); |
| /// b.insert(1); |
| /// assert_eq!(a.is_disjoint(&b), false); |
| /// ``` |
| </span><span class="kw">pub fn </span>is_disjoint(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span><span class="self">Self</span>) -> bool { |
| <span class="self">self</span>.iter().all(|v| !other.contains(v)) |
| } |
| |
| <span class="doccomment">/// Returns `true` if the set is a subset of another, |
| /// i.e., `other` contains at least all the values in `self`. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// |
| /// let sup: HashSet<_> = [1, 2, 3].iter().cloned().collect(); |
| /// let mut set = HashSet::new(); |
| /// |
| /// assert_eq!(set.is_subset(&sup), true); |
| /// set.insert(2); |
| /// assert_eq!(set.is_subset(&sup), true); |
| /// set.insert(4); |
| /// assert_eq!(set.is_subset(&sup), false); |
| /// ``` |
| </span><span class="kw">pub fn </span>is_subset(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span><span class="self">Self</span>) -> bool { |
| <span class="self">self</span>.len() <= other.len() && <span class="self">self</span>.iter().all(|v| other.contains(v)) |
| } |
| |
| <span class="doccomment">/// Returns `true` if the set is a superset of another, |
| /// i.e., `self` contains at least all the values in `other`. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// |
| /// let sub: HashSet<_> = [1, 2].iter().cloned().collect(); |
| /// let mut set = HashSet::new(); |
| /// |
| /// assert_eq!(set.is_superset(&sub), false); |
| /// |
| /// set.insert(0); |
| /// set.insert(1); |
| /// assert_eq!(set.is_superset(&sub), false); |
| /// |
| /// set.insert(2); |
| /// assert_eq!(set.is_superset(&sub), true); |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>is_superset(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span><span class="self">Self</span>) -> bool { |
| other.is_subset(<span class="self">self</span>) |
| } |
| |
| <span class="doccomment">/// Adds a value to the set. |
| /// |
| /// If the set did not have this value present, `true` is returned. |
| /// |
| /// If the set did have this value present, `false` is returned. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// |
| /// let mut set = HashSet::new(); |
| /// |
| /// assert_eq!(set.insert(2), true); |
| /// assert_eq!(set.insert(2), false); |
| /// assert_eq!(set.len(), 1); |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>insert(<span class="kw-2">&mut </span><span class="self">self</span>, value: T) -> bool { |
| <span class="self">self</span>.map.insert(value, ()).is_none() |
| } |
| |
| <span class="doccomment">/// Insert a value the set without checking if the value already exists in the set. |
| /// |
| /// Returns a reference to the value just inserted. |
| /// |
| /// This operation is safe if a value does not exist in the set. |
| /// |
| /// However, if a value exists in the set already, the behavior is unspecified: |
| /// this operation may panic, loop forever, or any following operation with the set |
| /// 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 set. |
| /// For example, when constructing a set from another set, we know |
| /// that values are unique. |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>insert_unique_unchecked(<span class="kw-2">&mut </span><span class="self">self</span>, value: T) -> <span class="kw-2">&</span>T { |
| <span class="self">self</span>.map.insert_unique_unchecked(value, ()).<span class="number">0 |
| </span>} |
| |
| <span class="doccomment">/// Adds a value to the set, replacing the existing value, if any, that is equal to the given |
| /// one. Returns the replaced value. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// |
| /// let mut set = HashSet::new(); |
| /// set.insert(Vec::<i32>::new()); |
| /// |
| /// assert_eq!(set.get(&[][..]).unwrap().capacity(), 0); |
| /// set.replace(Vec::with_capacity(10)); |
| /// assert_eq!(set.get(&[][..]).unwrap().capacity(), 10); |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>replace(<span class="kw-2">&mut </span><span class="self">self</span>, value: T) -> <span class="prelude-ty">Option</span><T> { |
| <span class="kw">match </span><span class="self">self</span>.map.entry(value) { |
| map::Entry::Occupied(occupied) => <span class="prelude-val">Some</span>(occupied.replace_key()), |
| map::Entry::Vacant(vacant) => { |
| vacant.insert(()); |
| <span class="prelude-val">None |
| </span>} |
| } |
| } |
| |
| <span class="doccomment">/// Removes a value from the set. Returns whether the value was |
| /// present in the set. |
| /// |
| /// The value may be any borrowed form of the set's value type, but |
| /// [`Hash`] and [`Eq`] on the borrowed form *must* match those for |
| /// the value type. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// |
| /// let mut set = HashSet::new(); |
| /// |
| /// set.insert(2); |
| /// assert_eq!(set.remove(&2), true); |
| /// assert_eq!(set.remove(&2), false); |
| /// ``` |
| /// |
| /// [`Eq`]: https://doc.rust-lang.org/std/cmp/trait.Eq.html |
| /// [`Hash`]: https://doc.rust-lang.org/std/hash/trait.Hash.html |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>remove<Q: <span class="question-mark">?</span>Sized>(<span class="kw-2">&mut </span><span class="self">self</span>, value: <span class="kw-2">&</span>Q) -> bool |
| <span class="kw">where |
| </span>T: Borrow<Q>, |
| Q: Hash + Eq, |
| { |
| <span class="self">self</span>.map.remove(value).is_some() |
| } |
| |
| <span class="doccomment">/// Removes and returns the value in the set, if any, that is equal to the given one. |
| /// |
| /// The value may be any borrowed form of the set's value type, but |
| /// [`Hash`] and [`Eq`] on the borrowed form *must* match those for |
| /// the value type. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// |
| /// let mut set: HashSet<_> = [1, 2, 3].iter().cloned().collect(); |
| /// assert_eq!(set.take(&2), Some(2)); |
| /// assert_eq!(set.take(&2), None); |
| /// ``` |
| /// |
| /// [`Eq`]: https://doc.rust-lang.org/std/cmp/trait.Eq.html |
| /// [`Hash`]: https://doc.rust-lang.org/std/hash/trait.Hash.html |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>take<Q: <span class="question-mark">?</span>Sized>(<span class="kw-2">&mut </span><span class="self">self</span>, value: <span class="kw-2">&</span>Q) -> <span class="prelude-ty">Option</span><T> |
| <span class="kw">where |
| </span>T: Borrow<Q>, |
| 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>.map.remove_entry(value) { |
| <span class="prelude-val">Some</span>((k, <span class="kw">_</span>)) => <span class="prelude-val">Some</span>(k), |
| <span class="prelude-val">None </span>=> <span class="prelude-val">None</span>, |
| } |
| } |
| } |
| |
| <span class="kw">impl</span><T, S, A> PartialEq <span class="kw">for </span>HashSet<T, S, A> |
| <span class="kw">where |
| </span>T: Eq + Hash, |
| S: BuildHasher, |
| A: Allocator + Clone, |
| { |
| <span class="kw">fn </span>eq(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span><span class="self">Self</span>) -> 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| other.contains(key)) |
| } |
| } |
| |
| <span class="kw">impl</span><T, S, A> Eq <span class="kw">for </span>HashSet<T, S, A> |
| <span class="kw">where |
| </span>T: Eq + Hash, |
| S: BuildHasher, |
| A: Allocator + Clone, |
| { |
| } |
| |
| <span class="kw">impl</span><T, S, A> fmt::Debug <span class="kw">for </span>HashSet<T, S, A> |
| <span class="kw">where |
| </span>T: fmt::Debug, |
| A: Allocator + Clone, |
| { |
| <span class="kw">fn </span>fmt(<span class="kw-2">&</span><span class="self">self</span>, f: <span class="kw-2">&mut </span>fmt::Formatter<<span class="lifetime">'_</span>>) -> fmt::Result { |
| f.debug_set().entries(<span class="self">self</span>.iter()).finish() |
| } |
| } |
| |
| <span class="kw">impl</span><T, S, A> From<HashMap<T, (), S, A>> <span class="kw">for </span>HashSet<T, S, A> |
| <span class="kw">where |
| </span>A: Allocator + Clone, |
| { |
| <span class="kw">fn </span>from(map: HashMap<T, (), S, A>) -> <span class="self">Self </span>{ |
| <span class="self">Self </span>{ map } |
| } |
| } |
| |
| <span class="kw">impl</span><T, S, A> FromIterator<T> <span class="kw">for </span>HashSet<T, S, A> |
| <span class="kw">where |
| </span>T: Eq + Hash, |
| S: BuildHasher + Default, |
| A: Default + Allocator + Clone, |
| { |
| <span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">fn </span>from_iter<I: IntoIterator<Item = T>>(iter: I) -> <span class="self">Self </span>{ |
| <span class="kw">let </span><span class="kw-2">mut </span>set = <span class="self">Self</span>::with_hasher_in(Default::default(), Default::default()); |
| set.extend(iter); |
| set |
| } |
| } |
| |
| <span class="comment">// The default hasher is used to match the std implementation signature |
| </span><span class="attribute">#[cfg(feature = <span class="string">"ahash"</span>)] |
| </span><span class="kw">impl</span><T, A, <span class="kw">const </span>N: usize> From<[T; N]> <span class="kw">for </span>HashSet<T, DefaultHashBuilder, A> |
| <span class="kw">where |
| </span>T: Eq + Hash, |
| A: Default + Allocator + Clone, |
| { |
| <span class="doccomment">/// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// |
| /// let set1 = HashSet::from([1, 2, 3, 4]); |
| /// let set2: HashSet<_> = [1, 2, 3, 4].into(); |
| /// assert_eq!(set1, set2); |
| /// ``` |
| </span><span class="kw">fn </span>from(arr: [T; N]) -> <span class="self">Self </span>{ |
| arr.into_iter().collect() |
| } |
| } |
| |
| <span class="kw">impl</span><T, S, A> Extend<T> <span class="kw">for </span>HashSet<T, S, A> |
| <span class="kw">where |
| </span>T: Eq + Hash, |
| S: BuildHasher, |
| A: Allocator + Clone, |
| { |
| <span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">fn </span>extend<I: IntoIterator<Item = T>>(<span class="kw-2">&mut </span><span class="self">self</span>, iter: I) { |
| <span class="self">self</span>.map.extend(iter.into_iter().map(|k| (k, ()))); |
| } |
| |
| <span class="attribute">#[inline] |
| #[cfg(feature = <span class="string">"nightly"</span>)] |
| </span><span class="kw">fn </span>extend_one(<span class="kw-2">&mut </span><span class="self">self</span>, k: T) { |
| <span class="self">self</span>.map.insert(k, ()); |
| } |
| |
| <span class="attribute">#[inline] |
| #[cfg(feature = <span class="string">"nightly"</span>)] |
| </span><span class="kw">fn </span>extend_reserve(<span class="kw-2">&mut </span><span class="self">self</span>, additional: usize) { |
| Extend::<(T, ())>::extend_reserve(<span class="kw-2">&mut </span><span class="self">self</span>.map, additional); |
| } |
| } |
| |
| <span class="kw">impl</span><<span class="lifetime">'a</span>, T, S, A> Extend<<span class="kw-2">&</span><span class="lifetime">'a </span>T> <span class="kw">for </span>HashSet<T, S, A> |
| <span class="kw">where |
| </span>T: <span class="lifetime">'a </span>+ Eq + Hash + Copy, |
| S: BuildHasher, |
| A: Allocator + Clone, |
| { |
| <span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">fn </span>extend<I: IntoIterator<Item = <span class="kw-2">&</span><span class="lifetime">'a </span>T>>(<span class="kw-2">&mut </span><span class="self">self</span>, iter: I) { |
| <span class="self">self</span>.extend(iter.into_iter().copied()); |
| } |
| |
| <span class="attribute">#[inline] |
| #[cfg(feature = <span class="string">"nightly"</span>)] |
| </span><span class="kw">fn </span>extend_one(<span class="kw-2">&mut </span><span class="self">self</span>, k: <span class="kw-2">&</span><span class="lifetime">'a </span>T) { |
| <span class="self">self</span>.map.insert(<span class="kw-2">*</span>k, ()); |
| } |
| |
| <span class="attribute">#[inline] |
| #[cfg(feature = <span class="string">"nightly"</span>)] |
| </span><span class="kw">fn </span>extend_reserve(<span class="kw-2">&mut </span><span class="self">self</span>, additional: usize) { |
| Extend::<(T, ())>::extend_reserve(<span class="kw-2">&mut </span><span class="self">self</span>.map, additional); |
| } |
| } |
| |
| <span class="kw">impl</span><T, S, A> Default <span class="kw">for </span>HashSet<T, S, A> |
| <span class="kw">where |
| </span>S: Default, |
| A: Default + Allocator + Clone, |
| { |
| <span class="doccomment">/// Creates an empty `HashSet<T, S>` with the `Default` value for the hasher. |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">fn </span>default() -> <span class="self">Self </span>{ |
| <span class="self">Self </span>{ |
| map: HashMap::default(), |
| } |
| } |
| } |
| |
| <span class="kw">impl</span><T, S, A> BitOr<<span class="kw-2">&</span>HashSet<T, S, A>> <span class="kw">for </span><span class="kw-2">&</span>HashSet<T, S, A> |
| <span class="kw">where |
| </span>T: Eq + Hash + Clone, |
| S: BuildHasher + Default, |
| A: Allocator + Clone, |
| { |
| <span class="kw">type </span>Output = HashSet<T, S>; |
| |
| <span class="doccomment">/// Returns the union of `self` and `rhs` as a new `HashSet<T, S>`. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// |
| /// let a: HashSet<_> = vec![1, 2, 3].into_iter().collect(); |
| /// let b: HashSet<_> = vec![3, 4, 5].into_iter().collect(); |
| /// |
| /// let set = &a | &b; |
| /// |
| /// let mut i = 0; |
| /// let expected = [1, 2, 3, 4, 5]; |
| /// for x in &set { |
| /// assert!(expected.contains(x)); |
| /// i += 1; |
| /// } |
| /// assert_eq!(i, expected.len()); |
| /// ``` |
| </span><span class="kw">fn </span>bitor(<span class="self">self</span>, rhs: <span class="kw-2">&</span>HashSet<T, S, A>) -> HashSet<T, S> { |
| <span class="self">self</span>.union(rhs).cloned().collect() |
| } |
| } |
| |
| <span class="kw">impl</span><T, S, A> BitAnd<<span class="kw-2">&</span>HashSet<T, S, A>> <span class="kw">for </span><span class="kw-2">&</span>HashSet<T, S, A> |
| <span class="kw">where |
| </span>T: Eq + Hash + Clone, |
| S: BuildHasher + Default, |
| A: Allocator + Clone, |
| { |
| <span class="kw">type </span>Output = HashSet<T, S>; |
| |
| <span class="doccomment">/// Returns the intersection of `self` and `rhs` as a new `HashSet<T, S>`. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// |
| /// let a: HashSet<_> = vec![1, 2, 3].into_iter().collect(); |
| /// let b: HashSet<_> = vec![2, 3, 4].into_iter().collect(); |
| /// |
| /// let set = &a & &b; |
| /// |
| /// let mut i = 0; |
| /// let expected = [2, 3]; |
| /// for x in &set { |
| /// assert!(expected.contains(x)); |
| /// i += 1; |
| /// } |
| /// assert_eq!(i, expected.len()); |
| /// ``` |
| </span><span class="kw">fn </span>bitand(<span class="self">self</span>, rhs: <span class="kw-2">&</span>HashSet<T, S, A>) -> HashSet<T, S> { |
| <span class="self">self</span>.intersection(rhs).cloned().collect() |
| } |
| } |
| |
| <span class="kw">impl</span><T, S> BitXor<<span class="kw-2">&</span>HashSet<T, S>> <span class="kw">for </span><span class="kw-2">&</span>HashSet<T, S> |
| <span class="kw">where |
| </span>T: Eq + Hash + Clone, |
| S: BuildHasher + Default, |
| { |
| <span class="kw">type </span>Output = HashSet<T, S>; |
| |
| <span class="doccomment">/// Returns the symmetric difference of `self` and `rhs` as a new `HashSet<T, S>`. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// |
| /// let a: HashSet<_> = vec![1, 2, 3].into_iter().collect(); |
| /// let b: HashSet<_> = vec![3, 4, 5].into_iter().collect(); |
| /// |
| /// let set = &a ^ &b; |
| /// |
| /// let mut i = 0; |
| /// let expected = [1, 2, 4, 5]; |
| /// for x in &set { |
| /// assert!(expected.contains(x)); |
| /// i += 1; |
| /// } |
| /// assert_eq!(i, expected.len()); |
| /// ``` |
| </span><span class="kw">fn </span>bitxor(<span class="self">self</span>, rhs: <span class="kw-2">&</span>HashSet<T, S>) -> HashSet<T, S> { |
| <span class="self">self</span>.symmetric_difference(rhs).cloned().collect() |
| } |
| } |
| |
| <span class="kw">impl</span><T, S> Sub<<span class="kw-2">&</span>HashSet<T, S>> <span class="kw">for </span><span class="kw-2">&</span>HashSet<T, S> |
| <span class="kw">where |
| </span>T: Eq + Hash + Clone, |
| S: BuildHasher + Default, |
| { |
| <span class="kw">type </span>Output = HashSet<T, S>; |
| |
| <span class="doccomment">/// Returns the difference of `self` and `rhs` as a new `HashSet<T, S>`. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// |
| /// let a: HashSet<_> = vec![1, 2, 3].into_iter().collect(); |
| /// let b: HashSet<_> = vec![3, 4, 5].into_iter().collect(); |
| /// |
| /// let set = &a - &b; |
| /// |
| /// let mut i = 0; |
| /// let expected = [1, 2]; |
| /// for x in &set { |
| /// assert!(expected.contains(x)); |
| /// i += 1; |
| /// } |
| /// assert_eq!(i, expected.len()); |
| /// ``` |
| </span><span class="kw">fn </span>sub(<span class="self">self</span>, rhs: <span class="kw-2">&</span>HashSet<T, S>) -> HashSet<T, S> { |
| <span class="self">self</span>.difference(rhs).cloned().collect() |
| } |
| } |
| |
| <span class="doccomment">/// An iterator over the items of a `HashSet`. |
| /// |
| /// This `struct` is created by the [`iter`] method on [`HashSet`]. |
| /// See its documentation for more. |
| /// |
| /// [`HashSet`]: struct.HashSet.html |
| /// [`iter`]: struct.HashSet.html#method.iter |
| </span><span class="kw">pub struct </span>Iter<<span class="lifetime">'a</span>, K> { |
| iter: Keys<<span class="lifetime">'a</span>, K, ()>, |
| } |
| |
| <span class="doccomment">/// An owning iterator over the items of a `HashSet`. |
| /// |
| /// This `struct` is created by the [`into_iter`] method on [`HashSet`] |
| /// (provided by the `IntoIterator` trait). See its documentation for more. |
| /// |
| /// [`HashSet`]: struct.HashSet.html |
| /// [`into_iter`]: struct.HashSet.html#method.into_iter |
| </span><span class="kw">pub struct </span>IntoIter<K, A: Allocator + Clone = Global> { |
| iter: map::IntoIter<K, (), A>, |
| } |
| |
| <span class="doccomment">/// A draining iterator over the items of a `HashSet`. |
| /// |
| /// This `struct` is created by the [`drain`] method on [`HashSet`]. |
| /// See its documentation for more. |
| /// |
| /// [`HashSet`]: struct.HashSet.html |
| /// [`drain`]: struct.HashSet.html#method.drain |
| </span><span class="kw">pub struct </span>Drain<<span class="lifetime">'a</span>, K, A: Allocator + Clone = Global> { |
| iter: map::Drain<<span class="lifetime">'a</span>, K, (), A>, |
| } |
| |
| <span class="doccomment">/// A draining iterator over entries of a `HashSet` which don't satisfy the predicate `f`. |
| /// |
| /// This `struct` is created by the [`drain_filter`] method on [`HashSet`]. See its |
| /// documentation for more. |
| /// |
| /// [`drain_filter`]: struct.HashSet.html#method.drain_filter |
| /// [`HashSet`]: struct.HashSet.html |
| </span><span class="kw">pub struct </span>DrainFilter<<span class="lifetime">'a</span>, K, F, A: Allocator + Clone = Global> |
| <span class="kw">where |
| </span>F: FnMut(<span class="kw-2">&</span>K) -> bool, |
| { |
| f: F, |
| inner: DrainFilterInner<<span class="lifetime">'a</span>, K, (), A>, |
| } |
| |
| <span class="doccomment">/// A lazy iterator producing elements in the intersection of `HashSet`s. |
| /// |
| /// This `struct` is created by the [`intersection`] method on [`HashSet`]. |
| /// See its documentation for more. |
| /// |
| /// [`HashSet`]: struct.HashSet.html |
| /// [`intersection`]: struct.HashSet.html#method.intersection |
| </span><span class="kw">pub struct </span>Intersection<<span class="lifetime">'a</span>, T, S, A: Allocator + Clone = Global> { |
| <span class="comment">// iterator of the first set |
| </span>iter: Iter<<span class="lifetime">'a</span>, T>, |
| <span class="comment">// the second set |
| </span>other: <span class="kw-2">&</span><span class="lifetime">'a </span>HashSet<T, S, A>, |
| } |
| |
| <span class="doccomment">/// A lazy iterator producing elements in the difference of `HashSet`s. |
| /// |
| /// This `struct` is created by the [`difference`] method on [`HashSet`]. |
| /// See its documentation for more. |
| /// |
| /// [`HashSet`]: struct.HashSet.html |
| /// [`difference`]: struct.HashSet.html#method.difference |
| </span><span class="kw">pub struct </span>Difference<<span class="lifetime">'a</span>, T, S, A: Allocator + Clone = Global> { |
| <span class="comment">// iterator of the first set |
| </span>iter: Iter<<span class="lifetime">'a</span>, T>, |
| <span class="comment">// the second set |
| </span>other: <span class="kw-2">&</span><span class="lifetime">'a </span>HashSet<T, S, A>, |
| } |
| |
| <span class="doccomment">/// A lazy iterator producing elements in the symmetric difference of `HashSet`s. |
| /// |
| /// This `struct` is created by the [`symmetric_difference`] method on |
| /// [`HashSet`]. See its documentation for more. |
| /// |
| /// [`HashSet`]: struct.HashSet.html |
| /// [`symmetric_difference`]: struct.HashSet.html#method.symmetric_difference |
| </span><span class="kw">pub struct </span>SymmetricDifference<<span class="lifetime">'a</span>, T, S, A: Allocator + Clone = Global> { |
| iter: Chain<Difference<<span class="lifetime">'a</span>, T, S, A>, Difference<<span class="lifetime">'a</span>, T, S, A>>, |
| } |
| |
| <span class="doccomment">/// A lazy iterator producing elements in the union of `HashSet`s. |
| /// |
| /// This `struct` is created by the [`union`] method on [`HashSet`]. |
| /// See its documentation for more. |
| /// |
| /// [`HashSet`]: struct.HashSet.html |
| /// [`union`]: struct.HashSet.html#method.union |
| </span><span class="kw">pub struct </span>Union<<span class="lifetime">'a</span>, T, S, A: Allocator + Clone = Global> { |
| iter: Chain<Iter<<span class="lifetime">'a</span>, T>, Difference<<span class="lifetime">'a</span>, T, S, A>>, |
| } |
| |
| <span class="kw">impl</span><<span class="lifetime">'a</span>, T, S, A: Allocator + Clone> IntoIterator <span class="kw">for </span><span class="kw-2">&</span><span class="lifetime">'a </span>HashSet<T, S, A> { |
| <span class="kw">type </span>Item = <span class="kw-2">&</span><span class="lifetime">'a </span>T; |
| <span class="kw">type </span>IntoIter = Iter<<span class="lifetime">'a</span>, T>; |
| |
| <span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">fn </span>into_iter(<span class="self">self</span>) -> Iter<<span class="lifetime">'a</span>, T> { |
| <span class="self">self</span>.iter() |
| } |
| } |
| |
| <span class="kw">impl</span><T, S, A: Allocator + Clone> IntoIterator <span class="kw">for </span>HashSet<T, S, A> { |
| <span class="kw">type </span>Item = T; |
| <span class="kw">type </span>IntoIter = IntoIter<T, A>; |
| |
| <span class="doccomment">/// Creates a consuming iterator, that is, one that moves each value out |
| /// of the set in arbitrary order. The set cannot be used after calling |
| /// this. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// let mut set = HashSet::new(); |
| /// set.insert("a".to_string()); |
| /// set.insert("b".to_string()); |
| /// |
| /// // Not possible to collect to a Vec<String> with a regular `.iter()`. |
| /// let v: Vec<String> = set.into_iter().collect(); |
| /// |
| /// // Will print in an arbitrary order. |
| /// for x in &v { |
| /// println!("{}", x); |
| /// } |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">fn </span>into_iter(<span class="self">self</span>) -> IntoIter<T, A> { |
| IntoIter { |
| iter: <span class="self">self</span>.map.into_iter(), |
| } |
| } |
| } |
| |
| <span class="kw">impl</span><K> Clone <span class="kw">for </span>Iter<<span class="lifetime">'_</span>, K> { |
| <span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">fn </span>clone(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="self">Self </span>{ |
| Iter { |
| iter: <span class="self">self</span>.iter.clone(), |
| } |
| } |
| } |
| <span class="kw">impl</span><<span class="lifetime">'a</span>, K> Iterator <span class="kw">for </span>Iter<<span class="lifetime">'a</span>, K> { |
| <span class="kw">type </span>Item = <span class="kw-2">&</span><span class="lifetime">'a </span>K; |
| |
| <span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">fn </span>next(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="prelude-ty">Option</span><<span class="kw-2">&</span><span class="lifetime">'a </span>K> { |
| <span class="self">self</span>.iter.next() |
| } |
| <span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">fn </span>size_hint(<span class="kw-2">&</span><span class="self">self</span>) -> (usize, <span class="prelude-ty">Option</span><usize>) { |
| <span class="self">self</span>.iter.size_hint() |
| } |
| } |
| <span class="kw">impl</span><<span class="lifetime">'a</span>, K> ExactSizeIterator <span class="kw">for </span>Iter<<span class="lifetime">'a</span>, K> { |
| <span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">fn </span>len(<span class="kw-2">&</span><span class="self">self</span>) -> usize { |
| <span class="self">self</span>.iter.len() |
| } |
| } |
| <span class="kw">impl</span><K> FusedIterator <span class="kw">for </span>Iter<<span class="lifetime">'_</span>, K> {} |
| |
| <span class="kw">impl</span><K: fmt::Debug> fmt::Debug <span class="kw">for </span>Iter<<span class="lifetime">'_</span>, K> { |
| <span class="kw">fn </span>fmt(<span class="kw-2">&</span><span class="self">self</span>, f: <span class="kw-2">&mut </span>fmt::Formatter<<span class="lifetime">'_</span>>) -> fmt::Result { |
| f.debug_list().entries(<span class="self">self</span>.clone()).finish() |
| } |
| } |
| |
| <span class="kw">impl</span><K, A: Allocator + Clone> Iterator <span class="kw">for </span>IntoIter<K, A> { |
| <span class="kw">type </span>Item = K; |
| |
| <span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">fn </span>next(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="prelude-ty">Option</span><K> { |
| <span class="comment">// Avoid `Option::map` because it bloats LLVM IR. |
| </span><span class="kw">match </span><span class="self">self</span>.iter.next() { |
| <span class="prelude-val">Some</span>((k, <span class="kw">_</span>)) => <span class="prelude-val">Some</span>(k), |
| <span class="prelude-val">None </span>=> <span class="prelude-val">None</span>, |
| } |
| } |
| <span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">fn </span>size_hint(<span class="kw-2">&</span><span class="self">self</span>) -> (usize, <span class="prelude-ty">Option</span><usize>) { |
| <span class="self">self</span>.iter.size_hint() |
| } |
| } |
| <span class="kw">impl</span><K, A: Allocator + Clone> ExactSizeIterator <span class="kw">for </span>IntoIter<K, A> { |
| <span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">fn </span>len(<span class="kw-2">&</span><span class="self">self</span>) -> usize { |
| <span class="self">self</span>.iter.len() |
| } |
| } |
| <span class="kw">impl</span><K, A: Allocator + Clone> FusedIterator <span class="kw">for </span>IntoIter<K, A> {} |
| |
| <span class="kw">impl</span><K: fmt::Debug, A: Allocator + Clone> fmt::Debug <span class="kw">for </span>IntoIter<K, A> { |
| <span class="kw">fn </span>fmt(<span class="kw-2">&</span><span class="self">self</span>, f: <span class="kw-2">&mut </span>fmt::Formatter<<span class="lifetime">'_</span>>) -> fmt::Result { |
| <span class="kw">let </span>entries_iter = <span class="self">self</span>.iter.iter().map(|(k, <span class="kw">_</span>)| k); |
| f.debug_list().entries(entries_iter).finish() |
| } |
| } |
| |
| <span class="kw">impl</span><K, A: Allocator + Clone> Iterator <span class="kw">for </span>Drain<<span class="lifetime">'_</span>, K, A> { |
| <span class="kw">type </span>Item = K; |
| |
| <span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">fn </span>next(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="prelude-ty">Option</span><K> { |
| <span class="comment">// Avoid `Option::map` because it bloats LLVM IR. |
| </span><span class="kw">match </span><span class="self">self</span>.iter.next() { |
| <span class="prelude-val">Some</span>((k, <span class="kw">_</span>)) => <span class="prelude-val">Some</span>(k), |
| <span class="prelude-val">None </span>=> <span class="prelude-val">None</span>, |
| } |
| } |
| <span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">fn </span>size_hint(<span class="kw-2">&</span><span class="self">self</span>) -> (usize, <span class="prelude-ty">Option</span><usize>) { |
| <span class="self">self</span>.iter.size_hint() |
| } |
| } |
| <span class="kw">impl</span><K, A: Allocator + Clone> ExactSizeIterator <span class="kw">for </span>Drain<<span class="lifetime">'_</span>, K, A> { |
| <span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">fn </span>len(<span class="kw-2">&</span><span class="self">self</span>) -> usize { |
| <span class="self">self</span>.iter.len() |
| } |
| } |
| <span class="kw">impl</span><K, A: Allocator + Clone> FusedIterator <span class="kw">for </span>Drain<<span class="lifetime">'_</span>, K, A> {} |
| |
| <span class="kw">impl</span><K: fmt::Debug, A: Allocator + Clone> fmt::Debug <span class="kw">for </span>Drain<<span class="lifetime">'_</span>, K, A> { |
| <span class="kw">fn </span>fmt(<span class="kw-2">&</span><span class="self">self</span>, f: <span class="kw-2">&mut </span>fmt::Formatter<<span class="lifetime">'_</span>>) -> fmt::Result { |
| <span class="kw">let </span>entries_iter = <span class="self">self</span>.iter.iter().map(|(k, <span class="kw">_</span>)| k); |
| f.debug_list().entries(entries_iter).finish() |
| } |
| } |
| |
| <span class="kw">impl</span><<span class="lifetime">'a</span>, K, F, A: Allocator + Clone> Drop <span class="kw">for </span>DrainFilter<<span class="lifetime">'a</span>, K, F, A> |
| <span class="kw">where |
| </span>F: FnMut(<span class="kw-2">&</span>K) -> bool, |
| { |
| <span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">fn </span>drop(<span class="kw-2">&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">impl</span><K, F, A: Allocator + Clone> Iterator <span class="kw">for </span>DrainFilter<<span class="lifetime">'_</span>, K, F, A> |
| <span class="kw">where |
| </span>F: FnMut(<span class="kw-2">&</span>K) -> bool, |
| { |
| <span class="kw">type </span>Item = K; |
| |
| <span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">fn </span>next(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="prelude-ty">Option</span><<span class="self">Self</span>::Item> { |
| <span class="kw">let </span>f = <span class="kw-2">&mut </span><span class="self">self</span>.f; |
| <span class="kw">let </span>(k, <span class="kw">_</span>) = <span class="self">self</span>.inner.next(<span class="kw-2">&mut </span>|k, <span class="kw">_</span>| f(k))<span class="question-mark">?</span>; |
| <span class="prelude-val">Some</span>(k) |
| } |
| |
| <span class="attribute">#[inline] |
| </span><span class="kw">fn </span>size_hint(<span class="kw-2">&</span><span class="self">self</span>) -> (usize, <span class="prelude-ty">Option</span><usize>) { |
| (<span class="number">0</span>, <span class="self">self</span>.inner.iter.size_hint().<span class="number">1</span>) |
| } |
| } |
| |
| <span class="kw">impl</span><K, F, A: Allocator + Clone> FusedIterator <span class="kw">for </span>DrainFilter<<span class="lifetime">'_</span>, K, F, A> <span class="kw">where |
| </span>F: FnMut(<span class="kw-2">&</span>K) -> bool |
| { |
| } |
| |
| <span class="kw">impl</span><T, S, A: Allocator + Clone> Clone <span class="kw">for </span>Intersection<<span class="lifetime">'_</span>, T, S, A> { |
| <span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">fn </span>clone(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="self">Self </span>{ |
| Intersection { |
| iter: <span class="self">self</span>.iter.clone(), |
| ..<span class="kw-2">*</span><span class="self">self |
| </span>} |
| } |
| } |
| |
| <span class="kw">impl</span><<span class="lifetime">'a</span>, T, S, A> Iterator <span class="kw">for </span>Intersection<<span class="lifetime">'a</span>, T, S, A> |
| <span class="kw">where |
| </span>T: Eq + Hash, |
| S: BuildHasher, |
| A: Allocator + Clone, |
| { |
| <span class="kw">type </span>Item = <span class="kw-2">&</span><span class="lifetime">'a </span>T; |
| |
| <span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">fn </span>next(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="prelude-ty">Option</span><<span class="kw-2">&</span><span class="lifetime">'a </span>T> { |
| <span class="kw">loop </span>{ |
| <span class="kw">let </span>elt = <span class="self">self</span>.iter.next()<span class="question-mark">?</span>; |
| <span class="kw">if </span><span class="self">self</span>.other.contains(elt) { |
| <span class="kw">return </span><span class="prelude-val">Some</span>(elt); |
| } |
| } |
| } |
| |
| <span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">fn </span>size_hint(<span class="kw-2">&</span><span class="self">self</span>) -> (usize, <span class="prelude-ty">Option</span><usize>) { |
| <span class="kw">let </span>(<span class="kw">_</span>, upper) = <span class="self">self</span>.iter.size_hint(); |
| (<span class="number">0</span>, upper) |
| } |
| } |
| |
| <span class="kw">impl</span><T, S, A> fmt::Debug <span class="kw">for </span>Intersection<<span class="lifetime">'_</span>, T, S, A> |
| <span class="kw">where |
| </span>T: fmt::Debug + Eq + Hash, |
| S: BuildHasher, |
| A: Allocator + Clone, |
| { |
| <span class="kw">fn </span>fmt(<span class="kw-2">&</span><span class="self">self</span>, f: <span class="kw-2">&mut </span>fmt::Formatter<<span class="lifetime">'_</span>>) -> fmt::Result { |
| f.debug_list().entries(<span class="self">self</span>.clone()).finish() |
| } |
| } |
| |
| <span class="kw">impl</span><T, S, A> FusedIterator <span class="kw">for </span>Intersection<<span class="lifetime">'_</span>, T, S, A> |
| <span class="kw">where |
| </span>T: Eq + Hash, |
| S: BuildHasher, |
| A: Allocator + Clone, |
| { |
| } |
| |
| <span class="kw">impl</span><T, S, A: Allocator + Clone> Clone <span class="kw">for </span>Difference<<span class="lifetime">'_</span>, T, S, A> { |
| <span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">fn </span>clone(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="self">Self </span>{ |
| Difference { |
| iter: <span class="self">self</span>.iter.clone(), |
| ..<span class="kw-2">*</span><span class="self">self |
| </span>} |
| } |
| } |
| |
| <span class="kw">impl</span><<span class="lifetime">'a</span>, T, S, A> Iterator <span class="kw">for </span>Difference<<span class="lifetime">'a</span>, T, S, A> |
| <span class="kw">where |
| </span>T: Eq + Hash, |
| S: BuildHasher, |
| A: Allocator + Clone, |
| { |
| <span class="kw">type </span>Item = <span class="kw-2">&</span><span class="lifetime">'a </span>T; |
| |
| <span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">fn </span>next(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="prelude-ty">Option</span><<span class="kw-2">&</span><span class="lifetime">'a </span>T> { |
| <span class="kw">loop </span>{ |
| <span class="kw">let </span>elt = <span class="self">self</span>.iter.next()<span class="question-mark">?</span>; |
| <span class="kw">if </span>!<span class="self">self</span>.other.contains(elt) { |
| <span class="kw">return </span><span class="prelude-val">Some</span>(elt); |
| } |
| } |
| } |
| |
| <span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">fn </span>size_hint(<span class="kw-2">&</span><span class="self">self</span>) -> (usize, <span class="prelude-ty">Option</span><usize>) { |
| <span class="kw">let </span>(<span class="kw">_</span>, upper) = <span class="self">self</span>.iter.size_hint(); |
| (<span class="number">0</span>, upper) |
| } |
| } |
| |
| <span class="kw">impl</span><T, S, A> FusedIterator <span class="kw">for </span>Difference<<span class="lifetime">'_</span>, T, S, A> |
| <span class="kw">where |
| </span>T: Eq + Hash, |
| S: BuildHasher, |
| A: Allocator + Clone, |
| { |
| } |
| |
| <span class="kw">impl</span><T, S, A> fmt::Debug <span class="kw">for </span>Difference<<span class="lifetime">'_</span>, T, S, A> |
| <span class="kw">where |
| </span>T: fmt::Debug + Eq + Hash, |
| S: BuildHasher, |
| A: Allocator + Clone, |
| { |
| <span class="kw">fn </span>fmt(<span class="kw-2">&</span><span class="self">self</span>, f: <span class="kw-2">&mut </span>fmt::Formatter<<span class="lifetime">'_</span>>) -> fmt::Result { |
| f.debug_list().entries(<span class="self">self</span>.clone()).finish() |
| } |
| } |
| |
| <span class="kw">impl</span><T, S, A: Allocator + Clone> Clone <span class="kw">for </span>SymmetricDifference<<span class="lifetime">'_</span>, T, S, A> { |
| <span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">fn </span>clone(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="self">Self </span>{ |
| SymmetricDifference { |
| iter: <span class="self">self</span>.iter.clone(), |
| } |
| } |
| } |
| |
| <span class="kw">impl</span><<span class="lifetime">'a</span>, T, S, A> Iterator <span class="kw">for </span>SymmetricDifference<<span class="lifetime">'a</span>, T, S, A> |
| <span class="kw">where |
| </span>T: Eq + Hash, |
| S: BuildHasher, |
| A: Allocator + Clone, |
| { |
| <span class="kw">type </span>Item = <span class="kw-2">&</span><span class="lifetime">'a </span>T; |
| |
| <span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">fn </span>next(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="prelude-ty">Option</span><<span class="kw-2">&</span><span class="lifetime">'a </span>T> { |
| <span class="self">self</span>.iter.next() |
| } |
| <span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">fn </span>size_hint(<span class="kw-2">&</span><span class="self">self</span>) -> (usize, <span class="prelude-ty">Option</span><usize>) { |
| <span class="self">self</span>.iter.size_hint() |
| } |
| } |
| |
| <span class="kw">impl</span><T, S, A> FusedIterator <span class="kw">for </span>SymmetricDifference<<span class="lifetime">'_</span>, T, S, A> |
| <span class="kw">where |
| </span>T: Eq + Hash, |
| S: BuildHasher, |
| A: Allocator + Clone, |
| { |
| } |
| |
| <span class="kw">impl</span><T, S, A> fmt::Debug <span class="kw">for </span>SymmetricDifference<<span class="lifetime">'_</span>, T, S, A> |
| <span class="kw">where |
| </span>T: fmt::Debug + Eq + Hash, |
| S: BuildHasher, |
| A: Allocator + Clone, |
| { |
| <span class="kw">fn </span>fmt(<span class="kw-2">&</span><span class="self">self</span>, f: <span class="kw-2">&mut </span>fmt::Formatter<<span class="lifetime">'_</span>>) -> fmt::Result { |
| f.debug_list().entries(<span class="self">self</span>.clone()).finish() |
| } |
| } |
| |
| <span class="kw">impl</span><T, S, A: Allocator + Clone> Clone <span class="kw">for </span>Union<<span class="lifetime">'_</span>, T, S, A> { |
| <span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">fn </span>clone(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="self">Self </span>{ |
| Union { |
| iter: <span class="self">self</span>.iter.clone(), |
| } |
| } |
| } |
| |
| <span class="kw">impl</span><T, S, A> FusedIterator <span class="kw">for </span>Union<<span class="lifetime">'_</span>, T, S, A> |
| <span class="kw">where |
| </span>T: Eq + Hash, |
| S: BuildHasher, |
| A: Allocator + Clone, |
| { |
| } |
| |
| <span class="kw">impl</span><T, S, A> fmt::Debug <span class="kw">for </span>Union<<span class="lifetime">'_</span>, T, S, A> |
| <span class="kw">where |
| </span>T: fmt::Debug + Eq + Hash, |
| S: BuildHasher, |
| A: Allocator + Clone, |
| { |
| <span class="kw">fn </span>fmt(<span class="kw-2">&</span><span class="self">self</span>, f: <span class="kw-2">&mut </span>fmt::Formatter<<span class="lifetime">'_</span>>) -> fmt::Result { |
| f.debug_list().entries(<span class="self">self</span>.clone()).finish() |
| } |
| } |
| |
| <span class="kw">impl</span><<span class="lifetime">'a</span>, T, S, A> Iterator <span class="kw">for </span>Union<<span class="lifetime">'a</span>, T, S, A> |
| <span class="kw">where |
| </span>T: Eq + Hash, |
| S: BuildHasher, |
| A: Allocator + Clone, |
| { |
| <span class="kw">type </span>Item = <span class="kw-2">&</span><span class="lifetime">'a </span>T; |
| |
| <span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">fn </span>next(<span class="kw-2">&mut </span><span class="self">self</span>) -> <span class="prelude-ty">Option</span><<span class="kw-2">&</span><span class="lifetime">'a </span>T> { |
| <span class="self">self</span>.iter.next() |
| } |
| <span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">fn </span>size_hint(<span class="kw-2">&</span><span class="self">self</span>) -> (usize, <span class="prelude-ty">Option</span><usize>) { |
| <span class="self">self</span>.iter.size_hint() |
| } |
| } |
| |
| <span class="doccomment">/// A view into a single entry in a set, which may either be vacant or occupied. |
| /// |
| /// This `enum` is constructed from the [`entry`] method on [`HashSet`]. |
| /// |
| /// [`HashSet`]: struct.HashSet.html |
| /// [`entry`]: struct.HashSet.html#method.entry |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::hash_set::{Entry, HashSet, OccupiedEntry}; |
| /// |
| /// let mut set = HashSet::new(); |
| /// set.extend(["a", "b", "c"]); |
| /// assert_eq!(set.len(), 3); |
| /// |
| /// // Existing value (insert) |
| /// let entry: Entry<_, _> = set.entry("a"); |
| /// let _raw_o: OccupiedEntry<_, _> = entry.insert(); |
| /// assert_eq!(set.len(), 3); |
| /// // Nonexistent value (insert) |
| /// set.entry("d").insert(); |
| /// |
| /// // Existing value (or_insert) |
| /// set.entry("b").or_insert(); |
| /// // Nonexistent value (or_insert) |
| /// set.entry("e").or_insert(); |
| /// |
| /// println!("Our HashSet: {:?}", set); |
| /// |
| /// let mut vec: Vec<_> = set.iter().copied().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, ["a", "b", "c", "d", "e"]); |
| /// ``` |
| </span><span class="kw">pub enum </span>Entry<<span class="lifetime">'a</span>, T, S, A = Global> |
| <span class="kw">where |
| </span>A: Allocator + Clone, |
| { |
| <span class="doccomment">/// An occupied entry. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::hash_set::{Entry, HashSet}; |
| /// let mut set: HashSet<_> = ["a", "b"].into(); |
| /// |
| /// match set.entry("a") { |
| /// Entry::Vacant(_) => unreachable!(), |
| /// Entry::Occupied(_) => { } |
| /// } |
| /// ``` |
| </span>Occupied(OccupiedEntry<<span class="lifetime">'a</span>, T, S, A>), |
| |
| <span class="doccomment">/// A vacant entry. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::hash_set::{Entry, HashSet}; |
| /// let mut set: HashSet<&str> = HashSet::new(); |
| /// |
| /// match set.entry("a") { |
| /// Entry::Occupied(_) => unreachable!(), |
| /// Entry::Vacant(_) => { } |
| /// } |
| /// ``` |
| </span>Vacant(VacantEntry<<span class="lifetime">'a</span>, T, S, A>), |
| } |
| |
| <span class="kw">impl</span><T: fmt::Debug, S, A: Allocator + Clone> fmt::Debug <span class="kw">for </span>Entry<<span class="lifetime">'_</span>, T, S, A> { |
| <span class="kw">fn </span>fmt(<span class="kw-2">&</span><span class="self">self</span>, f: <span class="kw-2">&mut </span>fmt::Formatter<<span class="lifetime">'_</span>>) -> 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) => f.debug_tuple(<span class="string">"Entry"</span>).field(v).finish(), |
| Entry::Occupied(<span class="kw-2">ref </span>o) => f.debug_tuple(<span class="string">"Entry"</span>).field(o).finish(), |
| } |
| } |
| } |
| |
| <span class="doccomment">/// A view into an occupied entry in a `HashSet`. |
| /// It is part of the [`Entry`] enum. |
| /// |
| /// [`Entry`]: enum.Entry.html |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::hash_set::{Entry, HashSet, OccupiedEntry}; |
| /// |
| /// let mut set = HashSet::new(); |
| /// set.extend(["a", "b", "c"]); |
| /// |
| /// let _entry_o: OccupiedEntry<_, _> = set.entry("a").insert(); |
| /// assert_eq!(set.len(), 3); |
| /// |
| /// // Existing key |
| /// match set.entry("a") { |
| /// Entry::Vacant(_) => unreachable!(), |
| /// Entry::Occupied(view) => { |
| /// assert_eq!(view.get(), &"a"); |
| /// } |
| /// } |
| /// |
| /// assert_eq!(set.len(), 3); |
| /// |
| /// // Existing key (take) |
| /// match set.entry("c") { |
| /// Entry::Vacant(_) => unreachable!(), |
| /// Entry::Occupied(view) => { |
| /// assert_eq!(view.remove(), "c"); |
| /// } |
| /// } |
| /// assert_eq!(set.get(&"c"), None); |
| /// assert_eq!(set.len(), 2); |
| /// ``` |
| </span><span class="kw">pub struct </span>OccupiedEntry<<span class="lifetime">'a</span>, T, S, A: Allocator + Clone = Global> { |
| inner: map::OccupiedEntry<<span class="lifetime">'a</span>, T, (), S, A>, |
| } |
| |
| <span class="kw">impl</span><T: fmt::Debug, S, A: Allocator + Clone> fmt::Debug <span class="kw">for </span>OccupiedEntry<<span class="lifetime">'_</span>, T, S, A> { |
| <span class="kw">fn </span>fmt(<span class="kw-2">&</span><span class="self">self</span>, f: <span class="kw-2">&mut </span>fmt::Formatter<<span class="lifetime">'_</span>>) -> fmt::Result { |
| f.debug_struct(<span class="string">"OccupiedEntry"</span>) |
| .field(<span class="string">"value"</span>, <span class="self">self</span>.get()) |
| .finish() |
| } |
| } |
| |
| <span class="doccomment">/// A view into a vacant entry in a `HashSet`. |
| /// It is part of the [`Entry`] enum. |
| /// |
| /// [`Entry`]: enum.Entry.html |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::hash_set::{Entry, HashSet, VacantEntry}; |
| /// |
| /// let mut set = HashSet::<&str>::new(); |
| /// |
| /// let entry_v: VacantEntry<_, _> = match set.entry("a") { |
| /// Entry::Vacant(view) => view, |
| /// Entry::Occupied(_) => unreachable!(), |
| /// }; |
| /// entry_v.insert(); |
| /// assert!(set.contains("a") && set.len() == 1); |
| /// |
| /// // Nonexistent key (insert) |
| /// match set.entry("b") { |
| /// Entry::Vacant(view) => view.insert(), |
| /// Entry::Occupied(_) => unreachable!(), |
| /// } |
| /// assert!(set.contains("b") && set.len() == 2); |
| /// ``` |
| </span><span class="kw">pub struct </span>VacantEntry<<span class="lifetime">'a</span>, T, S, A: Allocator + Clone = Global> { |
| inner: map::VacantEntry<<span class="lifetime">'a</span>, T, (), S, A>, |
| } |
| |
| <span class="kw">impl</span><T: fmt::Debug, S, A: Allocator + Clone> fmt::Debug <span class="kw">for </span>VacantEntry<<span class="lifetime">'_</span>, T, S, A> { |
| <span class="kw">fn </span>fmt(<span class="kw-2">&</span><span class="self">self</span>, f: <span class="kw-2">&mut </span>fmt::Formatter<<span class="lifetime">'_</span>>) -> fmt::Result { |
| f.debug_tuple(<span class="string">"VacantEntry"</span>).field(<span class="self">self</span>.get()).finish() |
| } |
| } |
| |
| <span class="kw">impl</span><<span class="lifetime">'a</span>, T, S, A: Allocator + Clone> Entry<<span class="lifetime">'a</span>, T, S, A> { |
| <span class="doccomment">/// Sets the value of the entry, and returns an OccupiedEntry. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// |
| /// let mut set: HashSet<&str> = HashSet::new(); |
| /// let entry = set.entry("horseyland").insert(); |
| /// |
| /// assert_eq!(entry.get(), &"horseyland"); |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>insert(<span class="self">self</span>) -> OccupiedEntry<<span class="lifetime">'a</span>, T, S, A> |
| <span class="kw">where |
| </span>T: Hash, |
| S: BuildHasher, |
| { |
| <span class="kw">match </span><span class="self">self </span>{ |
| Entry::Occupied(entry) => entry, |
| Entry::Vacant(entry) => entry.insert_entry(), |
| } |
| } |
| |
| <span class="doccomment">/// Ensures a value is in the entry by inserting if it was vacant. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// |
| /// let mut set: HashSet<&str> = HashSet::new(); |
| /// |
| /// // nonexistent key |
| /// set.entry("poneyland").or_insert(); |
| /// assert!(set.contains("poneyland")); |
| /// |
| /// // existing key |
| /// set.entry("poneyland").or_insert(); |
| /// assert!(set.contains("poneyland")); |
| /// assert_eq!(set.len(), 1); |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>or_insert(<span class="self">self</span>) |
| <span class="kw">where |
| </span>T: Hash, |
| S: BuildHasher, |
| { |
| <span class="kw">if let </span>Entry::Vacant(entry) = <span class="self">self </span>{ |
| entry.insert(); |
| } |
| } |
| |
| <span class="doccomment">/// Returns a reference to this entry's value. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// |
| /// let mut set: HashSet<&str> = HashSet::new(); |
| /// set.entry("poneyland").or_insert(); |
| /// // existing key |
| /// assert_eq!(set.entry("poneyland").get(), &"poneyland"); |
| /// // nonexistent key |
| /// assert_eq!(set.entry("horseland").get(), &"horseland"); |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>get(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="kw-2">&</span>T { |
| <span class="kw">match </span><span class="kw-2">*</span><span class="self">self </span>{ |
| Entry::Occupied(<span class="kw-2">ref </span>entry) => entry.get(), |
| Entry::Vacant(<span class="kw-2">ref </span>entry) => entry.get(), |
| } |
| } |
| } |
| |
| <span class="kw">impl</span><T, S, A: Allocator + Clone> OccupiedEntry<<span class="lifetime">'_</span>, T, S, A> { |
| <span class="doccomment">/// Gets a reference to the value in the entry. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::hash_set::{Entry, HashSet}; |
| /// |
| /// let mut set: HashSet<&str> = HashSet::new(); |
| /// set.entry("poneyland").or_insert(); |
| /// |
| /// match set.entry("poneyland") { |
| /// Entry::Vacant(_) => panic!(), |
| /// Entry::Occupied(entry) => assert_eq!(entry.get(), &"poneyland"), |
| /// } |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>get(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="kw-2">&</span>T { |
| <span class="self">self</span>.inner.key() |
| } |
| |
| <span class="doccomment">/// Takes the value out of the entry, and returns it. |
| /// Keeps the allocated memory for reuse. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// use hashbrown::hash_set::Entry; |
| /// |
| /// let mut set: HashSet<&str> = HashSet::new(); |
| /// // The set is empty |
| /// assert!(set.is_empty() && set.capacity() == 0); |
| /// |
| /// set.entry("poneyland").or_insert(); |
| /// let capacity_before_remove = set.capacity(); |
| /// |
| /// if let Entry::Occupied(o) = set.entry("poneyland") { |
| /// assert_eq!(o.remove(), "poneyland"); |
| /// } |
| /// |
| /// assert_eq!(set.contains("poneyland"), false); |
| /// // Now set hold none elements but capacity is equal to the old one |
| /// assert!(set.len() == 0 && set.capacity() == capacity_before_remove); |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>remove(<span class="self">self</span>) -> T { |
| <span class="self">self</span>.inner.remove_entry().<span class="number">0 |
| </span>} |
| |
| <span class="doccomment">/// Replaces the entry, returning the old value. The new value in the hash map will be |
| /// the value used to create this entry. |
| /// |
| /// # Panics |
| /// |
| /// Will panic if this OccupiedEntry was created through [`Entry::insert`]. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::hash_set::{Entry, HashSet}; |
| /// use std::rc::Rc; |
| /// |
| /// let mut set: HashSet<Rc<String>> = HashSet::new(); |
| /// let key_one = Rc::new("Stringthing".to_string()); |
| /// let key_two = Rc::new("Stringthing".to_string()); |
| /// |
| /// set.insert(key_one.clone()); |
| /// assert!(Rc::strong_count(&key_one) == 2 && Rc::strong_count(&key_two) == 1); |
| /// |
| /// match set.entry(key_two.clone()) { |
| /// Entry::Occupied(entry) => { |
| /// let old_key: Rc<String> = entry.replace(); |
| /// assert!(Rc::ptr_eq(&key_one, &old_key)); |
| /// } |
| /// Entry::Vacant(_) => panic!(), |
| /// } |
| /// |
| /// assert!(Rc::strong_count(&key_one) == 1 && Rc::strong_count(&key_two) == 2); |
| /// assert!(set.contains(&"Stringthing".to_owned())); |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>replace(<span class="self">self</span>) -> T { |
| <span class="self">self</span>.inner.replace_key() |
| } |
| } |
| |
| <span class="kw">impl</span><<span class="lifetime">'a</span>, T, S, A: Allocator + Clone> VacantEntry<<span class="lifetime">'a</span>, T, S, A> { |
| <span class="doccomment">/// Gets a reference to the value that would be used when inserting |
| /// through the `VacantEntry`. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// |
| /// let mut set: HashSet<&str> = HashSet::new(); |
| /// assert_eq!(set.entry("poneyland").get(), &"poneyland"); |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>get(<span class="kw-2">&</span><span class="self">self</span>) -> <span class="kw-2">&</span>T { |
| <span class="self">self</span>.inner.key() |
| } |
| |
| <span class="doccomment">/// Take ownership of the value. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::hash_set::{Entry, HashSet}; |
| /// |
| /// let mut set: HashSet<&str> = HashSet::new(); |
| /// |
| /// match set.entry("poneyland") { |
| /// Entry::Occupied(_) => panic!(), |
| /// Entry::Vacant(v) => assert_eq!(v.into_value(), "poneyland"), |
| /// } |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>into_value(<span class="self">self</span>) -> T { |
| <span class="self">self</span>.inner.into_key() |
| } |
| |
| <span class="doccomment">/// Sets the value of the entry with the VacantEntry's value. |
| /// |
| /// # Examples |
| /// |
| /// ``` |
| /// use hashbrown::HashSet; |
| /// use hashbrown::hash_set::Entry; |
| /// |
| /// let mut set: HashSet<&str> = HashSet::new(); |
| /// |
| /// if let Entry::Vacant(o) = set.entry("poneyland") { |
| /// o.insert(); |
| /// } |
| /// assert!(set.contains("poneyland")); |
| /// ``` |
| </span><span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">pub fn </span>insert(<span class="self">self</span>) |
| <span class="kw">where |
| </span>T: Hash, |
| S: BuildHasher, |
| { |
| <span class="self">self</span>.inner.insert(()); |
| } |
| |
| <span class="attribute">#[cfg_attr(feature = <span class="string">"inline-more"</span>, inline)] |
| </span><span class="kw">fn </span>insert_entry(<span class="self">self</span>) -> OccupiedEntry<<span class="lifetime">'a</span>, T, S, A> |
| <span class="kw">where |
| </span>T: Hash, |
| S: BuildHasher, |
| { |
| OccupiedEntry { |
| inner: <span class="self">self</span>.inner.insert_entry(()), |
| } |
| } |
| } |
| |
| <span class="attribute">#[allow(dead_code)] |
| </span><span class="kw">fn </span>assert_covariance() { |
| <span class="kw">fn </span>set<<span class="lifetime">'new</span>>(v: HashSet<<span class="kw-2">&</span><span class="lifetime">'static </span>str>) -> HashSet<<span class="kw-2">&</span><span class="lifetime">'new </span>str> { |
| v |
| } |
| <span class="kw">fn </span>iter<<span class="lifetime">'a</span>, <span class="lifetime">'new</span>>(v: Iter<<span class="lifetime">'a</span>, <span class="kw-2">&</span><span class="lifetime">'static </span>str>) -> Iter<<span class="lifetime">'a</span>, <span class="kw-2">&</span><span class="lifetime">'new </span>str> { |
| v |
| } |
| <span class="kw">fn </span>into_iter<<span class="lifetime">'new</span>, A: Allocator + Clone>( |
| v: IntoIter<<span class="kw-2">&</span><span class="lifetime">'static </span>str, A>, |
| ) -> IntoIter<<span class="kw-2">&</span><span class="lifetime">'new </span>str, A> { |
| v |
| } |
| <span class="kw">fn </span>difference<<span class="lifetime">'a</span>, <span class="lifetime">'new</span>, A: Allocator + Clone>( |
| v: Difference<<span class="lifetime">'a</span>, <span class="kw-2">&</span><span class="lifetime">'static </span>str, DefaultHashBuilder, A>, |
| ) -> Difference<<span class="lifetime">'a</span>, <span class="kw-2">&</span><span class="lifetime">'new </span>str, DefaultHashBuilder, A> { |
| v |
| } |
| <span class="kw">fn </span>symmetric_difference<<span class="lifetime">'a</span>, <span class="lifetime">'new</span>, A: Allocator + Clone>( |
| v: SymmetricDifference<<span class="lifetime">'a</span>, <span class="kw-2">&</span><span class="lifetime">'static </span>str, DefaultHashBuilder, A>, |
| ) -> SymmetricDifference<<span class="lifetime">'a</span>, <span class="kw-2">&</span><span class="lifetime">'new </span>str, DefaultHashBuilder, A> { |
| v |
| } |
| <span class="kw">fn </span>intersection<<span class="lifetime">'a</span>, <span class="lifetime">'new</span>, A: Allocator + Clone>( |
| v: Intersection<<span class="lifetime">'a</span>, <span class="kw-2">&</span><span class="lifetime">'static </span>str, DefaultHashBuilder, A>, |
| ) -> Intersection<<span class="lifetime">'a</span>, <span class="kw-2">&</span><span class="lifetime">'new </span>str, DefaultHashBuilder, A> { |
| v |
| } |
| <span class="kw">fn </span>union<<span class="lifetime">'a</span>, <span class="lifetime">'new</span>, A: Allocator + Clone>( |
| v: Union<<span class="lifetime">'a</span>, <span class="kw-2">&</span><span class="lifetime">'static </span>str, DefaultHashBuilder, A>, |
| ) -> Union<<span class="lifetime">'a</span>, <span class="kw-2">&</span><span class="lifetime">'new </span>str, DefaultHashBuilder, A> { |
| v |
| } |
| <span class="kw">fn </span>drain<<span class="lifetime">'new</span>, A: Allocator + Clone>( |
| d: Drain<<span class="lifetime">'static</span>, <span class="kw-2">&</span><span class="lifetime">'static </span>str, A>, |
| ) -> Drain<<span class="lifetime">'new</span>, <span class="kw-2">&</span><span class="lifetime">'new </span>str, A> { |
| d |
| } |
| } |
| |
| <span class="attribute">#[cfg(test)] |
| </span><span class="kw">mod </span>test_set { |
| <span class="kw">use </span><span class="kw">super</span>::<span class="kw">super</span>::map::DefaultHashBuilder; |
| <span class="kw">use </span><span class="kw">super</span>::HashSet; |
| <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>HS = HashSet<i32>; |
| |
| <span class="kw">let </span>s = HS::new(); |
| <span class="macro">assert_eq!</span>(s.capacity(), <span class="number">0</span>); |
| |
| <span class="kw">let </span>s = HS::default(); |
| <span class="macro">assert_eq!</span>(s.capacity(), <span class="number">0</span>); |
| |
| <span class="kw">let </span>s = HS::with_hasher(DefaultHashBuilder::default()); |
| <span class="macro">assert_eq!</span>(s.capacity(), <span class="number">0</span>); |
| |
| <span class="kw">let </span>s = HS::with_capacity(<span class="number">0</span>); |
| <span class="macro">assert_eq!</span>(s.capacity(), <span class="number">0</span>); |
| |
| <span class="kw">let </span>s = HS::with_capacity_and_hasher(<span class="number">0</span>, DefaultHashBuilder::default()); |
| <span class="macro">assert_eq!</span>(s.capacity(), <span class="number">0</span>); |
| |
| <span class="kw">let </span><span class="kw-2">mut </span>s = HS::new(); |
| s.insert(<span class="number">1</span>); |
| s.insert(<span class="number">2</span>); |
| s.remove(<span class="kw-2">&</span><span class="number">1</span>); |
| s.remove(<span class="kw-2">&</span><span class="number">2</span>); |
| s.shrink_to_fit(); |
| <span class="macro">assert_eq!</span>(s.capacity(), <span class="number">0</span>); |
| |
| <span class="kw">let </span><span class="kw-2">mut </span>s = HS::new(); |
| s.reserve(<span class="number">0</span>); |
| <span class="macro">assert_eq!</span>(s.capacity(), <span class="number">0</span>); |
| } |
| |
| <span class="attribute">#[test] |
| </span><span class="kw">fn </span>test_disjoint() { |
| <span class="kw">let </span><span class="kw-2">mut </span>xs = HashSet::new(); |
| <span class="kw">let </span><span class="kw-2">mut </span>ys = HashSet::new(); |
| <span class="macro">assert!</span>(xs.is_disjoint(<span class="kw-2">&</span>ys)); |
| <span class="macro">assert!</span>(ys.is_disjoint(<span class="kw-2">&</span>xs)); |
| <span class="macro">assert!</span>(xs.insert(<span class="number">5</span>)); |
| <span class="macro">assert!</span>(ys.insert(<span class="number">11</span>)); |
| <span class="macro">assert!</span>(xs.is_disjoint(<span class="kw-2">&</span>ys)); |
| <span class="macro">assert!</span>(ys.is_disjoint(<span class="kw-2">&</span>xs)); |
| <span class="macro">assert!</span>(xs.insert(<span class="number">7</span>)); |
| <span class="macro">assert!</span>(xs.insert(<span class="number">19</span>)); |
| <span class="macro">assert!</span>(xs.insert(<span class="number">4</span>)); |
| <span class="macro">assert!</span>(ys.insert(<span class="number">2</span>)); |
| <span class="macro">assert!</span>(ys.insert(-<span class="number">11</span>)); |
| <span class="macro">assert!</span>(xs.is_disjoint(<span class="kw-2">&</span>ys)); |
| <span class="macro">assert!</span>(ys.is_disjoint(<span class="kw-2">&</span>xs)); |
| <span class="macro">assert!</span>(ys.insert(<span class="number">7</span>)); |
| <span class="macro">assert!</span>(!xs.is_disjoint(<span class="kw-2">&</span>ys)); |
| <span class="macro">assert!</span>(!ys.is_disjoint(<span class="kw-2">&</span>xs)); |
| } |
| |
| <span class="attribute">#[test] |
| </span><span class="kw">fn </span>test_subset_and_superset() { |
| <span class="kw">let </span><span class="kw-2">mut </span>a = HashSet::new(); |
| <span class="macro">assert!</span>(a.insert(<span class="number">0</span>)); |
| <span class="macro">assert!</span>(a.insert(<span class="number">5</span>)); |
| <span class="macro">assert!</span>(a.insert(<span class="number">11</span>)); |
| <span class="macro">assert!</span>(a.insert(<span class="number">7</span>)); |
| |
| <span class="kw">let </span><span class="kw-2">mut </span>b = HashSet::new(); |
| <span class="macro">assert!</span>(b.insert(<span class="number">0</span>)); |
| <span class="macro">assert!</span>(b.insert(<span class="number">7</span>)); |
| <span class="macro">assert!</span>(b.insert(<span class="number">19</span>)); |
| <span class="macro">assert!</span>(b.insert(<span class="number">250</span>)); |
| <span class="macro">assert!</span>(b.insert(<span class="number">11</span>)); |
| <span class="macro">assert!</span>(b.insert(<span class="number">200</span>)); |
| |
| <span class="macro">assert!</span>(!a.is_subset(<span class="kw-2">&</span>b)); |
| <span class="macro">assert!</span>(!a.is_superset(<span class="kw-2">&</span>b)); |
| <span class="macro">assert!</span>(!b.is_subset(<span class="kw-2">&</span>a)); |
| <span class="macro">assert!</span>(!b.is_superset(<span class="kw-2">&</span>a)); |
| |
| <span class="macro">assert!</span>(b.insert(<span class="number">5</span>)); |
| |
| <span class="macro">assert!</span>(a.is_subset(<span class="kw-2">&</span>b)); |
| <span class="macro">assert!</span>(!a.is_superset(<span class="kw-2">&</span>b)); |
| <span class="macro">assert!</span>(!b.is_subset(<span class="kw-2">&</span>a)); |
| <span class="macro">assert!</span>(b.is_superset(<span class="kw-2">&</span>a)); |
| } |
| |
| <span class="attribute">#[test] |
| </span><span class="kw">fn </span>test_iterate() { |
| <span class="kw">let </span><span class="kw-2">mut </span>a = HashSet::new(); |
| <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>(a.insert(i)); |
| } |
| <span class="kw">let </span><span class="kw-2">mut </span>observed: u32 = <span class="number">0</span>; |
| <span class="kw">for </span>k <span class="kw">in </span><span class="kw-2">&</span>a { |
| observed |= <span class="number">1 </span><< <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_intersection() { |
| <span class="kw">let </span><span class="kw-2">mut </span>a = HashSet::new(); |
| <span class="kw">let </span><span class="kw-2">mut </span>b = HashSet::new(); |
| |
| <span class="macro">assert!</span>(a.insert(<span class="number">11</span>)); |
| <span class="macro">assert!</span>(a.insert(<span class="number">1</span>)); |
| <span class="macro">assert!</span>(a.insert(<span class="number">3</span>)); |
| <span class="macro">assert!</span>(a.insert(<span class="number">77</span>)); |
| <span class="macro">assert!</span>(a.insert(<span class="number">103</span>)); |
| <span class="macro">assert!</span>(a.insert(<span class="number">5</span>)); |
| <span class="macro">assert!</span>(a.insert(-<span class="number">5</span>)); |
| |
| <span class="macro">assert!</span>(b.insert(<span class="number">2</span>)); |
| <span class="macro">assert!</span>(b.insert(<span class="number">11</span>)); |
| <span class="macro">assert!</span>(b.insert(<span class="number">77</span>)); |
| <span class="macro">assert!</span>(b.insert(-<span class="number">9</span>)); |
| <span class="macro">assert!</span>(b.insert(-<span class="number">42</span>)); |
| <span class="macro">assert!</span>(b.insert(<span class="number">5</span>)); |
| <span class="macro">assert!</span>(b.insert(<span class="number">3</span>)); |
| |
| <span class="kw">let </span><span class="kw-2">mut </span>i = <span class="number">0</span>; |
| <span class="kw">let </span>expected = [<span class="number">3</span>, <span class="number">5</span>, <span class="number">11</span>, <span class="number">77</span>]; |
| <span class="kw">for </span>x <span class="kw">in </span>a.intersection(<span class="kw-2">&</span>b) { |
| <span class="macro">assert!</span>(expected.contains(x)); |
| i += <span class="number">1</span>; |
| } |
| <span class="macro">assert_eq!</span>(i, expected.len()); |
| } |
| |
| <span class="attribute">#[test] |
| </span><span class="kw">fn </span>test_difference() { |
| <span class="kw">let </span><span class="kw-2">mut </span>a = HashSet::new(); |
| <span class="kw">let </span><span class="kw-2">mut </span>b = HashSet::new(); |
| |
| <span class="macro">assert!</span>(a.insert(<span class="number">1</span>)); |
| <span class="macro">assert!</span>(a.insert(<span class="number">3</span>)); |
| <span class="macro">assert!</span>(a.insert(<span class="number">5</span>)); |
| <span class="macro">assert!</span>(a.insert(<span class="number">9</span>)); |
| <span class="macro">assert!</span>(a.insert(<span class="number">11</span>)); |
| |
| <span class="macro">assert!</span>(b.insert(<span class="number">3</span>)); |
| <span class="macro">assert!</span>(b.insert(<span class="number">9</span>)); |
| |
| <span class="kw">let </span><span class="kw-2">mut </span>i = <span class="number">0</span>; |
| <span class="kw">let </span>expected = [<span class="number">1</span>, <span class="number">5</span>, <span class="number">11</span>]; |
| <span class="kw">for </span>x <span class="kw">in </span>a.difference(<span class="kw-2">&</span>b) { |
| <span class="macro">assert!</span>(expected.contains(x)); |
| i += <span class="number">1</span>; |
| } |
| <span class="macro">assert_eq!</span>(i, expected.len()); |
| } |
| |
| <span class="attribute">#[test] |
| </span><span class="kw">fn </span>test_symmetric_difference() { |
| <span class="kw">let </span><span class="kw-2">mut </span>a = HashSet::new(); |
| <span class="kw">let </span><span class="kw-2">mut </span>b = HashSet::new(); |
| |
| <span class="macro">assert!</span>(a.insert(<span class="number">1</span>)); |
| <span class="macro">assert!</span>(a.insert(<span class="number">3</span>)); |
| <span class="macro">assert!</span>(a.insert(<span class="number">5</span>)); |
| <span class="macro">assert!</span>(a.insert(<span class="number">9</span>)); |
| <span class="macro">assert!</span>(a.insert(<span class="number">11</span>)); |
| |
| <span class="macro">assert!</span>(b.insert(-<span class="number">2</span>)); |
| <span class="macro">assert!</span>(b.insert(<span class="number">3</span>)); |
| <span class="macro">assert!</span>(b.insert(<span class="number">9</span>)); |
| <span class="macro">assert!</span>(b.insert(<span class="number">14</span>)); |
| <span class="macro">assert!</span>(b.insert(<span class="number">22</span>)); |
| |
| <span class="kw">let </span><span class="kw-2">mut </span>i = <span class="number">0</span>; |
| <span class="kw">let </span>expected = [-<span class="number">2</span>, <span class="number">1</span>, <span class="number">5</span>, <span class="number">11</span>, <span class="number">14</span>, <span class="number">22</span>]; |
| <span class="kw">for </span>x <span class="kw">in </span>a.symmetric_difference(<span class="kw-2">&</span>b) { |
| <span class="macro">assert!</span>(expected.contains(x)); |
| i += <span class="number">1</span>; |
| } |
| <span class="macro">assert_eq!</span>(i, expected.len()); |
| } |
| |
| <span class="attribute">#[test] |
| </span><span class="kw">fn </span>test_union() { |
| <span class="kw">let </span><span class="kw-2">mut </span>a = HashSet::new(); |
| <span class="kw">let </span><span class="kw-2">mut </span>b = HashSet::new(); |
| |
| <span class="macro">assert!</span>(a.insert(<span class="number">1</span>)); |
| <span class="macro">assert!</span>(a.insert(<span class="number">3</span>)); |
| <span class="macro">assert!</span>(a.insert(<span class="number">5</span>)); |
| <span class="macro">assert!</span>(a.insert(<span class="number">9</span>)); |
| <span class="macro">assert!</span>(a.insert(<span class="number">11</span>)); |
| <span class="macro">assert!</span>(a.insert(<span class="number">16</span>)); |
| <span class="macro">assert!</span>(a.insert(<span class="number">19</span>)); |
| <span class="macro">assert!</span>(a.insert(<span class="number">24</span>)); |
| |
| <span class="macro">assert!</span>(b.insert(-<span class="number">2</span>)); |
| <span class="macro">assert!</span>(b.insert(<span class="number">1</span>)); |
| <span class="macro">assert!</span>(b.insert(<span class="number">5</span>)); |
| <span class="macro">assert!</span>(b.insert(<span class="number">9</span>)); |
| <span class="macro">assert!</span>(b.insert(<span class="number">13</span>)); |
| <span class="macro">assert!</span>(b.insert(<span class="number">19</span>)); |
| |
| <span class="kw">let </span><span class="kw-2">mut </span>i = <span class="number">0</span>; |
| <span class="kw">let </span>expected = [-<span class="number">2</span>, <span class="number">1</span>, <span class="number">3</span>, <span class="number">5</span>, <span class="number">9</span>, <span class="number">11</span>, <span class="number">13</span>, <span class="number">16</span>, <span class="number">19</span>, <span class="number">24</span>]; |
| <span class="kw">for </span>x <span class="kw">in </span>a.union(<span class="kw-2">&</span>b) { |
| <span class="macro">assert!</span>(expected.contains(x)); |
| i += <span class="number">1</span>; |
| } |
| <span class="macro">assert_eq!</span>(i, expected.len()); |
| } |
| |
| <span class="attribute">#[test] |
| </span><span class="kw">fn </span>test_from_map() { |
| <span class="kw">let </span><span class="kw-2">mut </span>a = <span class="kw">crate</span>::HashMap::new(); |
| a.insert(<span class="number">1</span>, ()); |
| a.insert(<span class="number">2</span>, ()); |
| a.insert(<span class="number">3</span>, ()); |
| a.insert(<span class="number">4</span>, ()); |
| |
| <span class="kw">let </span>a: HashSet<<span class="kw">_</span>> = a.into(); |
| |
| <span class="macro">assert_eq!</span>(a.len(), <span class="number">4</span>); |
| <span class="macro">assert!</span>(a.contains(<span class="kw-2">&</span><span class="number">1</span>)); |
| <span class="macro">assert!</span>(a.contains(<span class="kw-2">&</span><span class="number">2</span>)); |
| <span class="macro">assert!</span>(a.contains(<span class="kw-2">&</span><span class="number">3</span>)); |
| <span class="macro">assert!</span>(a.contains(<span class="kw-2">&</span><span class="number">4</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">2</span>, <span class="number">2</span>, <span class="number">3</span>, <span class="number">4</span>, <span class="number">5</span>, <span class="number">6</span>, <span class="number">7</span>, <span class="number">8</span>, <span class="number">9</span>]; |
| |
| <span class="kw">let </span>set: HashSet<<span class="kw">_</span>> = xs.iter().copied().collect(); |
| |
| <span class="kw">for </span>x <span class="kw">in </span><span class="kw-2">&</span>xs { |
| <span class="macro">assert!</span>(set.contains(x)); |
| } |
| |
| <span class="macro">assert_eq!</span>(set.iter().len(), xs.len() - <span class="number">1</span>); |
| } |
| |
| <span class="attribute">#[test] |
| </span><span class="kw">fn </span>test_move_iter() { |
| <span class="kw">let </span>hs = { |
| <span class="kw">let </span><span class="kw-2">mut </span>hs = HashSet::new(); |
| |
| hs.insert(<span class="string">'a'</span>); |
| hs.insert(<span class="string">'b'</span>); |
| |
| hs |
| }; |
| |
| <span class="kw">let </span>v = hs.into_iter().collect::<Vec<char>>(); |
| <span class="macro">assert!</span>(v == [<span class="string">'a'</span>, <span class="string">'b'</span>] || v == [<span class="string">'b'</span>, <span class="string">'a'</span>]); |
| } |
| |
| <span class="attribute">#[test] |
| </span><span class="kw">fn </span>test_eq() { |
| <span class="comment">// These constants once happened to expose a bug in insert(). |
| // I'm keeping them around to prevent a regression. |
| </span><span class="kw">let </span><span class="kw-2">mut </span>s1 = HashSet::new(); |
| |
| s1.insert(<span class="number">1</span>); |
| s1.insert(<span class="number">2</span>); |
| s1.insert(<span class="number">3</span>); |
| |
| <span class="kw">let </span><span class="kw-2">mut </span>s2 = HashSet::new(); |
| |
| s2.insert(<span class="number">1</span>); |
| s2.insert(<span class="number">2</span>); |
| |
| <span class="macro">assert!</span>(s1 != s2); |
| |
| s2.insert(<span class="number">3</span>); |
| |
| <span class="macro">assert_eq!</span>(s1, s2); |
| } |
| |
| <span class="attribute">#[test] |
| </span><span class="kw">fn </span>test_show() { |
| <span class="kw">let </span><span class="kw-2">mut </span>set = HashSet::new(); |
| <span class="kw">let </span>empty = HashSet::<i32>::new(); |
| |
| set.insert(<span class="number">1</span>); |
| set.insert(<span class="number">2</span>); |
| |
| <span class="kw">let </span>set_str = <span class="macro">format!</span>(<span class="string">"{:?}"</span>, set); |
| |
| <span class="macro">assert!</span>(set_str == <span class="string">"{1, 2}" </span>|| set_str == <span class="string">"{2, 1}"</span>); |
| <span class="macro">assert_eq!</span>(<span class="macro">format!</span>(<span class="string">"{:?}"</span>, empty), <span class="string">"{}"</span>); |
| } |
| |
| <span class="attribute">#[test] |
| </span><span class="kw">fn </span>test_trivial_drain() { |
| <span class="kw">let </span><span class="kw-2">mut </span>s = HashSet::<i32>::new(); |
| <span class="kw">for _ in </span>s.drain() {} |
| <span class="macro">assert!</span>(s.is_empty()); |
| drop(s); |
| |
| <span class="kw">let </span><span class="kw-2">mut </span>s = HashSet::<i32>::new(); |
| drop(s.drain()); |
| <span class="macro">assert!</span>(s.is_empty()); |
| } |
| |
| <span class="attribute">#[test] |
| </span><span class="kw">fn </span>test_drain() { |
| <span class="kw">let </span><span class="kw-2">mut </span>s: HashSet<<span class="kw">_</span>> = (<span class="number">1</span>..<span class="number">100</span>).collect(); |
| |
| <span class="comment">// try this a bunch of times to make sure we don't screw up internal state. |
| </span><span class="kw">for _ in </span><span class="number">0</span>..<span class="number">20 </span>{ |
| <span class="macro">assert_eq!</span>(s.len(), <span class="number">99</span>); |
| |
| { |
| <span class="kw">let </span><span class="kw-2">mut </span>last_i = <span class="number">0</span>; |
| <span class="kw">let </span><span class="kw-2">mut </span>d = s.drain(); |
| <span class="kw">for </span>(i, x) <span class="kw">in </span>d.by_ref().take(<span class="number">50</span>).enumerate() { |
| last_i = i; |
| <span class="macro">assert!</span>(x != <span class="number">0</span>); |
| } |
| <span class="macro">assert_eq!</span>(last_i, <span class="number">49</span>); |
| } |
| |
| <span class="kw">for _ in </span><span class="kw-2">&</span>s { |
| <span class="macro">panic!</span>(<span class="string">"s should be empty!"</span>); |
| } |
| |
| <span class="comment">// reset to try again. |
| </span>s.extend(<span class="number">1</span>..<span class="number">100</span>); |
| } |
| } |
| |
| <span class="attribute">#[test] |
| </span><span class="kw">fn </span>test_replace() { |
| <span class="kw">use </span>core::hash; |
| |
| <span class="attribute">#[derive(Debug)] |
| </span><span class="kw">struct </span>Foo(<span class="kw-2">&</span><span class="lifetime">'static </span>str, i32); |
| |
| <span class="kw">impl </span>PartialEq <span class="kw">for </span>Foo { |
| <span class="kw">fn </span>eq(<span class="kw-2">&</span><span class="self">self</span>, other: <span class="kw-2">&</span><span class="self">Self</span>) -> bool { |
| <span class="self">self</span>.<span class="number">0 </span>== other.<span class="number">0 |
| </span>} |
| } |
| |
| <span class="kw">impl </span>Eq <span class="kw">for </span>Foo {} |
| |
| <span class="kw">impl </span>hash::Hash <span class="kw">for </span>Foo { |
| <span class="kw">fn </span>hash<H: hash::Hasher>(<span class="kw-2">&</span><span class="self">self</span>, h: <span class="kw-2">&mut </span>H) { |
| <span class="self">self</span>.<span class="number">0</span>.hash(h); |
| } |
| } |
| |
| <span class="kw">let </span><span class="kw-2">mut </span>s = HashSet::new(); |
| <span class="macro">assert_eq!</span>(s.replace(Foo(<span class="string">"a"</span>, <span class="number">1</span>)), <span class="prelude-val">None</span>); |
| <span class="macro">assert_eq!</span>(s.len(), <span class="number">1</span>); |
| <span class="macro">assert_eq!</span>(s.replace(Foo(<span class="string">"a"</span>, <span class="number">2</span>)), <span class="prelude-val">Some</span>(Foo(<span class="string">"a"</span>, <span class="number">1</span>))); |
| <span class="macro">assert_eq!</span>(s.len(), <span class="number">1</span>); |
| |
| <span class="kw">let </span><span class="kw-2">mut </span>it = s.iter(); |
| <span class="macro">assert_eq!</span>(it.next(), <span class="prelude-val">Some</span>(<span class="kw-2">&</span>Foo(<span class="string">"a"</span>, <span class="number">2</span>))); |
| <span class="macro">assert_eq!</span>(it.next(), <span class="prelude-val">None</span>); |
| } |
| |
| <span class="attribute">#[test] |
| </span><span class="kw">fn </span>test_extend_ref() { |
| <span class="kw">let </span><span class="kw-2">mut </span>a = HashSet::new(); |
| a.insert(<span class="number">1</span>); |
| |
| a.extend(<span class="kw-2">&</span>[<span class="number">2</span>, <span class="number">3</span>, <span class="number">4</span>]); |
| |
| <span class="macro">assert_eq!</span>(a.len(), <span class="number">4</span>); |
| <span class="macro">assert!</span>(a.contains(<span class="kw-2">&</span><span class="number">1</span>)); |
| <span class="macro">assert!</span>(a.contains(<span class="kw-2">&</span><span class="number">2</span>)); |
| <span class="macro">assert!</span>(a.contains(<span class="kw-2">&</span><span class="number">3</span>)); |
| <span class="macro">assert!</span>(a.contains(<span class="kw-2">&</span><span class="number">4</span>)); |
| |
| <span class="kw">let </span><span class="kw-2">mut </span>b = HashSet::new(); |
| b.insert(<span class="number">5</span>); |
| b.insert(<span class="number">6</span>); |
| |
| a.extend(<span class="kw-2">&</span>b); |
| |
| <span class="macro">assert_eq!</span>(a.len(), <span class="number">6</span>); |
| <span class="macro">assert!</span>(a.contains(<span class="kw-2">&</span><span class="number">1</span>)); |
| <span class="macro">assert!</span>(a.contains(<span class="kw-2">&</span><span class="number">2</span>)); |
| <span class="macro">assert!</span>(a.contains(<span class="kw-2">&</span><span class="number">3</span>)); |
| <span class="macro">assert!</span>(a.contains(<span class="kw-2">&</span><span class="number">4</span>)); |
| <span class="macro">assert!</span>(a.contains(<span class="kw-2">&</span><span class="number">5</span>)); |
| <span class="macro">assert!</span>(a.contains(<span class="kw-2">&</span><span class="number">6</span>)); |
| } |
| |
| <span class="attribute">#[test] |
| </span><span class="kw">fn </span>test_retain() { |
| <span class="kw">let </span>xs = [<span class="number">1</span>, <span class="number">2</span>, <span class="number">3</span>, <span class="number">4</span>, <span class="number">5</span>, <span class="number">6</span>]; |
| <span class="kw">let </span><span class="kw-2">mut </span>set: HashSet<i32> = xs.iter().copied().collect(); |
| set.retain(|<span class="kw-2">&</span>k| k % <span class="number">2 </span>== <span class="number">0</span>); |
| <span class="macro">assert_eq!</span>(set.len(), <span class="number">3</span>); |
| <span class="macro">assert!</span>(set.contains(<span class="kw-2">&</span><span class="number">2</span>)); |
| <span class="macro">assert!</span>(set.contains(<span class="kw-2">&</span><span class="number">4</span>)); |
| <span class="macro">assert!</span>(set.contains(<span class="kw-2">&</span><span class="number">6</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>set: HashSet<i32> = (<span class="number">0</span>..<span class="number">8</span>).collect(); |
| <span class="kw">let </span>drained = set.drain_filter(|<span class="kw-2">&</span>k| 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::<Vec<<span class="kw">_</span>>>(); |
| out.sort_unstable(); |
| <span class="macro">assert_eq!</span>(<span class="macro">vec!</span>[<span class="number">0</span>, <span class="number">2</span>, <span class="number">4</span>, <span class="number">6</span>], out); |
| <span class="macro">assert_eq!</span>(set.len(), <span class="number">4</span>); |
| } |
| { |
| <span class="kw">let </span><span class="kw-2">mut </span>set: HashSet<i32> = (<span class="number">0</span>..<span class="number">8</span>).collect(); |
| drop(set.drain_filter(|<span class="kw-2">&</span>k| k % <span class="number">2 </span>== <span class="number">0</span>)); |
| <span class="macro">assert_eq!</span>(set.len(), <span class="number">4</span>, <span class="string">"Removes non-matching items on drop"</span>); |
| } |
| } |
| |
| <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">&</span><span class="self">self</span>) -> DefaultHasher { |
| DefaultHasher::new() |
| } |
| } |
| |
| <span class="kw">const </span>EMPTY_SET: HashSet<u32, MyHasher> = HashSet::with_hasher(MyHasher); |
| |
| <span class="kw">let </span><span class="kw-2">mut </span>set = EMPTY_SET; |
| set.insert(<span class="number">19</span>); |
| <span class="macro">assert!</span>(set.contains(<span class="kw-2">&</span><span class="number">19</span>)); |
| } |
| |
| <span class="attribute">#[test] |
| </span><span class="kw">fn </span>rehash_in_place() { |
| <span class="kw">let </span><span class="kw-2">mut </span>set = HashSet::new(); |
| |
| <span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..<span class="number">224 </span>{ |
| set.insert(i); |
| } |
| |
| <span class="macro">assert_eq!</span>( |
| set.capacity(), |
| <span class="number">224</span>, |
| <span class="string">"The set must be at or close to capacity to trigger a re hashing" |
| </span>); |
| |
| <span class="kw">for </span>i <span class="kw">in </span><span class="number">100</span>..<span class="number">1400 </span>{ |
| set.remove(<span class="kw-2">&</span>(i - <span class="number">100</span>)); |
| set.insert(i); |
| } |
| } |
| } |
| </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> |