Google Git
Sign in
apache / incubator-teaclave-website / refs/heads/asf-site / . / api-docs / crates-enclave / src / rusty_leveldb / table_reader.rs.html
blob: 1ce3098f5350a172fe93f382e80164a0248e59df [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/table_reader.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>table_reader.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>
<span id="322">322</span>
<span id="323">323</span>
<span id="324">324</span>
<span id="325">325</span>
<span id="326">326</span>
<span id="327">327</span>
<span id="328">328</span>
<span id="329">329</span>
<span id="330">330</span>
<span id="331">331</span>
<span id="332">332</span>
<span id="333">333</span>
<span id="334">334</span>
<span id="335">335</span>
<span id="336">336</span>
<span id="337">337</span>
<span id="338">338</span>
<span id="339">339</span>
<span id="340">340</span>
<span id="341">341</span>
<span id="342">342</span>
<span id="343">343</span>
<span id="344">344</span>
<span id="345">345</span>
<span id="346">346</span>
<span id="347">347</span>
<span id="348">348</span>
<span id="349">349</span>
<span id="350">350</span>
<span id="351">351</span>
<span id="352">352</span>
<span id="353">353</span>
<span id="354">354</span>
<span id="355">355</span>
<span id="356">356</span>
<span id="357">357</span>
<span id="358">358</span>
<span id="359">359</span>
<span id="360">360</span>
<span id="361">361</span>
<span id="362">362</span>
<span id="363">363</span>
<span id="364">364</span>
<span id="365">365</span>
<span id="366">366</span>
<span id="367">367</span>
<span id="368">368</span>
<span id="369">369</span>
<span id="370">370</span>
<span id="371">371</span>
<span id="372">372</span>
<span id="373">373</span>
<span id="374">374</span>
<span id="375">375</span>
<span id="376">376</span>
<span id="377">377</span>
<span id="378">378</span>
<span id="379">379</span>
<span id="380">380</span>
<span id="381">381</span>
<span id="382">382</span>
<span id="383">383</span>
<span id="384">384</span>
<span id="385">385</span>
<span id="386">386</span>
<span id="387">387</span>
<span id="388">388</span>
<span id="389">389</span>
<span id="390">390</span>
<span id="391">391</span>
<span id="392">392</span>
<span id="393">393</span>
<span id="394">394</span>
<span id="395">395</span>
<span id="396">396</span>
<span id="397">397</span>
<span id="398">398</span>
<span id="399">399</span>
<span id="400">400</span>
<span id="401">401</span>
<span id="402">402</span>
<span id="403">403</span>
<span id="404">404</span>
<span id="405">405</span>
<span id="406">406</span>
<span id="407">407</span>
<span id="408">408</span>
<span id="409">409</span>
<span id="410">410</span>
<span id="411">411</span>
<span id="412">412</span>
<span id="413">413</span>
<span id="414">414</span>
<span id="415">415</span>
<span id="416">416</span>
<span id="417">417</span>
<span id="418">418</span>
<span id="419">419</span>
<span id="420">420</span>
<span id="421">421</span>
<span id="422">422</span>
<span id="423">423</span>
<span id="424">424</span>
<span id="425">425</span>
<span id="426">426</span>
<span id="427">427</span>
<span id="428">428</span>
<span id="429">429</span>
<span id="430">430</span>
<span id="431">431</span>
<span id="432">432</span>
<span id="433">433</span>
<span id="434">434</span>
<span id="435">435</span>
<span id="436">436</span>
<span id="437">437</span>
<span id="438">438</span>
<span id="439">439</span>
<span id="440">440</span>
<span id="441">441</span>
<span id="442">442</span>
<span id="443">443</span>
<span id="444">444</span>
<span id="445">445</span>
<span id="446">446</span>
<span id="447">447</span>
<span id="448">448</span>
<span id="449">449</span>
<span id="450">450</span>
<span id="451">451</span>
<span id="452">452</span>
<span id="453">453</span>
<span id="454">454</span>
<span id="455">455</span>
<span id="456">456</span>
<span id="457">457</span>
<span id="458">458</span>
<span id="459">459</span>
<span id="460">460</span>
<span id="461">461</span>
<span id="462">462</span>
<span id="463">463</span>
<span id="464">464</span>
<span id="465">465</span>
<span id="466">466</span>
<span id="467">467</span>
<span id="468">468</span>
<span id="469">469</span>
<span id="470">470</span>
<span id="471">471</span>
<span id="472">472</span>
<span id="473">473</span>
<span id="474">474</span>
<span id="475">475</span>
<span id="476">476</span>
<span id="477">477</span>
<span id="478">478</span>
<span id="479">479</span>
<span id="480">480</span>
<span id="481">481</span>
<span id="482">482</span>
<span id="483">483</span>
<span id="484">484</span>
<span id="485">485</span>
<span id="486">486</span>
<span id="487">487</span>
<span id="488">488</span>
<span id="489">489</span>
<span id="490">490</span>
<span id="491">491</span>
<span id="492">492</span>
<span id="493">493</span>
<span id="494">494</span>
<span id="495">495</span>
<span id="496">496</span>
<span id="497">497</span>
<span id="498">498</span>
<span id="499">499</span>
<span id="500">500</span>
<span id="501">501</span>
<span id="502">502</span>
<span id="503">503</span>
<span id="504">504</span>
<span id="505">505</span>
<span id="506">506</span>
<span id="507">507</span>
<span id="508">508</span>
<span id="509">509</span>
<span id="510">510</span>
<span id="511">511</span>
<span id="512">512</span>
<span id="513">513</span>
<span id="514">514</span>
<span id="515">515</span>
<span id="516">516</span>
<span id="517">517</span>
<span id="518">518</span>
<span id="519">519</span>
<span id="520">520</span>
<span id="521">521</span>
<span id="522">522</span>
<span id="523">523</span>
<span id="524">524</span>
<span id="525">525</span>
<span id="526">526</span>
<span id="527">527</span>
<span id="528">528</span>
<span id="529">529</span>
<span id="530">530</span>
<span id="531">531</span>
<span id="532">532</span>
<span id="533">533</span>
<span id="534">534</span>
<span id="535">535</span>
<span id="536">536</span>
<span id="537">537</span>
<span id="538">538</span>
<span id="539">539</span>
<span id="540">540</span>
<span id="541">541</span>
<span id="542">542</span>
<span id="543">543</span>
<span id="544">544</span>
<span id="545">545</span>
<span id="546">546</span>
<span id="547">547</span>
<span id="548">548</span>
<span id="549">549</span>
<span id="550">550</span>
<span id="551">551</span>
<span id="552">552</span>
<span id="553">553</span>
<span id="554">554</span>
<span id="555">555</span>
<span id="556">556</span>
<span id="557">557</span>
<span id="558">558</span>
<span id="559">559</span>
<span id="560">560</span>
<span id="561">561</span>
<span id="562">562</span>
<span id="563">563</span>
<span id="564">564</span>
<span id="565">565</span>
<span id="566">566</span>
<span id="567">567</span>
<span id="568">568</span>
<span id="569">569</span>
<span id="570">570</span>
<span id="571">571</span>
<span id="572">572</span>
<span id="573">573</span>
<span id="574">574</span>
<span id="575">575</span>
<span id="576">576</span>
<span id="577">577</span>
<span id="578">578</span>
<span id="579">579</span>
<span id="580">580</span>
<span id="581">581</span>
<span id="582">582</span>
<span id="583">583</span>
<span id="584">584</span>
<span id="585">585</span>
<span id="586">586</span>
<span id="587">587</span>
<span id="588">588</span>
<span id="589">589</span>
<span id="590">590</span>
<span id="591">591</span>
<span id="592">592</span>
<span id="593">593</span>
<span id="594">594</span>
<span id="595">595</span>
<span id="596">596</span>
<span id="597">597</span>
<span id="598">598</span>
<span id="599">599</span>
<span id="600">600</span>
<span id="601">601</span>
<span id="602">602</span>
<span id="603">603</span>
<span id="604">604</span>
<span id="605">605</span>
<span id="606">606</span>
<span id="607">607</span>
<span id="608">608</span>
<span id="609">609</span>
<span id="610">610</span>
<span id="611">611</span>
<span id="612">612</span>
<span id="613">613</span>
<span id="614">614</span>
<span id="615">615</span>
<span id="616">616</span>
<span id="617">617</span>
<span id="618">618</span>
<span id="619">619</span>
<span id="620">620</span>
<span id="621">621</span>
<span id="622">622</span>
<span id="623">623</span>
<span id="624">624</span>
<span id="625">625</span>
<span id="626">626</span>
<span id="627">627</span>
<span id="628">628</span>
<span id="629">629</span>
<span id="630">630</span>
<span id="631">631</span>
<span id="632">632</span>
<span id="633">633</span>
<span id="634">634</span>
<span id="635">635</span>
<span id="636">636</span>
<span id="637">637</span>
<span id="638">638</span>
<span id="639">639</span>
<span id="640">640</span>
<span id="641">641</span>
<span id="642">642</span>
<span id="643">643</span>
<span id="644">644</span>
<span id="645">645</span>
<span id="646">646</span>
<span id="647">647</span>
<span id="648">648</span>
<span id="649">649</span>
<span id="650">650</span>
<span id="651">651</span>
<span id="652">652</span>
<span id="653">653</span>
<span id="654">654</span>
<span id="655">655</span>
<span id="656">656</span>
<span id="657">657</span>
<span id="658">658</span>
<span id="659">659</span>
<span id="660">660</span>
<span id="661">661</span>
<span id="662">662</span>
<span id="663">663</span>
<span id="664">664</span>
<span id="665">665</span>
<span id="666">666</span>
<span id="667">667</span>
<span id="668">668</span>
<span id="669">669</span>
<span id="670">670</span>
<span id="671">671</span>
<span id="672">672</span>
<span id="673">673</span>
<span id="674">674</span>
<span id="675">675</span>
<span id="676">676</span>
<span id="677">677</span>
<span id="678">678</span>
<span id="679">679</span>
<span id="680">680</span>
<span id="681">681</span>
<span id="682">682</span>
<span id="683">683</span>
<span id="684">684</span>
<span id="685">685</span>
<span id="686">686</span>
<span id="687">687</span>
<span id="688">688</span>
<span id="689">689</span>
<span id="690">690</span>
<span id="691">691</span>
<span id="692">692</span>
<span id="693">693</span>
<span id="694">694</span>
<span id="695">695</span>
<span id="696">696</span>
<span id="697">697</span>
<span id="698">698</span>
<span id="699">699</span>
<span id="700">700</span>
<span id="701">701</span>
<span id="702">702</span>
<span id="703">703</span>
<span id="704">704</span>
<span id="705">705</span>
<span id="706">706</span>
<span id="707">707</span>
<span id="708">708</span>
<span id="709">709</span>
<span id="710">710</span>
<span id="711">711</span>
<span id="712">712</span>
<span id="713">713</span>
<span id="714">714</span>
<span id="715">715</span>
<span id="716">716</span>
<span id="717">717</span>
<span id="718">718</span>
<span id="719">719</span>
<span id="720">720</span>
<span id="721">721</span>
<span id="722">722</span>
<span id="723">723</span>
<span id="724">724</span>
<span id="725">725</span>
<span id="726">726</span>
<span id="727">727</span>
<span id="728">728</span>
<span id="729">729</span>
<span id="730">730</span>
<span id="731">731</span>
<span id="732">732</span>
<span id="733">733</span>
<span id="734">734</span>
<span id="735">735</span>
<span id="736">736</span>
<span id="737">737</span>
<span id="738">738</span>
<span id="739">739</span>
<span id="740">740</span>
<span id="741">741</span>
<span id="742">742</span>
<span id="743">743</span>
<span id="744">744</span>
<span id="745">745</span>
<span id="746">746</span>
<span id="747">747</span>
<span id="748">748</span>
<span id="749">749</span>
<span id="750">750</span>
<span id="751">751</span>
<span id="752">752</span>
<span id="753">753</span>
<span id="754">754</span>
</pre><pre class="rust"><code><span class="kw">use </span><span class="kw">crate</span>::block::{Block, BlockIter};
<span class="kw">use </span><span class="kw">crate</span>::blockhandle::BlockHandle;
<span class="kw">use </span><span class="kw">crate</span>::cache;
<span class="kw">use </span><span class="kw">crate</span>::cmp::InternalKeyCmp;
<span class="kw">use </span><span class="kw">crate</span>::env::RandomAccess;
<span class="kw">use </span><span class="kw">crate</span>::error::Result;
<span class="kw">use </span><span class="kw">crate</span>::filter;
<span class="kw">use </span><span class="kw">crate</span>::filter_block::FilterBlockReader;
<span class="kw">use </span><span class="kw">crate</span>::key_types::InternalKey;
<span class="kw">use </span><span class="kw">crate</span>::options::Options;
<span class="kw">use </span><span class="kw">crate</span>::table_block;
<span class="kw">use </span><span class="kw">crate</span>::table_builder::{<span class="self">self</span>, Footer};
<span class="kw">use </span><span class="kw">crate</span>::types::{current_key_val, LdbIterator};
<span class="kw">use </span>std::cmp::Ordering;
<span class="kw">use </span>std::rc::Rc;
<span class="kw">use </span>integer_encoding::FixedIntWriter;
<span class="doccomment">/// Reads the table footer.
</span><span class="kw">fn </span>read_footer(f: <span class="kw-2">&amp;</span><span class="kw">dyn </span>RandomAccess, size: usize) -&gt; <span class="prelude-ty">Result</span>&lt;Footer&gt; {
<span class="kw">let </span><span class="kw-2">mut </span>buf = <span class="macro">vec!</span>[<span class="number">0</span>; table_builder::FULL_FOOTER_LENGTH];
f.read_at(size - table_builder::FULL_FOOTER_LENGTH, <span class="kw-2">&amp;mut </span>buf)<span class="question-mark">?</span>;
<span class="prelude-val">Ok</span>(Footer::decode(<span class="kw-2">&amp;</span>buf))
}
<span class="attribute">#[derive(Clone)]
</span><span class="kw">pub struct </span>Table {
file: Rc&lt;Box&lt;<span class="kw">dyn </span>RandomAccess&gt;&gt;,
file_size: usize,
cache_id: cache::CacheID,
opt: Options,
footer: Footer,
indexblock: Block,
filters: <span class="prelude-ty">Option</span>&lt;FilterBlockReader&gt;,
}
<span class="kw">impl </span>Table {
<span class="doccomment">/// Creates a new table reader operating on unformatted keys (i.e., UserKey).
</span><span class="kw">fn </span>new_raw(opt: Options, file: Rc&lt;Box&lt;<span class="kw">dyn </span>RandomAccess&gt;&gt;, size: usize) -&gt; <span class="prelude-ty">Result</span>&lt;Table&gt; {
<span class="kw">let </span>footer = read_footer(file.as_ref().as_ref(), size)<span class="question-mark">?</span>;
<span class="kw">let </span>indexblock =
table_block::read_table_block(opt.clone(), file.as_ref().as_ref(), <span class="kw-2">&amp;</span>footer.index)<span class="question-mark">?</span>;
<span class="kw">let </span>metaindexblock =
table_block::read_table_block(opt.clone(), file.as_ref().as_ref(), <span class="kw-2">&amp;</span>footer.meta_index)<span class="question-mark">?</span>;
<span class="kw">let </span>filter_block_reader =
Table::read_filter_block(<span class="kw-2">&amp;</span>metaindexblock, file.as_ref().as_ref(), <span class="kw-2">&amp;</span>opt)<span class="question-mark">?</span>;
<span class="kw">let </span>cache_id = opt.block_cache.borrow_mut().new_cache_id();
<span class="prelude-val">Ok</span>(Table {
file,
file_size: size,
cache_id,
opt,
footer,
filters: filter_block_reader,
indexblock,
})
}
<span class="kw">fn </span>read_filter_block(
metaix: <span class="kw-2">&amp;</span>Block,
file: <span class="kw-2">&amp;</span><span class="kw">dyn </span>RandomAccess,
options: <span class="kw-2">&amp;</span>Options,
) -&gt; <span class="prelude-ty">Result</span>&lt;<span class="prelude-ty">Option</span>&lt;FilterBlockReader&gt;&gt; {
<span class="comment">// Open filter block for reading
</span><span class="kw">let </span>filter_name = <span class="macro">format!</span>(<span class="string">&quot;filter.{}&quot;</span>, options.filter_policy.name())
.as_bytes()
.to_vec();
<span class="kw">let </span><span class="kw-2">mut </span>metaindexiter = metaix.iter();
metaindexiter.seek(<span class="kw-2">&amp;</span>filter_name);
<span class="kw">if let </span><span class="prelude-val">Some</span>((_key, val)) = current_key_val(<span class="kw-2">&amp;</span>metaindexiter) {
<span class="kw">let </span>filter_block_location = BlockHandle::decode(<span class="kw-2">&amp;</span>val).<span class="number">0</span>;
<span class="kw">if </span>filter_block_location.size() &gt; <span class="number">0 </span>{
<span class="kw">return </span><span class="prelude-val">Ok</span>(<span class="prelude-val">Some</span>(table_block::read_filter_block(
file,
<span class="kw-2">&amp;</span>filter_block_location,
options.filter_policy.clone(),
)<span class="question-mark">?</span>));
}
}
<span class="prelude-val">Ok</span>(<span class="prelude-val">None</span>)
}
<span class="doccomment">/// Creates a new table reader operating on internal keys (i.e., InternalKey). This means that
/// a different comparator (internal_key_cmp) and a different filter policy
/// (InternalFilterPolicy) are used.
</span><span class="kw">pub fn </span>new(<span class="kw-2">mut </span>opt: Options, file: Rc&lt;Box&lt;<span class="kw">dyn </span>RandomAccess&gt;&gt;, size: usize) -&gt; <span class="prelude-ty">Result</span>&lt;Table&gt; {
opt.cmp = Rc::new(Box::new(InternalKeyCmp(opt.cmp.clone())));
opt.filter_policy = Rc::new(Box::new(filter::InternalFilterPolicy::new(
opt.filter_policy,
)));
Table::new_raw(opt, file, size)
}
<span class="doccomment">/// block_cache_handle creates a CacheKey for a block with a given offset to be used in the
/// block cache.
</span><span class="kw">fn </span>block_cache_handle(<span class="kw-2">&amp;</span><span class="self">self</span>, block_off: usize) -&gt; cache::CacheKey {
<span class="kw">let </span><span class="kw-2">mut </span>dst = [<span class="number">0</span>; <span class="number">2 </span>* <span class="number">8</span>];
(<span class="kw-2">&amp;mut </span>dst[..<span class="number">8</span>])
.write_fixedint(<span class="self">self</span>.cache_id)
.expect(<span class="string">&quot;error writing to vec&quot;</span>);
(<span class="kw-2">&amp;mut </span>dst[<span class="number">8</span>..])
.write_fixedint(block_off <span class="kw">as </span>u64)
.expect(<span class="string">&quot;error writing to vec&quot;</span>);
dst
}
<span class="doccomment">/// Read a block from the current table at `location`, and cache it in the options&#39; block
/// cache.
</span><span class="kw">fn </span>read_block(<span class="kw-2">&amp;</span><span class="self">self</span>, location: <span class="kw-2">&amp;</span>BlockHandle) -&gt; <span class="prelude-ty">Result</span>&lt;Block&gt; {
<span class="kw">let </span>cachekey = <span class="self">self</span>.block_cache_handle(location.offset());
<span class="kw">if let </span><span class="prelude-val">Some</span>(block) = <span class="self">self</span>.opt.block_cache.borrow_mut().get(<span class="kw-2">&amp;</span>cachekey) {
<span class="kw">return </span><span class="prelude-val">Ok</span>(block.clone());
}
<span class="comment">// Two times as_ref(): First time to get a ref from Rc&lt;&gt;, then one from Box&lt;&gt;.
</span><span class="kw">let </span>b =
table_block::read_table_block(<span class="self">self</span>.opt.clone(), <span class="self">self</span>.file.as_ref().as_ref(), location)<span class="question-mark">?</span>;
<span class="comment">// insert a cheap copy (Rc).
</span><span class="self">self</span>.opt
.block_cache
.borrow_mut()
.insert(<span class="kw-2">&amp;</span>cachekey, b.clone());
<span class="prelude-val">Ok</span>(b)
}
<span class="doccomment">/// Returns the offset of the block that contains `key`.
</span><span class="kw">pub fn </span>approx_offset_of(<span class="kw-2">&amp;</span><span class="self">self</span>, key: <span class="kw-2">&amp;</span>[u8]) -&gt; usize {
<span class="kw">let </span><span class="kw-2">mut </span>iter = <span class="self">self</span>.indexblock.iter();
iter.seek(key);
<span class="kw">if let </span><span class="prelude-val">Some</span>((<span class="kw">_</span>, val)) = current_key_val(<span class="kw-2">&amp;</span>iter) {
<span class="kw">let </span>location = BlockHandle::decode(<span class="kw-2">&amp;</span>val).<span class="number">0</span>;
<span class="kw">return </span>location.offset();
}
<span class="kw">return </span><span class="self">self</span>.footer.meta_index.offset();
}
<span class="doccomment">/// Iterators read from the file; thus only one iterator can be borrowed (mutably) per scope
</span><span class="kw">pub fn </span>iter(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; TableIterator {
<span class="kw">let </span>iter = TableIterator {
current_block: <span class="prelude-val">None</span>,
current_block_off: <span class="number">0</span>,
index_block: <span class="self">self</span>.indexblock.iter(),
table: <span class="self">self</span>.clone(),
};
iter
}
<span class="doccomment">/// Retrieve next-biggest entry for key from table. This function uses the attached filters, so
/// is better suited if you frequently look for non-existing values (as it will detect the
/// non-existence of an entry in a block without having to load the block).
///
/// The caller must check if the returned key, which is the raw key (not e.g. the user portion
/// of an InternalKey) is acceptable (e.g. correct value type or sequence number), as it may
/// not be an exact match for key.
///
/// This is done this way because some key types, like internal keys, will not result in an
/// exact match; it depends on other comparators than the one that the table reader knows
/// whether a match is acceptable.
</span><span class="kw">pub fn </span>get&lt;<span class="lifetime">&#39;a</span>&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, key: InternalKey&lt;<span class="lifetime">&#39;a</span>&gt;) -&gt; <span class="prelude-ty">Result</span>&lt;<span class="prelude-ty">Option</span>&lt;(Vec&lt;u8&gt;, Vec&lt;u8&gt;)&gt;&gt; {
<span class="kw">let </span><span class="kw-2">mut </span>index_iter = <span class="self">self</span>.indexblock.iter();
index_iter.seek(key);
<span class="kw">let </span>handle;
<span class="kw">if let </span><span class="prelude-val">Some</span>((last_in_block, h)) = current_key_val(<span class="kw-2">&amp;</span>index_iter) {
<span class="kw">if </span><span class="self">self</span>.opt.cmp.cmp(key, <span class="kw-2">&amp;</span>last_in_block) == Ordering::Less {
handle = BlockHandle::decode(<span class="kw-2">&amp;</span>h).<span class="number">0</span>;
} <span class="kw">else </span>{
<span class="kw">return </span><span class="prelude-val">Ok</span>(<span class="prelude-val">None</span>);
}
} <span class="kw">else </span>{
<span class="kw">return </span><span class="prelude-val">Ok</span>(<span class="prelude-val">None</span>);
}
<span class="comment">// found correct block.
// Check bloom (or whatever) filter
</span><span class="kw">if let </span><span class="prelude-val">Some</span>(<span class="kw-2">ref </span>filters) = <span class="self">self</span>.filters {
<span class="kw">if </span>!filters.key_may_match(handle.offset(), key) {
<span class="kw">return </span><span class="prelude-val">Ok</span>(<span class="prelude-val">None</span>);
}
}
<span class="comment">// Read block (potentially from cache)
</span><span class="kw">let </span>tb = <span class="self">self</span>.read_block(<span class="kw-2">&amp;</span>handle)<span class="question-mark">?</span>;
<span class="kw">let </span><span class="kw-2">mut </span>iter = tb.iter();
<span class="comment">// Go to entry and check if it&#39;s the wanted entry.
</span>iter.seek(key);
<span class="kw">if let </span><span class="prelude-val">Some</span>((k, v)) = current_key_val(<span class="kw-2">&amp;</span>iter) {
<span class="kw">if </span><span class="self">self</span>.opt.cmp.cmp(<span class="kw-2">&amp;</span>k, key) &gt;= Ordering::Equal {
<span class="kw">return </span><span class="prelude-val">Ok</span>(<span class="prelude-val">Some</span>((k, v)));
}
}
<span class="prelude-val">Ok</span>(<span class="prelude-val">None</span>)
}
}
<span class="doccomment">/// This iterator is a &quot;TwoLevelIterator&quot;; it uses an index block in order to get an offset hint
/// into the data blocks.
</span><span class="kw">pub struct </span>TableIterator {
<span class="comment">// A TableIterator is independent of its table (on the syntax level -- it doesn&#39;t know its
// Table&#39;s lifetime). This is mainly required by the dynamic iterators used everywhere, where a
// lifetime makes things like returning an iterator from a function neigh-impossible.
//
// Instead, reference-counted pointers and locks inside the Table ensure that all
// TableIterators still share a table.
</span>table: Table,
current_block: <span class="prelude-ty">Option</span>&lt;BlockIter&gt;,
current_block_off: usize,
index_block: BlockIter,
}
<span class="kw">impl </span>TableIterator {
<span class="comment">// Skips to the entry referenced by the next entry in the index block.
// This is called once a block has run out of entries.
// Err means corruption or I/O error; Ok(true) means a new block was loaded; Ok(false) means
// tht there&#39;s no more entries.
</span><span class="kw">fn </span>skip_to_next_entry(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Result</span>&lt;bool&gt; {
<span class="kw">if let </span><span class="prelude-val">Some</span>((_key, val)) = <span class="self">self</span>.index_block.next() {
<span class="self">self</span>.load_block(<span class="kw-2">&amp;</span>val).map(|<span class="kw">_</span>| <span class="bool-val">true</span>)
} <span class="kw">else </span>{
<span class="prelude-val">Ok</span>(<span class="bool-val">false</span>)
}
}
<span class="comment">// Load the block at `handle` into `self.current_block`
</span><span class="kw">fn </span>load_block(<span class="kw-2">&amp;mut </span><span class="self">self</span>, handle: <span class="kw-2">&amp;</span>[u8]) -&gt; <span class="prelude-ty">Result</span>&lt;()&gt; {
<span class="kw">let </span>(new_block_handle, <span class="kw">_</span>) = BlockHandle::decode(handle);
<span class="kw">let </span>block = <span class="self">self</span>.table.read_block(<span class="kw-2">&amp;</span>new_block_handle)<span class="question-mark">?</span>;
<span class="self">self</span>.current_block = <span class="prelude-val">Some</span>(block.iter());
<span class="self">self</span>.current_block_off = new_block_handle.offset();
<span class="prelude-val">Ok</span>(())
}
}
<span class="kw">impl </span>LdbIterator <span class="kw">for </span>TableIterator {
<span class="kw">fn </span>advance(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; bool {
<span class="comment">// Uninitialized case.
</span><span class="kw">if </span><span class="self">self</span>.current_block.is_none() {
<span class="kw">match </span><span class="self">self</span>.skip_to_next_entry() {
<span class="prelude-val">Ok</span>(<span class="bool-val">true</span>) =&gt; <span class="kw">return </span><span class="self">self</span>.advance(),
<span class="prelude-val">Ok</span>(<span class="bool-val">false</span>) =&gt; {
<span class="self">self</span>.reset();
<span class="kw">return </span><span class="bool-val">false</span>;
}
<span class="comment">// try next block from index, this might be corruption
</span><span class="prelude-val">Err</span>(<span class="kw">_</span>) =&gt; <span class="kw">return </span><span class="self">self</span>.advance(),
}
}
<span class="comment">// Initialized case -- does the current block have more entries?
</span><span class="kw">if let </span><span class="prelude-val">Some</span>(<span class="kw-2">ref mut </span>cb) = <span class="self">self</span>.current_block {
<span class="kw">if </span>cb.advance() {
<span class="kw">return </span><span class="bool-val">true</span>;
}
}
<span class="comment">// If the current block is exhausted, try loading the next block.
</span><span class="self">self</span>.current_block = <span class="prelude-val">None</span>;
<span class="kw">match </span><span class="self">self</span>.skip_to_next_entry() {
<span class="prelude-val">Ok</span>(<span class="bool-val">true</span>) =&gt; <span class="self">self</span>.advance(),
<span class="prelude-val">Ok</span>(<span class="bool-val">false</span>) =&gt; {
<span class="self">self</span>.reset();
<span class="bool-val">false
</span>}
<span class="comment">// try next block, this might be corruption
</span><span class="prelude-val">Err</span>(<span class="kw">_</span>) =&gt; <span class="self">self</span>.advance(),
}
}
<span class="comment">// A call to valid() after seeking is necessary to ensure that the seek worked (e.g., no error
// while reading from disk)
</span><span class="kw">fn </span>seek(<span class="kw-2">&amp;mut </span><span class="self">self</span>, to: <span class="kw-2">&amp;</span>[u8]) {
<span class="comment">// first seek in index block, rewind by one entry (so we get the next smaller index entry),
// then set current_block and seek there
</span><span class="self">self</span>.index_block.seek(to);
<span class="comment">// It&#39;s possible that this is a seek past-last; reset in that case.
</span><span class="kw">if let </span><span class="prelude-val">Some</span>((past_block, handle)) = current_key_val(<span class="kw-2">&amp;</span><span class="self">self</span>.index_block) {
<span class="kw">if </span><span class="self">self</span>.table.opt.cmp.cmp(to, <span class="kw-2">&amp;</span>past_block) &lt;= Ordering::Equal {
<span class="comment">// ok, found right block: continue
</span><span class="kw">if let </span><span class="prelude-val">Ok</span>(()) = <span class="self">self</span>.load_block(<span class="kw-2">&amp;</span>handle) {
<span class="comment">// current_block is always set if load_block() returned Ok.
</span><span class="self">self</span>.current_block.as_mut().unwrap().seek(to);
<span class="kw">return</span>;
}
}
}
<span class="comment">// Reached in case of failure.
</span><span class="self">self</span>.reset();
}
<span class="kw">fn </span>prev(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; bool {
<span class="comment">// happy path: current block contains previous entry
</span><span class="kw">if let </span><span class="prelude-val">Some</span>(<span class="kw-2">ref mut </span>cb) = <span class="self">self</span>.current_block {
<span class="kw">if </span>cb.prev() {
<span class="kw">return </span><span class="bool-val">true</span>;
}
}
<span class="comment">// Go back one block and look for the last entry in the previous block
</span><span class="kw">if </span><span class="self">self</span>.index_block.prev() {
<span class="kw">if let </span><span class="prelude-val">Some</span>((<span class="kw">_</span>, handle)) = current_key_val(<span class="kw-2">&amp;</span><span class="self">self</span>.index_block) {
<span class="kw">if </span><span class="self">self</span>.load_block(<span class="kw-2">&amp;</span>handle).is_ok() {
<span class="self">self</span>.current_block.as_mut().unwrap().seek_to_last();
<span class="self">self</span>.current_block.as_ref().unwrap().valid()
} <span class="kw">else </span>{
<span class="self">self</span>.reset();
<span class="bool-val">false
</span>}
} <span class="kw">else </span>{
<span class="bool-val">false
</span>}
} <span class="kw">else </span>{
<span class="bool-val">false
</span>}
}
<span class="kw">fn </span>reset(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
<span class="self">self</span>.index_block.reset();
<span class="self">self</span>.current_block = <span class="prelude-val">None</span>;
}
<span class="comment">// This iterator is special in that it&#39;s valid even before the first call to advance(). It
// behaves correctly, though.
</span><span class="kw">fn </span>valid(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; bool {
<span class="self">self</span>.current_block.is_some() &amp;&amp; (<span class="self">self</span>.current_block.as_ref().unwrap().valid())
}
<span class="kw">fn </span>current(<span class="kw-2">&amp;</span><span class="self">self</span>, key: <span class="kw-2">&amp;mut </span>Vec&lt;u8&gt;, val: <span class="kw-2">&amp;mut </span>Vec&lt;u8&gt;) -&gt; bool {
<span class="kw">if let </span><span class="prelude-val">Some</span>(<span class="kw-2">ref </span>cb) = <span class="self">self</span>.current_block {
cb.current(key, val)
} <span class="kw">else </span>{
<span class="bool-val">false
</span>}
}
}
<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 </span><span class="kw">crate</span>::filter::BloomPolicy;
<span class="kw">use </span><span class="kw">crate</span>::key_types::LookupKey;
<span class="kw">use </span><span class="kw">crate</span>::options::{<span class="self">self</span>, CompressionType};
<span class="kw">use </span><span class="kw">crate</span>::table_builder::TableBuilder;
<span class="kw">use </span><span class="kw">crate</span>::test_util::{test_iterator_properties, LdbIteratorIter};
<span class="kw">use </span><span class="kw">crate</span>::types::{current_key_val, LdbIterator};
<span class="kw">use super</span>::<span class="kw-2">*</span>;
<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_table_approximate_offset,
test_table_block_cache_use,
test_table_iterator_fwd_bwd,
test_table_iterator_filter,
test_table_iterator_state_behavior,
test_table_iterator_behavior_standard,
test_table_iterator_values,
test_table_iterator_seek,
test_table_get,
test_table_internal_keys,
test_table_reader_checksum,
)
}
<span class="kw">fn </span>build_data() -&gt; Vec&lt;(<span class="kw-2">&amp;</span><span class="lifetime">&#39;static </span>str, <span class="kw-2">&amp;</span><span class="lifetime">&#39;static </span>str)&gt; {
<span class="macro">vec!</span>[
<span class="comment">// block 1
</span>(<span class="string">&quot;abc&quot;</span>, <span class="string">&quot;def&quot;</span>),
(<span class="string">&quot;abd&quot;</span>, <span class="string">&quot;dee&quot;</span>),
(<span class="string">&quot;bcd&quot;</span>, <span class="string">&quot;asa&quot;</span>),
<span class="comment">// block 2
</span>(<span class="string">&quot;bsr&quot;</span>, <span class="string">&quot;a00&quot;</span>),
(<span class="string">&quot;xyz&quot;</span>, <span class="string">&quot;xxx&quot;</span>),
(<span class="string">&quot;xzz&quot;</span>, <span class="string">&quot;yyy&quot;</span>),
<span class="comment">// block 3
</span>(<span class="string">&quot;zzz&quot;</span>, <span class="string">&quot;111&quot;</span>),
]
}
<span class="comment">// Build a table containing raw keys (no format). It returns (vector, length) for convenience
// reason, a call f(v, v.len()) doesn&#39;t work for borrowing reasons.
</span><span class="kw">fn </span>build_table(data: Vec&lt;(<span class="kw-2">&amp;</span><span class="lifetime">&#39;static </span>str, <span class="kw-2">&amp;</span><span class="lifetime">&#39;static </span>str)&gt;) -&gt; (Vec&lt;u8&gt;, usize) {
<span class="kw">let </span><span class="kw-2">mut </span>d = Vec::with_capacity(<span class="number">512</span>);
<span class="kw">let </span><span class="kw-2">mut </span>opt = options::for_test();
opt.block_restart_interval = <span class="number">2</span>;
opt.block_size = <span class="number">32</span>;
opt.compression_type = CompressionType::CompressionSnappy;
{
<span class="comment">// Uses the standard comparator in opt.
</span><span class="kw">let </span><span class="kw-2">mut </span>b = TableBuilder::new_raw(opt, <span class="kw-2">&amp;mut </span>d);
<span class="kw">for </span><span class="kw-2">&amp;</span>(k, v) <span class="kw">in </span>data.iter() {
b.add(k.as_bytes(), v.as_bytes()).unwrap();
}
b.finish().unwrap();
}
<span class="kw">let </span>size = d.len();
(d, size)
}
<span class="comment">// Build a table containing keys in InternalKey format.
</span><span class="kw">fn </span>build_internal_table() -&gt; (Vec&lt;u8&gt;, usize) {
<span class="kw">let </span><span class="kw-2">mut </span>d = Vec::with_capacity(<span class="number">512</span>);
<span class="kw">let </span><span class="kw-2">mut </span>opt = options::for_test();
opt.block_restart_interval = <span class="number">1</span>;
opt.block_size = <span class="number">32</span>;
opt.filter_policy = Rc::new(Box::new(BloomPolicy::new(<span class="number">4</span>)));
<span class="kw">let </span><span class="kw-2">mut </span>i = <span class="number">1 </span><span class="kw">as </span>u64;
<span class="kw">let </span>data: Vec&lt;(Vec&lt;u8&gt;, <span class="kw-2">&amp;</span><span class="lifetime">&#39;static </span>str)&gt; = build_data()
.into_iter()
.map(|(k, v)| {
i += <span class="number">1</span>;
(LookupKey::new(k.as_bytes(), i).internal_key().to_vec(), v)
})
.collect();
{
<span class="comment">// Uses InternalKeyCmp
</span><span class="kw">let </span><span class="kw-2">mut </span>b = TableBuilder::new(opt, <span class="kw-2">&amp;mut </span>d);
<span class="kw">for </span><span class="kw-2">&amp;</span>(<span class="kw-2">ref </span>k, <span class="kw-2">ref </span>v) <span class="kw">in </span>data.iter() {
b.add(k.as_slice(), v.as_bytes()).unwrap();
}
b.finish().unwrap();
}
<span class="kw">let </span>size = d.len();
(d, size)
}
<span class="kw">fn </span>wrap_buffer(src: Vec&lt;u8&gt;) -&gt; Rc&lt;Box&lt;<span class="kw">dyn </span>RandomAccess&gt;&gt; {
Rc::new(Box::new(src))
}
<span class="kw">fn </span>test_table_approximate_offset() {
<span class="kw">let </span>(src, size) = build_table(build_data());
<span class="kw">let </span><span class="kw-2">mut </span>opt = options::for_test();
opt.block_size = <span class="number">32</span>;
<span class="kw">let </span>table = Table::new_raw(opt, wrap_buffer(src), size).unwrap();
<span class="kw">let </span><span class="kw-2">mut </span>iter = table.iter();
<span class="kw">let </span>expected_offsets = <span class="macro">vec!</span>[<span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">44</span>, <span class="number">44</span>, <span class="number">44</span>, <span class="number">89</span>];
<span class="kw">let </span><span class="kw-2">mut </span>i = <span class="number">0</span>;
<span class="kw">for </span>(k, <span class="kw">_</span>) <span class="kw">in </span>LdbIteratorIter::wrap(<span class="kw-2">&amp;mut </span>iter) {
<span class="macro">assert_eq!</span>(expected_offsets[i], table.approx_offset_of(<span class="kw-2">&amp;</span>k));
i += <span class="number">1</span>;
}
<span class="comment">// Key-past-last returns offset of metaindex block.
</span><span class="macro">assert_eq!</span>(<span class="number">137</span>, table.approx_offset_of(<span class="string">&quot;{aa&quot;</span>.as_bytes()));
}
<span class="kw">fn </span>test_table_block_cache_use() {
<span class="kw">let </span>(src, size) = build_table(build_data());
<span class="kw">let </span><span class="kw-2">mut </span>opt = options::for_test();
opt.block_size = <span class="number">32</span>;
<span class="kw">let </span>table = Table::new_raw(opt.clone(), wrap_buffer(src), size).unwrap();
<span class="kw">let </span><span class="kw-2">mut </span>iter = table.iter();
<span class="comment">// index/metaindex blocks are not cached. That&#39;d be a waste of memory.
</span><span class="macro">assert_eq!</span>(opt.block_cache.borrow().count(), <span class="number">0</span>);
iter.next();
<span class="macro">assert_eq!</span>(opt.block_cache.borrow().count(), <span class="number">1</span>);
<span class="comment">// This may fail if block parameters or data change. In that case, adapt it.
</span>iter.next();
iter.next();
iter.next();
iter.next();
<span class="macro">assert_eq!</span>(opt.block_cache.borrow().count(), <span class="number">2</span>);
}
<span class="kw">fn </span>test_table_iterator_fwd_bwd() {
<span class="kw">let </span>(src, size) = build_table(build_data());
<span class="kw">let </span>data = build_data();
<span class="kw">let </span>table = Table::new_raw(options::for_test(), wrap_buffer(src), size).unwrap();
<span class="kw">let </span><span class="kw-2">mut </span>iter = table.iter();
<span class="kw">let </span><span class="kw-2">mut </span>i = <span class="number">0</span>;
<span class="kw">while let </span><span class="prelude-val">Some</span>((k, v)) = iter.next() {
<span class="macro">assert_eq!</span>(
(data[i].<span class="number">0</span>.as_bytes(), data[i].<span class="number">1</span>.as_bytes()),
(k.as_ref(), v.as_ref())
);
i += <span class="number">1</span>;
}
<span class="macro">assert_eq!</span>(i, data.len());
<span class="macro">assert!</span>(!iter.valid());
<span class="comment">// Go forward again, to last entry.
</span><span class="kw">while let </span><span class="prelude-val">Some</span>((key, <span class="kw">_</span>)) = iter.next() {
<span class="kw">if </span>key.as_slice() == <span class="string">b&quot;zzz&quot; </span>{
<span class="kw">break</span>;
}
}
<span class="macro">assert!</span>(iter.valid());
<span class="comment">// backwards count
</span><span class="kw">let </span><span class="kw-2">mut </span>j = <span class="number">0</span>;
<span class="kw">while </span>iter.prev() {
<span class="kw">if let </span><span class="prelude-val">Some</span>((k, v)) = current_key_val(<span class="kw-2">&amp;</span>iter) {
j += <span class="number">1</span>;
<span class="macro">assert_eq!</span>(
(
data[data.len() - <span class="number">1 </span>- j].<span class="number">0</span>.as_bytes(),
data[data.len() - <span class="number">1 </span>- j].<span class="number">1</span>.as_bytes()
),
(k.as_ref(), v.as_ref())
);
} <span class="kw">else </span>{
<span class="kw">break</span>;
}
}
<span class="comment">// expecting 7 - 1, because the last entry that the iterator stopped on is the last entry
// in the table; that is, it needs to go back over 6 entries.
</span><span class="macro">assert_eq!</span>(j, <span class="number">6</span>);
}
<span class="kw">fn </span>test_table_iterator_filter() {
<span class="kw">let </span>(src, size) = build_table(build_data());
<span class="kw">let </span>table = Table::new_raw(options::for_test(), wrap_buffer(src), size).unwrap();
<span class="macro">assert!</span>(table.filters.is_some());
<span class="kw">let </span>filter_reader = table.filters.clone().unwrap();
<span class="kw">let </span><span class="kw-2">mut </span>iter = table.iter();
<span class="kw">loop </span>{
<span class="kw">if let </span><span class="prelude-val">Some</span>((k, <span class="kw">_</span>)) = iter.next() {
<span class="macro">assert!</span>(filter_reader.key_may_match(iter.current_block_off, <span class="kw-2">&amp;</span>k));
<span class="macro">assert!</span>(!filter_reader.key_may_match(iter.current_block_off, <span class="string">b&quot;somerandomkey&quot;</span>));
} <span class="kw">else </span>{
<span class="kw">break</span>;
}
}
}
<span class="kw">fn </span>test_table_iterator_state_behavior() {
<span class="kw">let </span>(src, size) = build_table(build_data());
<span class="kw">let </span>table = Table::new_raw(options::for_test(), wrap_buffer(src), size).unwrap();
<span class="kw">let </span><span class="kw-2">mut </span>iter = table.iter();
<span class="comment">// behavior test
// See comment on valid()
</span><span class="macro">assert!</span>(!iter.valid());
<span class="macro">assert!</span>(current_key_val(<span class="kw-2">&amp;</span>iter).is_none());
<span class="macro">assert!</span>(!iter.prev());
<span class="macro">assert!</span>(iter.advance());
<span class="kw">let </span>first = current_key_val(<span class="kw-2">&amp;</span>iter);
<span class="macro">assert!</span>(iter.valid());
<span class="macro">assert!</span>(current_key_val(<span class="kw-2">&amp;</span>iter).is_some());
<span class="macro">assert!</span>(iter.advance());
<span class="macro">assert!</span>(iter.prev());
<span class="macro">assert!</span>(iter.valid());
iter.reset();
<span class="macro">assert!</span>(!iter.valid());
<span class="macro">assert!</span>(current_key_val(<span class="kw-2">&amp;</span>iter).is_none());
<span class="macro">assert_eq!</span>(first, iter.next());
}
<span class="kw">fn </span>test_table_iterator_behavior_standard() {
<span class="kw">let </span><span class="kw-2">mut </span>data = build_data();
data.truncate(<span class="number">4</span>);
<span class="kw">let </span>(src, size) = build_table(data);
<span class="kw">let </span>table = Table::new_raw(options::for_test(), wrap_buffer(src), size).unwrap();
test_iterator_properties(table.iter());
}
<span class="kw">fn </span>test_table_iterator_values() {
<span class="kw">let </span>(src, size) = build_table(build_data());
<span class="kw">let </span>data = build_data();
<span class="kw">let </span>table = Table::new_raw(options::for_test(), wrap_buffer(src), size).unwrap();
<span class="kw">let </span><span class="kw-2">mut </span>iter = table.iter();
<span class="kw">let </span><span class="kw-2">mut </span>i = <span class="number">0</span>;
iter.next();
iter.next();
<span class="comment">// Go back to previous entry, check, go forward two entries, repeat
// Verifies that prev/next works well.
</span><span class="kw">loop </span>{
iter.prev();
<span class="kw">if let </span><span class="prelude-val">Some</span>((k, v)) = current_key_val(<span class="kw-2">&amp;</span>iter) {
<span class="macro">assert_eq!</span>(
(data[i].<span class="number">0</span>.as_bytes(), data[i].<span class="number">1</span>.as_bytes()),
(k.as_ref(), v.as_ref())
);
} <span class="kw">else </span>{
<span class="kw">break</span>;
}
i += <span class="number">1</span>;
<span class="kw">if </span>iter.next().is_none() || iter.next().is_none() {
<span class="kw">break</span>;
}
}
<span class="comment">// Skipping the last value because the second next() above will break the loop
</span><span class="macro">assert_eq!</span>(i, <span class="number">6</span>);
}
<span class="kw">fn </span>test_table_iterator_seek() {
<span class="kw">let </span>(src, size) = build_table(build_data());
<span class="kw">let </span>table = Table::new_raw(options::for_test(), wrap_buffer(src), size).unwrap();
<span class="kw">let </span><span class="kw-2">mut </span>iter = table.iter();
iter.seek(<span class="string">b&quot;bcd&quot;</span>);
<span class="macro">assert!</span>(iter.valid());
<span class="macro">assert_eq!</span>(
current_key_val(<span class="kw-2">&amp;</span>iter),
<span class="prelude-val">Some</span>((<span class="string">b&quot;bcd&quot;</span>.to_vec(), <span class="string">b&quot;asa&quot;</span>.to_vec()))
);
iter.seek(<span class="string">b&quot;abc&quot;</span>);
<span class="macro">assert!</span>(iter.valid());
<span class="macro">assert_eq!</span>(
current_key_val(<span class="kw-2">&amp;</span>iter),
<span class="prelude-val">Some</span>((<span class="string">b&quot;abc&quot;</span>.to_vec(), <span class="string">b&quot;def&quot;</span>.to_vec()))
);
<span class="comment">// Seek-past-last invalidates.
</span>iter.seek(<span class="string">&quot;{{{&quot;</span>.as_bytes());
<span class="macro">assert!</span>(!iter.valid());
iter.seek(<span class="string">b&quot;bbb&quot;</span>);
<span class="macro">assert!</span>(iter.valid());
}
<span class="kw">fn </span>test_table_get() {
<span class="kw">let </span>(src, size) = build_table(build_data());
<span class="kw">let </span>table = Table::new_raw(options::for_test(), wrap_buffer(src), size).unwrap();
<span class="kw">let </span>table2 = table.clone();
<span class="kw">let </span><span class="kw-2">mut </span>_iter = table.iter();
<span class="comment">// Test that all of the table&#39;s entries are reachable via get()
</span><span class="kw">for </span>(k, v) <span class="kw">in </span>LdbIteratorIter::wrap(<span class="kw-2">&amp;mut </span>_iter) {
<span class="kw">let </span>r = table2.get(<span class="kw-2">&amp;</span>k);
<span class="macro">assert_eq!</span>(<span class="prelude-val">Ok</span>(<span class="prelude-val">Some</span>((k, v))), r);
}
<span class="macro">assert_eq!</span>(table.opt.block_cache.borrow().count(), <span class="number">3</span>);
<span class="comment">// test that filters work and don&#39;t return anything at all.
</span><span class="macro">assert!</span>(table.get(<span class="string">b&quot;aaa&quot;</span>).unwrap().is_none());
<span class="macro">assert!</span>(table.get(<span class="string">b&quot;aaaa&quot;</span>).unwrap().is_none());
<span class="macro">assert!</span>(table.get(<span class="string">b&quot;aa&quot;</span>).unwrap().is_none());
<span class="macro">assert!</span>(table.get(<span class="string">b&quot;abcd&quot;</span>).unwrap().is_none());
<span class="macro">assert!</span>(table.get(<span class="string">b&quot;abb&quot;</span>).unwrap().is_none());
<span class="macro">assert!</span>(table.get(<span class="string">b&quot;zzy&quot;</span>).unwrap().is_none());
<span class="macro">assert!</span>(table.get(<span class="string">b&quot;zz1&quot;</span>).unwrap().is_none());
<span class="macro">assert!</span>(table.get(<span class="string">&quot;zz{&quot;</span>.as_bytes()).unwrap().is_none());
}
<span class="comment">// This test verifies that the table and filters work with internal keys. This means:
// The table contains keys in InternalKey format and it uses a filter wrapped by
// InternalFilterPolicy.
// All the other tests use raw keys that don&#39;t have any internal structure; this is fine in
// general, but here we want to see that the other infrastructure works too.
</span><span class="kw">fn </span>test_table_internal_keys() {
<span class="kw">let </span>(src, size) = build_internal_table();
<span class="kw">let </span>table = Table::new(options::for_test(), wrap_buffer(src), size).unwrap();
<span class="kw">let </span>filter_reader = table.filters.clone().unwrap();
<span class="comment">// Check that we&#39;re actually using internal keys
</span><span class="kw">let </span><span class="kw-2">mut </span>_iter = table.iter();
<span class="kw">for </span>(<span class="kw-2">ref </span>k, <span class="kw-2">ref </span>v) <span class="kw">in </span>LdbIteratorIter::wrap(<span class="kw-2">&amp;mut </span>_iter) {
<span class="macro">assert_eq!</span>(k.len(), <span class="number">3 </span>+ <span class="number">8</span>);
<span class="macro">assert_eq!</span>((k.to_vec(), v.to_vec()), table.get(k).unwrap().unwrap());
}
<span class="macro">assert!</span>(table
.get(LookupKey::new(<span class="string">b&quot;abc&quot;</span>, <span class="number">1000</span>).internal_key())
.unwrap()
.is_some());
<span class="kw">let </span><span class="kw-2">mut </span>iter = table.iter();
<span class="kw">loop </span>{
<span class="kw">if let </span><span class="prelude-val">Some</span>((k, <span class="kw">_</span>)) = iter.next() {
<span class="kw">let </span>lk = LookupKey::new(<span class="kw-2">&amp;</span>k, <span class="number">123</span>);
<span class="kw">let </span>userkey = lk.user_key();
<span class="macro">assert!</span>(filter_reader.key_may_match(iter.current_block_off, userkey));
<span class="macro">assert!</span>(!filter_reader.key_may_match(iter.current_block_off, <span class="string">b&quot;somerandomkey&quot;</span>));
} <span class="kw">else </span>{
<span class="kw">break</span>;
}
}
}
<span class="kw">fn </span>test_table_reader_checksum() {
<span class="kw">let </span>(<span class="kw-2">mut </span>src, size) = build_table(build_data());
src[<span class="number">10</span>] += <span class="number">1</span>;
<span class="kw">let </span>table = Table::new_raw(options::for_test(), wrap_buffer(src), size).unwrap();
<span class="macro">assert!</span>(table.filters.is_some());
<span class="macro">assert_eq!</span>(table.filters.as_ref().unwrap().num(), <span class="number">1</span>);
{
<span class="kw">let </span><span class="kw-2">mut </span>_iter = table.iter();
<span class="kw">let </span>iter = LdbIteratorIter::wrap(<span class="kw-2">&amp;mut </span>_iter);
<span class="comment">// first block is skipped
</span><span class="macro">assert_eq!</span>(iter.count(), <span class="number">4</span>);
}
{
<span class="kw">let </span><span class="kw-2">mut </span>_iter = table.iter();
<span class="kw">let </span>iter = LdbIteratorIter::wrap(<span class="kw-2">&amp;mut </span>_iter);
<span class="kw">for </span>(k, <span class="kw">_</span>) <span class="kw">in </span>iter {
<span class="kw">if </span>k == build_data()[<span class="number">5</span>].<span class="number">0</span>.as_bytes() {
<span class="kw">return</span>;
}
}
<span class="macro">panic!</span>(<span class="string">&quot;Should have hit 5th record in table!&quot;</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>