blob: 77374e23cab1e755dfcfa4df3bd48ffdd015fc1c [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 `/root/.cargo/git/checkouts/tantivy-65d0bbbddbbd5d02/433372d/fastfield_codecs/src/compact_space/mod.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>mod.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="../../../fastfield_codecs/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="../../../fastfield_codecs/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>
</pre><pre class="rust"><code><span class="doccomment">/// This codec takes a large number space (u128) and reduces it to a compact number space.
///
/// It will find spaces in the number range. For example:
///
/// 100, 101, 102, 103, 104, 50000, 50001
/// could be mapped to
/// 100..104 -&gt; 0..4
/// 50000..50001 -&gt; 5..6
///
/// Compact space 0..=6 requires much less bits than 100..=50001
///
/// The codec is created to compress ip addresses, but may be employed in other use cases.
</span><span class="kw">use </span>std::{
cmp::Ordering,
collections::BTreeSet,
io::{<span class="self">self</span>, Write},
ops::{Range, RangeInclusive},
};
<span class="kw">use </span>common::{BinarySerializable, CountingWriter, VInt, VIntU128};
<span class="kw">use </span>ownedbytes::OwnedBytes;
<span class="kw">use </span>tantivy_bitpacker::{<span class="self">self</span>, BitPacker, BitUnpacker};
<span class="kw">use </span><span class="kw">crate</span>::compact_space::build_compact_space::get_compact_space;
<span class="kw">use </span><span class="kw">crate</span>::Column;
<span class="kw">mod </span>blank_range;
<span class="kw">mod </span>build_compact_space;
<span class="doccomment">/// The cost per blank is quite hard actually, since blanks are delta encoded, the actual cost of
/// blanks depends on the number of blanks.
///
/// The number is taken by looking at a real dataset. It is optimized for larger datasets.
</span><span class="kw">const </span>COST_PER_BLANK_IN_BITS: usize = <span class="number">36</span>;
<span class="attribute">#[derive(Debug, Clone, Eq, PartialEq)]
</span><span class="kw">pub struct </span>CompactSpace {
ranges_mapping: Vec&lt;RangeMapping&gt;,
}
<span class="doccomment">/// Maps the range from the original space to compact_start + range.len()
</span><span class="attribute">#[derive(Debug, Clone, Eq, PartialEq)]
</span><span class="kw">struct </span>RangeMapping {
value_range: RangeInclusive&lt;u128&gt;,
compact_start: u64,
}
<span class="kw">impl </span>RangeMapping {
<span class="kw">fn </span>range_length(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; u64 {
(<span class="self">self</span>.value_range.end() - <span class="self">self</span>.value_range.start()) <span class="kw">as </span>u64 + <span class="number">1
</span>}
<span class="comment">// The last value of the compact space in this range
</span><span class="kw">fn </span>compact_end(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; u64 {
<span class="self">self</span>.compact_start + <span class="self">self</span>.range_length() - <span class="number">1
</span>}
}
<span class="kw">impl </span>BinarySerializable <span class="kw">for </span>CompactSpace {
<span class="kw">fn </span>serialize&lt;W: io::Write&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, writer: <span class="kw-2">&amp;mut </span>W) -&gt; io::Result&lt;()&gt; {
VInt(<span class="self">self</span>.ranges_mapping.len() <span class="kw">as </span>u64).serialize(writer)<span class="question-mark">?</span>;
<span class="kw">let </span><span class="kw-2">mut </span>prev_value = <span class="number">0</span>;
<span class="kw">for </span>value_range <span class="kw">in </span><span class="self">self
</span>.ranges_mapping
.iter()
.map(|range_mapping| <span class="kw-2">&amp;</span>range_mapping.value_range)
{
<span class="kw">let </span>blank_delta_start = value_range.start() - prev_value;
VIntU128(blank_delta_start).serialize(writer)<span class="question-mark">?</span>;
prev_value = <span class="kw-2">*</span>value_range.start();
<span class="kw">let </span>blank_delta_end = value_range.end() - prev_value;
VIntU128(blank_delta_end).serialize(writer)<span class="question-mark">?</span>;
prev_value = <span class="kw-2">*</span>value_range.end();
}
<span class="prelude-val">Ok</span>(())
}
<span class="kw">fn </span>deserialize&lt;R: io::Read&gt;(reader: <span class="kw-2">&amp;mut </span>R) -&gt; io::Result&lt;<span class="self">Self</span>&gt; {
<span class="kw">let </span>num_ranges = VInt::deserialize(reader)<span class="question-mark">?</span>.<span class="number">0</span>;
<span class="kw">let </span><span class="kw-2">mut </span>ranges_mapping: Vec&lt;RangeMapping&gt; = <span class="macro">vec!</span>[];
<span class="kw">let </span><span class="kw-2">mut </span>value = <span class="number">0u128</span>;
<span class="kw">let </span><span class="kw-2">mut </span>compact_start = <span class="number">1u64</span>; <span class="comment">// 0 is reserved for `null`
</span><span class="kw">for _ in </span><span class="number">0</span>..num_ranges {
<span class="kw">let </span>blank_delta_start = VIntU128::deserialize(reader)<span class="question-mark">?</span>.<span class="number">0</span>;
value += blank_delta_start;
<span class="kw">let </span>blank_start = value;
<span class="kw">let </span>blank_delta_end = VIntU128::deserialize(reader)<span class="question-mark">?</span>.<span class="number">0</span>;
value += blank_delta_end;
<span class="kw">let </span>blank_end = value;
<span class="kw">let </span>range_mapping = RangeMapping {
value_range: blank_start..=blank_end,
compact_start,
};
<span class="kw">let </span>range_length = range_mapping.range_length();
ranges_mapping.push(range_mapping);
compact_start += range_length <span class="kw">as </span>u64;
}
<span class="prelude-val">Ok</span>(<span class="self">Self </span>{ ranges_mapping })
}
}
<span class="kw">impl </span>CompactSpace {
<span class="doccomment">/// Amplitude is the value range of the compact space including the sentinel value used to
/// identify null values. The compact space is 0..=amplitude .
///
/// It&#39;s only used to verify we don&#39;t exceed u64 number space, which would indicate a bug.
</span><span class="kw">fn </span>amplitude_compact_space(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; u128 {
<span class="self">self</span>.ranges_mapping
.last()
.map(|last_range| last_range.compact_end() <span class="kw">as </span>u128)
.unwrap_or(<span class="number">1</span>) <span class="comment">// compact space starts at 1, 0 == null
</span>}
<span class="kw">fn </span>get_range_mapping(<span class="kw-2">&amp;</span><span class="self">self</span>, pos: usize) -&gt; <span class="kw-2">&amp;</span>RangeMapping {
<span class="kw-2">&amp;</span><span class="self">self</span>.ranges_mapping[pos]
}
<span class="doccomment">/// Returns either Ok(the value in the compact space) or if it is outside the compact space the
/// Err(position where it would be inserted)
</span><span class="kw">fn </span>u128_to_compact(<span class="kw-2">&amp;</span><span class="self">self</span>, value: u128) -&gt; <span class="prelude-ty">Result</span>&lt;u64, usize&gt; {
<span class="self">self</span>.ranges_mapping
.binary_search_by(|probe| {
<span class="kw">let </span>value_range = <span class="kw-2">&amp;</span>probe.value_range;
<span class="kw">if </span>value &lt; <span class="kw-2">*</span>value_range.start() {
Ordering::Greater
} <span class="kw">else if </span>value &gt; <span class="kw-2">*</span>value_range.end() {
Ordering::Less
} <span class="kw">else </span>{
Ordering::Equal
}
})
.map(|pos| {
<span class="kw">let </span>range_mapping = <span class="kw-2">&amp;</span><span class="self">self</span>.ranges_mapping[pos];
<span class="kw">let </span>pos_in_range = (value - range_mapping.value_range.start()) <span class="kw">as </span>u64;
range_mapping.compact_start + pos_in_range
})
}
<span class="doccomment">/// Unpacks a value from compact space u64 to u128 space
</span><span class="kw">fn </span>compact_to_u128(<span class="kw-2">&amp;</span><span class="self">self</span>, compact: u64) -&gt; u128 {
<span class="kw">let </span>pos = <span class="self">self
</span>.ranges_mapping
.binary_search_by_key(<span class="kw-2">&amp;</span>compact, |range_mapping| range_mapping.compact_start)
<span class="comment">// Correctness: Overflow. The first range starts at compact space 0, the error from
// binary search can never be 0
</span>.map_or_else(|e| e - <span class="number">1</span>, |v| v);
<span class="kw">let </span>range_mapping = <span class="kw-2">&amp;</span><span class="self">self</span>.ranges_mapping[pos];
<span class="kw">let </span>diff = compact - range_mapping.compact_start;
range_mapping.value_range.start() + diff <span class="kw">as </span>u128
}
}
<span class="kw">pub struct </span>CompactSpaceCompressor {
params: IPCodecParams,
}
<span class="attribute">#[derive(Debug, Clone)]
</span><span class="kw">pub struct </span>IPCodecParams {
compact_space: CompactSpace,
bit_unpacker: BitUnpacker,
min_value: u128,
max_value: u128,
num_vals: u32,
num_bits: u8,
}
<span class="kw">impl </span>CompactSpaceCompressor {
<span class="doccomment">/// Taking the vals as Vec may cost a lot of memory. It is used to sort the vals.
</span><span class="kw">pub fn </span>train_from(iter: <span class="kw">impl </span>Iterator&lt;Item = u128&gt;, num_vals: u32) -&gt; <span class="self">Self </span>{
<span class="kw">let </span><span class="kw-2">mut </span>values_sorted = BTreeSet::new();
values_sorted.extend(iter);
<span class="kw">let </span>total_num_values = num_vals;
<span class="kw">let </span>compact_space =
get_compact_space(<span class="kw-2">&amp;</span>values_sorted, total_num_values, COST_PER_BLANK_IN_BITS);
<span class="kw">let </span>amplitude_compact_space = compact_space.amplitude_compact_space();
<span class="macro">assert!</span>(
amplitude_compact_space &lt;= u64::MAX <span class="kw">as </span>u128,
<span class="string">&quot;case unsupported.&quot;
</span>);
<span class="kw">let </span>num_bits = tantivy_bitpacker::compute_num_bits(amplitude_compact_space <span class="kw">as </span>u64);
<span class="kw">let </span>min_value = <span class="kw-2">*</span>values_sorted.iter().next().unwrap_or(<span class="kw-2">&amp;</span><span class="number">0</span>);
<span class="kw">let </span>max_value = <span class="kw-2">*</span>values_sorted.iter().last().unwrap_or(<span class="kw-2">&amp;</span><span class="number">0</span>);
<span class="macro">assert_eq!</span>(
compact_space
.u128_to_compact(max_value)
.expect(<span class="string">&quot;could not convert max value to compact space&quot;</span>),
amplitude_compact_space <span class="kw">as </span>u64
);
CompactSpaceCompressor {
params: IPCodecParams {
compact_space,
bit_unpacker: BitUnpacker::new(num_bits),
min_value,
max_value,
num_vals: total_num_values,
num_bits,
},
}
}
<span class="kw">fn </span>write_footer(<span class="self">self</span>, writer: <span class="kw-2">&amp;mut </span><span class="kw">impl </span>Write) -&gt; io::Result&lt;()&gt; {
<span class="kw">let </span>writer = <span class="kw-2">&amp;mut </span>CountingWriter::wrap(writer);
<span class="self">self</span>.params.serialize(writer)<span class="question-mark">?</span>;
<span class="kw">let </span>footer_len = writer.written_bytes() <span class="kw">as </span>u32;
footer_len.serialize(writer)<span class="question-mark">?</span>;
<span class="prelude-val">Ok</span>(())
}
<span class="kw">pub fn </span>compress_into(
<span class="self">self</span>,
vals: <span class="kw">impl </span>Iterator&lt;Item = u128&gt;,
write: <span class="kw-2">&amp;mut </span><span class="kw">impl </span>Write,
) -&gt; io::Result&lt;()&gt; {
<span class="kw">let </span><span class="kw-2">mut </span>bitpacker = BitPacker::default();
<span class="kw">for </span>val <span class="kw">in </span>vals {
<span class="kw">let </span>compact = <span class="self">self
</span>.params
.compact_space
.u128_to_compact(val)
.map_err(|<span class="kw">_</span>| {
io::Error::new(
io::ErrorKind::InvalidData,
<span class="string">&quot;Could not convert value to compact_space. This is a bug.&quot;</span>,
)
})<span class="question-mark">?</span>;
bitpacker.write(compact, <span class="self">self</span>.params.num_bits, write)<span class="question-mark">?</span>;
}
bitpacker.close(write)<span class="question-mark">?</span>;
<span class="self">self</span>.write_footer(write)<span class="question-mark">?</span>;
<span class="prelude-val">Ok</span>(())
}
}
<span class="attribute">#[derive(Debug, Clone)]
</span><span class="kw">pub struct </span>CompactSpaceDecompressor {
data: OwnedBytes,
params: IPCodecParams,
}
<span class="kw">impl </span>BinarySerializable <span class="kw">for </span>IPCodecParams {
<span class="kw">fn </span>serialize&lt;W: io::Write&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, writer: <span class="kw-2">&amp;mut </span>W) -&gt; io::Result&lt;()&gt; {
<span class="comment">// header flags for future optional dictionary encoding
</span><span class="kw">let </span>footer_flags = <span class="number">0u64</span>;
footer_flags.serialize(writer)<span class="question-mark">?</span>;
VIntU128(<span class="self">self</span>.min_value).serialize(writer)<span class="question-mark">?</span>;
VIntU128(<span class="self">self</span>.max_value).serialize(writer)<span class="question-mark">?</span>;
VIntU128(<span class="self">self</span>.num_vals <span class="kw">as </span>u128).serialize(writer)<span class="question-mark">?</span>;
<span class="self">self</span>.num_bits.serialize(writer)<span class="question-mark">?</span>;
<span class="self">self</span>.compact_space.serialize(writer)<span class="question-mark">?</span>;
<span class="prelude-val">Ok</span>(())
}
<span class="kw">fn </span>deserialize&lt;R: io::Read&gt;(reader: <span class="kw-2">&amp;mut </span>R) -&gt; io::Result&lt;<span class="self">Self</span>&gt; {
<span class="kw">let </span>_header_flags = u64::deserialize(reader)<span class="question-mark">?</span>;
<span class="kw">let </span>min_value = VIntU128::deserialize(reader)<span class="question-mark">?</span>.<span class="number">0</span>;
<span class="kw">let </span>max_value = VIntU128::deserialize(reader)<span class="question-mark">?</span>.<span class="number">0</span>;
<span class="kw">let </span>num_vals = VIntU128::deserialize(reader)<span class="question-mark">?</span>.<span class="number">0 </span><span class="kw">as </span>u32;
<span class="kw">let </span>num_bits = u8::deserialize(reader)<span class="question-mark">?</span>;
<span class="kw">let </span>compact_space = CompactSpace::deserialize(reader)<span class="question-mark">?</span>;
<span class="prelude-val">Ok</span>(<span class="self">Self </span>{
compact_space,
bit_unpacker: BitUnpacker::new(num_bits),
min_value,
max_value,
num_vals,
num_bits,
})
}
}
<span class="kw">impl </span>Column&lt;u128&gt; <span class="kw">for </span>CompactSpaceDecompressor {
<span class="attribute">#[inline]
</span><span class="kw">fn </span>get_val(<span class="kw-2">&amp;</span><span class="self">self</span>, doc: u32) -&gt; u128 {
<span class="self">self</span>.get(doc)
}
<span class="kw">fn </span>min_value(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; u128 {
<span class="self">self</span>.min_value()
}
<span class="kw">fn </span>max_value(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; u128 {
<span class="self">self</span>.max_value()
}
<span class="kw">fn </span>num_vals(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; u32 {
<span class="self">self</span>.params.num_vals
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>iter(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; Box&lt;<span class="kw">dyn </span>Iterator&lt;Item = u128&gt; + <span class="lifetime">&#39;_</span>&gt; {
Box::new(<span class="self">self</span>.iter())
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>get_docids_for_value_range(
<span class="kw-2">&amp;</span><span class="self">self</span>,
value_range: RangeInclusive&lt;u128&gt;,
positions_range: Range&lt;u32&gt;,
positions: <span class="kw-2">&amp;mut </span>Vec&lt;u32&gt;,
) {
<span class="self">self</span>.get_positions_for_value_range(value_range, positions_range, positions)
}
}
<span class="kw">impl </span>CompactSpaceDecompressor {
<span class="kw">pub fn </span>open(data: OwnedBytes) -&gt; io::Result&lt;CompactSpaceDecompressor&gt; {
<span class="kw">let </span>(data_slice, footer_len_bytes) = data.split_at(data.len() - <span class="number">4</span>);
<span class="kw">let </span>footer_len = u32::deserialize(<span class="kw-2">&amp;mut &amp;</span>footer_len_bytes[..])<span class="question-mark">?</span>;
<span class="kw">let </span>data_footer = <span class="kw-2">&amp;</span>data_slice[data_slice.len() - footer_len <span class="kw">as </span>usize..];
<span class="kw">let </span>params = IPCodecParams::deserialize(<span class="kw-2">&amp;mut &amp;</span>data_footer[..])<span class="question-mark">?</span>;
<span class="kw">let </span>decompressor = CompactSpaceDecompressor { data, params };
<span class="prelude-val">Ok</span>(decompressor)
}
<span class="doccomment">/// Converting to compact space for the decompressor is more complex, since we may get values
/// which are outside the compact space. e.g. if we map
/// 1000 =&gt; 5
/// 2000 =&gt; 6
///
/// and we want a mapping for 1005, there is no equivalent compact space. We instead return an
/// error with the index of the next range.
</span><span class="kw">fn </span>u128_to_compact(<span class="kw-2">&amp;</span><span class="self">self</span>, value: u128) -&gt; <span class="prelude-ty">Result</span>&lt;u64, usize&gt; {
<span class="self">self</span>.params.compact_space.u128_to_compact(value)
}
<span class="kw">fn </span>compact_to_u128(<span class="kw-2">&amp;</span><span class="self">self</span>, compact: u64) -&gt; u128 {
<span class="self">self</span>.params.compact_space.compact_to_u128(compact)
}
<span class="doccomment">/// Comparing on compact space: Random dataset 0,24 (50% random hit) - 1.05 GElements/s
/// Comparing on compact space: Real dataset 1.08 GElements/s
///
/// Comparing on original space: Real dataset .06 GElements/s (not completely optimized)
</span><span class="attribute">#[inline]
</span><span class="kw">pub fn </span>get_positions_for_value_range(
<span class="kw-2">&amp;</span><span class="self">self</span>,
value_range: RangeInclusive&lt;u128&gt;,
position_range: Range&lt;u32&gt;,
positions: <span class="kw-2">&amp;mut </span>Vec&lt;u32&gt;,
) {
<span class="kw">if </span>value_range.start() &gt; value_range.end() {
<span class="kw">return</span>;
}
<span class="kw">let </span>position_range = position_range.start..position_range.end.min(<span class="self">self</span>.num_vals());
<span class="kw">let </span>from_value = <span class="kw-2">*</span>value_range.start();
<span class="kw">let </span>to_value = <span class="kw-2">*</span>value_range.end();
<span class="macro">assert!</span>(to_value &gt;= from_value);
<span class="kw">let </span>compact_from = <span class="self">self</span>.u128_to_compact(from_value);
<span class="kw">let </span>compact_to = <span class="self">self</span>.u128_to_compact(to_value);
<span class="comment">// Quick return, if both ranges fall into the same non-mapped space, the range can&#39;t cover
// any values, so we can early exit
</span><span class="kw">match </span>(compact_to, compact_from) {
(<span class="prelude-val">Err</span>(pos1), <span class="prelude-val">Err</span>(pos2)) <span class="kw">if </span>pos1 == pos2 =&gt; <span class="kw">return</span>,
<span class="kw">_ </span>=&gt; {}
}
<span class="kw">let </span>compact_from = compact_from.unwrap_or_else(|pos| {
<span class="comment">// Correctness: Out of bounds, if this value is Err(last_index + 1), we early exit,
// since the to_value also mapps into the same non-mapped space
</span><span class="kw">let </span>range_mapping = <span class="self">self</span>.params.compact_space.get_range_mapping(pos);
range_mapping.compact_start
});
<span class="comment">// If there is no compact space, we go to the closest upperbound compact space
</span><span class="kw">let </span>compact_to = compact_to.unwrap_or_else(|pos| {
<span class="comment">// Correctness: Overflow, if this value is Err(0), we early exit,
// since the from_value also mapps into the same non-mapped space
// Get end of previous range
</span><span class="kw">let </span>pos = pos - <span class="number">1</span>;
<span class="kw">let </span>range_mapping = <span class="self">self</span>.params.compact_space.get_range_mapping(pos);
range_mapping.compact_end()
});
<span class="kw">let </span>range = compact_from..=compact_to;
<span class="kw">let </span>scan_num_docs = position_range.end - position_range.start;
<span class="kw">let </span>step_size = <span class="number">4</span>;
<span class="kw">let </span>cutoff = position_range.start + scan_num_docs - scan_num_docs % step_size;
<span class="kw">let </span><span class="kw-2">mut </span>push_if_in_range = |idx, val| {
<span class="kw">if </span>range.contains(<span class="kw-2">&amp;</span>val) {
positions.push(idx);
}
};
<span class="kw">let </span>get_val = |idx| <span class="self">self</span>.params.bit_unpacker.get(idx, <span class="kw-2">&amp;</span><span class="self">self</span>.data);
<span class="comment">// unrolled loop
</span><span class="kw">for </span>idx <span class="kw">in </span>(position_range.start..cutoff).step_by(step_size <span class="kw">as </span>usize) {
<span class="kw">let </span>idx1 = idx;
<span class="kw">let </span>idx2 = idx + <span class="number">1</span>;
<span class="kw">let </span>idx3 = idx + <span class="number">2</span>;
<span class="kw">let </span>idx4 = idx + <span class="number">3</span>;
<span class="kw">let </span>val1 = get_val(idx1 <span class="kw">as </span>u32);
<span class="kw">let </span>val2 = get_val(idx2 <span class="kw">as </span>u32);
<span class="kw">let </span>val3 = get_val(idx3 <span class="kw">as </span>u32);
<span class="kw">let </span>val4 = get_val(idx4 <span class="kw">as </span>u32);
push_if_in_range(idx1, val1);
push_if_in_range(idx2, val2);
push_if_in_range(idx3, val3);
push_if_in_range(idx4, val4);
}
<span class="comment">// handle rest
</span><span class="kw">for </span>idx <span class="kw">in </span>cutoff..position_range.end {
push_if_in_range(idx, get_val(idx <span class="kw">as </span>u32));
}
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>iter_compact(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw">impl </span>Iterator&lt;Item = u64&gt; + <span class="lifetime">&#39;_ </span>{
(<span class="number">0</span>..<span class="self">self</span>.params.num_vals)
.map(<span class="kw">move </span>|idx| <span class="self">self</span>.params.bit_unpacker.get(idx, <span class="kw-2">&amp;</span><span class="self">self</span>.data) <span class="kw">as </span>u64)
}
<span class="attribute">#[inline]
</span><span class="kw">fn </span>iter(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw">impl </span>Iterator&lt;Item = u128&gt; + <span class="lifetime">&#39;_ </span>{
<span class="comment">// TODO: Performance. It would be better to iterate on the ranges and check existence via
// the bit_unpacker.
</span><span class="self">self</span>.iter_compact()
.map(|compact| <span class="self">self</span>.compact_to_u128(compact))
}
<span class="attribute">#[inline]
</span><span class="kw">pub fn </span>get(<span class="kw-2">&amp;</span><span class="self">self</span>, idx: u32) -&gt; u128 {
<span class="kw">let </span>compact = <span class="self">self</span>.params.bit_unpacker.get(idx, <span class="kw-2">&amp;</span><span class="self">self</span>.data);
<span class="self">self</span>.compact_to_u128(compact)
}
<span class="kw">pub fn </span>min_value(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; u128 {
<span class="self">self</span>.params.min_value
}
<span class="kw">pub fn </span>max_value(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; u128 {
<span class="self">self</span>.params.max_value
}
}
<span class="attribute">#[cfg(test)]
</span><span class="kw">mod </span>tests {
<span class="kw">use </span>std::fmt;
<span class="kw">use super</span>::<span class="kw-2">*</span>;
<span class="kw">use </span><span class="kw">crate</span>::format_version::read_format_version;
<span class="kw">use </span><span class="kw">crate</span>::null_index_footer::read_null_index_footer;
<span class="kw">use </span><span class="kw">crate</span>::serialize::U128Header;
<span class="kw">use crate</span>::{open_u128, serialize_u128};
<span class="attribute">#[test]
</span><span class="kw">fn </span>compact_space_test() {
<span class="kw">let </span>ips = <span class="kw-2">&amp;</span>[
<span class="number">2u128</span>, <span class="number">4u128</span>, <span class="number">1000</span>, <span class="number">1001</span>, <span class="number">1002</span>, <span class="number">1003</span>, <span class="number">1004</span>, <span class="number">1005</span>, <span class="number">1008</span>, <span class="number">1010</span>, <span class="number">1012</span>, <span class="number">1260</span>,
]
.into_iter()
.collect();
<span class="kw">let </span>compact_space = get_compact_space(ips, ips.len() <span class="kw">as </span>u32, <span class="number">11</span>);
<span class="kw">let </span>amplitude = compact_space.amplitude_compact_space();
<span class="macro">assert_eq!</span>(amplitude, <span class="number">17</span>);
<span class="macro">assert_eq!</span>(<span class="number">1</span>, compact_space.u128_to_compact(<span class="number">2</span>).unwrap());
<span class="macro">assert_eq!</span>(<span class="number">2</span>, compact_space.u128_to_compact(<span class="number">3</span>).unwrap());
<span class="macro">assert_eq!</span>(compact_space.u128_to_compact(<span class="number">100</span>).unwrap_err(), <span class="number">1</span>);
<span class="kw">for </span>(num1, num2) <span class="kw">in </span>(<span class="number">0</span>..<span class="number">3</span>).tuple_windows() {
<span class="macro">assert_eq!</span>(
compact_space.get_range_mapping(num1).compact_end() + <span class="number">1</span>,
compact_space.get_range_mapping(num2).compact_start
);
}
<span class="kw">let </span><span class="kw-2">mut </span>output: Vec&lt;u8&gt; = Vec::new();
compact_space.serialize(<span class="kw-2">&amp;mut </span>output).unwrap();
<span class="macro">assert_eq!</span>(
compact_space,
CompactSpace::deserialize(<span class="kw-2">&amp;mut &amp;</span>output[..]).unwrap()
);
<span class="kw">for </span>ip <span class="kw">in </span>ips {
<span class="kw">let </span>compact = compact_space.u128_to_compact(<span class="kw-2">*</span>ip).unwrap();
<span class="macro">assert_eq!</span>(compact_space.compact_to_u128(compact), <span class="kw-2">*</span>ip);
}
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>compact_space_amplitude_test() {
<span class="kw">let </span>ips = <span class="kw-2">&amp;</span>[<span class="number">100000u128</span>, <span class="number">1000000</span>].into_iter().collect();
<span class="kw">let </span>compact_space = get_compact_space(ips, ips.len() <span class="kw">as </span>u32, <span class="number">1</span>);
<span class="kw">let </span>amplitude = compact_space.amplitude_compact_space();
<span class="macro">assert_eq!</span>(amplitude, <span class="number">2</span>);
}
<span class="kw">fn </span>test_all(<span class="kw-2">mut </span>data: OwnedBytes, expected: <span class="kw-2">&amp;</span>[u128]) {
<span class="kw">let </span>_header = U128Header::deserialize(<span class="kw-2">&amp;mut </span>data);
<span class="kw">let </span>decompressor = CompactSpaceDecompressor::open(data).unwrap();
<span class="kw">for </span>(idx, expected_val) <span class="kw">in </span>expected.iter().cloned().enumerate() {
<span class="kw">let </span>val = decompressor.get(idx <span class="kw">as </span>u32);
<span class="macro">assert_eq!</span>(val, expected_val);
<span class="kw">let </span>test_range = |range: RangeInclusive&lt;u128&gt;| {
<span class="kw">let </span>expected_positions = expected
.iter()
.positions(|val| range.contains(val))
.map(|pos| pos <span class="kw">as </span>u32)
.collect::&lt;Vec&lt;<span class="kw">_</span>&gt;&gt;();
<span class="kw">let </span><span class="kw-2">mut </span>positions = Vec::new();
decompressor.get_positions_for_value_range(
range,
<span class="number">0</span>..decompressor.num_vals(),
<span class="kw-2">&amp;mut </span>positions,
);
<span class="macro">assert_eq!</span>(positions, expected_positions);
};
test_range(expected_val.saturating_sub(<span class="number">1</span>)..=expected_val);
test_range(expected_val..=expected_val);
test_range(expected_val..=expected_val.saturating_add(<span class="number">1</span>));
test_range(expected_val.saturating_sub(<span class="number">1</span>)..=expected_val.saturating_add(<span class="number">1</span>));
}
}
<span class="kw">fn </span>test_aux_vals(u128_vals: <span class="kw-2">&amp;</span>[u128]) -&gt; OwnedBytes {
<span class="kw">let </span><span class="kw-2">mut </span>out = Vec::new();
serialize_u128(
|| u128_vals.iter().cloned(),
u128_vals.len() <span class="kw">as </span>u32,
<span class="kw-2">&amp;mut </span>out,
)
.unwrap();
<span class="kw">let </span>data = OwnedBytes::new(out);
<span class="kw">let </span>(data, _format_version) = read_format_version(data).unwrap();
<span class="kw">let </span>(data, _null_index_footer) = read_null_index_footer(data).unwrap();
test_all(data.clone(), u128_vals);
data
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_range_1() {
<span class="kw">let </span>vals = <span class="kw-2">&amp;</span>[
<span class="number">1u128</span>,
<span class="number">100u128</span>,
<span class="number">3u128</span>,
<span class="number">99999u128</span>,
<span class="number">100000u128</span>,
<span class="number">100001u128</span>,
<span class="number">4_000_211_221u128</span>,
<span class="number">4_000_211_222u128</span>,
<span class="number">333u128</span>,
];
<span class="kw">let </span><span class="kw-2">mut </span>data = test_aux_vals(vals);
<span class="kw">let </span>_header = U128Header::deserialize(<span class="kw-2">&amp;mut </span>data);
<span class="kw">let </span>decomp = CompactSpaceDecompressor::open(data).unwrap();
<span class="kw">let </span>complete_range = <span class="number">0</span>..vals.len() <span class="kw">as </span>u32;
<span class="kw">for </span>(pos, val) <span class="kw">in </span>vals.iter().enumerate() {
<span class="kw">let </span>val = <span class="kw-2">*</span>val <span class="kw">as </span>u128;
<span class="kw">let </span>pos = pos <span class="kw">as </span>u32;
<span class="kw">let </span><span class="kw-2">mut </span>positions = Vec::new();
decomp.get_positions_for_value_range(val..=val, pos..pos + <span class="number">1</span>, <span class="kw-2">&amp;mut </span>positions);
<span class="macro">assert_eq!</span>(positions, <span class="macro">vec!</span>[pos]);
}
<span class="comment">// handle docid range out of bounds
</span><span class="kw">let </span>positions = get_positions_for_value_range_helper(<span class="kw-2">&amp;</span>decomp, <span class="number">0</span>..=<span class="number">1</span>, <span class="number">1</span>..u32::MAX);
<span class="macro">assert_eq!</span>(positions, <span class="macro">vec!</span>[]);
<span class="kw">let </span>positions =
get_positions_for_value_range_helper(<span class="kw-2">&amp;</span>decomp, <span class="number">0</span>..=<span class="number">1</span>, complete_range.clone());
<span class="macro">assert_eq!</span>(positions, <span class="macro">vec!</span>[<span class="number">0</span>]);
<span class="kw">let </span>positions =
get_positions_for_value_range_helper(<span class="kw-2">&amp;</span>decomp, <span class="number">0</span>..=<span class="number">2</span>, complete_range.clone());
<span class="macro">assert_eq!</span>(positions, <span class="macro">vec!</span>[<span class="number">0</span>]);
<span class="kw">let </span>positions =
get_positions_for_value_range_helper(<span class="kw-2">&amp;</span>decomp, <span class="number">0</span>..=<span class="number">3</span>, complete_range.clone());
<span class="macro">assert_eq!</span>(positions, <span class="macro">vec!</span>[<span class="number">0</span>, <span class="number">2</span>]);
<span class="macro">assert_eq!</span>(
get_positions_for_value_range_helper(
<span class="kw-2">&amp;</span>decomp,
<span class="number">99999u128</span>..=<span class="number">99999u128</span>,
complete_range.clone()
),
<span class="macro">vec!</span>[<span class="number">3</span>]
);
<span class="macro">assert_eq!</span>(
get_positions_for_value_range_helper(
<span class="kw-2">&amp;</span>decomp,
<span class="number">99999u128</span>..=<span class="number">100000u128</span>,
complete_range.clone()
),
<span class="macro">vec!</span>[<span class="number">3</span>, <span class="number">4</span>]
);
<span class="macro">assert_eq!</span>(
get_positions_for_value_range_helper(
<span class="kw-2">&amp;</span>decomp,
<span class="number">99998u128</span>..=<span class="number">100000u128</span>,
complete_range.clone()
),
<span class="macro">vec!</span>[<span class="number">3</span>, <span class="number">4</span>]
);
<span class="macro">assert_eq!</span>(
get_positions_for_value_range_helper(
<span class="kw-2">&amp;</span>decomp,
<span class="number">99998u128</span>..=<span class="number">99999u128</span>,
complete_range.clone()
),
<span class="macro">vec!</span>[<span class="number">3</span>]
);
<span class="macro">assert_eq!</span>(
get_positions_for_value_range_helper(
<span class="kw-2">&amp;</span>decomp,
<span class="number">99998u128</span>..=<span class="number">99998u128</span>,
complete_range.clone()
),
<span class="macro">vec!</span>[]
);
<span class="macro">assert_eq!</span>(
get_positions_for_value_range_helper(
<span class="kw-2">&amp;</span>decomp,
<span class="number">333u128</span>..=<span class="number">333u128</span>,
complete_range.clone()
),
<span class="macro">vec!</span>[<span class="number">8</span>]
);
<span class="macro">assert_eq!</span>(
get_positions_for_value_range_helper(
<span class="kw-2">&amp;</span>decomp,
<span class="number">332u128</span>..=<span class="number">333u128</span>,
complete_range.clone()
),
<span class="macro">vec!</span>[<span class="number">8</span>]
);
<span class="macro">assert_eq!</span>(
get_positions_for_value_range_helper(
<span class="kw-2">&amp;</span>decomp,
<span class="number">332u128</span>..=<span class="number">334u128</span>,
complete_range.clone()
),
<span class="macro">vec!</span>[<span class="number">8</span>]
);
<span class="macro">assert_eq!</span>(
get_positions_for_value_range_helper(
<span class="kw-2">&amp;</span>decomp,
<span class="number">333u128</span>..=<span class="number">334u128</span>,
complete_range.clone()
),
<span class="macro">vec!</span>[<span class="number">8</span>]
);
<span class="macro">assert_eq!</span>(
get_positions_for_value_range_helper(
<span class="kw-2">&amp;</span>decomp,
<span class="number">4_000_211_221u128</span>..=<span class="number">5_000_000_000u128</span>,
complete_range.clone()
),
<span class="macro">vec!</span>[<span class="number">6</span>, <span class="number">7</span>]
);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_empty() {
<span class="kw">let </span>vals = <span class="kw-2">&amp;</span>[];
<span class="kw">let </span>data = test_aux_vals(vals);
<span class="kw">let </span>_decomp = CompactSpaceDecompressor::open(data).unwrap();
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_range_2() {
<span class="kw">let </span>vals = <span class="kw-2">&amp;</span>[
<span class="number">100u128</span>,
<span class="number">99999u128</span>,
<span class="number">100000u128</span>,
<span class="number">100001u128</span>,
<span class="number">4_000_211_221u128</span>,
<span class="number">4_000_211_222u128</span>,
<span class="number">333u128</span>,
];
<span class="kw">let </span><span class="kw-2">mut </span>data = test_aux_vals(vals);
<span class="kw">let </span>_header = U128Header::deserialize(<span class="kw-2">&amp;mut </span>data);
<span class="kw">let </span>decomp = CompactSpaceDecompressor::open(data).unwrap();
<span class="kw">let </span>complete_range = <span class="number">0</span>..vals.len() <span class="kw">as </span>u32;
<span class="macro">assert_eq!</span>(
get_positions_for_value_range_helper(<span class="kw-2">&amp;</span>decomp, <span class="number">0</span>..=<span class="number">5</span>, complete_range.clone()),
<span class="macro">vec!</span>[]
);
<span class="macro">assert_eq!</span>(
get_positions_for_value_range_helper(<span class="kw-2">&amp;</span>decomp, <span class="number">0</span>..=<span class="number">100</span>, complete_range.clone()),
<span class="macro">vec!</span>[<span class="number">0</span>]
);
<span class="macro">assert_eq!</span>(
get_positions_for_value_range_helper(<span class="kw-2">&amp;</span>decomp, <span class="number">0</span>..=<span class="number">105</span>, complete_range.clone()),
<span class="macro">vec!</span>[<span class="number">0</span>]
);
}
<span class="kw">fn </span>get_positions_for_value_range_helper&lt;C: Column&lt;T&gt; + <span class="question-mark">?</span>Sized, T: PartialOrd + fmt::Debug&gt;(
column: <span class="kw-2">&amp;</span>C,
value_range: RangeInclusive&lt;T&gt;,
doc_id_range: Range&lt;u32&gt;,
) -&gt; Vec&lt;u32&gt; {
<span class="kw">let </span><span class="kw-2">mut </span>positions = Vec::new();
column.get_docids_for_value_range(value_range, doc_id_range, <span class="kw-2">&amp;mut </span>positions);
positions
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_range_3() {
<span class="kw">let </span>vals = <span class="kw-2">&amp;</span>[
<span class="number">200u128</span>,
<span class="number">201</span>,
<span class="number">202</span>,
<span class="number">203</span>,
<span class="number">204</span>,
<span class="number">204</span>,
<span class="number">206</span>,
<span class="number">207</span>,
<span class="number">208</span>,
<span class="number">209</span>,
<span class="number">210</span>,
<span class="number">1_000_000</span>,
<span class="number">5_000_000_000</span>,
];
<span class="kw">let </span><span class="kw-2">mut </span>out = Vec::new();
serialize_u128(|| vals.iter().cloned(), vals.len() <span class="kw">as </span>u32, <span class="kw-2">&amp;mut </span>out).unwrap();
<span class="kw">let </span>decomp = open_u128::&lt;u128&gt;(OwnedBytes::new(out)).unwrap();
<span class="kw">let </span>complete_range = <span class="number">0</span>..vals.len() <span class="kw">as </span>u32;
<span class="macro">assert_eq!</span>(
get_positions_for_value_range_helper(<span class="kw-2">&amp;*</span>decomp, <span class="number">199</span>..=<span class="number">200</span>, complete_range.clone()),
<span class="macro">vec!</span>[<span class="number">0</span>]
);
<span class="macro">assert_eq!</span>(
get_positions_for_value_range_helper(<span class="kw-2">&amp;*</span>decomp, <span class="number">199</span>..=<span class="number">201</span>, complete_range.clone()),
<span class="macro">vec!</span>[<span class="number">0</span>, <span class="number">1</span>]
);
<span class="macro">assert_eq!</span>(
get_positions_for_value_range_helper(<span class="kw-2">&amp;*</span>decomp, <span class="number">200</span>..=<span class="number">200</span>, complete_range.clone()),
<span class="macro">vec!</span>[<span class="number">0</span>]
);
<span class="macro">assert_eq!</span>(
get_positions_for_value_range_helper(
<span class="kw-2">&amp;*</span>decomp,
<span class="number">1_000_000</span>..=<span class="number">1_000_000</span>,
complete_range.clone()
),
<span class="macro">vec!</span>[<span class="number">11</span>]
);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_bug1() {
<span class="kw">let </span>vals = <span class="kw-2">&amp;</span>[<span class="number">9223372036854775806</span>];
<span class="kw">let </span>_data = test_aux_vals(vals);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_bug2() {
<span class="kw">let </span>vals = <span class="kw-2">&amp;</span>[<span class="number">340282366920938463463374607431768211455u128</span>];
<span class="kw">let </span>_data = test_aux_vals(vals);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_bug3() {
<span class="kw">let </span>vals = <span class="kw-2">&amp;</span>[<span class="number">340282366920938463463374607431768211454</span>];
<span class="kw">let </span>_data = test_aux_vals(vals);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_bug4() {
<span class="kw">let </span>vals = <span class="kw-2">&amp;</span>[<span class="number">340282366920938463463374607431768211455</span>, <span class="number">0</span>];
<span class="kw">let </span>_data = test_aux_vals(vals);
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_first_large_gaps() {
<span class="kw">let </span>vals = <span class="kw-2">&amp;</span>[<span class="number">1_000_000_000u128</span>; <span class="number">100</span>];
<span class="kw">let </span>_data = test_aux_vals(vals);
}
<span class="kw">use </span>itertools::Itertools;
<span class="kw">use </span>proptest::prelude::<span class="kw-2">*</span>;
<span class="kw">fn </span>num_strategy() -&gt; <span class="kw">impl </span>Strategy&lt;Value = u128&gt; {
<span class="macro">prop_oneof!</span>[
<span class="number">1 </span>=&gt; prop::num::u128::ANY.prop_map(|num| u128::MAX - (num % <span class="number">10</span>) ),
<span class="number">1 </span>=&gt; prop::num::u128::ANY.prop_map(|num| i64::MAX <span class="kw">as </span>u128 + <span class="number">5 </span>- (num % <span class="number">10</span>) ),
<span class="number">1 </span>=&gt; prop::num::u128::ANY.prop_map(|num| i128::MAX <span class="kw">as </span>u128 + <span class="number">5 </span>- (num % <span class="number">10</span>) ),
<span class="number">1 </span>=&gt; prop::num::u128::ANY.prop_map(|num| num % <span class="number">10 </span>),
<span class="number">20 </span>=&gt; prop::num::u128::ANY,
]
}
<span class="macro">proptest! </span>{
<span class="attribute">#![proptest_config(ProptestConfig::with_cases(<span class="number">10</span>))]
#[test]
</span><span class="kw">fn </span>compress_decompress_random(vals <span class="kw">in </span>proptest::collection::vec(num_strategy()
, <span class="number">1</span>..<span class="number">1000</span>)) {
<span class="kw">let </span>_data = test_aux_vals(<span class="kw-2">&amp;</span>vals);
}
}
}
</code></pre></div>
</section></div></main><div id="rustdoc-vars" data-root-path="../../../" data-current-crate="fastfield_codecs" data-themes="ayu,dark,light" data-resource-suffix="" data-rustdoc-version="1.66.0-nightly (5c8bff74b 2022-10-21)" ></div></body></html>