api-docs/crates-app/src/hashbrown/raw/mod.rs.html - incubator-teaclave-website - Git at Google

 <!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/raw/mod.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>mod.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>
 </pre><pre class="rust"><code><span class="kw">use </span><span class="kw">crate</span>::alloc::alloc::{handle_alloc_error, Layout};
 <span class="kw">use </span><span class="kw">crate</span>::scopeguard::{guard, ScopeGuard};
 <span class="kw">use </span><span class="kw">crate</span>::TryReserveError;
 <span class="kw">use </span>core::iter::FusedIterator;
 <span class="kw">use </span>core::marker::PhantomData;
 <span class="kw">use </span>core::mem;
 <span class="kw">use </span>core::mem::ManuallyDrop;
 <span class="kw">use </span>core::mem::MaybeUninit;
 <span class="kw">use </span>core::ptr::NonNull;
 <span class="kw">use </span>core::{hint, ptr};

 <span class="macro">cfg_if! </span>{
     <span class="comment">// Use the SSE2 implementation if possible: it allows us to scan 16 buckets
     // at once instead of 8. We don&#39;t bother with AVX since it would require
     // runtime dispatch and wouldn&#39;t gain us much anyways: the probability of
     // finding a match drops off drastically after the first few buckets.
     //
     // I attempted an implementation on ARM using NEON instructions, but it
     // turns out that most NEON instructions have multi-cycle latency, which in
     // the end outweighs any gains over the generic implementation.
     </span><span class="kw">if </span><span class="attribute">#[cfg(all(
         target_feature = <span class="string">&quot;sse2&quot;</span>,
         any(target_arch = <span class="string">&quot;x86&quot;</span>, target_arch = <span class="string">&quot;x86_64&quot;</span>),
         not(miri)
     ))] </span>{
         <span class="kw">mod </span>sse2;
         <span class="kw">use </span>sse2 <span class="kw">as </span>imp;
     } <span class="kw">else </span>{
         <span class="attribute">#[path = <span class="string">&quot;generic.rs&quot;</span>]
         </span><span class="kw">mod </span>generic;
         <span class="kw">use </span>generic <span class="kw">as </span>imp;
     }
 }

 <span class="kw">mod </span>alloc;
 <span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">use </span><span class="self">self</span>::alloc::{do_alloc, Allocator, Global};

 <span class="kw">mod </span>bitmask;

 <span class="kw">use </span><span class="self">self</span>::bitmask::{BitMask, BitMaskIter};
 <span class="kw">use </span><span class="self">self</span>::imp::Group;

 <span class="comment">// Branch prediction hint. This is currently only available on nightly but it
 // consistently improves performance by 10-15%.
 </span><span class="attribute">#[cfg(feature = <span class="string">&quot;nightly&quot;</span>)]
 </span><span class="kw">use </span>core::intrinsics::{likely, unlikely};

 <span class="comment">// On stable we can use #[cold] to get a equivalent effect: this attributes
 // suggests that the function is unlikely to be called
 </span><span class="attribute">#[cfg(not(feature = <span class="string">&quot;nightly&quot;</span>))]
 #[inline]
 #[cold]
 </span><span class="kw">fn </span>cold() {}

 <span class="attribute">#[cfg(not(feature = <span class="string">&quot;nightly&quot;</span>))]
 #[inline]
 </span><span class="kw">fn </span>likely(b: bool) -&gt; bool {
     <span class="kw">if </span>!b {
         cold();
     }
     b
 }
 <span class="attribute">#[cfg(not(feature = <span class="string">&quot;nightly&quot;</span>))]
 #[inline]
 </span><span class="kw">fn </span>unlikely(b: bool) -&gt; bool {
     <span class="kw">if </span>b {
         cold();
     }
     b
 }

 <span class="attribute">#[inline]
 </span><span class="kw">unsafe fn </span>offset_from&lt;T&gt;(to: <span class="kw-2">*const </span>T, from: <span class="kw-2">*const </span>T) -&gt; usize {
     to.offset_from(from) <span class="kw">as </span>usize
 }

 <span class="doccomment">/// Whether memory allocation errors should return an error or abort.
 </span><span class="attribute">#[derive(Copy, Clone)]
 </span><span class="kw">enum </span>Fallibility {
     Fallible,
     Infallible,
 }

 <span class="kw">impl </span>Fallibility {
     <span class="doccomment">/// Error to return on capacity overflow.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">fn </span>capacity_overflow(<span class="self">self</span>) -&gt; TryReserveError {
         <span class="kw">match </span><span class="self">self </span>{
             Fallibility::Fallible =&gt; TryReserveError::CapacityOverflow,
             Fallibility::Infallible =&gt; <span class="macro">panic!</span>(<span class="string">&quot;Hash table capacity overflow&quot;</span>),
         }
     }

     <span class="doccomment">/// Error to return on allocation error.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">fn </span>alloc_err(<span class="self">self</span>, layout: Layout) -&gt; TryReserveError {
         <span class="kw">match </span><span class="self">self </span>{
             Fallibility::Fallible =&gt; TryReserveError::AllocError { layout },
             Fallibility::Infallible =&gt; handle_alloc_error(layout),
         }
     }
 }

 <span class="doccomment">/// Control byte value for an empty bucket.
 </span><span class="kw">const </span>EMPTY: u8 = <span class="number">0b1111_1111</span>;

 <span class="doccomment">/// Control byte value for a deleted bucket.
 </span><span class="kw">const </span>DELETED: u8 = <span class="number">0b1000_0000</span>;

 <span class="doccomment">/// Checks whether a control byte represents a full bucket (top bit is clear).
 </span><span class="attribute">#[inline]
 </span><span class="kw">fn </span>is_full(ctrl: u8) -&gt; bool {
     ctrl &amp; <span class="number">0x80 </span>== <span class="number">0
 </span>}

 <span class="doccomment">/// Checks whether a control byte represents a special value (top bit is set).
 </span><span class="attribute">#[inline]
 </span><span class="kw">fn </span>is_special(ctrl: u8) -&gt; bool {
     ctrl &amp; <span class="number">0x80 </span>!= <span class="number">0
 </span>}

 <span class="doccomment">/// Checks whether a special control value is EMPTY (just check 1 bit).
 </span><span class="attribute">#[inline]
 </span><span class="kw">fn </span>special_is_empty(ctrl: u8) -&gt; bool {
     <span class="macro">debug_assert!</span>(is_special(ctrl));
     ctrl &amp; <span class="number">0x01 </span>!= <span class="number">0
 </span>}

 <span class="doccomment">/// Primary hash function, used to select the initial bucket to probe from.
 </span><span class="attribute">#[inline]
 #[allow(clippy::cast_possible_truncation)]
 </span><span class="kw">fn </span>h1(hash: u64) -&gt; usize {
     <span class="comment">// On 32-bit platforms we simply ignore the higher hash bits.
     </span>hash <span class="kw">as </span>usize
 }

 <span class="doccomment">/// Secondary hash function, saved in the low 7 bits of the control byte.
 </span><span class="attribute">#[inline]
 #[allow(clippy::cast_possible_truncation)]
 </span><span class="kw">fn </span>h2(hash: u64) -&gt; u8 {
     <span class="comment">// Grab the top 7 bits of the hash. While the hash is normally a full 64-bit
     // value, some hash functions (such as FxHash) produce a usize result
     // instead, which means that the top 32 bits are 0 on 32-bit platforms.
     </span><span class="kw">let </span>hash_len = usize::min(mem::size_of::&lt;usize&gt;(), mem::size_of::&lt;u64&gt;());
     <span class="kw">let </span>top7 = hash &gt;&gt; (hash_len * <span class="number">8 </span>- <span class="number">7</span>);
     (top7 &amp; <span class="number">0x7f</span>) <span class="kw">as </span>u8 <span class="comment">// truncation
 </span>}

 <span class="doccomment">/// Probe sequence based on triangular numbers, which is guaranteed (since our
 /// table size is a power of two) to visit every group of elements exactly once.
 ///
 /// A triangular probe has us jump by 1 more group every time. So first we
 /// jump by 1 group (meaning we just continue our linear scan), then 2 groups
 /// (skipping over 1 group), then 3 groups (skipping over 2 groups), and so on.
 ///
 /// Proof that the probe will visit every group in the table:
 /// &lt;https://fgiesen.wordpress.com/2015/02/22/triangular-numbers-mod-2n/&gt;
 </span><span class="kw">struct </span>ProbeSeq {
     pos: usize,
     stride: usize,
 }

 <span class="kw">impl </span>ProbeSeq {
     <span class="attribute">#[inline]
     </span><span class="kw">fn </span>move_next(<span class="kw-2">&amp;mut </span><span class="self">self</span>, bucket_mask: usize) {
         <span class="comment">// We should have found an empty bucket by now and ended the probe.
         </span><span class="macro">debug_assert!</span>(
             <span class="self">self</span>.stride &lt;= bucket_mask,
             <span class="string">&quot;Went past end of probe sequence&quot;
         </span>);

         <span class="self">self</span>.stride += Group::WIDTH;
         <span class="self">self</span>.pos += <span class="self">self</span>.stride;
         <span class="self">self</span>.pos &amp;= bucket_mask;
     }
 }

 <span class="doccomment">/// Returns the number of buckets needed to hold the given number of items,
 /// taking the maximum load factor into account.
 ///
 /// Returns `None` if an overflow occurs.
 </span><span class="comment">// Workaround for emscripten bug emscripten-core/emscripten-fastcomp#258
 </span><span class="attribute">#[cfg_attr(target_os = <span class="string">&quot;emscripten&quot;</span>, inline(never))]
 #[cfg_attr(not(target_os = <span class="string">&quot;emscripten&quot;</span>), inline)]
 </span><span class="kw">fn </span>capacity_to_buckets(cap: usize) -&gt; <span class="prelude-ty">Option</span>&lt;usize&gt; {
     <span class="macro">debug_assert_ne!</span>(cap, <span class="number">0</span>);

     <span class="comment">// For small tables we require at least 1 empty bucket so that lookups are
     // guaranteed to terminate if an element doesn&#39;t exist in the table.
     </span><span class="kw">if </span>cap &lt; <span class="number">8 </span>{
         <span class="comment">// We don&#39;t bother with a table size of 2 buckets since that can only
         // hold a single element. Instead we skip directly to a 4 bucket table
         // which can hold 3 elements.
         </span><span class="kw">return </span><span class="prelude-val">Some</span>(<span class="kw">if </span>cap &lt; <span class="number">4 </span>{ <span class="number">4 </span>} <span class="kw">else </span>{ <span class="number">8 </span>});
     }

     <span class="comment">// Otherwise require 1/8 buckets to be empty (87.5% load)
     //
     // Be careful when modifying this, calculate_layout relies on the
     // overflow check here.
     </span><span class="kw">let </span>adjusted_cap = cap.checked_mul(<span class="number">8</span>)<span class="question-mark">? </span>/ <span class="number">7</span>;

     <span class="comment">// Any overflows will have been caught by the checked_mul. Also, any
     // rounding errors from the division above will be cleaned up by
     // next_power_of_two (which can&#39;t overflow because of the previous division).
     </span><span class="prelude-val">Some</span>(adjusted_cap.next_power_of_two())
 }

 <span class="doccomment">/// Returns the maximum effective capacity for the given bucket mask, taking
 /// the maximum load factor into account.
 </span><span class="attribute">#[inline]
 </span><span class="kw">fn </span>bucket_mask_to_capacity(bucket_mask: usize) -&gt; usize {
     <span class="kw">if </span>bucket_mask &lt; <span class="number">8 </span>{
         <span class="comment">// For tables with 1/2/4/8 buckets, we always reserve one empty slot.
         // Keep in mind that the bucket mask is one less than the bucket count.
         </span>bucket_mask
     } <span class="kw">else </span>{
         <span class="comment">// For larger tables we reserve 12.5% of the slots as empty.
         </span>((bucket_mask + <span class="number">1</span>) / <span class="number">8</span>) * <span class="number">7
     </span>}
 }

 <span class="doccomment">/// Helper which allows the max calculation for ctrl_align to be statically computed for each T
 /// while keeping the rest of `calculate_layout_for` independent of `T`
 </span><span class="attribute">#[derive(Copy, Clone)]
 </span><span class="kw">struct </span>TableLayout {
     size: usize,
     ctrl_align: usize,
 }

 <span class="kw">impl </span>TableLayout {
     <span class="attribute">#[inline]
     </span><span class="kw">fn </span>new&lt;T&gt;() -&gt; <span class="self">Self </span>{
         <span class="kw">let </span>layout = Layout::new::&lt;T&gt;();
         <span class="self">Self </span>{
             size: layout.size(),
             ctrl_align: usize::max(layout.align(), Group::WIDTH),
         }
     }

     <span class="attribute">#[inline]
     </span><span class="kw">fn </span>calculate_layout_for(<span class="self">self</span>, buckets: usize) -&gt; <span class="prelude-ty">Option</span>&lt;(Layout, usize)&gt; {
         <span class="macro">debug_assert!</span>(buckets.is_power_of_two());

         <span class="kw">let </span>TableLayout { size, ctrl_align } = <span class="self">self</span>;
         <span class="comment">// Manual layout calculation since Layout methods are not yet stable.
         </span><span class="kw">let </span>ctrl_offset =
             size.checked_mul(buckets)<span class="question-mark">?</span>.checked_add(ctrl_align - <span class="number">1</span>)<span class="question-mark">? </span>&amp; !(ctrl_align - <span class="number">1</span>);
         <span class="kw">let </span>len = ctrl_offset.checked_add(buckets + Group::WIDTH)<span class="question-mark">?</span>;

         <span class="prelude-val">Some</span>((
             <span class="kw">unsafe </span>{ Layout::from_size_align_unchecked(len, ctrl_align) },
             ctrl_offset,
         ))
     }
 }

 <span class="doccomment">/// Returns a Layout which describes the allocation required for a hash table,
 /// and the offset of the control bytes in the allocation.
 /// (the offset is also one past last element of buckets)
 ///
 /// Returns `None` if an overflow occurs.
 </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
 </span><span class="kw">fn </span>calculate_layout&lt;T&gt;(buckets: usize) -&gt; <span class="prelude-ty">Option</span>&lt;(Layout, usize)&gt; {
     TableLayout::new::&lt;T&gt;().calculate_layout_for(buckets)
 }

 <span class="doccomment">/// A reference to a hash table bucket containing a `T`.
 ///
 /// This is usually just a pointer to the element itself. However if the element
 /// is a ZST, then we instead track the index of the element in the table so
 /// that `erase` works properly.
 </span><span class="kw">pub struct </span>Bucket&lt;T&gt; {
     <span class="comment">// Actually it is pointer to next element than element itself
     // this is needed to maintain pointer arithmetic invariants
     // keeping direct pointer to element introduces difficulty.
     // Using `NonNull` for variance and niche layout
     </span>ptr: NonNull&lt;T&gt;,
 }

 <span class="comment">// This Send impl is needed for rayon support. This is safe since Bucket is
 // never exposed in a public API.
 </span><span class="kw">unsafe impl</span>&lt;T&gt; Send <span class="kw">for </span>Bucket&lt;T&gt; {}

 <span class="kw">impl</span>&lt;T&gt; Clone <span class="kw">for </span>Bucket&lt;T&gt; {
     <span class="attribute">#[inline]
     </span><span class="kw">fn </span>clone(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="self">Self </span>{
         <span class="self">Self </span>{ ptr: <span class="self">self</span>.ptr }
     }
 }

 <span class="kw">impl</span>&lt;T&gt; Bucket&lt;T&gt; {
     <span class="attribute">#[inline]
     </span><span class="kw">unsafe fn </span>from_base_index(base: NonNull&lt;T&gt;, index: usize) -&gt; <span class="self">Self </span>{
         <span class="kw">let </span>ptr = <span class="kw">if </span>mem::size_of::&lt;T&gt;() == <span class="number">0 </span>{
             <span class="comment">// won&#39;t overflow because index must be less than length
             </span>(index + <span class="number">1</span>) <span class="kw">as </span><span class="kw-2">*mut </span>T
         } <span class="kw">else </span>{
             base.as_ptr().sub(index)
         };
         <span class="self">Self </span>{
             ptr: NonNull::new_unchecked(ptr),
         }
     }
     <span class="attribute">#[inline]
     </span><span class="kw">unsafe fn </span>to_base_index(<span class="kw-2">&amp;</span><span class="self">self</span>, base: NonNull&lt;T&gt;) -&gt; usize {
         <span class="kw">if </span>mem::size_of::&lt;T&gt;() == <span class="number">0 </span>{
             <span class="self">self</span>.ptr.as_ptr() <span class="kw">as </span>usize - <span class="number">1
         </span>} <span class="kw">else </span>{
             offset_from(base.as_ptr(), <span class="self">self</span>.ptr.as_ptr())
         }
     }
     <span class="attribute">#[inline]
     </span><span class="kw">pub fn </span>as_ptr(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">*mut </span>T {
         <span class="kw">if </span>mem::size_of::&lt;T&gt;() == <span class="number">0 </span>{
             <span class="comment">// Just return an arbitrary ZST pointer which is properly aligned
             </span>mem::align_of::&lt;T&gt;() <span class="kw">as </span><span class="kw-2">*mut </span>T
         } <span class="kw">else </span>{
             <span class="kw">unsafe </span>{ <span class="self">self</span>.ptr.as_ptr().sub(<span class="number">1</span>) }
         }
     }
     <span class="attribute">#[inline]
     </span><span class="kw">unsafe fn </span>next_n(<span class="kw-2">&amp;</span><span class="self">self</span>, offset: usize) -&gt; <span class="self">Self </span>{
         <span class="kw">let </span>ptr = <span class="kw">if </span>mem::size_of::&lt;T&gt;() == <span class="number">0 </span>{
             (<span class="self">self</span>.ptr.as_ptr() <span class="kw">as </span>usize + offset) <span class="kw">as </span><span class="kw-2">*mut </span>T
         } <span class="kw">else </span>{
             <span class="self">self</span>.ptr.as_ptr().sub(offset)
         };
         <span class="self">Self </span>{
             ptr: NonNull::new_unchecked(ptr),
         }
     }
     <span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">pub unsafe fn </span>drop(<span class="kw-2">&amp;</span><span class="self">self</span>) {
         <span class="self">self</span>.as_ptr().drop_in_place();
     }
     <span class="attribute">#[inline]
     </span><span class="kw">pub unsafe fn </span>read(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; T {
         <span class="self">self</span>.as_ptr().read()
     }
     <span class="attribute">#[inline]
     </span><span class="kw">pub unsafe fn </span>write(<span class="kw-2">&amp;</span><span class="self">self</span>, val: T) {
         <span class="self">self</span>.as_ptr().write(val);
     }
     <span class="attribute">#[inline]
     </span><span class="kw">pub unsafe fn </span>as_ref&lt;<span class="lifetime">&#39;a</span>&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>T {
         <span class="kw-2">&amp;*</span><span class="self">self</span>.as_ptr()
     }
     <span class="attribute">#[inline]
     </span><span class="kw">pub unsafe fn </span>as_mut&lt;<span class="lifetime">&#39;a</span>&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>T {
         <span class="kw-2">&amp;mut *</span><span class="self">self</span>.as_ptr()
     }
     <span class="attribute">#[cfg(feature = <span class="string">&quot;raw&quot;</span>)]
     #[inline]
     </span><span class="kw">pub unsafe fn </span>copy_from_nonoverlapping(<span class="kw-2">&amp;</span><span class="self">self</span>, other: <span class="kw-2">&amp;</span><span class="self">Self</span>) {
         <span class="self">self</span>.as_ptr().copy_from_nonoverlapping(other.as_ptr(), <span class="number">1</span>);
     }
 }

 <span class="doccomment">/// A raw hash table with an unsafe API.
 </span><span class="kw">pub struct </span>RawTable&lt;T, A: Allocator + Clone = Global&gt; {
     table: RawTableInner&lt;A&gt;,
     <span class="comment">// Tell dropck that we own instances of T.
     </span>marker: PhantomData&lt;T&gt;,
 }

 <span class="doccomment">/// Non-generic part of `RawTable` which allows functions to be instantiated only once regardless
 /// of how many different key-value types are used.
 </span><span class="kw">struct </span>RawTableInner&lt;A&gt; {
     <span class="comment">// Mask to get an index from a hash value. The value is one less than the
     // number of buckets in the table.
     </span>bucket_mask: usize,

     <span class="comment">// [Padding], T1, T2, ..., Tlast, C1, C2, ...
     //                                ^ points here
     </span>ctrl: NonNull&lt;u8&gt;,

     <span class="comment">// Number of elements that can be inserted before we need to grow the table
     </span>growth_left: usize,

     <span class="comment">// Number of elements in the table, only really used by len()
     </span>items: usize,

     alloc: A,
 }

 <span class="kw">impl</span>&lt;T&gt; RawTable&lt;T, Global&gt; {
     <span class="doccomment">/// Creates a new empty hash table without allocating any memory.
     ///
     /// In effect this returns a table with exactly 1 bucket. However we can
     /// leave the data pointer dangling since that bucket is never written to
     /// due to our load factor forcing us to always have at least 1 free bucket.
     </span><span class="attribute">#[inline]
     </span><span class="kw">pub const fn </span>new() -&gt; <span class="self">Self </span>{
         <span class="self">Self </span>{
             table: RawTableInner::new_in(Global),
             marker: PhantomData,
         }
     }

     <span class="doccomment">/// Attempts to allocate a new hash table with at least enough capacity
     /// for inserting the given number of elements without reallocating.
     </span><span class="attribute">#[cfg(feature = <span class="string">&quot;raw&quot;</span>)]
     </span><span class="kw">pub fn </span>try_with_capacity(capacity: usize) -&gt; <span class="prelude-ty">Result</span>&lt;<span class="self">Self</span>, TryReserveError&gt; {
         <span class="self">Self</span>::try_with_capacity_in(capacity, Global)
     }

     <span class="doccomment">/// Allocates a new hash table with at least enough capacity for inserting
     /// the given number of elements without reallocating.
     </span><span class="kw">pub fn </span>with_capacity(capacity: usize) -&gt; <span class="self">Self </span>{
         <span class="self">Self</span>::with_capacity_in(capacity, Global)
     }
 }

 <span class="kw">impl</span>&lt;T, A: Allocator + Clone&gt; RawTable&lt;T, A&gt; {
     <span class="doccomment">/// Creates a new empty hash table without allocating any memory, using the
     /// given allocator.
     ///
     /// In effect this returns a table with exactly 1 bucket. However we can
     /// leave the data pointer dangling since that bucket is never written to
     /// due to our load factor forcing us to always have at least 1 free bucket.
     </span><span class="attribute">#[inline]
     </span><span class="kw">pub fn </span>new_in(alloc: A) -&gt; <span class="self">Self </span>{
         <span class="self">Self </span>{
             table: RawTableInner::new_in(alloc),
             marker: PhantomData,
         }
     }

     <span class="doccomment">/// Allocates a new hash table with the given number of buckets.
     ///
     /// The control bytes are left uninitialized.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">unsafe fn </span>new_uninitialized(
         alloc: A,
         buckets: usize,
         fallibility: Fallibility,
     ) -&gt; <span class="prelude-ty">Result</span>&lt;<span class="self">Self</span>, TryReserveError&gt; {
         <span class="macro">debug_assert!</span>(buckets.is_power_of_two());

         <span class="prelude-val">Ok</span>(<span class="self">Self </span>{
             table: RawTableInner::new_uninitialized(
                 alloc,
                 TableLayout::new::&lt;T&gt;(),
                 buckets,
                 fallibility,
             )<span class="question-mark">?</span>,
             marker: PhantomData,
         })
     }

     <span class="doccomment">/// Attempts to allocate a new hash table with at least enough capacity
     /// for inserting the given number of elements without reallocating.
     </span><span class="kw">fn </span>fallible_with_capacity(
         alloc: A,
         capacity: usize,
         fallibility: Fallibility,
     ) -&gt; <span class="prelude-ty">Result</span>&lt;<span class="self">Self</span>, TryReserveError&gt; {
         <span class="prelude-val">Ok</span>(<span class="self">Self </span>{
             table: RawTableInner::fallible_with_capacity(
                 alloc,
                 TableLayout::new::&lt;T&gt;(),
                 capacity,
                 fallibility,
             )<span class="question-mark">?</span>,
             marker: PhantomData,
         })
     }

     <span class="doccomment">/// Attempts to allocate a new hash table using the given allocator, with at least enough
     /// capacity for inserting the given number of elements without reallocating.
     </span><span class="attribute">#[cfg(feature = <span class="string">&quot;raw&quot;</span>)]
     </span><span class="kw">pub fn </span>try_with_capacity_in(capacity: usize, alloc: A) -&gt; <span class="prelude-ty">Result</span>&lt;<span class="self">Self</span>, TryReserveError&gt; {
         <span class="self">Self</span>::fallible_with_capacity(alloc, capacity, Fallibility::Fallible)
     }

     <span class="doccomment">/// Allocates a new hash table using the given allocator, with at least enough capacity for
     /// inserting the given number of elements without reallocating.
     </span><span class="kw">pub fn </span>with_capacity_in(capacity: usize, alloc: A) -&gt; <span class="self">Self </span>{
         <span class="comment">// Avoid `Result::unwrap_or_else` because it bloats LLVM IR.
         </span><span class="kw">match </span><span class="self">Self</span>::fallible_with_capacity(alloc, capacity, Fallibility::Infallible) {
             <span class="prelude-val">Ok</span>(capacity) =&gt; capacity,
             <span class="prelude-val">Err</span>(<span class="kw">_</span>) =&gt; <span class="kw">unsafe </span>{ hint::unreachable_unchecked() },
         }
     }

     <span class="doccomment">/// Returns a reference to the underlying allocator.
     </span><span class="attribute">#[inline]
     </span><span class="kw">pub fn </span>allocator(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>A {
         <span class="kw-2">&amp;</span><span class="self">self</span>.table.alloc
     }

     <span class="doccomment">/// Deallocates the table without dropping any entries.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">unsafe fn </span>free_buckets(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
         <span class="self">self</span>.table.free_buckets(TableLayout::new::&lt;T&gt;());
     }

     <span class="doccomment">/// Returns pointer to one past last element of data table.
     </span><span class="attribute">#[inline]
     </span><span class="kw">pub unsafe fn </span>data_end(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; NonNull&lt;T&gt; {
         NonNull::new_unchecked(<span class="self">self</span>.table.ctrl.as_ptr().cast())
     }

     <span class="doccomment">/// Returns pointer to start of data table.
     </span><span class="attribute">#[inline]
     #[cfg(feature = <span class="string">&quot;nightly&quot;</span>)]
     </span><span class="kw">pub unsafe fn </span>data_start(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">*mut </span>T {
         <span class="self">self</span>.data_end().as_ptr().wrapping_sub(<span class="self">self</span>.buckets())
     }

     <span class="doccomment">/// Returns the index of a bucket from a `Bucket`.
     </span><span class="attribute">#[inline]
     </span><span class="kw">pub unsafe fn </span>bucket_index(<span class="kw-2">&amp;</span><span class="self">self</span>, bucket: <span class="kw-2">&amp;</span>Bucket&lt;T&gt;) -&gt; usize {
         bucket.to_base_index(<span class="self">self</span>.data_end())
     }

     <span class="doccomment">/// Returns a pointer to an element in the table.
     </span><span class="attribute">#[inline]
     </span><span class="kw">pub unsafe fn </span>bucket(<span class="kw-2">&amp;</span><span class="self">self</span>, index: usize) -&gt; Bucket&lt;T&gt; {
         <span class="macro">debug_assert_ne!</span>(<span class="self">self</span>.table.bucket_mask, <span class="number">0</span>);
         <span class="macro">debug_assert!</span>(index &lt; <span class="self">self</span>.buckets());
         Bucket::from_base_index(<span class="self">self</span>.data_end(), index)
     }

     <span class="doccomment">/// Erases an element from the table without dropping it.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     #[deprecated(since = <span class="string">&quot;0.8.1&quot;</span>, note = <span class="string">&quot;use erase or remove instead&quot;</span>)]
     </span><span class="kw">pub unsafe fn </span>erase_no_drop(<span class="kw-2">&amp;mut </span><span class="self">self</span>, item: <span class="kw-2">&amp;</span>Bucket&lt;T&gt;) {
         <span class="kw">let </span>index = <span class="self">self</span>.bucket_index(item);
         <span class="self">self</span>.table.erase(index);
     }

     <span class="doccomment">/// Erases an element from the table, dropping it in place.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     #[allow(clippy::needless_pass_by_value)]
     #[allow(deprecated)]
     </span><span class="kw">pub unsafe fn </span>erase(<span class="kw-2">&amp;mut </span><span class="self">self</span>, item: Bucket&lt;T&gt;) {
         <span class="comment">// Erase the element from the table first since drop might panic.
         </span><span class="self">self</span>.erase_no_drop(<span class="kw-2">&amp;</span>item);
         item.drop();
     }

     <span class="doccomment">/// Finds and erases an element from the table, dropping it in place.
     /// Returns true if an element was found.
     </span><span class="attribute">#[cfg(feature = <span class="string">&quot;raw&quot;</span>)]
     #[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">pub fn </span>erase_entry(<span class="kw-2">&amp;mut </span><span class="self">self</span>, hash: u64, eq: <span class="kw">impl </span>FnMut(<span class="kw-2">&amp;</span>T) -&gt; bool) -&gt; bool {
         <span class="comment">// Avoid `Option::map` because it bloats LLVM IR.
         </span><span class="kw">if let </span><span class="prelude-val">Some</span>(bucket) = <span class="self">self</span>.find(hash, eq) {
             <span class="kw">unsafe </span>{
                 <span class="self">self</span>.erase(bucket);
             }
             <span class="bool-val">true
         </span>} <span class="kw">else </span>{
             <span class="bool-val">false
         </span>}
     }

     <span class="doccomment">/// Removes an element from the table, returning it.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     #[allow(clippy::needless_pass_by_value)]
     #[allow(deprecated)]
     </span><span class="kw">pub unsafe fn </span>remove(<span class="kw-2">&amp;mut </span><span class="self">self</span>, item: Bucket&lt;T&gt;) -&gt; T {
         <span class="self">self</span>.erase_no_drop(<span class="kw-2">&amp;</span>item);
         item.read()
     }

     <span class="doccomment">/// Finds and removes an element from the table, returning it.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">pub fn </span>remove_entry(<span class="kw-2">&amp;mut </span><span class="self">self</span>, hash: u64, eq: <span class="kw">impl </span>FnMut(<span class="kw-2">&amp;</span>T) -&gt; bool) -&gt; <span class="prelude-ty">Option</span>&lt;T&gt; {
         <span class="comment">// Avoid `Option::map` because it bloats LLVM IR.
         </span><span class="kw">match </span><span class="self">self</span>.find(hash, eq) {
             <span class="prelude-val">Some</span>(bucket) =&gt; <span class="prelude-val">Some</span>(<span class="kw">unsafe </span>{ <span class="self">self</span>.remove(bucket) }),
             <span class="prelude-val">None </span>=&gt; <span class="prelude-val">None</span>,
         }
     }

     <span class="doccomment">/// Marks all table buckets as empty without dropping their contents.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">pub fn </span>clear_no_drop(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
         <span class="self">self</span>.table.clear_no_drop();
     }

     <span class="doccomment">/// Removes all elements from the table without freeing the backing memory.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">pub fn </span>clear(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
         <span class="comment">// Ensure that the table is reset even if one of the drops panic
         </span><span class="kw">let </span><span class="kw-2">mut </span>self_ = guard(<span class="self">self</span>, |self_| self_.clear_no_drop());
         <span class="kw">unsafe </span>{
             self_.drop_elements();
         }
     }

     <span class="kw">unsafe fn </span>drop_elements(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
         <span class="kw">if </span>mem::needs_drop::&lt;T&gt;() &amp;&amp; !<span class="self">self</span>.is_empty() {
             <span class="kw">for </span>item <span class="kw">in </span><span class="self">self</span>.iter() {
                 item.drop();
             }
         }
     }

     <span class="doccomment">/// Shrinks the table to fit `max(self.len(), min_size)` elements.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">pub fn </span>shrink_to(<span class="kw-2">&amp;mut </span><span class="self">self</span>, min_size: usize, hasher: <span class="kw">impl </span>Fn(<span class="kw-2">&amp;</span>T) -&gt; u64) {
         <span class="comment">// Calculate the minimal number of elements that we need to reserve
         // space for.
         </span><span class="kw">let </span>min_size = usize::max(<span class="self">self</span>.table.items, min_size);
         <span class="kw">if </span>min_size == <span class="number">0 </span>{
             <span class="kw-2">*</span><span class="self">self </span>= <span class="self">Self</span>::new_in(<span class="self">self</span>.table.alloc.clone());
             <span class="kw">return</span>;
         }

         <span class="comment">// Calculate the number of buckets that we need for this number of
         // elements. If the calculation overflows then the requested bucket
         // count must be larger than what we have right and nothing needs to be
         // done.
         </span><span class="kw">let </span>min_buckets = <span class="kw">match </span>capacity_to_buckets(min_size) {
             <span class="prelude-val">Some</span>(buckets) =&gt; buckets,
             <span class="prelude-val">None </span>=&gt; <span class="kw">return</span>,
         };

         <span class="comment">// If we have more buckets than we need, shrink the table.
         </span><span class="kw">if </span>min_buckets &lt; <span class="self">self</span>.buckets() {
             <span class="comment">// Fast path if the table is empty
             </span><span class="kw">if </span><span class="self">self</span>.table.items == <span class="number">0 </span>{
                 <span class="kw-2">*</span><span class="self">self </span>= <span class="self">Self</span>::with_capacity_in(min_size, <span class="self">self</span>.table.alloc.clone());
             } <span class="kw">else </span>{
                 <span class="comment">// Avoid `Result::unwrap_or_else` because it bloats LLVM IR.
                 </span><span class="kw">if </span><span class="self">self
                     </span>.resize(min_size, hasher, Fallibility::Infallible)
                     .is_err()
                 {
                     <span class="kw">unsafe </span>{ hint::unreachable_unchecked() }
                 }
             }
         }
     }

     <span class="doccomment">/// Ensures that at least `additional` items can be inserted into the table
     /// without reallocation.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">pub fn </span>reserve(<span class="kw-2">&amp;mut </span><span class="self">self</span>, additional: usize, hasher: <span class="kw">impl </span>Fn(<span class="kw-2">&amp;</span>T) -&gt; u64) {
         <span class="kw">if </span>additional &gt; <span class="self">self</span>.table.growth_left {
             <span class="comment">// Avoid `Result::unwrap_or_else` because it bloats LLVM IR.
             </span><span class="kw">if </span><span class="self">self
                 </span>.reserve_rehash(additional, hasher, Fallibility::Infallible)
                 .is_err()
             {
                 <span class="kw">unsafe </span>{ hint::unreachable_unchecked() }
             }
         }
     }

     <span class="doccomment">/// Tries to ensure that at least `additional` items can be inserted into
     /// the table without reallocation.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">pub fn </span>try_reserve(
         <span class="kw-2">&amp;mut </span><span class="self">self</span>,
         additional: usize,
         hasher: <span class="kw">impl </span>Fn(<span class="kw-2">&amp;</span>T) -&gt; u64,
     ) -&gt; <span class="prelude-ty">Result</span>&lt;(), TryReserveError&gt; {
         <span class="kw">if </span>additional &gt; <span class="self">self</span>.table.growth_left {
             <span class="self">self</span>.reserve_rehash(additional, hasher, Fallibility::Fallible)
         } <span class="kw">else </span>{
             <span class="prelude-val">Ok</span>(())
         }
     }

     <span class="doccomment">/// Out-of-line slow path for `reserve` and `try_reserve`.
     </span><span class="attribute">#[cold]
     #[inline(never)]
     </span><span class="kw">fn </span>reserve_rehash(
         <span class="kw-2">&amp;mut </span><span class="self">self</span>,
         additional: usize,
         hasher: <span class="kw">impl </span>Fn(<span class="kw-2">&amp;</span>T) -&gt; u64,
         fallibility: Fallibility,
     ) -&gt; <span class="prelude-ty">Result</span>&lt;(), TryReserveError&gt; {
         <span class="kw">unsafe </span>{
             <span class="self">self</span>.table.reserve_rehash_inner(
                 additional,
                 <span class="kw-2">&amp;</span>|table, index| hasher(table.bucket::&lt;T&gt;(index).as_ref()),
                 fallibility,
                 TableLayout::new::&lt;T&gt;(),
                 <span class="kw">if </span>mem::needs_drop::&lt;T&gt;() {
                     <span class="prelude-val">Some</span>(mem::transmute(ptr::drop_in_place::&lt;T&gt; <span class="kw">as unsafe fn</span>(<span class="kw-2">*mut </span>T)))
                 } <span class="kw">else </span>{
                     <span class="prelude-val">None
                 </span>},
             )
         }
     }

     <span class="doccomment">/// Allocates a new table of a different size and moves the contents of the
     /// current table into it.
     </span><span class="kw">fn </span>resize(
         <span class="kw-2">&amp;mut </span><span class="self">self</span>,
         capacity: usize,
         hasher: <span class="kw">impl </span>Fn(<span class="kw-2">&amp;</span>T) -&gt; u64,
         fallibility: Fallibility,
     ) -&gt; <span class="prelude-ty">Result</span>&lt;(), TryReserveError&gt; {
         <span class="kw">unsafe </span>{
             <span class="self">self</span>.table.resize_inner(
                 capacity,
                 <span class="kw-2">&amp;</span>|table, index| hasher(table.bucket::&lt;T&gt;(index).as_ref()),
                 fallibility,
                 TableLayout::new::&lt;T&gt;(),
             )
         }
     }

     <span class="doccomment">/// Inserts a new element into the table, and returns its raw bucket.
     ///
     /// This does not check if the given element already exists in the table.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">pub fn </span>insert(<span class="kw-2">&amp;mut </span><span class="self">self</span>, hash: u64, value: T, hasher: <span class="kw">impl </span>Fn(<span class="kw-2">&amp;</span>T) -&gt; u64) -&gt; Bucket&lt;T&gt; {
         <span class="kw">unsafe </span>{
             <span class="kw">let </span><span class="kw-2">mut </span>index = <span class="self">self</span>.table.find_insert_slot(hash);

             <span class="comment">// We can avoid growing the table once we have reached our load
             // factor if we are replacing a tombstone. This works since the
             // number of EMPTY slots does not change in this case.
             </span><span class="kw">let </span>old_ctrl = <span class="kw-2">*</span><span class="self">self</span>.table.ctrl(index);
             <span class="kw">if </span>unlikely(<span class="self">self</span>.table.growth_left == <span class="number">0 </span>&amp;&amp; special_is_empty(old_ctrl)) {
                 <span class="self">self</span>.reserve(<span class="number">1</span>, hasher);
                 index = <span class="self">self</span>.table.find_insert_slot(hash);
             }

             <span class="self">self</span>.table.record_item_insert_at(index, old_ctrl, hash);

             <span class="kw">let </span>bucket = <span class="self">self</span>.bucket(index);
             bucket.write(value);
             bucket
         }
     }

     <span class="doccomment">/// Attempts to insert a new element without growing the table and return its raw bucket.
     ///
     /// Returns an `Err` containing the given element if inserting it would require growing the
     /// table.
     ///
     /// This does not check if the given element already exists in the table.
     </span><span class="attribute">#[cfg(feature = <span class="string">&quot;raw&quot;</span>)]
     #[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">pub fn </span>try_insert_no_grow(<span class="kw-2">&amp;mut </span><span class="self">self</span>, hash: u64, value: T) -&gt; <span class="prelude-ty">Result</span>&lt;Bucket&lt;T&gt;, T&gt; {
         <span class="kw">unsafe </span>{
             <span class="kw">match </span><span class="self">self</span>.table.prepare_insert_no_grow(hash) {
                 <span class="prelude-val">Ok</span>(index) =&gt; {
                     <span class="kw">let </span>bucket = <span class="self">self</span>.bucket(index);
                     bucket.write(value);
                     <span class="prelude-val">Ok</span>(bucket)
                 }
                 <span class="prelude-val">Err</span>(()) =&gt; <span class="prelude-val">Err</span>(value),
             }
         }
     }

     <span class="doccomment">/// Inserts a new element into the table, and returns a mutable reference to it.
     ///
     /// This does not check if the given element already exists in the table.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">pub fn </span>insert_entry(<span class="kw-2">&amp;mut </span><span class="self">self</span>, hash: u64, value: T, hasher: <span class="kw">impl </span>Fn(<span class="kw-2">&amp;</span>T) -&gt; u64) -&gt; <span class="kw-2">&amp;mut </span>T {
         <span class="kw">unsafe </span>{ <span class="self">self</span>.insert(hash, value, hasher).as_mut() }
     }

     <span class="doccomment">/// Inserts a new element into the table, without growing the table.
     ///
     /// There must be enough space in the table to insert the new element.
     ///
     /// This does not check if the given element already exists in the table.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     #[cfg(any(feature = <span class="string">&quot;raw&quot;</span>, feature = <span class="string">&quot;rustc-internal-api&quot;</span>))]
     </span><span class="kw">pub unsafe fn </span>insert_no_grow(<span class="kw-2">&amp;mut </span><span class="self">self</span>, hash: u64, value: T) -&gt; Bucket&lt;T&gt; {
         <span class="kw">let </span>(index, old_ctrl) = <span class="self">self</span>.table.prepare_insert_slot(hash);
         <span class="kw">let </span>bucket = <span class="self">self</span>.table.bucket(index);

         <span class="comment">// If we are replacing a DELETED entry then we don&#39;t need to update
         // the load counter.
         </span><span class="self">self</span>.table.growth_left -= special_is_empty(old_ctrl) <span class="kw">as </span>usize;

         bucket.write(value);
         <span class="self">self</span>.table.items += <span class="number">1</span>;
         bucket
     }

     <span class="doccomment">/// Temporary removes a bucket, applying the given function to the removed
     /// element and optionally put back the returned value in the same bucket.
     ///
     /// Returns `true` if the bucket still contains an element
     ///
     /// This does not check if the given bucket is actually occupied.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">pub unsafe fn </span>replace_bucket_with&lt;F&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, bucket: Bucket&lt;T&gt;, f: F) -&gt; bool
     <span class="kw">where
         </span>F: FnOnce(T) -&gt; <span class="prelude-ty">Option</span>&lt;T&gt;,
     {
         <span class="kw">let </span>index = <span class="self">self</span>.bucket_index(<span class="kw-2">&amp;</span>bucket);
         <span class="kw">let </span>old_ctrl = <span class="kw-2">*</span><span class="self">self</span>.table.ctrl(index);
         <span class="macro">debug_assert!</span>(is_full(old_ctrl));
         <span class="kw">let </span>old_growth_left = <span class="self">self</span>.table.growth_left;
         <span class="kw">let </span>item = <span class="self">self</span>.remove(bucket);
         <span class="kw">if let </span><span class="prelude-val">Some</span>(new_item) = f(item) {
             <span class="self">self</span>.table.growth_left = old_growth_left;
             <span class="self">self</span>.table.set_ctrl(index, old_ctrl);
             <span class="self">self</span>.table.items += <span class="number">1</span>;
             <span class="self">self</span>.bucket(index).write(new_item);
             <span class="bool-val">true
         </span>} <span class="kw">else </span>{
             <span class="bool-val">false
         </span>}
     }

     <span class="doccomment">/// Searches for an element in the table.
     </span><span class="attribute">#[inline]
     </span><span class="kw">pub fn </span>find(<span class="kw-2">&amp;</span><span class="self">self</span>, hash: u64, <span class="kw-2">mut </span>eq: <span class="kw">impl </span>FnMut(<span class="kw-2">&amp;</span>T) -&gt; bool) -&gt; <span class="prelude-ty">Option</span>&lt;Bucket&lt;T&gt;&gt; {
         <span class="kw">let </span>result = <span class="self">self</span>.table.find_inner(hash, <span class="kw-2">&amp;mut </span>|index| <span class="kw">unsafe </span>{
             eq(<span class="self">self</span>.bucket(index).as_ref())
         });

         <span class="comment">// Avoid `Option::map` because it bloats LLVM IR.
         </span><span class="kw">match </span>result {
             <span class="prelude-val">Some</span>(index) =&gt; <span class="prelude-val">Some</span>(<span class="kw">unsafe </span>{ <span class="self">self</span>.bucket(index) }),
             <span class="prelude-val">None </span>=&gt; <span class="prelude-val">None</span>,
         }
     }

     <span class="doccomment">/// Gets a reference to an element in the table.
     </span><span class="attribute">#[inline]
     </span><span class="kw">pub fn </span>get(<span class="kw-2">&amp;</span><span class="self">self</span>, hash: u64, eq: <span class="kw">impl </span>FnMut(<span class="kw-2">&amp;</span>T) -&gt; bool) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="kw-2">&amp;</span>T&gt; {
         <span class="comment">// Avoid `Option::map` because it bloats LLVM IR.
         </span><span class="kw">match </span><span class="self">self</span>.find(hash, eq) {
             <span class="prelude-val">Some</span>(bucket) =&gt; <span class="prelude-val">Some</span>(<span class="kw">unsafe </span>{ bucket.as_ref() }),
             <span class="prelude-val">None </span>=&gt; <span class="prelude-val">None</span>,
         }
     }

     <span class="doccomment">/// Gets a mutable reference to an element in the table.
     </span><span class="attribute">#[inline]
     </span><span class="kw">pub fn </span>get_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>, hash: u64, eq: <span class="kw">impl </span>FnMut(<span class="kw-2">&amp;</span>T) -&gt; bool) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="kw-2">&amp;mut </span>T&gt; {
         <span class="comment">// Avoid `Option::map` because it bloats LLVM IR.
         </span><span class="kw">match </span><span class="self">self</span>.find(hash, eq) {
             <span class="prelude-val">Some</span>(bucket) =&gt; <span class="prelude-val">Some</span>(<span class="kw">unsafe </span>{ bucket.as_mut() }),
             <span class="prelude-val">None </span>=&gt; <span class="prelude-val">None</span>,
         }
     }

     <span class="doccomment">/// Attempts to get mutable references to `N` entries in the table at once.
     ///
     /// Returns an array of length `N` with the results of each query.
     ///
     /// At most one mutable reference will be returned to any entry. `None` will be returned if any
     /// of the hashes are duplicates. `None` will be returned if the hash is not found.
     ///
     /// The `eq` argument should be a closure such that `eq(i, k)` returns true if `k` is equal to
     /// the `i`th key to be looked up.
     </span><span class="kw">pub fn </span>get_many_mut&lt;<span class="kw">const </span>N: usize&gt;(
         <span class="kw-2">&amp;mut </span><span class="self">self</span>,
         hashes: [u64; N],
         eq: <span class="kw">impl </span>FnMut(usize, <span class="kw-2">&amp;</span>T) -&gt; bool,
     ) -&gt; <span class="prelude-ty">Option</span>&lt;[<span class="kw-2">&amp;</span><span class="lifetime">&#39;_ </span><span class="kw-2">mut </span>T; N]&gt; {
         <span class="kw">unsafe </span>{
             <span class="kw">let </span>ptrs = <span class="self">self</span>.get_many_mut_pointers(hashes, eq)<span class="question-mark">?</span>;

             <span class="kw">for </span>(i, <span class="kw-2">&amp;</span>cur) <span class="kw">in </span>ptrs.iter().enumerate() {
                 <span class="kw">if </span>ptrs[..i].iter().any(|<span class="kw-2">&amp;</span>prev| ptr::eq::&lt;T&gt;(prev, cur)) {
                     <span class="kw">return </span><span class="prelude-val">None</span>;
                 }
             }
             <span class="comment">// All bucket are distinct from all previous buckets so we&#39;re clear to return the result
             // of the lookup.

             // TODO use `MaybeUninit::array_assume_init` here instead once that&#39;s stable.
             </span><span class="prelude-val">Some</span>(mem::transmute_copy(<span class="kw-2">&amp;</span>ptrs))
         }
     }

     <span class="kw">pub unsafe fn </span>get_many_unchecked_mut&lt;<span class="kw">const </span>N: usize&gt;(
         <span class="kw-2">&amp;mut </span><span class="self">self</span>,
         hashes: [u64; N],
         eq: <span class="kw">impl </span>FnMut(usize, <span class="kw-2">&amp;</span>T) -&gt; bool,
     ) -&gt; <span class="prelude-ty">Option</span>&lt;[<span class="kw-2">&amp;</span><span class="lifetime">&#39;_ </span><span class="kw-2">mut </span>T; N]&gt; {
         <span class="kw">let </span>ptrs = <span class="self">self</span>.get_many_mut_pointers(hashes, eq)<span class="question-mark">?</span>;
         <span class="prelude-val">Some</span>(mem::transmute_copy(<span class="kw-2">&amp;</span>ptrs))
     }

     <span class="kw">unsafe fn </span>get_many_mut_pointers&lt;<span class="kw">const </span>N: usize&gt;(
         <span class="kw-2">&amp;mut </span><span class="self">self</span>,
         hashes: [u64; N],
         <span class="kw-2">mut </span>eq: <span class="kw">impl </span>FnMut(usize, <span class="kw-2">&amp;</span>T) -&gt; bool,
     ) -&gt; <span class="prelude-ty">Option</span>&lt;[<span class="kw-2">*mut </span>T; N]&gt; {
         <span class="comment">// TODO use `MaybeUninit::uninit_array` here instead once that&#39;s stable.
         </span><span class="kw">let </span><span class="kw-2">mut </span>outs: MaybeUninit&lt;[<span class="kw-2">*mut </span>T; N]&gt; = MaybeUninit::uninit();
         <span class="kw">let </span>outs_ptr = outs.as_mut_ptr();

         <span class="kw">for </span>(i, <span class="kw-2">&amp;</span>hash) <span class="kw">in </span>hashes.iter().enumerate() {
             <span class="kw">let </span>cur = <span class="self">self</span>.find(hash, |k| eq(i, k))<span class="question-mark">?</span>;
             <span class="kw-2">*</span>(<span class="kw-2">*</span>outs_ptr).get_unchecked_mut(i) = cur.as_mut();
         }

         <span class="comment">// TODO use `MaybeUninit::array_assume_init` here instead once that&#39;s stable.
         </span><span class="prelude-val">Some</span>(outs.assume_init())
     }

     <span class="doccomment">/// Returns the number of elements the map can hold without reallocating.
     ///
     /// This number is a lower bound; the table might be able to hold
     /// more, but is guaranteed to be able to hold at least this many.
     </span><span class="attribute">#[inline]
     </span><span class="kw">pub fn </span>capacity(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
         <span class="self">self</span>.table.items + <span class="self">self</span>.table.growth_left
     }

     <span class="doccomment">/// Returns the number of elements in the table.
     </span><span class="attribute">#[inline]
     </span><span class="kw">pub fn </span>len(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
         <span class="self">self</span>.table.items
     }

     <span class="doccomment">/// Returns `true` if the table contains no elements.
     </span><span class="attribute">#[inline]
     </span><span class="kw">pub fn </span>is_empty(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; bool {
         <span class="self">self</span>.len() == <span class="number">0
     </span>}

     <span class="doccomment">/// Returns the number of buckets in the table.
     </span><span class="attribute">#[inline]
     </span><span class="kw">pub fn </span>buckets(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
         <span class="self">self</span>.table.bucket_mask + <span class="number">1
     </span>}

     <span class="doccomment">/// Returns an iterator over every element in the table. It is up to
     /// the caller to ensure that the `RawTable` outlives the `RawIter`.
     /// Because we cannot make the `next` method unsafe on the `RawIter`
     /// struct, we have to make the `iter` method unsafe.
     </span><span class="attribute">#[inline]
     </span><span class="kw">pub unsafe fn </span>iter(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; RawIter&lt;T&gt; {
         <span class="kw">let </span>data = Bucket::from_base_index(<span class="self">self</span>.data_end(), <span class="number">0</span>);
         RawIter {
             iter: RawIterRange::new(<span class="self">self</span>.table.ctrl.as_ptr(), data, <span class="self">self</span>.table.buckets()),
             items: <span class="self">self</span>.table.items,
         }
     }

     <span class="doccomment">/// Returns an iterator over occupied buckets that could match a given hash.
     ///
     /// `RawTable` only stores 7 bits of the hash value, so this iterator may
     /// return items that have a hash value different than the one provided. You
     /// should always validate the returned values before using them.
     ///
     /// It is up to the caller to ensure that the `RawTable` outlives the
     /// `RawIterHash`. Because we cannot make the `next` method unsafe on the
     /// `RawIterHash` struct, we have to make the `iter_hash` method unsafe.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     #[cfg(feature = <span class="string">&quot;raw&quot;</span>)]
     </span><span class="kw">pub unsafe fn </span>iter_hash(<span class="kw-2">&amp;</span><span class="self">self</span>, hash: u64) -&gt; RawIterHash&lt;<span class="lifetime">&#39;_</span>, T, A&gt; {
         RawIterHash::new(<span class="self">self</span>, hash)
     }

     <span class="doccomment">/// Returns an iterator which removes all elements from the table without
     /// freeing the memory.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">pub fn </span>drain(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; RawDrain&lt;<span class="lifetime">&#39;_</span>, T, A&gt; {
         <span class="kw">unsafe </span>{
             <span class="kw">let </span>iter = <span class="self">self</span>.iter();
             <span class="self">self</span>.drain_iter_from(iter)
         }
     }

     <span class="doccomment">/// Returns an iterator which removes all elements from the table without
     /// freeing the memory.
     ///
     /// Iteration starts at the provided iterator&#39;s current location.
     ///
     /// It is up to the caller to ensure that the iterator is valid for this
     /// `RawTable` and covers all items that remain in the table.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">pub unsafe fn </span>drain_iter_from(<span class="kw-2">&amp;mut </span><span class="self">self</span>, iter: RawIter&lt;T&gt;) -&gt; RawDrain&lt;<span class="lifetime">&#39;_</span>, T, A&gt; {
         <span class="macro">debug_assert_eq!</span>(iter.len(), <span class="self">self</span>.len());
         RawDrain {
             iter,
             table: ManuallyDrop::new(mem::replace(<span class="self">self</span>, <span class="self">Self</span>::new_in(<span class="self">self</span>.table.alloc.clone()))),
             orig_table: NonNull::from(<span class="self">self</span>),
             marker: PhantomData,
         }
     }

     <span class="doccomment">/// Returns an iterator which consumes all elements from the table.
     ///
     /// Iteration starts at the provided iterator&#39;s current location.
     ///
     /// It is up to the caller to ensure that the iterator is valid for this
     /// `RawTable` and covers all items that remain in the table.
     </span><span class="kw">pub unsafe fn </span>into_iter_from(<span class="self">self</span>, iter: RawIter&lt;T&gt;) -&gt; RawIntoIter&lt;T, A&gt; {
         <span class="macro">debug_assert_eq!</span>(iter.len(), <span class="self">self</span>.len());

         <span class="kw">let </span>alloc = <span class="self">self</span>.table.alloc.clone();
         <span class="kw">let </span>allocation = <span class="self">self</span>.into_allocation();
         RawIntoIter {
             iter,
             allocation,
             marker: PhantomData,
             alloc,
         }
     }

     <span class="doccomment">/// Converts the table into a raw allocation. The contents of the table
     /// should be dropped using a `RawIter` before freeing the allocation.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>into_allocation(<span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;(NonNull&lt;u8&gt;, Layout)&gt; {
         <span class="kw">let </span>alloc = <span class="kw">if </span><span class="self">self</span>.table.is_empty_singleton() {
             <span class="prelude-val">None
         </span>} <span class="kw">else </span>{
             <span class="comment">// Avoid `Option::unwrap_or_else` because it bloats LLVM IR.
             </span><span class="kw">let </span>(layout, ctrl_offset) = <span class="kw">match </span>calculate_layout::&lt;T&gt;(<span class="self">self</span>.table.buckets()) {
                 <span class="prelude-val">Some</span>(lco) =&gt; lco,
                 <span class="prelude-val">None </span>=&gt; <span class="kw">unsafe </span>{ hint::unreachable_unchecked() },
             };
             <span class="prelude-val">Some</span>((
                 <span class="kw">unsafe </span>{ NonNull::new_unchecked(<span class="self">self</span>.table.ctrl.as_ptr().sub(ctrl_offset)) },
                 layout,
             ))
         };
         mem::forget(<span class="self">self</span>);
         alloc
     }
 }

 <span class="kw">unsafe impl</span>&lt;T, A: Allocator + Clone&gt; Send <span class="kw">for </span>RawTable&lt;T, A&gt;
 <span class="kw">where
     </span>T: Send,
     A: Send,
 {
 }
 <span class="kw">unsafe impl</span>&lt;T, A: Allocator + Clone&gt; Sync <span class="kw">for </span>RawTable&lt;T, A&gt;
 <span class="kw">where
     </span>T: Sync,
     A: Sync,
 {
 }

 <span class="kw">impl</span>&lt;A&gt; RawTableInner&lt;A&gt; {
     <span class="attribute">#[inline]
     </span><span class="kw">const fn </span>new_in(alloc: A) -&gt; <span class="self">Self </span>{
         <span class="self">Self </span>{
             <span class="comment">// Be careful to cast the entire slice to a raw pointer.
             </span>ctrl: <span class="kw">unsafe </span>{ NonNull::new_unchecked(Group::static_empty() <span class="kw">as </span><span class="kw-2">*const </span><span class="kw">_ as </span><span class="kw-2">*mut </span>u8) },
             bucket_mask: <span class="number">0</span>,
             items: <span class="number">0</span>,
             growth_left: <span class="number">0</span>,
             alloc,
         }
     }
 }

 <span class="kw">impl</span>&lt;A: Allocator + Clone&gt; RawTableInner&lt;A&gt; {
     <span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">unsafe fn </span>new_uninitialized(
         alloc: A,
         table_layout: TableLayout,
         buckets: usize,
         fallibility: Fallibility,
     ) -&gt; <span class="prelude-ty">Result</span>&lt;<span class="self">Self</span>, TryReserveError&gt; {
         <span class="macro">debug_assert!</span>(buckets.is_power_of_two());

         <span class="comment">// Avoid `Option::ok_or_else` because it bloats LLVM IR.
         </span><span class="kw">let </span>(layout, ctrl_offset) = <span class="kw">match </span>table_layout.calculate_layout_for(buckets) {
             <span class="prelude-val">Some</span>(lco) =&gt; lco,
             <span class="prelude-val">None </span>=&gt; <span class="kw">return </span><span class="prelude-val">Err</span>(fallibility.capacity_overflow()),
         };

         <span class="comment">// We need an additional check to ensure that the allocation doesn&#39;t
         // exceed `isize::MAX`. We can skip this check on 64-bit systems since
         // such allocations will never succeed anyways.
         //
         // This mirrors what Vec does in the standard library.
         </span><span class="kw">if </span>mem::size_of::&lt;usize&gt;() &lt; <span class="number">8 </span>&amp;&amp; layout.size() &gt; isize::MAX <span class="kw">as </span>usize {
             <span class="kw">return </span><span class="prelude-val">Err</span>(fallibility.capacity_overflow());
         }

         <span class="kw">let </span>ptr: NonNull&lt;u8&gt; = <span class="kw">match </span>do_alloc(<span class="kw-2">&amp;</span>alloc, layout) {
             <span class="prelude-val">Ok</span>(block) =&gt; block.cast(),
             <span class="prelude-val">Err</span>(<span class="kw">_</span>) =&gt; <span class="kw">return </span><span class="prelude-val">Err</span>(fallibility.alloc_err(layout)),
         };

         <span class="kw">let </span>ctrl = NonNull::new_unchecked(ptr.as_ptr().add(ctrl_offset));
         <span class="prelude-val">Ok</span>(<span class="self">Self </span>{
             ctrl,
             bucket_mask: buckets - <span class="number">1</span>,
             items: <span class="number">0</span>,
             growth_left: bucket_mask_to_capacity(buckets - <span class="number">1</span>),
             alloc,
         })
     }

     <span class="attribute">#[inline]
     </span><span class="kw">fn </span>fallible_with_capacity(
         alloc: A,
         table_layout: TableLayout,
         capacity: usize,
         fallibility: Fallibility,
     ) -&gt; <span class="prelude-ty">Result</span>&lt;<span class="self">Self</span>, TryReserveError&gt; {
         <span class="kw">if </span>capacity == <span class="number">0 </span>{
             <span class="prelude-val">Ok</span>(<span class="self">Self</span>::new_in(alloc))
         } <span class="kw">else </span>{
             <span class="kw">unsafe </span>{
                 <span class="kw">let </span>buckets =
                     capacity_to_buckets(capacity).ok_or_else(|| fallibility.capacity_overflow())<span class="question-mark">?</span>;

                 <span class="kw">let </span>result = <span class="self">Self</span>::new_uninitialized(alloc, table_layout, buckets, fallibility)<span class="question-mark">?</span>;
                 result.ctrl(<span class="number">0</span>).write_bytes(EMPTY, result.num_ctrl_bytes());

                 <span class="prelude-val">Ok</span>(result)
             }
         }
     }

     <span class="doccomment">/// Searches for an empty or deleted bucket which is suitable for inserting
     /// a new element and sets the hash for that slot.
     ///
     /// There must be at least 1 empty bucket in the table.
     </span><span class="attribute">#[inline]
     </span><span class="kw">unsafe fn </span>prepare_insert_slot(<span class="kw-2">&amp;</span><span class="self">self</span>, hash: u64) -&gt; (usize, u8) {
         <span class="kw">let </span>index = <span class="self">self</span>.find_insert_slot(hash);
         <span class="kw">let </span>old_ctrl = <span class="kw-2">*</span><span class="self">self</span>.ctrl(index);
         <span class="self">self</span>.set_ctrl_h2(index, hash);
         (index, old_ctrl)
     }

     <span class="doccomment">/// Searches for an empty or deleted bucket which is suitable for inserting
     /// a new element.
     ///
     /// There must be at least 1 empty bucket in the table.
     </span><span class="attribute">#[inline]
     </span><span class="kw">fn </span>find_insert_slot(<span class="kw-2">&amp;</span><span class="self">self</span>, hash: u64) -&gt; usize {
         <span class="kw">let </span><span class="kw-2">mut </span>probe_seq = <span class="self">self</span>.probe_seq(hash);
         <span class="kw">loop </span>{
             <span class="kw">unsafe </span>{
                 <span class="kw">let </span>group = Group::load(<span class="self">self</span>.ctrl(probe_seq.pos));
                 <span class="kw">if let </span><span class="prelude-val">Some</span>(bit) = group.match_empty_or_deleted().lowest_set_bit() {
                     <span class="kw">let </span>result = (probe_seq.pos + bit) &amp; <span class="self">self</span>.bucket_mask;

                     <span class="comment">// In tables smaller than the group width, trailing control
                     // bytes outside the range of the table are filled with
                     // EMPTY entries. These will unfortunately trigger a
                     // match, but once masked may point to a full bucket that
                     // is already occupied. We detect this situation here and
                     // perform a second scan starting at the beginning of the
                     // table. This second scan is guaranteed to find an empty
                     // slot (due to the load factor) before hitting the trailing
                     // control bytes (containing EMPTY).
                     </span><span class="kw">if </span>unlikely(is_full(<span class="kw-2">*</span><span class="self">self</span>.ctrl(result))) {
                         <span class="macro">debug_assert!</span>(<span class="self">self</span>.bucket_mask &lt; Group::WIDTH);
                         <span class="macro">debug_assert_ne!</span>(probe_seq.pos, <span class="number">0</span>);
                         <span class="kw">return </span>Group::load_aligned(<span class="self">self</span>.ctrl(<span class="number">0</span>))
                             .match_empty_or_deleted()
                             .lowest_set_bit_nonzero();
                     }

                     <span class="kw">return </span>result;
                 }
             }
             probe_seq.move_next(<span class="self">self</span>.bucket_mask);
         }
     }

     <span class="doccomment">/// Searches for an element in the table. This uses dynamic dispatch to reduce the amount of
     /// code generated, but it is eliminated by LLVM optimizations.
     </span><span class="attribute">#[inline]
     </span><span class="kw">fn </span>find_inner(<span class="kw-2">&amp;</span><span class="self">self</span>, hash: u64, eq: <span class="kw-2">&amp;mut </span><span class="kw">dyn </span>FnMut(usize) -&gt; bool) -&gt; <span class="prelude-ty">Option</span>&lt;usize&gt; {
         <span class="kw">let </span>h2_hash = h2(hash);
         <span class="kw">let </span><span class="kw-2">mut </span>probe_seq = <span class="self">self</span>.probe_seq(hash);

         <span class="kw">loop </span>{
             <span class="kw">let </span>group = <span class="kw">unsafe </span>{ Group::load(<span class="self">self</span>.ctrl(probe_seq.pos)) };

             <span class="kw">for </span>bit <span class="kw">in </span>group.match_byte(h2_hash) {
                 <span class="kw">let </span>index = (probe_seq.pos + bit) &amp; <span class="self">self</span>.bucket_mask;

                 <span class="kw">if </span>likely(eq(index)) {
                     <span class="kw">return </span><span class="prelude-val">Some</span>(index);
                 }
             }

             <span class="kw">if </span>likely(group.match_empty().any_bit_set()) {
                 <span class="kw">return </span><span class="prelude-val">None</span>;
             }

             probe_seq.move_next(<span class="self">self</span>.bucket_mask);
         }
     }

     <span class="attribute">#[allow(clippy::mut_mut)]
     #[inline]
     </span><span class="kw">unsafe fn </span>prepare_rehash_in_place(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
         <span class="comment">// Bulk convert all full control bytes to DELETED, and all DELETED
         // control bytes to EMPTY. This effectively frees up all buckets
         // containing a DELETED entry.
         </span><span class="kw">for </span>i <span class="kw">in </span>(<span class="number">0</span>..<span class="self">self</span>.buckets()).step_by(Group::WIDTH) {
             <span class="kw">let </span>group = Group::load_aligned(<span class="self">self</span>.ctrl(i));
             <span class="kw">let </span>group = group.convert_special_to_empty_and_full_to_deleted();
             group.store_aligned(<span class="self">self</span>.ctrl(i));
         }

         <span class="comment">// Fix up the trailing control bytes. See the comments in set_ctrl
         // for the handling of tables smaller than the group width.
         </span><span class="kw">if </span><span class="self">self</span>.buckets() &lt; Group::WIDTH {
             <span class="self">self</span>.ctrl(<span class="number">0</span>)
                 .copy_to(<span class="self">self</span>.ctrl(Group::WIDTH), <span class="self">self</span>.buckets());
         } <span class="kw">else </span>{
             <span class="self">self</span>.ctrl(<span class="number">0</span>)
                 .copy_to(<span class="self">self</span>.ctrl(<span class="self">self</span>.buckets()), Group::WIDTH);
         }
     }

     <span class="attribute">#[inline]
     </span><span class="kw">unsafe fn </span>bucket&lt;T&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, index: usize) -&gt; Bucket&lt;T&gt; {
         <span class="macro">debug_assert_ne!</span>(<span class="self">self</span>.bucket_mask, <span class="number">0</span>);
         <span class="macro">debug_assert!</span>(index &lt; <span class="self">self</span>.buckets());
         Bucket::from_base_index(<span class="self">self</span>.data_end(), index)
     }

     <span class="attribute">#[inline]
     </span><span class="kw">unsafe fn </span>bucket_ptr(<span class="kw-2">&amp;</span><span class="self">self</span>, index: usize, size_of: usize) -&gt; <span class="kw-2">*mut </span>u8 {
         <span class="macro">debug_assert_ne!</span>(<span class="self">self</span>.bucket_mask, <span class="number">0</span>);
         <span class="macro">debug_assert!</span>(index &lt; <span class="self">self</span>.buckets());
         <span class="kw">let </span>base: <span class="kw-2">*mut </span>u8 = <span class="self">self</span>.data_end().as_ptr();
         base.sub((index + <span class="number">1</span>) * size_of)
     }

     <span class="attribute">#[inline]
     </span><span class="kw">unsafe fn </span>data_end&lt;T&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; NonNull&lt;T&gt; {
         NonNull::new_unchecked(<span class="self">self</span>.ctrl.as_ptr().cast())
     }

     <span class="doccomment">/// Returns an iterator-like object for a probe sequence on the table.
     ///
     /// This iterator never terminates, but is guaranteed to visit each bucket
     /// group exactly once. The loop using `probe_seq` must terminate upon
     /// reaching a group containing an empty bucket.
     </span><span class="attribute">#[inline]
     </span><span class="kw">fn </span>probe_seq(<span class="kw-2">&amp;</span><span class="self">self</span>, hash: u64) -&gt; ProbeSeq {
         ProbeSeq {
             pos: h1(hash) &amp; <span class="self">self</span>.bucket_mask,
             stride: <span class="number">0</span>,
         }
     }

     <span class="doccomment">/// Returns the index of a bucket for which a value must be inserted if there is enough rooom
     /// in the table, otherwise returns error
     </span><span class="attribute">#[cfg(feature = <span class="string">&quot;raw&quot;</span>)]
     #[inline]
     </span><span class="kw">unsafe fn </span>prepare_insert_no_grow(<span class="kw-2">&amp;mut </span><span class="self">self</span>, hash: u64) -&gt; <span class="prelude-ty">Result</span>&lt;usize, ()&gt; {
         <span class="kw">let </span>index = <span class="self">self</span>.find_insert_slot(hash);
         <span class="kw">let </span>old_ctrl = <span class="kw-2">*</span><span class="self">self</span>.ctrl(index);
         <span class="kw">if </span>unlikely(<span class="self">self</span>.growth_left == <span class="number">0 </span>&amp;&amp; special_is_empty(old_ctrl)) {
             <span class="prelude-val">Err</span>(())
         } <span class="kw">else </span>{
             <span class="self">self</span>.record_item_insert_at(index, old_ctrl, hash);
             <span class="prelude-val">Ok</span>(index)
         }
     }

     <span class="attribute">#[inline]
     </span><span class="kw">unsafe fn </span>record_item_insert_at(<span class="kw-2">&amp;mut </span><span class="self">self</span>, index: usize, old_ctrl: u8, hash: u64) {
         <span class="self">self</span>.growth_left -= usize::from(special_is_empty(old_ctrl));
         <span class="self">self</span>.set_ctrl_h2(index, hash);
         <span class="self">self</span>.items += <span class="number">1</span>;
     }

     <span class="attribute">#[inline]
     </span><span class="kw">fn </span>is_in_same_group(<span class="kw-2">&amp;</span><span class="self">self</span>, i: usize, new_i: usize, hash: u64) -&gt; bool {
         <span class="kw">let </span>probe_seq_pos = <span class="self">self</span>.probe_seq(hash).pos;
         <span class="kw">let </span>probe_index =
             |pos: usize| (pos.wrapping_sub(probe_seq_pos) &amp; <span class="self">self</span>.bucket_mask) / Group::WIDTH;
         probe_index(i) == probe_index(new_i)
     }

     <span class="doccomment">/// Sets a control byte to the hash, and possibly also the replicated control byte at
     /// the end of the array.
     </span><span class="attribute">#[inline]
     </span><span class="kw">unsafe fn </span>set_ctrl_h2(<span class="kw-2">&amp;</span><span class="self">self</span>, index: usize, hash: u64) {
         <span class="self">self</span>.set_ctrl(index, h2(hash));
     }

     <span class="attribute">#[inline]
     </span><span class="kw">unsafe fn </span>replace_ctrl_h2(<span class="kw-2">&amp;</span><span class="self">self</span>, index: usize, hash: u64) -&gt; u8 {
         <span class="kw">let </span>prev_ctrl = <span class="kw-2">*</span><span class="self">self</span>.ctrl(index);
         <span class="self">self</span>.set_ctrl_h2(index, hash);
         prev_ctrl
     }

     <span class="doccomment">/// Sets a control byte, and possibly also the replicated control byte at
     /// the end of the array.
     </span><span class="attribute">#[inline]
     </span><span class="kw">unsafe fn </span>set_ctrl(<span class="kw-2">&amp;</span><span class="self">self</span>, index: usize, ctrl: u8) {
         <span class="comment">// Replicate the first Group::WIDTH control bytes at the end of
         // the array without using a branch:
         // - If index &gt;= Group::WIDTH then index == index2.
         // - Otherwise index2 == self.bucket_mask + 1 + index.
         //
         // The very last replicated control byte is never actually read because
         // we mask the initial index for unaligned loads, but we write it
         // anyways because it makes the set_ctrl implementation simpler.
         //
         // If there are fewer buckets than Group::WIDTH then this code will
         // replicate the buckets at the end of the trailing group. For example
         // with 2 buckets and a group size of 4, the control bytes will look
         // like this:
         //
         //     Real    |             Replicated
         // ---------------------------------------------
         // | [A] | [B] | [EMPTY] | [EMPTY] | [A] | [B] |
         // ---------------------------------------------
         </span><span class="kw">let </span>index2 = ((index.wrapping_sub(Group::WIDTH)) &amp; <span class="self">self</span>.bucket_mask) + Group::WIDTH;

         <span class="kw-2">*</span><span class="self">self</span>.ctrl(index) = ctrl;
         <span class="kw-2">*</span><span class="self">self</span>.ctrl(index2) = ctrl;
     }

     <span class="doccomment">/// Returns a pointer to a control byte.
     </span><span class="attribute">#[inline]
     </span><span class="kw">unsafe fn </span>ctrl(<span class="kw-2">&amp;</span><span class="self">self</span>, index: usize) -&gt; <span class="kw-2">*mut </span>u8 {
         <span class="macro">debug_assert!</span>(index &lt; <span class="self">self</span>.num_ctrl_bytes());
         <span class="self">self</span>.ctrl.as_ptr().add(index)
     }

     <span class="attribute">#[inline]
     </span><span class="kw">fn </span>buckets(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
         <span class="self">self</span>.bucket_mask + <span class="number">1
     </span>}

     <span class="attribute">#[inline]
     </span><span class="kw">fn </span>num_ctrl_bytes(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
         <span class="self">self</span>.bucket_mask + <span class="number">1 </span>+ Group::WIDTH
     }

     <span class="attribute">#[inline]
     </span><span class="kw">fn </span>is_empty_singleton(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; bool {
         <span class="self">self</span>.bucket_mask == <span class="number">0
     </span>}

     <span class="attribute">#[allow(clippy::mut_mut)]
     #[inline]
     </span><span class="kw">unsafe fn </span>prepare_resize(
         <span class="kw-2">&amp;</span><span class="self">self</span>,
         table_layout: TableLayout,
         capacity: usize,
         fallibility: Fallibility,
     ) -&gt; <span class="prelude-ty">Result</span>&lt;<span class="kw">crate</span>::scopeguard::ScopeGuard&lt;<span class="self">Self</span>, <span class="kw">impl </span>FnMut(<span class="kw-2">&amp;mut </span><span class="self">Self</span>)&gt;, TryReserveError&gt; {
         <span class="macro">debug_assert!</span>(<span class="self">self</span>.items &lt;= capacity);

         <span class="comment">// Allocate and initialize the new table.
         </span><span class="kw">let </span><span class="kw-2">mut </span>new_table = RawTableInner::fallible_with_capacity(
             <span class="self">self</span>.alloc.clone(),
             table_layout,
             capacity,
             fallibility,
         )<span class="question-mark">?</span>;
         new_table.growth_left -= <span class="self">self</span>.items;
         new_table.items = <span class="self">self</span>.items;

         <span class="comment">// The hash function may panic, in which case we simply free the new
         // table without dropping any elements that may have been copied into
         // it.
         //
         // This guard is also used to free the old table on success, see
         // the comment at the bottom of this function.
         </span><span class="prelude-val">Ok</span>(guard(new_table, <span class="kw">move </span>|self_| {
             <span class="kw">if </span>!self_.is_empty_singleton() {
                 self_.free_buckets(table_layout);
             }
         }))
     }

     <span class="doccomment">/// Reserves or rehashes to make room for `additional` more elements.
     ///
     /// This uses dynamic dispatch to reduce the amount of
     /// code generated, but it is eliminated by LLVM optimizations when inlined.
     </span><span class="attribute">#[allow(clippy::inline_always)]
     #[inline(always)]
     </span><span class="kw">unsafe fn </span>reserve_rehash_inner(
         <span class="kw-2">&amp;mut </span><span class="self">self</span>,
         additional: usize,
         hasher: <span class="kw-2">&amp;</span><span class="kw">dyn </span>Fn(<span class="kw-2">&amp;mut </span><span class="self">Self</span>, usize) -&gt; u64,
         fallibility: Fallibility,
         layout: TableLayout,
         drop: <span class="prelude-ty">Option</span>&lt;<span class="kw">fn</span>(<span class="kw-2">*mut </span>u8)&gt;,
     ) -&gt; <span class="prelude-ty">Result</span>&lt;(), TryReserveError&gt; {
         <span class="comment">// Avoid `Option::ok_or_else` because it bloats LLVM IR.
         </span><span class="kw">let </span>new_items = <span class="kw">match </span><span class="self">self</span>.items.checked_add(additional) {
             <span class="prelude-val">Some</span>(new_items) =&gt; new_items,
             <span class="prelude-val">None </span>=&gt; <span class="kw">return </span><span class="prelude-val">Err</span>(fallibility.capacity_overflow()),
         };
         <span class="kw">let </span>full_capacity = bucket_mask_to_capacity(<span class="self">self</span>.bucket_mask);
         <span class="kw">if </span>new_items &lt;= full_capacity / <span class="number">2 </span>{
             <span class="comment">// Rehash in-place without re-allocating if we have plenty of spare
             // capacity that is locked up due to DELETED entries.
             </span><span class="self">self</span>.rehash_in_place(hasher, layout.size, drop);
             <span class="prelude-val">Ok</span>(())
         } <span class="kw">else </span>{
             <span class="comment">// Otherwise, conservatively resize to at least the next size up
             // to avoid churning deletes into frequent rehashes.
             </span><span class="self">self</span>.resize_inner(
                 usize::max(new_items, full_capacity + <span class="number">1</span>),
                 hasher,
                 fallibility,
                 layout,
             )
         }
     }

     <span class="doccomment">/// Allocates a new table of a different size and moves the contents of the
     /// current table into it.
     ///
     /// This uses dynamic dispatch to reduce the amount of
     /// code generated, but it is eliminated by LLVM optimizations when inlined.
     </span><span class="attribute">#[allow(clippy::inline_always)]
     #[inline(always)]
     </span><span class="kw">unsafe fn </span>resize_inner(
         <span class="kw-2">&amp;mut </span><span class="self">self</span>,
         capacity: usize,
         hasher: <span class="kw-2">&amp;</span><span class="kw">dyn </span>Fn(<span class="kw-2">&amp;mut </span><span class="self">Self</span>, usize) -&gt; u64,
         fallibility: Fallibility,
         layout: TableLayout,
     ) -&gt; <span class="prelude-ty">Result</span>&lt;(), TryReserveError&gt; {
         <span class="kw">let </span><span class="kw-2">mut </span>new_table = <span class="self">self</span>.prepare_resize(layout, capacity, fallibility)<span class="question-mark">?</span>;

         <span class="comment">// Copy all elements to the new table.
         </span><span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..<span class="self">self</span>.buckets() {
             <span class="kw">if </span>!is_full(<span class="kw-2">*</span><span class="self">self</span>.ctrl(i)) {
                 <span class="kw">continue</span>;
             }

             <span class="comment">// This may panic.
             </span><span class="kw">let </span>hash = hasher(<span class="self">self</span>, i);

             <span class="comment">// We can use a simpler version of insert() here since:
             // - there are no DELETED entries.
             // - we know there is enough space in the table.
             // - all elements are unique.
             </span><span class="kw">let </span>(index, <span class="kw">_</span>) = new_table.prepare_insert_slot(hash);

             ptr::copy_nonoverlapping(
                 <span class="self">self</span>.bucket_ptr(i, layout.size),
                 new_table.bucket_ptr(index, layout.size),
                 layout.size,
             );
         }

         <span class="comment">// We successfully copied all elements without panicking. Now replace
         // self with the new table. The old table will have its memory freed but
         // the items will not be dropped (since they have been moved into the
         // new table).
         </span>mem::swap(<span class="self">self</span>, <span class="kw-2">&amp;mut </span>new_table);

         <span class="prelude-val">Ok</span>(())
     }

     <span class="doccomment">/// Rehashes the contents of the table in place (i.e. without changing the
     /// allocation).
     ///
     /// If `hasher` panics then some the table&#39;s contents may be lost.
     ///
     /// This uses dynamic dispatch to reduce the amount of
     /// code generated, but it is eliminated by LLVM optimizations when inlined.
     </span><span class="attribute">#[allow(clippy::inline_always)]
     #[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline(always))]
     #[cfg_attr(not(feature = <span class="string">&quot;inline-more&quot;</span>), inline)]
     </span><span class="kw">unsafe fn </span>rehash_in_place(
         <span class="kw-2">&amp;mut </span><span class="self">self</span>,
         hasher: <span class="kw-2">&amp;</span><span class="kw">dyn </span>Fn(<span class="kw-2">&amp;mut </span><span class="self">Self</span>, usize) -&gt; u64,
         size_of: usize,
         drop: <span class="prelude-ty">Option</span>&lt;<span class="kw">fn</span>(<span class="kw-2">*mut </span>u8)&gt;,
     ) {
         <span class="comment">// If the hash function panics then properly clean up any elements
         // that we haven&#39;t rehashed yet. We unfortunately can&#39;t preserve the
         // element since we lost their hash and have no way of recovering it
         // without risking another panic.
         </span><span class="self">self</span>.prepare_rehash_in_place();

         <span class="kw">let </span><span class="kw-2">mut </span>guard = guard(<span class="self">self</span>, <span class="kw">move </span>|self_| {
             <span class="kw">if let </span><span class="prelude-val">Some</span>(drop) = drop {
                 <span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..self_.buckets() {
                     <span class="kw">if </span><span class="kw-2">*</span>self_.ctrl(i) == DELETED {
                         self_.set_ctrl(i, EMPTY);
                         drop(self_.bucket_ptr(i, size_of));
                         self_.items -= <span class="number">1</span>;
                     }
                 }
             }
             self_.growth_left = bucket_mask_to_capacity(self_.bucket_mask) - self_.items;
         });

         <span class="comment">// At this point, DELETED elements are elements that we haven&#39;t
         // rehashed yet. Find them and re-insert them at their ideal
         // position.
         </span><span class="lifetime">&#39;outer</span>: <span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..guard.buckets() {
             <span class="kw">if </span><span class="kw-2">*</span>guard.ctrl(i) != DELETED {
                 <span class="kw">continue</span>;
             }

             <span class="kw">let </span>i_p = guard.bucket_ptr(i, size_of);

             <span class="lifetime">&#39;inner</span>: <span class="kw">loop </span>{
                 <span class="comment">// Hash the current item
                 </span><span class="kw">let </span>hash = hasher(<span class="kw-2">*</span>guard, i);

                 <span class="comment">// Search for a suitable place to put it
                 </span><span class="kw">let </span>new_i = guard.find_insert_slot(hash);
                 <span class="kw">let </span>new_i_p = guard.bucket_ptr(new_i, size_of);

                 <span class="comment">// Probing works by scanning through all of the control
                 // bytes in groups, which may not be aligned to the group
                 // size. If both the new and old position fall within the
                 // same unaligned group, then there is no benefit in moving
                 // it and we can just continue to the next item.
                 </span><span class="kw">if </span>likely(guard.is_in_same_group(i, new_i, hash)) {
                     guard.set_ctrl_h2(i, hash);
                     <span class="kw">continue </span><span class="lifetime">&#39;outer</span>;
                 }

                 <span class="comment">// We are moving the current item to a new position. Write
                 // our H2 to the control byte of the new position.
                 </span><span class="kw">let </span>prev_ctrl = guard.replace_ctrl_h2(new_i, hash);
                 <span class="kw">if </span>prev_ctrl == EMPTY {
                     guard.set_ctrl(i, EMPTY);
                     <span class="comment">// If the target slot is empty, simply move the current
                     // element into the new slot and clear the old control
                     // byte.
                     </span>ptr::copy_nonoverlapping(i_p, new_i_p, size_of);
                     <span class="kw">continue </span><span class="lifetime">&#39;outer</span>;
                 } <span class="kw">else </span>{
                     <span class="comment">// If the target slot is occupied, swap the two elements
                     // and then continue processing the element that we just
                     // swapped into the old slot.
                     </span><span class="macro">debug_assert_eq!</span>(prev_ctrl, DELETED);
                     ptr::swap_nonoverlapping(i_p, new_i_p, size_of);
                     <span class="kw">continue </span><span class="lifetime">&#39;inner</span>;
                 }
             }
         }

         guard.growth_left = bucket_mask_to_capacity(guard.bucket_mask) - guard.items;

         mem::forget(guard);
     }

     <span class="attribute">#[inline]
     </span><span class="kw">unsafe fn </span>free_buckets(<span class="kw-2">&amp;mut </span><span class="self">self</span>, table_layout: TableLayout) {
         <span class="comment">// Avoid `Option::unwrap_or_else` because it bloats LLVM IR.
         </span><span class="kw">let </span>(layout, ctrl_offset) = <span class="kw">match </span>table_layout.calculate_layout_for(<span class="self">self</span>.buckets()) {
             <span class="prelude-val">Some</span>(lco) =&gt; lco,
             <span class="prelude-val">None </span>=&gt; hint::unreachable_unchecked(),
         };
         <span class="self">self</span>.alloc.deallocate(
             NonNull::new_unchecked(<span class="self">self</span>.ctrl.as_ptr().sub(ctrl_offset)),
             layout,
         );
     }

     <span class="doccomment">/// Marks all table buckets as empty without dropping their contents.
     </span><span class="attribute">#[inline]
     </span><span class="kw">fn </span>clear_no_drop(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
         <span class="kw">if </span>!<span class="self">self</span>.is_empty_singleton() {
             <span class="kw">unsafe </span>{
                 <span class="self">self</span>.ctrl(<span class="number">0</span>).write_bytes(EMPTY, <span class="self">self</span>.num_ctrl_bytes());
             }
         }
         <span class="self">self</span>.items = <span class="number">0</span>;
         <span class="self">self</span>.growth_left = bucket_mask_to_capacity(<span class="self">self</span>.bucket_mask);
     }

     <span class="attribute">#[inline]
     </span><span class="kw">unsafe fn </span>erase(<span class="kw-2">&amp;mut </span><span class="self">self</span>, index: usize) {
         <span class="macro">debug_assert!</span>(is_full(<span class="kw-2">*</span><span class="self">self</span>.ctrl(index)));
         <span class="kw">let </span>index_before = index.wrapping_sub(Group::WIDTH) &amp; <span class="self">self</span>.bucket_mask;
         <span class="kw">let </span>empty_before = Group::load(<span class="self">self</span>.ctrl(index_before)).match_empty();
         <span class="kw">let </span>empty_after = Group::load(<span class="self">self</span>.ctrl(index)).match_empty();

         <span class="comment">// If we are inside a continuous block of Group::WIDTH full or deleted
         // cells then a probe window may have seen a full block when trying to
         // insert. We therefore need to keep that block non-empty so that
         // lookups will continue searching to the next probe window.
         //
         // Note that in this context `leading_zeros` refers to the bytes at the
         // end of a group, while `trailing_zeros` refers to the bytes at the
         // beginning of a group.
         </span><span class="kw">let </span>ctrl = <span class="kw">if </span>empty_before.leading_zeros() + empty_after.trailing_zeros() &gt;= Group::WIDTH {
             DELETED
         } <span class="kw">else </span>{
             <span class="self">self</span>.growth_left += <span class="number">1</span>;
             EMPTY
         };
         <span class="self">self</span>.set_ctrl(index, ctrl);
         <span class="self">self</span>.items -= <span class="number">1</span>;
     }
 }

 <span class="kw">impl</span>&lt;T: Clone, A: Allocator + Clone&gt; Clone <span class="kw">for </span>RawTable&lt;T, A&gt; {
     <span class="kw">fn </span>clone(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="self">Self </span>{
         <span class="kw">if </span><span class="self">self</span>.table.is_empty_singleton() {
             <span class="self">Self</span>::new_in(<span class="self">self</span>.table.alloc.clone())
         } <span class="kw">else </span>{
             <span class="kw">unsafe </span>{
                 <span class="comment">// Avoid `Result::ok_or_else` because it bloats LLVM IR.
                 </span><span class="kw">let </span>new_table = <span class="kw">match </span><span class="self">Self</span>::new_uninitialized(
                     <span class="self">self</span>.table.alloc.clone(),
                     <span class="self">self</span>.table.buckets(),
                     Fallibility::Infallible,
                 ) {
                     <span class="prelude-val">Ok</span>(table) =&gt; table,
                     <span class="prelude-val">Err</span>(<span class="kw">_</span>) =&gt; hint::unreachable_unchecked(),
                 };

                 <span class="comment">// If cloning fails then we need to free the allocation for the
                 // new table. However we don&#39;t run its drop since its control
                 // bytes are not initialized yet.
                 </span><span class="kw">let </span><span class="kw-2">mut </span>guard = guard(ManuallyDrop::new(new_table), |new_table| {
                     new_table.free_buckets();
                 });

                 guard.clone_from_spec(<span class="self">self</span>);

                 <span class="comment">// Disarm the scope guard and return the newly created table.
                 </span>ManuallyDrop::into_inner(ScopeGuard::into_inner(guard))
             }
         }
     }

     <span class="kw">fn </span>clone_from(<span class="kw-2">&amp;mut </span><span class="self">self</span>, source: <span class="kw-2">&amp;</span><span class="self">Self</span>) {
         <span class="kw">if </span>source.table.is_empty_singleton() {
             <span class="kw-2">*</span><span class="self">self </span>= <span class="self">Self</span>::new_in(<span class="self">self</span>.table.alloc.clone());
         } <span class="kw">else </span>{
             <span class="kw">unsafe </span>{
                 <span class="comment">// Make sure that if any panics occurs, we clear the table and
                 // leave it in an empty state.
                 </span><span class="kw">let </span><span class="kw-2">mut </span>self_ = guard(<span class="self">self</span>, |self_| {
                     self_.clear_no_drop();
                 });

                 <span class="comment">// First, drop all our elements without clearing the control
                 // bytes. If this panics then the scope guard will clear the
                 // table, leaking any elements that were not dropped yet.
                 //
                 // This leak is unavoidable: we can&#39;t try dropping more elements
                 // since this could lead to another panic and abort the process.
                 </span>self_.drop_elements();

                 <span class="comment">// If necessary, resize our table to match the source.
                 </span><span class="kw">if </span>self_.buckets() != source.buckets() {
                     <span class="comment">// Skip our drop by using ptr::write.
                     </span><span class="kw">if </span>!self_.table.is_empty_singleton() {
                         self_.free_buckets();
                     }
                     (<span class="kw-2">&amp;mut **</span>self_ <span class="kw">as </span><span class="kw-2">*mut </span><span class="self">Self</span>).write(
                         <span class="comment">// Avoid `Result::unwrap_or_else` because it bloats LLVM IR.
                         </span><span class="kw">match </span><span class="self">Self</span>::new_uninitialized(
                             self_.table.alloc.clone(),
                             source.buckets(),
                             Fallibility::Infallible,
                         ) {
                             <span class="prelude-val">Ok</span>(table) =&gt; table,
                             <span class="prelude-val">Err</span>(<span class="kw">_</span>) =&gt; hint::unreachable_unchecked(),
                         },
                     );
                 }

                 self_.clone_from_spec(source);

                 <span class="comment">// Disarm the scope guard if cloning was successful.
                 </span>ScopeGuard::into_inner(self_);
             }
         }
     }
 }

 <span class="doccomment">/// Specialization of `clone_from` for `Copy` types
 </span><span class="kw">trait </span>RawTableClone {
     <span class="kw">unsafe fn </span>clone_from_spec(<span class="kw-2">&amp;mut </span><span class="self">self</span>, source: <span class="kw-2">&amp;</span><span class="self">Self</span>);
 }
 <span class="kw">impl</span>&lt;T: Clone, A: Allocator + Clone&gt; RawTableClone <span class="kw">for </span>RawTable&lt;T, A&gt; {
     <span class="macro">default_fn! </span>{
         <span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
         </span><span class="kw">unsafe fn </span>clone_from_spec(<span class="kw-2">&amp;mut </span><span class="self">self</span>, source: <span class="kw-2">&amp;</span><span class="self">Self</span>) {
             <span class="self">self</span>.clone_from_impl(source);
         }
     }
 }
 <span class="attribute">#[cfg(feature = <span class="string">&quot;nightly&quot;</span>)]
 </span><span class="kw">impl</span>&lt;T: Copy, A: Allocator + Clone&gt; RawTableClone <span class="kw">for </span>RawTable&lt;T, A&gt; {
     <span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">unsafe fn </span>clone_from_spec(<span class="kw-2">&amp;mut </span><span class="self">self</span>, source: <span class="kw-2">&amp;</span><span class="self">Self</span>) {
         source
             .table
             .ctrl(<span class="number">0</span>)
             .copy_to_nonoverlapping(<span class="self">self</span>.table.ctrl(<span class="number">0</span>), <span class="self">self</span>.table.num_ctrl_bytes());
         source
             .data_start()
             .copy_to_nonoverlapping(<span class="self">self</span>.data_start(), <span class="self">self</span>.table.buckets());

         <span class="self">self</span>.table.items = source.table.items;
         <span class="self">self</span>.table.growth_left = source.table.growth_left;
     }
 }

 <span class="kw">impl</span>&lt;T: Clone, A: Allocator + Clone&gt; RawTable&lt;T, A&gt; {
     <span class="doccomment">/// Common code for clone and clone_from. Assumes:
     /// - `self.buckets() == source.buckets()`.
     /// - Any existing elements have been dropped.
     /// - The control bytes are not initialized yet.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">unsafe fn </span>clone_from_impl(<span class="kw-2">&amp;mut </span><span class="self">self</span>, source: <span class="kw-2">&amp;</span><span class="self">Self</span>) {
         <span class="comment">// Copy the control bytes unchanged. We do this in a single pass
         </span>source
             .table
             .ctrl(<span class="number">0</span>)
             .copy_to_nonoverlapping(<span class="self">self</span>.table.ctrl(<span class="number">0</span>), <span class="self">self</span>.table.num_ctrl_bytes());

         <span class="comment">// The cloning of elements may panic, in which case we need
         // to make sure we drop only the elements that have been
         // cloned so far.
         </span><span class="kw">let </span><span class="kw-2">mut </span>guard = guard((<span class="number">0</span>, <span class="kw-2">&amp;mut *</span><span class="self">self</span>), |(index, self_)| {
             <span class="kw">if </span>mem::needs_drop::&lt;T&gt;() &amp;&amp; !self_.is_empty() {
                 <span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..=<span class="kw-2">*</span>index {
                     <span class="kw">if </span>is_full(<span class="kw-2">*</span>self_.table.ctrl(i)) {
                         self_.bucket(i).drop();
                     }
                 }
             }
         });

         <span class="kw">for </span>from <span class="kw">in </span>source.iter() {
             <span class="kw">let </span>index = source.bucket_index(<span class="kw-2">&amp;</span>from);
             <span class="kw">let </span>to = guard.<span class="number">1</span>.bucket(index);
             to.write(from.as_ref().clone());

             <span class="comment">// Update the index in case we need to unwind.
             </span>guard.<span class="number">0 </span>= index;
         }

         <span class="comment">// Successfully cloned all items, no need to clean up.
         </span>mem::forget(guard);

         <span class="self">self</span>.table.items = source.table.items;
         <span class="self">self</span>.table.growth_left = source.table.growth_left;
     }

     <span class="doccomment">/// Variant of `clone_from` to use when a hasher is available.
     </span><span class="attribute">#[cfg(feature = <span class="string">&quot;raw&quot;</span>)]
     </span><span class="kw">pub fn </span>clone_from_with_hasher(<span class="kw-2">&amp;mut </span><span class="self">self</span>, source: <span class="kw-2">&amp;</span><span class="self">Self</span>, hasher: <span class="kw">impl </span>Fn(<span class="kw-2">&amp;</span>T) -&gt; u64) {
         <span class="comment">// If we have enough capacity in the table, just clear it and insert
         // elements one by one. We don&#39;t do this if we have the same number of
         // buckets as the source since we can just copy the contents directly
         // in that case.
         </span><span class="kw">if </span><span class="self">self</span>.table.buckets() != source.table.buckets()
             &amp;&amp; bucket_mask_to_capacity(<span class="self">self</span>.table.bucket_mask) &gt;= source.len()
         {
             <span class="self">self</span>.clear();

             <span class="kw">let </span>guard_self = guard(<span class="kw-2">&amp;mut *</span><span class="self">self</span>, |self_| {
                 <span class="comment">// Clear the partially copied table if a panic occurs, otherwise
                 // items and growth_left will be out of sync with the contents
                 // of the table.
                 </span>self_.clear();
             });

             <span class="kw">unsafe </span>{
                 <span class="kw">for </span>item <span class="kw">in </span>source.iter() {
                     <span class="comment">// This may panic.
                     </span><span class="kw">let </span>item = item.as_ref().clone();
                     <span class="kw">let </span>hash = hasher(<span class="kw-2">&amp;</span>item);

                     <span class="comment">// We can use a simpler version of insert() here since:
                     // - there are no DELETED entries.
                     // - we know there is enough space in the table.
                     // - all elements are unique.
                     </span><span class="kw">let </span>(index, <span class="kw">_</span>) = guard_self.table.prepare_insert_slot(hash);
                     guard_self.bucket(index).write(item);
                 }
             }

             <span class="comment">// Successfully cloned all items, no need to clean up.
             </span>mem::forget(guard_self);

             <span class="self">self</span>.table.items = source.table.items;
             <span class="self">self</span>.table.growth_left -= source.table.items;
         } <span class="kw">else </span>{
             <span class="self">self</span>.clone_from(source);
         }
     }
 }

 <span class="kw">impl</span>&lt;T, A: Allocator + Clone + Default&gt; Default <span class="kw">for </span>RawTable&lt;T, A&gt; {
     <span class="attribute">#[inline]
     </span><span class="kw">fn </span>default() -&gt; <span class="self">Self </span>{
         <span class="self">Self</span>::new_in(Default::default())
     }
 }

 <span class="attribute">#[cfg(feature = <span class="string">&quot;nightly&quot;</span>)]
 </span><span class="kw">unsafe impl</span>&lt;<span class="attribute">#[may_dangle] </span>T, A: Allocator + Clone&gt; Drop <span class="kw">for </span>RawTable&lt;T, A&gt; {
     <span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">fn </span>drop(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
         <span class="kw">if </span>!<span class="self">self</span>.table.is_empty_singleton() {
             <span class="kw">unsafe </span>{
                 <span class="self">self</span>.drop_elements();
                 <span class="self">self</span>.free_buckets();
             }
         }
     }
 }
 <span class="attribute">#[cfg(not(feature = <span class="string">&quot;nightly&quot;</span>))]
 </span><span class="kw">impl</span>&lt;T, A: Allocator + Clone&gt; Drop <span class="kw">for </span>RawTable&lt;T, A&gt; {
     <span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">fn </span>drop(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
         <span class="kw">if </span>!<span class="self">self</span>.table.is_empty_singleton() {
             <span class="kw">unsafe </span>{
                 <span class="self">self</span>.drop_elements();
                 <span class="self">self</span>.free_buckets();
             }
         }
     }
 }

 <span class="kw">impl</span>&lt;T, A: Allocator + Clone&gt; IntoIterator <span class="kw">for </span>RawTable&lt;T, A&gt; {
     <span class="kw">type </span>Item = T;
     <span class="kw">type </span>IntoIter = RawIntoIter&lt;T, A&gt;;

     <span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">fn </span>into_iter(<span class="self">self</span>) -&gt; RawIntoIter&lt;T, A&gt; {
         <span class="kw">unsafe </span>{
             <span class="kw">let </span>iter = <span class="self">self</span>.iter();
             <span class="self">self</span>.into_iter_from(iter)
         }
     }
 }

 <span class="doccomment">/// Iterator over a sub-range of a table. Unlike `RawIter` this iterator does
 /// not track an item count.
 </span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">struct </span>RawIterRange&lt;T&gt; {
     <span class="comment">// Mask of full buckets in the current group. Bits are cleared from this
     // mask as each element is processed.
     </span>current_group: BitMask,

     <span class="comment">// Pointer to the buckets for the current group.
     </span>data: Bucket&lt;T&gt;,

     <span class="comment">// Pointer to the next group of control bytes,
     // Must be aligned to the group size.
     </span>next_ctrl: <span class="kw-2">*const </span>u8,

     <span class="comment">// Pointer one past the last control byte of this range.
     </span>end: <span class="kw-2">*const </span>u8,
 }

 <span class="kw">impl</span>&lt;T&gt; RawIterRange&lt;T&gt; {
     <span class="doccomment">/// Returns a `RawIterRange` covering a subset of a table.
     ///
     /// The control byte address must be aligned to the group size.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">unsafe fn </span>new(ctrl: <span class="kw-2">*const </span>u8, data: Bucket&lt;T&gt;, len: usize) -&gt; <span class="self">Self </span>{
         <span class="macro">debug_assert_ne!</span>(len, <span class="number">0</span>);
         <span class="macro">debug_assert_eq!</span>(ctrl <span class="kw">as </span>usize % Group::WIDTH, <span class="number">0</span>);
         <span class="kw">let </span>end = ctrl.add(len);

         <span class="comment">// Load the first group and advance ctrl to point to the next group
         </span><span class="kw">let </span>current_group = Group::load_aligned(ctrl).match_full();
         <span class="kw">let </span>next_ctrl = ctrl.add(Group::WIDTH);

         <span class="self">Self </span>{
             current_group,
             data,
             next_ctrl,
             end,
         }
     }

     <span class="doccomment">/// Splits a `RawIterRange` into two halves.
     ///
     /// Returns `None` if the remaining range is smaller than or equal to the
     /// group width.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     #[cfg(feature = <span class="string">&quot;rayon&quot;</span>)]
     </span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>split(<span class="kw-2">mut </span><span class="self">self</span>) -&gt; (<span class="self">Self</span>, <span class="prelude-ty">Option</span>&lt;RawIterRange&lt;T&gt;&gt;) {
         <span class="kw">unsafe </span>{
             <span class="kw">if </span><span class="self">self</span>.end &lt;= <span class="self">self</span>.next_ctrl {
                 <span class="comment">// Nothing to split if the group that we are current processing
                 // is the last one.
                 </span>(<span class="self">self</span>, <span class="prelude-val">None</span>)
             } <span class="kw">else </span>{
                 <span class="comment">// len is the remaining number of elements after the group that
                 // we are currently processing. It must be a multiple of the
                 // group size (small tables are caught by the check above).
                 </span><span class="kw">let </span>len = offset_from(<span class="self">self</span>.end, <span class="self">self</span>.next_ctrl);
                 <span class="macro">debug_assert_eq!</span>(len % Group::WIDTH, <span class="number">0</span>);

                 <span class="comment">// Split the remaining elements into two halves, but round the
                 // midpoint down in case there is an odd number of groups
                 // remaining. This ensures that:
                 // - The tail is at least 1 group long.
                 // - The split is roughly even considering we still have the
                 //   current group to process.
                 </span><span class="kw">let </span>mid = (len / <span class="number">2</span>) &amp; !(Group::WIDTH - <span class="number">1</span>);

                 <span class="kw">let </span>tail = <span class="self">Self</span>::new(
                     <span class="self">self</span>.next_ctrl.add(mid),
                     <span class="self">self</span>.data.next_n(Group::WIDTH).next_n(mid),
                     len - mid,
                 );
                 <span class="macro">debug_assert_eq!</span>(
                     <span class="self">self</span>.data.next_n(Group::WIDTH).next_n(mid).ptr,
                     tail.data.ptr
                 );
                 <span class="macro">debug_assert_eq!</span>(<span class="self">self</span>.end, tail.end);
                 <span class="self">self</span>.end = <span class="self">self</span>.next_ctrl.add(mid);
                 <span class="macro">debug_assert_eq!</span>(<span class="self">self</span>.end.add(Group::WIDTH), tail.next_ctrl);
                 (<span class="self">self</span>, <span class="prelude-val">Some</span>(tail))
             }
         }
     }

     <span class="doccomment">/// # Safety
     /// If DO_CHECK_PTR_RANGE is false, caller must ensure that we never try to iterate
     /// after yielding all elements.
     </span><span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">unsafe fn </span>next_impl&lt;<span class="kw">const </span>DO_CHECK_PTR_RANGE: bool&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;Bucket&lt;T&gt;&gt; {
         <span class="kw">loop </span>{
             <span class="kw">if let </span><span class="prelude-val">Some</span>(index) = <span class="self">self</span>.current_group.lowest_set_bit() {
                 <span class="self">self</span>.current_group = <span class="self">self</span>.current_group.remove_lowest_bit();
                 <span class="kw">return </span><span class="prelude-val">Some</span>(<span class="self">self</span>.data.next_n(index));
             }

             <span class="kw">if </span>DO_CHECK_PTR_RANGE &amp;&amp; <span class="self">self</span>.next_ctrl &gt;= <span class="self">self</span>.end {
                 <span class="kw">return </span><span class="prelude-val">None</span>;
             }

             <span class="comment">// We might read past self.end up to the next group boundary,
             // but this is fine because it only occurs on tables smaller
             // than the group size where the trailing control bytes are all
             // EMPTY. On larger tables self.end is guaranteed to be aligned
             // to the group size (since tables are power-of-two sized).
             </span><span class="self">self</span>.current_group = Group::load_aligned(<span class="self">self</span>.next_ctrl).match_full();
             <span class="self">self</span>.data = <span class="self">self</span>.data.next_n(Group::WIDTH);
             <span class="self">self</span>.next_ctrl = <span class="self">self</span>.next_ctrl.add(Group::WIDTH);
         }
     }
 }

 <span class="comment">// We make raw iterators unconditionally Send and Sync, and let the PhantomData
 // in the actual iterator implementations determine the real Send/Sync bounds.
 </span><span class="kw">unsafe impl</span>&lt;T&gt; Send <span class="kw">for </span>RawIterRange&lt;T&gt; {}
 <span class="kw">unsafe impl</span>&lt;T&gt; Sync <span class="kw">for </span>RawIterRange&lt;T&gt; {}

 <span class="kw">impl</span>&lt;T&gt; Clone <span class="kw">for </span>RawIterRange&lt;T&gt; {
     <span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">fn </span>clone(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="self">Self </span>{
         <span class="self">Self </span>{
             data: <span class="self">self</span>.data.clone(),
             next_ctrl: <span class="self">self</span>.next_ctrl,
             current_group: <span class="self">self</span>.current_group,
             end: <span class="self">self</span>.end,
         }
     }
 }

 <span class="kw">impl</span>&lt;T&gt; Iterator <span class="kw">for </span>RawIterRange&lt;T&gt; {
     <span class="kw">type </span>Item = Bucket&lt;T&gt;;

     <span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;Bucket&lt;T&gt;&gt; {
         <span class="kw">unsafe </span>{
             <span class="comment">// SAFETY: We set checker flag to true.
             </span><span class="self">self</span>.next_impl::&lt;<span class="bool-val">true</span>&gt;()
         }
     }

     <span class="attribute">#[inline]
     </span><span class="kw">fn </span>size_hint(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; (usize, <span class="prelude-ty">Option</span>&lt;usize&gt;) {
         <span class="comment">// We don&#39;t have an item count, so just guess based on the range size.
         </span><span class="kw">let </span>remaining_buckets = <span class="kw">if </span><span class="self">self</span>.end &gt; <span class="self">self</span>.next_ctrl {
             <span class="kw">unsafe </span>{ offset_from(<span class="self">self</span>.end, <span class="self">self</span>.next_ctrl) }
         } <span class="kw">else </span>{
             <span class="number">0
         </span>};

         <span class="comment">// Add a group width to include the group we are currently processing.
         </span>(<span class="number">0</span>, <span class="prelude-val">Some</span>(Group::WIDTH + remaining_buckets))
     }
 }

 <span class="kw">impl</span>&lt;T&gt; FusedIterator <span class="kw">for </span>RawIterRange&lt;T&gt; {}

 <span class="doccomment">/// Iterator which returns a raw pointer to every full bucket in the table.
 ///
 /// For maximum flexibility this iterator is not bound by a lifetime, but you
 /// must observe several rules when using it:
 /// - You must not free the hash table while iterating (including via growing/shrinking).
 /// - It is fine to erase a bucket that has been yielded by the iterator.
 /// - Erasing a bucket that has not yet been yielded by the iterator may still
 ///   result in the iterator yielding that bucket (unless `reflect_remove` is called).
 /// - It is unspecified whether an element inserted after the iterator was
 ///   created will be yielded by that iterator (unless `reflect_insert` is called).
 /// - The order in which the iterator yields bucket is unspecified and may
 ///   change in the future.
 </span><span class="kw">pub struct </span>RawIter&lt;T&gt; {
     <span class="kw">pub</span>(<span class="kw">crate</span>) iter: RawIterRange&lt;T&gt;,
     items: usize,
 }

 <span class="kw">impl</span>&lt;T&gt; RawIter&lt;T&gt; {
     <span class="doccomment">/// Refresh the iterator so that it reflects a removal from the given bucket.
     ///
     /// For the iterator to remain valid, this method must be called once
     /// for each removed bucket before `next` is called again.
     ///
     /// This method should be called _before_ the removal is made. It is not necessary to call this
     /// method if you are removing an item that this iterator yielded in the past.
     </span><span class="attribute">#[cfg(feature = <span class="string">&quot;raw&quot;</span>)]
     </span><span class="kw">pub fn </span>reflect_remove(<span class="kw-2">&amp;mut </span><span class="self">self</span>, b: <span class="kw-2">&amp;</span>Bucket&lt;T&gt;) {
         <span class="self">self</span>.reflect_toggle_full(b, <span class="bool-val">false</span>);
     }

     <span class="doccomment">/// Refresh the iterator so that it reflects an insertion into the given bucket.
     ///
     /// For the iterator to remain valid, this method must be called once
     /// for each insert before `next` is called again.
     ///
     /// This method does not guarantee that an insertion of a bucket with a greater
     /// index than the last one yielded will be reflected in the iterator.
     ///
     /// This method should be called _after_ the given insert is made.
     </span><span class="attribute">#[cfg(feature = <span class="string">&quot;raw&quot;</span>)]
     </span><span class="kw">pub fn </span>reflect_insert(<span class="kw-2">&amp;mut </span><span class="self">self</span>, b: <span class="kw-2">&amp;</span>Bucket&lt;T&gt;) {
         <span class="self">self</span>.reflect_toggle_full(b, <span class="bool-val">true</span>);
     }

     <span class="doccomment">/// Refresh the iterator so that it reflects a change to the state of the given bucket.
     </span><span class="attribute">#[cfg(feature = <span class="string">&quot;raw&quot;</span>)]
     </span><span class="kw">fn </span>reflect_toggle_full(<span class="kw-2">&amp;mut </span><span class="self">self</span>, b: <span class="kw-2">&amp;</span>Bucket&lt;T&gt;, is_insert: bool) {
         <span class="kw">unsafe </span>{
             <span class="kw">if </span>b.as_ptr() &gt; <span class="self">self</span>.iter.data.as_ptr() {
                 <span class="comment">// The iterator has already passed the bucket&#39;s group.
                 // So the toggle isn&#39;t relevant to this iterator.
                 </span><span class="kw">return</span>;
             }

             <span class="kw">if </span><span class="self">self</span>.iter.next_ctrl &lt; <span class="self">self</span>.iter.end
                 &amp;&amp; b.as_ptr() &lt;= <span class="self">self</span>.iter.data.next_n(Group::WIDTH).as_ptr()
             {
                 <span class="comment">// The iterator has not yet reached the bucket&#39;s group.
                 // We don&#39;t need to reload anything, but we do need to adjust the item count.

                 </span><span class="kw">if </span><span class="macro">cfg!</span>(debug_assertions) {
                     <span class="comment">// Double-check that the user isn&#39;t lying to us by checking the bucket state.
                     // To do that, we need to find its control byte. We know that self.iter.data is
                     // at self.iter.next_ctrl - Group::WIDTH, so we work from there:
                     </span><span class="kw">let </span>offset = offset_from(<span class="self">self</span>.iter.data.as_ptr(), b.as_ptr());
                     <span class="kw">let </span>ctrl = <span class="self">self</span>.iter.next_ctrl.sub(Group::WIDTH).add(offset);
                     <span class="comment">// This method should be called _before_ a removal, or _after_ an insert,
                     // so in both cases the ctrl byte should indicate that the bucket is full.
                     </span><span class="macro">assert!</span>(is_full(<span class="kw-2">*</span>ctrl));
                 }

                 <span class="kw">if </span>is_insert {
                     <span class="self">self</span>.items += <span class="number">1</span>;
                 } <span class="kw">else </span>{
                     <span class="self">self</span>.items -= <span class="number">1</span>;
                 }

                 <span class="kw">return</span>;
             }

             <span class="comment">// The iterator is at the bucket group that the toggled bucket is in.
             // We need to do two things:
             //
             //  - Determine if the iterator already yielded the toggled bucket.
             //    If it did, we&#39;re done.
             //  - Otherwise, update the iterator cached group so that it won&#39;t
             //    yield a to-be-removed bucket, or _will_ yield a to-be-added bucket.
             //    We&#39;ll also need to update the item count accordingly.
             </span><span class="kw">if let </span><span class="prelude-val">Some</span>(index) = <span class="self">self</span>.iter.current_group.lowest_set_bit() {
                 <span class="kw">let </span>next_bucket = <span class="self">self</span>.iter.data.next_n(index);
                 <span class="kw">if </span>b.as_ptr() &gt; next_bucket.as_ptr() {
                     <span class="comment">// The toggled bucket is &quot;before&quot; the bucket the iterator would yield next. We
                     // therefore don&#39;t need to do anything --- the iterator has already passed the
                     // bucket in question.
                     //
                     // The item count must already be correct, since a removal or insert &quot;prior&quot; to
                     // the iterator&#39;s position wouldn&#39;t affect the item count.
                 </span>} <span class="kw">else </span>{
                     <span class="comment">// The removed bucket is an upcoming bucket. We need to make sure it does _not_
                     // get yielded, and also that it&#39;s no longer included in the item count.
                     //
                     // NOTE: We can&#39;t just reload the group here, both since that might reflect
                     // inserts we&#39;ve already passed, and because that might inadvertently unset the
                     // bits for _other_ removals. If we do that, we&#39;d have to also decrement the
                     // item count for those other bits that we unset. But the presumably subsequent
                     // call to reflect for those buckets might _also_ decrement the item count.
                     // Instead, we _just_ flip the bit for the particular bucket the caller asked
                     // us to reflect.
                     </span><span class="kw">let </span>our_bit = offset_from(<span class="self">self</span>.iter.data.as_ptr(), b.as_ptr());
                     <span class="kw">let </span>was_full = <span class="self">self</span>.iter.current_group.flip(our_bit);
                     <span class="macro">debug_assert_ne!</span>(was_full, is_insert);

                     <span class="kw">if </span>is_insert {
                         <span class="self">self</span>.items += <span class="number">1</span>;
                     } <span class="kw">else </span>{
                         <span class="self">self</span>.items -= <span class="number">1</span>;
                     }

                     <span class="kw">if </span><span class="macro">cfg!</span>(debug_assertions) {
                         <span class="kw">if </span>b.as_ptr() == next_bucket.as_ptr() {
                             <span class="comment">// The removed bucket should no longer be next
                             </span><span class="macro">debug_assert_ne!</span>(<span class="self">self</span>.iter.current_group.lowest_set_bit(), <span class="prelude-val">Some</span>(index));
                         } <span class="kw">else </span>{
                             <span class="comment">// We should not have changed what bucket comes next.
                             </span><span class="macro">debug_assert_eq!</span>(<span class="self">self</span>.iter.current_group.lowest_set_bit(), <span class="prelude-val">Some</span>(index));
                         }
                     }
                 }
             } <span class="kw">else </span>{
                 <span class="comment">// We must have already iterated past the removed item.
             </span>}
         }
     }

     <span class="kw">unsafe fn </span>drop_elements(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
         <span class="kw">if </span>mem::needs_drop::&lt;T&gt;() &amp;&amp; <span class="self">self</span>.len() != <span class="number">0 </span>{
             <span class="kw">for </span>item <span class="kw">in </span><span class="self">self </span>{
                 item.drop();
             }
         }
     }
 }

 <span class="kw">impl</span>&lt;T&gt; Clone <span class="kw">for </span>RawIter&lt;T&gt; {
     <span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">fn </span>clone(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="self">Self </span>{
         <span class="self">Self </span>{
             iter: <span class="self">self</span>.iter.clone(),
             items: <span class="self">self</span>.items,
         }
     }
 }

 <span class="kw">impl</span>&lt;T&gt; Iterator <span class="kw">for </span>RawIter&lt;T&gt; {
     <span class="kw">type </span>Item = Bucket&lt;T&gt;;

     <span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;Bucket&lt;T&gt;&gt; {
         <span class="comment">// Inner iterator iterates over buckets
         // so it can do unnecessary work if we already yielded all items.
         </span><span class="kw">if </span><span class="self">self</span>.items == <span class="number">0 </span>{
             <span class="kw">return </span><span class="prelude-val">None</span>;
         }

         <span class="kw">let </span>nxt = <span class="kw">unsafe </span>{
             <span class="comment">// SAFETY: We check number of items to yield using `items` field.
             </span><span class="self">self</span>.iter.next_impl::&lt;<span class="bool-val">false</span>&gt;()
         };

         <span class="kw">if </span>nxt.is_some() {
             <span class="self">self</span>.items -= <span class="number">1</span>;
         }

         nxt
     }

     <span class="attribute">#[inline]
     </span><span class="kw">fn </span>size_hint(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; (usize, <span class="prelude-ty">Option</span>&lt;usize&gt;) {
         (<span class="self">self</span>.items, <span class="prelude-val">Some</span>(<span class="self">self</span>.items))
     }
 }

 <span class="kw">impl</span>&lt;T&gt; ExactSizeIterator <span class="kw">for </span>RawIter&lt;T&gt; {}
 <span class="kw">impl</span>&lt;T&gt; FusedIterator <span class="kw">for </span>RawIter&lt;T&gt; {}

 <span class="doccomment">/// Iterator which consumes a table and returns elements.
 </span><span class="kw">pub struct </span>RawIntoIter&lt;T, A: Allocator + Clone = Global&gt; {
     iter: RawIter&lt;T&gt;,
     allocation: <span class="prelude-ty">Option</span>&lt;(NonNull&lt;u8&gt;, Layout)&gt;,
     marker: PhantomData&lt;T&gt;,
     alloc: A,
 }

 <span class="kw">impl</span>&lt;T, A: Allocator + Clone&gt; RawIntoIter&lt;T, A&gt; {
     <span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">pub fn </span>iter(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; RawIter&lt;T&gt; {
         <span class="self">self</span>.iter.clone()
     }
 }

 <span class="kw">unsafe impl</span>&lt;T, A: Allocator + Clone&gt; Send <span class="kw">for </span>RawIntoIter&lt;T, A&gt;
 <span class="kw">where
     </span>T: Send,
     A: Send,
 {
 }
 <span class="kw">unsafe impl</span>&lt;T, A: Allocator + Clone&gt; Sync <span class="kw">for </span>RawIntoIter&lt;T, A&gt;
 <span class="kw">where
     </span>T: Sync,
     A: Sync,
 {
 }

 <span class="attribute">#[cfg(feature = <span class="string">&quot;nightly&quot;</span>)]
 </span><span class="kw">unsafe impl</span>&lt;<span class="attribute">#[may_dangle] </span>T, A: Allocator + Clone&gt; Drop <span class="kw">for </span>RawIntoIter&lt;T, A&gt; {
     <span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">fn </span>drop(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
         <span class="kw">unsafe </span>{
             <span class="comment">// Drop all remaining elements
             </span><span class="self">self</span>.iter.drop_elements();

             <span class="comment">// Free the table
             </span><span class="kw">if let </span><span class="prelude-val">Some</span>((ptr, layout)) = <span class="self">self</span>.allocation {
                 <span class="self">self</span>.alloc.deallocate(ptr, layout);
             }
         }
     }
 }
 <span class="attribute">#[cfg(not(feature = <span class="string">&quot;nightly&quot;</span>))]
 </span><span class="kw">impl</span>&lt;T, A: Allocator + Clone&gt; Drop <span class="kw">for </span>RawIntoIter&lt;T, A&gt; {
     <span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">fn </span>drop(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
         <span class="kw">unsafe </span>{
             <span class="comment">// Drop all remaining elements
             </span><span class="self">self</span>.iter.drop_elements();

             <span class="comment">// Free the table
             </span><span class="kw">if let </span><span class="prelude-val">Some</span>((ptr, layout)) = <span class="self">self</span>.allocation {
                 <span class="self">self</span>.alloc.deallocate(ptr, layout);
             }
         }
     }
 }

 <span class="kw">impl</span>&lt;T, A: Allocator + Clone&gt; Iterator <span class="kw">for </span>RawIntoIter&lt;T, A&gt; {
     <span class="kw">type </span>Item = T;

     <span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;T&gt; {
         <span class="kw">unsafe </span>{ <span class="prelude-val">Some</span>(<span class="self">self</span>.iter.next()<span class="question-mark">?</span>.read()) }
     }

     <span class="attribute">#[inline]
     </span><span class="kw">fn </span>size_hint(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; (usize, <span class="prelude-ty">Option</span>&lt;usize&gt;) {
         <span class="self">self</span>.iter.size_hint()
     }
 }

 <span class="kw">impl</span>&lt;T, A: Allocator + Clone&gt; ExactSizeIterator <span class="kw">for </span>RawIntoIter&lt;T, A&gt; {}
 <span class="kw">impl</span>&lt;T, A: Allocator + Clone&gt; FusedIterator <span class="kw">for </span>RawIntoIter&lt;T, A&gt; {}

 <span class="doccomment">/// Iterator which consumes elements without freeing the table storage.
 </span><span class="kw">pub struct </span>RawDrain&lt;<span class="lifetime">&#39;a</span>, T, A: Allocator + Clone = Global&gt; {
     iter: RawIter&lt;T&gt;,

     <span class="comment">// The table is moved into the iterator for the duration of the drain. This
     // ensures that an empty table is left if the drain iterator is leaked
     // without dropping.
     </span>table: ManuallyDrop&lt;RawTable&lt;T, A&gt;&gt;,
     orig_table: NonNull&lt;RawTable&lt;T, A&gt;&gt;,

     <span class="comment">// We don&#39;t use a &amp;&#39;a mut RawTable&lt;T&gt; because we want RawDrain to be
     // covariant over T.
     </span>marker: PhantomData&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>RawTable&lt;T, A&gt;&gt;,
 }

 <span class="kw">impl</span>&lt;T, A: Allocator + Clone&gt; RawDrain&lt;<span class="lifetime">&#39;_</span>, T, A&gt; {
     <span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">pub fn </span>iter(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; RawIter&lt;T&gt; {
         <span class="self">self</span>.iter.clone()
     }
 }

 <span class="kw">unsafe impl</span>&lt;T, A: Allocator + Copy&gt; Send <span class="kw">for </span>RawDrain&lt;<span class="lifetime">&#39;_</span>, T, A&gt;
 <span class="kw">where
     </span>T: Send,
     A: Send,
 {
 }
 <span class="kw">unsafe impl</span>&lt;T, A: Allocator + Copy&gt; Sync <span class="kw">for </span>RawDrain&lt;<span class="lifetime">&#39;_</span>, T, A&gt;
 <span class="kw">where
     </span>T: Sync,
     A: Sync,
 {
 }

 <span class="kw">impl</span>&lt;T, A: Allocator + Clone&gt; Drop <span class="kw">for </span>RawDrain&lt;<span class="lifetime">&#39;_</span>, T, A&gt; {
     <span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">fn </span>drop(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
         <span class="kw">unsafe </span>{
             <span class="comment">// Drop all remaining elements. Note that this may panic.
             </span><span class="self">self</span>.iter.drop_elements();

             <span class="comment">// Reset the contents of the table now that all elements have been
             // dropped.
             </span><span class="self">self</span>.table.clear_no_drop();

             <span class="comment">// Move the now empty table back to its original location.
             </span><span class="self">self</span>.orig_table
                 .as_ptr()
                 .copy_from_nonoverlapping(<span class="kw-2">&amp;*</span><span class="self">self</span>.table, <span class="number">1</span>);
         }
     }
 }

 <span class="kw">impl</span>&lt;T, A: Allocator + Clone&gt; Iterator <span class="kw">for </span>RawDrain&lt;<span class="lifetime">&#39;_</span>, T, A&gt; {
     <span class="kw">type </span>Item = T;

     <span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     </span><span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;T&gt; {
         <span class="kw">unsafe </span>{
             <span class="kw">let </span>item = <span class="self">self</span>.iter.next()<span class="question-mark">?</span>;
             <span class="prelude-val">Some</span>(item.read())
         }
     }

     <span class="attribute">#[inline]
     </span><span class="kw">fn </span>size_hint(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; (usize, <span class="prelude-ty">Option</span>&lt;usize&gt;) {
         <span class="self">self</span>.iter.size_hint()
     }
 }

 <span class="kw">impl</span>&lt;T, A: Allocator + Clone&gt; ExactSizeIterator <span class="kw">for </span>RawDrain&lt;<span class="lifetime">&#39;_</span>, T, A&gt; {}
 <span class="kw">impl</span>&lt;T, A: Allocator + Clone&gt; FusedIterator <span class="kw">for </span>RawDrain&lt;<span class="lifetime">&#39;_</span>, T, A&gt; {}

 <span class="doccomment">/// Iterator over occupied buckets that could match a given hash.
 ///
 /// `RawTable` only stores 7 bits of the hash value, so this iterator may return
 /// items that have a hash value different than the one provided. You should
 /// always validate the returned values before using them.
 </span><span class="kw">pub struct </span>RawIterHash&lt;<span class="lifetime">&#39;a</span>, T, A: Allocator + Clone = Global&gt; {
     inner: RawIterHashInner&lt;<span class="lifetime">&#39;a</span>, A&gt;,
     _marker: PhantomData&lt;T&gt;,
 }

 <span class="kw">struct </span>RawIterHashInner&lt;<span class="lifetime">&#39;a</span>, A: Allocator + Clone&gt; {
     table: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>RawTableInner&lt;A&gt;,

     <span class="comment">// The top 7 bits of the hash.
     </span>h2_hash: u8,

     <span class="comment">// The sequence of groups to probe in the search.
     </span>probe_seq: ProbeSeq,

     group: Group,

     <span class="comment">// The elements within the group with a matching h2-hash.
     </span>bitmask: BitMaskIter,
 }

 <span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T, A: Allocator + Clone&gt; RawIterHash&lt;<span class="lifetime">&#39;a</span>, T, A&gt; {
     <span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     #[cfg(feature = <span class="string">&quot;raw&quot;</span>)]
     </span><span class="kw">fn </span>new(table: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>RawTable&lt;T, A&gt;, hash: u64) -&gt; <span class="self">Self </span>{
         RawIterHash {
             inner: RawIterHashInner::new(<span class="kw-2">&amp;</span>table.table, hash),
             _marker: PhantomData,
         }
     }
 }
 <span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, A: Allocator + Clone&gt; RawIterHashInner&lt;<span class="lifetime">&#39;a</span>, A&gt; {
     <span class="attribute">#[cfg_attr(feature = <span class="string">&quot;inline-more&quot;</span>, inline)]
     #[cfg(feature = <span class="string">&quot;raw&quot;</span>)]
     </span><span class="kw">fn </span>new(table: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>RawTableInner&lt;A&gt;, hash: u64) -&gt; <span class="self">Self </span>{
         <span class="kw">unsafe </span>{
             <span class="kw">let </span>h2_hash = h2(hash);
             <span class="kw">let </span>probe_seq = table.probe_seq(hash);
             <span class="kw">let </span>group = Group::load(table.ctrl(probe_seq.pos));
             <span class="kw">let </span>bitmask = group.match_byte(h2_hash).into_iter();

             RawIterHashInner {
                 table,
                 h2_hash,
                 probe_seq,
                 group,
                 bitmask,
             }
         }
     }
 }

 <span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, T, A: Allocator + Clone&gt; Iterator <span class="kw">for </span>RawIterHash&lt;<span class="lifetime">&#39;a</span>, T, A&gt; {
     <span class="kw">type </span>Item = Bucket&lt;T&gt;;

     <span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;Bucket&lt;T&gt;&gt; {
         <span class="kw">unsafe </span>{
             <span class="kw">match </span><span class="self">self</span>.inner.next() {
                 <span class="prelude-val">Some</span>(index) =&gt; <span class="prelude-val">Some</span>(<span class="self">self</span>.inner.table.bucket(index)),
                 <span class="prelude-val">None </span>=&gt; <span class="prelude-val">None</span>,
             }
         }
     }
 }

 <span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, A: Allocator + Clone&gt; Iterator <span class="kw">for </span>RawIterHashInner&lt;<span class="lifetime">&#39;a</span>, A&gt; {
     <span class="kw">type </span>Item = usize;

     <span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="self">Self</span>::Item&gt; {
         <span class="kw">unsafe </span>{
             <span class="kw">loop </span>{
                 <span class="kw">if let </span><span class="prelude-val">Some</span>(bit) = <span class="self">self</span>.bitmask.next() {
                     <span class="kw">let </span>index = (<span class="self">self</span>.probe_seq.pos + bit) &amp; <span class="self">self</span>.table.bucket_mask;
                     <span class="kw">return </span><span class="prelude-val">Some</span>(index);
                 }
                 <span class="kw">if </span>likely(<span class="self">self</span>.group.match_empty().any_bit_set()) {
                     <span class="kw">return </span><span class="prelude-val">None</span>;
                 }
                 <span class="self">self</span>.probe_seq.move_next(<span class="self">self</span>.table.bucket_mask);
                 <span class="self">self</span>.group = Group::load(<span class="self">self</span>.table.ctrl(<span class="self">self</span>.probe_seq.pos));
                 <span class="self">self</span>.bitmask = <span class="self">self</span>.group.match_byte(<span class="self">self</span>.h2_hash).into_iter();
             }
         }
     }
 }

 <span class="attribute">#[cfg(test)]
 </span><span class="kw">mod </span>test_map {
     <span class="kw">use super</span>::<span class="kw-2">*</span>;

     <span class="kw">fn </span>rehash_in_place&lt;T&gt;(table: <span class="kw-2">&amp;mut </span>RawTable&lt;T&gt;, hasher: <span class="kw">impl </span>Fn(<span class="kw-2">&amp;</span>T) -&gt; u64) {
         <span class="kw">unsafe </span>{
             table.table.rehash_in_place(
                 <span class="kw-2">&amp;</span>|table, index| hasher(table.bucket::&lt;T&gt;(index).as_ref()),
                 mem::size_of::&lt;T&gt;(),
                 <span class="kw">if </span>mem::needs_drop::&lt;T&gt;() {
                     <span class="prelude-val">Some</span>(mem::transmute(ptr::drop_in_place::&lt;T&gt; <span class="kw">as unsafe fn</span>(<span class="kw-2">*mut </span>T)))
                 } <span class="kw">else </span>{
                     <span class="prelude-val">None
                 </span>},
             );
         }
     }

     <span class="attribute">#[test]
     </span><span class="kw">fn </span>rehash() {
         <span class="kw">let </span><span class="kw-2">mut </span>table = RawTable::new();
         <span class="kw">let </span>hasher = |i: <span class="kw-2">&amp;</span>u64| <span class="kw-2">*</span>i;
         <span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..<span class="number">100 </span>{
             table.insert(i, i, hasher);
         }

         <span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..<span class="number">100 </span>{
             <span class="kw">unsafe </span>{
                 <span class="macro">assert_eq!</span>(table.find(i, |x| <span class="kw-2">*</span>x == i).map(|b| b.read()), <span class="prelude-val">Some</span>(i));
             }
             <span class="macro">assert!</span>(table.find(i + <span class="number">100</span>, |x| <span class="kw-2">*</span>x == i + <span class="number">100</span>).is_none());
         }

         rehash_in_place(<span class="kw-2">&amp;mut </span>table, hasher);

         <span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..<span class="number">100 </span>{
             <span class="kw">unsafe </span>{
                 <span class="macro">assert_eq!</span>(table.find(i, |x| <span class="kw-2">*</span>x == i).map(|b| b.read()), <span class="prelude-val">Some</span>(i));
             }
             <span class="macro">assert!</span>(table.find(i + <span class="number">100</span>, |x| <span class="kw-2">*</span>x == i + <span class="number">100</span>).is_none());
         }
     }
 }
 </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>