blob: 4a9949bdf4f8300c169ee85cc1de59d11103fc96 [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/line.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>line.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>
</pre><pre class="rust"><code><span class="kw">use </span>std::io;
<span class="kw">use </span>std::num::NonZeroU32;
<span class="kw">use </span>common::{BinarySerializable, VInt};
<span class="kw">use </span><span class="kw">crate</span>::Column;
<span class="kw">const </span>MID_POINT: u64 = (<span class="number">1u64 </span>&lt;&lt; <span class="number">32</span>) - <span class="number">1u64</span>;
<span class="doccomment">/// `Line` describes a line function `y: ax + b` using integer
/// arithmetics.
///
/// The slope is in fact a decimal split into a 32 bit integer value,
/// and a 32-bit decimal value.
///
/// The multiplication then becomes.
/// `y = m * x &gt;&gt; 32 + b`
</span><span class="attribute">#[derive(Debug, Clone, Copy, Default)]
</span><span class="kw">pub struct </span>Line {
slope: u64,
intercept: u64,
}
<span class="doccomment">/// Compute the line slope.
///
/// This function has the nice property of being
/// invariant by translation.
/// `
/// compute_slope(y0, y1)
/// = compute_slope(y0 + X % 2^64, y1 + X % 2^64)
/// `
</span><span class="kw">fn </span>compute_slope(y0: u64, y1: u64, num_vals: NonZeroU32) -&gt; u64 {
<span class="kw">let </span>dy = y1.wrapping_sub(y0);
<span class="kw">let </span>sign = dy &lt;= (<span class="number">1 </span>&lt;&lt; <span class="number">63</span>);
<span class="kw">let </span>abs_dy = <span class="kw">if </span>sign {
y1.wrapping_sub(y0)
} <span class="kw">else </span>{
y0.wrapping_sub(y1)
};
<span class="kw">if </span>abs_dy &gt;= <span class="number">1 </span>&lt;&lt; <span class="number">32 </span>{
<span class="comment">// This is outside of realm we handle.
// Let&#39;s just bail.
</span><span class="kw">return </span><span class="number">0u64</span>;
}
<span class="kw">let </span>abs_slope = (abs_dy &lt;&lt; <span class="number">32</span>) / num_vals.get() <span class="kw">as </span>u64;
<span class="kw">if </span>sign {
abs_slope
} <span class="kw">else </span>{
<span class="comment">// The complement does indeed create the
// opposite decreasing slope...
//
// Intuitively (without the bitshifts and % u64::MAX)
// ```
// (x + shift)*(u64::MAX - abs_slope)
// - (x * (u64::MAX - abs_slope))
// = - shift * abs_slope
// ```
</span>u64::MAX - abs_slope
}
}
<span class="kw">impl </span>Line {
<span class="attribute">#[inline(always)]
</span><span class="kw">pub fn </span>eval(<span class="kw-2">&amp;</span><span class="self">self</span>, x: u32) -&gt; u64 {
<span class="kw">let </span>linear_part = ((x <span class="kw">as </span>u64).wrapping_mul(<span class="self">self</span>.slope) &gt;&gt; <span class="number">32</span>) <span class="kw">as </span>i32 <span class="kw">as </span>u64;
<span class="self">self</span>.intercept.wrapping_add(linear_part)
}
<span class="comment">// Same as train, but the intercept is only estimated from provided sample positions
</span><span class="kw">pub fn </span>estimate(sample_positions_and_values: <span class="kw-2">&amp;</span>[(u64, u64)]) -&gt; <span class="self">Self </span>{
<span class="kw">let </span>first_val = sample_positions_and_values[<span class="number">0</span>].<span class="number">1</span>;
<span class="kw">let </span>last_val = sample_positions_and_values[sample_positions_and_values.len() - <span class="number">1</span>].<span class="number">1</span>;
<span class="kw">let </span>num_vals = sample_positions_and_values[sample_positions_and_values.len() - <span class="number">1</span>].<span class="number">0 </span>+ <span class="number">1</span>;
<span class="self">Self</span>::train_from(
first_val,
last_val,
num_vals <span class="kw">as </span>u32,
sample_positions_and_values.iter().cloned(),
)
}
<span class="comment">// Intercept is only computed from provided positions
</span><span class="kw">fn </span>train_from(
first_val: u64,
last_val: u64,
num_vals: u32,
positions_and_values: <span class="kw">impl </span>Iterator&lt;Item = (u64, u64)&gt;,
) -&gt; <span class="self">Self </span>{
<span class="comment">// TODO replace with let else
</span><span class="kw">let </span>idx_last_val = <span class="kw">if let </span><span class="prelude-val">Some</span>(idx_last_val) = NonZeroU32::new(num_vals - <span class="number">1</span>) {
idx_last_val
} <span class="kw">else </span>{
<span class="kw">return </span>Line::default();
};
<span class="kw">let </span>y0 = first_val;
<span class="kw">let </span>y1 = last_val;
<span class="comment">// We first independently pick our slope.
</span><span class="kw">let </span>slope = compute_slope(y0, y1, idx_last_val);
<span class="comment">// We picked our slope. Note that it does not have to be perfect.
// Now we need to compute the best intercept.
//
// Intuitively, the best intercept is such that line passes through one of the
// `(i, ys[])`.
//
// The best intercept therefore has the form
// `y[i] - line.eval(i)` (using wrapping arithmetics).
// In other words, the best intercept is one of the `y - Line::eval(ys[i])`
// and our task is just to pick the one that minimizes our error.
//
// Without sorting our values, this is a difficult problem.
// We however rely on the following trick...
//
// We only focus on the case where the interpolation is half decent.
// If the line interpolation is doing its job on a dataset suited for it,
// we can hope that the maximum error won&#39;t be larger than `u64::MAX / 2`.
//
// In other words, even without the intercept the values `y - Line::eval(ys[i])` will all be
// within an interval that takes less than half of the modulo space of `u64`.
//
// Our task is therefore to identify this interval.
// Here we simply translate all of our values by `y0 - 2^63` and pick the min.
</span><span class="kw">let </span><span class="kw-2">mut </span>line = Line {
slope,
intercept: <span class="number">0</span>,
};
<span class="kw">let </span>heuristic_shift = y0.wrapping_sub(MID_POINT);
line.intercept = positions_and_values
.map(|(pos, y)| y.wrapping_sub(line.eval(pos <span class="kw">as </span>u32)))
.min_by_key(|<span class="kw-2">&amp;</span>val| val.wrapping_sub(heuristic_shift))
.unwrap_or(<span class="number">0u64</span>); <span class="comment">//&lt; Never happens.
</span>line
}
<span class="doccomment">/// Returns a line that attemps to approximate a function
/// f: i in 0..[ys.num_vals()) -&gt; ys[i].
///
/// - The approximation is always lower than the actual value.
/// Or more rigorously, formally `f(i).wrapping_sub(ys[i])` is small
/// for any i in [0..ys.len()).
/// - It computes without panicking for any value of it.
///
/// This function is only invariable by translation if all of the
/// `ys` are packaged into half of the space. (See heuristic below)
</span><span class="kw">pub fn </span>train(ys: <span class="kw-2">&amp;</span><span class="kw">dyn </span>Column) -&gt; <span class="self">Self </span>{
<span class="kw">let </span>first_val = ys.iter().next().unwrap();
<span class="kw">let </span>last_val = ys.iter().nth(ys.num_vals() <span class="kw">as </span>usize - <span class="number">1</span>).unwrap();
<span class="self">Self</span>::train_from(
first_val,
last_val,
ys.num_vals(),
ys.iter().enumerate().map(|(pos, val)| (pos <span class="kw">as </span>u64, val)),
)
}
}
<span class="kw">impl </span>BinarySerializable <span class="kw">for </span>Line {
<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>.slope).serialize(writer)<span class="question-mark">?</span>;
VInt(<span class="self">self</span>.intercept).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>slope = VInt::deserialize(reader)<span class="question-mark">?</span>.<span class="number">0</span>;
<span class="kw">let </span>intercept = VInt::deserialize(reader)<span class="question-mark">?</span>.<span class="number">0</span>;
<span class="prelude-val">Ok</span>(Line { slope, intercept })
}
}
<span class="attribute">#[cfg(test)]
</span><span class="kw">mod </span>tests {
<span class="kw">use super</span>::<span class="kw-2">*</span>;
<span class="kw">use </span><span class="kw">crate</span>::VecColumn;
<span class="doccomment">/// Test training a line and ensuring that the maximum difference between
/// the data points and the line is `expected`.
///
/// This function operates translation over the data for better coverage.
</span><span class="attribute">#[track_caller]
</span><span class="kw">fn </span>test_line_interpol_with_translation(ys: <span class="kw-2">&amp;</span>[u64], expected: <span class="prelude-ty">Option</span>&lt;u64&gt;) {
<span class="kw">let </span><span class="kw-2">mut </span>translations = <span class="macro">vec!</span>[<span class="number">0</span>, <span class="number">100</span>, u64::MAX / <span class="number">2</span>, u64::MAX, u64::MAX - <span class="number">1</span>];
translations.extend_from_slice(ys);
<span class="kw">for </span>translation <span class="kw">in </span>translations {
<span class="kw">let </span>translated_ys: Vec&lt;u64&gt; = ys
.iter()
.copied()
.map(|y| y.wrapping_add(translation))
.collect();
<span class="kw">let </span>largest_err = test_eval_max_err(<span class="kw-2">&amp;</span>translated_ys);
<span class="macro">assert_eq!</span>(largest_err, expected);
}
}
<span class="kw">fn </span>test_eval_max_err(ys: <span class="kw-2">&amp;</span>[u64]) -&gt; <span class="prelude-ty">Option</span>&lt;u64&gt; {
<span class="kw">let </span>line = Line::train(<span class="kw-2">&amp;</span>VecColumn::from(<span class="kw-2">&amp;</span>ys));
ys.iter()
.enumerate()
.map(|(x, y)| y.wrapping_sub(line.eval(x <span class="kw">as </span>u32)))
.max()
}
<span class="attribute">#[test]
</span><span class="kw">fn </span>test_train() {
test_line_interpol_with_translation(<span class="kw-2">&amp;</span>[<span class="number">11</span>, <span class="number">11</span>, <span class="number">11</span>, <span class="number">12</span>, <span class="number">12</span>, <span class="number">13</span>], <span class="prelude-val">Some</span>(<span class="number">1</span>));
test_line_interpol_with_translation(<span class="kw-2">&amp;</span>[<span class="number">13</span>, <span class="number">12</span>, <span class="number">12</span>, <span class="number">11</span>, <span class="number">11</span>, <span class="number">11</span>], <span class="prelude-val">Some</span>(<span class="number">1</span>));
test_line_interpol_with_translation(<span class="kw-2">&amp;</span>[<span class="number">13</span>, <span class="number">13</span>, <span class="number">12</span>, <span class="number">11</span>, <span class="number">11</span>, <span class="number">11</span>], <span class="prelude-val">Some</span>(<span class="number">1</span>));
test_line_interpol_with_translation(<span class="kw-2">&amp;</span>[<span class="number">13</span>, <span class="number">13</span>, <span class="number">12</span>, <span class="number">11</span>, <span class="number">11</span>, <span class="number">11</span>], <span class="prelude-val">Some</span>(<span class="number">1</span>));
test_line_interpol_with_translation(<span class="kw-2">&amp;</span>[u64::MAX - <span class="number">1</span>, <span class="number">0</span>, <span class="number">0</span>, <span class="number">1</span>], <span class="prelude-val">Some</span>(<span class="number">1</span>));
test_line_interpol_with_translation(<span class="kw-2">&amp;</span>[u64::MAX - <span class="number">1</span>, u64::MAX, <span class="number">0</span>, <span class="number">1</span>], <span class="prelude-val">Some</span>(<span class="number">0</span>));
test_line_interpol_with_translation(<span class="kw-2">&amp;</span>[<span class="number">0</span>, <span class="number">1</span>, <span class="number">2</span>, <span class="number">3</span>, <span class="number">5</span>], <span class="prelude-val">Some</span>(<span class="number">0</span>));
test_line_interpol_with_translation(<span class="kw-2">&amp;</span>[<span class="number">1</span>, <span class="number">2</span>, <span class="number">3</span>, <span class="number">4</span>], <span class="prelude-val">Some</span>(<span class="number">0</span>));
<span class="kw">let </span>data: Vec&lt;u64&gt; = (<span class="number">0</span>..<span class="number">255</span>).collect();
test_line_interpol_with_translation(<span class="kw-2">&amp;</span>data, <span class="prelude-val">Some</span>(<span class="number">0</span>));
<span class="kw">let </span>data: Vec&lt;u64&gt; = (<span class="number">0</span>..<span class="number">255</span>).map(|el| el * <span class="number">2</span>).collect();
test_line_interpol_with_translation(<span class="kw-2">&amp;</span>data, <span class="prelude-val">Some</span>(<span class="number">0</span>));
}
}
</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>