blob: b899597ddd251d64a90612ffa487d01c5879d65b [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/git/checkouts/tantivy-65d0bbbddbbd5d02/433372d/src/postings/stacker/expull.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>expull.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>
<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>
</pre><pre class="rust"><code><span class="kw">use </span>std::mem;
<span class="kw">use </span>common::serialize_vint_u32;
<span class="kw">use super</span>::{Addr, MemoryArena};
<span class="kw">use </span><span class="kw">crate</span>::postings::stacker::memory_arena::{load, store};
<span class="kw">const </span>MAX_BLOCK_LEN: u32 = <span class="number">1u32 </span>&lt;&lt; <span class="number">15</span>;
<span class="kw">const </span>FIRST_BLOCK: usize = <span class="number">16</span>;
<span class="kw">const </span>INLINED_BLOCK_LEN: usize = FIRST_BLOCK + mem::size_of::&lt;Addr&gt;();
<span class="kw">enum </span>CapacityResult {
Available(u32),
NeedAlloc(u32),
}
<span class="kw">fn </span>len_to_capacity(len: u32) -&gt; CapacityResult {
<span class="kw">match </span>len {
<span class="number">0</span>..=<span class="number">15 </span>=&gt; CapacityResult::Available(FIRST_BLOCK <span class="kw">as </span>u32 - len),
<span class="number">16</span>..=MAX_BLOCK_LEN =&gt; {
<span class="kw">let </span>cap = <span class="number">1 </span>&lt;&lt; (<span class="number">32u32 </span>- (len - <span class="number">1u32</span>).leading_zeros());
<span class="kw">let </span>available = cap - len;
<span class="kw">if </span>available == <span class="number">0 </span>{
CapacityResult::NeedAlloc(len)
} <span class="kw">else </span>{
CapacityResult::Available(available)
}
}
n =&gt; {
<span class="kw">let </span>available = n % MAX_BLOCK_LEN;
<span class="kw">if </span>available == <span class="number">0 </span>{
CapacityResult::NeedAlloc(MAX_BLOCK_LEN)
} <span class="kw">else </span>{
CapacityResult::Available(MAX_BLOCK_LEN - available)
}
}
}
}
<span class="doccomment">/// An exponential unrolled link.
///
/// The use case is as follows. Tantivy&#39;s indexer conceptually acts like a
/// `HashMap&lt;Term, Vec&lt;u32&gt;&gt;`. As we come across a given term in document
/// `D`, we lookup the term in the map and append the document id to its vector.
///
/// The vector is then only read when it is serialized.
///
/// The `ExpUnrolledLinkedList` offers a more efficient solution to this
/// problem.
///
/// It combines the idea of the unrolled linked list and tries to address the
/// problem of selecting an adequate block size using a strategy similar to
/// that of the `Vec` amortized resize strategy.
///
/// Data is stored in a linked list of blocks. The first block has a size of `4`
/// and each block has a length of twice that of the previous block up to
/// `MAX_BLOCK_LEN = 32768`.
///
/// This strategy is a good trade off to handle numerous very rare terms
/// and avoid wasting half of the memory for very frequent terms.
</span><span class="attribute">#[derive(Debug, Clone, Copy)]
</span><span class="kw">pub struct </span>ExpUnrolledLinkedList {
len: u32,
tail: Addr,
inlined_data: [u8; INLINED_BLOCK_LEN <span class="kw">as </span>usize],
}
<span class="kw">pub struct </span>ExpUnrolledLinkedListWriter&lt;<span class="lifetime">&#39;a</span>&gt; {
eull: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>ExpUnrolledLinkedList,
arena: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>MemoryArena,
}
<span class="kw">fn </span>ensure_capacity&lt;<span class="lifetime">&#39;a</span>&gt;(
eull: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>ExpUnrolledLinkedList,
arena: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>MemoryArena,
) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>[u8] {
<span class="kw">if </span>eull.len &lt;= FIRST_BLOCK <span class="kw">as </span>u32 {
<span class="comment">// We are still hitting the inline block.
</span><span class="kw">if </span>eull.len &lt; FIRST_BLOCK <span class="kw">as </span>u32 {
<span class="kw">return </span><span class="kw-2">&amp;mut </span>eull.inlined_data[eull.len <span class="kw">as </span>usize..FIRST_BLOCK];
}
<span class="comment">// We need to allocate a new block!
</span><span class="kw">let </span>new_block_addr: Addr = arena.allocate_space(FIRST_BLOCK + mem::size_of::&lt;Addr&gt;());
store(<span class="kw-2">&amp;mut </span>eull.inlined_data[FIRST_BLOCK..], new_block_addr);
eull.tail = new_block_addr;
<span class="kw">return </span>arena.slice_mut(eull.tail, FIRST_BLOCK);
}
<span class="kw">let </span>len = <span class="kw">match </span>len_to_capacity(eull.len) {
CapacityResult::NeedAlloc(new_block_len) =&gt; {
<span class="kw">let </span>new_block_addr: Addr =
arena.allocate_space(new_block_len <span class="kw">as </span>usize + mem::size_of::&lt;Addr&gt;());
arena.write_at(eull.tail, new_block_addr);
eull.tail = new_block_addr;
new_block_len
}
CapacityResult::Available(available) =&gt; available,
};
arena.slice_mut(eull.tail, len <span class="kw">as </span>usize)
}
<span class="kw">impl</span>&lt;<span class="lifetime">&#39;a</span>&gt; ExpUnrolledLinkedListWriter&lt;<span class="lifetime">&#39;a</span>&gt; {
<span class="kw">pub fn </span>write_u32_vint(<span class="kw-2">&amp;mut </span><span class="self">self</span>, val: u32) {
<span class="kw">let </span><span class="kw-2">mut </span>buf = [<span class="number">0u8</span>; <span class="number">8</span>];
<span class="kw">let </span>data = serialize_vint_u32(val, <span class="kw-2">&amp;mut </span>buf);
<span class="self">self</span>.extend_from_slice(data);
}
<span class="kw">pub fn </span>extend_from_slice(<span class="kw-2">&amp;mut </span><span class="self">self</span>, <span class="kw-2">mut </span>buf: <span class="kw-2">&amp;</span>[u8]) {
<span class="kw">while </span>!buf.is_empty() {
<span class="kw">let </span>add_len: usize;
{
<span class="kw">let </span>output_buf = ensure_capacity(<span class="self">self</span>.eull, <span class="self">self</span>.arena);
add_len = buf.len().min(output_buf.len());
output_buf[..add_len].copy_from_slice(<span class="kw-2">&amp;</span>buf[..add_len]);
}
<span class="self">self</span>.eull.len += add_len <span class="kw">as </span>u32;
<span class="self">self</span>.eull.tail = <span class="self">self</span>.eull.tail.offset(add_len <span class="kw">as </span>u32);
buf = <span class="kw-2">&amp;</span>buf[add_len..];
}
}
}
<span class="kw">impl </span>ExpUnrolledLinkedList {
<span class="kw">pub fn </span>new() -&gt; ExpUnrolledLinkedList {
ExpUnrolledLinkedList {
len: <span class="number">0u32</span>,
tail: Addr::null_pointer(),
inlined_data: [<span class="number">0u8</span>; INLINED_BLOCK_LEN <span class="kw">as </span>usize],
}
}
<span class="attribute">#[inline]
</span><span class="kw">pub fn </span>writer&lt;<span class="lifetime">&#39;a</span>&gt;(<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span><span class="self">self</span>, arena: <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="kw-2">mut </span>MemoryArena) -&gt; ExpUnrolledLinkedListWriter&lt;<span class="lifetime">&#39;a</span>&gt; {
ExpUnrolledLinkedListWriter { eull: <span class="self">self</span>, arena }
}
<span class="kw">pub fn </span>read_to_end(<span class="kw-2">&amp;</span><span class="self">self</span>, arena: <span class="kw-2">&amp;</span>MemoryArena, output: <span class="kw-2">&amp;mut </span>Vec&lt;u8&gt;) {
<span class="kw">let </span>len = <span class="self">self</span>.len <span class="kw">as </span>usize;
<span class="kw">if </span>len &lt;= FIRST_BLOCK {
output.extend_from_slice(<span class="kw-2">&amp;</span><span class="self">self</span>.inlined_data[..len]);
<span class="kw">return</span>;
}
output.extend_from_slice(<span class="kw-2">&amp;</span><span class="self">self</span>.inlined_data[..FIRST_BLOCK]);
<span class="kw">let </span><span class="kw-2">mut </span>cur = FIRST_BLOCK;
<span class="kw">let </span><span class="kw-2">mut </span>addr = load(<span class="kw-2">&amp;</span><span class="self">self</span>.inlined_data[FIRST_BLOCK..]);
<span class="kw">loop </span>{
<span class="kw">let </span>cap = <span class="kw">match </span>len_to_capacity(cur <span class="kw">as </span>u32) {
CapacityResult::Available(capacity) =&gt; capacity,
CapacityResult::NeedAlloc(capacity) =&gt; capacity,
} <span class="kw">as </span>usize;
<span class="kw">let </span>data = arena.slice(addr, cap);
<span class="kw">if </span>cur + cap &gt;= len {
output.extend_from_slice(<span class="kw-2">&amp;</span>data[..(len - cur)]);
<span class="kw">return</span>;
}
output.extend_from_slice(data);
cur += cap;
addr = arena.read(addr.offset(cap <span class="kw">as </span>u32));
}
}
}
<span class="attribute">#[cfg(test)]
</span><span class="kw">mod </span>tests {
<span class="kw">use </span>common::{read_u32_vint, write_u32_vint};
<span class="kw">use </span><span class="kw">super</span>::<span class="kw">super</span>::MemoryArena;
<span class="kw">use super</span>::{len_to_capacity, <span class="kw-2">*</span>};
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_eull() {
<span class="kw">let </span><span class="kw-2">mut </span>arena = MemoryArena::new();
<span class="kw">let </span><span class="kw-2">mut </span>stack = ExpUnrolledLinkedList::new();
stack.writer(<span class="kw-2">&amp;mut </span>arena).extend_from_slice(<span class="kw-2">&amp;</span>[<span class="number">1u8</span>]);
stack.writer(<span class="kw-2">&amp;mut </span>arena).extend_from_slice(<span class="kw-2">&amp;</span>[<span class="number">2u8</span>]);
stack.writer(<span class="kw-2">&amp;mut </span>arena).extend_from_slice(<span class="kw-2">&amp;</span>[<span class="number">3u8</span>, <span class="number">4u8</span>]);
stack.writer(<span class="kw-2">&amp;mut </span>arena).extend_from_slice(<span class="kw-2">&amp;</span>[<span class="number">5u8</span>]);
{
<span class="kw">let </span><span class="kw-2">mut </span>buffer = Vec::new();
stack.read_to_end(<span class="kw-2">&amp;</span>arena, <span class="kw-2">&amp;mut </span>buffer);
<span class="macro">assert_eq!</span>(<span class="kw-2">&amp;</span>buffer[..], <span class="kw-2">&amp;</span>[<span class="number">1u8</span>, <span class="number">2u8</span>, <span class="number">3u8</span>, <span class="number">4u8</span>, <span class="number">5u8</span>]);
}
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_eull_long() {
<span class="kw">let </span><span class="kw-2">mut </span>arena = MemoryArena::new();
<span class="kw">let </span><span class="kw-2">mut </span>eull = ExpUnrolledLinkedList::new();
<span class="kw">let </span>data: Vec&lt;u32&gt; = (<span class="number">0</span>..<span class="number">100</span>).collect();
<span class="kw">for </span><span class="kw-2">&amp;</span>el <span class="kw">in </span><span class="kw-2">&amp;</span>data {
eull.writer(<span class="kw-2">&amp;mut </span>arena).write_u32_vint(el);
}
<span class="kw">let </span><span class="kw-2">mut </span>buffer = Vec::new();
eull.read_to_end(<span class="kw-2">&amp;</span>arena, <span class="kw-2">&amp;mut </span>buffer);
<span class="kw">let </span><span class="kw-2">mut </span>result = <span class="macro">vec!</span>[];
<span class="kw">let </span><span class="kw-2">mut </span>remaining = <span class="kw-2">&amp;</span>buffer[..];
<span class="kw">while </span>!remaining.is_empty() {
result.push(read_u32_vint(<span class="kw-2">&amp;mut </span>remaining));
}
<span class="macro">assert_eq!</span>(<span class="kw-2">&amp;</span>result[..], <span class="kw-2">&amp;</span>data[..]);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_eull_interlaced() {
<span class="kw">let </span><span class="kw-2">mut </span>eull = MemoryArena::new();
<span class="kw">let </span><span class="kw-2">mut </span>stack = ExpUnrolledLinkedList::new();
<span class="kw">let </span><span class="kw-2">mut </span>stack2 = ExpUnrolledLinkedList::new();
<span class="kw">let </span><span class="kw-2">mut </span>vec1: Vec&lt;u8&gt; = <span class="macro">vec!</span>[];
<span class="kw">let </span><span class="kw-2">mut </span>vec2: Vec&lt;u8&gt; = <span class="macro">vec!</span>[];
<span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..<span class="number">9 </span>{
stack.writer(<span class="kw-2">&amp;mut </span>eull).write_u32_vint(i);
<span class="macro">assert!</span>(write_u32_vint(i, <span class="kw-2">&amp;mut </span>vec1).is_ok());
<span class="kw">if </span>i % <span class="number">2 </span>== <span class="number">0 </span>{
stack2.writer(<span class="kw-2">&amp;mut </span>eull).write_u32_vint(i);
<span class="macro">assert!</span>(write_u32_vint(i, <span class="kw-2">&amp;mut </span>vec2).is_ok());
}
}
<span class="kw">let </span><span class="kw-2">mut </span>res1 = <span class="macro">vec!</span>[];
<span class="kw">let </span><span class="kw-2">mut </span>res2 = <span class="macro">vec!</span>[];
stack.read_to_end(<span class="kw-2">&amp;</span>eull, <span class="kw-2">&amp;mut </span>res1);
stack2.read_to_end(<span class="kw-2">&amp;</span>eull, <span class="kw-2">&amp;mut </span>res2);
<span class="macro">assert_eq!</span>(<span class="kw-2">&amp;</span>vec1[..], <span class="kw-2">&amp;</span>res1[..]);
<span class="macro">assert_eq!</span>(<span class="kw-2">&amp;</span>vec2[..], <span class="kw-2">&amp;</span>res2[..]);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_jump_if_needed() {
<span class="kw">let </span><span class="kw-2">mut </span>available = <span class="number">16u32</span>;
<span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..<span class="number">10_000_000 </span>{
<span class="kw">match </span>len_to_capacity(i) {
CapacityResult::NeedAlloc(cap) =&gt; {
<span class="macro">assert_eq!</span>(available, <span class="number">0</span>, <span class="string">&quot;Failed len={}: Expected 0 got {}&quot;</span>, i, cap);
available = cap;
}
CapacityResult::Available(cap) =&gt; {
<span class="macro">assert_eq!</span>(
available, cap,
<span class="string">&quot;Failed len={}: Expected {} Got {}&quot;</span>,
i, available, cap
);
}
}
available -= <span class="number">1</span>;
}
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_jump_if_needed_progression() {
<span class="kw">let </span><span class="kw-2">mut </span>v = <span class="macro">vec!</span>[];
<span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>.. {
<span class="kw">if </span>v.len() &gt;= <span class="number">10 </span>{
<span class="kw">break</span>;
}
<span class="kw">if let </span>CapacityResult::NeedAlloc(cap) = len_to_capacity(i) {
v.push((i, cap));
}
}
<span class="macro">assert_eq!</span>(
<span class="kw-2">&amp;</span>v[..],
<span class="kw-2">&amp;</span>[
(<span class="number">16</span>, <span class="number">16</span>),
(<span class="number">32</span>, <span class="number">32</span>),
(<span class="number">64</span>, <span class="number">64</span>),
(<span class="number">128</span>, <span class="number">128</span>),
(<span class="number">256</span>, <span class="number">256</span>),
(<span class="number">512</span>, <span class="number">512</span>),
(<span class="number">1024</span>, <span class="number">1024</span>),
(<span class="number">2048</span>, <span class="number">2048</span>),
(<span class="number">4096</span>, <span class="number">4096</span>),
(<span class="number">8192</span>, <span class="number">8192</span>)
]
);
}
}
<span class="attribute">#[cfg(all(test, feature = <span class="string">&quot;unstable&quot;</span>))]
</span><span class="kw">mod </span>bench {
<span class="kw">use </span>std::iter;
<span class="kw">use </span>test::Bencher;
<span class="kw">use </span><span class="kw">super</span>::<span class="kw">super</span>::MemoryArena;
<span class="kw">use </span><span class="kw">super</span>::ExpUnrolledLinkedList;
<span class="kw">const </span>NUM_STACK: usize = <span class="number">10_000</span>;
<span class="kw">const </span>STACK_SIZE: u32 = <span class="number">1000</span>;
<span class="attribute">#[bench]
</span><span class="kw">fn </span>bench_push_vec(bench: <span class="kw-2">&amp;mut </span>Bencher) {
bench.iter(|| {
<span class="kw">let </span><span class="kw-2">mut </span>vecs = Vec::with_capacity(<span class="number">100</span>);
<span class="kw">for _ in </span><span class="number">0</span>..NUM_STACK {
vecs.push(Vec::new());
}
<span class="kw">for </span>s <span class="kw">in </span><span class="number">0</span>..NUM_STACK {
<span class="kw">for </span>i <span class="kw">in </span><span class="number">0u32</span>..STACK_SIZE {
<span class="kw">let </span>t = s * <span class="number">392017 </span>% NUM_STACK;
vecs[t].push(i);
}
}
});
}
<span class="attribute">#[bench]
</span><span class="kw">fn </span>bench_push_stack(bench: <span class="kw-2">&amp;mut </span>Bencher) {
bench.iter(|| {
<span class="kw">let </span><span class="kw-2">mut </span>arena = MemoryArena::new();
<span class="kw">let </span><span class="kw-2">mut </span>stacks: Vec&lt;ExpUnrolledLinkedList&gt; =
iter::repeat_with(ExpUnrolledLinkedList::new)
.take(NUM_STACK)
.collect();
<span class="kw">for </span>s <span class="kw">in </span><span class="number">0</span>..NUM_STACK {
<span class="kw">for </span>i <span class="kw">in </span><span class="number">0u32</span>..STACK_SIZE {
<span class="kw">let </span>t = s * <span class="number">392017 </span>% NUM_STACK;
stacks[t]
.writer(<span class="kw-2">&amp;mut </span>arena)
.extend_from_slice(<span class="kw-2">&amp;</span>i.to_ne_bytes());
}
}
});
}
}
</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>