api-docs/crates-enclave/src/rusty_leveldb/version_set.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/version_set.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>version_set.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>
 </pre><pre class="rust"><code><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;
 <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>::key_types::{parse_internal_key, InternalKey, UserKey};
 <span class="kw">use </span><span class="kw">crate</span>::log::{LogReader, LogWriter};
 <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>::table_cache::TableCache;
 <span class="kw">use </span><span class="kw">crate</span>::types::{
     parse_file_name, share, FileMetaData, FileNum, FileType, LdbIterator, Shared, NUM_LEVELS,
 };
 <span class="kw">use </span><span class="kw">crate</span>::version::{new_version_iter, total_size, FileMetaHandle, Version};
 <span class="kw">use </span><span class="kw">crate</span>::version_edit::VersionEdit;

 <span class="kw">use </span>std::cmp::Ordering;
 <span class="kw">use </span>std::collections::HashSet;
 <span class="kw">use </span>std::io::Write;
 <span class="kw">use </span>std::path::{Path, PathBuf};
 <span class="kw">use </span>std::rc::Rc;

 <span class="kw">use </span>std::os::unix::ffi::OsStrExt;

 <span class="kw">pub struct </span>Compaction {
     level: usize,
     max_file_size: usize,
     input_version: <span class="prelude-ty">Option</span>&lt;Shared&lt;Version&gt;&gt;,
     level_ixs: [usize; NUM_LEVELS],
     cmp: Rc&lt;Box&lt;<span class="kw">dyn </span>Cmp&gt;&gt;,
     icmp: InternalKeyCmp,

     manual: bool,

     <span class="comment">// &quot;parent&quot; inputs from level and level+1.
     </span>inputs: [Vec&lt;FileMetaHandle&gt;; <span class="number">2</span>],
     grandparent_ix: usize,
     <span class="comment">// remaining inputs from level+2..NUM_LEVELS
     </span>grandparents: <span class="prelude-ty">Option</span>&lt;Vec&lt;FileMetaHandle&gt;&gt;,
     overlapped_bytes: usize,
     seen_key: bool,
     edit: VersionEdit,
 }

 <span class="kw">impl </span>Compaction {
     <span class="comment">// Note: opt.cmp should be the user-supplied or default comparator (not an InternalKeyCmp).
     </span><span class="kw">pub fn </span>new(opt: <span class="kw-2">&amp;</span>Options, level: usize, input: <span class="prelude-ty">Option</span>&lt;Shared&lt;Version&gt;&gt;) -&gt; Compaction {
         Compaction {
             level,
             max_file_size: opt.max_file_size,
             input_version: input,
             level_ixs: Default::default(),
             cmp: opt.cmp.clone(),
             icmp: InternalKeyCmp(opt.cmp.clone()),
             manual: <span class="bool-val">false</span>,

             inputs: Default::default(),
             grandparent_ix: <span class="number">0</span>,
             grandparents: Default::default(),
             overlapped_bytes: <span class="number">0</span>,
             seen_key: <span class="bool-val">false</span>,
             edit: VersionEdit::new(),
         }
     }

     <span class="kw">fn </span>add_input(<span class="kw-2">&amp;mut </span><span class="self">self</span>, parent: usize, f: FileMetaHandle) {
         <span class="macro">assert!</span>(parent &lt;= <span class="number">1</span>);
         <span class="self">self</span>.inputs[parent].push(f)
     }

     <span class="kw">pub fn </span>level(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
         <span class="self">self</span>.level
     }

     <span class="kw">pub fn </span>input(<span class="kw-2">&amp;</span><span class="self">self</span>, parent: usize, ix: usize) -&gt; FileMetaData {
         <span class="macro">assert!</span>(parent &lt; <span class="number">2</span>);
         <span class="macro">assert!</span>(ix &lt; <span class="self">self</span>.inputs[parent].len());
         <span class="self">self</span>.inputs[parent][ix].borrow().clone()
     }

     <span class="kw">pub fn </span>num_inputs(<span class="kw-2">&amp;</span><span class="self">self</span>, parent: usize) -&gt; usize {
         <span class="macro">assert!</span>(parent &lt; <span class="number">2</span>);
         <span class="self">self</span>.inputs[parent].len()
     }

     <span class="kw">pub fn </span>edit(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;mut </span>VersionEdit {
         <span class="kw-2">&amp;mut </span><span class="self">self</span>.edit
     }

     <span class="kw">pub fn </span>into_edit(<span class="self">self</span>) -&gt; VersionEdit {
         <span class="self">self</span>.edit
     }

     <span class="doccomment">/// add_input_deletions marks the current input files as deleted in the inner VersionEdit.
     </span><span class="kw">pub fn </span>add_input_deletions(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
         <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>f <span class="kw">in </span><span class="kw-2">&amp;</span><span class="self">self</span>.inputs[parent] {
                 <span class="self">self</span>.edit.delete_file(<span class="self">self</span>.level + parent, f.borrow().num);
             }
         }
     }

     <span class="doccomment">/// is_base_level_for checks whether the given key may exist in levels higher than this
     /// compaction&#39;s level plus 2. I.e., whether the levels for this compaction are the last ones
     /// to contain the key.
     </span><span class="kw">pub fn </span>is_base_level_for&lt;<span class="lifetime">&#39;a</span>&gt;(<span class="kw-2">&amp;mut </span><span class="self">self</span>, k: UserKey&lt;<span class="lifetime">&#39;a</span>&gt;) -&gt; bool {
         <span class="macro">assert!</span>(<span class="self">self</span>.input_version.is_some());
         <span class="kw">let </span>inp_version = <span class="self">self</span>.input_version.as_ref().unwrap();
         <span class="kw">for </span>level <span class="kw">in </span><span class="self">self</span>.level + <span class="number">2</span>..NUM_LEVELS {
             <span class="kw">let </span>files = <span class="kw-2">&amp;</span>inp_version.borrow().files[level];
             <span class="kw">while </span><span class="self">self</span>.level_ixs[level] &lt; files.len() {
                 <span class="kw">let </span>f = files[<span class="self">self</span>.level_ixs[level]].borrow();
                 <span class="kw">if </span><span class="self">self</span>.cmp.cmp(k, parse_internal_key(<span class="kw-2">&amp;</span>f.largest).<span class="number">2</span>) &lt;= Ordering::Equal {
                     <span class="kw">if </span><span class="self">self</span>.cmp.cmp(k, parse_internal_key(<span class="kw-2">&amp;</span>f.smallest).<span class="number">2</span>) &gt;= Ordering::Equal {
                         <span class="comment">// key is in this file&#39;s range, so this is not the base level.
                         </span><span class="kw">return </span><span class="bool-val">false</span>;
                     }
                     <span class="kw">break</span>;
                 }
                 <span class="comment">// level_ixs contains cross-call state to speed up following lookups.
                 </span><span class="self">self</span>.level_ixs[level] += <span class="number">1</span>;
             }
         }
         <span class="bool-val">true
     </span>}

     <span class="kw">pub fn </span>is_trivial_move(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; bool {
         <span class="kw">if </span><span class="self">self</span>.manual {
             <span class="kw">return </span><span class="bool-val">false</span>;
         }

         <span class="kw">let </span>inputs_size;
         <span class="kw">if let </span><span class="prelude-val">Some</span>(gp) = <span class="self">self</span>.grandparents.as_ref() {
             inputs_size = total_size(gp.iter());
         } <span class="kw">else </span>{
             inputs_size = <span class="number">0</span>;
         }
         <span class="self">self</span>.num_inputs(<span class="number">0</span>) == <span class="number">1 </span>&amp;&amp; <span class="self">self</span>.num_inputs(<span class="number">1</span>) == <span class="number">0 </span>&amp;&amp; inputs_size &lt; <span class="number">10 </span>* <span class="self">self</span>.max_file_size
     }

     <span class="kw">pub fn </span>should_stop_before&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;) -&gt; bool {
         <span class="kw">if </span><span class="self">self</span>.grandparents.is_none() {
             <span class="self">self</span>.seen_key = <span class="bool-val">true</span>;
             <span class="kw">return </span><span class="bool-val">false</span>;
         }
         <span class="kw">let </span>grandparents = <span class="self">self</span>.grandparents.as_ref().unwrap();
         <span class="kw">while </span><span class="self">self</span>.grandparent_ix &lt; grandparents.len()
             &amp;&amp; <span class="self">self
                 </span>.icmp
                 .cmp(k, <span class="kw-2">&amp;</span>grandparents[<span class="self">self</span>.grandparent_ix].borrow().largest)
                 == Ordering::Greater
         {
             <span class="kw">if </span><span class="self">self</span>.seen_key {
                 <span class="self">self</span>.overlapped_bytes += grandparents[<span class="self">self</span>.grandparent_ix].borrow().size;
             }
             <span class="self">self</span>.grandparent_ix += <span class="number">1</span>;
         }
         <span class="self">self</span>.seen_key = <span class="bool-val">true</span>;

         <span class="kw">if </span><span class="self">self</span>.overlapped_bytes &gt; <span class="number">10 </span>* <span class="self">self</span>.max_file_size {
             <span class="self">self</span>.overlapped_bytes = <span class="number">0</span>;
             <span class="bool-val">true
         </span>} <span class="kw">else </span>{
             <span class="bool-val">false
         </span>}
     }
 }

 <span class="doccomment">/// VersionSet managed the various versions that are live within a database. A single version
 /// contains references to the files on disk as they were at a certain point.
 </span><span class="kw">pub struct </span>VersionSet {
     dbname: PathBuf,
     opt: Options,
     cmp: InternalKeyCmp,
     cache: Shared&lt;TableCache&gt;,

     <span class="kw">pub </span>next_file_num: u64,
     <span class="kw">pub </span>manifest_num: u64,
     <span class="kw">pub </span>last_seq: u64,
     <span class="kw">pub </span>log_num: u64,
     <span class="kw">pub </span>prev_log_num: u64,

     current: <span class="prelude-ty">Option</span>&lt;Shared&lt;Version&gt;&gt;,
     compaction_ptrs: [Vec&lt;u8&gt;; NUM_LEVELS],

     descriptor_log: <span class="prelude-ty">Option</span>&lt;LogWriter&lt;Box&lt;<span class="kw">dyn </span>Write&gt;&gt;&gt;,
 }

 <span class="kw">impl </span>VersionSet {
     <span class="comment">// Note: opt.cmp should not contain an InternalKeyCmp at this point, but instead the default or
     // user-supplied one.
     </span><span class="kw">pub fn </span>new&lt;P: AsRef&lt;Path&gt;&gt;(db: P, opt: Options, cache: Shared&lt;TableCache&gt;) -&gt; VersionSet {
         <span class="kw">let </span>v = share(Version::new(cache.clone(), opt.cmp.clone()));
         VersionSet {
             dbname: db.as_ref().to_owned(),
             cmp: InternalKeyCmp(opt.cmp.clone()),
             opt,
             cache,

             next_file_num: <span class="number">2</span>,
             manifest_num: <span class="number">0</span>,
             last_seq: <span class="number">0</span>,
             log_num: <span class="number">0</span>,
             prev_log_num: <span class="number">0</span>,

             current: <span class="prelude-val">Some</span>(v),
             compaction_ptrs: Default::default(),
             descriptor_log: <span class="prelude-val">None</span>,
         }
     }

     <span class="kw">pub fn </span>current_summary(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; String {
         <span class="self">self</span>.current.as_ref().unwrap().borrow().level_summary()
     }

     <span class="doccomment">/// live_files returns the files that are currently active.
     </span><span class="kw">pub fn </span>live_files(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; HashSet&lt;FileNum&gt; {
         <span class="kw">let </span><span class="kw-2">mut </span>files = HashSet::new();
         <span class="kw">if let </span><span class="prelude-val">Some</span>(<span class="kw-2">ref </span>version) = <span class="self">self</span>.current {
             <span class="kw">for </span>level <span class="kw">in </span><span class="number">0</span>..NUM_LEVELS {
                 <span class="kw">for </span>file <span class="kw">in </span><span class="kw-2">&amp;</span>version.borrow().files[level] {
                     files.insert(file.borrow().num);
                 }
             }
         }
         files
     }

     <span class="doccomment">/// current returns a reference to the current version. It panics if there is no current
     /// version.
     </span><span class="kw">pub fn </span>current(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; Shared&lt;Version&gt; {
         <span class="macro">assert!</span>(<span class="self">self</span>.current.is_some());
         <span class="self">self</span>.current.as_ref().unwrap().clone()
     }

     <span class="kw">pub fn </span>add_version(<span class="kw-2">&amp;mut </span><span class="self">self</span>, v: Version) {
         <span class="self">self</span>.current = <span class="prelude-val">Some</span>(share(v));
     }

     <span class="kw">pub fn </span>new_file_number(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; FileNum {
         <span class="self">self</span>.next_file_num += <span class="number">1</span>;
         <span class="self">self</span>.next_file_num - <span class="number">1
     </span>}

     <span class="kw">pub fn </span>reuse_file_number(<span class="kw-2">&amp;mut </span><span class="self">self</span>, n: FileNum) {
         <span class="kw">if </span>n == <span class="self">self</span>.next_file_num - <span class="number">1 </span>{
             <span class="self">self</span>.next_file_num = n;
         }
     }

     <span class="kw">pub fn </span>mark_file_number_used(<span class="kw-2">&amp;mut </span><span class="self">self</span>, n: FileNum) {
         <span class="kw">if </span><span class="self">self</span>.next_file_num &lt;= n {
             <span class="self">self</span>.next_file_num = n + <span class="number">1</span>;
         }
     }

     <span class="doccomment">/// needs_compaction returns true if a compaction makes sense at this point.
     </span><span class="kw">pub fn </span>needs_compaction(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; bool {
         <span class="macro">assert!</span>(<span class="self">self</span>.current.is_some());
         <span class="kw">let </span>v = <span class="self">self</span>.current.as_ref().unwrap();
         <span class="kw">let </span>v = v.borrow();
         v.compaction_score.unwrap_or(<span class="number">0.0</span>) &gt;= <span class="number">1.0 </span>|| v.file_to_compact.is_some()
     }

     <span class="kw">fn </span>approximate_offset&lt;<span class="lifetime">&#39;a</span>&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, v: <span class="kw-2">&amp;</span>Shared&lt;Version&gt;, key: InternalKey&lt;<span class="lifetime">&#39;a</span>&gt;) -&gt; usize {
         <span class="kw">let </span><span class="kw-2">mut </span>offset = <span class="number">0</span>;
         <span class="kw">for </span>level <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.borrow().files[level] {
                 <span class="kw">if </span><span class="self">self</span>.opt.cmp.cmp(<span class="kw-2">&amp;</span>f.borrow().largest, key) &lt;= Ordering::Equal {
                     offset += f.borrow().size;
                 } <span class="kw">else if </span><span class="self">self</span>.opt.cmp.cmp(<span class="kw-2">&amp;</span>f.borrow().smallest, key) == Ordering::Greater {
                     <span class="comment">// In higher levels, files are sorted; we don&#39;t need to search further.
                     </span><span class="kw">if </span>level &gt; <span class="number">0 </span>{
                         <span class="kw">break</span>;
                     }
                 } <span class="kw">else </span>{
                     <span class="kw">if let </span><span class="prelude-val">Ok</span>(tbl) = <span class="self">self</span>.cache.borrow_mut().get_table(f.borrow().num) {
                         offset += tbl.approx_offset_of(key);
                     }
                 }
             }
         }
         offset
     }

     <span class="kw">pub fn </span>pick_compaction(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;Compaction&gt; {
         <span class="macro">assert!</span>(<span class="self">self</span>.current.is_some());
         <span class="kw">let </span>current = <span class="self">self</span>.current();
         <span class="kw">let </span>current = current.borrow();

         <span class="kw">let </span><span class="kw-2">mut </span>c = Compaction::new(<span class="kw-2">&amp;</span><span class="self">self</span>.opt, <span class="number">0</span>, <span class="self">self</span>.current.clone());
         <span class="kw">let </span>level;

         <span class="comment">// Size compaction?
         </span><span class="kw">if </span>current.compaction_score.unwrap_or(<span class="number">0.0</span>) &gt;= <span class="number">1.0 </span>{
             level = current.compaction_level.unwrap();
             <span class="macro">assert!</span>(level &lt; NUM_LEVELS - <span class="number">1</span>);

             <span class="kw">for </span>f <span class="kw">in </span><span class="kw-2">&amp;</span>current.files[level] {
                 <span class="kw">if </span><span class="self">self</span>.compaction_ptrs[level].is_empty()
                     || <span class="self">self
                         </span>.cmp
                         .cmp(<span class="kw-2">&amp;</span>f.borrow().largest, <span class="kw-2">&amp;</span><span class="self">self</span>.compaction_ptrs[level])
                         == Ordering::Greater
                 {
                     c.add_input(<span class="number">0</span>, f.clone());
                     <span class="kw">break</span>;
                 }
             }

             <span class="kw">if </span>c.num_inputs(<span class="number">0</span>) == <span class="number">0 </span>{
                 <span class="comment">// Add first file in level. This will also reset the compaction pointers.
                 </span>c.add_input(<span class="number">0</span>, current.files[level][<span class="number">0</span>].clone());
             }
         } <span class="kw">else if let </span><span class="prelude-val">Some</span>(<span class="kw-2">ref </span>ftc) = current.file_to_compact {
             <span class="comment">// Seek compaction?
             </span>level = current.file_to_compact_lvl;
             c.add_input(<span class="number">0</span>, ftc.clone());
         } <span class="kw">else </span>{
             <span class="kw">return </span><span class="prelude-val">None</span>;
         }

         c.level = level;
         c.input_version = <span class="self">self</span>.current.clone();

         <span class="kw">if </span>level == <span class="number">0 </span>{
             <span class="kw">let </span>(smallest, largest) = get_range(<span class="kw-2">&amp;</span><span class="self">self</span>.cmp, c.inputs[<span class="number">0</span>].iter());
             <span class="comment">// This call intentionally overwrites the file previously put into c.inputs[0].
             </span>c.inputs[<span class="number">0</span>] = current.overlapping_inputs(<span class="number">0</span>, <span class="kw-2">&amp;</span>smallest, <span class="kw-2">&amp;</span>largest);
             <span class="macro">assert!</span>(!c.inputs[<span class="number">0</span>].is_empty());
         }

         <span class="self">self</span>.setup_other_inputs(<span class="kw-2">&amp;mut </span>c);
         <span class="prelude-val">Some</span>(c)
     }

     <span class="kw">pub fn </span>compact_range&lt;<span class="lifetime">&#39;a</span>, <span class="lifetime">&#39;b</span>&gt;(
         <span class="kw-2">&amp;mut </span><span class="self">self</span>,
         level: usize,
         from: InternalKey&lt;<span class="lifetime">&#39;a</span>&gt;,
         to: InternalKey&lt;<span class="lifetime">&#39;b</span>&gt;,
     ) -&gt; <span class="prelude-ty">Option</span>&lt;Compaction&gt; {
         <span class="macro">assert!</span>(<span class="self">self</span>.current.is_some());
         <span class="kw">let </span><span class="kw-2">mut </span>inputs = <span class="self">self
             </span>.current
             .as_ref()
             .unwrap()
             .borrow()
             .overlapping_inputs(level, from, to);
         <span class="kw">if </span>inputs.is_empty() {
             <span class="kw">return </span><span class="prelude-val">None</span>;
         }

         <span class="kw">if </span>level &gt; <span class="number">0 </span>{
             <span class="kw">let </span><span class="kw-2">mut </span>total = <span class="number">0</span>;
             <span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..inputs.len() {
                 total += inputs[i].borrow().size;
                 <span class="kw">if </span>total &gt; <span class="self">self</span>.opt.max_file_size {
                     inputs.truncate(i + <span class="number">1</span>);
                     <span class="kw">break</span>;
                 }
             }
         }

         <span class="kw">let </span><span class="kw-2">mut </span>c = Compaction::new(<span class="kw-2">&amp;</span><span class="self">self</span>.opt, level, <span class="self">self</span>.current.clone());
         c.inputs[<span class="number">0</span>] = inputs;
         c.manual = <span class="bool-val">true</span>;
         <span class="self">self</span>.setup_other_inputs(<span class="kw-2">&amp;mut </span>c);
         <span class="prelude-val">Some</span>(c)
     }

     <span class="kw">fn </span>setup_other_inputs(<span class="kw-2">&amp;mut </span><span class="self">self</span>, compaction: <span class="kw-2">&amp;mut </span>Compaction) {
         <span class="macro">assert!</span>(<span class="self">self</span>.current.is_some());
         <span class="kw">let </span>current = <span class="self">self</span>.current.as_ref().unwrap();
         <span class="kw">let </span>current = current.borrow();

         <span class="kw">let </span>level = compaction.level;
         <span class="kw">let </span>(<span class="kw-2">mut </span>smallest, <span class="kw-2">mut </span>largest) = get_range(<span class="kw-2">&amp;</span><span class="self">self</span>.cmp, compaction.inputs[<span class="number">0</span>].iter());

         <span class="comment">// Set up level+1 inputs.
         </span>compaction.inputs[<span class="number">1</span>] = current.overlapping_inputs(level + <span class="number">1</span>, <span class="kw-2">&amp;</span>smallest, <span class="kw-2">&amp;</span>largest);

         <span class="kw">let </span>(<span class="kw-2">mut </span>allstart, <span class="kw-2">mut </span>alllimit) = get_range(
             <span class="kw-2">&amp;</span><span class="self">self</span>.cmp,
             compaction.inputs[<span class="number">0</span>]
                 .iter()
                 .chain(compaction.inputs[<span class="number">1</span>].iter()),
         );

         <span class="comment">// Check if we can add more inputs in the current level without having to compact more
         // inputs from level+1.
         </span><span class="kw">if </span>!compaction.inputs[<span class="number">1</span>].is_empty() {
             <span class="kw">let </span>expanded0 = current.overlapping_inputs(level, <span class="kw-2">&amp;</span>allstart, <span class="kw-2">&amp;</span>alllimit);
             <span class="kw">let </span>inputs1_size = total_size(compaction.inputs[<span class="number">1</span>].iter());
             <span class="kw">let </span>expanded0_size = total_size(expanded0.iter());
             <span class="comment">// ...if we picked up more files in the current level, and the total size is acceptable
             </span><span class="kw">if </span>expanded0.len() &gt; compaction.num_inputs(<span class="number">0</span>)
                 &amp;&amp; (inputs1_size + expanded0_size) &lt; <span class="number">25 </span>* <span class="self">self</span>.opt.max_file_size
             {
                 <span class="kw">let </span>(new_start, new_limit) = get_range(<span class="kw-2">&amp;</span><span class="self">self</span>.cmp, expanded0.iter());
                 <span class="kw">let </span>expanded1 = current.overlapping_inputs(level + <span class="number">1</span>, <span class="kw-2">&amp;</span>new_start, <span class="kw-2">&amp;</span>new_limit);
                 <span class="kw">if </span>expanded1.len() == compaction.num_inputs(<span class="number">1</span>) {
                     <span class="macro">log!</span>(
                         <span class="self">self</span>.opt.log,
                         <span class="string">&quot;Expanding inputs@{} {}+{} ({}+{} bytes) to {}+{} ({}+{} bytes)&quot;</span>,
                         level,
                         compaction.inputs[<span class="number">0</span>].len(),
                         compaction.inputs[<span class="number">1</span>].len(),
                         total_size(compaction.inputs[<span class="number">0</span>].iter()),
                         total_size(compaction.inputs[<span class="number">1</span>].iter()),
                         expanded0.len(),
                         expanded1.len(),
                         total_size(expanded0.iter()),
                         total_size(expanded1.iter())
                     );

                     smallest = new_start;
                     largest = new_limit;
                     compaction.inputs[<span class="number">0</span>] = expanded0;
                     compaction.inputs[<span class="number">1</span>] = expanded1;
                     <span class="kw">let </span>(newallstart, newalllimit) = get_range(
                         <span class="kw-2">&amp;</span><span class="self">self</span>.cmp,
                         compaction.inputs[<span class="number">0</span>]
                             .iter()
                             .chain(compaction.inputs[<span class="number">1</span>].iter()),
                     );
                     allstart = newallstart;
                     alllimit = newalllimit;
                 }
             }
         }

         <span class="comment">// Set the list of grandparent (l+2) inputs to the files overlapped by the current overall
         // range.
         </span><span class="kw">if </span>level + <span class="number">2 </span>&lt; NUM_LEVELS {
             <span class="kw">let </span>grandparents = <span class="self">self</span>.current.as_ref().unwrap().borrow().overlapping_inputs(
                 level + <span class="number">2</span>,
                 <span class="kw-2">&amp;</span>allstart,
                 <span class="kw-2">&amp;</span>alllimit,
             );
             compaction.grandparents = <span class="prelude-val">Some</span>(grandparents);
         }

         <span class="macro">log!</span>(
             <span class="self">self</span>.opt.log,
             <span class="string">&quot;Compacting @{} {:?} .. {:?}&quot;</span>,
             level,
             smallest,
             largest
         );

         compaction.edit().set_compact_pointer(level, <span class="kw-2">&amp;</span>largest);
         <span class="self">self</span>.compaction_ptrs[level] = largest;
     }

     <span class="doccomment">/// write_snapshot writes the current version, with all files, to the manifest.
     </span><span class="kw">fn </span>write_snapshot(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Result</span>&lt;usize&gt; {
         <span class="macro">assert!</span>(<span class="self">self</span>.descriptor_log.is_some());

         <span class="kw">let </span><span class="kw-2">mut </span>edit = VersionEdit::new();
         edit.set_comparator_name(<span class="self">self</span>.opt.cmp.id());

         <span class="comment">// Save compaction pointers.
         </span><span class="kw">for </span>level <span class="kw">in </span><span class="number">0</span>..NUM_LEVELS {
             <span class="kw">if </span>!<span class="self">self</span>.compaction_ptrs[level].is_empty() {
                 edit.set_compact_pointer(level, <span class="kw-2">&amp;</span><span class="self">self</span>.compaction_ptrs[level]);
             }
         }

         <span class="kw">let </span>current = <span class="self">self</span>.current.as_ref().unwrap().borrow();
         <span class="comment">// Save files.
         </span><span class="kw">for </span>level <span class="kw">in </span><span class="number">0</span>..NUM_LEVELS {
             <span class="kw">let </span>fs = <span class="kw-2">&amp;</span>current.files[level];
             <span class="kw">for </span>f <span class="kw">in </span>fs {
                 edit.add_file(level, f.borrow().clone());
             }
         }
         <span class="self">self</span>.descriptor_log
             .as_mut()
             .unwrap()
             .add_record(<span class="kw-2">&amp;</span>edit.encode())
     }

     <span class="doccomment">/// log_and_apply merges the given edit with the current state and generates a new version. It
     /// writes the VersionEdit to the manifest.
     </span><span class="kw">pub fn </span>log_and_apply(<span class="kw-2">&amp;mut </span><span class="self">self</span>, <span class="kw-2">mut </span>edit: VersionEdit) -&gt; <span class="prelude-ty">Result</span>&lt;()&gt; {
         <span class="macro">assert!</span>(<span class="self">self</span>.current.is_some());

         <span class="kw">if </span>edit.log_number.is_none() {
             edit.set_log_num(<span class="self">self</span>.log_num);
         } <span class="kw">else </span>{
             <span class="macro">assert!</span>(edit.log_number.unwrap() &gt;= <span class="self">self</span>.log_num);
             <span class="macro">assert!</span>(edit.log_number.unwrap() &lt; <span class="self">self</span>.next_file_num);
         }
         <span class="kw">if </span>edit.prev_log_number.is_none() {
             edit.set_prev_log_num(<span class="self">self</span>.prev_log_num);
         }
         edit.set_next_file(<span class="self">self</span>.next_file_num);
         edit.set_last_seq(<span class="self">self</span>.last_seq);

         <span class="kw">let </span><span class="kw-2">mut </span>v = Version::new(<span class="self">self</span>.cache.clone(), <span class="self">self</span>.opt.cmp.clone());
         {
             <span class="kw">let </span><span class="kw-2">mut </span>builder = Builder::new();
             builder.apply(<span class="kw-2">&amp;</span>edit, <span class="kw-2">&amp;mut </span><span class="self">self</span>.compaction_ptrs);
             builder.save_to(<span class="kw-2">&amp;</span><span class="self">self</span>.cmp, <span class="self">self</span>.current.as_ref().unwrap(), <span class="kw-2">&amp;mut </span>v);
         }
         <span class="self">self</span>.finalize(<span class="kw-2">&amp;mut </span>v);

         <span class="kw">if </span><span class="self">self</span>.descriptor_log.is_none() {
             <span class="kw">let </span>descname = manifest_file_name(<span class="kw-2">&amp;</span><span class="self">self</span>.dbname, <span class="self">self</span>.manifest_num);
             edit.set_next_file(<span class="self">self</span>.next_file_num);
             <span class="self">self</span>.descriptor_log = <span class="prelude-val">Some</span>(LogWriter::new(
                 <span class="self">self</span>.opt.env.open_writable_file(Path::new(<span class="kw-2">&amp;</span>descname))<span class="question-mark">?</span>,
             ));
             <span class="self">self</span>.write_snapshot()<span class="question-mark">?</span>;
         }

         <span class="kw">let </span>encoded = edit.encode();
         <span class="kw">if let </span><span class="prelude-val">Some</span>(<span class="kw-2">ref mut </span>lw) = <span class="self">self</span>.descriptor_log {
             lw.add_record(<span class="kw-2">&amp;</span>encoded)<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>.dbname, <span class="self">self</span>.manifest_num)<span class="question-mark">?</span>;

         <span class="self">self</span>.add_version(v);
         <span class="comment">// log_number was set above.
         </span><span class="self">self</span>.log_num = edit.log_number.unwrap();

         <span class="comment">// TODO: Roll back written files if something went wrong.
         </span><span class="prelude-val">Ok</span>(())
     }

     <span class="kw">fn </span>finalize(<span class="kw-2">&amp;</span><span class="self">self</span>, v: <span class="kw-2">&amp;mut </span>Version) {
         <span class="kw">let </span><span class="kw-2">mut </span>best_lvl = <span class="prelude-val">None</span>;
         <span class="kw">let </span><span class="kw-2">mut </span>best_score = <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="number">1 </span>{
             <span class="kw">let </span>score: f64;
             <span class="kw">if </span>l == <span class="number">0 </span>{
                 score = v.files[l].len() <span class="kw">as </span>f64 / <span class="number">4.0</span>;
             } <span class="kw">else </span>{
                 <span class="kw">let </span><span class="kw-2">mut </span>max_bytes = <span class="number">10.0 </span>* f64::from(<span class="number">1 </span>&lt;&lt; <span class="number">20</span>);
                 <span class="kw">for _ in </span><span class="number">0</span>..l - <span class="number">1 </span>{
                     max_bytes <span class="kw-2">*</span>= <span class="number">10.0</span>;
                 }
                 score = total_size(v.files[l].iter()) <span class="kw">as </span>f64 / max_bytes;
             }
             <span class="kw">if let </span><span class="prelude-val">Some</span>(<span class="kw-2">ref mut </span>b) = best_score {
                 <span class="kw">if </span><span class="kw-2">*</span>b &lt; score {
                     <span class="kw-2">*</span>b = score;
                     best_lvl = <span class="prelude-val">Some</span>(l);
                 }
             } <span class="kw">else </span>{
                 best_score = <span class="prelude-val">Some</span>(score);
                 best_lvl = <span class="prelude-val">Some</span>(l);
             }
         }
         v.compaction_score = best_score;
         v.compaction_level = best_lvl;
     }

     <span class="doccomment">/// recover recovers the state of a LevelDB instance from the files on disk. If recover()
     /// returns true, the a manifest needs to be written eventually (using log_and_apply()).
     </span><span class="kw">pub fn </span>recover(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; <span class="prelude-ty">Result</span>&lt;bool&gt; {
         <span class="macro">assert!</span>(<span class="self">self</span>.current.is_some());

         <span class="kw">let </span><span class="kw-2">mut </span>current = 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>.dbname)<span class="question-mark">?</span>;
         <span class="kw">let </span>len = current.len();
         current.truncate(len - <span class="number">1</span>);
         <span class="kw">let </span>current = Path::new(<span class="kw-2">&amp;</span>current);

         <span class="kw">let </span>descfilename = <span class="self">self</span>.dbname.join(current);
         <span class="kw">let </span><span class="kw-2">mut </span>builder = Builder::new();
         {
             <span class="kw">let </span><span class="kw-2">mut </span>descfile = <span class="self">self
                 </span>.opt
                 .env
                 .open_sequential_file(Path::new(<span class="kw-2">&amp;</span>descfilename))<span class="question-mark">?</span>;
             <span class="kw">let </span><span class="kw-2">mut </span>logreader = LogReader::new(
                 <span class="kw-2">&amp;mut </span>descfile,
                 <span class="comment">// checksum=
                 </span><span class="bool-val">true</span>,
             );

             <span class="kw">let </span><span class="kw-2">mut </span>log_number = <span class="prelude-val">None</span>;
             <span class="kw">let </span><span class="kw-2">mut </span>prev_log_number = <span class="prelude-val">None</span>;
             <span class="kw">let </span><span class="kw-2">mut </span>next_file_number = <span class="prelude-val">None</span>;
             <span class="kw">let </span><span class="kw-2">mut </span>last_seq = <span class="prelude-val">None</span>;

             <span class="kw">let </span><span class="kw-2">mut </span>buf = Vec::new();
             <span class="kw">while let </span><span class="prelude-val">Ok</span>(size) = logreader.read(<span class="kw-2">&amp;mut </span>buf) {
                 <span class="kw">if </span>size == <span class="number">0 </span>{
                     <span class="kw">break</span>;
                 }
                 <span class="kw">let </span>edit = VersionEdit::decode_from(<span class="kw-2">&amp;</span>buf)<span class="question-mark">?</span>;
                 builder.apply(<span class="kw-2">&amp;</span>edit, <span class="kw-2">&amp;mut </span><span class="self">self</span>.compaction_ptrs);
                 <span class="kw">if let </span><span class="prelude-val">Some</span>(ln) = edit.log_number {
                     log_number = <span class="prelude-val">Some</span>(ln);
                 }
                 <span class="kw">if let </span><span class="prelude-val">Some</span>(nfn) = edit.next_file_number {
                     next_file_number = <span class="prelude-val">Some</span>(nfn);
                 }
                 <span class="kw">if let </span><span class="prelude-val">Some</span>(ls) = edit.last_seq {
                     last_seq = <span class="prelude-val">Some</span>(ls);
                 }
                 <span class="kw">if let </span><span class="prelude-val">Some</span>(pln) = edit.prev_log_number {
                     prev_log_number = <span class="prelude-val">Some</span>(pln);
                 }
             }

             <span class="kw">if let </span><span class="prelude-val">Some</span>(ln) = log_number {
                 <span class="self">self</span>.log_num = ln;
                 <span class="self">self</span>.mark_file_number_used(ln);
             } <span class="kw">else </span>{
                 <span class="kw">return </span>err(
                     StatusCode::Corruption,
                     <span class="string">&quot;no meta-lognumber entry in descriptor&quot;</span>,
                 );
             }
             <span class="kw">if let </span><span class="prelude-val">Some</span>(nfn) = next_file_number {
                 <span class="self">self</span>.next_file_num = nfn + <span class="number">1</span>;
             } <span class="kw">else </span>{
                 <span class="kw">return </span>err(
                     StatusCode::Corruption,
                     <span class="string">&quot;no meta-next-file entry in descriptor&quot;</span>,
                 );
             }
             <span class="kw">if let </span><span class="prelude-val">Some</span>(ls) = last_seq {
                 <span class="self">self</span>.last_seq = ls;
             } <span class="kw">else </span>{
                 <span class="kw">return </span>err(
                     StatusCode::Corruption,
                     <span class="string">&quot;no last-sequence entry in descriptor&quot;</span>,
                 );
             }
             <span class="kw">if let </span><span class="prelude-val">Some</span>(pln) = prev_log_number {
                 <span class="self">self</span>.prev_log_num = pln;
                 <span class="self">self</span>.mark_file_number_used(prev_log_number.unwrap());
             } <span class="kw">else </span>{
                 <span class="self">self</span>.prev_log_num = <span class="number">0</span>;
             }
         }

         <span class="kw">let </span><span class="kw-2">mut </span>v = Version::new(<span class="self">self</span>.cache.clone(), <span class="self">self</span>.opt.cmp.clone());
         builder.save_to(<span class="kw-2">&amp;</span><span class="self">self</span>.cmp, <span class="self">self</span>.current.as_ref().unwrap(), <span class="kw-2">&amp;mut </span>v);
         <span class="self">self</span>.finalize(<span class="kw-2">&amp;mut </span>v);
         <span class="self">self</span>.add_version(v);
         <span class="self">self</span>.manifest_num = <span class="self">self</span>.next_file_num - <span class="number">1</span>;
         <span class="macro">log!</span>(
             <span class="self">self</span>.opt.log,
             <span class="string">&quot;Recovered manifest with next_file={} manifest_num={} log_num={} prev_log_num={} \
              last_seq={}&quot;</span>,
             <span class="self">self</span>.next_file_num,
             <span class="self">self</span>.manifest_num,
             <span class="self">self</span>.log_num,
             <span class="self">self</span>.prev_log_num,
             <span class="self">self</span>.last_seq
         );

         <span class="comment">// A new manifest needs to be written only if we don&#39;t reuse the existing one.
         </span><span class="prelude-val">Ok</span>(!<span class="self">self</span>.reuse_manifest(<span class="kw-2">&amp;</span>descfilename, <span class="kw-2">&amp;</span>current))
     }

     <span class="doccomment">/// reuse_manifest checks whether the current manifest can be reused.
     </span><span class="kw">fn </span>reuse_manifest(
         <span class="kw-2">&amp;mut </span><span class="self">self</span>,
         current_manifest_path: <span class="kw-2">&amp;</span>Path,
         current_manifest_base: <span class="kw-2">&amp;</span>Path,
     ) -&gt; bool {
         <span class="comment">// Note: The original has only one option, reuse_logs; reuse_logs has to be set in order to
         // reuse manifests.
         // However, there&#39;s not much that stops us from reusing manifests without reusing logs or
         // vice versa. One issue exists though: If no write operations are done, empty log files
         // will accumulate every time a DB is opened, until at least one write happens (otherwise,
         // the logs won&#39;t be compacted and deleted).
         </span><span class="kw">if </span>!<span class="self">self</span>.opt.reuse_manifest {
             <span class="kw">return </span><span class="bool-val">false</span>;
         }
         <span class="comment">// The original doesn&#39;t reuse manifests; we do.
         </span><span class="kw">if let </span><span class="prelude-val">Ok</span>((num, typ)) = parse_file_name(current_manifest_base) {
             <span class="kw">if </span>typ != FileType::Descriptor {
                 <span class="kw">return </span><span class="bool-val">false</span>;
             }
             <span class="kw">if let </span><span class="prelude-val">Ok</span>(size) = <span class="self">self</span>.opt.env.size_of(Path::new(current_manifest_path)) {
                 <span class="kw">if </span>size &gt; <span class="self">self</span>.opt.max_file_size {
                     <span class="kw">return </span><span class="bool-val">false</span>;
                 }
             } <span class="kw">else </span>{
                 <span class="kw">return </span><span class="bool-val">false</span>;
             }

             <span class="macro">assert!</span>(<span class="self">self</span>.descriptor_log.is_none());
             <span class="kw">let </span>s = <span class="self">self
                 </span>.opt
                 .env
                 .open_appendable_file(Path::new(current_manifest_path));
             <span class="kw">if let </span><span class="prelude-val">Ok</span>(f) = s {
                 <span class="macro">log!</span>(<span class="self">self</span>.opt.log, <span class="string">&quot;reusing manifest {:?}&quot;</span>, current_manifest_path);
                 <span class="self">self</span>.descriptor_log = <span class="prelude-val">Some</span>(LogWriter::new(f));
                 <span class="self">self</span>.manifest_num = num;
                 <span class="kw">return </span><span class="bool-val">true</span>;
             } <span class="kw">else </span>{
                 <span class="macro">log!</span>(<span class="self">self</span>.opt.log, <span class="string">&quot;reuse_manifest: {}&quot;</span>, s.err().unwrap());
             }
         }
         <span class="bool-val">false
     </span>}

     <span class="doccomment">/// make_input_iterator returns an iterator over the inputs of a compaction.
     </span><span class="kw">pub fn </span>make_input_iterator(<span class="kw-2">&amp;</span><span class="self">self</span>, c: <span class="kw-2">&amp;</span>Compaction) -&gt; Box&lt;<span class="kw">dyn </span>LdbIterator&gt; {
         <span class="kw">let </span>cap = <span class="kw">if </span>c.level == <span class="number">0 </span>{ c.num_inputs(<span class="number">0</span>) + <span class="number">1 </span>} <span class="kw">else </span>{ <span class="number">2 </span>};
         <span class="kw">let </span><span class="kw-2">mut </span>iters: Vec&lt;Box&lt;<span class="kw">dyn </span>LdbIterator&gt;&gt; = Vec::with_capacity(cap);
         <span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..<span class="number">2 </span>{
             <span class="kw">if </span>c.num_inputs(i) == <span class="number">0 </span>{
                 <span class="kw">continue</span>;
             }
             <span class="kw">if </span>c.level + i == <span class="number">0 </span>{
                 <span class="comment">// Add individual iterators for L0 tables.
                 </span><span class="kw">for </span>fi <span class="kw">in </span><span class="number">0</span>..c.num_inputs(i) {
                     <span class="kw">let </span>f = <span class="kw-2">&amp;</span>c.inputs[i][fi];
                     <span class="kw">let </span>s = <span class="self">self</span>.cache.borrow_mut().get_table(f.borrow().num);
                     <span class="kw">if let </span><span class="prelude-val">Ok</span>(tbl) = s {
                         iters.push(Box::new(tbl.iter()));
                     } <span class="kw">else </span>{
                         <span class="macro">log!</span>(
                             <span class="self">self</span>.opt.log,
                             <span class="string">&quot;error opening table {}: {}&quot;</span>,
                             f.borrow().num,
                             s.err().unwrap()
                         );
                     }
                 }
             } <span class="kw">else </span>{
                 <span class="comment">// Create concatenating iterator higher levels.
                 </span>iters.push(Box::new(new_version_iter(
                     c.inputs[i].clone(),
                     <span class="self">self</span>.cache.clone(),
                     <span class="self">self</span>.opt.cmp.clone(),
                 )));
             }
         }
         <span class="macro">assert!</span>(iters.len() &lt;= cap);
         <span class="kw">let </span>cmp: Rc&lt;Box&lt;<span class="kw">dyn </span>Cmp&gt;&gt; = Rc::new(Box::new(<span class="self">self</span>.cmp.clone()));
         Box::new(MergingIter::new(cmp, iters))
     }
 }

 <span class="kw">struct </span>Builder {
     <span class="comment">// (added, deleted) files per level.
     </span>deleted: [Vec&lt;FileNum&gt;; NUM_LEVELS],
     added: [Vec&lt;FileMetaHandle&gt;; NUM_LEVELS],
 }

 <span class="kw">impl </span>Builder {
     <span class="kw">fn </span>new() -&gt; Builder {
         Builder {
             deleted: Default::default(),
             added: Default::default(),
         }
     }

     <span class="doccomment">/// apply applies the edits recorded in edit to the builder state. compaction pointers are
     /// copied to the supplied compaction_ptrs array.
     </span><span class="kw">fn </span>apply(<span class="kw-2">&amp;mut </span><span class="self">self</span>, edit: <span class="kw-2">&amp;</span>VersionEdit, compaction_ptrs: <span class="kw-2">&amp;mut </span>[Vec&lt;u8&gt;; NUM_LEVELS]) {
         <span class="kw">for </span>c <span class="kw">in </span>edit.compaction_ptrs.iter() {
             compaction_ptrs[c.level] = c.key.clone();
         }
         <span class="kw">for </span><span class="kw-2">&amp;</span>(level, num) <span class="kw">in </span>edit.deleted.iter() {
             <span class="self">self</span>.deleted[level].push(num);
         }
         <span class="kw">for </span><span class="kw-2">&amp;</span>(level, <span class="kw-2">ref </span>f) <span class="kw">in </span>edit.new_files.iter() {
             <span class="kw">let </span><span class="kw-2">mut </span>f = f.clone();
             f.allowed_seeks = f.size / <span class="number">16384</span>;
             <span class="kw">if </span>f.allowed_seeks &lt; <span class="number">100 </span>{
                 f.allowed_seeks = <span class="number">100</span>;
             }
             <span class="comment">// Remove this file from the list of deleted files.
             </span><span class="self">self</span>.deleted[level] = <span class="self">self</span>.deleted[level]
                 .iter()
                 .filter_map(|d| <span class="kw">if </span><span class="kw-2">*</span>d != f.num { <span class="prelude-val">Some</span>(<span class="kw-2">*</span>d) } <span class="kw">else </span>{ <span class="prelude-val">None </span>})
                 .collect();
             <span class="self">self</span>.added[level].push(share(f));
         }
     }

     <span class="doccomment">/// maybe_add_file adds a file f at level to version v, if it&#39;s not already marked as deleted
     /// in this edit. It also asserts that the ordering of files is preserved.
     </span><span class="kw">fn </span>maybe_add_file(
         <span class="kw-2">&amp;mut </span><span class="self">self</span>,
         cmp: <span class="kw-2">&amp;</span>InternalKeyCmp,
         v: <span class="kw-2">&amp;mut </span>Version,
         level: usize,
         f: FileMetaHandle,
     ) {
         <span class="comment">// Only add file if it&#39;s not already deleted.
         </span><span class="kw">if </span><span class="self">self</span>.deleted[level].iter().any(|d| <span class="kw-2">*</span>d == f.borrow().num) {
             <span class="kw">return</span>;
         }
         {
             <span class="kw">let </span>files = <span class="kw-2">&amp;</span>v.files[level];
             <span class="kw">if </span>level &gt; <span class="number">0 </span>&amp;&amp; !files.is_empty() {
                 <span class="comment">// File must be after last file in level.
                 </span><span class="macro">assert_eq!</span>(
                     cmp.cmp(
                         <span class="kw-2">&amp;</span>files[files.len() - <span class="number">1</span>].borrow().largest,
                         <span class="kw-2">&amp;</span>f.borrow().smallest
                     ),
                     Ordering::Less
                 );
             }
         }
         v.files[level].push(f);
     }

     <span class="doccomment">/// save_to saves the edits applied to the builder to v, adding all non-deleted files from
     /// Version base to v.
     </span><span class="kw">fn </span>save_to(<span class="kw-2">&amp;mut </span><span class="self">self</span>, cmp: <span class="kw-2">&amp;</span>InternalKeyCmp, base: <span class="kw-2">&amp;</span>Shared&lt;Version&gt;, v: <span class="kw-2">&amp;mut </span>Version) {
         <span class="kw">for </span>level <span class="kw">in </span><span class="number">0</span>..NUM_LEVELS {
             sort_files_by_smallest(cmp, <span class="kw-2">&amp;mut </span><span class="self">self</span>.added[level]);
             <span class="comment">// The base version should already have sorted files.
             </span>sort_files_by_smallest(cmp, <span class="kw-2">&amp;mut </span>base.borrow_mut().files[level]);

             <span class="kw">let </span>added = <span class="self">self</span>.added[level].clone();
             <span class="kw">let </span>basefiles = base.borrow().files[level].clone();
             v.files[level].reserve(basefiles.len() + <span class="self">self</span>.added[level].len());

             <span class="kw">let </span>iadded = added.into_iter();
             <span class="kw">let </span>ibasefiles = basefiles.into_iter();
             <span class="kw">let </span>merged = merge_iters(iadded, ibasefiles, |a, b| {
                 cmp.cmp(<span class="kw-2">&amp;</span>a.borrow().smallest, <span class="kw-2">&amp;</span>b.borrow().smallest)
             });
             <span class="kw">for </span>m <span class="kw">in </span>merged {
                 <span class="self">self</span>.maybe_add_file(cmp, v, level, m);
             }

             <span class="comment">// Make sure that there is no overlap in higher levels.
             </span><span class="kw">if </span>level == <span class="number">0 </span>{
                 <span class="kw">continue</span>;
             }
             <span class="kw">for </span>i <span class="kw">in </span><span class="number">1</span>..v.files[level].len() {
                 <span class="kw">let </span>(prev_end, this_begin) = (
                     <span class="kw-2">&amp;</span>v.files[level][i - <span class="number">1</span>].borrow().largest,
                     <span class="kw-2">&amp;</span>v.files[level][i].borrow().smallest,
                 );
                 <span class="macro">assert!</span>(cmp.cmp(prev_end, this_begin) &lt; Ordering::Equal);
             }
         }
     }
 }

 <span class="kw">fn </span>manifest_name(file_num: FileNum) -&gt; PathBuf {
     Path::new(<span class="kw-2">&amp;</span><span class="macro">format!</span>(<span class="string">&quot;MANIFEST-{:06}&quot;</span>, file_num)).to_owned()
 }

 <span class="kw">pub fn </span>manifest_file_name&lt;P: AsRef&lt;Path&gt;&gt;(dbname: P, file_num: FileNum) -&gt; PathBuf {
     dbname.as_ref().join(manifest_name(file_num)).to_owned()
 }

 <span class="kw">fn </span>temp_file_name&lt;P: AsRef&lt;Path&gt;&gt;(dbname: P, file_num: FileNum) -&gt; PathBuf {
     dbname
         .as_ref()
         .join(<span class="macro">format!</span>(<span class="string">&quot;{:06}.dbtmp&quot;</span>, file_num))
         .to_owned()
 }

 <span class="kw">fn </span>current_file_name&lt;P: AsRef&lt;Path&gt;&gt;(dbname: P) -&gt; PathBuf {
     dbname.as_ref().join(<span class="string">&quot;CURRENT&quot;</span>).to_owned()
 }

 <span class="kw">pub fn </span>read_current_file(env: <span class="kw-2">&amp;</span>Box&lt;<span class="kw">dyn </span>Env&gt;, dbname: <span class="kw-2">&amp;</span>Path) -&gt; <span class="prelude-ty">Result</span>&lt;String&gt; {
     <span class="kw">let </span><span class="kw-2">mut </span>current = String::new();
     <span class="kw">let </span><span class="kw-2">mut </span>f = env.open_sequential_file(Path::new(<span class="kw-2">&amp;</span>current_file_name(dbname)))<span class="question-mark">?</span>;
     f.read_to_string(<span class="kw-2">&amp;mut </span>current)<span class="question-mark">?</span>;
     <span class="kw">if </span>current.is_empty() || !current.ends_with(<span class="string">&#39;\n&#39;</span>) {
         <span class="kw">return </span>err(
             StatusCode::Corruption,
             <span class="string">&quot;current file is empty or has no newline&quot;</span>,
         );
     }
     <span class="prelude-val">Ok</span>(current)
 }

 <span class="kw">pub fn </span>set_current_file&lt;P: AsRef&lt;Path&gt;&gt;(
     env: <span class="kw-2">&amp;</span>Box&lt;<span class="kw">dyn </span>Env&gt;,
     dbname: P,
     manifest_file_num: FileNum,
 ) -&gt; <span class="prelude-ty">Result</span>&lt;()&gt; {
     <span class="kw">let </span>dbname = dbname.as_ref();
     <span class="kw">let </span>manifest_base = manifest_name(manifest_file_num);
     <span class="kw">let </span>tempfile = temp_file_name(dbname, manifest_file_num);
     {
         <span class="kw">let </span><span class="kw-2">mut </span>f = env.open_writable_file(Path::new(<span class="kw-2">&amp;</span>tempfile))<span class="question-mark">?</span>;
         f.write_all(manifest_base.as_os_str().as_bytes())<span class="question-mark">?</span>;
         f.write_all(<span class="string">&quot;\n&quot;</span>.as_bytes())<span class="question-mark">?</span>;
     }
     <span class="kw">let </span>currentfile = current_file_name(dbname);
     <span class="kw">if let </span><span class="prelude-val">Err</span>(e) = env.rename(Path::new(<span class="kw-2">&amp;</span>tempfile), Path::new(<span class="kw-2">&amp;</span>currentfile)) {
         <span class="comment">// ignore error.
         </span><span class="kw">let _ </span>= env.delete(Path::new(<span class="kw-2">&amp;</span>tempfile));
         <span class="kw">return </span><span class="prelude-val">Err</span>(Status::from(e));
     }
     <span class="prelude-val">Ok</span>(())
 }

 <span class="doccomment">/// sort_files_by_smallest sorts the list of files by the smallest keys of the files.
 </span><span class="kw">fn </span>sort_files_by_smallest&lt;C: Cmp&gt;(cmp: <span class="kw-2">&amp;</span>C, files: <span class="kw-2">&amp;mut </span>Vec&lt;FileMetaHandle&gt;) {
     files.sort_by(|a, b| cmp.cmp(<span class="kw-2">&amp;</span>a.borrow().smallest, <span class="kw-2">&amp;</span>b.borrow().smallest))
 }

 <span class="doccomment">/// merge_iters merges and collects the items from two sorted iterators.
 </span><span class="kw">fn </span>merge_iters&lt;
     Item,
     C: Fn(<span class="kw-2">&amp;</span>Item, <span class="kw-2">&amp;</span>Item) -&gt; Ordering,
     I: Iterator&lt;Item = Item&gt;,
     J: Iterator&lt;Item = Item&gt;,
 &gt;(
     <span class="kw-2">mut </span>iter_a: I,
     <span class="kw-2">mut </span>iter_b: J,
     cmp: C,
 ) -&gt; Vec&lt;Item&gt; {
     <span class="kw">let </span><span class="kw-2">mut </span>a = iter_a.next();
     <span class="kw">let </span><span class="kw-2">mut </span>b = iter_b.next();
     <span class="kw">let </span><span class="kw-2">mut </span>out = <span class="macro">vec!</span>[];
     <span class="kw">while </span>a.is_some() &amp;&amp; b.is_some() {
         <span class="kw">let </span>ord = cmp(a.as_ref().unwrap(), b.as_ref().unwrap());
         <span class="kw">if </span>ord == Ordering::Less {
             out.push(a.unwrap());
             a = iter_a.next();
         } <span class="kw">else </span>{
             out.push(b.unwrap());
             b = iter_b.next();
         }
     }

     <span class="comment">// Push cached elements.
     </span><span class="kw">if let </span><span class="prelude-val">Some</span>(a_) = a {
         out.push(a_);
     }
     <span class="kw">if let </span><span class="prelude-val">Some</span>(b_) = b {
         out.push(b_);
     }

     <span class="comment">// Push remaining elements from either iterator.
     </span><span class="kw">for </span>a <span class="kw">in </span>iter_a {
         out.push(a);
     }
     <span class="kw">for </span>b <span class="kw">in </span>iter_b {
         out.push(b);
     }
     out
 }

 <span class="doccomment">/// get_range returns the indices of the files within files that have the smallest lower bound
 /// respectively the largest upper bound.
 </span><span class="kw">fn </span>get_range&lt;<span class="lifetime">&#39;a</span>, C: Cmp, I: Iterator&lt;Item = <span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>FileMetaHandle&gt;&gt;(
     c: <span class="kw-2">&amp;</span>C,
     files: I,
 ) -&gt; (Vec&lt;u8&gt;, Vec&lt;u8&gt;) {
     <span class="kw">let </span><span class="kw-2">mut </span>smallest = <span class="prelude-val">None</span>;
     <span class="kw">let </span><span class="kw-2">mut </span>largest = <span class="prelude-val">None</span>;
     <span class="kw">for </span>f <span class="kw">in </span>files {
         <span class="kw">if </span>smallest.is_none() {
             smallest = <span class="prelude-val">Some</span>(f.borrow().smallest.clone());
         }
         <span class="kw">if </span>largest.is_none() {
             largest = <span class="prelude-val">Some</span>(f.borrow().largest.clone());
         }
         <span class="kw">let </span>f = f.borrow();
         <span class="kw">if </span>c.cmp(<span class="kw-2">&amp;</span>f.smallest, smallest.as_ref().unwrap()) == Ordering::Less {
             smallest = <span class="prelude-val">Some</span>(f.smallest.clone());
         }
         <span class="kw">if </span>c.cmp(<span class="kw-2">&amp;</span>f.largest, largest.as_ref().unwrap()) == Ordering::Greater {
             largest = <span class="prelude-val">Some</span>(f.largest.clone());
         }
     }
     (smallest.unwrap(), largest.unwrap())
 }

 <span class="attribute">#[cfg(feature = <span class="string">&quot;enclave_unit_test&quot;</span>)]
 </span><span class="kw">pub mod </span>tests {
     <span class="kw">use super</span>::<span class="kw-2">*</span>;
     <span class="kw">use </span><span class="kw">crate</span>::cmp::DefaultCmp;
     <span class="kw">use </span><span class="kw">crate</span>::key_types::LookupKey;
     <span class="kw">use </span><span class="kw">crate</span>::test_util::LdbIteratorIter;
     <span class="kw">use </span><span class="kw">crate</span>::types::FileMetaData;
     <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_version_set_merge_iters,
             test_version_set_total_size,
             test_version_set_get_range,
             test_version_set_builder,
             test_version_set_log_and_apply,
             test_version_set_utils,
             test_version_set_pick_compaction,
             test_version_set_compaction,
         )
     }

     <span class="kw">fn </span>example_files() -&gt; Vec&lt;FileMetaHandle&gt; {
         <span class="kw">let </span><span class="kw-2">mut </span>f1 = FileMetaData::default();
         f1.num = <span class="number">1</span>;
         f1.size = <span class="number">10</span>;
         f1.smallest = <span class="string">&quot;f&quot;</span>.as_bytes().to_vec();
         f1.largest = <span class="string">&quot;g&quot;</span>.as_bytes().to_vec();
         <span class="kw">let </span><span class="kw-2">mut </span>f2 = FileMetaData::default();
         f2.num = <span class="number">2</span>;
         f2.size = <span class="number">20</span>;
         f2.smallest = <span class="string">&quot;e&quot;</span>.as_bytes().to_vec();
         f2.largest = <span class="string">&quot;f&quot;</span>.as_bytes().to_vec();
         <span class="kw">let </span><span class="kw-2">mut </span>f3 = FileMetaData::default();
         f3.num = <span class="number">3</span>;
         f3.size = <span class="number">30</span>;
         f3.smallest = <span class="string">&quot;a&quot;</span>.as_bytes().to_vec();
         f3.largest = <span class="string">&quot;b&quot;</span>.as_bytes().to_vec();
         <span class="kw">let </span><span class="kw-2">mut </span>f4 = FileMetaData::default();
         f4.num = <span class="number">4</span>;
         f4.size = <span class="number">40</span>;
         f4.smallest = <span class="string">&quot;q&quot;</span>.as_bytes().to_vec();
         f4.largest = <span class="string">&quot;z&quot;</span>.as_bytes().to_vec();
         <span class="macro">vec!</span>[f1, f2, f3, f4].into_iter().map(share).collect()
     }

     <span class="kw">fn </span>test_version_set_merge_iters() {
         <span class="kw">let </span>v1 = <span class="macro">vec!</span>[<span class="number">2</span>, <span class="number">4</span>, <span class="number">6</span>, <span class="number">8</span>, <span class="number">10</span>];
         <span class="kw">let </span>v2 = <span class="macro">vec!</span>[<span class="number">1</span>, <span class="number">3</span>, <span class="number">5</span>, <span class="number">7</span>];
         <span class="macro">assert_eq!</span>(
             <span class="macro">vec!</span>[<span class="number">1</span>, <span class="number">2</span>, <span class="number">3</span>, <span class="number">4</span>, <span class="number">5</span>, <span class="number">6</span>, <span class="number">7</span>, <span class="number">8</span>, <span class="number">10</span>],
             merge_iters(v1.into_iter(), v2.into_iter(), |a, b| a.cmp(<span class="kw-2">&amp;</span>b))
         );
     }

     <span class="kw">fn </span>test_version_set_total_size() {
         <span class="macro">assert_eq!</span>(<span class="number">100</span>, total_size(example_files().iter()));
     }

     <span class="kw">fn </span>test_version_set_get_range() {
         <span class="kw">let </span>cmp = DefaultCmp;
         <span class="kw">let </span>fs = example_files();
         <span class="macro">assert_eq!</span>(
             (<span class="string">&quot;a&quot;</span>.as_bytes().to_vec(), <span class="string">&quot;z&quot;</span>.as_bytes().to_vec()),
             get_range(<span class="kw-2">&amp;</span>cmp, fs.iter())
         );
     }

     <span class="kw">fn </span>test_version_set_builder() {
         <span class="kw">let </span>(v, opt) = make_version();
         <span class="kw">let </span>v = share(v);

         <span class="kw">let </span><span class="kw-2">mut </span>fmd = FileMetaData::default();
         fmd.num = <span class="number">21</span>;
         fmd.size = <span class="number">123</span>;
         fmd.smallest = LookupKey::new(<span class="string">&quot;klm&quot;</span>.as_bytes(), <span class="number">777</span>)
             .internal_key()
             .to_vec();
         fmd.largest = LookupKey::new(<span class="string">&quot;kop&quot;</span>.as_bytes(), <span class="number">700</span>)
             .internal_key()
             .to_vec();

         <span class="kw">let </span><span class="kw-2">mut </span>ve = VersionEdit::new();
         ve.add_file(<span class="number">1</span>, fmd);
         <span class="comment">// This deletion should be undone by apply().
         </span>ve.delete_file(<span class="number">1</span>, <span class="number">21</span>);
         ve.delete_file(<span class="number">0</span>, <span class="number">2</span>);
         ve.set_compact_pointer(<span class="number">2</span>, LookupKey::new(<span class="string">&quot;xxx&quot;</span>.as_bytes(), <span class="number">123</span>).internal_key());

         <span class="kw">let </span><span class="kw-2">mut </span>b = Builder::new();
         <span class="kw">let </span><span class="kw-2">mut </span>ptrs: [Vec&lt;u8&gt;; NUM_LEVELS] = Default::default();
         b.apply(<span class="kw-2">&amp;</span>ve, <span class="kw-2">&amp;mut </span>ptrs);

         <span class="macro">assert_eq!</span>(
             <span class="kw-2">&amp;</span>[<span class="number">120 </span><span class="kw">as </span>u8, <span class="number">120</span>, <span class="number">120</span>, <span class="number">1</span>, <span class="number">123</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">0</span>],
             ptrs[<span class="number">2</span>].as_slice()
         );
         <span class="macro">assert_eq!</span>(<span class="number">2</span>, b.deleted[<span class="number">0</span>][<span class="number">0</span>]);
         <span class="macro">assert_eq!</span>(<span class="number">1</span>, b.added[<span class="number">1</span>].len());

         <span class="kw">let </span><span class="kw-2">mut </span>v2 = Version::new(
             share(TableCache::new(<span class="string">&quot;db&quot;</span>, opt.clone(), <span class="number">100</span>)),
             opt.cmp.clone(),
         );
         b.save_to(<span class="kw-2">&amp;</span>InternalKeyCmp(opt.cmp.clone()), <span class="kw-2">&amp;</span>v, <span class="kw-2">&amp;mut </span>v2);
         <span class="comment">// Second file in L0 was removed.
         </span><span class="macro">assert_eq!</span>(<span class="number">1</span>, v2.files[<span class="number">0</span>].len());
         <span class="comment">// File was added to L1.
         </span><span class="macro">assert_eq!</span>(<span class="number">4</span>, v2.files[<span class="number">1</span>].len());
         <span class="macro">assert_eq!</span>(<span class="number">21</span>, v2.files[<span class="number">1</span>][<span class="number">3</span>].borrow().num);
     }

     <span class="kw">fn </span>test_version_set_log_and_apply() {
         <span class="kw">let </span>(<span class="kw">_</span>, opt) = make_version();
         <span class="kw">let </span><span class="kw-2">mut </span>vs = VersionSet::new(
             <span class="string">&quot;db&quot;</span>,
             opt.clone(),
             share(TableCache::new(<span class="string">&quot;db&quot;</span>, opt.clone(), <span class="number">100</span>)),
         );

         <span class="macro">assert_eq!</span>(<span class="number">2</span>, vs.new_file_number());
         <span class="comment">// Simulate NewDB
         </span>{
             <span class="kw">let </span><span class="kw-2">mut </span>ve = VersionEdit::new();
             ve.set_comparator_name(<span class="string">&quot;leveldb.BytewiseComparator&quot;</span>);
             ve.set_log_num(<span class="number">10</span>);
             ve.set_next_file(<span class="number">20</span>);
             ve.set_last_seq(<span class="number">30</span>);

             <span class="comment">// Write first manifest to be recovered from.
             </span><span class="kw">let </span>manifest = manifest_file_name(<span class="string">&quot;db&quot;</span>, <span class="number">19</span>);
             <span class="kw">let </span>mffile = 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(mffile);
             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.as_ref(), <span class="string">&quot;db&quot;</span>, <span class="number">19</span>).unwrap();
         }

         <span class="comment">// Recover from new state.
         </span>{
             vs.recover().unwrap();
             <span class="macro">assert_eq!</span>(<span class="number">10</span>, vs.log_num);
             <span class="macro">assert_eq!</span>(<span class="number">21</span>, vs.next_file_num);
             <span class="macro">assert_eq!</span>(<span class="number">30</span>, vs.last_seq);
             <span class="macro">assert_eq!</span>(<span class="number">0</span>, vs.current.as_ref().unwrap().borrow().files[<span class="number">0</span>].len());
             <span class="macro">assert_eq!</span>(<span class="number">0</span>, vs.current.as_ref().unwrap().borrow().files[<span class="number">1</span>].len());
             <span class="macro">assert_eq!</span>(<span class="number">35</span>, vs.write_snapshot().unwrap());
         }

         <span class="comment">// Simulate compaction by adding a file.
         </span>{
             <span class="kw">let </span><span class="kw-2">mut </span>ve = VersionEdit::new();
             ve.set_log_num(<span class="number">11</span>);
             <span class="kw">let </span><span class="kw-2">mut </span>fmd = FileMetaData::default();
             fmd.num = <span class="number">21</span>;
             fmd.size = <span class="number">123</span>;
             fmd.smallest = LookupKey::new(<span class="string">&quot;abc&quot;</span>.as_bytes(), <span class="number">777</span>)
                 .internal_key()
                 .to_vec();
             fmd.largest = LookupKey::new(<span class="string">&quot;def&quot;</span>.as_bytes(), <span class="number">700</span>)
                 .internal_key()
                 .to_vec();
             ve.add_file(<span class="number">1</span>, fmd);
             vs.log_and_apply(ve).unwrap();

             <span class="macro">assert!</span>(opt.env.exists(Path::new(<span class="string">&quot;db/CURRENT&quot;</span>)).unwrap());
             <span class="macro">assert!</span>(opt.env.exists(Path::new(<span class="string">&quot;db/MANIFEST-000019&quot;</span>)).unwrap());
             <span class="comment">// next_file_num and last_seq are untouched by log_and_apply
             </span><span class="macro">assert_eq!</span>(<span class="number">21</span>, vs.new_file_number());
             <span class="macro">assert_eq!</span>(<span class="number">22</span>, vs.next_file_num);
             <span class="macro">assert_eq!</span>(<span class="number">30</span>, vs.last_seq);
             <span class="comment">// the following fields are touched by log_and_apply.
             </span><span class="macro">assert_eq!</span>(<span class="number">11</span>, vs.log_num);

             <span class="comment">// The previous &quot;compaction&quot; should have added one file to the first level in the
             // current version.
             </span><span class="macro">assert_eq!</span>(<span class="number">0</span>, vs.current.as_ref().unwrap().borrow().files[<span class="number">0</span>].len());
             <span class="macro">assert_eq!</span>(<span class="number">1</span>, vs.current.as_ref().unwrap().borrow().files[<span class="number">1</span>].len());
             <span class="macro">assert_eq!</span>(<span class="number">63</span>, vs.write_snapshot().unwrap());
         }
     }

     <span class="kw">fn </span>test_version_set_utils() {
         <span class="kw">let </span>(v, opt) = make_version();
         <span class="kw">let </span><span class="kw-2">mut </span>vs = VersionSet::new(<span class="string">&quot;db&quot;</span>, opt.clone(), share(TableCache::new(<span class="string">&quot;db&quot;</span>, opt, <span class="number">100</span>)));
         vs.add_version(v);
         <span class="comment">// live_files()
         </span><span class="macro">assert_eq!</span>(<span class="number">9</span>, vs.live_files().len());
         <span class="macro">assert!</span>(vs.live_files().contains(<span class="kw-2">&amp;</span><span class="number">3</span>));

         <span class="kw">let </span>v = vs.current();
         <span class="kw">let </span>v = v.borrow();
         <span class="comment">// num_level_bytes()
         </span><span class="macro">assert_eq!</span>(<span class="number">483</span>, v.num_level_bytes(<span class="number">0</span>));
         <span class="macro">assert_eq!</span>(<span class="number">651</span>, v.num_level_bytes(<span class="number">1</span>));
         <span class="macro">assert_eq!</span>(<span class="number">468</span>, v.num_level_bytes(<span class="number">2</span>));
         <span class="comment">// num_level_files()
         </span><span class="macro">assert_eq!</span>(<span class="number">2</span>, v.num_level_files(<span class="number">0</span>));
         <span class="macro">assert_eq!</span>(<span class="number">3</span>, v.num_level_files(<span class="number">1</span>));
         <span class="macro">assert_eq!</span>(<span class="number">2</span>, v.num_level_files(<span class="number">2</span>));
         <span class="comment">// new_file_number()
         </span><span class="macro">assert_eq!</span>(<span class="number">2</span>, vs.new_file_number());
         <span class="macro">assert_eq!</span>(<span class="number">3</span>, vs.new_file_number());
     }

     <span class="kw">fn </span>test_version_set_pick_compaction() {
         <span class="kw">let </span>(<span class="kw-2">mut </span>v, opt) = make_version();
         <span class="kw">let </span><span class="kw-2">mut </span>vs = VersionSet::new(<span class="string">&quot;db&quot;</span>, opt.clone(), share(TableCache::new(<span class="string">&quot;db&quot;</span>, opt, <span class="number">100</span>)));

         v.compaction_score = <span class="prelude-val">Some</span>(<span class="number">2.0</span>);
         v.compaction_level = <span class="prelude-val">Some</span>(<span class="number">0</span>);
         vs.add_version(v);

         <span class="comment">// Size compaction
         </span>{
             <span class="kw">let </span>c = vs.pick_compaction().unwrap();
             <span class="macro">assert_eq!</span>(<span class="number">2</span>, c.inputs[<span class="number">0</span>].len());
             <span class="macro">assert_eq!</span>(<span class="number">1</span>, c.inputs[<span class="number">1</span>].len());
             <span class="macro">assert_eq!</span>(<span class="number">0</span>, c.level);
             <span class="macro">assert!</span>(c.input_version.is_some());
         }
         <span class="comment">// Seek compaction
         </span>{
             <span class="kw">let </span>current = vs.current();
             current.borrow_mut().compaction_score = <span class="prelude-val">None</span>;
             current.borrow_mut().compaction_level = <span class="prelude-val">None</span>;
             current.borrow_mut().file_to_compact_lvl = <span class="number">1</span>;

             <span class="kw">let </span>fmd = current.borrow().files[<span class="number">1</span>][<span class="number">0</span>].clone();
             current.borrow_mut().file_to_compact = <span class="prelude-val">Some</span>(fmd);

             <span class="kw">let </span>c = vs.pick_compaction().unwrap();
             <span class="macro">assert_eq!</span>(<span class="number">3</span>, c.inputs[<span class="number">0</span>].len()); <span class="comment">// inputs on l+0 are expanded.
             </span><span class="macro">assert_eq!</span>(<span class="number">1</span>, c.inputs[<span class="number">1</span>].len());
             <span class="macro">assert_eq!</span>(<span class="number">1</span>, c.level);
             <span class="macro">assert!</span>(c.input_version.is_some());
         }
     }

     <span class="doccomment">/// iterator_properties tests that it contains len elements and that they are ordered in
     /// ascending order by cmp.
     </span><span class="kw">fn </span>iterator_properties&lt;It: LdbIterator&gt;(<span class="kw-2">mut </span>it: It, len: usize, cmp: Rc&lt;Box&lt;<span class="kw">dyn </span>Cmp&gt;&gt;) {
         <span class="kw">let </span><span class="kw-2">mut </span>wr = LdbIteratorIter::wrap(<span class="kw-2">&amp;mut </span>it);
         <span class="kw">let </span>first = wr.next().unwrap();
         <span class="kw">let </span><span class="kw-2">mut </span>count = <span class="number">1</span>;
         wr.fold(first, |(a, <span class="kw">_</span>), (b, c)| {
             <span class="macro">assert_eq!</span>(Ordering::Less, cmp.cmp(<span class="kw-2">&amp;</span>a, <span class="kw-2">&amp;</span>b));
             count += <span class="number">1</span>;
             (b, c)
         });
         <span class="macro">assert_eq!</span>(len, count);
     }

     <span class="kw">fn </span>test_version_set_compaction() {
         <span class="kw">let </span>(v, opt) = make_version();
         <span class="kw">let </span><span class="kw-2">mut </span>vs = VersionSet::new(<span class="string">&quot;db&quot;</span>, opt.clone(), share(TableCache::new(<span class="string">&quot;db&quot;</span>, opt, <span class="number">100</span>)));
         vs.add_version(v);

         {
             <span class="comment">// approximate_offset()
             </span><span class="kw">let </span>v = vs.current();
             <span class="macro">assert_eq!</span>(
                 <span class="number">0</span>,
                 vs.approximate_offset(<span class="kw-2">&amp;</span>v, LookupKey::new(<span class="string">&quot;aaa&quot;</span>.as_bytes(), <span class="number">9000</span>).internal_key())
             );
             <span class="macro">assert_eq!</span>(
                 <span class="number">232</span>,
                 vs.approximate_offset(<span class="kw-2">&amp;</span>v, LookupKey::new(<span class="string">&quot;bab&quot;</span>.as_bytes(), <span class="number">9000</span>).internal_key())
             );
             <span class="macro">assert_eq!</span>(
                 <span class="number">1134</span>,
                 vs.approximate_offset(<span class="kw-2">&amp;</span>v, LookupKey::new(<span class="string">&quot;fab&quot;</span>.as_bytes(), <span class="number">9000</span>).internal_key())
             );
         }
         <span class="comment">// The following tests reuse the same version set and verify that various compactions work
         // like they should.
         </span>{
             <span class="comment">// compact level 0 with a partial range.
             </span><span class="kw">let </span>from = LookupKey::new(<span class="string">&quot;000&quot;</span>.as_bytes(), <span class="number">1000</span>);
             <span class="kw">let </span>to = LookupKey::new(<span class="string">&quot;ab&quot;</span>.as_bytes(), <span class="number">1010</span>);
             <span class="kw">let </span>c = vs
                 .compact_range(<span class="number">0</span>, from.internal_key(), to.internal_key())
                 .unwrap();
             <span class="macro">assert_eq!</span>(<span class="number">2</span>, c.inputs[<span class="number">0</span>].len());
             <span class="macro">assert_eq!</span>(<span class="number">1</span>, c.inputs[<span class="number">1</span>].len());
             <span class="macro">assert_eq!</span>(<span class="number">1</span>, c.grandparents.unwrap().len());

             <span class="comment">// compact level 0, but entire range of keys in version.
             </span><span class="kw">let </span>from = LookupKey::new(<span class="string">&quot;000&quot;</span>.as_bytes(), <span class="number">1000</span>);
             <span class="kw">let </span>to = LookupKey::new(<span class="string">&quot;zzz&quot;</span>.as_bytes(), <span class="number">1010</span>);
             <span class="kw">let </span>c = vs
                 .compact_range(<span class="number">0</span>, from.internal_key(), to.internal_key())
                 .unwrap();
             <span class="macro">assert_eq!</span>(<span class="number">2</span>, c.inputs[<span class="number">0</span>].len());
             <span class="macro">assert_eq!</span>(<span class="number">1</span>, c.inputs[<span class="number">1</span>].len());
             <span class="macro">assert_eq!</span>(<span class="number">1</span>, c.grandparents.as_ref().unwrap().len());
             iterator_properties(
                 vs.make_input_iterator(<span class="kw-2">&amp;</span>c),
                 <span class="number">12</span>,
                 Rc::new(Box::new(vs.cmp.clone())),
             );

             <span class="comment">// Expand input range on higher level.
             </span><span class="kw">let </span>from = LookupKey::new(<span class="string">&quot;dab&quot;</span>.as_bytes(), <span class="number">1000</span>);
             <span class="kw">let </span>to = LookupKey::new(<span class="string">&quot;eab&quot;</span>.as_bytes(), <span class="number">1010</span>);
             <span class="kw">let </span>c = vs
                 .compact_range(<span class="number">1</span>, from.internal_key(), to.internal_key())
                 .unwrap();
             <span class="macro">assert_eq!</span>(<span class="number">3</span>, c.inputs[<span class="number">0</span>].len());
             <span class="macro">assert_eq!</span>(<span class="number">1</span>, c.inputs[<span class="number">1</span>].len());
             <span class="macro">assert_eq!</span>(<span class="number">0</span>, c.grandparents.as_ref().unwrap().len());
             iterator_properties(
                 vs.make_input_iterator(<span class="kw-2">&amp;</span>c),
                 <span class="number">12</span>,
                 Rc::new(Box::new(vs.cmp.clone())),
             );

             <span class="comment">// is_trivial_move
             </span><span class="kw">let </span>from = LookupKey::new(<span class="string">&quot;fab&quot;</span>.as_bytes(), <span class="number">1000</span>);
             <span class="kw">let </span>to = LookupKey::new(<span class="string">&quot;fba&quot;</span>.as_bytes(), <span class="number">1010</span>);
             <span class="kw">let </span><span class="kw-2">mut </span>c = vs
                 .compact_range(<span class="number">2</span>, from.internal_key(), to.internal_key())
                 .unwrap();
             <span class="comment">// pretend it&#39;s not manual
             </span>c.manual = <span class="bool-val">false</span>;
             <span class="macro">assert!</span>(c.is_trivial_move());

             <span class="comment">// should_stop_before
             </span><span class="kw">let </span>from = LookupKey::new(<span class="string">&quot;000&quot;</span>.as_bytes(), <span class="number">1000</span>);
             <span class="kw">let </span>to = LookupKey::new(<span class="string">&quot;zzz&quot;</span>.as_bytes(), <span class="number">1010</span>);
             <span class="kw">let </span>mid = LookupKey::new(<span class="string">&quot;abc&quot;</span>.as_bytes(), <span class="number">1010</span>);
             <span class="kw">let </span><span class="kw-2">mut </span>c = vs
                 .compact_range(<span class="number">0</span>, from.internal_key(), to.internal_key())
                 .unwrap();
             <span class="macro">assert!</span>(!c.should_stop_before(from.internal_key()));
             <span class="macro">assert!</span>(!c.should_stop_before(mid.internal_key()));
             <span class="macro">assert!</span>(!c.should_stop_before(to.internal_key()));

             <span class="comment">// is_base_level_for
             </span><span class="kw">let </span>from = LookupKey::new(<span class="string">&quot;000&quot;</span>.as_bytes(), <span class="number">1000</span>);
             <span class="kw">let </span>to = LookupKey::new(<span class="string">&quot;zzz&quot;</span>.as_bytes(), <span class="number">1010</span>);
             <span class="kw">let </span><span class="kw-2">mut </span>c = vs
                 .compact_range(<span class="number">0</span>, from.internal_key(), to.internal_key())
                 .unwrap();
             <span class="macro">assert!</span>(c.is_base_level_for(<span class="string">&quot;aaa&quot;</span>.as_bytes()));
             <span class="macro">assert!</span>(!c.is_base_level_for(<span class="string">&quot;hac&quot;</span>.as_bytes()));

             <span class="comment">// input/add_input_deletions
             </span><span class="kw">let </span>from = LookupKey::new(<span class="string">&quot;000&quot;</span>.as_bytes(), <span class="number">1000</span>);
             <span class="kw">let </span>to = LookupKey::new(<span class="string">&quot;zzz&quot;</span>.as_bytes(), <span class="number">1010</span>);
             <span class="kw">let </span><span class="kw-2">mut </span>c = vs
                 .compact_range(<span class="number">0</span>, from.internal_key(), to.internal_key())
                 .unwrap();
             <span class="kw">for </span>inp <span class="kw">in </span><span class="kw-2">&amp;</span>[(<span class="number">0</span>, <span class="number">0</span>, <span class="number">1</span>), (<span class="number">0</span>, <span class="number">1</span>, <span class="number">2</span>), (<span class="number">1</span>, <span class="number">0</span>, <span class="number">3</span>)] {
                 <span class="kw">let </span>f = <span class="kw-2">&amp;</span>c.inputs[inp.<span class="number">0</span>][inp.<span class="number">1</span>];
                 <span class="macro">assert_eq!</span>(inp.<span class="number">2</span>, f.borrow().num);
             }
             c.add_input_deletions();
             <span class="macro">assert_eq!</span>(<span class="number">23</span>, c.edit().encode().len())
         }
     }
 }
 </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>