Google Git
Sign in
apache / incubator-teaclave-website / refs/heads/asf-site / . / api-docs / crates-enclave / src / rusty_leveldb / skipmap.rs.html
blob: 1557726d4409ad76767591091dd33784a3313b0f [file] [log] [blame]
<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Source of the Rust file `common/rusty_leveldb_sgx/src/skipmap.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>skipmap.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>
</pre><pre class="rust"><code><span class="kw">use </span><span class="kw">crate</span>::cmp::{Cmp, MemtableKeyCmp};
<span class="kw">use </span><span class="kw">crate</span>::types::LdbIterator;
<span class="kw">use </span>rand::rngs::StdRng;
<span class="kw">use </span>rand::{RngCore, SeedableRng};
<span class="kw">use </span>std::cell::RefCell;
<span class="kw">use </span>std::cmp::Ordering;
<span class="kw">use </span>std::mem::{replace, size_of};
<span class="kw">use </span>std::rc::Rc;
<span class="kw">const </span>MAX_HEIGHT: usize = <span class="number">12</span>;
<span class="kw">const </span>BRANCHING_FACTOR: u32 = <span class="number">4</span>;
<span class="doccomment">/// A node in a skipmap contains links to the next node and others that are further away (skips);
/// `skips[0]` is the immediate element after, that is, the element contained in `next`.
</span><span class="kw">struct </span>Node {
skips: Vec&lt;<span class="prelude-ty">Option</span>&lt;<span class="kw-2">*mut </span>Node&gt;&gt;,
next: <span class="prelude-ty">Option</span>&lt;Box&lt;Node&gt;&gt;,
key: Vec&lt;u8&gt;,
value: Vec&lt;u8&gt;,
}
<span class="doccomment">/// Implements the backing store for a `MemTable`. The important methods are `insert()` and
/// `contains()`; in order to get full key and value for an entry, use a `SkipMapIter` instance,
/// `seek()` to the key to look up (this is as fast as any lookup in a skip map), and then call
/// `current()`.
</span><span class="kw">struct </span>InnerSkipMap {
head: Box&lt;Node&gt;,
rand: StdRng,
len: usize,
<span class="comment">// approximation of memory used.
</span>approx_mem: usize,
cmp: Rc&lt;Box&lt;<span class="kw">dyn </span>Cmp&gt;&gt;,
}
<span class="kw">pub struct </span>SkipMap {
map: Rc&lt;RefCell&lt;InnerSkipMap&gt;&gt;,
}
<span class="kw">impl </span>SkipMap {
<span class="doccomment">/// Returns a SkipMap that wraps the comparator inside a MemtableKeyCmp.
</span><span class="kw">pub fn </span>new_memtable_map(cmp: Rc&lt;Box&lt;<span class="kw">dyn </span>Cmp&gt;&gt;) -&gt; SkipMap {
SkipMap::new(Rc::new(Box::new(MemtableKeyCmp(cmp))))
}
<span class="doccomment">/// Returns a SkipMap that uses the specified comparator.
</span><span class="kw">pub fn </span>new(cmp: Rc&lt;Box&lt;<span class="kw">dyn </span>Cmp&gt;&gt;) -&gt; SkipMap {
<span class="kw">let </span><span class="kw-2">mut </span>s = Vec::new();
s.resize(MAX_HEIGHT, <span class="prelude-val">None</span>);
SkipMap {
map: Rc::new(RefCell::new(InnerSkipMap {
head: Box::new(Node {
skips: s,
next: <span class="prelude-val">None</span>,
key: Vec::new(),
value: Vec::new(),
}),
rand: StdRng::seed_from_u64(<span class="number">0xdeadbeef</span>),
len: <span class="number">0</span>,
approx_mem: size_of::&lt;<span class="self">Self</span>&gt;() + MAX_HEIGHT * size_of::&lt;<span class="prelude-ty">Option</span>&lt;<span class="kw-2">*mut </span>Node&gt;&gt;(),
cmp,
})),
}
}
<span class="kw">pub fn </span>len(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
<span class="self">self</span>.map.borrow().len
}
<span class="kw">pub fn </span>approx_memory(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
<span class="self">self</span>.map.borrow().approx_mem
}
<span class="kw">pub fn </span>contains(<span class="kw-2">&amp;</span><span class="self">self</span>, key: <span class="kw-2">&amp;</span>[u8]) -&gt; bool {
<span class="self">self</span>.map.borrow().contains(key)
}
<span class="doccomment">/// inserts a key into the table. key may not be empty.
</span><span class="kw">pub fn </span>insert(<span class="kw-2">&amp;mut </span><span class="self">self</span>, key: Vec&lt;u8&gt;, val: Vec&lt;u8&gt;) {
<span class="macro">assert!</span>(!key.is_empty());
<span class="self">self</span>.map.borrow_mut().insert(key, val);
}
<span class="kw">pub fn </span>iter(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; SkipMapIter {
SkipMapIter {
map: <span class="self">self</span>.map.clone(),
current: <span class="self">self</span>.map.borrow().head.as_ref() <span class="kw">as </span><span class="kw-2">*const </span>Node,
}
}
}
<span class="kw">impl </span>InnerSkipMap {
<span class="kw">fn </span>random_height(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; usize {
<span class="kw">let </span><span class="kw-2">mut </span>height = <span class="number">1</span>;
<span class="kw">while </span>height &lt; MAX_HEIGHT &amp;&amp; <span class="self">self</span>.rand.next_u32() % BRANCHING_FACTOR == <span class="number">0 </span>{
height += <span class="number">1</span>;
}
height
}
<span class="kw">fn </span>contains(<span class="kw-2">&amp;</span><span class="self">self</span>, key: <span class="kw-2">&amp;</span>[u8]) -&gt; bool {
<span class="kw">if let </span><span class="prelude-val">Some</span>(n) = <span class="self">self</span>.get_greater_or_equal(key) {
n.key.starts_with(<span class="kw-2">&amp;</span>key)
} <span class="kw">else </span>{
<span class="bool-val">false
</span>}
}
<span class="doccomment">/// Returns the node with key or the next greater one
/// Returns None if the given key lies past the greatest key in the table.
</span><span class="kw">fn </span>get_greater_or_equal&lt;<span class="lifetime">&#39;a</span>&gt;(<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="self">self</span>, key: <span class="kw-2">&amp;</span>[u8]) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>Node&gt; {
<span class="comment">// Start at the highest skip link of the head node, and work down from there
</span><span class="kw">let </span><span class="kw-2">mut </span>current = <span class="self">self</span>.head.as_ref() <span class="kw">as </span><span class="kw-2">*const </span>Node;
<span class="kw">let </span><span class="kw-2">mut </span>level = <span class="self">self</span>.head.skips.len() - <span class="number">1</span>;
<span class="kw">loop </span>{
<span class="kw">unsafe </span>{
<span class="kw">if let </span><span class="prelude-val">Some</span>(next) = (<span class="kw-2">*</span>current).skips[level] {
<span class="kw">let </span>ord = <span class="self">self</span>.cmp.cmp((<span class="kw-2">*</span>next).key.as_slice(), key);
<span class="kw">match </span>ord {
Ordering::Less =&gt; {
current = next;
<span class="kw">continue</span>;
}
Ordering::Equal =&gt; <span class="kw">return </span><span class="prelude-val">Some</span>(<span class="kw-2">&amp;</span>(<span class="kw-2">*</span>next)),
Ordering::Greater =&gt; {
<span class="kw">if </span>level == <span class="number">0 </span>{
<span class="kw">return </span><span class="prelude-val">Some</span>(<span class="kw-2">&amp;</span>(<span class="kw-2">*</span>next));
}
}
}
}
}
<span class="kw">if </span>level == <span class="number">0 </span>{
<span class="kw">break</span>;
}
level -= <span class="number">1</span>;
}
<span class="kw">unsafe </span>{
<span class="kw">if </span>current.is_null() || current == <span class="self">self</span>.head.as_ref() {
<span class="kw">return </span><span class="prelude-val">None</span>;
} <span class="kw">else if </span><span class="self">self</span>.cmp.cmp(<span class="kw-2">&amp;</span>(<span class="kw-2">*</span>current).key, key) == Ordering::Less {
<span class="kw">return </span><span class="prelude-val">None</span>;
} <span class="kw">else </span>{
<span class="kw">return </span><span class="prelude-val">Some</span>(<span class="kw-2">&amp;</span>(<span class="kw-2">*</span>current));
}
}
}
<span class="doccomment">/// Finds the node immediately before the node with key.
/// Returns None if no smaller key was found.
</span><span class="kw">fn </span>get_next_smaller&lt;<span class="lifetime">&#39;a</span>&gt;(<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span><span class="self">self</span>, key: <span class="kw-2">&amp;</span>[u8]) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="kw-2">&amp;</span><span class="lifetime">&#39;a </span>Node&gt; {
<span class="comment">// Start at the highest skip link of the head node, and work down from there
</span><span class="kw">let </span><span class="kw-2">mut </span>current = <span class="self">self</span>.head.as_ref() <span class="kw">as </span><span class="kw-2">*const </span>Node;
<span class="kw">let </span><span class="kw-2">mut </span>level = <span class="self">self</span>.head.skips.len() - <span class="number">1</span>;
<span class="kw">loop </span>{
<span class="kw">unsafe </span>{
<span class="kw">if let </span><span class="prelude-val">Some</span>(next) = (<span class="kw-2">*</span>current).skips[level] {
<span class="kw">let </span>ord = <span class="self">self</span>.cmp.cmp((<span class="kw-2">*</span>next).key.as_slice(), key);
<span class="kw">match </span>ord {
Ordering::Less =&gt; {
current = next;
<span class="kw">continue</span>;
}
<span class="kw">_ </span>=&gt; (),
}
}
}
<span class="kw">if </span>level == <span class="number">0 </span>{
<span class="kw">break</span>;
}
level -= <span class="number">1</span>;
}
<span class="kw">unsafe </span>{
<span class="kw">if </span>current.is_null() || current == <span class="self">self</span>.head.as_ref() {
<span class="comment">// If we&#39;re past the end for some reason or at the head
</span><span class="kw">return </span><span class="prelude-val">None</span>;
} <span class="kw">else if </span><span class="self">self</span>.cmp.cmp(<span class="kw-2">&amp;</span>(<span class="kw-2">*</span>current).key, key) != Ordering::Less {
<span class="kw">return </span><span class="prelude-val">None</span>;
} <span class="kw">else </span>{
<span class="kw">return </span><span class="prelude-val">Some</span>(<span class="kw-2">&amp;</span>(<span class="kw-2">*</span>current));
}
}
}
<span class="kw">fn </span>insert(<span class="kw-2">&amp;mut </span><span class="self">self</span>, key: Vec&lt;u8&gt;, val: Vec&lt;u8&gt;) {
<span class="macro">assert!</span>(!key.is_empty());
<span class="comment">// Keeping track of skip entries that will need to be updated
</span><span class="kw">let </span><span class="kw-2">mut </span>prevs: [<span class="prelude-ty">Option</span>&lt;<span class="kw-2">*mut </span>Node&gt;; MAX_HEIGHT] = [<span class="prelude-val">None</span>; MAX_HEIGHT];
<span class="kw">let </span>new_height = <span class="self">self</span>.random_height();
<span class="kw">let </span>prevs = <span class="kw-2">&amp;mut </span>prevs[<span class="number">0</span>..new_height];
<span class="kw">let </span><span class="kw-2">mut </span>level = MAX_HEIGHT - <span class="number">1</span>;
<span class="kw">let </span><span class="kw-2">mut </span>current = <span class="self">self</span>.head.as_mut() <span class="kw">as </span><span class="kw-2">*mut </span>Node;
<span class="comment">// Set previous node for all levels to current node.
</span><span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..prevs.len() {
prevs[i] = <span class="prelude-val">Some</span>(current);
}
<span class="comment">// Find the node after which we want to insert the new node; this is the node with the key
// immediately smaller than the key to be inserted.
</span><span class="kw">loop </span>{
<span class="kw">unsafe </span>{
<span class="kw">if let </span><span class="prelude-val">Some</span>(next) = (<span class="kw-2">*</span>current).skips[level] {
<span class="comment">// If the wanted position is after the current node
</span><span class="kw">let </span>ord = <span class="self">self</span>.cmp.cmp(<span class="kw-2">&amp;</span>(<span class="kw-2">*</span>next).key, <span class="kw-2">&amp;</span>key);
<span class="macro">assert!</span>(ord != Ordering::Equal, <span class="string">&quot;No duplicates allowed&quot;</span>);
<span class="kw">if </span>ord == Ordering::Less {
current = next;
<span class="kw">continue</span>;
}
}
}
<span class="kw">if </span>level &lt; new_height {
prevs[level] = <span class="prelude-val">Some</span>(current);
}
<span class="kw">if </span>level == <span class="number">0 </span>{
<span class="kw">break</span>;
} <span class="kw">else </span>{
level -= <span class="number">1</span>;
}
}
<span class="comment">// Construct new node
</span><span class="kw">let </span><span class="kw-2">mut </span>new_skips = Vec::new();
new_skips.resize(new_height, <span class="prelude-val">None</span>);
<span class="kw">let </span><span class="kw-2">mut </span>new = Box::new(Node {
skips: new_skips,
next: <span class="prelude-val">None</span>,
key,
value: val,
});
<span class="kw">let </span>newp = new.as_mut() <span class="kw">as </span><span class="kw-2">*mut </span>Node;
<span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..new_height {
<span class="kw">if let </span><span class="prelude-val">Some</span>(prev) = prevs[i] {
<span class="kw">unsafe </span>{
new.skips[i] = (<span class="kw-2">*</span>prev).skips[i];
(<span class="kw-2">*</span>prev).skips[i] = <span class="prelude-val">Some</span>(newp);
}
}
}
<span class="kw">let </span>added_mem = size_of::&lt;Node&gt;()
+ size_of::&lt;<span class="prelude-ty">Option</span>&lt;<span class="kw-2">*mut </span>Node&gt;&gt;() * new.skips.len()
+ new.key.len()
+ new.value.len();
<span class="self">self</span>.approx_mem += added_mem;
<span class="self">self</span>.len += <span class="number">1</span>;
<span class="comment">// Insert new node by first replacing the previous element&#39;s next field with None and
// assigning its value to new.next...
</span>new.next = <span class="kw">unsafe </span>{ replace(<span class="kw-2">&amp;mut </span>(<span class="kw-2">*</span>current).next, <span class="prelude-val">None</span>) };
<span class="comment">// ...and then setting the previous element&#39;s next field to the new node
</span><span class="kw">unsafe </span>{ replace(<span class="kw-2">&amp;mut </span>(<span class="kw-2">*</span>current).next, <span class="prelude-val">Some</span>(new)) };
}
<span class="doccomment">/// Runs through the skipmap and prints everything including addresses
</span><span class="kw">fn </span>dbg_print(<span class="kw-2">&amp;</span><span class="self">self</span>) {
<span class="kw">let </span><span class="kw-2">mut </span>current = <span class="self">self</span>.head.as_ref() <span class="kw">as </span><span class="kw-2">*const </span>Node;
<span class="kw">loop </span>{
<span class="kw">unsafe </span>{
<span class="macro">println!</span>(
<span class="string">&quot;{:?} {:?}/{:?} - {:?}&quot;</span>,
current,
(<span class="kw-2">*</span>current).key,
(<span class="kw-2">*</span>current).value,
(<span class="kw-2">*</span>current).skips
);
<span class="kw">if let </span><span class="prelude-val">Some</span>(next) = (<span class="kw-2">*</span>current).skips[<span class="number">0</span>].clone() {
current = next;
} <span class="kw">else </span>{
<span class="kw">break</span>;
}
}
}
}
}
<span class="kw">pub struct </span>SkipMapIter {
map: Rc&lt;RefCell&lt;InnerSkipMap&gt;&gt;,
current: <span class="kw-2">*const </span>Node,
}
<span class="kw">impl </span>LdbIterator <span class="kw">for </span>SkipMapIter {
<span class="kw">fn </span>advance(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; bool {
<span class="comment">// we first go to the next element, then return that -- in order to skip the head node
</span><span class="kw">let </span>r = <span class="kw">unsafe </span>{
(<span class="kw-2">*</span><span class="self">self</span>.current)
.next
.as_ref()
.map(|next| {
<span class="self">self</span>.current = next.as_ref() <span class="kw">as </span><span class="kw-2">*const </span>Node;
<span class="bool-val">true
</span>})
.unwrap_or(<span class="bool-val">false</span>)
};
<span class="kw">if </span>!r {
<span class="self">self</span>.reset();
}
r
}
<span class="kw">fn </span>reset(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
<span class="self">self</span>.current = <span class="self">self</span>.map.borrow().head.as_ref();
}
<span class="kw">fn </span>seek(<span class="kw-2">&amp;mut </span><span class="self">self</span>, key: <span class="kw-2">&amp;</span>[u8]) {
<span class="kw">if let </span><span class="prelude-val">Some</span>(node) = <span class="self">self</span>.map.borrow().get_greater_or_equal(key) {
<span class="self">self</span>.current = node <span class="kw">as </span><span class="kw-2">*const </span>Node;
<span class="kw">return</span>;
}
<span class="self">self</span>.reset();
}
<span class="kw">fn </span>valid(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; bool {
<span class="self">self</span>.current != <span class="self">self</span>.map.borrow().head.as_ref()
}
<span class="kw">fn </span>current(<span class="kw-2">&amp;</span><span class="self">self</span>, key: <span class="kw-2">&amp;mut </span>Vec&lt;u8&gt;, val: <span class="kw-2">&amp;mut </span>Vec&lt;u8&gt;) -&gt; bool {
<span class="kw">if </span><span class="self">self</span>.valid() {
key.clear();
val.clear();
<span class="kw">unsafe </span>{
key.extend_from_slice(<span class="kw-2">&amp;</span>(<span class="kw-2">*</span><span class="self">self</span>.current).key);
val.extend_from_slice(<span class="kw-2">&amp;</span>(<span class="kw-2">*</span><span class="self">self</span>.current).value);
}
<span class="bool-val">true
</span>} <span class="kw">else </span>{
<span class="bool-val">false
</span>}
}
<span class="kw">fn </span>prev(<span class="kw-2">&amp;mut </span><span class="self">self</span>) -&gt; bool {
<span class="comment">// Going after the original implementation here; we just seek to the node before current().
</span><span class="kw">if </span><span class="self">self</span>.valid() {
<span class="kw">if let </span><span class="prelude-val">Some</span>(prev) = <span class="self">self
</span>.map
.borrow()
.get_next_smaller(<span class="kw">unsafe </span>{ <span class="kw-2">&amp;</span>(<span class="kw-2">*</span><span class="self">self</span>.current).key })
{
<span class="self">self</span>.current = prev <span class="kw">as </span><span class="kw-2">*const </span>Node;
<span class="kw">if </span>!prev.key.is_empty() {
<span class="kw">return </span><span class="bool-val">true</span>;
}
}
}
<span class="self">self</span>.reset();
<span class="bool-val">false
</span>}
}
<span class="attribute">#[cfg(feature = <span class="string">&quot;enclave_unit_test&quot;</span>)]
</span><span class="kw">pub mod </span>tests {
<span class="kw">use super</span>::<span class="kw-2">*</span>;
<span class="kw">use </span><span class="kw">crate</span>::cmp::MemtableKeyCmp;
<span class="kw">use </span><span class="kw">crate</span>::options;
<span class="kw">use </span><span class="kw">crate</span>::test_util::{test_iterator_properties, LdbIteratorIter};
<span class="kw">use </span><span class="kw">crate</span>::types::current_key_val;
<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">should_panic!</span>(test_no_dupes());
<span class="macro">run_tests!</span>(
test_insert,
test_contains,
test_find,
test_empty_skipmap_find_memtable_cmp,
test_skipmap_iterator_0,
test_skipmap_iterator_init,
test_skipmap_iterator,
test_skipmap_iterator_seek_valid,
test_skipmap_behavior,
test_skipmap_iterator_prev,
test_skipmap_iterator_concurrent_insert,
)
}
<span class="kw">pub fn </span>make_skipmap() -&gt; SkipMap {
<span class="kw">let </span><span class="kw-2">mut </span>skm = SkipMap::new(options::for_test().cmp);
<span class="kw">let </span>keys = <span class="macro">vec!</span>[
<span class="string">&quot;aba&quot;</span>, <span class="string">&quot;abb&quot;</span>, <span class="string">&quot;abc&quot;</span>, <span class="string">&quot;abd&quot;</span>, <span class="string">&quot;abe&quot;</span>, <span class="string">&quot;abf&quot;</span>, <span class="string">&quot;abg&quot;</span>, <span class="string">&quot;abh&quot;</span>, <span class="string">&quot;abi&quot;</span>, <span class="string">&quot;abj&quot;</span>, <span class="string">&quot;abk&quot;</span>, <span class="string">&quot;abl&quot;</span>,
<span class="string">&quot;abm&quot;</span>, <span class="string">&quot;abn&quot;</span>, <span class="string">&quot;abo&quot;</span>, <span class="string">&quot;abp&quot;</span>, <span class="string">&quot;abq&quot;</span>, <span class="string">&quot;abr&quot;</span>, <span class="string">&quot;abs&quot;</span>, <span class="string">&quot;abt&quot;</span>, <span class="string">&quot;abu&quot;</span>, <span class="string">&quot;abv&quot;</span>, <span class="string">&quot;abw&quot;</span>, <span class="string">&quot;abx&quot;</span>,
<span class="string">&quot;aby&quot;</span>, <span class="string">&quot;abz&quot;</span>,
];
<span class="kw">for </span>k <span class="kw">in </span>keys {
skm.insert(k.as_bytes().to_vec(), <span class="string">&quot;def&quot;</span>.as_bytes().to_vec());
}
skm
}
<span class="kw">fn </span>test_insert() {
<span class="kw">let </span>skm = make_skipmap();
<span class="macro">assert_eq!</span>(skm.len(), <span class="number">26</span>);
skm.map.borrow().dbg_print();
}
<span class="kw">fn </span>test_no_dupes() {
<span class="kw">let </span><span class="kw-2">mut </span>skm = make_skipmap();
<span class="comment">// this should panic
</span>skm.insert(<span class="string">&quot;abc&quot;</span>.as_bytes().to_vec(), <span class="string">&quot;def&quot;</span>.as_bytes().to_vec());
skm.insert(<span class="string">&quot;abf&quot;</span>.as_bytes().to_vec(), <span class="string">&quot;def&quot;</span>.as_bytes().to_vec());
}
<span class="kw">fn </span>test_contains() {
<span class="kw">let </span>skm = make_skipmap();
<span class="macro">assert!</span>(skm.contains(<span class="kw-2">&amp;</span><span class="string">&quot;aby&quot;</span>.as_bytes().to_vec()));
<span class="macro">assert!</span>(skm.contains(<span class="kw-2">&amp;</span><span class="string">&quot;abc&quot;</span>.as_bytes().to_vec()));
<span class="macro">assert!</span>(skm.contains(<span class="kw-2">&amp;</span><span class="string">&quot;abz&quot;</span>.as_bytes().to_vec()));
<span class="macro">assert!</span>(!skm.contains(<span class="kw-2">&amp;</span><span class="string">&quot;ab{&quot;</span>.as_bytes().to_vec()));
<span class="macro">assert!</span>(!skm.contains(<span class="kw-2">&amp;</span><span class="string">&quot;123&quot;</span>.as_bytes().to_vec()));
<span class="macro">assert!</span>(!skm.contains(<span class="kw-2">&amp;</span><span class="string">&quot;aaa&quot;</span>.as_bytes().to_vec()));
<span class="macro">assert!</span>(!skm.contains(<span class="kw-2">&amp;</span><span class="string">&quot;456&quot;</span>.as_bytes().to_vec()));
}
<span class="kw">fn </span>test_find() {
<span class="kw">let </span>skm = make_skipmap();
<span class="macro">assert_eq!</span>(
skm.map
.borrow()
.get_greater_or_equal(<span class="kw-2">&amp;</span><span class="string">&quot;abf&quot;</span>.as_bytes().to_vec())
.unwrap()
.key,
<span class="string">&quot;abf&quot;</span>.as_bytes().to_vec()
);
<span class="macro">assert!</span>(skm
.map
.borrow()
.get_greater_or_equal(<span class="kw-2">&amp;</span><span class="string">&quot;ab{&quot;</span>.as_bytes().to_vec())
.is_none());
<span class="macro">assert_eq!</span>(
skm.map
.borrow()
.get_greater_or_equal(<span class="kw-2">&amp;</span><span class="string">&quot;aaa&quot;</span>.as_bytes().to_vec())
.unwrap()
.key,
<span class="string">&quot;aba&quot;</span>.as_bytes().to_vec()
);
<span class="macro">assert_eq!</span>(
skm.map
.borrow()
.get_greater_or_equal(<span class="kw-2">&amp;</span><span class="string">&quot;ab&quot;</span>.as_bytes())
.unwrap()
.key
.as_slice(),
<span class="string">&quot;aba&quot;</span>.as_bytes()
);
<span class="macro">assert_eq!</span>(
skm.map
.borrow()
.get_greater_or_equal(<span class="kw-2">&amp;</span><span class="string">&quot;abc&quot;</span>.as_bytes())
.unwrap()
.key
.as_slice(),
<span class="string">&quot;abc&quot;</span>.as_bytes()
);
<span class="macro">assert!</span>(skm
.map
.borrow()
.get_next_smaller(<span class="kw-2">&amp;</span><span class="string">&quot;ab0&quot;</span>.as_bytes())
.is_none());
<span class="macro">assert_eq!</span>(
skm.map
.borrow()
.get_next_smaller(<span class="kw-2">&amp;</span><span class="string">&quot;abd&quot;</span>.as_bytes())
.unwrap()
.key
.as_slice(),
<span class="string">&quot;abc&quot;</span>.as_bytes()
);
<span class="macro">assert_eq!</span>(
skm.map
.borrow()
.get_next_smaller(<span class="kw-2">&amp;</span><span class="string">&quot;ab{&quot;</span>.as_bytes())
.unwrap()
.key
.as_slice(),
<span class="string">&quot;abz&quot;</span>.as_bytes()
);
}
<span class="kw">fn </span>test_empty_skipmap_find_memtable_cmp() {
<span class="comment">// Regression test: Make sure comparator isn&#39;t called with empty key.
</span><span class="kw">let </span>cmp: Rc&lt;Box&lt;<span class="kw">dyn </span>Cmp&gt;&gt; = Rc::new(Box::new(MemtableKeyCmp(options::for_test().cmp)));
<span class="kw">let </span>skm = SkipMap::new(cmp);
<span class="kw">let </span><span class="kw-2">mut </span>it = skm.iter();
it.seek(<span class="string">&quot;abc&quot;</span>.as_bytes());
<span class="macro">assert!</span>(!it.valid());
}
<span class="kw">fn </span>test_skipmap_iterator_0() {
<span class="kw">let </span>skm = SkipMap::new(options::for_test().cmp);
<span class="kw">let </span><span class="kw-2">mut </span>i = <span class="number">0</span>;
<span class="kw">for </span>(<span class="kw">_</span>, <span class="kw">_</span>) <span class="kw">in </span>LdbIteratorIter::wrap(<span class="kw-2">&amp;mut </span>skm.iter()) {
i += <span class="number">1</span>;
}
<span class="macro">assert_eq!</span>(i, <span class="number">0</span>);
<span class="macro">assert!</span>(!skm.iter().valid());
}
<span class="kw">fn </span>test_skipmap_iterator_init() {
<span class="kw">let </span>skm = make_skipmap();
<span class="kw">let </span><span class="kw-2">mut </span>iter = skm.iter();
<span class="macro">assert!</span>(!iter.valid());
iter.next();
<span class="macro">assert!</span>(iter.valid());
iter.reset();
<span class="macro">assert!</span>(!iter.valid());
iter.next();
<span class="macro">assert!</span>(iter.valid());
iter.prev();
<span class="macro">assert!</span>(!iter.valid());
}
<span class="kw">fn </span>test_skipmap_iterator() {
<span class="kw">let </span>skm = make_skipmap();
<span class="kw">let </span><span class="kw-2">mut </span>i = <span class="number">0</span>;
<span class="kw">for </span>(k, v) <span class="kw">in </span>LdbIteratorIter::wrap(<span class="kw-2">&amp;mut </span>skm.iter()) {
<span class="macro">assert!</span>(!k.is_empty());
<span class="macro">assert!</span>(!v.is_empty());
i += <span class="number">1</span>;
}
<span class="macro">assert_eq!</span>(i, <span class="number">26</span>);
}
<span class="kw">fn </span>test_skipmap_iterator_seek_valid() {
<span class="kw">let </span>skm = make_skipmap();
<span class="kw">let </span><span class="kw-2">mut </span>iter = skm.iter();
iter.next();
<span class="macro">assert!</span>(iter.valid());
<span class="macro">assert_eq!</span>(current_key_val(<span class="kw-2">&amp;</span>iter).unwrap().<span class="number">0</span>, <span class="string">&quot;aba&quot;</span>.as_bytes().to_vec());
iter.seek(<span class="kw-2">&amp;</span><span class="string">&quot;abz&quot;</span>.as_bytes().to_vec());
<span class="macro">assert_eq!</span>(
current_key_val(<span class="kw-2">&amp;</span>iter).unwrap(),
(<span class="string">&quot;abz&quot;</span>.as_bytes().to_vec(), <span class="string">&quot;def&quot;</span>.as_bytes().to_vec())
);
<span class="comment">// go back to beginning
</span>iter.seek(<span class="kw-2">&amp;</span><span class="string">&quot;aba&quot;</span>.as_bytes().to_vec());
<span class="macro">assert_eq!</span>(
current_key_val(<span class="kw-2">&amp;</span>iter).unwrap(),
(<span class="string">&quot;aba&quot;</span>.as_bytes().to_vec(), <span class="string">&quot;def&quot;</span>.as_bytes().to_vec())
);
iter.seek(<span class="kw-2">&amp;</span><span class="string">&quot;&quot;</span>.as_bytes().to_vec());
<span class="macro">assert!</span>(iter.valid());
iter.prev();
<span class="macro">assert!</span>(!iter.valid());
<span class="kw">while </span>iter.advance() {}
<span class="macro">assert!</span>(!iter.valid());
<span class="macro">assert!</span>(!iter.prev());
<span class="macro">assert_eq!</span>(current_key_val(<span class="kw-2">&amp;</span>iter), <span class="prelude-val">None</span>);
}
<span class="kw">fn </span>test_skipmap_behavior() {
<span class="kw">let </span><span class="kw-2">mut </span>skm = SkipMap::new(options::for_test().cmp);
<span class="kw">let </span>keys = <span class="macro">vec!</span>[<span class="string">&quot;aba&quot;</span>, <span class="string">&quot;abb&quot;</span>, <span class="string">&quot;abc&quot;</span>, <span class="string">&quot;abd&quot;</span>];
<span class="kw">for </span>k <span class="kw">in </span>keys {
skm.insert(k.as_bytes().to_vec(), <span class="string">&quot;def&quot;</span>.as_bytes().to_vec());
}
test_iterator_properties(skm.iter());
}
<span class="kw">fn </span>test_skipmap_iterator_prev() {
<span class="kw">let </span>skm = make_skipmap();
<span class="kw">let </span><span class="kw-2">mut </span>iter = skm.iter();
iter.next();
<span class="macro">assert!</span>(iter.valid());
iter.prev();
<span class="macro">assert!</span>(!iter.valid());
iter.seek(<span class="kw-2">&amp;</span><span class="string">&quot;abc&quot;</span>.as_bytes());
iter.prev();
<span class="macro">assert_eq!</span>(
current_key_val(<span class="kw-2">&amp;</span>iter).unwrap(),
(<span class="string">&quot;abb&quot;</span>.as_bytes().to_vec(), <span class="string">&quot;def&quot;</span>.as_bytes().to_vec())
);
}
<span class="kw">fn </span>test_skipmap_iterator_concurrent_insert() {
<span class="comment">// Asserts that the map can be mutated while an iterator exists; this is intentional.
</span><span class="kw">let </span><span class="kw-2">mut </span>skm = make_skipmap();
<span class="kw">let </span><span class="kw-2">mut </span>iter = skm.iter();
<span class="macro">assert!</span>(iter.advance());
skm.insert(<span class="string">&quot;abccc&quot;</span>.as_bytes().to_vec(), <span class="string">&quot;defff&quot;</span>.as_bytes().to_vec());
<span class="comment">// Assert that value inserted after obtaining iterator is present.
</span><span class="kw">for </span>(k, <span class="kw">_</span>) <span class="kw">in </span>LdbIteratorIter::wrap(<span class="kw-2">&amp;mut </span>iter) {
<span class="kw">if </span>k == <span class="string">&quot;abccc&quot;</span>.as_bytes() {
<span class="kw">return</span>;
}
}
<span class="macro">panic!</span>(<span class="string">&quot;abccc not found in map.&quot;</span>);
}
}
</code></pre></div>
</section></div></main><div id="rustdoc-vars" data-root-path="../../" data-current-crate="rusty_leveldb" data-themes="ayu,dark,light" data-resource-suffix="" data-rustdoc-version="1.66.0-nightly (5c8bff74b 2022-10-21)" ></div></body></html>