api-docs/crates-enclave/src/rusty_leveldb/db_impl.rs.html - incubator-teaclave-website - Git at Google

 <!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Source of the Rust file `common/rusty_leveldb_sgx/src/db_impl.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>db_impl.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>
 <span id="755">755</span>
 <span id="756">756</span>
 <span id="757">757</span>
 <span id="758">758</span>
 <span id="759">759</span>
 <span id="760">760</span>
 <span id="761">761</span>
 <span id="762">762</span>
 <span id="763">763</span>
 <span id="764">764</span>
 <span id="765">765</span>
 <span id="766">766</span>
 <span id="767">767</span>
 <span id="768">768</span>
 <span id="769">769</span>
 <span id="770">770</span>
 <span id="771">771</span>
 <span id="772">772</span>
 <span id="773">773</span>
 <span id="774">774</span>
 <span id="775">775</span>
 <span id="776">776</span>
 <span id="777">777</span>
 <span id="778">778</span>
 <span id="779">779</span>
 <span id="780">780</span>
 <span id="781">781</span>
 <span id="782">782</span>
 <span id="783">783</span>
 <span id="784">784</span>
 <span id="785">785</span>
 <span id="786">786</span>
 <span id="787">787</span>
 <span id="788">788</span>
 <span id="789">789</span>
 <span id="790">790</span>
 <span id="791">791</span>
 <span id="792">792</span>
 <span id="793">793</span>
 <span id="794">794</span>
 <span id="795">795</span>
 <span id="796">796</span>
 <span id="797">797</span>
 <span id="798">798</span>
 <span id="799">799</span>
 <span id="800">800</span>
 <span id="801">801</span>
 <span id="802">802</span>
 <span id="803">803</span>
 <span id="804">804</span>
 <span id="805">805</span>
 <span id="806">806</span>
 <span id="807">807</span>
 <span id="808">808</span>
 <span id="809">809</span>
 <span id="810">810</span>
 <span id="811">811</span>
 <span id="812">812</span>
 <span id="813">813</span>
 <span id="814">814</span>
 <span id="815">815</span>
 <span id="816">816</span>
 <span id="817">817</span>
 <span id="818">818</span>
 <span id="819">819</span>
 <span id="820">820</span>
 <span id="821">821</span>
 <span id="822">822</span>
 <span id="823">823</span>
 <span id="824">824</span>
 <span id="825">825</span>
 <span id="826">826</span>
 <span id="827">827</span>
 <span id="828">828</span>
 <span id="829">829</span>
 <span id="830">830</span>
 <span id="831">831</span>
 <span id="832">832</span>
 <span id="833">833</span>
 <span id="834">834</span>
 <span id="835">835</span>
 <span id="836">836</span>
 <span id="837">837</span>
 <span id="838">838</span>
 <span id="839">839</span>
 <span id="840">840</span>
 <span id="841">841</span>
 <span id="842">842</span>
 <span id="843">843</span>
 <span id="844">844</span>
 <span id="845">845</span>
 <span id="846">846</span>
 <span id="847">847</span>
 <span id="848">848</span>
 <span id="849">849</span>
 <span id="850">850</span>
 <span id="851">851</span>
 <span id="852">852</span>
 <span id="853">853</span>
 <span id="854">854</span>
 <span id="855">855</span>
 <span id="856">856</span>
 <span id="857">857</span>
 <span id="858">858</span>
 <span id="859">859</span>
 <span id="860">860</span>
 <span id="861">861</span>
 <span id="862">862</span>
 <span id="863">863</span>
 <span id="864">864</span>
 <span id="865">865</span>
 <span id="866">866</span>
 <span id="867">867</span>
 <span id="868">868</span>
 <span id="869">869</span>
 <span id="870">870</span>
 <span id="871">871</span>
 <span id="872">872</span>
 <span id="873">873</span>
 <span id="874">874</span>
 <span id="875">875</span>
 <span id="876">876</span>
 <span id="877">877</span>
 <span id="878">878</span>
 <span id="879">879</span>
 <span id="880">880</span>
 <span id="881">881</span>
 <span id="882">882</span>
 <span id="883">883</span>
 <span id="884">884</span>
 <span id="885">885</span>
 <span id="886">886</span>
 <span id="887">887</span>
 <span id="888">888</span>
 <span id="889">889</span>
 <span id="890">890</span>
 <span id="891">891</span>
 <span id="892">892</span>
 <span id="893">893</span>
 <span id="894">894</span>
 <span id="895">895</span>
 <span id="896">896</span>
 <span id="897">897</span>
 <span id="898">898</span>
 <span id="899">899</span>
 <span id="900">900</span>
 <span id="901">901</span>
 <span id="902">902</span>
 <span id="903">903</span>
 <span id="904">904</span>
 <span id="905">905</span>
 <span id="906">906</span>
 <span id="907">907</span>
 <span id="908">908</span>
 <span id="909">909</span>
 <span id="910">910</span>
 <span id="911">911</span>
 <span id="912">912</span>
 <span id="913">913</span>
 <span id="914">914</span>
 <span id="915">915</span>
 <span id="916">916</span>
 <span id="917">917</span>
 <span id="918">918</span>
 <span id="919">919</span>
 <span id="920">920</span>
 <span id="921">921</span>
 <span id="922">922</span>
 <span id="923">923</span>
 <span id="924">924</span>
 <span id="925">925</span>
 <span id="926">926</span>
 <span id="927">927</span>
 <span id="928">928</span>
 <span id="929">929</span>
 <span id="930">930</span>
 <span id="931">931</span>
 <span id="932">932</span>
 <span id="933">933</span>
 <span id="934">934</span>
 <span id="935">935</span>
 <span id="936">936</span>
 <span id="937">937</span>
 <span id="938">938</span>
 <span id="939">939</span>
 <span id="940">940</span>
 <span id="941">941</span>
 <span id="942">942</span>
 <span id="943">943</span>
 <span id="944">944</span>
 <span id="945">945</span>
 <span id="946">946</span>
 <span id="947">947</span>
 <span id="948">948</span>
 <span id="949">949</span>
 <span id="950">950</span>
 <span id="951">951</span>
 <span id="952">952</span>
 <span id="953">953</span>
 <span id="954">954</span>
 <span id="955">955</span>
 <span id="956">956</span>
 <span id="957">957</span>
 <span id="958">958</span>
 <span id="959">959</span>
 <span id="960">960</span>
 <span id="961">961</span>
 <span id="962">962</span>
 <span id="963">963</span>
 <span id="964">964</span>
 <span id="965">965</span>
 <span id="966">966</span>
 <span id="967">967</span>
 <span id="968">968</span>
 <span id="969">969</span>
 <span id="970">970</span>
 <span id="971">971</span>
 <span id="972">972</span>
 <span id="973">973</span>
 <span id="974">974</span>
 <span id="975">975</span>
 <span id="976">976</span>
 <span id="977">977</span>
 <span id="978">978</span>
 <span id="979">979</span>
 <span id="980">980</span>
 <span id="981">981</span>
 <span id="982">982</span>
 <span id="983">983</span>
 <span id="984">984</span>
 <span id="985">985</span>
 <span id="986">986</span>
 <span id="987">987</span>
 <span id="988">988</span>
 <span id="989">989</span>
 <span id="990">990</span>
 <span id="991">991</span>
 <span id="992">992</span>
 <span id="993">993</span>
 <span id="994">994</span>
 <span id="995">995</span>
 <span id="996">996</span>
 <span id="997">997</span>
 <span id="998">998</span>
 <span id="999">999</span>
 <span id="1000">1000</span>
 <span id="1001">1001</span>
 <span id="1002">1002</span>
 <span id="1003">1003</span>
 <span id="1004">1004</span>
 <span id="1005">1005</span>
 <span id="1006">1006</span>
 <span id="1007">1007</span>
 <span id="1008">1008</span>
 <span id="1009">1009</span>
 <span id="1010">1010</span>
 <span id="1011">1011</span>
 <span id="1012">1012</span>
 <span id="1013">1013</span>
 <span id="1014">1014</span>
 <span id="1015">1015</span>
 <span id="1016">1016</span>
 <span id="1017">1017</span>
 <span id="1018">1018</span>
 <span id="1019">1019</span>
 <span id="1020">1020</span>
 <span id="1021">1021</span>
 <span id="1022">1022</span>
 <span id="1023">1023</span>
 <span id="1024">1024</span>
 <span id="1025">1025</span>
 <span id="1026">1026</span>
 <span id="1027">1027</span>
 <span id="1028">1028</span>
 <span id="1029">1029</span>
 <span id="1030">1030</span>
 <span id="1031">1031</span>
 <span id="1032">1032</span>
 <span id="1033">1033</span>
 <span id="1034">1034</span>
 <span id="1035">1035</span>
 <span id="1036">1036</span>
 <span id="1037">1037</span>
 <span id="1038">1038</span>
 <span id="1039">1039</span>
 <span id="1040">1040</span>
 <span id="1041">1041</span>
 <span id="1042">1042</span>
 <span id="1043">1043</span>
 <span id="1044">1044</span>
 <span id="1045">1045</span>
 <span id="1046">1046</span>
 <span id="1047">1047</span>
 <span id="1048">1048</span>
 <span id="1049">1049</span>
 <span id="1050">1050</span>
 <span id="1051">1051</span>
 <span id="1052">1052</span>
 <span id="1053">1053</span>
 <span id="1054">1054</span>
 <span id="1055">1055</span>
 <span id="1056">1056</span>
 <span id="1057">1057</span>
 <span id="1058">1058</span>
 <span id="1059">1059</span>
 <span id="1060">1060</span>
 <span id="1061">1061</span>
 <span id="1062">1062</span>
 <span id="1063">1063</span>
 <span id="1064">1064</span>
 <span id="1065">1065</span>
 <span id="1066">1066</span>
 <span id="1067">1067</span>
 <span id="1068">1068</span>
 <span id="1069">1069</span>
 <span id="1070">1070</span>
 <span id="1071">1071</span>
 <span id="1072">1072</span>
 <span id="1073">1073</span>
 <span id="1074">1074</span>
 <span id="1075">1075</span>
 <span id="1076">1076</span>
 <span id="1077">1077</span>
 <span id="1078">1078</span>
 <span id="1079">1079</span>
 <span id="1080">1080</span>
 <span id="1081">1081</span>
 <span id="1082">1082</span>
 <span id="1083">1083</span>
 <span id="1084">1084</span>
 <span id="1085">1085</span>
 <span id="1086">1086</span>
 <span id="1087">1087</span>
 <span id="1088">1088</span>
 <span id="1089">1089</span>
 <span id="1090">1090</span>
 <span id="1091">1091</span>
 <span id="1092">1092</span>
 <span id="1093">1093</span>
 <span id="1094">1094</span>
 <span id="1095">1095</span>
 <span id="1096">1096</span>
 <span id="1097">1097</span>
 <span id="1098">1098</span>
 <span id="1099">1099</span>
 <span id="1100">1100</span>
 <span id="1101">1101</span>
 <span id="1102">1102</span>
 <span id="1103">1103</span>
 <span id="1104">1104</span>
 <span id="1105">1105</span>
 <span id="1106">1106</span>
 <span id="1107">1107</span>
 <span id="1108">1108</span>
 <span id="1109">1109</span>
 <span id="1110">1110</span>
 <span id="1111">1111</span>
 <span id="1112">1112</span>
 <span id="1113">1113</span>
 <span id="1114">1114</span>
 <span id="1115">1115</span>
 <span id="1116">1116</span>
 <span id="1117">1117</span>
 <span id="1118">1118</span>
 <span id="1119">1119</span>
 <span id="1120">1120</span>
 <span id="1121">1121</span>
 <span id="1122">1122</span>
 <span id="1123">1123</span>
 <span id="1124">1124</span>
 <span id="1125">1125</span>
 <span id="1126">1126</span>
 <span id="1127">1127</span>
 <span id="1128">1128</span>
 <span id="1129">1129</span>
 <span id="1130">1130</span>
 <span id="1131">1131</span>
 <span id="1132">1132</span>
 <span id="1133">1133</span>
 <span id="1134">1134</span>
 <span id="1135">1135</span>
 <span id="1136">1136</span>
 <span id="1137">1137</span>
 <span id="1138">1138</span>
 <span id="1139">1139</span>
 <span id="1140">1140</span>
 <span id="1141">1141</span>
 <span id="1142">1142</span>
 <span id="1143">1143</span>
 <span id="1144">1144</span>
 <span id="1145">1145</span>
 <span id="1146">1146</span>
 <span id="1147">1147</span>
 <span id="1148">1148</span>
 <span id="1149">1149</span>
 <span id="1150">1150</span>
 <span id="1151">1151</span>
 <span id="1152">1152</span>
 <span id="1153">1153</span>
 <span id="1154">1154</span>
 <span id="1155">1155</span>
 <span id="1156">1156</span>
 <span id="1157">1157</span>
 <span id="1158">1158</span>
 <span id="1159">1159</span>
 <span id="1160">1160</span>
 <span id="1161">1161</span>
 <span id="1162">1162</span>
 <span id="1163">1163</span>
 <span id="1164">1164</span>
 <span id="1165">1165</span>
 <span id="1166">1166</span>
 <span id="1167">1167</span>
 <span id="1168">1168</span>
 <span id="1169">1169</span>
 <span id="1170">1170</span>
 <span id="1171">1171</span>
 <span id="1172">1172</span>
 <span id="1173">1173</span>
 <span id="1174">1174</span>
 <span id="1175">1175</span>
 <span id="1176">1176</span>
 <span id="1177">1177</span>
 <span id="1178">1178</span>
 <span id="1179">1179</span>
 <span id="1180">1180</span>
 <span id="1181">1181</span>
 <span id="1182">1182</span>
 <span id="1183">1183</span>
 <span id="1184">1184</span>
 <span id="1185">1185</span>
 <span id="1186">1186</span>
 <span id="1187">1187</span>
 <span id="1188">1188</span>
 <span id="1189">1189</span>
 <span id="1190">1190</span>
 <span id="1191">1191</span>
 <span id="1192">1192</span>
 <span id="1193">1193</span>
 <span id="1194">1194</span>
 <span id="1195">1195</span>
 <span id="1196">1196</span>
 <span id="1197">1197</span>
 <span id="1198">1198</span>
 <span id="1199">1199</span>
 <span id="1200">1200</span>
 <span id="1201">1201</span>
 <span id="1202">1202</span>
 <span id="1203">1203</span>
 <span id="1204">1204</span>
 <span id="1205">1205</span>
 <span id="1206">1206</span>
 <span id="1207">1207</span>
 <span id="1208">1208</span>
 <span id="1209">1209</span>
 <span id="1210">1210</span>
 <span id="1211">1211</span>
 <span id="1212">1212</span>
 <span id="1213">1213</span>
 <span id="1214">1214</span>
 <span id="1215">1215</span>
 <span id="1216">1216</span>
 <span id="1217">1217</span>
 <span id="1218">1218</span>
 <span id="1219">1219</span>
 <span id="1220">1220</span>
 <span id="1221">1221</span>
 <span id="1222">1222</span>
 <span id="1223">1223</span>
 <span id="1224">1224</span>
 <span id="1225">1225</span>
 <span id="1226">1226</span>
 <span id="1227">1227</span>
 <span id="1228">1228</span>
 <span id="1229">1229</span>
 <span id="1230">1230</span>
 <span id="1231">1231</span>
 <span id="1232">1232</span>
 <span id="1233">1233</span>
 <span id="1234">1234</span>
 <span id="1235">1235</span>
 <span id="1236">1236</span>
 <span id="1237">1237</span>
 <span id="1238">1238</span>
 <span id="1239">1239</span>
 <span id="1240">1240</span>
 <span id="1241">1241</span>
 <span id="1242">1242</span>
 <span id="1243">1243</span>
 <span id="1244">1244</span>
 <span id="1245">1245</span>
 <span id="1246">1246</span>
 <span id="1247">1247</span>
 <span id="1248">1248</span>
 <span id="1249">1249</span>
 <span id="1250">1250</span>
 <span id="1251">1251</span>
 <span id="1252">1252</span>
 <span id="1253">1253</span>
 <span id="1254">1254</span>
 <span id="1255">1255</span>
 <span id="1256">1256</span>
 <span id="1257">1257</span>
 <span id="1258">1258</span>
 <span id="1259">1259</span>
 <span id="1260">1260</span>
 <span id="1261">1261</span>
 <span id="1262">1262</span>
 <span id="1263">1263</span>
 <span id="1264">1264</span>
 <span id="1265">1265</span>
 <span id="1266">1266</span>
 <span id="1267">1267</span>
 <span id="1268">1268</span>
 <span id="1269">1269</span>
 <span id="1270">1270</span>
 <span id="1271">1271</span>
 <span id="1272">1272</span>
 <span id="1273">1273</span>
 <span id="1274">1274</span>
 <span id="1275">1275</span>
 <span id="1276">1276</span>
 <span id="1277">1277</span>
 <span id="1278">1278</span>
 <span id="1279">1279</span>
 <span id="1280">1280</span>
 <span id="1281">1281</span>
 <span id="1282">1282</span>
 <span id="1283">1283</span>
 <span id="1284">1284</span>
 <span id="1285">1285</span>
 <span id="1286">1286</span>
 <span id="1287">1287</span>
 <span id="1288">1288</span>
 <span id="1289">1289</span>
 <span id="1290">1290</span>
 <span id="1291">1291</span>
 <span id="1292">1292</span>
 <span id="1293">1293</span>
 <span id="1294">1294</span>
 <span id="1295">1295</span>
 <span id="1296">1296</span>
 <span id="1297">1297</span>
 <span id="1298">1298</span>
 <span id="1299">1299</span>
 <span id="1300">1300</span>
 <span id="1301">1301</span>
 <span id="1302">1302</span>
 <span id="1303">1303</span>
 <span id="1304">1304</span>
 <span id="1305">1305</span>
 <span id="1306">1306</span>
 <span id="1307">1307</span>
 <span id="1308">1308</span>
 <span id="1309">1309</span>
 <span id="1310">1310</span>
 <span id="1311">1311</span>
 <span id="1312">1312</span>
 <span id="1313">1313</span>
 <span id="1314">1314</span>
 <span id="1315">1315</span>
 <span id="1316">1316</span>
 <span id="1317">1317</span>
 <span id="1318">1318</span>
 <span id="1319">1319</span>
 <span id="1320">1320</span>
 <span id="1321">1321</span>
 <span id="1322">1322</span>
 <span id="1323">1323</span>
 <span id="1324">1324</span>
 <span id="1325">1325</span>
 <span id="1326">1326</span>
 <span id="1327">1327</span>
 <span id="1328">1328</span>
 <span id="1329">1329</span>
 <span id="1330">1330</span>
 <span id="1331">1331</span>
 <span id="1332">1332</span>
 <span id="1333">1333</span>
 <span id="1334">1334</span>
 <span id="1335">1335</span>
 <span id="1336">1336</span>
 <span id="1337">1337</span>
 <span id="1338">1338</span>
 <span id="1339">1339</span>
 <span id="1340">1340</span>
 <span id="1341">1341</span>
 <span id="1342">1342</span>
 <span id="1343">1343</span>
 <span id="1344">1344</span>
 <span id="1345">1345</span>
 <span id="1346">1346</span>
 <span id="1347">1347</span>
 <span id="1348">1348</span>
 <span id="1349">1349</span>
 <span id="1350">1350</span>
 <span id="1351">1351</span>
 <span id="1352">1352</span>
 <span id="1353">1353</span>
 <span id="1354">1354</span>
 <span id="1355">1355</span>
 <span id="1356">1356</span>
 <span id="1357">1357</span>
 <span id="1358">1358</span>
 <span id="1359">1359</span>
 <span id="1360">1360</span>
 <span id="1361">1361</span>
 <span id="1362">1362</span>
 <span id="1363">1363</span>
 <span id="1364">1364</span>
 <span id="1365">1365</span>
 <span id="1366">1366</span>
 <span id="1367">1367</span>
 <span id="1368">1368</span>
 <span id="1369">1369</span>
 <span id="1370">1370</span>
 <span id="1371">1371</span>
 <span id="1372">1372</span>
 <span id="1373">1373</span>
 <span id="1374">1374</span>
 <span id="1375">1375</span>
 <span id="1376">1376</span>
 <span id="1377">1377</span>
 <span id="1378">1378</span>
 <span id="1379">1379</span>
 <span id="1380">1380</span>
 <span id="1381">1381</span>
 <span id="1382">1382</span>
 <span id="1383">1383</span>
 <span id="1384">1384</span>
 <span id="1385">1385</span>
 <span id="1386">1386</span>
 <span id="1387">1387</span>
 <span id="1388">1388</span>
 <span id="1389">1389</span>
 <span id="1390">1390</span>
 <span id="1391">1391</span>
 <span id="1392">1392</span>
 <span id="1393">1393</span>
 <span id="1394">1394</span>
 <span id="1395">1395</span>
 <span id="1396">1396</span>
 <span id="1397">1397</span>
 <span id="1398">1398</span>
 <span id="1399">1399</span>
 <span id="1400">1400</span>
 <span id="1401">1401</span>
 <span id="1402">1402</span>
 <span id="1403">1403</span>
 <span id="1404">1404</span>
 <span id="1405">1405</span>
 <span id="1406">1406</span>
 <span id="1407">1407</span>
 <span id="1408">1408</span>
 <span id="1409">1409</span>
 <span id="1410">1410</span>
 <span id="1411">1411</span>
 <span id="1412">1412</span>
 <span id="1413">1413</span>
 <span id="1414">1414</span>
 <span id="1415">1415</span>
 <span id="1416">1416</span>
 <span id="1417">1417</span>
 <span id="1418">1418</span>
 <span id="1419">1419</span>
 <span id="1420">1420</span>
 <span id="1421">1421</span>
 <span id="1422">1422</span>
 <span id="1423">1423</span>
 <span id="1424">1424</span>
 <span id="1425">1425</span>
 <span id="1426">1426</span>
 <span id="1427">1427</span>
 <span id="1428">1428</span>
 <span id="1429">1429</span>
 <span id="1430">1430</span>
 <span id="1431">1431</span>
 <span id="1432">1432</span>
 <span id="1433">1433</span>
 <span id="1434">1434</span>
 <span id="1435">1435</span>
 <span id="1436">1436</span>
 <span id="1437">1437</span>
 <span id="1438">1438</span>
 <span id="1439">1439</span>
 <span id="1440">1440</span>
 <span id="1441">1441</span>
 <span id="1442">1442</span>
 <span id="1443">1443</span>
 <span id="1444">1444</span>
 <span id="1445">1445</span>
 <span id="1446">1446</span>
 <span id="1447">1447</span>
 <span id="1448">1448</span>
 <span id="1449">1449</span>
 <span id="1450">1450</span>
 <span id="1451">1451</span>
 <span id="1452">1452</span>
 <span id="1453">1453</span>
 <span id="1454">1454</span>
 <span id="1455">1455</span>
 <span id="1456">1456</span>
 <span id="1457">1457</span>
 <span id="1458">1458</span>
 <span id="1459">1459</span>
 <span id="1460">1460</span>
 <span id="1461">1461</span>
 <span id="1462">1462</span>
 <span id="1463">1463</span>
 <span id="1464">1464</span>
 <span id="1465">1465</span>
 <span id="1466">1466</span>
 <span id="1467">1467</span>
 <span id="1468">1468</span>
 <span id="1469">1469</span>
 <span id="1470">1470</span>
 <span id="1471">1471</span>
 <span id="1472">1472</span>
 <span id="1473">1473</span>
 <span id="1474">1474</span>
 <span id="1475">1475</span>
 <span id="1476">1476</span>
 <span id="1477">1477</span>
 <span id="1478">1478</span>
 <span id="1479">1479</span>
 <span id="1480">1480</span>
 <span id="1481">1481</span>
 <span id="1482">1482</span>
 <span id="1483">1483</span>
 <span id="1484">1484</span>
 <span id="1485">1485</span>
 <span id="1486">1486</span>
 <span id="1487">1487</span>
 <span id="1488">1488</span>
 <span id="1489">1489</span>
 <span id="1490">1490</span>
 <span id="1491">1491</span>
 <span id="1492">1492</span>
 <span id="1493">1493</span>
 <span id="1494">1494</span>
 <span id="1495">1495</span>
 <span id="1496">1496</span>
 <span id="1497">1497</span>
 <span id="1498">1498</span>
 <span id="1499">1499</span>
 <span id="1500">1500</span>
 <span id="1501">1501</span>
 <span id="1502">1502</span>
 <span id="1503">1503</span>
 <span id="1504">1504</span>
 <span id="1505">1505</span>
 <span id="1506">1506</span>
 <span id="1507">1507</span>
 <span id="1508">1508</span>
 <span id="1509">1509</span>
 <span id="1510">1510</span>
 <span id="1511">1511</span>
 <span id="1512">1512</span>
 <span id="1513">1513</span>
 <span id="1514">1514</span>
 <span id="1515">1515</span>
 <span id="1516">1516</span>
 <span id="1517">1517</span>
 <span id="1518">1518</span>
 <span id="1519">1519</span>
 <span id="1520">1520</span>
 <span id="1521">1521</span>
 <span id="1522">1522</span>
 <span id="1523">1523</span>
 <span id="1524">1524</span>
 <span id="1525">1525</span>
 <span id="1526">1526</span>
 <span id="1527">1527</span>
 <span id="1528">1528</span>
 <span id="1529">1529</span>
 <span id="1530">1530</span>
 <span id="1531">1531</span>
 <span id="1532">1532</span>
 <span id="1533">1533</span>
 <span id="1534">1534</span>
 <span id="1535">1535</span>
 <span id="1536">1536</span>
 <span id="1537">1537</span>
 <span id="1538">1538</span>
 <span id="1539">1539</span>
 <span id="1540">1540</span>
 <span id="1541">1541</span>
 <span id="1542">1542</span>
 <span id="1543">1543</span>
 <span id="1544">1544</span>
 <span id="1545">1545</span>
 <span id="1546">1546</span>
 <span id="1547">1547</span>
 <span id="1548">1548</span>
 <span id="1549">1549</span>
 <span id="1550">1550</span>
 <span id="1551">1551</span>
 <span id="1552">1552</span>
 <span id="1553">1553</span>
 <span id="1554">1554</span>
 <span id="1555">1555</span>
 <span id="1556">1556</span>
 <span id="1557">1557</span>
 <span id="1558">1558</span>
 <span id="1559">1559</span>
 <span id="1560">1560</span>
 <span id="1561">1561</span>
 <span id="1562">1562</span>
 <span id="1563">1563</span>
 <span id="1564">1564</span>
 <span id="1565">1565</span>
 <span id="1566">1566</span>
 <span id="1567">1567</span>
 <span id="1568">1568</span>
 <span id="1569">1569</span>
 <span id="1570">1570</span>
 <span id="1571">1571</span>
 <span id="1572">1572</span>
 <span id="1573">1573</span>
 <span id="1574">1574</span>
 <span id="1575">1575</span>
 <span id="1576">1576</span>
 <span id="1577">1577</span>
 <span id="1578">1578</span>
 <span id="1579">1579</span>
 <span id="1580">1580</span>
 <span id="1581">1581</span>
 <span id="1582">1582</span>
 <span id="1583">1583</span>
 <span id="1584">1584</span>
 <span id="1585">1585</span>
 <span id="1586">1586</span>
 <span id="1587">1587</span>
 <span id="1588">1588</span>
 <span id="1589">1589</span>
 <span id="1590">1590</span>
 <span id="1591">1591</span>
 <span id="1592">1592</span>
 <span id="1593">1593</span>
 <span id="1594">1594</span>
 <span id="1595">1595</span>
 <span id="1596">1596</span>
 <span id="1597">1597</span>
 <span id="1598">1598</span>
 <span id="1599">1599</span>
 <span id="1600">1600</span>
 <span id="1601">1601</span>
 <span id="1602">1602</span>
 <span id="1603">1603</span>
 <span id="1604">1604</span>
 <span id="1605">1605</span>
 <span id="1606">1606</span>
 <span id="1607">1607</span>
 <span id="1608">1608</span>
 <span id="1609">1609</span>
 <span id="1610">1610</span>
 <span id="1611">1611</span>
 <span id="1612">1612</span>
 <span id="1613">1613</span>
 <span id="1614">1614</span>
 <span id="1615">1615</span>
 <span id="1616">1616</span>
 <span id="1617">1617</span>
 <span id="1618">1618</span>
 <span id="1619">1619</span>
 <span id="1620">1620</span>
 <span id="1621">1621</span>
 <span id="1622">1622</span>
 <span id="1623">1623</span>
 <span id="1624">1624</span>
 <span id="1625">1625</span>
 <span id="1626">1626</span>
 <span id="1627">1627</span>
 <span id="1628">1628</span>
 <span id="1629">1629</span>
 <span id="1630">1630</span>
 <span id="1631">1631</span>
 <span id="1632">1632</span>
 <span id="1633">1633</span>
 <span id="1634">1634</span>
 <span id="1635">1635</span>
 <span id="1636">1636</span>
 <span id="1637">1637</span>
 <span id="1638">1638</span>
 <span id="1639">1639</span>
 <span id="1640">1640</span>
 <span id="1641">1641</span>
 <span id="1642">1642</span>
 <span id="1643">1643</span>
 <span id="1644">1644</span>
 <span id="1645">1645</span>
 <span id="1646">1646</span>
 <span id="1647">1647</span>
 <span id="1648">1648</span>
 <span id="1649">1649</span>
 <span id="1650">1650</span>
 <span id="1651">1651</span>
 <span id="1652">1652</span>
 <span id="1653">1653</span>
 <span id="1654">1654</span>
 <span id="1655">1655</span>
 <span id="1656">1656</span>
 <span id="1657">1657</span>
 <span id="1658">1658</span>
 <span id="1659">1659</span>
 <span id="1660">1660</span>
 <span id="1661">1661</span>
 <span id="1662">1662</span>
 <span id="1663">1663</span>
 <span id="1664">1664</span>
 <span id="1665">1665</span>
 <span id="1666">1666</span>
 <span id="1667">1667</span>
 <span id="1668">1668</span>
 <span id="1669">1669</span>
 <span id="1670">1670</span>
 <span id="1671">1671</span>
 <span id="1672">1672</span>
 <span id="1673">1673</span>
 <span id="1674">1674</span>
 <span id="1675">1675</span>
 <span id="1676">1676</span>
 <span id="1677">1677</span>
 <span id="1678">1678</span>
 <span id="1679">1679</span>
 <span id="1680">1680</span>
 <span id="1681">1681</span>
 <span id="1682">1682</span>
 <span id="1683">1683</span>
 <span id="1684">1684</span>
 <span id="1685">1685</span>
 <span id="1686">1686</span>
 <span id="1687">1687</span>
 <span id="1688">1688</span>
 <span id="1689">1689</span>
 <span id="1690">1690</span>
 <span id="1691">1691</span>
 <span id="1692">1692</span>
 <span id="1693">1693</span>
 <span id="1694">1694</span>
 <span id="1695">1695</span>
 <span id="1696">1696</span>
 <span id="1697">1697</span>
 <span id="1698">1698</span>
 <span id="1699">1699</span>
 <span id="1700">1700</span>
 <span id="1701">1701</span>
 <span id="1702">1702</span>
 <span id="1703">1703</span>
 <span id="1704">1704</span>
 <span id="1705">1705</span>
 <span id="1706">1706</span>
 <span id="1707">1707</span>
 <span id="1708">1708</span>
 <span id="1709">1709</span>
 <span id="1710">1710</span>
 <span id="1711">1711</span>
 <span id="1712">1712</span>
 <span id="1713">1713</span>
 <span id="1714">1714</span>
 <span id="1715">1715</span>
 <span id="1716">1716</span>
 <span id="1717">1717</span>
 <span id="1718">1718</span>
 <span id="1719">1719</span>
 <span id="1720">1720</span>
 <span id="1721">1721</span>
 <span id="1722">1722</span>
 <span id="1723">1723</span>
 <span id="1724">1724</span>
 </pre><pre class="rust"><code><span class="doccomment">//! db_impl contains the implementation of the database interface and high-level compaction and
 //! maintenance logic.
 </span><span class="attribute">#![allow(unused_attributes)]

 #[cfg(feature = <span class="string">&quot;mesalock_sgx&quot;</span>)]
 </span><span class="kw">use </span>std::untrusted::path::PathEx;

 <span class="kw">use </span><span class="kw">crate</span>::db_iter::DBIterator;

 <span class="kw">use </span><span class="kw">crate</span>::cmp::{Cmp, InternalKeyCmp};
 <span class="kw">use </span><span class="kw">crate</span>::env::{Env, FileLock};
 <span class="kw">use </span><span class="kw">crate</span>::error::{err, <span class="prelude-ty">Result</span>, Status, StatusCode};
 <span class="kw">use </span><span class="kw">crate</span>::filter::{BoxedFilterPolicy, InternalFilterPolicy};
 <span class="kw">use </span><span class="kw">crate</span>::infolog::Logger;
 <span class="kw">use </span><span class="kw">crate</span>::key_types::{parse_internal_key, InternalKey, LookupKey, ValueType};
 <span class="kw">use </span><span class="kw">crate</span>::log::{LogReader, LogWriter};
 <span class="kw">use </span><span class="kw">crate</span>::memtable::MemTable;
 <span class="kw">use </span><span class="kw">crate</span>::merging_iter::MergingIter;
 <span class="kw">use </span><span class="kw">crate</span>::options::Options;
 <span class="kw">use </span><span class="kw">crate</span>::snapshot::{Snapshot, SnapshotList};
 <span class="kw">use </span><span class="kw">crate</span>::table_builder::TableBuilder;
 <span class="kw">use </span><span class="kw">crate</span>::table_cache::{table_file_name, TableCache};
 <span class="kw">use </span><span class="kw">crate</span>::types::{
     parse_file_name, share, FileMetaData, FileNum, FileType, LdbIterator, SequenceNumber, Shared,
     MAX_SEQUENCE_NUMBER, NUM_LEVELS, SGX_RECOVERY_FILE_SUFFIX,
 };
 <span class="kw">use </span><span class="kw">crate</span>::version::Version;
 <span class="kw">use </span><span class="kw">crate</span>::version_edit::VersionEdit;
 <span class="kw">use </span><span class="kw">crate</span>::version_set::{
     manifest_file_name, read_current_file, set_current_file, Compaction, VersionSet,
 };
 <span class="kw">use </span><span class="kw">crate</span>::write_batch::WriteBatch;

 <span class="kw">use </span>std::cmp::Ordering;
 <span class="kw">use </span>std::io::{<span class="self">self</span>, BufWriter, Write};
 <span class="kw">use </span>std::mem;
 <span class="kw">use </span>std::ops::Drop;
 <span class="kw">use </span>std::path::Path;
 <span class="kw">use </span>std::path::PathBuf;
 <span class="kw">use </span>std::rc::Rc;

 <span class="doccomment">/// DB contains the actual database implemenation. As opposed to the original, this implementation
 /// is not concurrent (yet).
 </span><span class="kw">pub struct </span>DB {
     name: PathBuf,
     path: PathBuf,
     lock: <span class="prelude-ty">Option</span>&lt;FileLock&gt;,

     internal_cmp: Rc&lt;Box&lt;<span class="kw">dyn </span>Cmp&gt;&gt;,
     fpol: InternalFilterPolicy&lt;BoxedFilterPolicy&gt;,
     opt: Options,

     mem: MemTable,
     imm: <span class="prelude-ty">Option</span>&lt;MemTable&gt;,

     log: <span class="prelude-ty">Option</span>&lt;LogWriter&lt;BufWriter&lt;Box&lt;<span class="kw">dyn </span>Write&gt;&gt;&gt;&gt;,
     log_num: <span class="prelude-ty">Option</span>&lt;FileNum&gt;,
     cache: Shared&lt;TableCache&gt;,
     vset: Shared&lt;VersionSet&gt;,
     snaps: SnapshotList,

     cstats: [CompactionStats; NUM_LEVELS],
 }

 <span class="kw">impl </span>DB {
     <span class="comment">// RECOVERY AND INITIALIZATION //

     </span><span class="doccomment">/// new initializes a new DB object, but doesn&#39;t touch disk.
     </span><span class="kw">fn </span>new&lt;P: AsRef&lt;Path&gt;&gt;(name: P, <span class="kw-2">mut </span>opt: Options) -&gt; DB {
         <span class="kw">let </span>name = name.as_ref();
         <span class="kw">if </span>opt.log.is_none() {
             <span class="kw">let </span>log = open_info_log(opt.env.as_ref().as_ref(), name);
             opt.log = <span class="prelude-val">Some</span>(share(log));
         }

         <span class="comment">// FIXME:: use std::untrusted::path::PathEx
         </span><span class="kw">let </span>path = name.canonicalize().unwrap_or(name.to_owned());

         <span class="kw">let </span>cache = share(TableCache::new(<span class="kw-2">&amp;</span>name, opt.clone(), opt.max_open_files - <span class="number">10</span>));
         <span class="kw">let </span>vset = VersionSet::new(<span class="kw-2">&amp;</span>name, opt.clone(), cache.clone());

         DB {
             name: name.to_owned(),
             path,
             lock: <span class="prelude-val">None</span>,
             internal_cmp: Rc::new(Box::new(InternalKeyCmp(opt.cmp.clone()))),
             fpol: InternalFilterPolicy::new(opt.filter_policy.clone()),

             mem: MemTable::new(opt.cmp.clone()),
             imm: <span class="prelude-val">None</span>,

             opt,

             log: <span class="prelude-val">None</span>,
             log_num: <span class="prelude-val">None</span>,
             cache,
             vset: share(vset),
             snaps: SnapshotList::new(),

             cstats: Default::default(),
         }
     }

     <span class="kw">fn </span>current(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; Shared&lt;Version&gt; {
         <span class="self">self</span>.vset.borrow().current()
     }

     <span class="doccomment">/// Opens or creates a new or existing database. `name` is the name of the directory containing
     /// the database.
     ///
     /// Whether a new database is created and what happens if a database exists at the given path
     /// depends on the options set (`create_if_missing`, `error_if_exists`).
     </span><span class="kw">pub fn </span>open&lt;P: AsRef&lt;Path&gt;&gt;(name: P, opt: Options) -&gt; <span class="prelude-ty">Result</span>&lt;DB&gt; {
         <span class="kw">let </span>name = name.as_ref();
         <span class="kw">let </span><span class="kw-2">mut </span>db = DB::new(name, opt);
         <span class="kw">let </span><span class="kw-2">mut </span>ve = VersionEdit::new();
         <span class="kw">let </span>save_manifest = db.recover(<span class="kw-2">&amp;mut </span>ve)<span class="question-mark">?</span>;

         <span class="comment">// Create log file if an old one is not being reused.
         </span><span class="kw">if </span>db.log.is_none() {
             <span class="kw">let </span>lognum = db.vset.borrow_mut().new_file_number();
             <span class="kw">let </span>logfile = db
                 .opt
                 .env
                 .open_writable_file(Path::new(<span class="kw-2">&amp;</span>log_file_name(<span class="kw-2">&amp;</span>db.name, lognum)))<span class="question-mark">?</span>;
             ve.set_log_num(lognum);
             db.log = <span class="prelude-val">Some</span>(LogWriter::new(BufWriter::new(logfile)));
             db.log_num = <span class="prelude-val">Some</span>(lognum);
         }

         <span class="kw">if </span>save_manifest {
             ve.set_log_num(db.log_num.unwrap_or(<span class="number">0</span>));
             db.vset.borrow_mut().log_and_apply(ve)<span class="question-mark">?</span>;
         }

         db.delete_obsolete_files()<span class="question-mark">?</span>;
         db.maybe_do_compaction()<span class="question-mark">?</span>;
         <span class="prelude-val">Ok</span>(db)
     }

     <span class="doccomment">/// initialize_db initializes a new database.
     </span><span class="kw">fn </span>initialize_db(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Result</span>&lt;()&gt; {
         <span class="kw">let </span><span class="kw-2">mut </span>ve = VersionEdit::new();
         ve.set_comparator_name(<span class="self">self</span>.opt.cmp.id());
         ve.set_log_num(<span class="number">0</span>);
         ve.set_next_file(<span class="number">2</span>);
         ve.set_last_seq(<span class="number">0</span>);

         {
             <span class="kw">let </span>manifest = manifest_file_name(<span class="kw-2">&amp;</span><span class="self">self</span>.path, <span class="number">1</span>);
             <span class="kw">let </span>manifest_file = <span class="self">self</span>.opt.env.open_writable_file(Path::new(<span class="kw-2">&amp;</span>manifest))<span class="question-mark">?</span>;
             <span class="kw">let </span><span class="kw-2">mut </span>lw = LogWriter::new(manifest_file);
             lw.add_record(<span class="kw-2">&amp;</span>ve.encode())<span class="question-mark">?</span>;
             lw.flush()<span class="question-mark">?</span>;
         }
         set_current_file(<span class="kw-2">&amp;</span><span class="self">self</span>.opt.env, <span class="kw-2">&amp;</span><span class="self">self</span>.path, <span class="number">1</span>)
     }

     <span class="doccomment">/// recover recovers from the existing state on disk. If the wrapped result is `true`, then
     /// log_and_apply() should be called after recovery has finished.
     </span><span class="kw">fn </span>recover(<span class="kw-2">&amp;mut </span><span class="self">self</span>, ve: <span class="kw-2">&amp;mut </span>VersionEdit) -&gt; <span class="prelude-ty">Result</span>&lt;bool&gt; {
         <span class="kw">if </span><span class="self">self</span>.opt.error_if_exists &amp;&amp; <span class="self">self</span>.opt.env.exists(<span class="kw-2">&amp;</span><span class="self">self</span>.path.as_ref()).unwrap_or(<span class="bool-val">false</span>) {
             <span class="kw">return </span>err(StatusCode::AlreadyExists, <span class="string">&quot;database already exists&quot;</span>);
         }

         <span class="kw">let _ </span>= <span class="self">self</span>.opt.env.mkdir(Path::new(<span class="kw-2">&amp;</span><span class="self">self</span>.path));
         <span class="self">self</span>.acquire_lock()<span class="question-mark">?</span>;

         <span class="kw">if let </span><span class="prelude-val">Err</span>(e) = read_current_file(<span class="kw-2">&amp;</span><span class="self">self</span>.opt.env, <span class="kw-2">&amp;</span><span class="self">self</span>.path) {
             <span class="kw">if </span>e.code == StatusCode::NotFound &amp;&amp; <span class="self">self</span>.opt.create_if_missing {
                 <span class="self">self</span>.initialize_db()<span class="question-mark">?</span>;
             } <span class="kw">else </span>{
                 <span class="kw">return </span>err(
                     StatusCode::InvalidArgument,
                     <span class="string">&quot;database does not exist and create_if_missing is false&quot;</span>,
                 );
             }
         }

         <span class="comment">// If save_manifest is true, we should log_and_apply() later in order to write the new
         // manifest.
         </span><span class="kw">let </span><span class="kw-2">mut </span>save_manifest = <span class="self">self</span>.vset.borrow_mut().recover()<span class="question-mark">?</span>;

         <span class="comment">// Recover from all log files not in the descriptor.
         </span><span class="kw">let </span><span class="kw-2">mut </span>max_seq = <span class="number">0</span>;
         <span class="kw">let </span>filenames = <span class="self">self</span>.opt.env.children(<span class="kw-2">&amp;</span><span class="self">self</span>.path)<span class="question-mark">?</span>;
         <span class="kw">let </span><span class="kw-2">mut </span>expected = <span class="self">self</span>.vset.borrow().live_files();
         <span class="kw">let </span><span class="kw-2">mut </span>log_files = <span class="macro">vec!</span>[];

         <span class="kw">for </span>file <span class="kw">in </span><span class="kw-2">&amp;</span>filenames {
             <span class="kw">if </span>file
                 .to_str()
                 .ok_or_else(|| Status::new(StatusCode::InvalidArgument, <span class="string">&quot;not valid UTF-8&quot;</span>))<span class="question-mark">?
                 </span>.ends_with(SGX_RECOVERY_FILE_SUFFIX)
             {
                 <span class="kw">continue</span>;
             }

             <span class="kw">match </span>parse_file_name(<span class="kw-2">&amp;</span>file) {
                 <span class="prelude-val">Ok</span>((num, typ)) =&gt; {
                     expected.remove(<span class="kw-2">&amp;</span>num);
                     <span class="kw">if </span>typ == FileType::Log
                         &amp;&amp; (num &gt;= <span class="self">self</span>.vset.borrow().log_num
                             || num == <span class="self">self</span>.vset.borrow().prev_log_num)
                     {
                         log_files.push(num);
                     }
                 }
                 <span class="prelude-val">Err</span>(e) =&gt; <span class="kw">return </span><span class="prelude-val">Err</span>(e.annotate(<span class="macro">format!</span>(<span class="string">&quot;While parsing {:?}&quot;</span>, file))),
             }
         }
         <span class="kw">if </span>!expected.is_empty() {
             <span class="macro">log!</span>(<span class="self">self</span>.opt.log, <span class="string">&quot;Missing at least these files: {:?}&quot;</span>, expected);
             <span class="kw">return </span>err(StatusCode::Corruption, <span class="string">&quot;missing live files (see log)&quot;</span>);
         }

         log_files.sort();
         <span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..log_files.len() {
             <span class="kw">let </span>(save_manifest_, max_seq_) =
                 <span class="self">self</span>.recover_log_file(log_files[i], i == log_files.len() - <span class="number">1</span>, ve)<span class="question-mark">?</span>;
             <span class="kw">if </span>save_manifest_ {
                 save_manifest = <span class="bool-val">true</span>;
             }
             <span class="kw">if </span>max_seq_ &gt; max_seq {
                 max_seq = max_seq_;
             }
             <span class="self">self</span>.vset.borrow_mut().mark_file_number_used(log_files[i]);
         }

         <span class="kw">if </span><span class="self">self</span>.vset.borrow().last_seq &lt; max_seq {
             <span class="self">self</span>.vset.borrow_mut().last_seq = max_seq;
         }

         <span class="prelude-val">Ok</span>(save_manifest)
     }

     <span class="doccomment">/// recover_log_file reads a single log file into a memtable, writing new L0 tables if
     /// necessary. If is_last is true, it checks whether the log file can be reused, and sets up
     /// the database&#39;s logging handles appropriately if that&#39;s the case.
     </span><span class="kw">fn </span>recover_log_file(
         <span class="kw-2">&amp;mut </span><span class="self">self</span>,
         log_num: FileNum,
         is_last: bool,
         ve: <span class="kw-2">&amp;mut </span>VersionEdit,
     ) -&gt; <span class="prelude-ty">Result</span>&lt;(bool, SequenceNumber)&gt; {
         <span class="kw">let </span>filename = log_file_name(<span class="kw-2">&amp;</span><span class="self">self</span>.path, log_num);
         <span class="kw">let </span><span class="kw-2">mut </span>compactions = <span class="number">0</span>;
         <span class="kw">let </span><span class="kw-2">mut </span>max_seq = <span class="number">0</span>;
         <span class="kw">let </span><span class="kw-2">mut </span>save_manifest = <span class="bool-val">false</span>;
         <span class="kw">let </span>cmp: Rc&lt;Box&lt;<span class="kw">dyn </span>Cmp&gt;&gt; = <span class="self">self</span>.opt.cmp.clone();
         <span class="kw">let </span><span class="kw-2">mut </span>mem = MemTable::new(cmp.clone());
         {
             <span class="kw">let </span>logfile = <span class="self">self</span>.opt.env.open_sequential_file(Path::new(<span class="kw-2">&amp;</span>filename))<span class="question-mark">?</span>;
             <span class="comment">// Use the user-supplied comparator; it will be wrapped inside a MemtableKeyCmp.

             </span><span class="kw">let </span><span class="kw-2">mut </span>logreader = LogReader::new(
                 logfile, <span class="comment">// checksum=
                 </span><span class="bool-val">true</span>,
             );
             <span class="macro">log!</span>(<span class="self">self</span>.opt.log, <span class="string">&quot;Recovering log file {:?}&quot;</span>, filename);
             <span class="kw">let </span><span class="kw-2">mut </span>scratch = <span class="macro">vec!</span>[];
             <span class="kw">let </span><span class="kw-2">mut </span>batch = WriteBatch::new();

             <span class="kw">while let </span><span class="prelude-val">Ok</span>(len) = logreader.read(<span class="kw-2">&amp;mut </span>scratch) {
                 <span class="kw">if </span>len == <span class="number">0 </span>{
                     <span class="kw">break</span>;
                 }
                 <span class="kw">if </span>len &lt; <span class="number">12 </span>{
                     <span class="macro">log!</span>(
                         <span class="self">self</span>.opt.log,
                         <span class="string">&quot;corruption in log file {:06}: record shorter than 12B&quot;</span>,
                         log_num
                     );
                     <span class="kw">continue</span>;
                 }

                 batch.set_contents(<span class="kw-2">&amp;</span>scratch);
                 batch.insert_into_memtable(batch.sequence(), <span class="kw-2">&amp;mut </span>mem);

                 <span class="kw">let </span>last_seq = batch.sequence() + batch.count() <span class="kw">as </span>u64 - <span class="number">1</span>;
                 <span class="kw">if </span>last_seq &gt; max_seq {
                     max_seq = last_seq
                 }
                 <span class="kw">if </span>mem.approx_mem_usage() &gt; <span class="self">self</span>.opt.write_buffer_size {
                     compactions += <span class="number">1</span>;
                     <span class="self">self</span>.write_l0_table(<span class="kw-2">&amp;</span>mem, ve, <span class="prelude-val">None</span>)<span class="question-mark">?</span>;
                     save_manifest = <span class="bool-val">true</span>;
                     mem = MemTable::new(cmp.clone());
                 }
                 batch.clear();
             }
         }

         <span class="comment">// Check if we can reuse the last log file.
         </span><span class="kw">if </span><span class="self">self</span>.opt.reuse_logs &amp;&amp; is_last &amp;&amp; compactions == <span class="number">0 </span>{
             <span class="macro">assert!</span>(<span class="self">self</span>.log.is_none());
             <span class="macro">log!</span>(<span class="self">self</span>.opt.log, <span class="string">&quot;reusing log file {:?}&quot;</span>, filename);
             <span class="kw">let </span>oldsize = <span class="self">self</span>.opt.env.size_of(Path::new(<span class="kw-2">&amp;</span>filename))<span class="question-mark">?</span>;
             <span class="kw">let </span>oldfile = <span class="self">self</span>.opt.env.open_appendable_file(Path::new(<span class="kw-2">&amp;</span>filename))<span class="question-mark">?</span>;
             <span class="kw">let </span>lw = LogWriter::new_with_off(BufWriter::new(oldfile), oldsize);
             <span class="self">self</span>.log = <span class="prelude-val">Some</span>(lw);
             <span class="self">self</span>.log_num = <span class="prelude-val">Some</span>(log_num);
             <span class="self">self</span>.mem = mem;
         } <span class="kw">else if </span>mem.len() &gt; <span class="number">0 </span>{
             <span class="comment">// Log is not reused, so write out the accumulated memtable.
             </span>save_manifest = <span class="bool-val">true</span>;
             <span class="self">self</span>.write_l0_table(<span class="kw-2">&amp;</span>mem, ve, <span class="prelude-val">None</span>)<span class="question-mark">?</span>;
         }

         <span class="prelude-val">Ok</span>((save_manifest, max_seq))
     }

     <span class="doccomment">/// delete_obsolete_files removes files that are no longer needed from the file system.
     </span><span class="kw">fn </span>delete_obsolete_files(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Result</span>&lt;()&gt; {
         <span class="kw">let </span>files = <span class="self">self</span>.vset.borrow().live_files();
         <span class="kw">let </span>filenames = <span class="self">self</span>.opt.env.children(Path::new(<span class="kw-2">&amp;</span><span class="self">self</span>.path))<span class="question-mark">?</span>;
         <span class="kw">for </span>name <span class="kw">in </span>filenames {
             <span class="kw">if </span>name
                 .to_str()
                 .ok_or_else(|| Status::new(StatusCode::InvalidArgument, <span class="string">&quot;not valid UTF-8&quot;</span>))<span class="question-mark">?
                 </span>.ends_with(SGX_RECOVERY_FILE_SUFFIX)
             {
                 <span class="kw">continue</span>;
             }

             <span class="kw">if let </span><span class="prelude-val">Ok</span>((num, typ)) = parse_file_name(<span class="kw-2">&amp;</span>name) {
                 <span class="kw">match </span>typ {
                     FileType::Log =&gt; {
                         <span class="kw">if </span>num &gt;= <span class="self">self</span>.vset.borrow().log_num {
                             <span class="kw">continue</span>;
                         }
                     }
                     FileType::Descriptor =&gt; {
                         <span class="kw">if </span>num &gt;= <span class="self">self</span>.vset.borrow().manifest_num {
                             <span class="kw">continue</span>;
                         }
                     }
                     FileType::Table =&gt; {
                         <span class="kw">if </span>files.contains(<span class="kw-2">&amp;</span>num) {
                             <span class="kw">continue</span>;
                         }
                     }
                     <span class="comment">// NOTE: In this non-concurrent implementation, we likely never find temp
                     // files.
                     </span>FileType::Temp =&gt; {
                         <span class="kw">if </span>files.contains(<span class="kw-2">&amp;</span>num) {
                             <span class="kw">continue</span>;
                         }
                     }
                     FileType::Current | FileType::DBLock | FileType::InfoLog =&gt; <span class="kw">continue</span>,
                 }

                 <span class="comment">// If we&#39;re here, delete this file.
                 </span><span class="kw">if </span>typ == FileType::Table {
                     <span class="kw">let _ </span>= <span class="self">self</span>.cache.borrow_mut().evict(num);
                 }
                 <span class="macro">log!</span>(<span class="self">self</span>.opt.log, <span class="string">&quot;Deleting file type={:?} num={}&quot;</span>, typ, num);
                 <span class="kw">if let </span><span class="prelude-val">Err</span>(e) = <span class="self">self</span>.opt.env.delete(<span class="kw-2">&amp;</span><span class="self">self</span>.path.join(<span class="kw-2">&amp;</span>name)) {
                     <span class="macro">log!</span>(<span class="self">self</span>.opt.log, <span class="string">&quot;Deleting file num={} failed: {}&quot;</span>, num, e);
                 }
             }
         }
         <span class="prelude-val">Ok</span>(())
     }

     <span class="doccomment">/// acquire_lock acquires the lock file.
     </span><span class="kw">fn </span>acquire_lock(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Result</span>&lt;()&gt; {
         <span class="kw">let </span>lock_r = <span class="self">self</span>.opt.env.lock(Path::new(<span class="kw-2">&amp;</span>lock_file_name(<span class="kw-2">&amp;</span><span class="self">self</span>.path)));
         <span class="kw">match </span>lock_r {
             <span class="prelude-val">Ok</span>(lockfile) =&gt; {
                 <span class="self">self</span>.lock = <span class="prelude-val">Some</span>(lockfile);
                 <span class="prelude-val">Ok</span>(())
             }
             <span class="prelude-val">Err</span>(<span class="kw-2">ref </span>e) <span class="kw">if </span>e.code == StatusCode::LockError =&gt; err(
                 StatusCode::LockError,
                 <span class="string">&quot;database lock is held by another instance&quot;</span>,
             ),
             <span class="prelude-val">Err</span>(e) =&gt; <span class="prelude-val">Err</span>(e),
         }
     }

     <span class="doccomment">/// release_lock releases the lock file, if it&#39;s currently held.
     </span><span class="kw">fn </span>release_lock(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Result</span>&lt;()&gt; {
         <span class="kw">if let </span><span class="prelude-val">Some</span>(l) = <span class="self">self</span>.lock.take() {
             <span class="self">self</span>.opt.env.unlock(l)
         } <span class="kw">else </span>{
             <span class="prelude-val">Ok</span>(())
         }
     }
 }

 <span class="kw">impl </span>DB {
     <span class="comment">// WRITE //

     </span><span class="doccomment">/// Adds a single entry. It&#39;s a short, non-synchronous, form of `write()`; in order to make
     /// sure that the written entry is on disk, call `flush()` afterwards.
     </span><span class="kw">pub fn </span>put(<span class="kw-2">&amp;mut </span><span class="self">self</span>, k: <span class="kw-2">&amp;</span>[u8], v: <span class="kw-2">&amp;</span>[u8]) -&gt; <span class="prelude-ty">Result</span>&lt;()&gt; {
         <span class="kw">let </span><span class="kw-2">mut </span>wb = WriteBatch::new();
         wb.put(k, v);
         <span class="self">self</span>.write(wb, <span class="bool-val">false</span>)
     }

     <span class="doccomment">/// Deletes a single entry. Like with `put()`, you can call `flush()` to guarantee that
     /// the operation made it to disk.
     </span><span class="kw">pub fn </span>delete(<span class="kw-2">&amp;mut </span><span class="self">self</span>, k: <span class="kw-2">&amp;</span>[u8]) -&gt; <span class="prelude-ty">Result</span>&lt;()&gt; {
         <span class="kw">let </span><span class="kw-2">mut </span>wb = WriteBatch::new();
         wb.delete(k);
         <span class="self">self</span>.write(wb, <span class="bool-val">false</span>)
     }

     <span class="doccomment">/// Writes an entire WriteBatch. `sync` determines whether the write should be flushed to
     /// disk.
     </span><span class="kw">pub fn </span>write(<span class="kw-2">&amp;mut </span><span class="self">self</span>, batch: WriteBatch, sync: bool) -&gt; <span class="prelude-ty">Result</span>&lt;()&gt; {
         <span class="macro">assert!</span>(<span class="self">self</span>.log.is_some());

         <span class="self">self</span>.make_room_for_write(<span class="bool-val">false</span>)<span class="question-mark">?</span>;

         <span class="kw">let </span>entries = batch.count() <span class="kw">as </span>u64;
         <span class="kw">let </span>log = <span class="self">self</span>.log.as_mut().unwrap();
         <span class="kw">let </span>next = <span class="self">self</span>.vset.borrow().last_seq + <span class="number">1</span>;

         batch.insert_into_memtable(next, <span class="kw-2">&amp;mut </span><span class="self">self</span>.mem);
         log.add_record(<span class="kw-2">&amp;</span>batch.encode(next))<span class="question-mark">?</span>;
         <span class="kw">if </span>sync {
             log.flush()<span class="question-mark">?</span>;
         }
         <span class="self">self</span>.vset.borrow_mut().last_seq += entries;
         <span class="prelude-val">Ok</span>(())
     }

     <span class="doccomment">/// flush makes sure that all pending changes (e.g. from put()) are stored on disk.
     </span><span class="kw">pub fn </span>flush(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Result</span>&lt;()&gt; {
         <span class="macro">assert!</span>(<span class="self">self</span>.log.is_some());
         <span class="self">self</span>.log.as_mut().unwrap().flush()
     }
 }

 <span class="kw">impl </span>DB {
     <span class="comment">// READ //

     </span><span class="kw">fn </span>get_internal(<span class="kw-2">&amp;mut </span><span class="self">self</span>, seq: SequenceNumber, key: <span class="kw-2">&amp;</span>[u8]) -&gt; <span class="prelude-ty">Result</span>&lt;<span class="prelude-ty">Option</span>&lt;Vec&lt;u8&gt;&gt;&gt; {
         <span class="comment">// Using this lookup key will skip all entries with higher sequence numbers, because they
         // will compare &quot;Lesser&quot; using the InternalKeyCmp
         </span><span class="kw">let </span>lkey = LookupKey::new(key, seq);

         <span class="kw">match </span><span class="self">self</span>.mem.get(<span class="kw-2">&amp;</span>lkey) {
             (<span class="prelude-val">Some</span>(v), <span class="kw">_</span>) =&gt; <span class="kw">return </span><span class="prelude-val">Ok</span>(<span class="prelude-val">Some</span>(v)),
             <span class="comment">// deleted entry
             </span>(<span class="prelude-val">None</span>, <span class="bool-val">true</span>) =&gt; <span class="kw">return </span><span class="prelude-val">Ok</span>(<span class="prelude-val">None</span>),
             <span class="comment">// not found entry
             </span>(<span class="prelude-val">None</span>, <span class="bool-val">false</span>) =&gt; {}
         }

         <span class="kw">if let </span><span class="prelude-val">Some</span>(imm) = <span class="self">self</span>.imm.as_ref() {
             <span class="kw">match </span>imm.get(<span class="kw-2">&amp;</span>lkey) {
                 (<span class="prelude-val">Some</span>(v), <span class="kw">_</span>) =&gt; <span class="kw">return </span><span class="prelude-val">Ok</span>(<span class="prelude-val">Some</span>(v)),
                 <span class="comment">// deleted entry
                 </span>(<span class="prelude-val">None</span>, <span class="bool-val">true</span>) =&gt; <span class="kw">return </span><span class="prelude-val">Ok</span>(<span class="prelude-val">None</span>),
                 <span class="comment">// not found entry
                 </span>(<span class="prelude-val">None</span>, <span class="bool-val">false</span>) =&gt; {}
             }
         }

         <span class="kw">let </span><span class="kw-2">mut </span>do_compaction = <span class="bool-val">false</span>;
         <span class="kw">let </span><span class="kw-2">mut </span>result = <span class="prelude-val">None</span>;

         <span class="comment">// Limiting the borrow scope of self.current.
         </span>{
             <span class="kw">let </span>current = <span class="self">self</span>.current();
             <span class="kw">let </span><span class="kw-2">mut </span>current = current.borrow_mut();
             <span class="kw">if let </span><span class="prelude-val">Ok</span>(<span class="prelude-val">Some</span>((v, st))) = current.get(lkey.internal_key()) {
                 <span class="kw">if </span>current.update_stats(st) {
                     do_compaction = <span class="bool-val">true</span>;
                 }
                 result = <span class="prelude-val">Some</span>(v)
             }
         }

         <span class="kw">if </span>do_compaction {
             <span class="kw">if let </span><span class="prelude-val">Err</span>(e) = <span class="self">self</span>.maybe_do_compaction() {
                 <span class="macro">log!</span>(<span class="self">self</span>.opt.log, <span class="string">&quot;error while doing compaction in get: {}&quot;</span>, e);
             }
         }
         <span class="prelude-val">Ok</span>(result)
     }

     <span class="doccomment">/// get_at reads the value for a given key at or before snapshot. It returns Ok(None) if the
     /// entry wasn&#39;t found, and Err(_) if an error occurred.
     </span><span class="kw">pub fn </span>get_at(<span class="kw-2">&amp;mut </span><span class="self">self</span>, snapshot: <span class="kw-2">&amp;</span>Snapshot, key: <span class="kw-2">&amp;</span>[u8]) -&gt; <span class="prelude-ty">Result</span>&lt;<span class="prelude-ty">Option</span>&lt;Vec&lt;u8&gt;&gt;&gt; {
         <span class="self">self</span>.get_internal(snapshot.sequence(), key)
     }

     <span class="doccomment">/// get is a simplified version of get_at(), translating errors to None.
     </span><span class="kw">pub fn </span>get(<span class="kw-2">&amp;mut </span><span class="self">self</span>, key: <span class="kw-2">&amp;</span>[u8]) -&gt; <span class="prelude-ty">Option</span>&lt;Vec&lt;u8&gt;&gt; {
         <span class="kw">let </span>seq = <span class="self">self</span>.vset.borrow().last_seq;
         <span class="kw">if let </span><span class="prelude-val">Ok</span>(v) = <span class="self">self</span>.get_internal(seq, key) {
             v
         } <span class="kw">else </span>{
             <span class="prelude-val">None
         </span>}
     }
 }

 <span class="kw">impl </span>DB {
     <span class="comment">// ITERATOR //

     </span><span class="doccomment">/// new_iter returns a DBIterator over the current state of the database. The iterator will not
     /// return elements added to the database after its creation.
     </span><span class="kw">pub fn </span>new_iter(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Result</span>&lt;DBIterator&gt; {
         <span class="kw">let </span>snapshot = <span class="self">self</span>.get_snapshot();
         <span class="self">self</span>.new_iter_at(snapshot)
     }

     <span class="doccomment">/// new_iter_at returns a DBIterator at the supplied snapshot.
     </span><span class="kw">pub fn </span>new_iter_at(<span class="kw-2">&amp;mut </span><span class="self">self</span>, ss: Snapshot) -&gt; <span class="prelude-ty">Result</span>&lt;DBIterator&gt; {
         <span class="prelude-val">Ok</span>(DBIterator::new(
             <span class="self">self</span>.opt.cmp.clone(),
             <span class="self">self</span>.vset.clone(),
             <span class="self">self</span>.merge_iterators()<span class="question-mark">?</span>,
             ss,
         ))
     }

     <span class="doccomment">/// merge_iterators produces a MergingIter merging the entries in the memtable, the immutable
     /// memtable, and table files from all levels.
     </span><span class="kw">fn </span>merge_iterators(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Result</span>&lt;MergingIter&gt; {
         <span class="kw">let </span><span class="kw-2">mut </span>iters: Vec&lt;Box&lt;<span class="kw">dyn </span>LdbIterator&gt;&gt; = <span class="macro">vec!</span>[];
         <span class="kw">if </span><span class="self">self</span>.mem.len() &gt; <span class="number">0 </span>{
             iters.push(Box::new(<span class="self">self</span>.mem.iter()));
         }
         <span class="kw">if let </span><span class="prelude-val">Some</span>(<span class="kw-2">ref </span>imm) = <span class="self">self</span>.imm {
             <span class="kw">if </span>imm.len() &gt; <span class="number">0 </span>{
                 iters.push(Box::new(imm.iter()));
             }
         }

         <span class="comment">// Add iterators for table files.
         </span><span class="kw">let </span>current = <span class="self">self</span>.current();
         <span class="kw">let </span>current = current.borrow();
         iters.extend(current.new_iters()<span class="question-mark">?</span>);

         <span class="prelude-val">Ok</span>(MergingIter::new(<span class="self">self</span>.internal_cmp.clone(), iters))
     }
 }

 <span class="kw">impl </span>DB {
     <span class="comment">// SNAPSHOTS //

     </span><span class="doccomment">/// Returns a snapshot at the current state. It can be used to retrieve entries from the
     /// database as they were at an earlier point in time.
     </span><span class="kw">pub fn </span>get_snapshot(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; Snapshot {
         <span class="self">self</span>.snaps.new_snapshot(<span class="self">self</span>.vset.borrow().last_seq)
     }
 }

 <span class="kw">impl </span>DB {
     <span class="comment">// STATISTICS //
     </span><span class="kw">fn </span>add_stats(<span class="kw-2">&amp;mut </span><span class="self">self</span>, level: usize, cs: CompactionStats) {
         <span class="macro">assert!</span>(level &lt; NUM_LEVELS);
         <span class="self">self</span>.cstats[level].add(cs);
     }

     <span class="doccomment">/// Trigger a compaction based on where this key is located in the different levels.
     </span><span class="kw">fn </span>record_read_sample&lt;<span class="lifetime">&#39;a</span>&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, k: InternalKey&lt;<span class="lifetime">&#39;a</span>&gt;) {
         <span class="kw">let </span>current = <span class="self">self</span>.current();
         <span class="kw">if </span>current.borrow_mut().record_read_sample(k) {
             <span class="kw">if let </span><span class="prelude-val">Err</span>(e) = <span class="self">self</span>.maybe_do_compaction() {
                 <span class="macro">log!</span>(<span class="self">self</span>.opt.log, <span class="string">&quot;record_read_sample: compaction failed: {}&quot;</span>, e);
             }
         }
     }
 }

 <span class="kw">impl </span>DB {
     <span class="comment">// COMPACTIONS //

     </span><span class="doccomment">/// make_room_for_write checks if the memtable has become too large, and triggers a compaction
     /// if it&#39;s the case.
     </span><span class="kw">fn </span>make_room_for_write(<span class="kw-2">&amp;mut </span><span class="self">self</span>, force: bool) -&gt; <span class="prelude-ty">Result</span>&lt;()&gt; {
         <span class="kw">if </span>!force &amp;&amp; <span class="self">self</span>.mem.approx_mem_usage() &lt; <span class="self">self</span>.opt.write_buffer_size {
             <span class="prelude-val">Ok</span>(())
         } <span class="kw">else if </span><span class="self">self</span>.mem.len() == <span class="number">0 </span>{
             <span class="prelude-val">Ok</span>(())
         } <span class="kw">else </span>{
             <span class="comment">// Create new memtable.
             </span><span class="kw">let </span>logn = <span class="self">self</span>.vset.borrow_mut().new_file_number();
             <span class="kw">let </span>logf = <span class="self">self
                 </span>.opt
                 .env
                 .open_writable_file(Path::new(<span class="kw-2">&amp;</span>log_file_name(<span class="kw-2">&amp;</span><span class="self">self</span>.path, logn)));
             <span class="kw">if </span>logf.is_err() {
                 <span class="self">self</span>.vset.borrow_mut().reuse_file_number(logn);
                 <span class="prelude-val">Err</span>(logf.err().unwrap())
             } <span class="kw">else </span>{
                 <span class="self">self</span>.log = <span class="prelude-val">Some</span>(LogWriter::new(BufWriter::new(logf.unwrap())));
                 <span class="self">self</span>.log_num = <span class="prelude-val">Some</span>(logn);

                 <span class="kw">let </span><span class="kw-2">mut </span>imm = MemTable::new(<span class="self">self</span>.opt.cmp.clone());
                 mem::swap(<span class="kw-2">&amp;mut </span>imm, <span class="kw-2">&amp;mut </span><span class="self">self</span>.mem);
                 <span class="self">self</span>.imm = <span class="prelude-val">Some</span>(imm);
                 <span class="self">self</span>.maybe_do_compaction()
             }
         }
     }

     <span class="doccomment">/// maybe_do_compaction starts a blocking compaction if it makes sense.
     </span><span class="kw">fn </span>maybe_do_compaction(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Result</span>&lt;()&gt; {
         <span class="kw">if </span><span class="self">self</span>.imm.is_some() {
             <span class="self">self</span>.compact_memtable()
         } <span class="kw">else if </span><span class="self">self</span>.vset.borrow().needs_compaction() {
             <span class="kw">let </span>c = <span class="self">self</span>.vset.borrow_mut().pick_compaction();
             <span class="kw">if let </span><span class="prelude-val">Some</span>(c) = c {
                 <span class="self">self</span>.start_compaction(c)
             } <span class="kw">else </span>{
                 <span class="prelude-val">Ok</span>(())
             }
         } <span class="kw">else </span>{
             <span class="prelude-val">Ok</span>(())
         }
     }

     <span class="doccomment">/// compact_range triggers an immediate compaction on the specified key range. Repeatedly
     /// calling this without actually adding new keys is not useful.
     ///
     /// Compactions in general will cause the database to find entries more quickly, and take up
     /// less space on disk.
     </span><span class="kw">pub fn </span>compact_range(<span class="kw-2">&amp;mut </span><span class="self">self</span>, from: <span class="kw-2">&amp;</span>[u8], to: <span class="kw-2">&amp;</span>[u8]) -&gt; <span class="prelude-ty">Result</span>&lt;()&gt; {
         <span class="kw">let </span><span class="kw-2">mut </span>max_level = <span class="number">1</span>;
         {
             <span class="kw">let </span>v = <span class="self">self</span>.vset.borrow().current();
             <span class="kw">let </span>v = v.borrow();
             <span class="kw">for </span>l <span class="kw">in </span><span class="number">1</span>..NUM_LEVELS - <span class="number">1 </span>{
                 <span class="kw">if </span>v.overlap_in_level(l, from, to) {
                     max_level = l;
                 }
             }
         }

         <span class="comment">// Compact memtable.
         </span><span class="self">self</span>.make_room_for_write(<span class="bool-val">true</span>)<span class="question-mark">?</span>;

         <span class="kw">let </span><span class="kw-2">mut </span>ifrom = LookupKey::new(from, MAX_SEQUENCE_NUMBER)
             .internal_key()
             .to_vec();
         <span class="kw">let </span>iend = LookupKey::new_full(to, <span class="number">0</span>, ValueType::TypeDeletion);

         <span class="kw">for </span>l <span class="kw">in </span><span class="number">0</span>..max_level + <span class="number">1 </span>{
             <span class="kw">loop </span>{
                 <span class="kw">let </span>c_ = <span class="self">self
                     </span>.vset
                     .borrow_mut()
                     .compact_range(l, <span class="kw-2">&amp;</span>ifrom, iend.internal_key());
                 <span class="kw">if let </span><span class="prelude-val">Some</span>(c) = c_ {
                     <span class="comment">// Update ifrom to the largest key of the last file in this compaction.
                     </span><span class="kw">let </span>ix = c.num_inputs(<span class="number">0</span>) - <span class="number">1</span>;
                     ifrom = c.input(<span class="number">0</span>, ix).largest.clone();
                     <span class="self">self</span>.start_compaction(c)<span class="question-mark">?</span>;
                 } <span class="kw">else </span>{
                     <span class="kw">break</span>;
                 }
             }
         }
         <span class="prelude-val">Ok</span>(())
     }

     <span class="doccomment">/// start_compaction dispatches the different kinds of compactions depending on the current
     /// state of the database.
     </span><span class="kw">fn </span>start_compaction(<span class="kw-2">&amp;mut </span><span class="self">self</span>, <span class="kw-2">mut </span>compaction: Compaction) -&gt; <span class="prelude-ty">Result</span>&lt;()&gt; {
         <span class="kw">if </span>compaction.is_trivial_move() {
             <span class="macro">assert_eq!</span>(<span class="number">1</span>, compaction.num_inputs(<span class="number">0</span>));
             <span class="kw">let </span>f = compaction.input(<span class="number">0</span>, <span class="number">0</span>);
             <span class="kw">let </span>num = f.num;
             <span class="kw">let </span>size = f.size;
             <span class="kw">let </span>level = compaction.level();

             compaction.edit().delete_file(level, num);
             compaction.edit().add_file(level + <span class="number">1</span>, f);

             <span class="kw">let </span>r = <span class="self">self</span>.vset.borrow_mut().log_and_apply(compaction.into_edit());
             <span class="kw">if let </span><span class="prelude-val">Err</span>(e) = r {
                 <span class="macro">log!</span>(<span class="self">self</span>.opt.log, <span class="string">&quot;trivial move failed: {}&quot;</span>, e);
                 <span class="prelude-val">Err</span>(e)
             } <span class="kw">else </span>{
                 <span class="macro">log!</span>(
                     <span class="self">self</span>.opt.log,
                     <span class="string">&quot;Moved num={} bytes={} from L{} to L{}&quot;</span>,
                     num,
                     size,
                     level,
                     level + <span class="number">1
                 </span>);
                 <span class="macro">log!</span>(
                     <span class="self">self</span>.opt.log,
                     <span class="string">&quot;Summary: {}&quot;</span>,
                     <span class="self">self</span>.vset.borrow().current_summary()
                 );
                 <span class="prelude-val">Ok</span>(())
             }
         } <span class="kw">else </span>{
             <span class="kw">let </span>smallest = <span class="kw">if </span><span class="self">self</span>.snaps.empty() {
                 <span class="self">self</span>.vset.borrow().last_seq
             } <span class="kw">else </span>{
                 <span class="self">self</span>.snaps.oldest()
             };
             <span class="kw">let </span><span class="kw-2">mut </span>state = CompactionState::new(compaction, smallest);
             <span class="kw">if let </span><span class="prelude-val">Err</span>(e) = <span class="self">self</span>.do_compaction_work(<span class="kw-2">&amp;mut </span>state) {
                 state.cleanup(<span class="kw-2">&amp;</span><span class="self">self</span>.opt.env, <span class="kw-2">&amp;</span><span class="self">self</span>.path);
                 <span class="macro">log!</span>(<span class="self">self</span>.opt.log, <span class="string">&quot;Compaction work failed: {}&quot;</span>, e);
             }
             <span class="self">self</span>.install_compaction_results(state)<span class="question-mark">?</span>;
             <span class="macro">log!</span>(
                 <span class="self">self</span>.opt.log,
                 <span class="string">&quot;Compaction finished: {}&quot;</span>,
                 <span class="self">self</span>.vset.borrow().current_summary()
             );

             <span class="self">self</span>.delete_obsolete_files()
         }
     }

     <span class="kw">fn </span>compact_memtable(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Result</span>&lt;()&gt; {
         <span class="macro">assert!</span>(<span class="self">self</span>.imm.is_some());

         <span class="kw">let </span><span class="kw-2">mut </span>ve = VersionEdit::new();
         <span class="kw">let </span>base = <span class="self">self</span>.current();

         <span class="kw">let </span>imm = <span class="self">self</span>.imm.take().unwrap();
         <span class="kw">if let </span><span class="prelude-val">Err</span>(e) = <span class="self">self</span>.write_l0_table(<span class="kw-2">&amp;</span>imm, <span class="kw-2">&amp;mut </span>ve, <span class="prelude-val">Some</span>(<span class="kw-2">&amp;</span>base.borrow())) {
             <span class="self">self</span>.imm = <span class="prelude-val">Some</span>(imm);
             <span class="kw">return </span><span class="prelude-val">Err</span>(e);
         }
         ve.set_log_num(<span class="self">self</span>.log_num.unwrap_or(<span class="number">0</span>));
         <span class="self">self</span>.vset.borrow_mut().log_and_apply(ve)<span class="question-mark">?</span>;
         <span class="kw">if let </span><span class="prelude-val">Err</span>(e) = <span class="self">self</span>.delete_obsolete_files() {
             <span class="macro">log!</span>(<span class="self">self</span>.opt.log, <span class="string">&quot;Error deleting obsolete files: {}&quot;</span>, e);
         }
         <span class="prelude-val">Ok</span>(())
     }

     <span class="doccomment">/// write_l0_table writes the given memtable to a table file.
     </span><span class="kw">fn </span>write_l0_table(
         <span class="kw-2">&amp;mut </span><span class="self">self</span>,
         memt: <span class="kw-2">&amp;</span>MemTable,
         ve: <span class="kw-2">&amp;mut </span>VersionEdit,
         base: <span class="prelude-ty">Option</span>&lt;<span class="kw-2">&amp;</span>Version&gt;,
     ) -&gt; <span class="prelude-ty">Result</span>&lt;()&gt; {
         <span class="kw">let </span>start_ts = <span class="self">self</span>.opt.env.micros();
         <span class="kw">let </span>num = <span class="self">self</span>.vset.borrow_mut().new_file_number();
         <span class="macro">log!</span>(<span class="self">self</span>.opt.log, <span class="string">&quot;Start write of L0 table {:06}&quot;</span>, num);
         <span class="kw">let </span>fmd = build_table(<span class="kw-2">&amp;</span><span class="self">self</span>.path, <span class="kw-2">&amp;</span><span class="self">self</span>.opt, memt.iter(), num)<span class="question-mark">?</span>;
         <span class="macro">log!</span>(<span class="self">self</span>.opt.log, <span class="string">&quot;L0 table {:06} has {} bytes&quot;</span>, num, fmd.size);

         <span class="comment">// Wrote empty table.
         </span><span class="kw">if </span>fmd.size == <span class="number">0 </span>{
             <span class="self">self</span>.vset.borrow_mut().reuse_file_number(num);
             <span class="kw">return </span><span class="prelude-val">Ok</span>(());
         }

         <span class="kw">let </span>cache_result = <span class="self">self</span>.cache.borrow_mut().get_table(num);
         <span class="kw">if let </span><span class="prelude-val">Err</span>(e) = cache_result {
             <span class="macro">log!</span>(
                 <span class="self">self</span>.opt.log,
                 <span class="string">&quot;L0 table {:06} not returned by cache: {}&quot;</span>,
                 num,
                 e
             );
             <span class="kw">let _ </span>= <span class="self">self
                 </span>.opt
                 .env
                 .delete(Path::new(<span class="kw-2">&amp;</span>table_file_name(<span class="kw-2">&amp;</span><span class="self">self</span>.path, num)));
             <span class="kw">return </span><span class="prelude-val">Err</span>(e);
         }

         <span class="kw">let </span><span class="kw-2">mut </span>stats = CompactionStats::default();
         stats.micros = <span class="self">self</span>.opt.env.micros() - start_ts;
         stats.written = fmd.size;

         <span class="kw">let </span><span class="kw-2">mut </span>level = <span class="number">0</span>;
         <span class="kw">if let </span><span class="prelude-val">Some</span>(b) = base {
             level = b.pick_memtable_output_level(
                 parse_internal_key(<span class="kw-2">&amp;</span>fmd.smallest).<span class="number">2</span>,
                 parse_internal_key(<span class="kw-2">&amp;</span>fmd.largest).<span class="number">2</span>,
             );
         }

         <span class="self">self</span>.add_stats(level, stats);
         ve.add_file(level, fmd);

         <span class="prelude-val">Ok</span>(())
     }

     <span class="kw">fn </span>do_compaction_work(<span class="kw-2">&amp;mut </span><span class="self">self</span>, cs: <span class="kw-2">&amp;mut </span>CompactionState) -&gt; <span class="prelude-ty">Result</span>&lt;()&gt; {
         {
             <span class="kw">let </span>current = <span class="self">self</span>.vset.borrow().current();
             <span class="macro">assert!</span>(current.borrow().num_level_files(cs.compaction.level()) &gt; <span class="number">0</span>);
             <span class="macro">assert!</span>(cs.builder.is_none());
         }
         <span class="kw">let </span>start_ts = <span class="self">self</span>.opt.env.micros();
         <span class="macro">log!</span>(
             <span class="self">self</span>.opt.log,
             <span class="string">&quot;Compacting {} files at L{} and {} files at L{}&quot;</span>,
             cs.compaction.num_inputs(<span class="number">0</span>),
             cs.compaction.level(),
             cs.compaction.num_inputs(<span class="number">1</span>),
             cs.compaction.level() + <span class="number">1
         </span>);

         <span class="kw">let </span><span class="kw-2">mut </span>input = <span class="self">self</span>.vset.borrow().make_input_iterator(<span class="kw-2">&amp;</span>cs.compaction);
         input.seek_to_first();

         <span class="kw">let </span>(<span class="kw-2">mut </span>key, <span class="kw-2">mut </span>val) = (<span class="macro">vec!</span>[], <span class="macro">vec!</span>[]);
         <span class="kw">let </span><span class="kw-2">mut </span>last_seq_for_key = MAX_SEQUENCE_NUMBER;

         <span class="kw">let </span><span class="kw-2">mut </span>have_ukey = <span class="bool-val">false</span>;
         <span class="kw">let </span><span class="kw-2">mut </span>current_ukey = <span class="macro">vec!</span>[];

         <span class="kw">while </span>input.valid() {
             <span class="comment">// TODO: Do we need to do a memtable compaction here? Probably not, in the sequential
             // case.
             </span><span class="macro">assert!</span>(input.current(<span class="kw-2">&amp;mut </span>key, <span class="kw-2">&amp;mut </span>val));
             <span class="kw">if </span>cs.compaction.should_stop_before(<span class="kw-2">&amp;</span>key) &amp;&amp; cs.builder.is_none() {
                 <span class="self">self</span>.finish_compaction_output(cs, key.clone())<span class="question-mark">?</span>;
             }
             <span class="kw">let </span>(ktyp, seq, ukey) = parse_internal_key(<span class="kw-2">&amp;</span>key);
             <span class="kw">if </span>seq == <span class="number">0 </span>{
                 <span class="comment">// Parsing failed.
                 </span><span class="macro">log!</span>(<span class="self">self</span>.opt.log, <span class="string">&quot;Encountered seq=0 in key: {:?}&quot;</span>, <span class="kw-2">&amp;</span>key);
                 last_seq_for_key = MAX_SEQUENCE_NUMBER;
                 have_ukey = <span class="bool-val">false</span>;
                 current_ukey.clear();
                 input.advance();
                 <span class="kw">continue</span>;
             }

             <span class="kw">if </span>!have_ukey || <span class="self">self</span>.opt.cmp.cmp(ukey, <span class="kw-2">&amp;</span>current_ukey) != Ordering::Equal {
                 <span class="comment">// First occurrence of this key.
                 </span>current_ukey.clear();
                 current_ukey.extend_from_slice(ukey);
                 have_ukey = <span class="bool-val">true</span>;
                 last_seq_for_key = MAX_SEQUENCE_NUMBER;
             }

             <span class="comment">// We can omit the key under the following conditions:
             </span><span class="kw">if </span>last_seq_for_key &lt;= cs.smallest_seq {
                 last_seq_for_key = seq;
                 input.advance();
                 <span class="kw">continue</span>;
             }
             <span class="comment">// Entry is deletion; no older version is observable by any snapshot; and all entries
             // in compacted levels with smaller sequence numbers will
             </span><span class="kw">if </span>ktyp == ValueType::TypeDeletion
                 &amp;&amp; seq &lt;= cs.smallest_seq
                 &amp;&amp; cs.compaction.is_base_level_for(ukey)
             {
                 last_seq_for_key = seq;
                 input.advance();
                 <span class="kw">continue</span>;
             }

             last_seq_for_key = seq;

             <span class="kw">if </span>cs.builder.is_none() {
                 <span class="kw">let </span>fnum = <span class="self">self</span>.vset.borrow_mut().new_file_number();
                 <span class="kw">let </span><span class="kw-2">mut </span>fmd = FileMetaData::default();
                 fmd.num = fnum;

                 <span class="kw">let </span>fname = table_file_name(<span class="kw-2">&amp;</span><span class="self">self</span>.path, fnum);
                 <span class="kw">let </span>f = <span class="self">self</span>.opt.env.open_writable_file(Path::new(<span class="kw-2">&amp;</span>fname))<span class="question-mark">?</span>;
                 <span class="kw">let </span>f = Box::new(BufWriter::new(f));
                 cs.builder = <span class="prelude-val">Some</span>(TableBuilder::new(<span class="self">self</span>.opt.clone(), f));
                 cs.outputs.push(fmd);
             }
             <span class="kw">if </span>cs.builder.as_ref().unwrap().entries() == <span class="number">0 </span>{
                 cs.current_output().smallest = key.clone();
             }
             cs.builder.as_mut().unwrap().add(<span class="kw-2">&amp;</span>key, <span class="kw-2">&amp;</span>val)<span class="question-mark">?</span>;
             <span class="comment">// NOTE: Adjust max file size based on level.
             </span><span class="kw">if </span>cs.builder.as_ref().unwrap().size_estimate() &gt; <span class="self">self</span>.opt.max_file_size {
                 <span class="self">self</span>.finish_compaction_output(cs, key.clone())<span class="question-mark">?</span>;
             }

             input.advance();
         }

         <span class="kw">if </span>cs.builder.is_some() {
             <span class="self">self</span>.finish_compaction_output(cs, key)<span class="question-mark">?</span>;
         }

         <span class="kw">let </span><span class="kw-2">mut </span>stats = CompactionStats::default();
         stats.micros = <span class="self">self</span>.opt.env.micros() - start_ts;
         <span class="kw">for </span>parent <span class="kw">in </span><span class="number">0</span>..<span class="number">2 </span>{
             <span class="kw">for </span>inp <span class="kw">in </span><span class="number">0</span>..cs.compaction.num_inputs(parent) {
                 stats.read += cs.compaction.input(parent, inp).size;
             }
         }
         <span class="kw">for </span>output <span class="kw">in </span><span class="kw-2">&amp;</span>cs.outputs {
             stats.written += output.size;
         }
         <span class="self">self</span>.cstats[cs.compaction.level()].add(stats);
         <span class="prelude-val">Ok</span>(())
     }

     <span class="kw">fn </span>finish_compaction_output(
         <span class="kw-2">&amp;mut </span><span class="self">self</span>,
         cs: <span class="kw-2">&amp;mut </span>CompactionState,
         largest: Vec&lt;u8&gt;,
     ) -&gt; <span class="prelude-ty">Result</span>&lt;()&gt; {
         <span class="macro">assert!</span>(cs.builder.is_some());
         <span class="kw">let </span>output_num = cs.current_output().num;
         <span class="macro">assert!</span>(output_num &gt; <span class="number">0</span>);

         <span class="comment">// The original checks if the input iterator has an OK status. For this, we&#39;d need to
         // extend the LdbIterator interface though -- let&#39;s see if we can without for now.
         // (it&#39;s not good for corruptions, in any case)
         </span><span class="kw">let </span>b = cs.builder.take().unwrap();
         <span class="kw">let </span>entries = b.entries();
         <span class="kw">let </span>bytes = b.finish()<span class="question-mark">?</span>;
         cs.total_bytes += bytes;

         cs.current_output().largest = largest;
         cs.current_output().size = bytes;

         <span class="kw">if </span>entries &gt; <span class="number">0 </span>{
             <span class="comment">// Verify that table can be used. (Separating get_table() because borrowing in an if
             // let expression is dangerous).
             </span><span class="kw">let </span>r = <span class="self">self</span>.cache.borrow_mut().get_table(output_num);
             <span class="kw">if let </span><span class="prelude-val">Err</span>(e) = r {
                 <span class="macro">log!</span>(<span class="self">self</span>.opt.log, <span class="string">&quot;New table can&#39;t be read: {}&quot;</span>, e);
                 <span class="kw">return </span><span class="prelude-val">Err</span>(e);
             }
             <span class="macro">log!</span>(
                 <span class="self">self</span>.opt.log,
                 <span class="string">&quot;New table num={}: keys={} size={}&quot;</span>,
                 output_num,
                 entries,
                 bytes
             );
         }
         <span class="prelude-val">Ok</span>(())
     }

     <span class="kw">fn </span>install_compaction_results(<span class="kw-2">&amp;mut </span><span class="self">self</span>, <span class="kw-2">mut </span>cs: CompactionState) -&gt; <span class="prelude-ty">Result</span>&lt;()&gt; {
         <span class="macro">log!</span>(
             <span class="self">self</span>.opt.log,
             <span class="string">&quot;Compacted {} L{} files + {} L{} files =&gt; {}B&quot;</span>,
             cs.compaction.num_inputs(<span class="number">0</span>),
             cs.compaction.level(),
             cs.compaction.num_inputs(<span class="number">1</span>),
             cs.compaction.level() + <span class="number">1</span>,
             cs.total_bytes
         );
         cs.compaction.add_input_deletions();
         <span class="kw">let </span>level = cs.compaction.level();
         <span class="kw">for </span>output <span class="kw">in </span><span class="kw-2">&amp;</span>cs.outputs {
             cs.compaction.edit().add_file(level + <span class="number">1</span>, output.clone());
         }
         <span class="self">self</span>.vset
             .borrow_mut()
             .log_and_apply(cs.compaction.into_edit())
     }
 }

 <span class="kw">impl </span>Drop <span class="kw">for </span>DB {
     <span class="kw">fn </span>drop(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
         <span class="kw">let _ </span>= <span class="self">self</span>.release_lock();
     }
 }

 <span class="kw">struct </span>CompactionState {
     compaction: Compaction,
     smallest_seq: SequenceNumber,
     outputs: Vec&lt;FileMetaData&gt;,
     builder: <span class="prelude-ty">Option</span>&lt;TableBuilder&lt;Box&lt;<span class="kw">dyn </span>Write&gt;&gt;&gt;,
     total_bytes: usize,
 }

 <span class="kw">impl </span>CompactionState {
     <span class="kw">fn </span>new(c: Compaction, smallest: SequenceNumber) -&gt; CompactionState {
         CompactionState {
             compaction: c,
             smallest_seq: smallest,
             outputs: <span class="macro">vec!</span>[],
             builder: <span class="prelude-val">None</span>,
             total_bytes: <span class="number">0</span>,
         }
     }

     <span class="kw">fn </span>current_output(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;mut </span>FileMetaData {
         <span class="kw">let </span>len = <span class="self">self</span>.outputs.len();
         <span class="kw-2">&amp;mut </span><span class="self">self</span>.outputs[len - <span class="number">1</span>]
     }

     <span class="doccomment">/// cleanup cleans up after an aborted compaction.
     </span><span class="kw">fn </span>cleanup&lt;P: AsRef&lt;Path&gt;&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, env: <span class="kw-2">&amp;</span>Box&lt;<span class="kw">dyn </span>Env&gt;, name: P) {
         <span class="kw">for </span>o <span class="kw">in </span><span class="self">self</span>.outputs.drain(..) {
             <span class="kw">let </span>name = table_file_name(name.as_ref(), o.num);
             <span class="kw">let _ </span>= env.delete(<span class="kw-2">&amp;</span>name);
         }
     }
 }

 <span class="attribute">#[derive(Debug, Default)]
 </span><span class="kw">struct </span>CompactionStats {
     micros: u64,
     read: usize,
     written: usize,
 }

 <span class="kw">impl </span>CompactionStats {
     <span class="kw">fn </span>add(<span class="kw-2">&amp;mut </span><span class="self">self</span>, cs: CompactionStats) {
         <span class="self">self</span>.micros += cs.micros;
         <span class="self">self</span>.read += cs.read;
         <span class="self">self</span>.written += cs.written;
     }
 }

 <span class="kw">pub fn </span>build_table&lt;I: LdbIterator, P: AsRef&lt;Path&gt;&gt;(
     dbname: P,
     opt: <span class="kw-2">&amp;</span>Options,
     <span class="kw-2">mut </span>from: I,
     num: FileNum,
 ) -&gt; <span class="prelude-ty">Result</span>&lt;FileMetaData&gt; {
     from.reset();
     <span class="kw">let </span>filename = table_file_name(dbname.as_ref(), num);

     <span class="kw">let </span>(<span class="kw-2">mut </span>kbuf, <span class="kw-2">mut </span>vbuf) = (<span class="macro">vec!</span>[], <span class="macro">vec!</span>[]);
     <span class="kw">let </span><span class="kw-2">mut </span>firstkey = <span class="prelude-val">None</span>;
     <span class="comment">// lastkey is what remains in kbuf.

     // Clean up file if write fails at any point.
     //
     // TODO: Replace with catch {} when available.
     </span><span class="kw">let </span>r = (|| -&gt; <span class="prelude-ty">Result</span>&lt;()&gt; {
         <span class="kw">let </span>f = opt.env.open_writable_file(Path::new(<span class="kw-2">&amp;</span>filename))<span class="question-mark">?</span>;
         <span class="kw">let </span>f = BufWriter::new(f);
         <span class="kw">let </span><span class="kw-2">mut </span>builder = TableBuilder::new(opt.clone(), f);
         <span class="kw">while </span>from.advance() {
             <span class="macro">assert!</span>(from.current(<span class="kw-2">&amp;mut </span>kbuf, <span class="kw-2">&amp;mut </span>vbuf));
             <span class="kw">if </span>firstkey.is_none() {
                 firstkey = <span class="prelude-val">Some</span>(kbuf.clone());
             }
             builder.add(<span class="kw-2">&amp;</span>kbuf, <span class="kw-2">&amp;</span>vbuf)<span class="question-mark">?</span>;
         }
         builder.finish()<span class="question-mark">?</span>;
         <span class="prelude-val">Ok</span>(())
     })();

     <span class="kw">if let </span><span class="prelude-val">Err</span>(e) = r {
         <span class="kw">let _ </span>= opt.env.delete(Path::new(<span class="kw-2">&amp;</span>filename));
         <span class="kw">return </span><span class="prelude-val">Err</span>(e);
     }

     <span class="kw">let </span><span class="kw-2">mut </span>md = FileMetaData::default();
     <span class="kw">if </span>firstkey.is_none() {
         <span class="kw">let _ </span>= opt.env.delete(Path::new(<span class="kw-2">&amp;</span>filename));
     } <span class="kw">else </span>{
         md.num = num;
         md.size = opt.env.size_of(Path::new(<span class="kw-2">&amp;</span>filename))<span class="question-mark">?</span>;
         md.smallest = firstkey.unwrap();
         md.largest = kbuf;
     }
     <span class="prelude-val">Ok</span>(md)
 }

 <span class="kw">fn </span>log_file_name(db: <span class="kw-2">&amp;</span>Path, num: FileNum) -&gt; PathBuf {
     db.join(<span class="macro">format!</span>(<span class="string">&quot;{:06}.log&quot;</span>, num))
 }

 <span class="kw">fn </span>lock_file_name(db: <span class="kw-2">&amp;</span>Path) -&gt; PathBuf {
     db.join(<span class="string">&quot;LOCK&quot;</span>)
 }

 <span class="doccomment">/// open_info_log opens an info log file in the given database. It transparently returns a
 /// /dev/null logger in case the open fails.
 </span><span class="kw">fn </span>open_info_log&lt;E: Env + <span class="question-mark">?</span>Sized, P: AsRef&lt;Path&gt;&gt;(env: <span class="kw-2">&amp;</span>E, db: P) -&gt; Logger {
     <span class="kw">let </span>db = db.as_ref();
     <span class="kw">let </span>logfilename = db.join(<span class="string">&quot;LOG&quot;</span>);
     <span class="kw">let </span>oldlogfilename = db.join(<span class="string">&quot;LOG.old&quot;</span>);
     <span class="kw">let _ </span>= env.mkdir(Path::new(db));
     <span class="kw">if let </span><span class="prelude-val">Ok</span>(e) = env.exists(Path::new(<span class="kw-2">&amp;</span>logfilename)) {
         <span class="kw">if </span>e {
             <span class="kw">let _ </span>= env.rename(Path::new(<span class="kw-2">&amp;</span>logfilename), Path::new(<span class="kw-2">&amp;</span>oldlogfilename));
         }
     }
     <span class="kw">if let </span><span class="prelude-val">Ok</span>(w) = env.open_writable_file(Path::new(<span class="kw-2">&amp;</span>logfilename)) {
         Logger(w)
     } <span class="kw">else </span>{
         Logger(Box::new(io::sink()))
     }
 }

 <span class="attribute">#[cfg(feature = <span class="string">&quot;enclave_unit_test&quot;</span>)]
 </span><span class="kw">pub mod </span>testutil {
     <span class="kw">use super</span>::<span class="kw-2">*</span>;

     <span class="kw">use </span><span class="kw">crate</span>::version::testutil::make_version;

     <span class="doccomment">/// build_db creates a database filled with the tables created by make_version().
     </span><span class="kw">pub fn </span>build_db() -&gt; (DB, Options) {
         <span class="kw">let </span>name = <span class="string">&quot;db&quot;</span>;
         <span class="kw">let </span>(v, <span class="kw-2">mut </span>opt) = make_version();
         opt.reuse_logs = <span class="bool-val">false</span>;
         opt.reuse_manifest = <span class="bool-val">false</span>;
         <span class="kw">let </span><span class="kw-2">mut </span>ve = VersionEdit::new();
         ve.set_comparator_name(opt.cmp.id());
         ve.set_log_num(<span class="number">0</span>);
         <span class="comment">// 9 files + 1 manifest we write below.
         </span>ve.set_next_file(<span class="number">11</span>);
         <span class="comment">// 30 entries in these tables.
         </span>ve.set_last_seq(<span class="number">30</span>);

         <span class="kw">for </span>l <span class="kw">in </span><span class="number">0</span>..NUM_LEVELS {
             <span class="kw">for </span>f <span class="kw">in </span><span class="kw-2">&amp;</span>v.files[l] {
                 ve.add_file(l, f.borrow().clone());
             }
         }

         <span class="kw">let </span>manifest = manifest_file_name(name, <span class="number">10</span>);
         <span class="kw">let </span>manifest_file = opt.env.open_writable_file(Path::new(<span class="kw-2">&amp;</span>manifest)).unwrap();
         <span class="kw">let </span><span class="kw-2">mut </span>lw = LogWriter::new(manifest_file);
         lw.add_record(<span class="kw-2">&amp;</span>ve.encode()).unwrap();
         lw.flush().unwrap();
         set_current_file(<span class="kw-2">&amp;</span>opt.env, name, <span class="number">10</span>).unwrap();

         (DB::open(name, opt.clone()).unwrap(), opt)
     }

     <span class="doccomment">/// set_file_to_compact ensures that the specified table file will be compacted next.
     </span><span class="kw">pub fn </span>set_file_to_compact(db: <span class="kw-2">&amp;mut </span>DB, num: FileNum) {
         <span class="kw">let </span>v = db.current();
         <span class="kw">let </span><span class="kw-2">mut </span>v = v.borrow_mut();

         <span class="kw">let </span><span class="kw-2">mut </span>ftc = <span class="prelude-val">None</span>;
         <span class="kw">for </span>l <span class="kw">in </span><span class="number">0</span>..NUM_LEVELS {
             <span class="kw">for </span>f <span class="kw">in </span><span class="kw-2">&amp;</span>v.files[l] {
                 <span class="kw">if </span>f.borrow().num == num {
                     ftc = <span class="prelude-val">Some</span>((f.clone(), l));
                 }
             }
         }
         <span class="kw">if let </span><span class="prelude-val">Some</span>((f, l)) = ftc {
             v.file_to_compact = <span class="prelude-val">Some</span>(f);
             v.file_to_compact_lvl = l;
         } <span class="kw">else </span>{
             <span class="macro">panic!</span>(<span class="string">&quot;file number not found&quot;</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">super</span>::testutil::{build_db, set_file_to_compact};
     <span class="kw">use super</span>::<span class="kw-2">*</span>;

     <span class="kw">use </span><span class="kw">crate</span>::error::Status;
     <span class="kw">use </span><span class="kw">crate</span>::key_types::LookupKey;
     <span class="kw">use </span><span class="kw">crate</span>::mem_env::MemEnv;
     <span class="kw">use </span><span class="kw">crate</span>::options;
     <span class="kw">use </span><span class="kw">crate</span>::test_util::LdbIteratorIter;
     <span class="kw">use </span><span class="kw">crate</span>::version::testutil::make_version;
     <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_db_impl_open_info_log,
             test_db_impl_init,
             test_db_impl_compact_range,
             test_db_impl_compact_range_memtable,
             test_db_impl_locking,
             test_db_impl_build_table,
             test_db_impl_build_db_sanity,
             test_db_impl_get_from_table_with_snapshot,
             test_db_impl_delete,
             test_db_impl_compact_single_file,
             test_db_impl_compaction_trivial_move,
             test_db_impl_memtable_compaction,
             test_db_impl_compaction,
             test_db_impl_compaction_trivial,
             test_db_impl_compaction_state_cleanup,
             test_db_impl_open_close_reopen,
         )
     }

     <span class="kw">fn </span>test_db_impl_open_info_log() {
         <span class="kw">let </span>e = MemEnv::new();
         {
             <span class="kw">let </span>l = <span class="prelude-val">Some</span>(share(open_info_log(<span class="kw-2">&amp;</span>e, <span class="string">&quot;abc&quot;</span>)));
             <span class="macro">assert!</span>(e.exists(Path::new(<span class="string">&quot;abc/LOG&quot;</span>)).unwrap());
             <span class="macro">log!</span>(l, <span class="string">&quot;hello {}&quot;</span>, <span class="string">&quot;world&quot;</span>);
             <span class="macro">assert_eq!</span>(<span class="number">12</span>, e.size_of(Path::new(<span class="string">&quot;abc/LOG&quot;</span>)).unwrap());
         }
         {
             <span class="kw">let </span>l = <span class="prelude-val">Some</span>(share(open_info_log(<span class="kw-2">&amp;</span>e, <span class="string">&quot;abc&quot;</span>)));
             <span class="macro">assert!</span>(e.exists(Path::new(<span class="string">&quot;abc/LOG.old&quot;</span>)).unwrap());
             <span class="macro">assert!</span>(e.exists(Path::new(<span class="string">&quot;abc/LOG&quot;</span>)).unwrap());
             <span class="macro">assert_eq!</span>(<span class="number">12</span>, e.size_of(Path::new(<span class="string">&quot;abc/LOG.old&quot;</span>)).unwrap());
             <span class="macro">assert_eq!</span>(<span class="number">0</span>, e.size_of(Path::new(<span class="string">&quot;abc/LOG&quot;</span>)).unwrap());
             <span class="macro">log!</span>(l, <span class="string">&quot;something else&quot;</span>);
             <span class="macro">log!</span>(l, <span class="string">&quot;and another {}&quot;</span>, <span class="number">1</span>);

             <span class="kw">let </span><span class="kw-2">mut </span>s = String::new();
             <span class="kw">let </span><span class="kw-2">mut </span>r = e.open_sequential_file(Path::new(<span class="string">&quot;abc/LOG&quot;</span>)).unwrap();
             r.read_to_string(<span class="kw-2">&amp;mut </span>s).unwrap();
             <span class="macro">assert_eq!</span>(<span class="string">&quot;something else\nand another 1\n&quot;</span>, <span class="kw-2">&amp;</span>s);
         }
     }

     <span class="kw">fn </span>build_memtable() -&gt; MemTable {
         <span class="kw">let </span><span class="kw-2">mut </span>mt = MemTable::new(options::for_test().cmp);
         <span class="kw">let </span><span class="kw-2">mut </span>i = <span class="number">1</span>;
         <span class="kw">for </span>k <span class="kw">in </span>[<span class="string">&quot;abc&quot;</span>, <span class="string">&quot;def&quot;</span>, <span class="string">&quot;ghi&quot;</span>, <span class="string">&quot;jkl&quot;</span>, <span class="string">&quot;mno&quot;</span>, <span class="string">&quot;aabc&quot;</span>, <span class="string">&quot;test123&quot;</span>].iter() {
             mt.add(
                 i,
                 ValueType::TypeValue,
                 k.as_bytes(),
                 <span class="string">&quot;looooongval&quot;</span>.as_bytes(),
             );
             i += <span class="number">1</span>;
         }
         mt
     }

     <span class="kw">fn </span>test_db_impl_init() {
         <span class="comment">// A sanity check for recovery and basic persistence.
         </span><span class="kw">let </span>opt = options::for_test();
         <span class="kw">let </span>env = opt.env.clone();

         <span class="comment">// Several test cases with different options follow. The printlns can eventually be
         // removed.

         </span>{
             <span class="kw">let </span><span class="kw-2">mut </span>opt = opt.clone();
             opt.reuse_manifest = <span class="bool-val">false</span>;
             <span class="kw">let _ </span>= DB::open(<span class="string">&quot;otherdb&quot;</span>, opt.clone()).unwrap();

             <span class="macro">println!</span>(
                 <span class="string">&quot;children after: {:?}&quot;</span>,
                 env.children(Path::new(<span class="string">&quot;otherdb/&quot;</span>)).unwrap()
             );
             <span class="macro">assert!</span>(env.exists(Path::new(<span class="string">&quot;otherdb/CURRENT&quot;</span>)).unwrap());
             <span class="comment">// Database is initialized and initial manifest reused.
             </span><span class="macro">assert!</span>(!env.exists(Path::new(<span class="string">&quot;otherdb/MANIFEST-000001&quot;</span>)).unwrap());
             <span class="macro">assert!</span>(env.exists(Path::new(<span class="string">&quot;otherdb/MANIFEST-000002&quot;</span>)).unwrap());
             <span class="macro">assert!</span>(env.exists(Path::new(<span class="string">&quot;otherdb/000003.log&quot;</span>)).unwrap());
         }

         {
             <span class="kw">let </span><span class="kw-2">mut </span>opt = opt.clone();
             opt.reuse_manifest = <span class="bool-val">true</span>;
             <span class="kw">let </span><span class="kw-2">mut </span>db = DB::open(<span class="string">&quot;db&quot;</span>, opt.clone()).unwrap();

             <span class="macro">println!</span>(
                 <span class="string">&quot;children after: {:?}&quot;</span>,
                 env.children(Path::new(<span class="string">&quot;db/&quot;</span>)).unwrap()
             );
             <span class="macro">assert!</span>(env.exists(Path::new(<span class="string">&quot;db/CURRENT&quot;</span>)).unwrap());
             <span class="comment">// Database is initialized and initial manifest reused.
             </span><span class="macro">assert!</span>(env.exists(Path::new(<span class="string">&quot;db/MANIFEST-000001&quot;</span>)).unwrap());
             <span class="macro">assert!</span>(env.exists(Path::new(<span class="string">&quot;db/LOCK&quot;</span>)).unwrap());
             <span class="macro">assert!</span>(env.exists(Path::new(<span class="string">&quot;db/000003.log&quot;</span>)).unwrap());

             db.put(<span class="string">&quot;abc&quot;</span>.as_bytes(), <span class="string">&quot;def&quot;</span>.as_bytes()).unwrap();
             db.put(<span class="string">&quot;abd&quot;</span>.as_bytes(), <span class="string">&quot;def&quot;</span>.as_bytes()).unwrap();
         }

         {
             <span class="macro">println!</span>(
                 <span class="string">&quot;children before: {:?}&quot;</span>,
                 env.children(Path::new(<span class="string">&quot;db/&quot;</span>)).unwrap()
             );
             <span class="kw">let </span><span class="kw-2">mut </span>opt = opt.clone();
             opt.reuse_manifest = <span class="bool-val">false</span>;
             opt.reuse_logs = <span class="bool-val">false</span>;
             <span class="kw">let </span><span class="kw-2">mut </span>db = DB::open(<span class="string">&quot;db&quot;</span>, opt.clone()).unwrap();

             <span class="macro">println!</span>(
                 <span class="string">&quot;children after: {:?}&quot;</span>,
                 env.children(Path::new(<span class="string">&quot;db/&quot;</span>)).unwrap()
             );
             <span class="comment">// Obsolete manifest is deleted.
             </span><span class="macro">assert!</span>(!env.exists(Path::new(<span class="string">&quot;db/MANIFEST-000001&quot;</span>)).unwrap());
             <span class="comment">// New manifest is created.
             </span><span class="macro">assert!</span>(env.exists(Path::new(<span class="string">&quot;db/MANIFEST-000002&quot;</span>)).unwrap());
             <span class="comment">// Obsolete log file is deleted.
             </span><span class="macro">assert!</span>(!env.exists(Path::new(<span class="string">&quot;db/000003.log&quot;</span>)).unwrap());
             <span class="comment">// New L0 table has been added.
             </span><span class="macro">assert!</span>(env.exists(Path::new(<span class="string">&quot;db/000003.ldb&quot;</span>)).unwrap());
             <span class="macro">assert!</span>(env.exists(Path::new(<span class="string">&quot;db/000004.log&quot;</span>)).unwrap());
             <span class="comment">// Check that entry exists and is correct. Phew, long call chain!
             </span><span class="kw">let </span>current = db.current();
             <span class="macro">log!</span>(opt.log, <span class="string">&quot;files: {:?}&quot;</span>, current.borrow().files);
             <span class="macro">assert_eq!</span>(
                 <span class="string">&quot;def&quot;</span>.as_bytes(),
                 current
                     .borrow_mut()
                     .get(LookupKey::new(<span class="string">&quot;abc&quot;</span>.as_bytes(), <span class="number">1</span>).internal_key())
                     .unwrap()
                     .unwrap()
                     .<span class="number">0
                     </span>.as_slice()
             );
             db.put(<span class="string">&quot;abe&quot;</span>.as_bytes(), <span class="string">&quot;def&quot;</span>.as_bytes()).unwrap();
         }

         {
             <span class="macro">println!</span>(
                 <span class="string">&quot;children before: {:?}&quot;</span>,
                 env.children(Path::new(<span class="string">&quot;db/&quot;</span>)).unwrap()
             );
             <span class="comment">// reuse_manifest above causes the old manifest to be deleted as obsolete, but no new
             // manifest is written. CURRENT becomes stale.
             </span><span class="kw">let </span><span class="kw-2">mut </span>opt = opt.clone();
             opt.reuse_logs = <span class="bool-val">true</span>;
             <span class="kw">let </span>db = DB::open(<span class="string">&quot;db&quot;</span>, opt).unwrap();

             <span class="macro">println!</span>(
                 <span class="string">&quot;children after: {:?}&quot;</span>,
                 env.children(Path::new(<span class="string">&quot;db/&quot;</span>)).unwrap()
             );
             <span class="macro">assert!</span>(!env.exists(Path::new(<span class="string">&quot;db/MANIFEST-000001&quot;</span>)).unwrap());
             <span class="macro">assert!</span>(env.exists(Path::new(<span class="string">&quot;db/MANIFEST-000002&quot;</span>)).unwrap());
             <span class="macro">assert!</span>(!env.exists(Path::new(<span class="string">&quot;db/MANIFEST-000005&quot;</span>)).unwrap());
             <span class="macro">assert!</span>(env.exists(Path::new(<span class="string">&quot;db/000004.log&quot;</span>)).unwrap());
             <span class="comment">// 000004 should be reused, no new log file should be created.
             </span><span class="macro">assert!</span>(!env.exists(Path::new(<span class="string">&quot;db/000006.log&quot;</span>)).unwrap());
             <span class="comment">// Log is reused, so memtable should contain last written entry from above.
             </span><span class="macro">assert_eq!</span>(<span class="number">1</span>, db.mem.len());
             <span class="macro">assert_eq!</span>(
                 <span class="string">&quot;def&quot;</span>.as_bytes(),
                 db.mem
                     .get(<span class="kw-2">&amp;</span>LookupKey::new(<span class="string">&quot;abe&quot;</span>.as_bytes(), <span class="number">3</span>))
                     .<span class="number">0
                     </span>.unwrap()
                     .as_slice()
             );
         }
     }

     <span class="kw">fn </span>test_db_impl_compact_range() {
         <span class="kw">let </span>(<span class="kw-2">mut </span>db, opt) = build_db();
         <span class="kw">let </span>env = <span class="kw-2">&amp;</span>opt.env;

         <span class="macro">println!</span>(
             <span class="string">&quot;children before: {:?}&quot;</span>,
             env.children(Path::new(<span class="string">&quot;db/&quot;</span>)).unwrap()
         );
         db.compact_range(<span class="string">b&quot;aaa&quot;</span>, <span class="string">b&quot;dba&quot;</span>).unwrap();
         <span class="macro">println!</span>(
             <span class="string">&quot;children after: {:?}&quot;</span>,
             env.children(Path::new(<span class="string">&quot;db/&quot;</span>)).unwrap()
         );

         <span class="macro">assert_eq!</span>(<span class="number">250</span>, opt.env.size_of(Path::new(<span class="string">&quot;db/000007.ldb&quot;</span>)).unwrap());
         <span class="macro">assert_eq!</span>(<span class="number">200</span>, opt.env.size_of(Path::new(<span class="string">&quot;db/000008.ldb&quot;</span>)).unwrap());
         <span class="macro">assert_eq!</span>(<span class="number">200</span>, opt.env.size_of(Path::new(<span class="string">&quot;db/000009.ldb&quot;</span>)).unwrap());
         <span class="macro">assert_eq!</span>(<span class="number">435</span>, opt.env.size_of(Path::new(<span class="string">&quot;db/000015.ldb&quot;</span>)).unwrap());

         <span class="macro">assert!</span>(!opt.env.exists(Path::new(<span class="string">&quot;db/000001.ldb&quot;</span>)).unwrap());
         <span class="macro">assert!</span>(!opt.env.exists(Path::new(<span class="string">&quot;db/000002.ldb&quot;</span>)).unwrap());
         <span class="macro">assert!</span>(!opt.env.exists(Path::new(<span class="string">&quot;db/000004.ldb&quot;</span>)).unwrap());
         <span class="macro">assert!</span>(!opt.env.exists(Path::new(<span class="string">&quot;db/000005.ldb&quot;</span>)).unwrap());
         <span class="macro">assert!</span>(!opt.env.exists(Path::new(<span class="string">&quot;db/000006.ldb&quot;</span>)).unwrap());
         <span class="macro">assert!</span>(!opt.env.exists(Path::new(<span class="string">&quot;db/000013.ldb&quot;</span>)).unwrap());
         <span class="macro">assert!</span>(!opt.env.exists(Path::new(<span class="string">&quot;db/000014.ldb&quot;</span>)).unwrap());

         <span class="macro">assert_eq!</span>(<span class="string">b&quot;val1&quot;</span>.to_vec(), db.get(<span class="string">b&quot;aaa&quot;</span>).unwrap());
         <span class="macro">assert_eq!</span>(<span class="string">b&quot;val2&quot;</span>.to_vec(), db.get(<span class="string">b&quot;cab&quot;</span>).unwrap());
         <span class="macro">assert_eq!</span>(<span class="string">b&quot;val3&quot;</span>.to_vec(), db.get(<span class="string">b&quot;aba&quot;</span>).unwrap());
         <span class="macro">assert_eq!</span>(<span class="string">b&quot;val3&quot;</span>.to_vec(), db.get(<span class="string">b&quot;fab&quot;</span>).unwrap());
     }

     <span class="kw">fn </span>test_db_impl_compact_range_memtable() {
         <span class="kw">let </span>(<span class="kw-2">mut </span>db, opt) = build_db();
         <span class="kw">let </span>env = <span class="kw-2">&amp;</span>opt.env;

         db.put(<span class="string">b&quot;xxx&quot;</span>, <span class="string">b&quot;123&quot;</span>).unwrap();

         <span class="macro">println!</span>(
             <span class="string">&quot;children before: {:?}&quot;</span>,
             env.children(Path::new(<span class="string">&quot;db/&quot;</span>)).unwrap()
         );
         db.compact_range(<span class="string">b&quot;aaa&quot;</span>, <span class="string">b&quot;dba&quot;</span>).unwrap();
         <span class="macro">println!</span>(
             <span class="string">&quot;children after: {:?}&quot;</span>,
             env.children(Path::new(<span class="string">&quot;db/&quot;</span>)).unwrap()
         );

         <span class="macro">assert_eq!</span>(<span class="number">250</span>, opt.env.size_of(Path::new(<span class="string">&quot;db/000007.ldb&quot;</span>)).unwrap());
         <span class="macro">assert_eq!</span>(<span class="number">200</span>, opt.env.size_of(Path::new(<span class="string">&quot;db/000008.ldb&quot;</span>)).unwrap());
         <span class="macro">assert_eq!</span>(<span class="number">200</span>, opt.env.size_of(Path::new(<span class="string">&quot;db/000009.ldb&quot;</span>)).unwrap());
         <span class="macro">assert_eq!</span>(<span class="number">182</span>, opt.env.size_of(Path::new(<span class="string">&quot;db/000014.ldb&quot;</span>)).unwrap());
         <span class="macro">assert_eq!</span>(<span class="number">435</span>, opt.env.size_of(Path::new(<span class="string">&quot;db/000017.ldb&quot;</span>)).unwrap());

         <span class="macro">assert!</span>(!opt.env.exists(Path::new(<span class="string">&quot;db/000001.ldb&quot;</span>)).unwrap());
         <span class="macro">assert!</span>(!opt.env.exists(Path::new(<span class="string">&quot;db/000002.ldb&quot;</span>)).unwrap());
         <span class="macro">assert!</span>(!opt.env.exists(Path::new(<span class="string">&quot;db/000003.ldb&quot;</span>)).unwrap());
         <span class="macro">assert!</span>(!opt.env.exists(Path::new(<span class="string">&quot;db/000004.ldb&quot;</span>)).unwrap());
         <span class="macro">assert!</span>(!opt.env.exists(Path::new(<span class="string">&quot;db/000005.ldb&quot;</span>)).unwrap());
         <span class="macro">assert!</span>(!opt.env.exists(Path::new(<span class="string">&quot;db/000006.ldb&quot;</span>)).unwrap());
         <span class="macro">assert!</span>(!opt.env.exists(Path::new(<span class="string">&quot;db/000015.ldb&quot;</span>)).unwrap());
         <span class="macro">assert!</span>(!opt.env.exists(Path::new(<span class="string">&quot;db/000016.ldb&quot;</span>)).unwrap());

         <span class="macro">assert_eq!</span>(<span class="string">b&quot;val1&quot;</span>.to_vec(), db.get(<span class="string">b&quot;aaa&quot;</span>).unwrap());
         <span class="macro">assert_eq!</span>(<span class="string">b&quot;val2&quot;</span>.to_vec(), db.get(<span class="string">b&quot;cab&quot;</span>).unwrap());
         <span class="macro">assert_eq!</span>(<span class="string">b&quot;val3&quot;</span>.to_vec(), db.get(<span class="string">b&quot;aba&quot;</span>).unwrap());
         <span class="macro">assert_eq!</span>(<span class="string">b&quot;val3&quot;</span>.to_vec(), db.get(<span class="string">b&quot;fab&quot;</span>).unwrap());
         <span class="macro">assert_eq!</span>(<span class="string">b&quot;123&quot;</span>.to_vec(), db.get(<span class="string">b&quot;xxx&quot;</span>).unwrap());
     }

     <span class="attribute">#[allow(unused_variables)]
     </span><span class="kw">fn </span>test_db_impl_locking() {
         <span class="kw">let </span>opt = options::for_test();
         <span class="kw">let </span>db = DB::open(<span class="string">&quot;db&quot;</span>, opt.clone()).unwrap();
         <span class="kw">let </span>want_err = Status::new(
             StatusCode::LockError,
             <span class="string">&quot;database lock is held by another instance&quot;</span>,
         );
         <span class="macro">assert_eq!</span>(want_err, DB::open(<span class="string">&quot;db&quot;</span>, opt.clone()).err().unwrap());
     }

     <span class="kw">fn </span>test_db_impl_build_table() {
         <span class="kw">let </span><span class="kw-2">mut </span>opt = options::for_test();
         opt.block_size = <span class="number">128</span>;
         <span class="kw">let </span>mt = build_memtable();

         <span class="kw">let </span>f = build_table(<span class="string">&quot;db&quot;</span>, <span class="kw-2">&amp;</span>opt, mt.iter(), <span class="number">123</span>).unwrap();
         <span class="kw">let </span>path = Path::new(<span class="string">&quot;db/000123.ldb&quot;</span>);

         <span class="macro">assert_eq!</span>(
             LookupKey::new(<span class="string">&quot;aabc&quot;</span>.as_bytes(), <span class="number">6</span>).internal_key(),
             f.smallest.as_slice()
         );
         <span class="macro">assert_eq!</span>(
             LookupKey::new(<span class="string">&quot;test123&quot;</span>.as_bytes(), <span class="number">7</span>).internal_key(),
             f.largest.as_slice()
         );
         <span class="macro">assert_eq!</span>(<span class="number">379</span>, f.size);
         <span class="macro">assert_eq!</span>(<span class="number">123</span>, f.num);
         <span class="macro">assert!</span>(opt.env.exists(path).unwrap());

         {
             <span class="comment">// Read table back in.
             </span><span class="kw">let </span><span class="kw-2">mut </span>tc = TableCache::new(<span class="string">&quot;db&quot;</span>, opt.clone(), <span class="number">100</span>);
             <span class="kw">let </span>tbl = tc.get_table(<span class="number">123</span>).unwrap();
             <span class="macro">assert_eq!</span>(mt.len(), LdbIteratorIter::wrap(<span class="kw-2">&amp;mut </span>tbl.iter()).count());
         }

         {
             <span class="comment">// Corrupt table; make sure it doesn&#39;t load fully.
             </span><span class="kw">let </span><span class="kw-2">mut </span>buf = <span class="macro">vec!</span>[];
             opt.env
                 .open_sequential_file(path)
                 .unwrap()
                 .read_to_end(<span class="kw-2">&amp;mut </span>buf)
                 .unwrap();
             buf[<span class="number">150</span>] += <span class="number">1</span>;
             opt.env
                 .open_writable_file(path)
                 .unwrap()
                 .write_all(<span class="kw-2">&amp;</span>buf)
                 .unwrap();

             <span class="kw">let </span><span class="kw-2">mut </span>tc = TableCache::new(<span class="string">&quot;db&quot;</span>, opt.clone(), <span class="number">100</span>);
             <span class="kw">let </span>tbl = tc.get_table(<span class="number">123</span>).unwrap();
             <span class="comment">// The last two entries are skipped due to the corruption above.
             </span><span class="macro">assert_eq!</span>(
                 <span class="number">5</span>,
                 LdbIteratorIter::wrap(<span class="kw-2">&amp;mut </span>tbl.iter())
                     .map(|v| <span class="macro">println!</span>(<span class="string">&quot;{:?}&quot;</span>, v))
                     .count()
             );
         }
     }

     <span class="attribute">#[allow(unused_variables)]
     </span><span class="kw">fn </span>test_db_impl_build_db_sanity() {
         <span class="kw">let </span>db = build_db().<span class="number">0</span>;
         <span class="kw">let </span>env = <span class="kw-2">&amp;</span>db.opt.env;
         <span class="kw">let </span>name = <span class="kw-2">&amp;</span>db.name;

         <span class="macro">assert!</span>(env.exists(Path::new(<span class="kw-2">&amp;</span>log_file_name(name, <span class="number">12</span>))).unwrap());
     }

     <span class="kw">fn </span>test_db_impl_get_from_table_with_snapshot() {
         <span class="kw">let </span><span class="kw-2">mut </span>db = build_db().<span class="number">0</span>;

         <span class="macro">assert_eq!</span>(<span class="number">30</span>, db.vset.borrow().last_seq);

         <span class="comment">// seq = 31
         </span>db.put(<span class="string">&quot;xyy&quot;</span>.as_bytes(), <span class="string">&quot;123&quot;</span>.as_bytes()).unwrap();
         <span class="kw">let </span>old_ss = db.get_snapshot();
         <span class="comment">// seq = 32
         </span>db.put(<span class="string">&quot;xyz&quot;</span>.as_bytes(), <span class="string">&quot;123&quot;</span>.as_bytes()).unwrap();
         db.flush().unwrap();
         <span class="macro">assert!</span>(db.get_at(<span class="kw-2">&amp;</span>old_ss, <span class="string">&quot;xyy&quot;</span>.as_bytes()).unwrap().is_some());
         <span class="macro">assert!</span>(db.get_at(<span class="kw-2">&amp;</span>old_ss, <span class="string">&quot;xyz&quot;</span>.as_bytes()).unwrap().is_none());

         <span class="comment">// memtable get
         </span><span class="macro">assert_eq!</span>(
             <span class="string">&quot;123&quot;</span>.as_bytes(),
             db.get(<span class="string">&quot;xyz&quot;</span>.as_bytes()).unwrap().as_slice()
         );
         <span class="macro">assert!</span>(db.get_internal(<span class="number">31</span>, <span class="string">&quot;xyy&quot;</span>.as_bytes()).unwrap().is_some());
         <span class="macro">assert!</span>(db.get_internal(<span class="number">32</span>, <span class="string">&quot;xyy&quot;</span>.as_bytes()).unwrap().is_some());

         <span class="macro">assert!</span>(db.get_internal(<span class="number">31</span>, <span class="string">&quot;xyz&quot;</span>.as_bytes()).unwrap().is_none());
         <span class="macro">assert!</span>(db.get_internal(<span class="number">32</span>, <span class="string">&quot;xyz&quot;</span>.as_bytes()).unwrap().is_some());

         <span class="comment">// table get
         </span><span class="macro">assert_eq!</span>(
             <span class="string">&quot;val2&quot;</span>.as_bytes(),
             db.get(<span class="string">&quot;eab&quot;</span>.as_bytes()).unwrap().as_slice()
         );
         <span class="macro">assert!</span>(db.get_internal(<span class="number">3</span>, <span class="string">&quot;eab&quot;</span>.as_bytes()).unwrap().is_none());
         <span class="macro">assert!</span>(db.get_internal(<span class="number">32</span>, <span class="string">&quot;eab&quot;</span>.as_bytes()).unwrap().is_some());

         {
             <span class="kw">let </span>ss = db.get_snapshot();
             <span class="macro">assert_eq!</span>(
                 <span class="string">&quot;val2&quot;</span>.as_bytes(),
                 db.get_at(<span class="kw-2">&amp;</span>ss, <span class="string">&quot;eab&quot;</span>.as_bytes())
                     .unwrap()
                     .unwrap()
                     .as_slice()
             );
         }

         <span class="comment">// from table.
         </span><span class="macro">assert_eq!</span>(
             <span class="string">&quot;val2&quot;</span>.as_bytes(),
             db.get(<span class="string">&quot;cab&quot;</span>.as_bytes()).unwrap().as_slice()
         );
     }

     <span class="kw">fn </span>test_db_impl_delete() {
         <span class="kw">let </span><span class="kw-2">mut </span>db = build_db().<span class="number">0</span>;

         db.put(<span class="string">b&quot;xyy&quot;</span>, <span class="string">b&quot;123&quot;</span>).unwrap();
         db.put(<span class="string">b&quot;xyz&quot;</span>, <span class="string">b&quot;123&quot;</span>).unwrap();

         <span class="macro">assert!</span>(db.get(<span class="string">b&quot;xyy&quot;</span>).is_some());
         <span class="macro">assert!</span>(db.get(<span class="string">b&quot;gaa&quot;</span>).is_some());

         <span class="comment">// Delete one memtable entry and one table entry.
         </span>db.delete(<span class="string">b&quot;xyy&quot;</span>).unwrap();
         db.delete(<span class="string">b&quot;gaa&quot;</span>).unwrap();

         <span class="macro">assert!</span>(db.get(<span class="string">b&quot;xyy&quot;</span>).is_none());
         <span class="macro">assert!</span>(db.get(<span class="string">b&quot;gaa&quot;</span>).is_none());
         <span class="macro">assert!</span>(db.get(<span class="string">b&quot;xyz&quot;</span>).is_some());
     }

     <span class="kw">fn </span>test_db_impl_compact_single_file() {
         <span class="kw">let </span><span class="kw-2">mut </span>db = build_db().<span class="number">0</span>;
         set_file_to_compact(<span class="kw-2">&amp;mut </span>db, <span class="number">4</span>);
         db.maybe_do_compaction().unwrap();

         <span class="kw">let </span>env = <span class="kw-2">&amp;</span>db.opt.env;
         <span class="kw">let </span>name = <span class="kw-2">&amp;</span>db.name;
         <span class="macro">assert!</span>(!env.exists(Path::new(<span class="kw-2">&amp;</span>table_file_name(name, <span class="number">3</span>))).unwrap());
         <span class="macro">assert!</span>(!env.exists(Path::new(<span class="kw-2">&amp;</span>table_file_name(name, <span class="number">4</span>))).unwrap());
         <span class="macro">assert!</span>(!env.exists(Path::new(<span class="kw-2">&amp;</span>table_file_name(name, <span class="number">5</span>))).unwrap());
         <span class="macro">assert!</span>(env.exists(Path::new(<span class="kw-2">&amp;</span>table_file_name(name, <span class="number">13</span>))).unwrap());
     }

     <span class="kw">fn </span>test_db_impl_compaction_trivial_move() {
         <span class="kw">let </span><span class="kw-2">mut </span>db = DB::open(<span class="string">&quot;db&quot;</span>, options::for_test()).unwrap();

         db.put(<span class="string">&quot;abc&quot;</span>.as_bytes(), <span class="string">&quot;xyz&quot;</span>.as_bytes()).unwrap();
         db.put(<span class="string">&quot;ab3&quot;</span>.as_bytes(), <span class="string">&quot;xyz&quot;</span>.as_bytes()).unwrap();
         db.put(<span class="string">&quot;ab0&quot;</span>.as_bytes(), <span class="string">&quot;xyz&quot;</span>.as_bytes()).unwrap();
         db.put(<span class="string">&quot;abz&quot;</span>.as_bytes(), <span class="string">&quot;xyz&quot;</span>.as_bytes()).unwrap();
         <span class="macro">assert_eq!</span>(<span class="number">4</span>, db.mem.len());
         <span class="kw">let </span><span class="kw-2">mut </span>imm = MemTable::new(db.opt.cmp.clone());
         mem::swap(<span class="kw-2">&amp;mut </span>imm, <span class="kw-2">&amp;mut </span>db.mem);
         db.imm = <span class="prelude-val">Some</span>(imm);
         db.compact_memtable().unwrap();

         <span class="macro">println!</span>(
             <span class="string">&quot;children after: {:?}&quot;</span>,
             db.opt.env.children(Path::new(<span class="string">&quot;db/&quot;</span>)).unwrap()
         );
         <span class="macro">assert!</span>(db.opt.env.exists(Path::new(<span class="string">&quot;db/000004.ldb&quot;</span>)).unwrap());

         {
             <span class="kw">let </span>v = db.current();
             <span class="kw">let </span><span class="kw-2">mut </span>v = v.borrow_mut();
             v.file_to_compact = <span class="prelude-val">Some</span>(v.files[<span class="number">2</span>][<span class="number">0</span>].clone());
             v.file_to_compact_lvl = <span class="number">2</span>;
         }

         db.maybe_do_compaction().unwrap();

         {
             <span class="kw">let </span>v = db.current();
             <span class="kw">let </span>v = v.borrow_mut();
             <span class="macro">assert_eq!</span>(<span class="number">1</span>, v.files[<span class="number">3</span>].len());
         }
     }

     <span class="kw">fn </span>test_db_impl_memtable_compaction() {
         <span class="kw">let </span><span class="kw-2">mut </span>opt = options::for_test();
         opt.write_buffer_size = <span class="number">25</span>;
         <span class="kw">let </span><span class="kw-2">mut </span>db = DB::new(<span class="string">&quot;db&quot;</span>, opt);

         <span class="comment">// Fill up memtable.
         </span>db.mem = build_memtable();

         <span class="comment">// Trigger memtable compaction.
         </span>db.make_room_for_write(<span class="bool-val">true</span>).unwrap();
         <span class="macro">assert_eq!</span>(<span class="number">0</span>, db.mem.len());
         <span class="macro">assert!</span>(db.opt.env.exists(Path::new(<span class="string">&quot;db/000002.log&quot;</span>)).unwrap());
         <span class="macro">assert!</span>(db.opt.env.exists(Path::new(<span class="string">&quot;db/000003.ldb&quot;</span>)).unwrap());
         <span class="macro">assert_eq!</span>(<span class="number">351</span>, db.opt.env.size_of(Path::new(<span class="string">&quot;db/000003.ldb&quot;</span>)).unwrap());
         <span class="macro">assert_eq!</span>(
             <span class="number">7</span>,
             LdbIteratorIter::wrap(<span class="kw-2">&amp;mut </span>db.cache.borrow_mut().get_table(<span class="number">3</span>).unwrap().iter()).count()
         );
     }

     <span class="kw">fn </span>test_db_impl_compaction() {
         <span class="kw">let </span><span class="kw-2">mut </span>db = build_db().<span class="number">0</span>;
         <span class="kw">let </span>v = db.current();
         v.borrow_mut().compaction_score = <span class="prelude-val">Some</span>(<span class="number">2.0</span>);
         v.borrow_mut().compaction_level = <span class="prelude-val">Some</span>(<span class="number">1</span>);

         db.maybe_do_compaction().unwrap();

         <span class="macro">assert!</span>(!db.opt.env.exists(Path::new(<span class="string">&quot;db/000003.ldb&quot;</span>)).unwrap());
         <span class="macro">assert!</span>(db.opt.env.exists(Path::new(<span class="string">&quot;db/000013.ldb&quot;</span>)).unwrap());
         <span class="macro">assert_eq!</span>(<span class="number">345</span>, db.opt.env.size_of(Path::new(<span class="string">&quot;db/000013.ldb&quot;</span>)).unwrap());

         <span class="comment">// New current version.
         </span><span class="kw">let </span>v = db.current();
         <span class="macro">assert_eq!</span>(<span class="number">0</span>, v.borrow().files[<span class="number">1</span>].len());
         <span class="macro">assert_eq!</span>(<span class="number">2</span>, v.borrow().files[<span class="number">2</span>].len());
     }

     <span class="kw">fn </span>test_db_impl_compaction_trivial() {
         <span class="kw">let </span>(<span class="kw-2">mut </span>v, opt) = make_version();

         <span class="kw">let </span>to_compact = v.files[<span class="number">2</span>][<span class="number">0</span>].clone();
         v.file_to_compact = <span class="prelude-val">Some</span>(to_compact);
         v.file_to_compact_lvl = <span class="number">2</span>;

         <span class="kw">let </span><span class="kw-2">mut </span>db = DB::new(<span class="string">&quot;db&quot;</span>, opt.clone());
         db.vset.borrow_mut().add_version(v);
         db.vset.borrow_mut().next_file_num = <span class="number">10</span>;

         db.maybe_do_compaction().unwrap();

         <span class="macro">assert!</span>(opt.env.exists(Path::new(<span class="string">&quot;db/000006.ldb&quot;</span>)).unwrap());
         <span class="macro">assert!</span>(!opt.env.exists(Path::new(<span class="string">&quot;db/000010.ldb&quot;</span>)).unwrap());
         <span class="macro">assert_eq!</span>(<span class="number">218</span>, opt.env.size_of(Path::new(<span class="string">&quot;db/000006.ldb&quot;</span>)).unwrap());

         <span class="kw">let </span>v = db.current();
         <span class="macro">assert_eq!</span>(<span class="number">1</span>, v.borrow().files[<span class="number">2</span>].len());
         <span class="macro">assert_eq!</span>(<span class="number">3</span>, v.borrow().files[<span class="number">3</span>].len());
     }

     <span class="kw">fn </span>test_db_impl_compaction_state_cleanup() {
         <span class="kw">let </span>env: Box&lt;<span class="kw">dyn </span>Env&gt; = Box::new(MemEnv::new());
         <span class="kw">let </span>name = <span class="string">&quot;db&quot;</span>;

         <span class="kw">let </span>stuff = <span class="string">&quot;abcdefghijkl&quot;</span>.as_bytes();
         env.open_writable_file(Path::new(<span class="string">&quot;db/000001.ldb&quot;</span>))
             .unwrap()
             .write_all(stuff)
             .unwrap();
         <span class="kw">let </span><span class="kw-2">mut </span>fmd = FileMetaData::default();
         fmd.num = <span class="number">1</span>;

         <span class="kw">let </span><span class="kw-2">mut </span>cs = CompactionState::new(Compaction::new(<span class="kw-2">&amp;</span>options::for_test(), <span class="number">2</span>, <span class="prelude-val">None</span>), <span class="number">12</span>);
         cs.outputs = <span class="macro">vec!</span>[fmd];
         cs.cleanup(<span class="kw-2">&amp;</span>env, name);

         <span class="macro">assert!</span>(!env.exists(Path::new(<span class="string">&quot;db/000001.ldb&quot;</span>)).unwrap());
     }

     <span class="kw">fn </span>test_db_impl_open_close_reopen() {
         <span class="kw">let </span>opt;
         {
             <span class="kw">let </span><span class="kw-2">mut </span>db = build_db().<span class="number">0</span>;
             opt = db.opt.clone();
             db.put(<span class="string">b&quot;xx1&quot;</span>, <span class="string">b&quot;111&quot;</span>).unwrap();
             db.put(<span class="string">b&quot;xx2&quot;</span>, <span class="string">b&quot;112&quot;</span>).unwrap();
             db.put(<span class="string">b&quot;xx3&quot;</span>, <span class="string">b&quot;113&quot;</span>).unwrap();
             db.put(<span class="string">b&quot;xx4&quot;</span>, <span class="string">b&quot;114&quot;</span>).unwrap();
             db.put(<span class="string">b&quot;xx5&quot;</span>, <span class="string">b&quot;115&quot;</span>).unwrap();
             db.delete(<span class="string">b&quot;xx2&quot;</span>).unwrap();
         }

         {
             <span class="kw">let </span><span class="kw-2">mut </span>db = DB::open(<span class="string">&quot;db&quot;</span>, opt.clone()).unwrap();
             db.delete(<span class="string">b&quot;xx5&quot;</span>).unwrap();
         }

         {
             <span class="kw">let </span><span class="kw-2">mut </span>db = DB::open(<span class="string">&quot;db&quot;</span>, opt.clone()).unwrap();

             <span class="macro">assert_eq!</span>(<span class="prelude-val">None</span>, db.get(<span class="string">b&quot;xx5&quot;</span>));

             <span class="kw">let </span>ss = db.get_snapshot();
             db.put(<span class="string">b&quot;xx4&quot;</span>, <span class="string">b&quot;222&quot;</span>).unwrap();
             <span class="kw">let </span>ss2 = db.get_snapshot();

             <span class="macro">assert_eq!</span>(<span class="prelude-val">Some</span>(<span class="string">b&quot;113&quot;</span>.to_vec()), db.get_at(<span class="kw-2">&amp;</span>ss, <span class="string">b&quot;xx3&quot;</span>).unwrap());
             <span class="macro">assert_eq!</span>(<span class="prelude-val">None</span>, db.get_at(<span class="kw-2">&amp;</span>ss, <span class="string">b&quot;xx2&quot;</span>).unwrap());
             <span class="macro">assert_eq!</span>(<span class="prelude-val">None</span>, db.get_at(<span class="kw-2">&amp;</span>ss, <span class="string">b&quot;xx5&quot;</span>).unwrap());

             <span class="macro">assert_eq!</span>(<span class="prelude-val">Some</span>(<span class="string">b&quot;114&quot;</span>.to_vec()), db.get_at(<span class="kw-2">&amp;</span>ss, <span class="string">b&quot;xx4&quot;</span>).unwrap());
             <span class="macro">assert_eq!</span>(<span class="prelude-val">Some</span>(<span class="string">b&quot;222&quot;</span>.to_vec()), db.get_at(<span class="kw-2">&amp;</span>ss2, <span class="string">b&quot;xx4&quot;</span>).unwrap());
         }

         {
             <span class="kw">let </span><span class="kw-2">mut </span>db = DB::open(<span class="string">&quot;db&quot;</span>, opt).unwrap();

             <span class="kw">let </span>ss = db.get_snapshot();
             <span class="macro">assert_eq!</span>(<span class="prelude-val">Some</span>(<span class="string">b&quot;113&quot;</span>.to_vec()), db.get_at(<span class="kw-2">&amp;</span>ss, <span class="string">b&quot;xx3&quot;</span>).unwrap());
             <span class="macro">assert_eq!</span>(<span class="prelude-val">Some</span>(<span class="string">b&quot;222&quot;</span>.to_vec()), db.get_at(<span class="kw-2">&amp;</span>ss, <span class="string">b&quot;xx4&quot;</span>).unwrap());
             <span class="macro">assert_eq!</span>(<span class="prelude-val">None</span>, db.get_at(<span class="kw-2">&amp;</span>ss, <span class="string">b&quot;xx2&quot;</span>).unwrap());
         }
     }
 }
 </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>