<ahref="rational__approximation_8cc.html">Go to the documentation of this file.</a><divclass="fragment"><divclass="line"><aname="l00001"></a><spanclass="lineno"> 1</span> <spanclass="comment">// Copyright 2010-2018 Google LLC</span></div>
<divclass="line"><aname="l00002"></a><spanclass="lineno"> 2</span> <spanclass="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
<divclass="line"><aname="l00003"></a><spanclass="lineno"> 3</span> <spanclass="comment">// you may not use this file except in compliance with the License.</span></div>
<divclass="line"><aname="l00004"></a><spanclass="lineno"> 4</span> <spanclass="comment">// You may obtain a copy of the License at</span></div>
<divclass="line"><aname="l00008"></a><spanclass="lineno"> 8</span> <spanclass="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
<divclass="line"><aname="l00009"></a><spanclass="lineno"> 9</span> <spanclass="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
<divclass="line"><aname="l00010"></a><spanclass="lineno"> 10</span> <spanclass="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
<divclass="line"><aname="l00011"></a><spanclass="lineno"> 11</span> <spanclass="comment">// See the License for the specific language governing permissions and</span></div>
<divclass="line"><aname="l00012"></a><spanclass="lineno"> 12</span> <spanclass="comment">// limitations under the License.</span></div>
<divclass="line"><aname="l00023"></a><spanclass="lineno"> 23</span> <spanclass="comment">// Computes a rational approximation numerator/denominator for value x</span></div>
<divclass="line"><aname="l00024"></a><spanclass="lineno"> 24</span> <spanclass="comment">// using a continued fraction algorithm. The absolute difference between the</span></div>
<divclass="line"><aname="l00025"></a><spanclass="lineno"> 25</span> <spanclass="comment">// output fraction and the input "x" will not exceed "precision".</span></div>
<divclass="line"><aname="l00029"></a><spanclass="lineno"> 29</span> <spanclass="comment">// All computations are made on long doubles to guarantee the maximum</span></div>
<divclass="line"><aname="l00030"></a><spanclass="lineno"> 30</span> <spanclass="comment">// precision for the approximations. This way, the approximations when</span></div>
<divclass="line"><aname="l00031"></a><spanclass="lineno"> 31</span> <spanclass="comment">// Fractional is float or double are as accurate as possible.</span></div>
<divclass="line"><aname="l00033"></a><spanclass="lineno"> 33</span> <spanclass="keywordtype">long</span><spanclass="keywordtype">double</span> y = abs_x;</div>
<divclass="line"><aname="l00039"></a><spanclass="lineno"> 39</span> <spanclass="keyword">const</span><aclass="code"href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> term = <spanclass="keyword">static_cast<</span><aclass="code"href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a><spanclass="keyword">></span>(std::floor(y));</div>
<divclass="line"><aname="l00040"></a><spanclass="lineno"> 40</span> <spanclass="keyword">const</span><aclass="code"href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> new_numerator = term * numerator + previous_numerator;</div>
<divclass="line"><aname="l00041"></a><spanclass="lineno"> 41</span> <spanclass="keyword">const</span><aclass="code"href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> new_denominator = term * denominator + previous_denominator;</div>
<divclass="line"><aname="l00042"></a><spanclass="lineno"> 42</span> <spanclass="comment">// If there was an overflow, we prefer returning a not-so-good approximation</span></div>
<divclass="line"><aname="l00043"></a><spanclass="lineno"> 43</span> <spanclass="comment">// rather than something that is completely wrong.</span></div>
<divclass="ttc"id="anamespaceoperations__research_html"><divclass="ttname"><ahref="namespaceoperations__research.html">operations_research</a></div><divclass="ttdoc">The vehicle routing library lets one model and solve generic vehicle routing problems ranging from th...</div><divclass="ttdef"><b>Definition:</b><ahref="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
