<!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 to the Rust file `src/map.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>map.rs.html -- source</title><link rel="stylesheet" type="text/css" href="../../normalize.css"><link rel="stylesheet" type="text/css" href="../../rustdoc.css" id="mainThemeStyle"><link rel="stylesheet" type="text/css" href="../../dark.css"><link rel="stylesheet" type="text/css" href="../../light.css" id="themeStyle"><script src="../../storage.js"></script></head><body class="rustdoc source"><!--[if lte IE 8]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="sidebar"><div class="sidebar-menu">☰</div></nav><div class="theme-picker"><button id="theme-picker" aria-label="Pick another theme!"><img src="../../brush.svg" width="18" alt="Pick another theme!"></button><div id="theme-choices"></div></div><script src="../../theme.js"></script><nav class="sub"><form class="search-form js-only"><div class="search-container"><input class="search-input" name="search" autocomplete="off" placeholder="Click or press ‘S’ to search, ‘?’ for more options…" type="search"><a id="settings-menu" href="../../settings.html"><img src="../../wheel.svg" width="18" alt="Change settings"></a></div></form></nav><section id="main" class="content"><pre class="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>
</pre><pre class="rust ">
<span class="kw">use</span> <span class="ident">avl</span>::{<span class="ident">Iter</span>, <span class="ident">Tree</span>};
<span class="kw">use</span> <span class="ident">std</span>::{
<span class="ident">borrow</span>::<span class="ident">Borrow</span>,
<span class="ident">cmp</span>::{<span class="ident">Eq</span>, <span class="ident">Ord</span>, <span class="ident">Ordering</span>, <span class="ident">PartialEq</span>, <span class="ident">PartialOrd</span>},
<span class="ident">default</span>::<span class="ident">Default</span>,
<span class="ident">fmt</span>::{<span class="self">self</span>, <span class="ident">Debug</span>, <span class="ident">Formatter</span>},
<span class="ident">hash</span>::{<span class="ident">Hash</span>, <span class="ident">Hasher</span>},
<span class="ident">iter</span>::<span class="ident">FromIterator</span>,
<span class="ident">ops</span>::{<span class="ident">Bound</span>, <span class="ident">Index</span>},
};
<span class="doccomment">/// This Map uses a similar strategy to BTreeMap to ensure cache</span>
<span class="doccomment">/// efficient performance on modern hardware while still providing</span>
<span class="doccomment">/// log(N) get, insert, and remove operations.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// For good performance, it is very important to understand</span>
<span class="doccomment">/// that clone is a fundamental operation, it needs to be fast</span>
<span class="doccomment">/// for your key and data types, because it's going to be</span>
<span class="doccomment">/// called a lot whenever you change the map.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// # Why</span>
<span class="doccomment">///</span>
<span class="doccomment">/// 1. Multiple threads can read this structure even while one thread</span>
<span class="doccomment">/// is updating it. Using a library like arc_swap you can avoid ever</span>
<span class="doccomment">/// blocking readers.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// 2. Snapshotting this structure is free.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// # Examples</span>
<span class="doccomment">/// ```</span>
<span class="doccomment">/// use std::string::String;</span>
<span class="doccomment">/// use self::immutable_chunkmap::map::Map;</span>
<span class="doccomment">///</span>
<span class="doccomment">/// let m =</span>
<span class="doccomment">/// Map::new()</span>
<span class="doccomment">/// .insert(String::from("1"), 1).0</span>
<span class="doccomment">/// .insert(String::from("2"), 2).0</span>
<span class="doccomment">/// .insert(String::from("3"), 3).0;</span>
<span class="doccomment">///</span>
<span class="doccomment">/// assert_eq!(m.get("1"), Option::Some(&1));</span>
<span class="doccomment">/// assert_eq!(m.get("2"), Option::Some(&2));</span>
<span class="doccomment">/// assert_eq!(m.get("3"), Option::Some(&3));</span>
<span class="doccomment">/// assert_eq!(m.get("4"), Option::None);</span>
<span class="doccomment">///</span>
<span class="doccomment">/// for (k, v) in &m {</span>
<span class="doccomment">/// println!("key {}, val: {}", k, v)</span>
<span class="doccomment">/// }</span>
<span class="doccomment">/// ```</span>
<span class="attribute">#[<span class="ident">derive</span>(<span class="ident">Clone</span>)]</span>
<span class="kw">pub</span> <span class="kw">struct</span> <span class="ident">Map</span><span class="op"><</span><span class="ident">K</span>: <span class="ident">Ord</span> <span class="op">+</span> <span class="ident">Clone</span>, <span class="ident">V</span>: <span class="ident">Clone</span><span class="op">></span>(<span class="ident">Tree</span><span class="op"><</span><span class="ident">K</span>, <span class="ident">V</span><span class="op">></span>);
<span class="kw">impl</span><span class="op"><</span><span class="ident">K</span>, <span class="ident">V</span><span class="op">></span> <span class="ident">Hash</span> <span class="kw">for</span> <span class="ident">Map</span><span class="op"><</span><span class="ident">K</span>, <span class="ident">V</span><span class="op">></span>
<span class="kw">where</span>
<span class="ident">K</span>: <span class="ident">Hash</span> <span class="op">+</span> <span class="ident">Ord</span> <span class="op">+</span> <span class="ident">Clone</span>,
<span class="ident">V</span>: <span class="ident">Hash</span> <span class="op">+</span> <span class="ident">Clone</span>,
{
<span class="kw">fn</span> <span class="ident">hash</span><span class="op"><</span><span class="ident">H</span>: <span class="ident">Hasher</span><span class="op">></span>(<span class="kw-2">&</span><span class="self">self</span>, <span class="ident">state</span>: <span class="kw-2">&</span><span class="kw-2">mut</span> <span class="ident">H</span>) {
<span class="self">self</span>.<span class="number">0</span>.<span class="ident">hash</span>(<span class="ident">state</span>)
}
}
<span class="kw">impl</span><span class="op"><</span><span class="ident">K</span>, <span class="ident">V</span><span class="op">></span> <span class="ident">Default</span> <span class="kw">for</span> <span class="ident">Map</span><span class="op"><</span><span class="ident">K</span>, <span class="ident">V</span><span class="op">></span>
<span class="kw">where</span>
<span class="ident">K</span>: <span class="ident">Ord</span> <span class="op">+</span> <span class="ident">Clone</span>,
<span class="ident">V</span>: <span class="ident">Clone</span>,
{
<span class="kw">fn</span> <span class="ident">default</span>() <span class="op">-></span> <span class="ident">Map</span><span class="op"><</span><span class="ident">K</span>, <span class="ident">V</span><span class="op">></span> {
<span class="ident">Map</span>::<span class="ident">new</span>()
}
}
<span class="kw">impl</span><span class="op"><</span><span class="ident">K</span>, <span class="ident">V</span><span class="op">></span> <span class="ident">PartialEq</span> <span class="kw">for</span> <span class="ident">Map</span><span class="op"><</span><span class="ident">K</span>, <span class="ident">V</span><span class="op">></span>
<span class="kw">where</span>
<span class="ident">K</span>: <span class="ident">PartialEq</span> <span class="op">+</span> <span class="ident">Ord</span> <span class="op">+</span> <span class="ident">Clone</span>,
<span class="ident">V</span>: <span class="ident">PartialEq</span> <span class="op">+</span> <span class="ident">Clone</span>,
{
<span class="kw">fn</span> <span class="ident">eq</span>(<span class="kw-2">&</span><span class="self">self</span>, <span class="ident">other</span>: <span class="kw-2">&</span><span class="ident">Map</span><span class="op"><</span><span class="ident">K</span>, <span class="ident">V</span><span class="op">></span>) <span class="op">-></span> <span class="ident">bool</span> {
<span class="self">self</span>.<span class="number">0</span> <span class="op">==</span> <span class="ident">other</span>.<span class="number">0</span>
}
}
<span class="kw">impl</span><span class="op"><</span><span class="ident">K</span>, <span class="ident">V</span><span class="op">></span> <span class="ident">Eq</span> <span class="kw">for</span> <span class="ident">Map</span><span class="op"><</span><span class="ident">K</span>, <span class="ident">V</span><span class="op">></span>
<span class="kw">where</span>
<span class="ident">K</span>: <span class="ident">Eq</span> <span class="op">+</span> <span class="ident">Ord</span> <span class="op">+</span> <span class="ident">Clone</span>,
<span class="ident">V</span>: <span class="ident">Eq</span> <span class="op">+</span> <span class="ident">Clone</span>,
{
}
<span class="kw">impl</span><span class="op"><</span><span class="ident">K</span>, <span class="ident">V</span><span class="op">></span> <span class="ident">PartialOrd</span> <span class="kw">for</span> <span class="ident">Map</span><span class="op"><</span><span class="ident">K</span>, <span class="ident">V</span><span class="op">></span>
<span class="kw">where</span>
<span class="ident">K</span>: <span class="ident">Ord</span> <span class="op">+</span> <span class="ident">Clone</span>,
<span class="ident">V</span>: <span class="ident">PartialOrd</span> <span class="op">+</span> <span class="ident">Clone</span>,
{
<span class="kw">fn</span> <span class="ident">partial_cmp</span>(<span class="kw-2">&</span><span class="self">self</span>, <span class="ident">other</span>: <span class="kw-2">&</span><span class="ident">Map</span><span class="op"><</span><span class="ident">K</span>, <span class="ident">V</span><span class="op">></span>) <span class="op">-></span> <span class="prelude-ty">Option</span><span class="op"><</span><span class="ident">Ordering</span><span class="op">></span> {
<span class="self">self</span>.<span class="number">0</span>.<span class="ident">partial_cmp</span>(<span class="kw-2">&</span><span class="ident">other</span>.<span class="number">0</span>)
}
}
<span class="kw">impl</span><span class="op"><</span><span class="ident">K</span>, <span class="ident">V</span><span class="op">></span> <span class="ident">Ord</span> <span class="kw">for</span> <span class="ident">Map</span><span class="op"><</span><span class="ident">K</span>, <span class="ident">V</span><span class="op">></span>
<span class="kw">where</span>
<span class="ident">K</span>: <span class="ident">Ord</span> <span class="op">+</span> <span class="ident">Clone</span>,
<span class="ident">V</span>: <span class="ident">Ord</span> <span class="op">+</span> <span class="ident">Clone</span>,
{
<span class="kw">fn</span> <span class="ident">cmp</span>(<span class="kw-2">&</span><span class="self">self</span>, <span class="ident">other</span>: <span class="kw-2">&</span><span class="ident">Map</span><span class="op"><</span><span class="ident">K</span>, <span class="ident">V</span><span class="op">></span>) <span class="op">-></span> <span class="ident">Ordering</span> {
<span class="self">self</span>.<span class="number">0</span>.<span class="ident">cmp</span>(<span class="kw-2">&</span><span class="ident">other</span>.<span class="number">0</span>)
}
}
<span class="kw">impl</span><span class="op"><</span><span class="ident">K</span>, <span class="ident">V</span><span class="op">></span> <span class="ident">Debug</span> <span class="kw">for</span> <span class="ident">Map</span><span class="op"><</span><span class="ident">K</span>, <span class="ident">V</span><span class="op">></span>
<span class="kw">where</span>
<span class="ident">K</span>: <span class="ident">Debug</span> <span class="op">+</span> <span class="ident">Ord</span> <span class="op">+</span> <span class="ident">Clone</span>,
<span class="ident">V</span>: <span class="ident">Debug</span> <span class="op">+</span> <span class="ident">Clone</span>,
{
<span class="kw">fn</span> <span class="ident">fmt</span>(<span class="kw-2">&</span><span class="self">self</span>, <span class="ident">f</span>: <span class="kw-2">&</span><span class="kw-2">mut</span> <span class="ident">Formatter</span>) <span class="op">-></span> <span class="ident">fmt</span>::<span class="prelude-ty">Result</span> {
<span class="self">self</span>.<span class="number">0</span>.<span class="ident">fmt</span>(<span class="ident">f</span>)
}
}
<span class="kw">impl</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">Q</span>, <span class="ident">K</span>, <span class="ident">V</span><span class="op">></span> <span class="ident">Index</span><span class="op"><</span><span class="kw-2">&</span><span class="lifetime">'a</span> <span class="ident">Q</span><span class="op">></span> <span class="kw">for</span> <span class="ident">Map</span><span class="op"><</span><span class="ident">K</span>, <span class="ident">V</span><span class="op">></span>
<span class="kw">where</span>
<span class="ident">Q</span>: <span class="ident">Ord</span>,
<span class="ident">K</span>: <span class="ident">Ord</span> <span class="op">+</span> <span class="ident">Clone</span> <span class="op">+</span> <span class="ident">Borrow</span><span class="op"><</span><span class="ident">Q</span><span class="op">></span>,
<span class="ident">V</span>: <span class="ident">Clone</span>,
{
<span class="kw">type</span> <span class="ident">Output</span> <span class="op">=</span> <span class="ident">V</span>;
<span class="kw">fn</span> <span class="ident">index</span>(<span class="kw-2">&</span><span class="self">self</span>, <span class="ident">k</span>: <span class="kw-2">&</span><span class="ident">Q</span>) <span class="op">-></span> <span class="kw-2">&</span><span class="ident">V</span> {
<span class="self">self</span>.<span class="ident">get</span>(<span class="ident">k</span>).<span class="ident">expect</span>(<span class="string">"element not found for key"</span>)
}
}
<span class="kw">impl</span><span class="op"><</span><span class="ident">K</span>, <span class="ident">V</span><span class="op">></span> <span class="ident">FromIterator</span><span class="op"><</span>(<span class="ident">K</span>, <span class="ident">V</span>)<span class="op">></span> <span class="kw">for</span> <span class="ident">Map</span><span class="op"><</span><span class="ident">K</span>, <span class="ident">V</span><span class="op">></span>
<span class="kw">where</span>
<span class="ident">K</span>: <span class="ident">Ord</span> <span class="op">+</span> <span class="ident">Clone</span>,
<span class="ident">V</span>: <span class="ident">Clone</span>,
{
<span class="kw">fn</span> <span class="ident">from_iter</span><span class="op"><</span><span class="ident">T</span>: <span class="ident">IntoIterator</span><span class="op"><</span><span class="ident">Item</span> <span class="op">=</span> (<span class="ident">K</span>, <span class="ident">V</span>)<span class="op">>></span>(<span class="ident">iter</span>: <span class="ident">T</span>) <span class="op">-></span> <span class="self">Self</span> {
<span class="ident">Map</span>::<span class="ident">new</span>().<span class="ident">insert_many</span>(<span class="ident">iter</span>)
}
}
<span class="kw">impl</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">K</span>, <span class="ident">V</span><span class="op">></span> <span class="ident">IntoIterator</span> <span class="kw">for</span> <span class="kw-2">&</span><span class="lifetime">'a</span> <span class="ident">Map</span><span class="op"><</span><span class="ident">K</span>, <span class="ident">V</span><span class="op">></span>
<span class="kw">where</span>
<span class="ident">K</span>: <span class="lifetime">'a</span> <span class="op">+</span> <span class="ident">Borrow</span><span class="op"><</span><span class="ident">K</span><span class="op">></span> <span class="op">+</span> <span class="ident">Ord</span> <span class="op">+</span> <span class="ident">Clone</span>,
<span class="ident">V</span>: <span class="lifetime">'a</span> <span class="op">+</span> <span class="ident">Clone</span>,
{
<span class="kw">type</span> <span class="ident">Item</span> <span class="op">=</span> (<span class="kw-2">&</span><span class="lifetime">'a</span> <span class="ident">K</span>, <span class="kw-2">&</span><span class="lifetime">'a</span> <span class="ident">V</span>);
<span class="kw">type</span> <span class="ident">IntoIter</span> <span class="op">=</span> <span class="ident">Iter</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">K</span>, <span class="ident">K</span>, <span class="ident">V</span><span class="op">></span>;
<span class="kw">fn</span> <span class="ident">into_iter</span>(<span class="self">self</span>) <span class="op">-></span> <span class="self">Self</span>::<span class="ident">IntoIter</span> {
<span class="self">self</span>.<span class="number">0</span>.<span class="ident">into_iter</span>()
}
}
<span class="kw">impl</span><span class="op"><</span><span class="ident">K</span>, <span class="ident">V</span><span class="op">></span> <span class="ident">Map</span><span class="op"><</span><span class="ident">K</span>, <span class="ident">V</span><span class="op">></span>
<span class="kw">where</span>
<span class="ident">K</span>: <span class="ident">Ord</span> <span class="op">+</span> <span class="ident">Clone</span>,
<span class="ident">V</span>: <span class="ident">Clone</span>,
{
<span class="doccomment">/// Create a new empty map</span>
<span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">new</span>() <span class="op">-></span> <span class="self">Self</span> {
<span class="ident">Map</span>(<span class="ident">Tree</span>::<span class="ident">new</span>())
}
<span class="doccomment">/// This will insert many elements at once, and is</span>
<span class="doccomment">/// potentially a lot faster than inserting one by one,</span>
<span class="doccomment">/// especially if the data is sorted. It is just a wrapper</span>
<span class="doccomment">/// around the more general update_many method.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// #Examples</span>
<span class="doccomment">///```</span>
<span class="doccomment">/// use self::immutable_chunkmap::map::Map;</span>
<span class="doccomment">///</span>
<span class="doccomment">/// let mut v = vec![(1, 3), (10, 1), (-12, 2), (44, 0), (50, -1)];</span>
<span class="doccomment">/// v.sort_unstable_by_key(|&(k, _)| k);</span>
<span class="doccomment">///</span>
<span class="doccomment">/// let m = Map::new().insert_many(v.iter().map(|(k, v)| (*k, *v)));</span>
<span class="doccomment">///</span>
<span class="doccomment">/// for (k, v) in &v {</span>
<span class="doccomment">/// assert_eq!(m.get(k), Option::Some(v))</span>
<span class="doccomment">/// }</span>
<span class="doccomment">/// ```</span>
<span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">insert_many</span><span class="op"><</span><span class="ident">E</span>: <span class="ident">IntoIterator</span><span class="op"><</span><span class="ident">Item</span> <span class="op">=</span> (<span class="ident">K</span>, <span class="ident">V</span>)<span class="op">>></span>(<span class="kw-2">&</span><span class="self">self</span>, <span class="ident">elts</span>: <span class="ident">E</span>) <span class="op">-></span> <span class="self">Self</span> {
<span class="ident">Map</span>(<span class="self">self</span>.<span class="number">0</span>.<span class="ident">insert_many</span>(<span class="ident">elts</span>))
}
<span class="doccomment">/// This method updates multiple bindings in one call. Given an</span>
<span class="doccomment">/// iterator of an arbitrary type (Q, D), where Q is any borrowed</span>
<span class="doccomment">/// form of K, an update function taking Q, D, the current binding</span>
<span class="doccomment">/// in the map, if any, and producing the new binding, if any,</span>
<span class="doccomment">/// this method will produce a new map with updated bindings of</span>
<span class="doccomment">/// many elements at once. It will skip intermediate node</span>
<span class="doccomment">/// allocations where possible. If the data in elts is sorted, it</span>
<span class="doccomment">/// will be able to skip many more intermediate allocations, and</span>
<span class="doccomment">/// can produce a speedup of about 10x compared to</span>
<span class="doccomment">/// inserting/updating one by one. In any case it should always be</span>
<span class="doccomment">/// faster than inserting elements one by one, even with random</span>
<span class="doccomment">/// unsorted keys.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// #Examples</span>
<span class="doccomment">/// ```</span>
<span class="doccomment">/// use std::iter::FromIterator;</span>
<span class="doccomment">/// use self::immutable_chunkmap::map::Map;</span>
<span class="doccomment">///</span>
<span class="doccomment">/// let m = Map::from_iter((0..4).map(|k| (k, k)));</span>
<span class="doccomment">/// let m = m.update_many(</span>
<span class="doccomment">/// (0..4).map(|x| (x, ())),</span>
<span class="doccomment">/// |k, (), cur| cur.map(|(_, c)| (k, c + 1))</span>
<span class="doccomment">/// );</span>
<span class="doccomment">/// assert_eq!(</span>
<span class="doccomment">/// m.into_iter().map(|(k, v)| (*k, *v)).collect::<Vec<_>>(),</span>
<span class="doccomment">/// vec![(0, 1), (1, 2), (2, 3), (3, 4)]</span>
<span class="doccomment">/// );</span>
<span class="doccomment">/// ```</span>
<span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">update_many</span><span class="op"><</span><span class="ident">Q</span>, <span class="ident">D</span>, <span class="ident">E</span>, <span class="ident">F</span><span class="op">></span>(<span class="kw-2">&</span><span class="self">self</span>, <span class="ident">elts</span>: <span class="ident">E</span>, <span class="kw-2">mut</span> <span class="ident">f</span>: <span class="ident">F</span>) <span class="op">-></span> <span class="self">Self</span>
<span class="kw">where</span>
<span class="ident">E</span>: <span class="ident">IntoIterator</span><span class="op"><</span><span class="ident">Item</span> <span class="op">=</span> (<span class="ident">Q</span>, <span class="ident">D</span>)<span class="op">></span>,
<span class="ident">Q</span>: <span class="ident">Ord</span>,
<span class="ident">K</span>: <span class="ident">Borrow</span><span class="op"><</span><span class="ident">Q</span><span class="op">></span>,
<span class="ident">F</span>: <span class="ident">FnMut</span>(<span class="ident">Q</span>, <span class="ident">D</span>, <span class="prelude-ty">Option</span><span class="op"><</span>(<span class="kw-2">&</span><span class="ident">K</span>, <span class="kw-2">&</span><span class="ident">V</span>)<span class="op">></span>) <span class="op">-></span> <span class="prelude-ty">Option</span><span class="op"><</span>(<span class="ident">K</span>, <span class="ident">V</span>)<span class="op">></span>,
{
<span class="ident">Map</span>(<span class="self">self</span>.<span class="number">0</span>.<span class="ident">update_many</span>(<span class="ident">elts</span>, <span class="kw-2">&</span><span class="kw-2">mut</span> <span class="ident">f</span>))
}
<span class="doccomment">/// return a new map with (k, v) inserted into it. If k</span>
<span class="doccomment">/// already exists in the old map, the old binding will be</span>
<span class="doccomment">/// returned, and the new map will contain the new</span>
<span class="doccomment">/// binding. In fact this method is just a wrapper around</span>
<span class="doccomment">/// update.</span>
<span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">insert</span>(<span class="kw-2">&</span><span class="self">self</span>, <span class="ident">k</span>: <span class="ident">K</span>, <span class="ident">v</span>: <span class="ident">V</span>) <span class="op">-></span> (<span class="self">Self</span>, <span class="prelude-ty">Option</span><span class="op"><</span><span class="ident">V</span><span class="op">></span>) {
<span class="kw">let</span> (<span class="ident">root</span>, <span class="ident">prev</span>) <span class="op">=</span> <span class="self">self</span>.<span class="number">0</span>.<span class="ident">insert</span>(<span class="ident">k</span>, <span class="ident">v</span>);
(<span class="ident">Map</span>(<span class="ident">root</span>), <span class="ident">prev</span>)
}
<span class="doccomment">/// return a new map with the binding for q, which can be any</span>
<span class="doccomment">/// borrowed form of k, updated to the result of f. If f returns</span>
<span class="doccomment">/// None, the binding will be removed from the new map, otherwise</span>
<span class="doccomment">/// it will be inserted. This function is more efficient than</span>
<span class="doccomment">/// calling `get` and then `insert`, since it makes only one tree</span>
<span class="doccomment">/// traversal instead of two. This method runs in log(N) time and</span>
<span class="doccomment">/// space where N is the size of the map.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// # Examples</span>
<span class="doccomment">/// ```</span>
<span class="doccomment">/// use self::immutable_chunkmap::map::Map;</span>
<span class="doccomment">///</span>
<span class="doccomment">/// let (m, _) = Map::new().update(0, 0, |k, d, _| Some((k, d)));</span>
<span class="doccomment">/// let (m, _) = m.update(1, 1, |k, d, _| Some((k, d)));</span>
<span class="doccomment">/// let (m, _) = m.update(2, 2, |k, d, _| Some((k, d)));</span>
<span class="doccomment">/// assert_eq!(m.get(&0), Some(&0));</span>
<span class="doccomment">/// assert_eq!(m.get(&1), Some(&1));</span>
<span class="doccomment">/// assert_eq!(m.get(&2), Some(&2));</span>
<span class="doccomment">///</span>
<span class="doccomment">/// let (m, _) = m.update(0, (), |k, (), v| v.map(move |(_, v)| (k, v + 1)));</span>
<span class="doccomment">/// assert_eq!(m.get(&0), Some(&1));</span>
<span class="doccomment">/// assert_eq!(m.get(&1), Some(&1));</span>
<span class="doccomment">/// assert_eq!(m.get(&2), Some(&2));</span>
<span class="doccomment">///</span>
<span class="doccomment">/// let (m, _) = m.update(1, (), |_, (), _| None);</span>
<span class="doccomment">/// assert_eq!(m.get(&0), Some(&1));</span>
<span class="doccomment">/// assert_eq!(m.get(&1), None);</span>
<span class="doccomment">/// assert_eq!(m.get(&2), Some(&2));</span>
<span class="doccomment">/// ```</span>
<span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">update</span><span class="op"><</span><span class="ident">Q</span>, <span class="ident">D</span>, <span class="ident">F</span><span class="op">></span>(<span class="kw-2">&</span><span class="self">self</span>, <span class="ident">q</span>: <span class="ident">Q</span>, <span class="ident">d</span>: <span class="ident">D</span>, <span class="kw-2">mut</span> <span class="ident">f</span>: <span class="ident">F</span>) <span class="op">-></span> (<span class="self">Self</span>, <span class="prelude-ty">Option</span><span class="op"><</span><span class="ident">V</span><span class="op">></span>)
<span class="kw">where</span>
<span class="ident">Q</span>: <span class="ident">Ord</span>,
<span class="ident">K</span>: <span class="ident">Borrow</span><span class="op"><</span><span class="ident">Q</span><span class="op">></span>,
<span class="ident">F</span>: <span class="ident">FnMut</span>(<span class="ident">Q</span>, <span class="ident">D</span>, <span class="prelude-ty">Option</span><span class="op"><</span>(<span class="kw-2">&</span><span class="ident">K</span>, <span class="kw-2">&</span><span class="ident">V</span>)<span class="op">></span>) <span class="op">-></span> <span class="prelude-ty">Option</span><span class="op"><</span>(<span class="ident">K</span>, <span class="ident">V</span>)<span class="op">></span>,
{
<span class="kw">let</span> (<span class="ident">root</span>, <span class="ident">prev</span>) <span class="op">=</span> <span class="self">self</span>.<span class="number">0</span>.<span class="ident">update</span>(<span class="ident">q</span>, <span class="ident">d</span>, <span class="kw-2">&</span><span class="kw-2">mut</span> <span class="ident">f</span>);
(<span class="ident">Map</span>(<span class="ident">root</span>), <span class="ident">prev</span>)
}
<span class="doccomment">/// Merge two maps together. Bindings that exist in both maps will</span>
<span class="doccomment">/// be passed to f, which may elect to remove the binding by</span>
<span class="doccomment">/// returning None. This function runs in O(log(n) + m) time and</span>
<span class="doccomment">/// space, where n is the size of the largest map, and m is the</span>
<span class="doccomment">/// number of intersecting chunks. It will never be slower than</span>
<span class="doccomment">/// calling update_many on the first map with an iterator over the</span>
<span class="doccomment">/// second, and will be significantly faster if the intersection</span>
<span class="doccomment">/// is minimal or empty.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// # Examples</span>
<span class="doccomment">/// ```</span>
<span class="doccomment">/// use std::iter::FromIterator;</span>
<span class="doccomment">/// use self::immutable_chunkmap::map::Map;</span>
<span class="doccomment">///</span>
<span class="doccomment">/// let m0 = Map::from_iter((0..10).map(|k| (k, 1)));</span>
<span class="doccomment">/// let m1 = Map::from_iter((10..20).map(|k| (k, 1)));</span>
<span class="doccomment">/// let m2 = m0.merge(&m1, |_k, _v0, _v1| panic!("no intersection expected"));</span>
<span class="doccomment">///</span>
<span class="doccomment">/// for i in 0..20 {</span>
<span class="doccomment">/// assert!(m2.get(&i).is_some())</span>
<span class="doccomment">/// }</span>
<span class="doccomment">///</span>
<span class="doccomment">/// let m3 = Map::from_iter((5..9).map(|k| (k, 1)));</span>
<span class="doccomment">/// let m4 = m3.merge(&m2, |_k, v0, v1| Some(v0 + v1));</span>
<span class="doccomment">///</span>
<span class="doccomment">/// for i in 0..20 {</span>
<span class="doccomment">/// assert!(</span>
<span class="doccomment">/// *m4.get(&i).unwrap() ==</span>
<span class="doccomment">/// *m3.get(&i).unwrap_or(&0) + *m2.get(&i).unwrap_or(&0)</span>
<span class="doccomment">/// )</span>
<span class="doccomment">/// }</span>
<span class="doccomment">/// ```</span>
<span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">merge</span><span class="op"><</span><span class="ident">F</span><span class="op">></span>(<span class="kw-2">&</span><span class="self">self</span>, <span class="ident">other</span>: <span class="kw-2">&</span><span class="ident">Map</span><span class="op"><</span><span class="ident">K</span>, <span class="ident">V</span><span class="op">></span>, <span class="kw-2">mut</span> <span class="ident">f</span>: <span class="ident">F</span>) <span class="op">-></span> <span class="self">Self</span>
<span class="kw">where</span>
<span class="ident">F</span>: <span class="ident">FnMut</span>(<span class="kw-2">&</span><span class="ident">K</span>, <span class="kw-2">&</span><span class="ident">V</span>, <span class="kw-2">&</span><span class="ident">V</span>) <span class="op">-></span> <span class="prelude-ty">Option</span><span class="op"><</span><span class="ident">V</span><span class="op">></span>,
{
<span class="ident">Map</span>(<span class="ident">Tree</span>::<span class="ident">merge</span>(<span class="kw-2">&</span><span class="self">self</span>.<span class="number">0</span>, <span class="kw-2">&</span><span class="ident">other</span>.<span class="number">0</span>, <span class="kw-2">&</span><span class="kw-2">mut</span> <span class="ident">f</span>))
}
<span class="doccomment">/// lookup the mapping for k. If it doesn't exist return</span>
<span class="doccomment">/// None. Runs in log(N) time and constant space. where N</span>
<span class="doccomment">/// is the size of the map.</span>
<span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">get</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">Q</span>: <span class="question-mark">?</span><span class="ident">Sized</span> <span class="op">+</span> <span class="ident">Ord</span><span class="op">></span>(<span class="kw-2">&</span><span class="lifetime">'a</span> <span class="self">self</span>, <span class="ident">k</span>: <span class="kw-2">&</span><span class="ident">Q</span>) <span class="op">-></span> <span class="prelude-ty">Option</span><span class="op"><</span><span class="kw-2">&</span><span class="lifetime">'a</span> <span class="ident">V</span><span class="op">></span>
<span class="kw">where</span>
<span class="ident">K</span>: <span class="ident">Borrow</span><span class="op"><</span><span class="ident">Q</span><span class="op">></span>,
{
<span class="self">self</span>.<span class="number">0</span>.<span class="ident">get</span>(<span class="ident">k</span>)
}
<span class="doccomment">/// lookup the mapping for k. Return the key. If it doesn't exist</span>
<span class="doccomment">/// return None. Runs in log(N) time and constant space. where N</span>
<span class="doccomment">/// is the size of the map.</span>
<span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">get_key</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">Q</span>: <span class="question-mark">?</span><span class="ident">Sized</span> <span class="op">+</span> <span class="ident">Ord</span><span class="op">></span>(<span class="kw-2">&</span><span class="lifetime">'a</span> <span class="self">self</span>, <span class="ident">k</span>: <span class="kw-2">&</span><span class="ident">Q</span>) <span class="op">-></span> <span class="prelude-ty">Option</span><span class="op"><</span><span class="kw-2">&</span><span class="lifetime">'a</span> <span class="ident">K</span><span class="op">></span>
<span class="kw">where</span>
<span class="ident">K</span>: <span class="ident">Borrow</span><span class="op"><</span><span class="ident">Q</span><span class="op">></span>,
{
<span class="self">self</span>.<span class="number">0</span>.<span class="ident">get_key</span>(<span class="ident">k</span>)
}
<span class="doccomment">/// lookup the mapping for k. Return both the key and the</span>
<span class="doccomment">/// value. If it doesn't exist return None. Runs in log(N) time</span>
<span class="doccomment">/// and constant space. where N is the size of the map.</span>
<span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">get_full</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">Q</span>: <span class="question-mark">?</span><span class="ident">Sized</span> <span class="op">+</span> <span class="ident">Ord</span><span class="op">></span>(<span class="kw-2">&</span><span class="lifetime">'a</span> <span class="self">self</span>, <span class="ident">k</span>: <span class="kw-2">&</span><span class="ident">Q</span>) <span class="op">-></span> <span class="prelude-ty">Option</span><span class="op"><</span>(<span class="kw-2">&</span><span class="lifetime">'a</span> <span class="ident">K</span>, <span class="kw-2">&</span><span class="lifetime">'a</span> <span class="ident">V</span>)<span class="op">></span>
<span class="kw">where</span>
<span class="ident">K</span>: <span class="ident">Borrow</span><span class="op"><</span><span class="ident">Q</span><span class="op">></span>,
{
<span class="self">self</span>.<span class="number">0</span>.<span class="ident">get_full</span>(<span class="ident">k</span>)
}
<span class="doccomment">/// return a new map with the mapping under k removed. If</span>
<span class="doccomment">/// the binding existed in the old map return it. Runs in</span>
<span class="doccomment">/// log(N) time and log(N) space, where N is the size of</span>
<span class="doccomment">/// the map.</span>
<span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">remove</span><span class="op"><</span><span class="ident">Q</span>: <span class="ident">Sized</span> <span class="op">+</span> <span class="ident">Ord</span><span class="op">></span>(<span class="kw-2">&</span><span class="self">self</span>, <span class="ident">k</span>: <span class="kw-2">&</span><span class="ident">Q</span>) <span class="op">-></span> (<span class="self">Self</span>, <span class="prelude-ty">Option</span><span class="op"><</span><span class="ident">V</span><span class="op">></span>)
<span class="kw">where</span>
<span class="ident">K</span>: <span class="ident">Borrow</span><span class="op"><</span><span class="ident">Q</span><span class="op">></span>,
{
<span class="kw">let</span> (<span class="ident">t</span>, <span class="ident">prev</span>) <span class="op">=</span> <span class="self">self</span>.<span class="number">0</span>.<span class="ident">remove</span>(<span class="ident">k</span>);
(<span class="ident">Map</span>(<span class="ident">t</span>), <span class="ident">prev</span>)
}
<span class="doccomment">/// get the number of elements in the map O(1) time and space</span>
<span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">len</span>(<span class="kw-2">&</span><span class="self">self</span>) <span class="op">-></span> <span class="ident">usize</span> {
<span class="self">self</span>.<span class="number">0</span>.<span class="ident">len</span>()
}
<span class="doccomment">/// return an iterator over the subset of elements in the</span>
<span class="doccomment">/// map that are within the specified range.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// The returned iterator runs in O(log(N) + M) time, and</span>
<span class="doccomment">/// constant space. N is the number of elements in the</span>
<span class="doccomment">/// tree, and M is the number of elements you examine.</span>
<span class="doccomment">///</span>
<span class="doccomment">/// if lbound >= ubound the returned iterator will be empty</span>
<span class="kw">pub</span> <span class="kw">fn</span> <span class="ident">range</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">Q</span><span class="op">></span>(<span class="kw-2">&</span><span class="lifetime">'a</span> <span class="self">self</span>, <span class="ident">lbound</span>: <span class="ident">Bound</span><span class="op"><</span><span class="ident">Q</span><span class="op">></span>, <span class="ident">ubound</span>: <span class="ident">Bound</span><span class="op"><</span><span class="ident">Q</span><span class="op">></span>) <span class="op">-></span> <span class="ident">Iter</span><span class="op"><</span><span class="lifetime">'a</span>, <span class="ident">Q</span>, <span class="ident">K</span>, <span class="ident">V</span><span class="op">></span>
<span class="kw">where</span>
<span class="ident">Q</span>: <span class="ident">Ord</span>,
<span class="ident">K</span>: <span class="ident">Borrow</span><span class="op"><</span><span class="ident">Q</span><span class="op">></span>,
{
<span class="self">self</span>.<span class="number">0</span>.<span class="ident">range</span>(<span class="ident">lbound</span>, <span class="ident">ubound</span>)
}
}
<span class="kw">impl</span><span class="op"><</span><span class="ident">K</span>, <span class="ident">V</span><span class="op">></span> <span class="ident">Map</span><span class="op"><</span><span class="ident">K</span>, <span class="ident">V</span><span class="op">></span>
<span class="kw">where</span>
<span class="ident">K</span>: <span class="ident">Ord</span> <span class="op">+</span> <span class="ident">Clone</span> <span class="op">+</span> <span class="ident">Debug</span>,
<span class="ident">V</span>: <span class="ident">Clone</span> <span class="op">+</span> <span class="ident">Debug</span>,
{
<span class="attribute">#[<span class="ident">allow</span>(<span class="ident">dead_code</span>)]</span>
<span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn</span> <span class="ident">invariant</span>(<span class="kw-2">&</span><span class="self">self</span>) <span class="op">-></span> () {
<span class="self">self</span>.<span class="number">0</span>.<span class="ident">invariant</span>()
}
}
</pre>
</section><section id="search" class="content hidden"></section><section class="footer"></section><aside id="help" class="hidden"><div><h1 class="hidden">Help</h1><div class="shortcuts"><h2>Keyboard Shortcuts</h2><dl><dt><kbd>?</kbd></dt><dd>Show this help dialog</dd><dt><kbd>S</kbd></dt><dd>Focus the search field</dd><dt><kbd>↑</kbd></dt><dd>Move up in search results</dd><dt><kbd>↓</kbd></dt><dd>Move down in search results</dd><dt><kbd>↹</kbd></dt><dd>Switch tab</dd><dt><kbd>⏎</kbd></dt><dd>Go to active search result</dd><dt><kbd>+</kbd></dt><dd>Expand all sections</dd><dt><kbd>-</kbd></dt><dd>Collapse all sections</dd></dl></div><div class="infos"><h2>Search Tricks</h2><p>Prefix searches with a type followed by a colon (e.g. <code>fn:</code>) to restrict the search to a given type.</p><p>Accepted types are: <code>fn</code>, <code>mod</code>, <code>struct</code>, <code>enum</code>, <code>trait</code>, <code>type</code>, <code>macro</code>, and <code>const</code>.</p><p>Search functions by type signature (e.g. <code>vec -> usize</code> or <code>* -> vec</code>)</p><p>Search multiple things at once by splitting your query with comma (e.g. <code>str,u8</code> or <code>String,struct:Vec,test</code>)</p></div></div></aside><script>window.rootPath = "../../";window.currentCrate = "immutable_chunkmap";</script><script src="../../aliases.js"></script><script src="../../main.js"></script><script defer src="../../search-index.js"></script></body></html>