api-docs/crates-enclave/src/tantivy/postings/stacker/term_hashmap.rs.html - incubator-teaclave-website - Git at Google

 <!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Source of the Rust file `/root/.cargo/git/checkouts/tantivy-65d0bbbddbbd5d02/433372d/src/postings/stacker/term_hashmap.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>term_hashmap.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="../../../../tantivy/index.html"><div class="logo-container">
                     <img src="http://fulmicoton.com/tantivy-logo/tantivy-logo.png" alt="logo"></div></a></nav><main><div class="width-limiter"><nav class="sub"><a class="sub-logo-container" href="../../../../tantivy/index.html">
                         <img src="http://fulmicoton.com/tantivy-logo/tantivy-logo.png" 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>
 </pre><pre class="rust"><code><span class="kw">use </span>std::{iter, mem, slice};

 <span class="kw">use </span>byteorder::{ByteOrder, NativeEndian};
 <span class="kw">use </span>murmurhash32::murmurhash2;

 <span class="kw">use super</span>::{Addr, MemoryArena};
 <span class="kw">use </span><span class="kw">crate</span>::postings::stacker::memory_arena::store;
 <span class="kw">use </span><span class="kw">crate</span>::postings::UnorderedTermId;
 <span class="kw">use </span><span class="kw">crate</span>::Term;

 <span class="doccomment">/// Returns the actual memory size in bytes
 /// required to create a table with a given capacity.
 /// required to create a table of size
 </span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>compute_table_size(capacity: usize) -&gt; usize {
     capacity * mem::size_of::&lt;KeyValue&gt;()
 }

 <span class="doccomment">/// `KeyValue` is the item stored in the hash table.
 /// The key is actually a `BytesRef` object stored in an external memory arena.
 /// The `value_addr` also points to an address in the memory arena.
 </span><span class="attribute">#[derive(Copy, Clone)]
 </span><span class="kw">struct </span>KeyValue {
     key_value_addr: Addr,
     hash: u32,
     unordered_term_id: UnorderedTermId,
 }

 <span class="kw">impl </span>Default <span class="kw">for </span>KeyValue {
     <span class="kw">fn </span>default() -&gt; <span class="self">Self </span>{
         KeyValue {
             key_value_addr: Addr::null_pointer(),
             hash: <span class="number">0u32</span>,
             unordered_term_id: UnorderedTermId::default(),
         }
     }
 }

 <span class="kw">impl </span>KeyValue {
     <span class="kw">fn </span>is_empty(<span class="self">self</span>) -&gt; bool {
         <span class="self">self</span>.key_value_addr.is_null()
     }
 }

 <span class="doccomment">/// Customized `HashMap` with string keys
 ///
 /// This `HashMap` takes String as keys. Keys are
 /// stored in a user defined memory arena.
 ///
 /// The quirky API has the benefit of avoiding
 /// the computation of the hash of the key twice,
 /// or copying the key as long as there is no insert.
 </span><span class="kw">pub struct </span>TermHashMap {
     table: Box&lt;[KeyValue]&gt;,
     memory_arena: MemoryArena,
     mask: usize,
     occupied: Vec&lt;usize&gt;,
     len: usize,
 }

 <span class="kw">struct </span>QuadraticProbing {
     hash: usize,
     i: usize,
     mask: usize,
 }

 <span class="kw">impl </span>QuadraticProbing {
     <span class="kw">fn </span>compute(hash: usize, mask: usize) -&gt; QuadraticProbing {
         QuadraticProbing { hash, i: <span class="number">0</span>, mask }
     }

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

 <span class="kw">pub struct </span>Iter&lt;<span class="lifetime">&#39;a</span>&gt; {
     hashmap: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>TermHashMap,
     inner: slice::Iter&lt;<span class="lifetime">&#39;a</span>, usize&gt;,
 }

 <span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>&gt; Iterator <span class="kw">for </span>Iter&lt;<span class="lifetime">&#39;a</span>&gt; {
     <span class="kw">type </span>Item = (Term&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>[u8]&gt;, Addr, UnorderedTermId);

     <span class="kw">fn </span>next(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="self">Self</span>::Item&gt; {
         <span class="self">self</span>.inner.next().cloned().map(<span class="kw">move </span>|bucket: usize| {
             <span class="kw">let </span>kv = <span class="self">self</span>.hashmap.table[bucket];
             <span class="kw">let </span>(key, offset): (<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>[u8], Addr) = <span class="self">self</span>.hashmap.get_key_value(kv.key_value_addr);
             (Term::wrap(key), offset, kv.unordered_term_id)
         })
     }
 }

 <span class="doccomment">/// Returns the greatest power of two lower or equal to `n`.
 /// Except if n == 0, in that case, return 1.
 ///
 /// # Panics if n == 0
 </span><span class="kw">fn </span>compute_previous_power_of_two(n: usize) -&gt; usize {
     <span class="macro">assert!</span>(n &gt; <span class="number">0</span>);
     <span class="kw">let </span>msb = (<span class="number">63u32 </span>- (n <span class="kw">as </span>u64).leading_zeros()) <span class="kw">as </span>u8;
     <span class="number">1 </span>&lt;&lt; msb
 }

 <span class="kw">impl </span>TermHashMap {
     <span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>new(table_size: usize) -&gt; TermHashMap {
         <span class="macro">assert!</span>(table_size &gt; <span class="number">0</span>);
         <span class="kw">let </span>table_size_power_of_2 = compute_previous_power_of_two(table_size);
         <span class="kw">let </span>memory_arena = MemoryArena::new();
         <span class="kw">let </span>table: Vec&lt;KeyValue&gt; = iter::repeat(KeyValue::default())
             .take(table_size_power_of_2)
             .collect();
         TermHashMap {
             table: table.into_boxed_slice(),
             memory_arena,
             mask: table_size_power_of_2 - <span class="number">1</span>,
             occupied: Vec::with_capacity(table_size_power_of_2 / <span class="number">2</span>),
             len: <span class="number">0</span>,
         }
     }

     <span class="kw">pub fn </span>read&lt;Item: Copy + <span class="lifetime">&#39;static</span>&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, addr: Addr) -&gt; Item {
         <span class="self">self</span>.memory_arena.read(addr)
     }

     <span class="kw">fn </span>probe(<span class="kw-2">&amp;</span><span class="self">self</span>, hash: u32) -&gt; QuadraticProbing {
         QuadraticProbing::compute(hash <span class="kw">as </span>usize, <span class="self">self</span>.mask)
     }

     <span class="kw">pub fn </span>mem_usage(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
         <span class="self">self</span>.table.len() * mem::size_of::&lt;KeyValue&gt;()
     }

     <span class="kw">fn </span>is_saturated(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; bool {
         <span class="self">self</span>.table.len() &lt; <span class="self">self</span>.occupied.len() * <span class="number">3
     </span>}

     <span class="attribute">#[inline]
     </span><span class="kw">fn </span>get_key_value(<span class="kw-2">&amp;</span><span class="self">self</span>, addr: Addr) -&gt; (<span class="kw-2">&amp;</span>[u8], Addr) {
         <span class="kw">let </span>data = <span class="self">self</span>.memory_arena.slice_from(addr);
         <span class="kw">let </span>key_bytes_len = NativeEndian::read_u16(data) <span class="kw">as </span>usize;
         <span class="kw">let </span>key_bytes: <span class="kw-2">&amp;</span>[u8] = <span class="kw-2">&amp;</span>data[<span class="number">2</span>..][..key_bytes_len];
         (key_bytes, addr.offset(<span class="number">2u32 </span>+ key_bytes_len <span class="kw">as </span>u32))
     }

     <span class="attribute">#[inline]
     </span><span class="kw">fn </span>get_value_addr_if_key_match(<span class="kw-2">&amp;</span><span class="self">self</span>, target_key: <span class="kw-2">&amp;</span>[u8], addr: Addr) -&gt; <span class="prelude-ty">Option</span>&lt;Addr&gt; {
         <span class="kw">let </span>(stored_key, value_addr) = <span class="self">self</span>.get_key_value(addr);
         <span class="kw">if </span>stored_key == target_key {
             <span class="prelude-val">Some</span>(value_addr)
         } <span class="kw">else </span>{
             <span class="prelude-val">None
         </span>}
     }

     <span class="kw">fn </span>set_bucket(<span class="kw-2">&amp;mut </span><span class="self">self</span>, hash: u32, key_value_addr: Addr, bucket: usize) -&gt; UnorderedTermId {
         <span class="self">self</span>.occupied.push(bucket);
         <span class="kw">let </span>unordered_term_id = <span class="self">self</span>.len <span class="kw">as </span>UnorderedTermId;
         <span class="self">self</span>.len += <span class="number">1</span>;
         <span class="self">self</span>.table[bucket] = KeyValue {
             key_value_addr,
             hash,
             unordered_term_id,
         };
         unordered_term_id
     }

     <span class="kw">pub fn </span>len(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
         <span class="self">self</span>.len
     }

     <span class="kw">pub fn </span>iter(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; Iter&lt;<span class="lifetime">&#39;_</span>&gt; {
         Iter {
             inner: <span class="self">self</span>.occupied.iter(),
             hashmap: <span class="self">self</span>,
         }
     }

     <span class="kw">fn </span>resize(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
         <span class="kw">let </span>new_len = <span class="self">self</span>.table.len() * <span class="number">2</span>;
         <span class="kw">let </span>mask = new_len - <span class="number">1</span>;
         <span class="self">self</span>.mask = mask;
         <span class="kw">let </span>new_table = <span class="macro">vec!</span>[KeyValue::default(); new_len].into_boxed_slice();
         <span class="kw">let </span>old_table = mem::replace(<span class="kw-2">&amp;mut </span><span class="self">self</span>.table, new_table);
         <span class="kw">for </span>old_pos <span class="kw">in </span><span class="self">self</span>.occupied.iter_mut() {
             <span class="kw">let </span>key_value: KeyValue = old_table[<span class="kw-2">*</span>old_pos];
             <span class="kw">let </span><span class="kw-2">mut </span>probe = QuadraticProbing::compute(key_value.hash <span class="kw">as </span>usize, mask);
             <span class="kw">loop </span>{
                 <span class="kw">let </span>bucket = probe.next_probe();
                 <span class="kw">if </span><span class="self">self</span>.table[bucket].is_empty() {
                     <span class="kw-2">*</span>old_pos = bucket;
                     <span class="self">self</span>.table[bucket] = key_value;
                     <span class="kw">break</span>;
                 }
             }
         }
     }

     <span class="doccomment">/// `update` create a new entry for a given key if it does not exists
     /// or updates the existing entry.
     ///
     /// The actual logic for this update is define in the `updater`
     /// argument.
     ///
     /// If the key is not present, `updater` will receive `None` and
     /// will be in charge of returning a default value.
     /// If the key already as an associated value, then it will be passed
     /// `Some(previous_value)`.
     </span><span class="kw">pub fn </span>mutate_or_create&lt;V, TMutator&gt;(
         <span class="kw-2">&amp;mut </span><span class="self">self</span>,
         key: <span class="kw-2">&amp;</span>[u8],
         <span class="kw-2">mut </span>updater: TMutator,
     ) -&gt; UnorderedTermId
     <span class="kw">where
         </span>V: Copy + <span class="lifetime">&#39;static</span>,
         TMutator: FnMut(<span class="prelude-ty">Option</span>&lt;V&gt;) -&gt; V,
     {
         <span class="kw">if </span><span class="self">self</span>.is_saturated() {
             <span class="self">self</span>.resize();
         }
         <span class="kw">let </span>hash = murmurhash2(key);
         <span class="kw">let </span><span class="kw-2">mut </span>probe = <span class="self">self</span>.probe(hash);
         <span class="kw">loop </span>{
             <span class="kw">let </span>bucket = probe.next_probe();
             <span class="kw">let </span>kv: KeyValue = <span class="self">self</span>.table[bucket];
             <span class="kw">if </span>kv.is_empty() {
                 <span class="comment">// The key does not exists yet.
                 </span><span class="kw">let </span>val = updater(<span class="prelude-val">None</span>);
                 <span class="kw">let </span>num_bytes = std::mem::size_of::&lt;u16&gt;() + key.len() + std::mem::size_of::&lt;V&gt;();
                 <span class="kw">let </span>key_addr = <span class="self">self</span>.memory_arena.allocate_space(num_bytes);
                 {
                     <span class="kw">let </span>data = <span class="self">self</span>.memory_arena.slice_mut(key_addr, num_bytes);
                     NativeEndian::write_u16(data, key.len() <span class="kw">as </span>u16);
                     <span class="kw">let </span>stop = <span class="number">2 </span>+ key.len();
                     data[<span class="number">2</span>..stop].copy_from_slice(key);
                     store(<span class="kw-2">&amp;mut </span>data[stop..], val);
                 }
                 <span class="kw">return </span><span class="self">self</span>.set_bucket(hash, key_addr, bucket);
             } <span class="kw">else if </span>kv.hash == hash {
                 <span class="kw">if let </span><span class="prelude-val">Some</span>(val_addr) = <span class="self">self</span>.get_value_addr_if_key_match(key, kv.key_value_addr) {
                     <span class="kw">let </span>v = <span class="self">self</span>.memory_arena.read(val_addr);
                     <span class="kw">let </span>new_v = updater(<span class="prelude-val">Some</span>(v));
                     <span class="self">self</span>.memory_arena.write_at(val_addr, new_v);
                     <span class="kw">return </span>kv.unordered_term_id;
                 }
             }
         }
     }
 }

 <span class="attribute">#[cfg(test)]
 </span><span class="kw">mod </span>tests {

     <span class="kw">use </span>std::collections::HashMap;

     <span class="kw">use super</span>::{compute_previous_power_of_two, TermHashMap};

     <span class="attribute">#[test]
     </span><span class="kw">fn </span>test_hash_map() {
         <span class="kw">let </span><span class="kw-2">mut </span>hash_map: TermHashMap = TermHashMap::new(<span class="number">1 </span>&lt;&lt; <span class="number">18</span>);
         hash_map.mutate_or_create(<span class="string">b&quot;abc&quot;</span>, |opt_val: <span class="prelude-ty">Option</span>&lt;u32&gt;| {
             <span class="macro">assert_eq!</span>(opt_val, <span class="prelude-val">None</span>);
             <span class="number">3u32
         </span>});
         hash_map.mutate_or_create(<span class="string">b&quot;abcd&quot;</span>, |opt_val: <span class="prelude-ty">Option</span>&lt;u32&gt;| {
             <span class="macro">assert_eq!</span>(opt_val, <span class="prelude-val">None</span>);
             <span class="number">4u32
         </span>});
         hash_map.mutate_or_create(<span class="string">b&quot;abc&quot;</span>, |opt_val: <span class="prelude-ty">Option</span>&lt;u32&gt;| {
             <span class="macro">assert_eq!</span>(opt_val, <span class="prelude-val">Some</span>(<span class="number">3u32</span>));
             <span class="number">5u32
         </span>});
         <span class="kw">let </span><span class="kw-2">mut </span>vanilla_hash_map = HashMap::new();
         <span class="kw">let </span>iter_values = hash_map.iter();
         <span class="kw">for </span>(key, addr, <span class="kw">_</span>) <span class="kw">in </span>iter_values {
             <span class="kw">let </span>val: u32 = hash_map.memory_arena.read(addr);
             vanilla_hash_map.insert(key.to_owned(), val);
         }
         <span class="macro">assert_eq!</span>(vanilla_hash_map.len(), <span class="number">2</span>);
     }

     <span class="attribute">#[test]
     </span><span class="kw">fn </span>test_compute_previous_power_of_two() {
         <span class="macro">assert_eq!</span>(compute_previous_power_of_two(<span class="number">8</span>), <span class="number">8</span>);
         <span class="macro">assert_eq!</span>(compute_previous_power_of_two(<span class="number">9</span>), <span class="number">8</span>);
         <span class="macro">assert_eq!</span>(compute_previous_power_of_two(<span class="number">7</span>), <span class="number">4</span>);
         <span class="macro">assert_eq!</span>(compute_previous_power_of_two(u64::MAX <span class="kw">as </span>usize), <span class="number">1 </span>&lt;&lt; <span class="number">63</span>);
     }
 }
 </code></pre></div>
 </section></div></main><div id="rustdoc-vars" data-root-path="../../../../" data-current-crate="tantivy" data-themes="ayu,dark,light" data-resource-suffix="" data-rustdoc-version="1.66.0-nightly (5c8bff74b 2022-10-21)" ></div></body></html>