blob: 556e0b5dabf61f1a47e27d6e7feb0b3db1e0cf9d [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/query/bitset/mod.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>mod.rs - source</title><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../../SourceSerif4-Regular.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../../FiraSans-Regular.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../../FiraSans-Medium.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../../SourceCodePro-Regular.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../../SourceSerif4-Bold.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../../SourceCodePro-Semibold.ttf.woff2"><link rel="stylesheet" href="../../../../normalize.css"><link rel="stylesheet" href="../../../../rustdoc.css" id="mainThemeStyle"><link rel="stylesheet" href="../../../../ayu.css" disabled><link rel="stylesheet" href="../../../../dark.css" disabled><link rel="stylesheet" href="../../../../light.css" id="themeStyle"><script id="default-settings" ></script><script src="../../../../storage.js"></script><script defer src="../../../../source-script.js"></script><script defer src="../../../../source-files.js"></script><script defer src="../../../../main.js"></script><noscript><link rel="stylesheet" href="../../../../noscript.css"></noscript><link rel="alternate icon" type="image/png" href="../../../../favicon-16x16.png"><link rel="alternate icon" type="image/png" href="../../../../favicon-32x32.png"><link rel="icon" type="image/svg+xml" href="../../../../favicon.svg"></head><body class="rustdoc source"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="sidebar"><a class="sidebar-logo" href="../../../../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>
</pre><pre class="rust"><code><span class="kw">use </span>common::{BitSet, TinySet};
<span class="kw">use </span><span class="kw">crate</span>::docset::{DocSet, TERMINATED};
<span class="kw">use </span><span class="kw">crate</span>::DocId;
<span class="doccomment">/// A `BitSetDocSet` makes it possible to iterate through a bitset as if it was a `DocSet`.
///
/// # Implementation detail
///
/// Skipping is relatively fast here as we can directly point to the
/// right tiny bitset bucket.
///
/// TODO: Consider implementing a `BitTreeSet` in order to advance faster
/// when the bitset is sparse
</span><span class="kw">pub struct </span>BitSetDocSet {
docs: BitSet,
cursor_bucket: u32, <span class="comment">//&lt; index associated with the current tiny bitset
</span>cursor_tinybitset: TinySet,
doc: u32,
}
<span class="kw">impl </span>BitSetDocSet {
<span class="kw">fn </span>go_to_bucket(<span class="kw-2">&amp;mut </span><span class="self">self</span>, bucket_addr: u32) {
<span class="self">self</span>.cursor_bucket = bucket_addr;
<span class="self">self</span>.cursor_tinybitset = <span class="self">self</span>.docs.tinyset(bucket_addr);
}
}
<span class="kw">impl </span>From&lt;BitSet&gt; <span class="kw">for </span>BitSetDocSet {
<span class="kw">fn </span>from(docs: BitSet) -&gt; BitSetDocSet {
<span class="kw">let </span>first_tiny_bitset = <span class="kw">if </span>docs.max_value() == <span class="number">0 </span>{
TinySet::empty()
} <span class="kw">else </span>{
docs.tinyset(<span class="number">0</span>)
};
<span class="kw">let </span><span class="kw-2">mut </span>docset = BitSetDocSet {
docs,
cursor_bucket: <span class="number">0</span>,
cursor_tinybitset: first_tiny_bitset,
doc: <span class="number">0u32</span>,
};
docset.advance();
docset
}
}
<span class="kw">impl </span>DocSet <span class="kw">for </span>BitSetDocSet {
<span class="kw">fn </span>advance(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; DocId {
<span class="kw">if let </span><span class="prelude-val">Some</span>(lower) = <span class="self">self</span>.cursor_tinybitset.pop_lowest() {
<span class="self">self</span>.doc = (<span class="self">self</span>.cursor_bucket <span class="kw">as </span>u32 * <span class="number">64u32</span>) | lower;
<span class="kw">return </span><span class="self">self</span>.doc;
}
<span class="kw">if let </span><span class="prelude-val">Some</span>(cursor_bucket) = <span class="self">self</span>.docs.first_non_empty_bucket(<span class="self">self</span>.cursor_bucket + <span class="number">1</span>) {
<span class="self">self</span>.go_to_bucket(cursor_bucket);
<span class="kw">let </span>lower = <span class="self">self</span>.cursor_tinybitset.pop_lowest().unwrap();
<span class="self">self</span>.doc = (cursor_bucket * <span class="number">64u32</span>) | lower;
<span class="self">self</span>.doc
} <span class="kw">else </span>{
<span class="self">self</span>.doc = TERMINATED;
TERMINATED
}
}
<span class="kw">fn </span>seek(<span class="kw-2">&amp;mut </span><span class="self">self</span>, target: DocId) -&gt; DocId {
<span class="kw">if </span>target &gt;= <span class="self">self</span>.docs.max_value() {
<span class="self">self</span>.doc = TERMINATED;
<span class="kw">return </span>TERMINATED;
}
<span class="kw">let </span>target_bucket = target / <span class="number">64u32</span>;
<span class="kw">if </span>target_bucket &gt; <span class="self">self</span>.cursor_bucket {
<span class="self">self</span>.go_to_bucket(target_bucket);
<span class="kw">let </span>greater_filter: TinySet = TinySet::range_greater_or_equal(target);
<span class="self">self</span>.cursor_tinybitset = <span class="self">self</span>.cursor_tinybitset.intersect(greater_filter);
<span class="self">self</span>.advance()
} <span class="kw">else </span>{
<span class="kw">let </span><span class="kw-2">mut </span>doc = <span class="self">self</span>.doc();
<span class="kw">while </span>doc &lt; target {
doc = <span class="self">self</span>.advance();
}
doc
}
}
<span class="doccomment">/// Returns the current document
</span><span class="kw">fn </span>doc(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; DocId {
<span class="self">self</span>.doc
}
<span class="doccomment">/// Returns the number of values set in the underlying bitset.
</span><span class="kw">fn </span>size_hint(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; u32 {
<span class="self">self</span>.docs.len() <span class="kw">as </span>u32
}
}
<span class="attribute">#[cfg(test)]
</span><span class="kw">mod </span>tests {
<span class="kw">use </span>std::collections::BTreeSet;
<span class="kw">use </span>common::BitSet;
<span class="kw">use </span><span class="kw">super</span>::BitSetDocSet;
<span class="kw">use </span><span class="kw">crate</span>::docset::{DocSet, TERMINATED};
<span class="kw">use </span><span class="kw">crate</span>::tests::generate_nonunique_unsorted;
<span class="kw">use </span><span class="kw">crate</span>::DocId;
<span class="kw">fn </span>create_docbitset(docs: <span class="kw-2">&amp;</span>[DocId], max_doc: DocId) -&gt; BitSetDocSet {
<span class="kw">let </span><span class="kw-2">mut </span>docset = BitSet::with_max_value(max_doc);
<span class="kw">for </span><span class="kw-2">&amp;</span>doc <span class="kw">in </span>docs {
docset.insert(doc);
}
BitSetDocSet::from(docset)
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_bitset_large() {
<span class="kw">let </span>arr = generate_nonunique_unsorted(<span class="number">100_000</span>, <span class="number">5_000</span>);
<span class="kw">let </span><span class="kw-2">mut </span>btreeset: BTreeSet&lt;u32&gt; = BTreeSet::new();
<span class="kw">let </span><span class="kw-2">mut </span>bitset = BitSet::with_max_value(<span class="number">100_000</span>);
<span class="kw">for </span>el <span class="kw">in </span>arr {
btreeset.insert(el);
bitset.insert(el);
}
<span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..<span class="number">100_000 </span>{
<span class="macro">assert_eq!</span>(btreeset.contains(<span class="kw-2">&amp;</span>i), bitset.contains(i));
}
<span class="macro">assert_eq!</span>(btreeset.len(), bitset.len());
<span class="kw">let </span><span class="kw-2">mut </span>bitset_docset = BitSetDocSet::from(bitset);
<span class="kw">let </span><span class="kw-2">mut </span>remaining = <span class="bool-val">true</span>;
<span class="kw">for </span>el <span class="kw">in </span>btreeset.into_iter() {
<span class="macro">assert!</span>(remaining);
<span class="macro">assert_eq!</span>(bitset_docset.doc(), el);
remaining = bitset_docset.advance() != TERMINATED;
}
<span class="macro">assert!</span>(!remaining);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_empty() {
<span class="kw">let </span>bitset = BitSet::with_max_value(<span class="number">1000</span>);
<span class="kw">let </span><span class="kw-2">mut </span>empty = BitSetDocSet::from(bitset);
<span class="macro">assert_eq!</span>(empty.advance(), TERMINATED)
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_seek_terminated() {
<span class="kw">let </span>bitset = BitSet::with_max_value(<span class="number">1000</span>);
<span class="kw">let </span><span class="kw-2">mut </span>empty = BitSetDocSet::from(bitset);
<span class="macro">assert_eq!</span>(empty.seek(TERMINATED), TERMINATED)
}
<span class="kw">fn </span>test_go_through_sequential(docs: <span class="kw-2">&amp;</span>[DocId]) {
<span class="kw">let </span><span class="kw-2">mut </span>docset = create_docbitset(docs, <span class="number">1_000u32</span>);
<span class="kw">for </span><span class="kw-2">&amp;</span>doc <span class="kw">in </span>docs {
<span class="macro">assert_eq!</span>(doc, docset.doc());
docset.advance();
}
<span class="macro">assert_eq!</span>(docset.advance(), TERMINATED);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_docbitset_sequential() {
test_go_through_sequential(<span class="kw-2">&amp;</span>[<span class="number">1</span>, <span class="number">2</span>, <span class="number">3</span>]);
test_go_through_sequential(<span class="kw-2">&amp;</span>[<span class="number">1</span>, <span class="number">2</span>, <span class="number">3</span>, <span class="number">4</span>, <span class="number">5</span>, <span class="number">63</span>, <span class="number">64</span>, <span class="number">65</span>]);
test_go_through_sequential(<span class="kw-2">&amp;</span>[<span class="number">63</span>, <span class="number">64</span>, <span class="number">65</span>]);
test_go_through_sequential(<span class="kw-2">&amp;</span>[<span class="number">1</span>, <span class="number">2</span>, <span class="number">3</span>, <span class="number">4</span>, <span class="number">95</span>, <span class="number">96</span>, <span class="number">97</span>, <span class="number">98</span>, <span class="number">99</span>]);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_docbitset_skip() {
{
<span class="kw">let </span><span class="kw-2">mut </span>docset = create_docbitset(<span class="kw-2">&amp;</span>[<span class="number">1</span>, <span class="number">5</span>, <span class="number">6</span>, <span class="number">7</span>, <span class="number">5112</span>], <span class="number">10_000</span>);
<span class="macro">assert_eq!</span>(docset.seek(<span class="number">7</span>), <span class="number">7</span>);
<span class="macro">assert_eq!</span>(docset.doc(), <span class="number">7</span>);
<span class="macro">assert_eq!</span>(docset.advance(), <span class="number">5112</span>);
<span class="macro">assert_eq!</span>(docset.doc(), <span class="number">5112</span>);
<span class="macro">assert_eq!</span>(docset.advance(), TERMINATED);
}
{
<span class="kw">let </span><span class="kw-2">mut </span>docset = create_docbitset(<span class="kw-2">&amp;</span>[<span class="number">1</span>, <span class="number">5</span>, <span class="number">6</span>, <span class="number">7</span>, <span class="number">5112</span>], <span class="number">10_000</span>);
<span class="macro">assert_eq!</span>(docset.seek(<span class="number">3</span>), <span class="number">5</span>);
<span class="macro">assert_eq!</span>(docset.doc(), <span class="number">5</span>);
<span class="macro">assert_eq!</span>(docset.advance(), <span class="number">6</span>);
}
{
<span class="kw">let </span><span class="kw-2">mut </span>docset = create_docbitset(<span class="kw-2">&amp;</span>[<span class="number">5112</span>], <span class="number">10_000</span>);
<span class="macro">assert_eq!</span>(docset.seek(<span class="number">5112</span>), <span class="number">5112</span>);
<span class="macro">assert_eq!</span>(docset.doc(), <span class="number">5112</span>);
<span class="macro">assert_eq!</span>(docset.advance(), TERMINATED);
}
{
<span class="kw">let </span><span class="kw-2">mut </span>docset = create_docbitset(<span class="kw-2">&amp;</span>[<span class="number">5112</span>], <span class="number">10_000</span>);
<span class="macro">assert_eq!</span>(docset.seek(<span class="number">5113</span>), TERMINATED);
<span class="macro">assert_eq!</span>(docset.advance(), TERMINATED);
}
{
<span class="kw">let </span><span class="kw-2">mut </span>docset = create_docbitset(<span class="kw-2">&amp;</span>[<span class="number">5112</span>], <span class="number">10_000</span>);
<span class="macro">assert_eq!</span>(docset.seek(<span class="number">5111</span>), <span class="number">5112</span>);
<span class="macro">assert_eq!</span>(docset.doc(), <span class="number">5112</span>);
<span class="macro">assert_eq!</span>(docset.advance(), TERMINATED);
}
{
<span class="kw">let </span><span class="kw-2">mut </span>docset = create_docbitset(<span class="kw-2">&amp;</span>[<span class="number">1</span>, <span class="number">5</span>, <span class="number">6</span>, <span class="number">7</span>, <span class="number">5112</span>, <span class="number">5500</span>, <span class="number">6666</span>], <span class="number">10_000</span>);
<span class="macro">assert_eq!</span>(docset.seek(<span class="number">5112</span>), <span class="number">5112</span>);
<span class="macro">assert_eq!</span>(docset.doc(), <span class="number">5112</span>);
<span class="macro">assert_eq!</span>(docset.advance(), <span class="number">5500</span>);
<span class="macro">assert_eq!</span>(docset.doc(), <span class="number">5500</span>);
<span class="macro">assert_eq!</span>(docset.advance(), <span class="number">6666</span>);
<span class="macro">assert_eq!</span>(docset.doc(), <span class="number">6666</span>);
<span class="macro">assert_eq!</span>(docset.advance(), TERMINATED);
}
{
<span class="kw">let </span><span class="kw-2">mut </span>docset = create_docbitset(<span class="kw-2">&amp;</span>[<span class="number">1</span>, <span class="number">5</span>, <span class="number">6</span>, <span class="number">7</span>, <span class="number">5112</span>, <span class="number">5500</span>, <span class="number">6666</span>], <span class="number">10_000</span>);
<span class="macro">assert_eq!</span>(docset.seek(<span class="number">5111</span>), <span class="number">5112</span>);
<span class="macro">assert_eq!</span>(docset.doc(), <span class="number">5112</span>);
<span class="macro">assert_eq!</span>(docset.advance(), <span class="number">5500</span>);
<span class="macro">assert_eq!</span>(docset.doc(), <span class="number">5500</span>);
<span class="macro">assert_eq!</span>(docset.advance(), <span class="number">6666</span>);
<span class="macro">assert_eq!</span>(docset.doc(), <span class="number">6666</span>);
<span class="macro">assert_eq!</span>(docset.advance(), TERMINATED);
}
{
<span class="kw">let </span><span class="kw-2">mut </span>docset = create_docbitset(<span class="kw-2">&amp;</span>[<span class="number">1</span>, <span class="number">5</span>, <span class="number">6</span>, <span class="number">7</span>, <span class="number">5112</span>, <span class="number">5513</span>, <span class="number">6666</span>], <span class="number">10_000</span>);
<span class="macro">assert_eq!</span>(docset.seek(<span class="number">5111</span>), <span class="number">5112</span>);
<span class="macro">assert_eq!</span>(docset.doc(), <span class="number">5112</span>);
<span class="macro">assert_eq!</span>(docset.advance(), <span class="number">5513</span>);
<span class="macro">assert_eq!</span>(docset.doc(), <span class="number">5513</span>);
<span class="macro">assert_eq!</span>(docset.advance(), <span class="number">6666</span>);
<span class="macro">assert_eq!</span>(docset.doc(), <span class="number">6666</span>);
<span class="macro">assert_eq!</span>(docset.advance(), TERMINATED);
}
}
}
<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 super</span>::{BitSet, BitSetDocSet};
<span class="kw">use </span><span class="kw">crate</span>::docset::TERMINATED;
<span class="kw">use crate</span>::{test, tests, DocSet};
<span class="attribute">#[bench]
</span><span class="kw">fn </span>bench_bitset_1pct_insert(b: <span class="kw-2">&amp;mut </span>test::Bencher) {
<span class="kw">let </span>els = tests::generate_nonunique_unsorted(<span class="number">1_000_000u32</span>, <span class="number">10_000</span>);
b.iter(|| {
<span class="kw">let </span><span class="kw-2">mut </span>bitset = BitSet::with_max_value(<span class="number">1_000_000</span>);
<span class="kw">for </span>el <span class="kw">in </span>els.iter().cloned() {
bitset.insert(el);
}
});
}
<span class="attribute">#[bench]
</span><span class="kw">fn </span>bench_bitset_1pct_clone(b: <span class="kw-2">&amp;mut </span>test::Bencher) {
<span class="kw">let </span>els = tests::generate_nonunique_unsorted(<span class="number">1_000_000u32</span>, <span class="number">10_000</span>);
<span class="kw">let </span><span class="kw-2">mut </span>bitset = BitSet::with_max_value(<span class="number">1_000_000</span>);
<span class="kw">for </span>el <span class="kw">in </span>els {
bitset.insert(el);
}
b.iter(|| bitset.clone());
}
<span class="attribute">#[bench]
</span><span class="kw">fn </span>bench_bitset_1pct_clone_iterate(b: <span class="kw-2">&amp;mut </span>test::Bencher) {
<span class="kw">let </span>els = tests::sample(<span class="number">1_000_000u32</span>, <span class="number">0.01</span>);
<span class="kw">let </span><span class="kw-2">mut </span>bitset = BitSet::with_max_value(<span class="number">1_000_000</span>);
<span class="kw">for </span>el <span class="kw">in </span>els {
bitset.insert(el);
}
b.iter(|| {
<span class="kw">let </span><span class="kw-2">mut </span>docset = BitSetDocSet::from(bitset.clone());
<span class="kw">while </span>docset.advance() != TERMINATED {}
});
}
}
</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>