blob: e461cd818ec400a2fc60f1b7d148d8cbf85c162c [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 `common/rusty_leveldb_sgx/src/filter.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>filter.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="../../rusty_leveldb/index.html"><div class="logo-container"><img class="rust-logo" src="../../rust-logo.svg" alt="logo"></div></a></nav><main><div class="width-limiter"><nav class="sub"><a class="sub-logo-container" href="../../rusty_leveldb/index.html"><img class="rust-logo" src="../../rust-logo.svg" alt="logo"></a><form class="search-form"><div class="search-container"><span></span><input class="search-input" name="search" autocomplete="off" spellcheck="false" placeholder="Click or press ‘S’ to search, ‘?’ for more options…" type="search"><div id="help-button" title="help" tabindex="-1"><a href="../../help.html">?</a></div><div id="settings-menu" tabindex="-1"><a href="../../settings.html" title="settings"><img width="22" height="22" alt="Change settings" src="../../wheel.svg"></a></div></div></form></nav><section id="main-content" class="content"><div class="example-wrap"><pre class="src-line-numbers"><span id="1">1</span>
<span id="2">2</span>
<span id="3">3</span>
<span id="4">4</span>
<span id="5">5</span>
<span id="6">6</span>
<span id="7">7</span>
<span id="8">8</span>
<span id="9">9</span>
<span id="10">10</span>
<span id="11">11</span>
<span id="12">12</span>
<span id="13">13</span>
<span id="14">14</span>
<span id="15">15</span>
<span id="16">16</span>
<span id="17">17</span>
<span id="18">18</span>
<span id="19">19</span>
<span id="20">20</span>
<span id="21">21</span>
<span id="22">22</span>
<span id="23">23</span>
<span id="24">24</span>
<span id="25">25</span>
<span id="26">26</span>
<span id="27">27</span>
<span id="28">28</span>
<span id="29">29</span>
<span id="30">30</span>
<span id="31">31</span>
<span id="32">32</span>
<span id="33">33</span>
<span id="34">34</span>
<span id="35">35</span>
<span id="36">36</span>
<span id="37">37</span>
<span id="38">38</span>
<span id="39">39</span>
<span id="40">40</span>
<span id="41">41</span>
<span id="42">42</span>
<span id="43">43</span>
<span id="44">44</span>
<span id="45">45</span>
<span id="46">46</span>
<span id="47">47</span>
<span id="48">48</span>
<span id="49">49</span>
<span id="50">50</span>
<span id="51">51</span>
<span id="52">52</span>
<span id="53">53</span>
<span id="54">54</span>
<span id="55">55</span>
<span id="56">56</span>
<span id="57">57</span>
<span id="58">58</span>
<span id="59">59</span>
<span id="60">60</span>
<span id="61">61</span>
<span id="62">62</span>
<span id="63">63</span>
<span id="64">64</span>
<span id="65">65</span>
<span id="66">66</span>
<span id="67">67</span>
<span id="68">68</span>
<span id="69">69</span>
<span id="70">70</span>
<span id="71">71</span>
<span id="72">72</span>
<span id="73">73</span>
<span id="74">74</span>
<span id="75">75</span>
<span id="76">76</span>
<span id="77">77</span>
<span id="78">78</span>
<span id="79">79</span>
<span id="80">80</span>
<span id="81">81</span>
<span id="82">82</span>
<span id="83">83</span>
<span id="84">84</span>
<span id="85">85</span>
<span id="86">86</span>
<span id="87">87</span>
<span id="88">88</span>
<span id="89">89</span>
<span id="90">90</span>
<span id="91">91</span>
<span id="92">92</span>
<span id="93">93</span>
<span id="94">94</span>
<span id="95">95</span>
<span id="96">96</span>
<span id="97">97</span>
<span id="98">98</span>
<span id="99">99</span>
<span id="100">100</span>
<span id="101">101</span>
<span id="102">102</span>
<span id="103">103</span>
<span id="104">104</span>
<span id="105">105</span>
<span id="106">106</span>
<span id="107">107</span>
<span id="108">108</span>
<span id="109">109</span>
<span id="110">110</span>
<span id="111">111</span>
<span id="112">112</span>
<span id="113">113</span>
<span id="114">114</span>
<span id="115">115</span>
<span id="116">116</span>
<span id="117">117</span>
<span id="118">118</span>
<span id="119">119</span>
<span id="120">120</span>
<span id="121">121</span>
<span id="122">122</span>
<span id="123">123</span>
<span id="124">124</span>
<span id="125">125</span>
<span id="126">126</span>
<span id="127">127</span>
<span id="128">128</span>
<span id="129">129</span>
<span id="130">130</span>
<span id="131">131</span>
<span id="132">132</span>
<span id="133">133</span>
<span id="134">134</span>
<span id="135">135</span>
<span id="136">136</span>
<span id="137">137</span>
<span id="138">138</span>
<span id="139">139</span>
<span id="140">140</span>
<span id="141">141</span>
<span id="142">142</span>
<span id="143">143</span>
<span id="144">144</span>
<span id="145">145</span>
<span id="146">146</span>
<span id="147">147</span>
<span id="148">148</span>
<span id="149">149</span>
<span id="150">150</span>
<span id="151">151</span>
<span id="152">152</span>
<span id="153">153</span>
<span id="154">154</span>
<span id="155">155</span>
<span id="156">156</span>
<span id="157">157</span>
<span id="158">158</span>
<span id="159">159</span>
<span id="160">160</span>
<span id="161">161</span>
<span id="162">162</span>
<span id="163">163</span>
<span id="164">164</span>
<span id="165">165</span>
<span id="166">166</span>
<span id="167">167</span>
<span id="168">168</span>
<span id="169">169</span>
<span id="170">170</span>
<span id="171">171</span>
<span id="172">172</span>
<span id="173">173</span>
<span id="174">174</span>
<span id="175">175</span>
<span id="176">176</span>
<span id="177">177</span>
<span id="178">178</span>
<span id="179">179</span>
<span id="180">180</span>
<span id="181">181</span>
<span id="182">182</span>
<span id="183">183</span>
<span id="184">184</span>
<span id="185">185</span>
<span id="186">186</span>
<span id="187">187</span>
<span id="188">188</span>
<span id="189">189</span>
<span id="190">190</span>
<span id="191">191</span>
<span id="192">192</span>
<span id="193">193</span>
<span id="194">194</span>
<span id="195">195</span>
<span id="196">196</span>
<span id="197">197</span>
<span id="198">198</span>
<span id="199">199</span>
<span id="200">200</span>
<span id="201">201</span>
<span id="202">202</span>
<span id="203">203</span>
<span id="204">204</span>
<span id="205">205</span>
<span id="206">206</span>
<span id="207">207</span>
<span id="208">208</span>
<span id="209">209</span>
<span id="210">210</span>
<span id="211">211</span>
<span id="212">212</span>
<span id="213">213</span>
<span id="214">214</span>
<span id="215">215</span>
<span id="216">216</span>
<span id="217">217</span>
<span id="218">218</span>
<span id="219">219</span>
<span id="220">220</span>
<span id="221">221</span>
<span id="222">222</span>
<span id="223">223</span>
<span id="224">224</span>
<span id="225">225</span>
<span id="226">226</span>
<span id="227">227</span>
<span id="228">228</span>
<span id="229">229</span>
<span id="230">230</span>
<span id="231">231</span>
<span id="232">232</span>
<span id="233">233</span>
<span id="234">234</span>
<span id="235">235</span>
<span id="236">236</span>
<span id="237">237</span>
<span id="238">238</span>
<span id="239">239</span>
<span id="240">240</span>
<span id="241">241</span>
<span id="242">242</span>
<span id="243">243</span>
<span id="244">244</span>
<span id="245">245</span>
<span id="246">246</span>
<span id="247">247</span>
<span id="248">248</span>
<span id="249">249</span>
<span id="250">250</span>
<span id="251">251</span>
<span id="252">252</span>
<span id="253">253</span>
<span id="254">254</span>
<span id="255">255</span>
<span id="256">256</span>
<span id="257">257</span>
<span id="258">258</span>
<span id="259">259</span>
<span id="260">260</span>
<span id="261">261</span>
<span id="262">262</span>
<span id="263">263</span>
<span id="264">264</span>
<span id="265">265</span>
<span id="266">266</span>
<span id="267">267</span>
<span id="268">268</span>
<span id="269">269</span>
<span id="270">270</span>
<span id="271">271</span>
<span id="272">272</span>
<span id="273">273</span>
<span id="274">274</span>
<span id="275">275</span>
<span id="276">276</span>
<span id="277">277</span>
<span id="278">278</span>
<span id="279">279</span>
<span id="280">280</span>
<span id="281">281</span>
<span id="282">282</span>
<span id="283">283</span>
<span id="284">284</span>
<span id="285">285</span>
<span id="286">286</span>
<span id="287">287</span>
<span id="288">288</span>
<span id="289">289</span>
<span id="290">290</span>
<span id="291">291</span>
<span id="292">292</span>
<span id="293">293</span>
<span id="294">294</span>
<span id="295">295</span>
<span id="296">296</span>
<span id="297">297</span>
<span id="298">298</span>
<span id="299">299</span>
<span id="300">300</span>
<span id="301">301</span>
<span id="302">302</span>
<span id="303">303</span>
<span id="304">304</span>
<span id="305">305</span>
<span id="306">306</span>
<span id="307">307</span>
<span id="308">308</span>
<span id="309">309</span>
<span id="310">310</span>
<span id="311">311</span>
<span id="312">312</span>
<span id="313">313</span>
<span id="314">314</span>
<span id="315">315</span>
<span id="316">316</span>
<span id="317">317</span>
<span id="318">318</span>
<span id="319">319</span>
<span id="320">320</span>
<span id="321">321</span>
</pre><pre class="rust"><code><span class="kw">use </span>std::rc::Rc;
<span class="kw">use </span>integer_encoding::FixedInt;
<span class="doccomment">/// Encapsulates a filter algorithm allowing to search for keys more efficiently.
/// Usually, policies are used as a BoxedFilterPolicy (see below), so they
/// can be easily cloned and nested.
</span><span class="kw">pub trait </span>FilterPolicy {
<span class="doccomment">/// Returns a string identifying this policy.
</span><span class="kw">fn </span>name(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;static </span>str;
<span class="doccomment">/// Create a filter matching the given keys. Keys are given as a long byte array that is
/// indexed by the offsets contained in key_offsets.
</span><span class="kw">fn </span>create_filter(<span class="kw-2">&amp;</span><span class="self">self</span>, keys: <span class="kw-2">&amp;</span>[u8], key_offsets: <span class="kw-2">&amp;</span>[usize]) -&gt; Vec&lt;u8&gt;;
<span class="doccomment">/// Check whether the given key may match the filter.
</span><span class="kw">fn </span>key_may_match(<span class="kw-2">&amp;</span><span class="self">self</span>, key: <span class="kw-2">&amp;</span>[u8], filter: <span class="kw-2">&amp;</span>[u8]) -&gt; bool;
}
<span class="doccomment">/// A boxed and refcounted filter policy (reference-counted because a Box with unsized content
/// couldn&#39;t be cloned otherwise)
</span><span class="kw">pub type </span>BoxedFilterPolicy = Rc&lt;Box&lt;<span class="kw">dyn </span>FilterPolicy&gt;&gt;;
<span class="kw">impl </span>FilterPolicy <span class="kw">for </span>BoxedFilterPolicy {
<span class="kw">fn </span>name(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;static </span>str {
(<span class="kw-2">**</span><span class="self">self</span>).name()
}
<span class="kw">fn </span>create_filter(<span class="kw-2">&amp;</span><span class="self">self</span>, keys: <span class="kw-2">&amp;</span>[u8], key_offsets: <span class="kw-2">&amp;</span>[usize]) -&gt; Vec&lt;u8&gt; {
(<span class="kw-2">**</span><span class="self">self</span>).create_filter(keys, key_offsets)
}
<span class="kw">fn </span>key_may_match(<span class="kw-2">&amp;</span><span class="self">self</span>, key: <span class="kw-2">&amp;</span>[u8], filter: <span class="kw-2">&amp;</span>[u8]) -&gt; bool {
(<span class="kw-2">**</span><span class="self">self</span>).key_may_match(key, filter)
}
}
<span class="doccomment">/// Used for tables that don&#39;t have filter blocks but need a type parameter.
</span><span class="attribute">#[derive(Clone)]
</span><span class="kw">pub struct </span>NoFilterPolicy;
<span class="kw">impl </span>NoFilterPolicy {
<span class="kw">pub fn </span>new() -&gt; NoFilterPolicy {
NoFilterPolicy
}
}
<span class="kw">impl </span>FilterPolicy <span class="kw">for </span>NoFilterPolicy {
<span class="kw">fn </span>name(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;static </span>str {
<span class="string">&quot;_&quot;
</span>}
<span class="kw">fn </span>create_filter(<span class="kw-2">&amp;</span><span class="self">self</span>, <span class="kw">_</span>: <span class="kw-2">&amp;</span>[u8], <span class="kw">_</span>: <span class="kw-2">&amp;</span>[usize]) -&gt; Vec&lt;u8&gt; {
<span class="macro">vec!</span>[]
}
<span class="kw">fn </span>key_may_match(<span class="kw-2">&amp;</span><span class="self">self</span>, <span class="kw">_</span>: <span class="kw-2">&amp;</span>[u8], <span class="kw">_</span>: <span class="kw-2">&amp;</span>[u8]) -&gt; bool {
<span class="bool-val">true
</span>}
}
<span class="kw">const </span>BLOOM_SEED: u32 = <span class="number">0xbc9f1d34</span>;
<span class="doccomment">/// A filter policy using a bloom filter internally.
</span><span class="attribute">#[derive(Clone)]
</span><span class="kw">pub struct </span>BloomPolicy {
bits_per_key: u32,
k: u32,
}
<span class="doccomment">/// Beware the magic numbers...
</span><span class="kw">impl </span>BloomPolicy {
<span class="doccomment">/// Returns a new boxed BloomPolicy.
</span><span class="kw">pub fn </span>new(bits_per_key: u32) -&gt; BloomPolicy {
BloomPolicy::new_unwrapped(bits_per_key)
}
<span class="doccomment">/// Returns a new BloomPolicy with the given parameter.
</span><span class="kw">fn </span>new_unwrapped(bits_per_key: u32) -&gt; BloomPolicy {
<span class="kw">let </span><span class="kw-2">mut </span>k = (bits_per_key <span class="kw">as </span>f32 * <span class="number">0.69</span>) <span class="kw">as </span>u32;
<span class="kw">if </span>k &lt; <span class="number">1 </span>{
k = <span class="number">1</span>;
} <span class="kw">else if </span>k &gt; <span class="number">30 </span>{
k = <span class="number">30</span>;
}
BloomPolicy { bits_per_key, k }
}
<span class="kw">fn </span>bloom_hash(<span class="kw-2">&amp;</span><span class="self">self</span>, data: <span class="kw-2">&amp;</span>[u8]) -&gt; u32 {
<span class="kw">let </span>m: u32 = <span class="number">0xc6a4a793</span>;
<span class="kw">let </span>r: u32 = <span class="number">24</span>;
<span class="kw">let </span><span class="kw-2">mut </span>ix = <span class="number">0</span>;
<span class="kw">let </span>limit = data.len();
<span class="kw">let </span><span class="kw-2">mut </span>h: u32 = BLOOM_SEED ^ (limit <span class="kw">as </span>u64 * m <span class="kw">as </span>u64) <span class="kw">as </span>u32;
<span class="kw">while </span>ix + <span class="number">4 </span>&lt;= limit {
<span class="kw">let </span>w = u32::decode_fixed(<span class="kw-2">&amp;</span>data[ix..ix + <span class="number">4</span>]);
ix += <span class="number">4</span>;
h = (h <span class="kw">as </span>u64 + w <span class="kw">as </span>u64) <span class="kw">as </span>u32;
h = (h <span class="kw">as </span>u64 * m <span class="kw">as </span>u64) <span class="kw">as </span>u32;
h ^= h &gt;&gt; <span class="number">16</span>;
}
<span class="comment">// Process left-over bytes
</span><span class="macro">assert!</span>(limit - ix &lt; <span class="number">4</span>);
<span class="kw">if </span>limit - ix &gt; <span class="number">0 </span>{
<span class="kw">let </span><span class="kw-2">mut </span>i = <span class="number">0</span>;
<span class="kw">for </span>b <span class="kw">in </span>data[ix..].iter() {
h = h.overflowing_add((<span class="kw-2">*</span>b <span class="kw">as </span>u32) &lt;&lt; (<span class="number">8 </span>* i)).<span class="number">0</span>;
i += <span class="number">1</span>;
}
h = (h <span class="kw">as </span>u64 * m <span class="kw">as </span>u64) <span class="kw">as </span>u32;
h ^= h &gt;&gt; r;
}
h
}
}
<span class="kw">impl </span>FilterPolicy <span class="kw">for </span>BloomPolicy {
<span class="kw">fn </span>name(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;static </span>str {
<span class="string">&quot;leveldb.BuiltinBloomFilter2&quot;
</span>}
<span class="kw">fn </span>create_filter(<span class="kw-2">&amp;</span><span class="self">self</span>, keys: <span class="kw-2">&amp;</span>[u8], key_offsets: <span class="kw-2">&amp;</span>[usize]) -&gt; Vec&lt;u8&gt; {
<span class="kw">let </span>filter_bits = key_offsets.len() * <span class="self">self</span>.bits_per_key <span class="kw">as </span>usize;
<span class="kw">let </span><span class="kw-2">mut </span>filter: Vec&lt;u8&gt;;
<span class="kw">if </span>filter_bits &lt; <span class="number">64 </span>{
filter = Vec::with_capacity(<span class="number">8 </span>+ <span class="number">1</span>);
filter.resize(<span class="number">8</span>, <span class="number">0</span>);
} <span class="kw">else </span>{
filter = Vec::with_capacity(<span class="number">1 </span>+ ((filter_bits + <span class="number">7</span>) / <span class="number">8</span>));
filter.resize((filter_bits + <span class="number">7</span>) / <span class="number">8</span>, <span class="number">0</span>);
}
<span class="kw">let </span>adj_filter_bits = (filter.len() * <span class="number">8</span>) <span class="kw">as </span>u32;
<span class="comment">// Encode k at the end of the filter.
</span>filter.push(<span class="self">self</span>.k <span class="kw">as </span>u8);
<span class="comment">// Add all keys to the filter.
</span>offset_data_iterate(keys, key_offsets, |key| {
<span class="kw">let </span><span class="kw-2">mut </span>h = <span class="self">self</span>.bloom_hash(key);
<span class="kw">let </span>delta = (h &gt;&gt; <span class="number">17</span>) | (h &lt;&lt; <span class="number">15</span>);
<span class="kw">for _ in </span><span class="number">0</span>..<span class="self">self</span>.k {
<span class="kw">let </span>bitpos = (h % adj_filter_bits) <span class="kw">as </span>usize;
filter[bitpos / <span class="number">8</span>] |= <span class="number">1 </span>&lt;&lt; (bitpos % <span class="number">8</span>);
h = (h <span class="kw">as </span>u64 + delta <span class="kw">as </span>u64) <span class="kw">as </span>u32;
}
});
filter
}
<span class="kw">fn </span>key_may_match(<span class="kw-2">&amp;</span><span class="self">self</span>, key: <span class="kw-2">&amp;</span>[u8], filter: <span class="kw-2">&amp;</span>[u8]) -&gt; bool {
<span class="kw">if </span>filter.len() == <span class="number">0 </span>{
<span class="kw">return </span><span class="bool-val">true</span>;
}
<span class="kw">let </span>bits = (filter.len() - <span class="number">1</span>) <span class="kw">as </span>u32 * <span class="number">8</span>;
<span class="kw">let </span>k = filter[filter.len() - <span class="number">1</span>];
<span class="kw">let </span>filter_adj = <span class="kw-2">&amp;</span>filter[<span class="number">0</span>..filter.len() - <span class="number">1</span>];
<span class="kw">if </span>k &gt; <span class="number">30 </span>{
<span class="kw">return </span><span class="bool-val">true</span>;
}
<span class="kw">let </span><span class="kw-2">mut </span>h = <span class="self">self</span>.bloom_hash(key);
<span class="kw">let </span>delta = (h &gt;&gt; <span class="number">17</span>) | (h &lt;&lt; <span class="number">15</span>);
<span class="kw">for _ in </span><span class="number">0</span>..k {
<span class="kw">let </span>bitpos = (h % bits) <span class="kw">as </span>usize;
<span class="kw">if </span>(filter_adj[bitpos / <span class="number">8</span>] &amp; (<span class="number">1 </span>&lt;&lt; (bitpos % <span class="number">8</span>))) == <span class="number">0 </span>{
<span class="kw">return </span><span class="bool-val">false</span>;
}
h = (h <span class="kw">as </span>u64 + delta <span class="kw">as </span>u64) <span class="kw">as </span>u32;
}
<span class="bool-val">true
</span>}
}
<span class="doccomment">/// A filter policy wrapping another policy; extracting the user key from internal keys for all
/// operations.
/// A User Key is u8*.
/// An Internal Key is u8* u8{8} (where the second part encodes a tag and a sequence number).
</span><span class="attribute">#[derive(Clone)]
</span><span class="kw">pub struct </span>InternalFilterPolicy&lt;FP: FilterPolicy&gt; {
internal: FP,
}
<span class="kw">impl</span>&lt;FP: FilterPolicy&gt; InternalFilterPolicy&lt;FP&gt; {
<span class="kw">pub fn </span>new(inner: FP) -&gt; InternalFilterPolicy&lt;FP&gt; {
InternalFilterPolicy { internal: inner }
}
}
<span class="kw">impl</span>&lt;FP: FilterPolicy&gt; FilterPolicy <span class="kw">for </span>InternalFilterPolicy&lt;FP&gt; {
<span class="kw">fn </span>name(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;static </span>str {
<span class="self">self</span>.internal.name()
}
<span class="kw">fn </span>create_filter(<span class="kw-2">&amp;</span><span class="self">self</span>, keys: <span class="kw-2">&amp;</span>[u8], key_offsets: <span class="kw-2">&amp;</span>[usize]) -&gt; Vec&lt;u8&gt; {
<span class="kw">let </span><span class="kw-2">mut </span>mod_keys = Vec::with_capacity(keys.len() - key_offsets.len() * <span class="number">8</span>);
<span class="kw">let </span><span class="kw-2">mut </span>mod_key_offsets = Vec::with_capacity(key_offsets.len());
offset_data_iterate(keys, key_offsets, |key| {
mod_key_offsets.push(mod_keys.len());
mod_keys.extend_from_slice(<span class="kw-2">&amp;</span>key[<span class="number">0</span>..key.len() - <span class="number">8</span>]);
});
<span class="self">self</span>.internal.create_filter(<span class="kw-2">&amp;</span>mod_keys, <span class="kw-2">&amp;</span>mod_key_offsets)
}
<span class="kw">fn </span>key_may_match(<span class="kw-2">&amp;</span><span class="self">self</span>, key: <span class="kw-2">&amp;</span>[u8], filter: <span class="kw-2">&amp;</span>[u8]) -&gt; bool {
<span class="self">self</span>.internal.key_may_match(<span class="kw-2">&amp;</span>key[<span class="number">0</span>..key.len() - <span class="number">8</span>], filter)
}
}
<span class="doccomment">/// offset_data_iterate iterates over the entries in data that are indexed by the offsets given in
/// offsets. This is e.g. the internal format of a FilterBlock.
</span><span class="kw">fn </span>offset_data_iterate&lt;F: FnMut(<span class="kw-2">&amp;</span>[u8])&gt;(data: <span class="kw-2">&amp;</span>[u8], offsets: <span class="kw-2">&amp;</span>[usize], <span class="kw-2">mut </span>f: F) {
<span class="kw">for </span>offix <span class="kw">in </span><span class="number">0</span>..offsets.len() {
<span class="kw">let </span>upper = <span class="kw">if </span>offix == offsets.len() - <span class="number">1 </span>{
data.len()
} <span class="kw">else </span>{
offsets[offix + <span class="number">1</span>]
};
<span class="kw">let </span>piece = <span class="kw-2">&amp;</span>data[offsets[offix]..upper];
f(piece);
}
}
<span class="attribute">#[cfg(feature = <span class="string">&quot;enclave_unit_test&quot;</span>)]
</span><span class="kw">pub mod </span>tests {
<span class="kw">use super</span>::<span class="kw-2">*</span>;
<span class="kw">use </span><span class="kw">crate</span>::key_types::LookupKey;
<span class="kw">use </span>teaclave_test_utils::<span class="kw-2">*</span>;
<span class="kw">pub fn </span>run_tests() -&gt; bool {
<span class="macro">run_tests!</span>(
test_filter_bloom,
test_filter_internal_keys_identical,
test_filter_bloom_hash,
)
}
<span class="kw">const </span>_BITS_PER_KEY: u32 = <span class="number">12</span>;
<span class="kw">fn </span>input_data() -&gt; (Vec&lt;u8&gt;, Vec&lt;usize&gt;) {
<span class="kw">let </span><span class="kw-2">mut </span>concat = <span class="macro">vec!</span>[];
<span class="kw">let </span><span class="kw-2">mut </span>offs = <span class="macro">vec!</span>[];
<span class="kw">for </span>d <span class="kw">in </span>[
<span class="string">&quot;abc123def456&quot;</span>.as_bytes(),
<span class="string">&quot;xxx111xxx222&quot;</span>.as_bytes(),
<span class="string">&quot;ab00cd00ab&quot;</span>.as_bytes(),
<span class="string">&quot;908070605040302010&quot;</span>.as_bytes(),
]
.iter()
{
offs.push(concat.len());
concat.extend_from_slice(d);
}
(concat, offs)
}
<span class="doccomment">/// Creates a filter using the keys from input_data().
</span><span class="kw">fn </span>create_filter() -&gt; Vec&lt;u8&gt; {
<span class="kw">let </span>fpol = BloomPolicy::new(_BITS_PER_KEY);
<span class="kw">let </span>(data, offs) = input_data();
<span class="kw">let </span>filter = fpol.create_filter(<span class="kw-2">&amp;</span>data, <span class="kw-2">&amp;</span>offs);
<span class="macro">assert_eq!</span>(filter, <span class="macro">vec!</span>[<span class="number">194</span>, <span class="number">148</span>, <span class="number">129</span>, <span class="number">140</span>, <span class="number">192</span>, <span class="number">196</span>, <span class="number">132</span>, <span class="number">164</span>, <span class="number">8</span>]);
filter
}
<span class="doccomment">/// Creates a filter using the keys from input_data() but converted to InternalKey format.
</span><span class="kw">fn </span>create_internalkey_filter() -&gt; Vec&lt;u8&gt; {
<span class="kw">let </span>fpol = Rc::new(Box::new(InternalFilterPolicy::new(BloomPolicy::new(
_BITS_PER_KEY,
))));
<span class="kw">let </span>(data, offs) = input_data();
<span class="kw">let </span>(<span class="kw-2">mut </span>intdata, <span class="kw-2">mut </span>intoffs) = (<span class="macro">vec!</span>[], <span class="macro">vec!</span>[]);
offset_data_iterate(<span class="kw-2">&amp;</span>data, <span class="kw-2">&amp;</span>offs, |key| {
<span class="kw">let </span>ikey = LookupKey::new(key, <span class="number">123</span>);
intoffs.push(intdata.len());
intdata.extend_from_slice(ikey.internal_key());
});
<span class="kw">let </span>filter = fpol.create_filter(<span class="kw-2">&amp;</span>intdata, <span class="kw-2">&amp;</span>intoffs);
filter
}
<span class="kw">fn </span>test_filter_bloom() {
<span class="kw">let </span>f = create_filter();
<span class="kw">let </span>fp = BloomPolicy::new(_BITS_PER_KEY);
<span class="kw">let </span>(data, offs) = input_data();
offset_data_iterate(<span class="kw-2">&amp;</span>data, <span class="kw-2">&amp;</span>offs, |key| {
<span class="macro">assert!</span>(fp.key_may_match(key, <span class="kw-2">&amp;</span>f));
});
}
<span class="doccomment">/// This test verifies that InternalFilterPolicy works correctly.
</span><span class="kw">fn </span>test_filter_internal_keys_identical() {
<span class="macro">assert_eq!</span>(create_filter(), create_internalkey_filter());
}
<span class="kw">fn </span>test_filter_bloom_hash() {
<span class="kw">let </span>d1 = <span class="macro">vec!</span>[<span class="number">0x62</span>];
<span class="kw">let </span>d2 = <span class="macro">vec!</span>[<span class="number">0xc3</span>, <span class="number">0x97</span>];
<span class="kw">let </span>d3 = <span class="macro">vec!</span>[<span class="number">0xe2</span>, <span class="number">0x99</span>, <span class="number">0xa5</span>];
<span class="kw">let </span>d4 = <span class="macro">vec!</span>[<span class="number">0xe1</span>, <span class="number">0x80</span>, <span class="number">0xb9</span>, <span class="number">0x32</span>];
<span class="kw">let </span>fp = BloomPolicy::new_unwrapped(_BITS_PER_KEY);
<span class="macro">assert_eq!</span>(fp.bloom_hash(<span class="kw-2">&amp;</span>d1), <span class="number">0xef1345c4</span>);
<span class="macro">assert_eq!</span>(fp.bloom_hash(<span class="kw-2">&amp;</span>d2), <span class="number">0x5b663814</span>);
<span class="macro">assert_eq!</span>(fp.bloom_hash(<span class="kw-2">&amp;</span>d3), <span class="number">0x323c078f</span>);
<span class="macro">assert_eq!</span>(fp.bloom_hash(<span class="kw-2">&amp;</span>d4), <span class="number">0xed21633a</span>);
}
}
</code></pre></div>
</section></div></main><div id="rustdoc-vars" data-root-path="../../" data-current-crate="rusty_leveldb" data-themes="ayu,dark,light" data-resource-suffix="" data-rustdoc-version="1.66.0-nightly (5c8bff74b 2022-10-21)" ></div></body></html>