Google Git
Sign in
apache / incubator-teaclave-website / refs/heads/asf-site / . / api-docs / crates-app / src / indexmap / map / core.rs.html
blob: 5ad0eeadeb4e593f8093b3268ee8b357b2edd7df [file] [log] [blame]
<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Source of the Rust file `/root/.cargo/registry/src/github.com-1ecc6299db9ec823/indexmap-1.9.3/src/map/core.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>core.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="../../../indexmap/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="../../../indexmap/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>
</pre><pre class="rust"><code><span class="doccomment">//! This is the core implementation that doesn&#39;t depend on the hasher at all.
//!
//! The methods of `IndexMapCore` don&#39;t use any Hash properties of K.
//!
//! It&#39;s cleaner to separate them out, then the compiler checks that we are not
//! using Hash at all in these methods.
//!
//! However, we should probably not let this show in the public API or docs.
</span><span class="kw">mod </span>raw;
<span class="kw">use </span>hashbrown::raw::RawTable;
<span class="kw">use </span><span class="kw">crate</span>::vec::{Drain, Vec};
<span class="kw">use </span>core::cmp;
<span class="kw">use </span>core::fmt;
<span class="kw">use </span>core::mem::replace;
<span class="kw">use </span>core::ops::RangeBounds;
<span class="kw">use </span><span class="kw">crate</span>::equivalent::Equivalent;
<span class="kw">use </span><span class="kw">crate</span>::util::simplify_range;
<span class="kw">use crate</span>::{Bucket, Entries, HashValue};
<span class="doccomment">/// Core of the map that does not depend on S
</span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">struct </span>IndexMapCore&lt;K, V&gt; {
<span class="doccomment">/// indices mapping from the entry hash to its index.
</span>indices: RawTable&lt;usize&gt;,
<span class="doccomment">/// entries is a dense vec of entries in their order.
</span>entries: Vec&lt;Bucket&lt;K, V&gt;&gt;,
}
<span class="attribute">#[inline(always)]
</span><span class="kw">fn </span>get_hash&lt;K, V&gt;(entries: <span class="kw-2">&amp;</span>[Bucket&lt;K, V&gt;]) -&gt; <span class="kw">impl </span>Fn(<span class="kw-2">&amp;</span>usize) -&gt; u64 + <span class="lifetime">&#39;_ </span>{
<span class="kw">move </span>|<span class="kw-2">&amp;</span>i| entries[i].hash.get()
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>equivalent&lt;<span class="lifetime">&#39;a</span>, K, V, Q: <span class="question-mark">?</span>Sized + Equivalent&lt;K&gt;&gt;(
key: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>Q,
entries: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>[Bucket&lt;K, V&gt;],
) -&gt; <span class="kw">impl </span>Fn(<span class="kw-2">&amp;</span>usize) -&gt; bool + <span class="lifetime">&#39;a </span>{
<span class="kw">move </span>|<span class="kw-2">&amp;</span>i| Q::equivalent(key, <span class="kw-2">&amp;</span>entries[i].key)
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>erase_index(table: <span class="kw-2">&amp;mut </span>RawTable&lt;usize&gt;, hash: HashValue, index: usize) {
<span class="kw">let </span>erased = table.erase_entry(hash.get(), <span class="kw">move </span>|<span class="kw-2">&amp;</span>i| i == index);
<span class="macro">debug_assert!</span>(erased);
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>update_index(table: <span class="kw-2">&amp;mut </span>RawTable&lt;usize&gt;, hash: HashValue, old: usize, new: usize) {
<span class="kw">let </span>index = table
.get_mut(hash.get(), <span class="kw">move </span>|<span class="kw-2">&amp;</span>i| i == old)
.expect(<span class="string">&quot;index not found&quot;</span>);
<span class="kw-2">*</span>index = new;
}
<span class="kw">impl</span>&lt;K, V&gt; Clone <span class="kw">for </span>IndexMapCore&lt;K, V&gt;
<span class="kw">where
</span>K: Clone,
V: Clone,
{
<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">let </span>indices = <span class="self">self</span>.indices.clone();
<span class="kw">let </span><span class="kw-2">mut </span>entries = Vec::with_capacity(indices.capacity());
entries.clone_from(<span class="kw-2">&amp;</span><span class="self">self</span>.entries);
IndexMapCore { indices, entries }
}
<span class="kw">fn </span>clone_from(<span class="kw-2">&amp;mut </span><span class="self">self</span>, other: <span class="kw-2">&amp;</span><span class="self">Self</span>) {
<span class="kw">let </span>hasher = get_hash(<span class="kw-2">&amp;</span>other.entries);
<span class="self">self</span>.indices.clone_from_with_hasher(<span class="kw-2">&amp;</span>other.indices, hasher);
<span class="kw">if </span><span class="self">self</span>.entries.capacity() &lt; other.entries.len() {
<span class="comment">// If we must resize, match the indices capacity
</span><span class="self">self</span>.reserve_entries();
}
<span class="self">self</span>.entries.clone_from(<span class="kw-2">&amp;</span>other.entries);
}
}
<span class="kw">impl</span>&lt;K, V&gt; fmt::Debug <span class="kw">for </span>IndexMapCore&lt;K, V&gt;
<span class="kw">where
</span>K: fmt::Debug,
V: fmt::Debug,
{
<span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>fmt::Formatter&lt;<span class="lifetime">&#39;_</span>&gt;) -&gt; fmt::Result {
f.debug_struct(<span class="string">&quot;IndexMapCore&quot;</span>)
.field(<span class="string">&quot;indices&quot;</span>, <span class="kw-2">&amp;</span>raw::DebugIndices(<span class="kw-2">&amp;</span><span class="self">self</span>.indices))
.field(<span class="string">&quot;entries&quot;</span>, <span class="kw-2">&amp;</span><span class="self">self</span>.entries)
.finish()
}
}
<span class="kw">impl</span>&lt;K, V&gt; Entries <span class="kw">for </span>IndexMapCore&lt;K, V&gt; {
<span class="kw">type </span>Entry = Bucket&lt;K, V&gt;;
<span class="attribute">#[inline]
</span><span class="kw">fn </span>into_entries(<span class="self">self</span>) -&gt; Vec&lt;<span class="self">Self</span>::Entry&gt; {
<span class="self">self</span>.entries
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>as_entries(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>[<span class="self">Self</span>::Entry] {
<span class="kw-2">&amp;</span><span class="self">self</span>.entries
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>as_entries_mut(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;mut </span>[<span class="self">Self</span>::Entry] {
<span class="kw-2">&amp;mut </span><span class="self">self</span>.entries
}
<span class="kw">fn </span>with_entries&lt;F&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, f: F)
<span class="kw">where
</span>F: FnOnce(<span class="kw-2">&amp;mut </span>[<span class="self">Self</span>::Entry]),
{
f(<span class="kw-2">&amp;mut </span><span class="self">self</span>.entries);
<span class="self">self</span>.rebuild_hash_table();
}
}
<span class="kw">impl</span>&lt;K, V&gt; IndexMapCore&lt;K, V&gt; {
<span class="attribute">#[inline]
</span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">const fn </span>new() -&gt; <span class="self">Self </span>{
IndexMapCore {
indices: RawTable::new(),
entries: Vec::new(),
}
}
<span class="attribute">#[inline]
</span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>with_capacity(n: usize) -&gt; <span class="self">Self </span>{
IndexMapCore {
indices: RawTable::with_capacity(n),
entries: Vec::with_capacity(n),
}
}
<span class="attribute">#[inline]
</span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>len(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
<span class="self">self</span>.indices.len()
}
<span class="attribute">#[inline]
</span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>capacity(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
cmp::min(<span class="self">self</span>.indices.capacity(), <span class="self">self</span>.entries.capacity())
}
<span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>clear(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
<span class="self">self</span>.indices.clear();
<span class="self">self</span>.entries.clear();
}
<span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>truncate(<span class="kw-2">&amp;mut </span><span class="self">self</span>, len: usize) {
<span class="kw">if </span>len &lt; <span class="self">self</span>.len() {
<span class="self">self</span>.erase_indices(len, <span class="self">self</span>.entries.len());
<span class="self">self</span>.entries.truncate(len);
}
}
<span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>drain&lt;R&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, range: R) -&gt; Drain&lt;<span class="lifetime">&#39;_</span>, Bucket&lt;K, V&gt;&gt;
<span class="kw">where
</span>R: RangeBounds&lt;usize&gt;,
{
<span class="kw">let </span>range = simplify_range(range, <span class="self">self</span>.entries.len());
<span class="self">self</span>.erase_indices(range.start, range.end);
<span class="self">self</span>.entries.drain(range)
}
<span class="attribute">#[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>par_drain&lt;R&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, range: R) -&gt; rayon::vec::Drain&lt;<span class="lifetime">&#39;_</span>, Bucket&lt;K, V&gt;&gt;
<span class="kw">where
</span>K: Send,
V: Send,
R: RangeBounds&lt;usize&gt;,
{
<span class="kw">use </span>rayon::iter::ParallelDrainRange;
<span class="kw">let </span>range = simplify_range(range, <span class="self">self</span>.entries.len());
<span class="self">self</span>.erase_indices(range.start, range.end);
<span class="self">self</span>.entries.par_drain(range)
}
<span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>split_off(<span class="kw-2">&amp;mut </span><span class="self">self</span>, at: usize) -&gt; <span class="self">Self </span>{
<span class="macro">assert!</span>(at &lt;= <span class="self">self</span>.entries.len());
<span class="self">self</span>.erase_indices(at, <span class="self">self</span>.entries.len());
<span class="kw">let </span>entries = <span class="self">self</span>.entries.split_off(at);
<span class="kw">let </span><span class="kw-2">mut </span>indices = RawTable::with_capacity(entries.len());
raw::insert_bulk_no_grow(<span class="kw-2">&amp;mut </span>indices, <span class="kw-2">&amp;</span>entries);
<span class="self">Self </span>{ indices, entries }
}
<span class="doccomment">/// Reserve capacity for `additional` more key-value pairs.
</span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>reserve(<span class="kw-2">&amp;mut </span><span class="self">self</span>, additional: usize) {
<span class="self">self</span>.indices.reserve(additional, get_hash(<span class="kw-2">&amp;</span><span class="self">self</span>.entries));
<span class="self">self</span>.reserve_entries();
}
<span class="doccomment">/// Reserve entries capacity to match the indices
</span><span class="kw">fn </span>reserve_entries(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
<span class="kw">let </span>additional = <span class="self">self</span>.indices.capacity() - <span class="self">self</span>.entries.len();
<span class="self">self</span>.entries.reserve_exact(additional);
}
<span class="doccomment">/// Shrink the capacity of the map with a lower bound
</span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>shrink_to(<span class="kw-2">&amp;mut </span><span class="self">self</span>, min_capacity: usize) {
<span class="self">self</span>.indices
.shrink_to(min_capacity, get_hash(<span class="kw-2">&amp;</span><span class="self">self</span>.entries));
<span class="self">self</span>.entries.shrink_to(min_capacity);
}
<span class="doccomment">/// Remove the last key-value pair
</span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>pop(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;(K, V)&gt; {
<span class="kw">if let </span><span class="prelude-val">Some</span>(entry) = <span class="self">self</span>.entries.pop() {
<span class="kw">let </span>last = <span class="self">self</span>.entries.len();
erase_index(<span class="kw-2">&amp;mut </span><span class="self">self</span>.indices, entry.hash, last);
<span class="prelude-val">Some</span>((entry.key, entry.value))
} <span class="kw">else </span>{
<span class="prelude-val">None
</span>}
}
<span class="doccomment">/// Append a key-value pair, *without* checking whether it already exists,
/// and return the pair&#39;s new index.
</span><span class="kw">fn </span>push(<span class="kw-2">&amp;mut </span><span class="self">self</span>, hash: HashValue, key: K, value: V) -&gt; usize {
<span class="kw">let </span>i = <span class="self">self</span>.entries.len();
<span class="self">self</span>.indices.insert(hash.get(), i, get_hash(<span class="kw-2">&amp;</span><span class="self">self</span>.entries));
<span class="kw">if </span>i == <span class="self">self</span>.entries.capacity() {
<span class="comment">// Reserve our own capacity synced to the indices,
// rather than letting `Vec::push` just double it.
</span><span class="self">self</span>.reserve_entries();
}
<span class="self">self</span>.entries.push(Bucket { hash, key, value });
i
}
<span class="doccomment">/// Return the index in `entries` where an equivalent key can be found
</span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>get_index_of&lt;Q&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, hash: HashValue, key: <span class="kw-2">&amp;</span>Q) -&gt; <span class="prelude-ty">Option</span>&lt;usize&gt;
<span class="kw">where
</span>Q: <span class="question-mark">?</span>Sized + Equivalent&lt;K&gt;,
{
<span class="kw">let </span>eq = equivalent(key, <span class="kw-2">&amp;</span><span class="self">self</span>.entries);
<span class="self">self</span>.indices.get(hash.get(), eq).copied()
}
<span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>insert_full(<span class="kw-2">&amp;mut </span><span class="self">self</span>, hash: HashValue, key: K, value: V) -&gt; (usize, <span class="prelude-ty">Option</span>&lt;V&gt;)
<span class="kw">where
</span>K: Eq,
{
<span class="kw">match </span><span class="self">self</span>.get_index_of(hash, <span class="kw-2">&amp;</span>key) {
<span class="prelude-val">Some</span>(i) =&gt; (i, <span class="prelude-val">Some</span>(replace(<span class="kw-2">&amp;mut </span><span class="self">self</span>.entries[i].value, value))),
<span class="prelude-val">None </span>=&gt; (<span class="self">self</span>.push(hash, key, value), <span class="prelude-val">None</span>),
}
}
<span class="doccomment">/// Remove an entry by shifting all entries that follow it
</span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>shift_remove_full&lt;Q&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, hash: HashValue, key: <span class="kw-2">&amp;</span>Q) -&gt; <span class="prelude-ty">Option</span>&lt;(usize, K, V)&gt;
<span class="kw">where
</span>Q: <span class="question-mark">?</span>Sized + Equivalent&lt;K&gt;,
{
<span class="kw">let </span>eq = equivalent(key, <span class="kw-2">&amp;</span><span class="self">self</span>.entries);
<span class="kw">match </span><span class="self">self</span>.indices.remove_entry(hash.get(), eq) {
<span class="prelude-val">Some</span>(index) =&gt; {
<span class="kw">let </span>(key, value) = <span class="self">self</span>.shift_remove_finish(index);
<span class="prelude-val">Some</span>((index, key, value))
}
<span class="prelude-val">None </span>=&gt; <span class="prelude-val">None</span>,
}
}
<span class="doccomment">/// Remove an entry by shifting all entries that follow it
</span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>shift_remove_index(<span class="kw-2">&amp;mut </span><span class="self">self</span>, index: usize) -&gt; <span class="prelude-ty">Option</span>&lt;(K, V)&gt; {
<span class="kw">match </span><span class="self">self</span>.entries.get(index) {
<span class="prelude-val">Some</span>(entry) =&gt; {
erase_index(<span class="kw-2">&amp;mut </span><span class="self">self</span>.indices, entry.hash, index);
<span class="prelude-val">Some</span>(<span class="self">self</span>.shift_remove_finish(index))
}
<span class="prelude-val">None </span>=&gt; <span class="prelude-val">None</span>,
}
}
<span class="doccomment">/// Remove an entry by shifting all entries that follow it
///
/// The index should already be removed from `self.indices`.
</span><span class="kw">fn </span>shift_remove_finish(<span class="kw-2">&amp;mut </span><span class="self">self</span>, index: usize) -&gt; (K, V) {
<span class="comment">// Correct indices that point to the entries that followed the removed entry.
</span><span class="self">self</span>.decrement_indices(index + <span class="number">1</span>, <span class="self">self</span>.entries.len());
<span class="comment">// Use Vec::remove to actually remove the entry.
</span><span class="kw">let </span>entry = <span class="self">self</span>.entries.remove(index);
(entry.key, entry.value)
}
<span class="doccomment">/// Decrement all indices in the range `start..end`.
///
/// The index `start - 1` should not exist in `self.indices`.
/// All entries should still be in their original positions.
</span><span class="kw">fn </span>decrement_indices(<span class="kw-2">&amp;mut </span><span class="self">self</span>, start: usize, end: usize) {
<span class="comment">// Use a heuristic between a full sweep vs. a `find()` for every shifted item.
</span><span class="kw">let </span>shifted_entries = <span class="kw-2">&amp;</span><span class="self">self</span>.entries[start..end];
<span class="kw">if </span>shifted_entries.len() &gt; <span class="self">self</span>.indices.buckets() / <span class="number">2 </span>{
<span class="comment">// Shift all indices in range.
</span><span class="kw">for </span>i <span class="kw">in </span><span class="self">self</span>.indices_mut() {
<span class="kw">if </span>start &lt;= <span class="kw-2">*</span>i &amp;&amp; <span class="kw-2">*</span>i &lt; end {
<span class="kw-2">*</span>i -= <span class="number">1</span>;
}
}
} <span class="kw">else </span>{
<span class="comment">// Find each entry in range to shift its index.
</span><span class="kw">for </span>(i, entry) <span class="kw">in </span>(start..end).zip(shifted_entries) {
update_index(<span class="kw-2">&amp;mut </span><span class="self">self</span>.indices, entry.hash, i, i - <span class="number">1</span>);
}
}
}
<span class="doccomment">/// Increment all indices in the range `start..end`.
///
/// The index `end` should not exist in `self.indices`.
/// All entries should still be in their original positions.
</span><span class="kw">fn </span>increment_indices(<span class="kw-2">&amp;mut </span><span class="self">self</span>, start: usize, end: usize) {
<span class="comment">// Use a heuristic between a full sweep vs. a `find()` for every shifted item.
</span><span class="kw">let </span>shifted_entries = <span class="kw-2">&amp;</span><span class="self">self</span>.entries[start..end];
<span class="kw">if </span>shifted_entries.len() &gt; <span class="self">self</span>.indices.buckets() / <span class="number">2 </span>{
<span class="comment">// Shift all indices in range.
</span><span class="kw">for </span>i <span class="kw">in </span><span class="self">self</span>.indices_mut() {
<span class="kw">if </span>start &lt;= <span class="kw-2">*</span>i &amp;&amp; <span class="kw-2">*</span>i &lt; end {
<span class="kw-2">*</span>i += <span class="number">1</span>;
}
}
} <span class="kw">else </span>{
<span class="comment">// Find each entry in range to shift its index, updated in reverse so
// we never have duplicated indices that might have a hash collision.
</span><span class="kw">for </span>(i, entry) <span class="kw">in </span>(start..end).zip(shifted_entries).rev() {
update_index(<span class="kw-2">&amp;mut </span><span class="self">self</span>.indices, entry.hash, i, i + <span class="number">1</span>);
}
}
}
<span class="kw">pub</span>(<span class="kw">super</span>) <span class="kw">fn </span>move_index(<span class="kw-2">&amp;mut </span><span class="self">self</span>, from: usize, to: usize) {
<span class="kw">let </span>from_hash = <span class="self">self</span>.entries[from].hash;
<span class="kw">if </span>from != to {
<span class="comment">// Use a sentinal index so other indices don&#39;t collide.
</span>update_index(<span class="kw-2">&amp;mut </span><span class="self">self</span>.indices, from_hash, from, usize::MAX);
<span class="comment">// Update all other indices and rotate the entry positions.
</span><span class="kw">if </span>from &lt; to {
<span class="self">self</span>.decrement_indices(from + <span class="number">1</span>, to + <span class="number">1</span>);
<span class="self">self</span>.entries[from..=to].rotate_left(<span class="number">1</span>);
} <span class="kw">else if </span>to &lt; from {
<span class="self">self</span>.increment_indices(to, from);
<span class="self">self</span>.entries[to..=from].rotate_right(<span class="number">1</span>);
}
<span class="comment">// Change the sentinal index to its final position.
</span>update_index(<span class="kw-2">&amp;mut </span><span class="self">self</span>.indices, from_hash, usize::MAX, to);
}
}
<span class="doccomment">/// Remove an entry by swapping it with the last
</span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>swap_remove_full&lt;Q&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, hash: HashValue, key: <span class="kw-2">&amp;</span>Q) -&gt; <span class="prelude-ty">Option</span>&lt;(usize, K, V)&gt;
<span class="kw">where
</span>Q: <span class="question-mark">?</span>Sized + Equivalent&lt;K&gt;,
{
<span class="kw">let </span>eq = equivalent(key, <span class="kw-2">&amp;</span><span class="self">self</span>.entries);
<span class="kw">match </span><span class="self">self</span>.indices.remove_entry(hash.get(), eq) {
<span class="prelude-val">Some</span>(index) =&gt; {
<span class="kw">let </span>(key, value) = <span class="self">self</span>.swap_remove_finish(index);
<span class="prelude-val">Some</span>((index, key, value))
}
<span class="prelude-val">None </span>=&gt; <span class="prelude-val">None</span>,
}
}
<span class="doccomment">/// Remove an entry by swapping it with the last
</span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>swap_remove_index(<span class="kw-2">&amp;mut </span><span class="self">self</span>, index: usize) -&gt; <span class="prelude-ty">Option</span>&lt;(K, V)&gt; {
<span class="kw">match </span><span class="self">self</span>.entries.get(index) {
<span class="prelude-val">Some</span>(entry) =&gt; {
erase_index(<span class="kw-2">&amp;mut </span><span class="self">self</span>.indices, entry.hash, index);
<span class="prelude-val">Some</span>(<span class="self">self</span>.swap_remove_finish(index))
}
<span class="prelude-val">None </span>=&gt; <span class="prelude-val">None</span>,
}
}
<span class="doccomment">/// Finish removing an entry by swapping it with the last
///
/// The index should already be removed from `self.indices`.
</span><span class="kw">fn </span>swap_remove_finish(<span class="kw-2">&amp;mut </span><span class="self">self</span>, index: usize) -&gt; (K, V) {
<span class="comment">// use swap_remove, but then we need to update the index that points
// to the other entry that has to move
</span><span class="kw">let </span>entry = <span class="self">self</span>.entries.swap_remove(index);
<span class="comment">// correct index that points to the entry that had to swap places
</span><span class="kw">if let </span><span class="prelude-val">Some</span>(entry) = <span class="self">self</span>.entries.get(index) {
<span class="comment">// was not last element
// examine new element in `index` and find it in indices
</span><span class="kw">let </span>last = <span class="self">self</span>.entries.len();
update_index(<span class="kw-2">&amp;mut </span><span class="self">self</span>.indices, entry.hash, last, index);
}
(entry.key, entry.value)
}
<span class="doccomment">/// Erase `start..end` from `indices`, and shift `end..` indices down to `start..`
///
/// All of these items should still be at their original location in `entries`.
/// This is used by `drain`, which will let `Vec::drain` do the work on `entries`.
</span><span class="kw">fn </span>erase_indices(<span class="kw-2">&amp;mut </span><span class="self">self</span>, start: usize, end: usize) {
<span class="kw">let </span>(init, shifted_entries) = <span class="self">self</span>.entries.split_at(end);
<span class="kw">let </span>(start_entries, erased_entries) = init.split_at(start);
<span class="kw">let </span>erased = erased_entries.len();
<span class="kw">let </span>shifted = shifted_entries.len();
<span class="kw">let </span>half_capacity = <span class="self">self</span>.indices.buckets() / <span class="number">2</span>;
<span class="comment">// Use a heuristic between different strategies
</span><span class="kw">if </span>erased == <span class="number">0 </span>{
<span class="comment">// Degenerate case, nothing to do
</span>} <span class="kw">else if </span>start + shifted &lt; half_capacity &amp;&amp; start &lt; erased {
<span class="comment">// Reinsert everything, as there are few kept indices
</span><span class="self">self</span>.indices.clear();
<span class="comment">// Reinsert stable indices, then shifted indices
</span>raw::insert_bulk_no_grow(<span class="kw-2">&amp;mut </span><span class="self">self</span>.indices, start_entries);
raw::insert_bulk_no_grow(<span class="kw-2">&amp;mut </span><span class="self">self</span>.indices, shifted_entries);
} <span class="kw">else if </span>erased + shifted &lt; half_capacity {
<span class="comment">// Find each affected index, as there are few to adjust
// Find erased indices
</span><span class="kw">for </span>(i, entry) <span class="kw">in </span>(start..).zip(erased_entries) {
erase_index(<span class="kw-2">&amp;mut </span><span class="self">self</span>.indices, entry.hash, i);
}
<span class="comment">// Find shifted indices
</span><span class="kw">for </span>((new, old), entry) <span class="kw">in </span>(start..).zip(end..).zip(shifted_entries) {
update_index(<span class="kw-2">&amp;mut </span><span class="self">self</span>.indices, entry.hash, old, new);
}
} <span class="kw">else </span>{
<span class="comment">// Sweep the whole table for adjustments
</span><span class="self">self</span>.erase_indices_sweep(start, end);
}
<span class="macro">debug_assert_eq!</span>(<span class="self">self</span>.indices.len(), start + shifted);
}
<span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>retain_in_order&lt;F&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, <span class="kw-2">mut </span>keep: F)
<span class="kw">where
</span>F: FnMut(<span class="kw-2">&amp;mut </span>K, <span class="kw-2">&amp;mut </span>V) -&gt; bool,
{
<span class="comment">// FIXME: This could use Vec::retain_mut with MSRV 1.61.
// Like Vec::retain in self.entries, but with mutable K and V.
// We swap-shift all the items we want to keep, truncate the rest,
// then rebuild the raw hash table with the new indexes.
</span><span class="kw">let </span>len = <span class="self">self</span>.entries.len();
<span class="kw">let </span><span class="kw-2">mut </span>n_deleted = <span class="number">0</span>;
<span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..len {
<span class="kw">let </span>will_keep = {
<span class="kw">let </span>entry = <span class="kw-2">&amp;mut </span><span class="self">self</span>.entries[i];
keep(<span class="kw-2">&amp;mut </span>entry.key, <span class="kw-2">&amp;mut </span>entry.value)
};
<span class="kw">if </span>!will_keep {
n_deleted += <span class="number">1</span>;
} <span class="kw">else if </span>n_deleted &gt; <span class="number">0 </span>{
<span class="self">self</span>.entries.swap(i - n_deleted, i);
}
}
<span class="kw">if </span>n_deleted &gt; <span class="number">0 </span>{
<span class="self">self</span>.entries.truncate(len - n_deleted);
<span class="self">self</span>.rebuild_hash_table();
}
}
<span class="kw">fn </span>rebuild_hash_table(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
<span class="self">self</span>.indices.clear();
raw::insert_bulk_no_grow(<span class="kw-2">&amp;mut </span><span class="self">self</span>.indices, <span class="kw-2">&amp;</span><span class="self">self</span>.entries);
}
<span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>reverse(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
<span class="self">self</span>.entries.reverse();
<span class="comment">// No need to save hash indices, can easily calculate what they should
// be, given that this is an in-place reversal.
</span><span class="kw">let </span>len = <span class="self">self</span>.entries.len();
<span class="kw">for </span>i <span class="kw">in </span><span class="self">self</span>.indices_mut() {
<span class="kw-2">*</span>i = len - <span class="kw-2">*</span>i - <span class="number">1</span>;
}
}
}
<span class="doccomment">/// Entry for an existing key-value pair or a vacant location to
/// insert one.
</span><span class="kw">pub enum </span>Entry&lt;<span class="lifetime">&#39;a</span>, K, V&gt; {
<span class="doccomment">/// Existing slot with equivalent key.
</span>Occupied(OccupiedEntry&lt;<span class="lifetime">&#39;a</span>, K, V&gt;),
<span class="doccomment">/// Vacant slot (no equivalent key in the map).
</span>Vacant(VacantEntry&lt;<span class="lifetime">&#39;a</span>, K, V&gt;),
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, K, V&gt; Entry&lt;<span class="lifetime">&#39;a</span>, K, V&gt; {
<span class="doccomment">/// Inserts the given default value in the entry if it is vacant and returns a mutable
/// reference to it. Otherwise a mutable reference to an already existent value is returned.
///
/// Computes in **O(1)** time (amortized average).
</span><span class="kw">pub fn </span>or_insert(<span class="self">self</span>, default: V) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>V {
<span class="kw">match </span><span class="self">self </span>{
Entry::Occupied(entry) =&gt; entry.into_mut(),
Entry::Vacant(entry) =&gt; entry.insert(default),
}
}
<span class="doccomment">/// Inserts the result of the `call` function in the entry if it is vacant and returns a mutable
/// reference to it. Otherwise a mutable reference to an already existent value is returned.
///
/// Computes in **O(1)** time (amortized average).
</span><span class="kw">pub fn </span>or_insert_with&lt;F&gt;(<span class="self">self</span>, call: F) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>V
<span class="kw">where
</span>F: FnOnce() -&gt; V,
{
<span class="kw">match </span><span class="self">self </span>{
Entry::Occupied(entry) =&gt; entry.into_mut(),
Entry::Vacant(entry) =&gt; entry.insert(call()),
}
}
<span class="doccomment">/// Inserts the result of the `call` function with a reference to the entry&#39;s key if it is
/// vacant, and returns a mutable reference to the new value. Otherwise a mutable reference to
/// an already existent value is returned.
///
/// Computes in **O(1)** time (amortized average).
</span><span class="kw">pub fn </span>or_insert_with_key&lt;F&gt;(<span class="self">self</span>, call: F) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>V
<span class="kw">where
</span>F: FnOnce(<span class="kw-2">&amp;</span>K) -&gt; V,
{
<span class="kw">match </span><span class="self">self </span>{
Entry::Occupied(entry) =&gt; entry.into_mut(),
Entry::Vacant(entry) =&gt; {
<span class="kw">let </span>value = call(<span class="kw-2">&amp;</span>entry.key);
entry.insert(value)
}
}
}
<span class="doccomment">/// Gets a reference to the entry&#39;s key, either within the map if occupied,
/// or else the new key that was used to find the entry.
</span><span class="kw">pub fn </span>key(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>K {
<span class="kw">match </span><span class="kw-2">*</span><span class="self">self </span>{
Entry::Occupied(<span class="kw-2">ref </span>entry) =&gt; entry.key(),
Entry::Vacant(<span class="kw-2">ref </span>entry) =&gt; entry.key(),
}
}
<span class="doccomment">/// Return the index where the key-value pair exists or will be inserted.
</span><span class="kw">pub fn </span>index(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
<span class="kw">match </span><span class="kw-2">*</span><span class="self">self </span>{
Entry::Occupied(<span class="kw-2">ref </span>entry) =&gt; entry.index(),
Entry::Vacant(<span class="kw-2">ref </span>entry) =&gt; entry.index(),
}
}
<span class="doccomment">/// Modifies the entry if it is occupied.
</span><span class="kw">pub fn </span>and_modify&lt;F&gt;(<span class="self">self</span>, f: F) -&gt; <span class="self">Self
</span><span class="kw">where
</span>F: FnOnce(<span class="kw-2">&amp;mut </span>V),
{
<span class="kw">match </span><span class="self">self </span>{
Entry::Occupied(<span class="kw-2">mut </span>o) =&gt; {
f(o.get_mut());
Entry::Occupied(o)
}
x =&gt; x,
}
}
<span class="doccomment">/// Inserts a default-constructed value in the entry if it is vacant and returns a mutable
/// reference to it. Otherwise a mutable reference to an already existent value is returned.
///
/// Computes in **O(1)** time (amortized average).
</span><span class="kw">pub fn </span>or_default(<span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>V
<span class="kw">where
</span>V: Default,
{
<span class="kw">match </span><span class="self">self </span>{
Entry::Occupied(entry) =&gt; entry.into_mut(),
Entry::Vacant(entry) =&gt; entry.insert(V::default()),
}
}
}
<span class="kw">impl</span>&lt;K: fmt::Debug, V: fmt::Debug&gt; fmt::Debug <span class="kw">for </span>Entry&lt;<span class="lifetime">&#39;_</span>, K, V&gt; {
<span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>fmt::Formatter&lt;<span class="lifetime">&#39;_</span>&gt;) -&gt; fmt::Result {
<span class="kw">match </span><span class="kw-2">*</span><span class="self">self </span>{
Entry::Vacant(<span class="kw-2">ref </span>v) =&gt; f.debug_tuple(<span class="macro">stringify!</span>(Entry)).field(v).finish(),
Entry::Occupied(<span class="kw-2">ref </span>o) =&gt; f.debug_tuple(<span class="macro">stringify!</span>(Entry)).field(o).finish(),
}
}
}
<span class="kw">pub use </span><span class="self">self</span>::raw::OccupiedEntry;
<span class="comment">// Extra methods that don&#39;t threaten the unsafe encapsulation.
</span><span class="kw">impl</span>&lt;K, V&gt; OccupiedEntry&lt;<span class="lifetime">&#39;_</span>, K, V&gt; {
<span class="doccomment">/// Sets the value of the entry to `value`, and returns the entry&#39;s old value.
</span><span class="kw">pub fn </span>insert(<span class="kw-2">&amp;mut </span><span class="self">self</span>, value: V) -&gt; V {
replace(<span class="self">self</span>.get_mut(), value)
}
<span class="doccomment">/// Remove the key, value pair stored in the map for this entry, and return the value.
///
/// **NOTE:** This is equivalent to `.swap_remove()`.
</span><span class="kw">pub fn </span>remove(<span class="self">self</span>) -&gt; V {
<span class="self">self</span>.swap_remove()
}
<span class="doccomment">/// Remove the key, value pair stored in the map for this entry, and return the value.
///
/// Like `Vec::swap_remove`, the pair is removed by swapping it with the
/// last element of the map and popping it off. **This perturbs
/// the position of what used to be the last element!**
///
/// Computes in **O(1)** time (average).
</span><span class="kw">pub fn </span>swap_remove(<span class="self">self</span>) -&gt; V {
<span class="self">self</span>.swap_remove_entry().<span class="number">1
</span>}
<span class="doccomment">/// Remove the key, value pair stored in the map for this entry, and return the value.
///
/// Like `Vec::remove`, the pair is removed by shifting all of the
/// elements that follow it, preserving their relative order.
/// **This perturbs the index of all of those elements!**
///
/// Computes in **O(n)** time (average).
</span><span class="kw">pub fn </span>shift_remove(<span class="self">self</span>) -&gt; V {
<span class="self">self</span>.shift_remove_entry().<span class="number">1
</span>}
<span class="doccomment">/// Remove and return the key, value pair stored in the map for this entry
///
/// **NOTE:** This is equivalent to `.swap_remove_entry()`.
</span><span class="kw">pub fn </span>remove_entry(<span class="self">self</span>) -&gt; (K, V) {
<span class="self">self</span>.swap_remove_entry()
}
}
<span class="kw">impl</span>&lt;K: fmt::Debug, V: fmt::Debug&gt; fmt::Debug <span class="kw">for </span>OccupiedEntry&lt;<span class="lifetime">&#39;_</span>, K, V&gt; {
<span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>fmt::Formatter&lt;<span class="lifetime">&#39;_</span>&gt;) -&gt; fmt::Result {
f.debug_struct(<span class="macro">stringify!</span>(OccupiedEntry))
.field(<span class="string">&quot;key&quot;</span>, <span class="self">self</span>.key())
.field(<span class="string">&quot;value&quot;</span>, <span class="self">self</span>.get())
.finish()
}
}
<span class="doccomment">/// A view into a vacant entry in a `IndexMap`.
/// It is part of the [`Entry`] enum.
///
/// [`Entry`]: enum.Entry.html
</span><span class="kw">pub struct </span>VacantEntry&lt;<span class="lifetime">&#39;a</span>, K, V&gt; {
map: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>IndexMapCore&lt;K, V&gt;,
hash: HashValue,
key: K,
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>, K, V&gt; VacantEntry&lt;<span class="lifetime">&#39;a</span>, K, V&gt; {
<span class="doccomment">/// Gets a reference to the key that was used to find the entry.
</span><span class="kw">pub fn </span>key(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>K {
<span class="kw-2">&amp;</span><span class="self">self</span>.key
}
<span class="doccomment">/// Takes ownership of the key, leaving the entry vacant.
</span><span class="kw">pub fn </span>into_key(<span class="self">self</span>) -&gt; K {
<span class="self">self</span>.key
}
<span class="doccomment">/// Return the index where the key-value pair will be inserted.
</span><span class="kw">pub fn </span>index(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
<span class="self">self</span>.map.len()
}
<span class="doccomment">/// Inserts the entry&#39;s key and the given value into the map, and returns a mutable reference
/// to the value.
</span><span class="kw">pub fn </span>insert(<span class="self">self</span>, value: V) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>V {
<span class="kw">let </span>i = <span class="self">self</span>.map.push(<span class="self">self</span>.hash, <span class="self">self</span>.key, value);
<span class="kw-2">&amp;mut </span><span class="self">self</span>.map.entries[i].value
}
}
<span class="kw">impl</span>&lt;K: fmt::Debug, V&gt; fmt::Debug <span class="kw">for </span>VacantEntry&lt;<span class="lifetime">&#39;_</span>, K, V&gt; {
<span class="kw">fn </span>fmt(<span class="kw-2">&amp;</span><span class="self">self</span>, f: <span class="kw-2">&amp;mut </span>fmt::Formatter&lt;<span class="lifetime">&#39;_</span>&gt;) -&gt; fmt::Result {
f.debug_tuple(<span class="macro">stringify!</span>(VacantEntry))
.field(<span class="self">self</span>.key())
.finish()
}
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>assert_send_sync() {
<span class="kw">fn </span>assert_send_sync&lt;T: Send + Sync&gt;() {}
assert_send_sync::&lt;IndexMapCore&lt;i32, i32&gt;&gt;();
assert_send_sync::&lt;Entry&lt;<span class="lifetime">&#39;_</span>, i32, i32&gt;&gt;();
}
</code></pre></div>
</section></div></main><div id="rustdoc-vars" data-root-path="../../../" data-current-crate="indexmap" data-themes="ayu,dark,light" data-resource-suffix="" data-rustdoc-version="1.66.0-nightly (5c8bff74b 2022-10-21)" ></div></body></html>