blob: ad14db02c7168302c6e3303a45b22f3b3a5f5c0c [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/cmp.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>cmp.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>
</pre><pre class="rust"><code><span class="attribute">#![allow(clippy::many_single_char_names)]
</span><span class="kw">use </span><span class="kw">crate</span>::key_types::{<span class="self">self</span>, LookupKey};
<span class="kw">use </span><span class="kw">crate</span>::types;
<span class="kw">use </span>std::cmp::Ordering;
<span class="kw">use </span>std::rc::Rc;
<span class="kw">type </span>WrappedCmp = Rc&lt;Box&lt;<span class="kw">dyn </span>Cmp&gt;&gt;;
<span class="doccomment">/// Comparator trait, supporting types that can be nested (i.e., add additional functionality on
/// top of an inner comparator)
</span><span class="kw">pub trait </span>Cmp {
<span class="doccomment">/// Compare to byte strings, bytewise.
</span><span class="kw">fn </span>cmp(<span class="kw-2">&amp;</span><span class="self">self</span>, a: <span class="kw-2">&amp;</span>[u8], b: <span class="kw-2">&amp;</span>[u8]) -&gt; Ordering;
<span class="doccomment">/// Return the shortest byte string that compares &quot;Greater&quot; to the first argument and &quot;Less&quot; to
/// the second one.
</span><span class="kw">fn </span>find_shortest_sep(<span class="kw-2">&amp;</span><span class="self">self</span>, from: <span class="kw-2">&amp;</span>[u8], to: <span class="kw-2">&amp;</span>[u8]) -&gt; Vec&lt;u8&gt;;
<span class="doccomment">/// Return the shortest byte string that compares &quot;Greater&quot; to the argument.
</span><span class="kw">fn </span>find_short_succ(<span class="kw-2">&amp;</span><span class="self">self</span>, key: <span class="kw-2">&amp;</span>[u8]) -&gt; Vec&lt;u8&gt;;
<span class="doccomment">/// A unique identifier for a comparator. A comparator wrapper (like InternalKeyCmp) may
/// return the id of its inner comparator.
</span><span class="kw">fn </span>id(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;static </span>str;
}
<span class="doccomment">/// The default byte-wise comparator.
</span><span class="attribute">#[derive(Clone)]
</span><span class="kw">pub struct </span>DefaultCmp;
<span class="kw">impl </span>Cmp <span class="kw">for </span>DefaultCmp {
<span class="kw">fn </span>cmp(<span class="kw-2">&amp;</span><span class="self">self</span>, a: <span class="kw-2">&amp;</span>[u8], b: <span class="kw-2">&amp;</span>[u8]) -&gt; Ordering {
a.cmp(b)
}
<span class="kw">fn </span>id(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;static </span>str {
<span class="string">&quot;leveldb.BytewiseComparator&quot;
</span>}
<span class="kw">fn </span>find_shortest_sep(<span class="kw-2">&amp;</span><span class="self">self</span>, a: <span class="kw-2">&amp;</span>[u8], b: <span class="kw-2">&amp;</span>[u8]) -&gt; Vec&lt;u8&gt; {
<span class="kw">if </span>a == b {
<span class="kw">return </span>a.to_vec();
}
<span class="kw">let </span>min = <span class="kw">if </span>a.len() &lt; b.len() { a.len() } <span class="kw">else </span>{ b.len() };
<span class="kw">let </span><span class="kw-2">mut </span>diff_at = <span class="number">0</span>;
<span class="kw">while </span>diff_at &lt; min &amp;&amp; a[diff_at] == b[diff_at] {
diff_at += <span class="number">1</span>;
}
<span class="comment">// First, try to find a short separator. If that fails, try a backup mechanism below.
</span><span class="kw">while </span>diff_at &lt; min {
<span class="kw">let </span>diff = a[diff_at];
<span class="kw">if </span>diff &lt; <span class="number">0xff </span>&amp;&amp; diff + <span class="number">1 </span>&lt; b[diff_at] {
<span class="kw">let </span><span class="kw-2">mut </span>sep = Vec::from(<span class="kw-2">&amp;</span>a[<span class="number">0</span>..diff_at + <span class="number">1</span>]);
sep[diff_at] += <span class="number">1</span>;
<span class="macro">assert!</span>(<span class="self">self</span>.cmp(<span class="kw-2">&amp;</span>sep, b) == Ordering::Less);
<span class="kw">return </span>sep;
}
diff_at += <span class="number">1</span>;
}
<span class="kw">let </span><span class="kw-2">mut </span>sep = Vec::with_capacity(a.len() + <span class="number">1</span>);
sep.extend_from_slice(a);
<span class="comment">// Try increasing a and check if it&#39;s still smaller than b. First find the last byte
// smaller than 0xff, and then increment that byte. Only if the separator is lesser than b,
// return it.
</span><span class="kw">let </span><span class="kw-2">mut </span>i = a.len() - <span class="number">1</span>;
<span class="kw">while </span>i &gt; <span class="number">0 </span>&amp;&amp; sep[i] == <span class="number">0xff </span>{
i -= <span class="number">1</span>;
}
<span class="kw">if </span>sep[i] &lt; <span class="number">0xff </span>{
sep[i] += <span class="number">1</span>;
<span class="kw">if </span><span class="self">self</span>.cmp(<span class="kw-2">&amp;</span>sep, b) == Ordering::Less {
<span class="kw">return </span>sep;
} <span class="kw">else </span>{
sep[i] -= <span class="number">1</span>;
}
}
<span class="comment">// Backup case: either `a` is full of 0xff, or all different places are less than 2
// characters apart.
// The result is not necessarily short, but a good separator: e.g., &quot;abc&quot; vs &quot;abd&quot; -&gt;
// &quot;abc\0&quot;, which is greater than abc and lesser than abd.
// Append a 0 byte; by making it longer than a, it will compare greater to it.
</span>sep.extend_from_slice(<span class="kw-2">&amp;</span>[<span class="number">0</span>]);
<span class="kw">return </span>sep;
}
<span class="kw">fn </span>find_short_succ(<span class="kw-2">&amp;</span><span class="self">self</span>, a: <span class="kw-2">&amp;</span>[u8]) -&gt; Vec&lt;u8&gt; {
<span class="kw">let </span><span class="kw-2">mut </span>result = a.to_vec();
<span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..a.len() {
<span class="kw">if </span>a[i] != <span class="number">0xff </span>{
result[i] += <span class="number">1</span>;
result.resize(i + <span class="number">1</span>, <span class="number">0</span>);
<span class="kw">return </span>result;
}
}
<span class="comment">// Rare path
</span>result.push(<span class="number">255</span>);
<span class="kw">return </span>result;
}
}
<span class="doccomment">/// Same as memtable_key_cmp, but for InternalKeys.
</span><span class="attribute">#[derive(Clone)]
</span><span class="kw">pub struct </span>InternalKeyCmp(<span class="kw">pub </span>Rc&lt;Box&lt;<span class="kw">dyn </span>Cmp&gt;&gt;);
<span class="kw">impl </span>Cmp <span class="kw">for </span>InternalKeyCmp {
<span class="kw">fn </span>cmp(<span class="kw-2">&amp;</span><span class="self">self</span>, a: <span class="kw-2">&amp;</span>[u8], b: <span class="kw-2">&amp;</span>[u8]) -&gt; Ordering {
key_types::cmp_internal_key(<span class="self">self</span>.<span class="number">0</span>.as_ref().as_ref(), a, b)
}
<span class="kw">fn </span>id(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;static </span>str {
<span class="self">self</span>.<span class="number">0</span>.id()
}
<span class="kw">fn </span>find_shortest_sep(<span class="kw-2">&amp;</span><span class="self">self</span>, a: <span class="kw-2">&amp;</span>[u8], b: <span class="kw-2">&amp;</span>[u8]) -&gt; Vec&lt;u8&gt; {
<span class="kw">if </span>a == b {
<span class="kw">return </span>a.to_vec();
}
<span class="kw">let </span>(<span class="kw">_</span>, seqa, keya) = key_types::parse_internal_key(a);
<span class="kw">let </span>(<span class="kw">_</span>, <span class="kw">_</span>, keyb) = key_types::parse_internal_key(b);
<span class="kw">let </span>sep: Vec&lt;u8&gt; = <span class="self">self</span>.<span class="number">0</span>.find_shortest_sep(keya, keyb);
<span class="kw">if </span>sep.len() &lt; keya.len() &amp;&amp; <span class="self">self</span>.<span class="number">0</span>.cmp(keya, <span class="kw-2">&amp;</span>sep) == Ordering::Less {
<span class="kw">return </span>LookupKey::new(<span class="kw-2">&amp;</span>sep, types::MAX_SEQUENCE_NUMBER)
.internal_key()
.to_vec();
}
<span class="kw">return </span>LookupKey::new(<span class="kw-2">&amp;</span>sep, seqa).internal_key().to_vec();
}
<span class="kw">fn </span>find_short_succ(<span class="kw-2">&amp;</span><span class="self">self</span>, a: <span class="kw-2">&amp;</span>[u8]) -&gt; Vec&lt;u8&gt; {
<span class="kw">let </span>(<span class="kw">_</span>, seq, key) = key_types::parse_internal_key(a);
<span class="kw">let </span>succ: Vec&lt;u8&gt; = <span class="self">self</span>.<span class="number">0</span>.find_short_succ(key);
<span class="kw">return </span>LookupKey::new(<span class="kw-2">&amp;</span>succ, seq).internal_key().to_vec();
}
}
<span class="kw">impl </span>InternalKeyCmp {
<span class="doccomment">/// cmp_inner compares a and b using the underlying comparator (the &quot;user comparator&quot;).
</span><span class="kw">pub fn </span>cmp_inner(<span class="kw-2">&amp;</span><span class="self">self</span>, a: <span class="kw-2">&amp;</span>[u8], b: <span class="kw-2">&amp;</span>[u8]) -&gt; Ordering {
<span class="self">self</span>.<span class="number">0</span>.cmp(a, b)
}
}
<span class="doccomment">/// An internal comparator wrapping a user-supplied comparator. This comparator is used to compare
/// memtable keys, which contain length prefixes and a sequence number.
/// The ordering is determined by asking the wrapped comparator; ties are broken by *reverse*
/// ordering the sequence numbers. (This means that when having an entry abx/4 and seRching for
/// abx/5, then abx/4 is counted as &quot;greater-or-equal&quot;, making snapshot functionality work at all)
</span><span class="attribute">#[derive(Clone)]
</span><span class="kw">pub struct </span>MemtableKeyCmp(<span class="kw">pub </span>Rc&lt;Box&lt;<span class="kw">dyn </span>Cmp&gt;&gt;);
<span class="kw">impl </span>Cmp <span class="kw">for </span>MemtableKeyCmp {
<span class="kw">fn </span>cmp(<span class="kw-2">&amp;</span><span class="self">self</span>, a: <span class="kw-2">&amp;</span>[u8], b: <span class="kw-2">&amp;</span>[u8]) -&gt; Ordering {
key_types::cmp_memtable_key(<span class="self">self</span>.<span class="number">0</span>.as_ref().as_ref(), a, b)
}
<span class="kw">fn </span>id(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span><span class="lifetime">&#39;static </span>str {
<span class="self">self</span>.<span class="number">0</span>.id()
}
<span class="comment">// The following two impls should not be used (by principle) although they should be correct.
// They will crash the program.
</span><span class="kw">fn </span>find_shortest_sep(<span class="kw-2">&amp;</span><span class="self">self</span>, <span class="kw">_</span>: <span class="kw-2">&amp;</span>[u8], <span class="kw">_</span>: <span class="kw-2">&amp;</span>[u8]) -&gt; Vec&lt;u8&gt; {
<span class="macro">panic!</span>(<span class="string">&quot;find* functions are invalid on MemtableKeyCmp&quot;</span>);
}
<span class="kw">fn </span>find_short_succ(<span class="kw-2">&amp;</span><span class="self">self</span>, <span class="kw">_</span>: <span class="kw-2">&amp;</span>[u8]) -&gt; Vec&lt;u8&gt; {
<span class="macro">panic!</span>(<span class="string">&quot;find* functions are invalid on MemtableKeyCmp&quot;</span>);
}
}
<span class="attribute">#[cfg(feature = <span class="string">&quot;enclave_unit_test&quot;</span>)]
</span><span class="kw">pub mod </span>tests {
<span class="kw">use super</span>::<span class="kw-2">*</span>;
<span class="kw">use </span><span class="kw">crate</span>::key_types::LookupKey;
<span class="kw">use </span><span class="kw">crate</span>::types;
<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_cmp_memtablekeycmp_panics());
<span class="macro">run_tests!</span>(
test_cmp_defaultcmp_shortest_sep,
test_cmp_defaultcmp_short_succ,
test_cmp_internalkeycmp_shortest_sep,
test_cmp_internalkeycmp,
)
}
<span class="kw">fn </span>test_cmp_defaultcmp_shortest_sep() {
<span class="macro">assert_eq!</span>(
DefaultCmp.find_shortest_sep(<span class="string">&quot;abcd&quot;</span>.as_bytes(), <span class="string">&quot;abcf&quot;</span>.as_bytes()),
<span class="string">&quot;abce&quot;</span>.as_bytes()
);
<span class="macro">assert_eq!</span>(
DefaultCmp.find_shortest_sep(<span class="string">&quot;abc&quot;</span>.as_bytes(), <span class="string">&quot;acd&quot;</span>.as_bytes()),
<span class="string">&quot;abd&quot;</span>.as_bytes()
);
<span class="macro">assert_eq!</span>(
DefaultCmp.find_shortest_sep(<span class="string">&quot;abcdefghi&quot;</span>.as_bytes(), <span class="string">&quot;abcffghi&quot;</span>.as_bytes()),
<span class="string">&quot;abce&quot;</span>.as_bytes()
);
<span class="macro">assert_eq!</span>(
DefaultCmp.find_shortest_sep(<span class="string">&quot;a&quot;</span>.as_bytes(), <span class="string">&quot;a&quot;</span>.as_bytes()),
<span class="string">&quot;a&quot;</span>.as_bytes()
);
<span class="macro">assert_eq!</span>(
DefaultCmp.find_shortest_sep(<span class="string">&quot;a&quot;</span>.as_bytes(), <span class="string">&quot;b&quot;</span>.as_bytes()),
<span class="string">&quot;a\0&quot;</span>.as_bytes()
);
<span class="macro">assert_eq!</span>(
DefaultCmp.find_shortest_sep(<span class="string">&quot;abc&quot;</span>.as_bytes(), <span class="string">&quot;zzz&quot;</span>.as_bytes()),
<span class="string">&quot;b&quot;</span>.as_bytes()
);
<span class="macro">assert_eq!</span>(
DefaultCmp.find_shortest_sep(<span class="string">&quot;yyy&quot;</span>.as_bytes(), <span class="string">&quot;z&quot;</span>.as_bytes()),
<span class="string">&quot;yyz&quot;</span>.as_bytes()
);
<span class="macro">assert_eq!</span>(
DefaultCmp.find_shortest_sep(<span class="string">&quot;&quot;</span>.as_bytes(), <span class="string">&quot;&quot;</span>.as_bytes()),
<span class="string">&quot;&quot;</span>.as_bytes()
);
}
<span class="kw">fn </span>test_cmp_defaultcmp_short_succ() {
<span class="macro">assert_eq!</span>(
DefaultCmp.find_short_succ(<span class="string">&quot;abcd&quot;</span>.as_bytes()),
<span class="string">&quot;b&quot;</span>.as_bytes()
);
<span class="macro">assert_eq!</span>(
DefaultCmp.find_short_succ(<span class="string">&quot;zzzz&quot;</span>.as_bytes()),
<span class="string">&quot;{&quot;</span>.as_bytes()
);
<span class="macro">assert_eq!</span>(DefaultCmp.find_short_succ(<span class="kw-2">&amp;</span>[]), <span class="kw-2">&amp;</span>[<span class="number">0xff</span>]);
<span class="macro">assert_eq!</span>(
DefaultCmp.find_short_succ(<span class="kw-2">&amp;</span>[<span class="number">0xff</span>, <span class="number">0xff</span>, <span class="number">0xff</span>]),
<span class="kw-2">&amp;</span>[<span class="number">0xff</span>, <span class="number">0xff</span>, <span class="number">0xff</span>, <span class="number">0xff</span>]
);
}
<span class="kw">fn </span>test_cmp_internalkeycmp_shortest_sep() {
<span class="kw">let </span>cmp = InternalKeyCmp(Rc::new(Box::new(DefaultCmp)));
<span class="macro">assert_eq!</span>(
cmp.find_shortest_sep(
LookupKey::new(<span class="string">&quot;abcd&quot;</span>.as_bytes(), <span class="number">1</span>).internal_key(),
LookupKey::new(<span class="string">&quot;abcf&quot;</span>.as_bytes(), <span class="number">2</span>).internal_key()
),
LookupKey::new(<span class="string">&quot;abce&quot;</span>.as_bytes(), <span class="number">1</span>).internal_key()
);
<span class="macro">assert_eq!</span>(
cmp.find_shortest_sep(
LookupKey::new(<span class="string">&quot;abcd&quot;</span>.as_bytes(), <span class="number">1</span>).internal_key(),
LookupKey::new(<span class="string">&quot;abce&quot;</span>.as_bytes(), <span class="number">2</span>).internal_key()
),
LookupKey::new(<span class="string">&quot;abcd\0&quot;</span>.as_bytes(), <span class="number">1</span>).internal_key()
);
<span class="macro">assert_eq!</span>(
cmp.find_shortest_sep(
LookupKey::new(<span class="string">&quot;abc&quot;</span>.as_bytes(), <span class="number">1</span>).internal_key(),
LookupKey::new(<span class="string">&quot;zzz&quot;</span>.as_bytes(), <span class="number">2</span>).internal_key()
),
LookupKey::new(<span class="string">&quot;b&quot;</span>.as_bytes(), types::MAX_SEQUENCE_NUMBER).internal_key()
);
<span class="macro">assert_eq!</span>(
cmp.find_shortest_sep(
LookupKey::new(<span class="string">&quot;abc&quot;</span>.as_bytes(), <span class="number">1</span>).internal_key(),
LookupKey::new(<span class="string">&quot;acd&quot;</span>.as_bytes(), <span class="number">2</span>).internal_key()
),
LookupKey::new(<span class="string">&quot;abd&quot;</span>.as_bytes(), <span class="number">1</span>).internal_key()
);
<span class="macro">assert_eq!</span>(
cmp.find_shortest_sep(
LookupKey::new(<span class="string">&quot;abc&quot;</span>.as_bytes(), <span class="number">1</span>).internal_key(),
LookupKey::new(<span class="string">&quot;abe&quot;</span>.as_bytes(), <span class="number">2</span>).internal_key()
),
LookupKey::new(<span class="string">&quot;abd&quot;</span>.as_bytes(), <span class="number">1</span>).internal_key()
);
<span class="macro">assert_eq!</span>(
cmp.find_shortest_sep(
LookupKey::new(<span class="string">&quot;&quot;</span>.as_bytes(), <span class="number">1</span>).internal_key(),
LookupKey::new(<span class="string">&quot;&quot;</span>.as_bytes(), <span class="number">2</span>).internal_key()
),
LookupKey::new(<span class="string">&quot;&quot;</span>.as_bytes(), <span class="number">1</span>).internal_key()
);
<span class="macro">assert_eq!</span>(
cmp.find_shortest_sep(
LookupKey::new(<span class="string">&quot;abc&quot;</span>.as_bytes(), <span class="number">2</span>).internal_key(),
LookupKey::new(<span class="string">&quot;abc&quot;</span>.as_bytes(), <span class="number">2</span>).internal_key()
),
LookupKey::new(<span class="string">&quot;abc&quot;</span>.as_bytes(), <span class="number">2</span>).internal_key()
);
}
<span class="kw">fn </span>test_cmp_internalkeycmp() {
<span class="kw">let </span>cmp = InternalKeyCmp(Rc::new(Box::new(DefaultCmp)));
<span class="comment">// a &lt; b &lt; c
</span><span class="kw">let </span>a = LookupKey::new(<span class="string">&quot;abc&quot;</span>.as_bytes(), <span class="number">2</span>).internal_key().to_vec();
<span class="kw">let </span>b = LookupKey::new(<span class="string">&quot;abc&quot;</span>.as_bytes(), <span class="number">1</span>).internal_key().to_vec();
<span class="kw">let </span>c = LookupKey::new(<span class="string">&quot;abd&quot;</span>.as_bytes(), <span class="number">3</span>).internal_key().to_vec();
<span class="kw">let </span>d = <span class="string">&quot;xyy&quot;</span>.as_bytes();
<span class="kw">let </span>e = <span class="string">&quot;xyz&quot;</span>.as_bytes();
<span class="macro">assert_eq!</span>(Ordering::Less, cmp.cmp(<span class="kw-2">&amp;</span>a, <span class="kw-2">&amp;</span>b));
<span class="macro">assert_eq!</span>(Ordering::Equal, cmp.cmp(<span class="kw-2">&amp;</span>a, <span class="kw-2">&amp;</span>a));
<span class="macro">assert_eq!</span>(Ordering::Greater, cmp.cmp(<span class="kw-2">&amp;</span>b, <span class="kw-2">&amp;</span>a));
<span class="macro">assert_eq!</span>(Ordering::Less, cmp.cmp(<span class="kw-2">&amp;</span>a, <span class="kw-2">&amp;</span>c));
<span class="macro">assert_eq!</span>(Ordering::Less, cmp.cmp_inner(d, e));
<span class="macro">assert_eq!</span>(Ordering::Greater, cmp.cmp_inner(e, d));
}
<span class="kw">fn </span>test_cmp_memtablekeycmp_panics() {
<span class="kw">let </span>cmp = MemtableKeyCmp(Rc::new(Box::new(DefaultCmp)));
cmp.cmp(<span class="kw-2">&amp;</span>[<span class="number">1</span>, <span class="number">2</span>, <span class="number">3</span>], <span class="kw-2">&amp;</span>[<span class="number">4</span>, <span class="number">5</span>, <span class="number">6</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>