GCC Code Coverage Report

Directory: ./
File: lib/geogram/numerics/multi_precision.cpp
Date: 2026-09-07 02:37:58
Exec Total Coverage
Lines: 351 474 74.1%
Functions: 23 36 63.9%
Branches: 264 802 32.9%
Line Branch Exec Source
1 /*
2 * Copyright (c) 2000-2022 Inria
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are met:
7 *
8 * * Redistributions of source code must retain the above copyright notice,
9 * this list of conditions and the following disclaimer.
10 * * Redistributions in binary form must reproduce the above copyright notice,
11 * this list of conditions and the following disclaimer in the documentation
12 * and/or other materials provided with the distribution.
13 * * Neither the name of the ALICE Project-Team nor the names of its
14 * contributors may be used to endorse or promote products derived from this
15 * software without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
18 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
21 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
22 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
23 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
24 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
25 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
26 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
27 * POSSIBILITY OF SUCH DAMAGE.
28 *
29 * Contact: Bruno Levy
30 *
31 * https://www.inria.fr/fr/bruno-levy
32 *
33 * Inria,
34 * Domaine de Voluceau,
35 * 78150 Le Chesnay - Rocquencourt
36 * FRANCE
37 *
38 */
39
40 #include <geogram/basic/common.h>
41 #include <geogram/basic/numeric.h>
42
43 // This makes sure the compiler will not optimize y = a*x+b
44 // with fused multiply-add, this would break the exact
45 // predicates.
46 GEO_FP_CONTRACT_OFF
47
48 #include <geogram/numerics/multi_precision.h>
49 #include <geogram/numerics/PCK.h>
50 #include <geogram/basic/process.h>
51 #include <geogram/basic/logger.h>
52
53 namespace {
54
55 using namespace GEO;
56
57 /************************************************************************/
58
59 /**
60 * \brief Computes the sum of a length 2 expansion and a double
61 * into a length 3 expansion.
62 * \param[in] a1 high-magnitude component of first argument
63 * \param[in] a0 low-magnitude component of first argument
64 * \param[in] b second argument
65 * \param[in] x2 high-magnitude component of the result
66 * \param[in] x1 component of the result
67 * \param[in] x0 low-magnitude component of the result
68 * \details By Jonathan Shewchuk.
69 */
70 18159282 inline void two_one_sum(
71 double a1, double a0, double b, double& x2, double& x1, double& x0
72 ) {
73 double _i;
74 18159282 two_sum(a0, b, _i, x0);
75 18159282 two_sum(a1, _i, x2, x1);
76 18159282 }
77
78 /**
79 * \brief Computes the sum of a length 2 expansion and a double
80 * into a length 3 expansion.
81 * \param[in] a1 high-magnitude component of first argument
82 * \param[in] a0 low-magnitude component of first argument
83 * \param[in] b1 high-magnitude component of second argument
84 * \param[in] b0 high-magnitude component of second argument
85 * \param[in] x3 high-magnitude component of the result
86 * \param[in] x2 component of the result
87 * \param[in] x1 component of the result
88 * \param[in] x0 low-magnitude component of the result
89 * \details By Jonathan Shewchuk.
90 */
91 6053094 inline void two_two_sum(
92 double a1, double a0, double b1, double b0,
93 double& x3, double& x2, double& x1, double& x0
94 ) {
95 double _j, _0;
96 6053094 two_one_sum(a1, a0, b0, _j, _0, x0);
97 6053094 two_one_sum(_j, _0, b1, x3, x2, x1);
98 6053094 }
99
100 #ifndef FP_FAST_FMA
101
102 /**
103 * \brief Computes the product between two doubles where
104 * the second one have already been split.
105 * \param[in] a first argument
106 * \param[in] b second argument
107 * \param[in] bhi high-magnitude part of second argument
108 * \param[in] blo low-magnitude part of second argument
109 * \param[out] x high-magnitude component of the result
110 * \param[out] y low-magnitude component of the result
111 * \details By Jonathan Shewchuk.
112 */
113 inline void two_product_presplit(
114 double a, double b, double bhi, double blo, double& x, double& y
115 ) {
116 x = a * b;
117 double ahi;
118 double alo;
119 split(a, ahi, alo);
120 double err1 = x - (ahi * bhi);
121 double err2 = err1 - (alo * bhi);
122 double err3 = err2 - (ahi * blo);
123 y = (alo * blo) - err3;
124 }
125
126 /**
127 * \brief Computes the product between two doubles
128 * where both have already been split.
129 * \param[in] a first argument
130 * \param[in] ahi high-magnitude part of first argument
131 * \param[in] alo low-magnitude part of first argument
132 * \param[in] b second argument
133 * \param[in] bhi high-magnitude part of second argument
134 * \param[in] blo low-magnitude part of second argument
135 * \param[out] x high-magnitude component of the result
136 * \param[out] y low-magnitude component of the result
137 * \details By Jonathan Shewchuk.
138 */
139 inline void two_product_2presplit(
140 double a, double ahi, double alo,
141 double b, double bhi, double blo,
142 double& x, double& y
143 ) {
144 x = a * b;
145 double err1 = x - (ahi * bhi);
146 double err2 = err1 - (alo * bhi);
147 double err3 = err2 - (ahi * blo);
148 y = (alo * blo) - err3;
149 }
150
151 #endif
152
153 /**
154 * \brief Computes the square of an expansion of length 2.
155 * \param[in] a1 high-magnitude component of the argument
156 * \param[in] a0 low-magnitude component of the argument
157 * \param[out] x an array of six doubles to store the result.
158 * \details By Jonathan Shewchuk.
159 * An expansion of length two can be squared more quickly than finding the
160 * product of two different expansions of length two, and the result is
161 * guaranteed to have no more than six (rather than eight) components.
162 */
163 6053094 inline void two_square(
164 double a1, double a0,
165 double* x
166 ) {
167 double _0, _1, _2;
168 double _j, _k, _l;
169 6053094 square(a0, _j, x[0]);
170 6053094 _0 = a0 + a0;
171 6053094 two_product(a1, _0, _k, _1);
172 6053094 two_one_sum(_k, _1, _j, _l, _2, x[1]);
173 6053094 square(a1, _j, _1);
174 6053094 two_two_sum(_j, _1, _l, _2, x[5], x[4], x[3], x[2]);
175 6053094 }
176
177 /**
178 * \brief Computes the product of two expansions of length 2.
179 * \param[in] a first argument (array of 2 doubles)
180 * \param[in] b second argument (array of 2 doubles)
181 * \param[out] x an array of 8 doubles to store the result
182 * \details By Jonathan Shewchuk.
183 */
184 70238343 void two_two_product(
185 const double* a,
186 const double* b,
187 double* x
188 ) {
189 double _0, _1, _2;
190 double _i, _j, _k, _l, _m, _n;
191
192 // If the target processor supports the FMA (Fused Multiply Add)
193 // instruction, then the product of two doubles into a length-2
194 // expansion can be implemented as follows. Thanks to Marc Glisse
195 // for the information.
196 // Note: under gcc, automatic generations of fma() for a*b+c needs
197 // to be deactivated, using -ffp-contract=off, else it may break
198 // other functions such as fast_expansion_sum_zeroelim().
199 #ifdef FP_FAST_FMA
200 70238343 two_product(a[0],b[0],_i,x[0]);
201 70238343 two_product(a[1],b[0],_j,_0);
202 70238343 two_sum(_i, _0, _k, _1);
203 70238343 fast_two_sum(_j, _k, _l, _2);
204 70238343 two_product(a[0], b[1], _i, _0);
205 70238343 two_sum(_1, _0, _k, x[1]);
206 70238343 two_sum(_2, _k, _j, _1);
207 70238343 two_sum(_l, _j, _m, _2);
208 70238343 two_product(a[1], b[1], _j, _0);
209 70238343 two_sum(_i, _0, _n, _0);
210 70238343 two_sum(_1, _0, _i, x[2]);
211 70238343 two_sum(_2, _i, _k, _1);
212 70238343 two_sum(_m, _k, _l, _2);
213 70238343 two_sum(_j, _n, _k, _0);
214 70238343 two_sum(_1, _0, _j, x[3]);
215 70238343 two_sum(_2, _j, _i, _1);
216 70238343 two_sum(_l, _i, _m, _2);
217 70238343 two_sum(_1, _k, _i, x[4]);
218 70238343 two_sum(_2, _i, _k, x[5]);
219 70238343 two_sum(_m, _k, x[7], x[6]);
220 #else
221 double a0hi, a0lo;
222 split(a[0], a0hi, a0lo);
223 double bhi, blo;
224 split(b[0], bhi, blo);
225 two_product_2presplit(
226 a[0], a0hi, a0lo, b[0], bhi, blo, _i, x[0]
227 );
228 double a1hi, a1lo;
229 split(a[1], a1hi, a1lo);
230 two_product_2presplit(
231 a[1], a1hi, a1lo, b[0], bhi, blo, _j, _0
232 );
233 two_sum(_i, _0, _k, _1);
234 fast_two_sum(_j, _k, _l, _2);
235 split(b[1], bhi, blo);
236 two_product_2presplit(
237 a[0], a0hi, a0lo, b[1], bhi, blo, _i, _0
238 );
239 two_sum(_1, _0, _k, x[1]);
240 two_sum(_2, _k, _j, _1);
241 two_sum(_l, _j, _m, _2);
242 two_product_2presplit(
243 a[1], a1hi, a1lo, b[1], bhi, blo, _j, _0
244 );
245 two_sum(_i, _0, _n, _0);
246 two_sum(_1, _0, _i, x[2]);
247 two_sum(_2, _i, _k, _1);
248 two_sum(_m, _k, _l, _2);
249 two_sum(_j, _n, _k, _0);
250 two_sum(_1, _0, _j, x[3]);
251 two_sum(_2, _j, _i, _1);
252 two_sum(_l, _i, _m, _2);
253 two_sum(_1, _k, _i, x[4]);
254 two_sum(_2, _i, _k, x[5]);
255 two_sum(_m, _k, x[7], x[6]);
256 #endif
257 70238343 }
258
259 // [Shewchuk 97]
260 // (https://people.eecs.berkeley.edu/~jrs/papers/robustr.pdf)
261 // Section 2.8: other operations
262 // Compression
263 // Note: when converting the algorithms in Shewchuk's article
264 // into code, indices in the article go from 1 to m, and in the
265 // code they go from 0 to m-1 !!!
266 // /!\ there is a bug in the original article,
267 // line 14 of the algorithm should be h_top <= q (small q and not capital Q)
268
269 /**
270 * \brief Compresses an expansion
271 * \details Modifies in-place an expansion in such a way that it
272 * is shorter. The represented value is not modified.
273 * \param[in,out] e a reference to the expansion to be compressed
274 */
275 2289445 void compress_expansion(expansion& e) {
276 2289445 expansion& h = e;
277
278 2289445 index_t m = e.length();
279 double Qnew,q;
280
281 2289445 index_t bottom = m-1;
282
1/2
✓ Branch 1 taken 2289445 times.
✗ Branch 2 not taken.
 2289445 double Q = e[bottom];
283
284
2/2
✓ Branch 0 taken 3834074 times.
✓ Branch 1 taken 2289445 times.
 6123519 for(int i=int(m)-2; i>=0; --i) {
285
1/2
✓ Branch 1 taken 3834074 times.
✗ Branch 2 not taken.
 3834074 fast_two_sum(Q, e[index_t(i)], Qnew, q);
286 3834074 Q = Qnew;
287
2/2
✓ Branch 0 taken 2425492 times.
✓ Branch 1 taken 1408582 times.
 3834074 if(q != 0.0) {
288
1/2
✓ Branch 1 taken 2425492 times.
✗ Branch 2 not taken.
 2425492 h[bottom] = Q;
289 2425492 --bottom;
290 2425492 Q = q;
291 }
292 }
293
1/2
✓ Branch 1 taken 2289445 times.
✗ Branch 2 not taken.
 2289445 h[bottom] = Q;
294
295 2289445 index_t top = 0;
296
2/2
✓ Branch 0 taken 2425492 times.
✓ Branch 1 taken 2289445 times.
 4714937 for(index_t i=bottom+1; i<m; ++i) {
297
1/2
✓ Branch 1 taken 2425492 times.
✗ Branch 2 not taken.
 2425492 fast_two_sum(h[i],Q,Qnew,q);
298 2425492 Q = Qnew;
299
1/2
✓ Branch 0 taken 2425492 times.
✗ Branch 1 not taken.
 2425492 if(q != 0) {
300
1/2
✓ Branch 1 taken 2425492 times.
✗ Branch 2 not taken.
 2425492 h[top] = q;
301 2425492 ++top;
302 }
303 }
304
1/2
✓ Branch 1 taken 2289445 times.
✗ Branch 2 not taken.
 2289445 h[top] = Q;
305
1/2
✓ Branch 1 taken 2289445 times.
✗ Branch 2 not taken.
 2289445 h.set_length(top+1);
306 2289445 }
307 }
308
309 namespace GEO {
310
311 ✗ void grow_expansion_zeroelim(
312 const expansion& e, double b, expansion& h
313 ) {
314 double Q, hh;
315 double Qnew;
316 index_t eindex, hindex;
317 ✗ index_t elen = e.length();
318
319 ✗ hindex = 0;
320 ✗ Q = b;
321 ✗ for(eindex = 0; eindex < elen; eindex++) {
322 ✗ double enow = e[eindex];
323 ✗ two_sum(Q, enow, Qnew, hh);
324 ✗ Q = Qnew;
325 ✗ if(hh != 0.0) {
326 ✗ h[hindex++] = hh;
327 }
328 }
329 ✗ if((Q != 0.0) || (hindex == 0)) {
330 ✗ h[hindex++] = Q;
331 }
332 ✗ h.set_length(hindex);
333 ✗ }
334
335 45352007 void scale_expansion_zeroelim(
336 const expansion& e, double b, expansion& h
337 ) {
338 double Q, sum;
339 double hh;
340 double product1;
341 double product0;
342 index_t eindex, hindex;
343
344 // If the target processor supports the FMA (Fused Multiply Add)
345 // instruction, then the product of two doubles into a length-2
346 // expansion can be implemented as follows. Thanks to Marc Glisse
347 // for the information.
348 // Note: under gcc, automatic generations of fma() for a*b+c needs
349 // to be deactivated, using -ffp-contract=off, else it may break
350 // other functions such as fast_expansion_sum_zeroelim().
351 #ifndef FP_FAST_FMA
352 double bhi, blo;
353 #endif
354 45352007 index_t elen = e.length();
355
356 // Sanity check: e and h cannot be the same.
357
1/6
✗ Branch 0 not taken.
✓ Branch 1 taken 45352007 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
 45352007 geo_debug_assert(&e != &h);
358
359 #ifdef FP_FAST_FMA
360
1/2
✓ Branch 1 taken 45352007 times.
✗ Branch 2 not taken.
 45352007 two_product(e[0], b, Q, hh);
361 #else
362 split(b, bhi, blo);
363 two_product_presplit(e[0], b, bhi, blo, Q, hh);
364 #endif
365
366 45352007 hindex = 0;
367
2/2
✓ Branch 0 taken 18634328 times.
✓ Branch 1 taken 26717679 times.
 45352007 if(hh != 0) {
368
1/2
✓ Branch 1 taken 18634328 times.
✗ Branch 2 not taken.
 18634328 h[hindex++] = hh;
369 }
370
2/2
✓ Branch 0 taken 113266379 times.
✓ Branch 1 taken 45352007 times.
 158618386 for(eindex = 1; eindex < elen; eindex++) {
371
1/2
✓ Branch 1 taken 113266379 times.
✗ Branch 2 not taken.
 113266379 double enow = e[eindex];
372 #ifdef FP_FAST_FMA
373 113266379 two_product(enow, b, product1, product0);
374 #else
375 two_product_presplit(enow, b, bhi, blo, product1, product0);
376 #endif
377 113266379 two_sum(Q, product0, sum, hh);
378
2/2
✓ Branch 0 taken 13336158 times.
✓ Branch 1 taken 99930221 times.
 113266379 if(hh != 0) {
379
1/2
✓ Branch 1 taken 13336158 times.
✗ Branch 2 not taken.
 13336158 h[hindex++] = hh;
380 }
381 113266379 fast_two_sum(product1, sum, Q, hh);
382
2/2
✓ Branch 0 taken 85213788 times.
✓ Branch 1 taken 28052591 times.
 113266379 if(hh != 0) {
383
1/2
✓ Branch 1 taken 85213788 times.
✗ Branch 2 not taken.
 85213788 h[hindex++] = hh;
384 }
385 }
386
3/4
✓ Branch 0 taken 15694643 times.
✓ Branch 1 taken 29657364 times.
✓ Branch 2 taken 15694643 times.
✗ Branch 3 not taken.
 45352007 if((Q != 0.0) || (hindex == 0)) {
387
1/2
✓ Branch 1 taken 45352007 times.
✗ Branch 2 not taken.
 45352007 h[hindex++] = Q;
388 }
389
1/2
✓ Branch 1 taken 45352007 times.
✗ Branch 2 not taken.
 45352007 h.set_length(hindex);
390 45352007 }
391
392 43464432 void fast_expansion_sum_zeroelim(
393 const expansion& e, const expansion& f, expansion& h
394 ) {
395 double Q;
396 double Qnew;
397 double hh;
398 index_t eindex, findex, hindex;
399 double enow, fnow;
400 43464432 index_t elen = e.length();
401 43464432 index_t flen = f.length();
402
403 // sanity check: h cannot be e or f
404
1/6
✗ Branch 0 not taken.
✓ Branch 1 taken 43464432 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
 43464432 geo_debug_assert(&h != &e);
405
1/6
✗ Branch 0 not taken.
✓ Branch 1 taken 43464432 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
 43464432 geo_debug_assert(&h != &f);
406
407
1/2
✓ Branch 1 taken 43464432 times.
✗ Branch 2 not taken.
 43464432 enow = e[0];
408
1/2
✓ Branch 1 taken 43464432 times.
✗ Branch 2 not taken.
 43464432 fnow = f[0];
409 43464432 eindex = findex = 0;
410
2/2
✓ Branch 0 taken 38600128 times.
✓ Branch 1 taken 4864304 times.
 43464432 if((fnow > enow) == (fnow > -enow)) {
411 38600128 Q = enow;
412
1/2
✓ Branch 1 taken 38600128 times.
✗ Branch 2 not taken.
 38600128 enow = e[++eindex];
413 } else {
414 4864304 Q = fnow;
415
1/2
✓ Branch 1 taken 4864304 times.
✗ Branch 2 not taken.
 4864304 fnow = f[++findex];
416 }
417 43464432 hindex = 0;
418
4/4
✓ Branch 0 taken 31153998 times.
✓ Branch 1 taken 12310434 times.
✓ Branch 2 taken 30320644 times.
✓ Branch 3 taken 833354 times.
 43464432 if((eindex < elen) && (findex < flen)) {
419
2/2
✓ Branch 0 taken 23888480 times.
✓ Branch 1 taken 6432164 times.
 30320644 if((fnow > enow) == (fnow > -enow)) {
420 23888480 fast_two_sum(enow, Q, Qnew, hh);
421
1/2
✓ Branch 1 taken 23888480 times.
✗ Branch 2 not taken.
 23888480 enow = e[++eindex];
422 } else {
423 6432164 fast_two_sum(fnow, Q, Qnew, hh);
424
1/2
✓ Branch 1 taken 6432164 times.
✗ Branch 2 not taken.
 6432164 fnow = f[++findex];
425 }
426 30320644 Q = Qnew;
427
2/2
✓ Branch 0 taken 4770086 times.
✓ Branch 1 taken 25550558 times.
 30320644 if(hh != 0.0) {
428
1/2
✓ Branch 1 taken 4770086 times.
✗ Branch 2 not taken.
 4770086 h[hindex++] = hh;
429 }
430
4/4
✓ Branch 0 taken 268418727 times.
✓ Branch 1 taken 22542885 times.
✓ Branch 2 taken 260640968 times.
✓ Branch 3 taken 7777759 times.
 290961612 while((eindex < elen) && (findex < flen)) {
431
2/2
✓ Branch 0 taken 144836470 times.
✓ Branch 1 taken 115804498 times.
 260640968 if((fnow > enow) == (fnow > -enow)) {
432 144836470 two_sum(Q, enow, Qnew, hh);
433
1/2
✓ Branch 1 taken 144836470 times.
✗ Branch 2 not taken.
 144836470 enow = e[++eindex];
434 } else {
435 115804498 two_sum(Q, fnow, Qnew, hh);
436
1/2
✓ Branch 1 taken 115804498 times.
✗ Branch 2 not taken.
 115804498 fnow = f[++findex];
437 }
438 260640968 Q = Qnew;
439
2/2
✓ Branch 0 taken 124365863 times.
✓ Branch 1 taken 136275105 times.
 260640968 if(hh != 0.0) {
440
1/2
✓ Branch 1 taken 124365863 times.
✗ Branch 2 not taken.
 124365863 h[hindex++] = hh;
441 }
442 }
443 }
444
2/2
✓ Branch 0 taken 10970139 times.
✓ Branch 1 taken 43464432 times.
 54434571 while(eindex < elen) {
445 10970139 two_sum(Q, enow, Qnew, hh);
446
1/2
✓ Branch 1 taken 10970139 times.
✗ Branch 2 not taken.
 10970139 enow = e[++eindex];
447 10970139 Q = Qnew;
448
2/2
✓ Branch 0 taken 3632470 times.
✓ Branch 1 taken 7337669 times.
 10970139 if(hh != 0.0) {
449
1/2
✓ Branch 1 taken 3632470 times.
✗ Branch 2 not taken.
 3632470 h[hindex++] = hh;
450 }
451 }
452
2/2
✓ Branch 0 taken 63217101 times.
✓ Branch 1 taken 43464432 times.
 106681533 while(findex < flen) {
453 63217101 two_sum(Q, fnow, Qnew, hh);
454
1/2
✓ Branch 1 taken 63217101 times.
✗ Branch 2 not taken.
 63217101 fnow = f[++findex];
455 63217101 Q = Qnew;
456
2/2
✓ Branch 0 taken 23275916 times.
✓ Branch 1 taken 39941185 times.
 63217101 if(hh != 0.0) {
457
1/2
✓ Branch 1 taken 23275916 times.
✗ Branch 2 not taken.
 23275916 h[hindex++] = hh;
458 }
459 }
460
4/4
✓ Branch 0 taken 14692992 times.
✓ Branch 1 taken 28771440 times.
✓ Branch 2 taken 14647586 times.
✓ Branch 3 taken 45406 times.
 43464432 if((Q != 0.0) || (hindex == 0)) {
461
1/2
✓ Branch 1 taken 43419026 times.
✗ Branch 2 not taken.
 43419026 h[hindex++] = Q;
462 }
463
1/2
✓ Branch 1 taken 43464432 times.
✗ Branch 2 not taken.
 43464432 h.set_length(hindex);
464 43464432 }
465
466 39446504 void fast_expansion_diff_zeroelim(
467 const expansion& e, const expansion& f, expansion& h
468 ) {
469 double Q;
470 double Qnew;
471 double hh;
472 index_t eindex, findex, hindex;
473 double enow, fnow;
474 39446504 index_t elen = e.length();
475 39446504 index_t flen = f.length();
476
477 // sanity check: h cannot be e or f
478
1/6
✗ Branch 0 not taken.
✓ Branch 1 taken 39446504 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
 39446504 geo_debug_assert(&h != &e);
479
1/6
✗ Branch 0 not taken.
✓ Branch 1 taken 39446504 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
 39446504 geo_debug_assert(&h != &f);
480
481
1/2
✓ Branch 1 taken 39446504 times.
✗ Branch 2 not taken.
 39446504 enow = e[0];
482
1/2
✓ Branch 1 taken 39446504 times.
✗ Branch 2 not taken.
 39446504 fnow = -f[0];
483 39446504 eindex = findex = 0;
484
2/2
✓ Branch 0 taken 34602133 times.
✓ Branch 1 taken 4844371 times.
 39446504 if((fnow > enow) == (fnow > -enow)) {
485 34602133 Q = enow;
486
1/2
✓ Branch 1 taken 34602133 times.
✗ Branch 2 not taken.
 34602133 enow = e[++eindex];
487 } else {
488 4844371 Q = fnow;
489
1/2
✓ Branch 1 taken 4844371 times.
✗ Branch 2 not taken.
 4844371 fnow = -f[++findex];
490 }
491 39446504 hindex = 0;
492
4/4
✓ Branch 0 taken 37449074 times.
✓ Branch 1 taken 1997430 times.
✓ Branch 2 taken 35848834 times.
✓ Branch 3 taken 1600240 times.
 39446504 if((eindex < elen) && (findex < flen)) {
493
2/2
✓ Branch 0 taken 32400995 times.
✓ Branch 1 taken 3447839 times.
 35848834 if((fnow > enow) == (fnow > -enow)) {
494 32400995 fast_two_sum(enow, Q, Qnew, hh);
495
1/2
✓ Branch 1 taken 32400995 times.
✗ Branch 2 not taken.
 32400995 enow = e[++eindex];
496 } else {
497 3447839 fast_two_sum(fnow, Q, Qnew, hh);
498
1/2
✓ Branch 1 taken 3447839 times.
✗ Branch 2 not taken.
 3447839 fnow = -f[++findex];
499 }
500 35848834 Q = Qnew;
501
2/2
✓ Branch 0 taken 554540 times.
✓ Branch 1 taken 35294294 times.
 35848834 if(hh != 0.0) {
502
1/2
✓ Branch 1 taken 554540 times.
✗ Branch 2 not taken.
 554540 h[hindex++] = hh;
503 }
504
4/4
✓ Branch 0 taken 332296834 times.
✓ Branch 1 taken 24257470 times.
✓ Branch 2 taken 320705470 times.
✓ Branch 3 taken 11591364 times.
 356554304 while((eindex < elen) && (findex < flen)) {
505
2/2
✓ Branch 0 taken 190832607 times.
✓ Branch 1 taken 129872863 times.
 320705470 if((fnow > enow) == (fnow > -enow)) {
506 190832607 two_sum(Q, enow, Qnew, hh);
507
1/2
✓ Branch 1 taken 190832607 times.
✗ Branch 2 not taken.
 190832607 enow = e[++eindex];
508 } else {
509 129872863 two_sum(Q, fnow, Qnew, hh);
510
1/2
✓ Branch 1 taken 129872863 times.
✗ Branch 2 not taken.
 129872863 fnow = -f[++findex];
511 }
512 320705470 Q = Qnew;
513
2/2
✓ Branch 0 taken 33314722 times.
✓ Branch 1 taken 287390748 times.
 320705470 if(hh != 0.0) {
514
1/2
✓ Branch 1 taken 33314722 times.
✗ Branch 2 not taken.
 33314722 h[hindex++] = hh;
515 }
516 }
517 }
518
2/2
✓ Branch 0 taken 15218080 times.
✓ Branch 1 taken 39446504 times.
 54664584 while(eindex < elen) {
519 15218080 two_sum(Q, enow, Qnew, hh);
520
1/2
✓ Branch 1 taken 15218080 times.
✗ Branch 2 not taken.
 15218080 enow = e[++eindex];
521 15218080 Q = Qnew;
522
2/2
✓ Branch 0 taken 4856421 times.
✓ Branch 1 taken 10361659 times.
 15218080 if(hh != 0.0) {
523
1/2
✓ Branch 1 taken 4856421 times.
✗ Branch 2 not taken.
 4856421 h[hindex++] = hh;
524 }
525 }
526
2/2
✓ Branch 0 taken 134803383 times.
✓ Branch 1 taken 39446504 times.
 174249887 while(findex < flen) {
527 134803383 two_sum(Q, fnow, Qnew, hh);
528
1/2
✓ Branch 1 taken 134803383 times.
✗ Branch 2 not taken.
 134803383 fnow = -f[++findex];
529 134803383 Q = Qnew;
530
2/2
✓ Branch 0 taken 4638562 times.
✓ Branch 1 taken 130164821 times.
 134803383 if(hh != 0.0) {
531
1/2
✓ Branch 1 taken 4638562 times.
✗ Branch 2 not taken.
 4638562 h[hindex++] = hh;
532 }
533 }
534
4/4
✓ Branch 0 taken 16463836 times.
✓ Branch 1 taken 22982668 times.
✓ Branch 2 taken 16434421 times.
✓ Branch 3 taken 29415 times.
 39446504 if((Q != 0.0) || (hindex == 0)) {
535
1/2
✓ Branch 1 taken 39417089 times.
✗ Branch 2 not taken.
 39417089 h[hindex++] = Q;
536 }
537
1/2
✓ Branch 1 taken 39446504 times.
✗ Branch 2 not taken.
 39446504 h.set_length(hindex);
538 39446504 }
539
540 }
541
542 /****************************************************************************/
543
544 namespace GEO {
545
546 double expansion_splitter_;
547 double expansion_epsilon_;
548
549 252 void expansion::initialize() {
550 // Taken from Jonathan Shewchuk's exactinit.
551 double half;
552 double check, lastcheck;
553 int every_other;
554
555 252 every_other = 1;
556 252 half = 0.5;
557 252 expansion_epsilon_ = 1.0;
558 252 expansion_splitter_ = 1.0;
559 252 check = 1.0;
560 // Repeatedly divide `epsilon' by two until it is too small to add to
561 // one without causing roundoff. (Also check if the sum is equal to
562 // the previous sum, for machines that round up instead of using exact
563 // rounding. Not that this library will work on such machines anyway.
564 do {
565 13356 lastcheck = check;
566 13356 expansion_epsilon_ *= half;
567
2/2
✓ Branch 0 taken 6804 times.
✓ Branch 1 taken 6552 times.
 13356 if(every_other) {
568 6804 expansion_splitter_ *= 2.0;
569 }
570 13356 every_other = !every_other;
571 13356 check = 1.0 + expansion_epsilon_;
572
3/4
✓ Branch 0 taken 13104 times.
✓ Branch 1 taken 252 times.
✓ Branch 2 taken 13104 times.
✗ Branch 3 not taken.
 13356 } while((check != 1.0) && (check != lastcheck));
573 252 expansion_splitter_ += 1.0;
574 252 }
575
576 // ====== Initialization from expansion and double ===============
577
578 ✗ expansion& expansion::assign_sum(const expansion& a, double b) {
579 ✗ geo_debug_assert(capacity() >= sum_capacity(a, b));
580 ✗ grow_expansion_zeroelim(a, b, *this);
581 ✗ return *this;
582 }
583
584 ✗ expansion& expansion::assign_diff(const expansion& a, double b) {
585 ✗ geo_debug_assert(capacity() >= diff_capacity(a, b));
586 ✗ grow_expansion_zeroelim(a, -b, *this);
587 ✗ return *this;
588 }
589
590 29083184 expansion& expansion::assign_product(const expansion& a, double b) {
591 // TODO: implement special case where the double argument
592 // is a power of two.
593
1/6
✗ Branch 2 not taken.
✓ Branch 3 taken 29083184 times.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
✗ Branch 8 not taken.
✗ Branch 9 not taken.
 29083184 geo_debug_assert(capacity() >= product_capacity(a, b));
594 29083184 scale_expansion_zeroelim(a, b, *this);
595 29083184 return *this;
596 }
597
598 // ============= expansion sum and difference =========================
599
600 43464432 expansion& expansion::assign_sum(
601 const expansion& a, const expansion& b
602 ) {
603
1/6
✗ Branch 2 not taken.
✓ Branch 3 taken 43464432 times.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
✗ Branch 8 not taken.
✗ Branch 9 not taken.
 43464432 geo_debug_assert(capacity() >= sum_capacity(a, b));
604 43464432 fast_expansion_sum_zeroelim(a, b, *this);
605 43464432 return *this;
606 }
607
608 7965498 expansion& expansion::assign_sum(
609 const expansion& a, const expansion& b, const expansion& c
610 ) {
611
1/6
✗ Branch 2 not taken.
✓ Branch 3 taken 7965498 times.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
✗ Branch 8 not taken.
✗ Branch 9 not taken.
 7965498 geo_debug_assert(capacity() >= sum_capacity(a, b, c));
612
2/6
✓ Branch 6 taken 7965498 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✓ Branch 9 taken 7965498 times.
✗ Branch 11 not taken.
✗ Branch 12 not taken.
 7965498 expansion& ab = expansion_sum(a, b);
613 7965498 this->assign_sum(ab, c);
614 7965498 return *this;
615 }
616
617 368993 expansion& expansion::assign_sum(
618 const expansion& a, const expansion& b,
619 const expansion& c, const expansion& d
620 ) {
621
1/6
✗ Branch 2 not taken.
✓ Branch 3 taken 368993 times.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
✗ Branch 8 not taken.
✗ Branch 9 not taken.
 368993 geo_debug_assert(capacity() >= sum_capacity(a, b, c));
622
2/6
✓ Branch 6 taken 368993 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✓ Branch 9 taken 368993 times.
✗ Branch 11 not taken.
✗ Branch 12 not taken.
 368993 expansion& ab = expansion_sum(a, b);
623
2/6
✓ Branch 6 taken 368993 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✓ Branch 9 taken 368993 times.
✗ Branch 11 not taken.
✗ Branch 12 not taken.
 368993 expansion& cd = expansion_sum(c, d);
624 368993 this->assign_sum(ab, cd);
625 368993 return *this;
626 }
627
628 39446504 expansion& expansion::assign_diff(const expansion& a, const expansion& b) {
629
1/6
✗ Branch 2 not taken.
✓ Branch 3 taken 39446504 times.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
✗ Branch 8 not taken.
✗ Branch 9 not taken.
 39446504 geo_debug_assert(capacity() >= diff_capacity(a, b));
630 39446504 fast_expansion_diff_zeroelim(a, b, *this);
631 39446504 return *this;
632 }
633
634 // ============= expansion product ==================================
635
636 // Recursive helper function for product implementation
637 66995 expansion& expansion::assign_sub_product(
638 const double* a, index_t a_length, const expansion& b
639 ) {
640
1/6
✗ Branch 3 not taken.
✓ Branch 4 taken 66995 times.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
✗ Branch 9 not taken.
✗ Branch 10 not taken.
 66995 geo_debug_assert(
641 capacity() >= sub_product_capacity(a_length, b.length())
642 );
643
2/2
✓ Branch 0 taken 34382 times.
✓ Branch 1 taken 32613 times.
 66995 if(a_length == 1) {
644 34382 scale_expansion_zeroelim(b, a[0], *this);
645 } else {
646 // "Distillation" (see Shewchuk's paper) is computed recursively,
647 // by splitting the list of expansions to sum into two halves.
648
649 32613 const double* a1 = a;
650 32613 index_t a1_length = a_length / 2;
651 32613 const double* a2 = a1 + a1_length;
652 32613 index_t a2_length = a_length - a1_length;
653
654 // Allocate both halves on the stack or on the heap if too large
655 // (some platformes, e.g. MacOSX, have a small stack)
656
657 32613 index_t a1b_capa = sub_product_capacity(a1_length, b.length());
658 32613 index_t a2b_capa = sub_product_capacity(a2_length, b.length());
659
660 32613 bool a1b_on_heap = (a1b_capa > MAX_CAPACITY_ON_STACK);
661 32613 bool a2b_on_heap = (a2b_capa > MAX_CAPACITY_ON_STACK);
662
663 32613 expansion* a1b = a1b_on_heap ?
664 18 new_expansion_on_heap(a1b_capa) :
665
5/6
✓ Branch 0 taken 18 times.
✓ Branch 1 taken 32595 times.
✓ Branch 5 taken 32595 times.
✓ Branch 6 taken 18 times.
✗ Branch 7 not taken.
✓ Branch 8 taken 32595 times.
 32631 new_expansion_on_stack(a1b_capa);
666
667 32613 a1b->assign_sub_product(a1, a1_length, b);
668
669 32613 expansion* a2b = a2b_on_heap ?
670 24 new_expansion_on_heap(a2b_capa) :
671
5/6
✓ Branch 0 taken 24 times.
✓ Branch 1 taken 32589 times.
✓ Branch 5 taken 32589 times.
✓ Branch 6 taken 24 times.
✗ Branch 7 not taken.
✓ Branch 8 taken 32589 times.
 32637 new_expansion_on_stack(a2b_capa);
672
673 32613 a2b->assign_sub_product(a2, a2_length, b);
674
675 32613 this->assign_sum(*a1b, *a2b);
676
677
2/2
✓ Branch 0 taken 18 times.
✓ Branch 1 taken 32595 times.
 32613 if(a1b_on_heap) {
678 18 delete_expansion_on_heap(a1b);
679 }
680
681
2/2
✓ Branch 0 taken 24 times.
✓ Branch 1 taken 32589 times.
 32613 if(a2b_on_heap) {
682 24 delete_expansion_on_heap(a2b);
683 }
684 }
685 66995 return *this;
686 }
687
688 95802002 expansion& expansion::assign_product(
689 const expansion& a, const expansion& b
690 ) {
691
1/6
✗ Branch 2 not taken.
✓ Branch 3 taken 95802002 times.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
✗ Branch 8 not taken.
✗ Branch 9 not taken.
 95802002 geo_debug_assert(capacity() >= product_capacity(a, b));
692
3/6
✓ Branch 1 taken 95802002 times.
✗ Branch 2 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 95802002 times.
✗ Branch 6 not taken.
✓ Branch 7 taken 95802002 times.
 95802002 if(a.length() == 0 || b.length() == 0) {
693 ✗ x_[0] = 0.0;
694 ✗ set_length(0);
695
6/6
✓ Branch 1 taken 6537234 times.
✓ Branch 2 taken 89264768 times.
✓ Branch 4 taken 4556743 times.
✓ Branch 5 taken 1980491 times.
✓ Branch 6 taken 4556743 times.
✓ Branch 7 taken 91245259 times.
 95802002 } else if(a.length() == 1 && b.length() == 1) {
696 4556743 two_product(a[0], b[0], x_[1], x_[0]);
697 4556743 set_length(2);
698
2/2
✓ Branch 1 taken 1980491 times.
✓ Branch 2 taken 89264768 times.
 91245259 } else if(a.length() == 1) {
699 1980491 scale_expansion_zeroelim(b, a[0], *this);
700
2/2
✓ Branch 1 taken 14253950 times.
✓ Branch 2 taken 75010818 times.
 89264768 } else if(b.length() == 1) {
701 14253950 scale_expansion_zeroelim(a, b[0], *this);
702
6/6
✓ Branch 1 taken 68159702 times.
✓ Branch 2 taken 6851116 times.
✓ Branch 4 taken 64085553 times.
✓ Branch 5 taken 4074149 times.
✓ Branch 6 taken 64085553 times.
✓ Branch 7 taken 10925265 times.
 75010818 } else if(a.length() == 2 && b.length() == 2) {
703 64085553 two_two_product(a.data(), b.data(), x_);
704 64085553 set_length(8);
705 } else {
706
707
708 10925265 const expansion* pa = &a;
709 10925265 const expansion* pb = &b;
710
711
2/2
✓ Branch 2 taken 3244839 times.
✓ Branch 3 taken 7680426 times.
 10925265 if(pa->length() > pb->length()) {
712 3244839 std::swap(pa, pb);
713 }
714
715 // [Shewchuk 97]
716 // (https://people.eecs.berkeley.edu/~jrs/papers/robustr.pdf)
717 // Section 2.8: other operations
718 // Distillation: sum of k values.
719 // Worst case: 1/2*k*(k-1)
720 // But O(k log(k)) if the "summing tree" is well balanced
721 // and using fast_expansion_sum().
722 // Recommended way of computing a product:
723 // compute a1*b, a2*b ... ak*b using scale_expansion_zeroelim()
724 // sum them using a well-balanced tree
725 // However, there is an extra cost for the recursion (and more
726 // importantly, for allocating the intermediary sums, especially
727 // when they do not fit on the stack). So when there are less than
728 // 16 values to add, we simply accumulate them.
729
730 10925265 bool use_balanced_distillation = (pa->length() >= 16);
731
732
2/2
✓ Branch 0 taken 1769 times.
✓ Branch 1 taken 10923496 times.
 10925265 if(use_balanced_distillation) {
733 // assign_sub_product() is a recursive function that
734 // creates a balanced distillation tree on the stack.
735
1/2
✓ Branch 3 taken 1769 times.
✗ Branch 4 not taken.
 1769 assign_sub_product(pa->data(), pa->length(),*pb);
736 } else {
737 // trivial implementation: compute all the products
738 // P = ak*b and accumulate them into S
739
740
1/2
✓ Branch 1 taken 10923496 times.
✗ Branch 2 not taken.
 10923496 index_t P_capa = product_capacity(*pb, 3.0); // 3.0, or any
741 // number that is
742 // not a power of 2
743
744 10923496 index_t S_capa = capacity(); // same capacity as this,
745 // enough to store sum.
746
747 10923496 bool P_on_heap = (P_capa > MAX_CAPACITY_ON_STACK);
748 10923496 bool S_on_heap = (S_capa > MAX_CAPACITY_ON_STACK);
749
750 10923496 expansion* P = P_on_heap ?
751 ✗ new_expansion_on_heap(P_capa) :
752
3/6
✗ Branch 0 not taken.
✓ Branch 1 taken 10923496 times.
✓ Branch 5 taken 10923496 times.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
✓ Branch 8 taken 10923496 times.
 10923496 new_expansion_on_stack(P_capa);
753
754 10923496 expansion* S = S_on_heap ?
755 1 new_expansion_on_heap(S_capa) :
756
5/6
✓ Branch 0 taken 1 times.
✓ Branch 1 taken 10923495 times.
✓ Branch 5 taken 10923495 times.
✓ Branch 6 taken 1 times.
✗ Branch 7 not taken.
✓ Branch 8 taken 10923495 times.
 10923497 new_expansion_on_stack(S_capa);
757
758 10923496 expansion* S1 = S;
759 10923496 expansion* S2 = this;
760
761
2/2
✓ Branch 1 taken 6761458 times.
✓ Branch 2 taken 4162038 times.
 10923496 if((pa->length()%2) == 0) {
762 6761458 std::swap(S1,S2);
763 }
764
765
2/2
✓ Branch 1 taken 27746234 times.
✓ Branch 2 taken 10923496 times.
 38669730 for(index_t i=0; i<pa->length(); ++i) {
766
2/2
✓ Branch 0 taken 10923496 times.
✓ Branch 1 taken 16822738 times.
 27746234 if(i == 0) {
767
2/4
✓ Branch 1 taken 10923496 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 10923496 times.
✗ Branch 5 not taken.
 10923496 S2->assign_product(*pb, (*pa)[i]);
768 } else {
769
2/4
✓ Branch 1 taken 16822738 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 16822738 times.
✗ Branch 5 not taken.
 16822738 P->assign_product(*pb, (*pa)[i]);
770
1/2
✓ Branch 1 taken 16822738 times.
✗ Branch 2 not taken.
 16822738 S2->assign_sum(*S1,*P);
771 }
772 27746234 std::swap(S1,S2);
773 }
774
775
1/6
✗ Branch 0 not taken.
✓ Branch 1 taken 10923496 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
 10923496 geo_assert(S1 == this);
776
777
2/2
✓ Branch 0 taken 1 times.
✓ Branch 1 taken 10923495 times.
 10923496 if(S_on_heap) {
778 1 delete_expansion_on_heap(S);
779 }
780
781
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 10923496 times.
 10923496 if(P_on_heap) {
782 ✗ delete_expansion_on_heap(P);
783 }
784 }
785 }
786 95802002 return *this;
787 }
788
789 ✗ expansion& expansion::assign_product(
790 const expansion& a, const expansion& b, const expansion& c
791 ) {
792 ✗ const expansion& bc = expansion_product(b, c);
793 ✗ this->assign_product(a, bc);
794 ✗ return *this;
795 }
796
797 ✗ expansion& expansion::assign_square(const expansion& a) {
798 ✗ geo_debug_assert(capacity() >= square_capacity(a));
799 ✗ if(a.length() == 1) {
800 ✗ square(a[0], x_[1], x_[0]);
801 ✗ set_length(2);
802 ✗ } else if(a.length() == 2) {
803 ✗ two_square(a[1], a[0], x_);
804 ✗ set_length(6);
805 } else {
806 ✗ this->assign_product(a, a);
807 }
808 ✗ return *this;
809 }
810
811 // ============= determinants ==========================================
812
813 33014969 expansion& expansion::assign_det2x2(
814 const expansion& a11, const expansion& a12,
815 const expansion& a21, const expansion& a22
816 ) {
817
2/6
✓ Branch 6 taken 33014969 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✓ Branch 9 taken 33014969 times.
✗ Branch 11 not taken.
✗ Branch 12 not taken.
 33014969 const expansion& a11a22 = expansion_product(a11, a22);
818
2/6
✓ Branch 6 taken 33014969 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✓ Branch 9 taken 33014969 times.
✗ Branch 11 not taken.
✗ Branch 12 not taken.
 33014969 const expansion& a12a21 = expansion_product(a12, a21);
819 33014969 return this->assign_diff(a11a22, a12a21);
820 }
821
822 5954490 expansion& expansion::assign_det3x3(
823 const expansion& a11, const expansion& a12, const expansion& a13,
824 const expansion& a21, const expansion& a22, const expansion& a23,
825 const expansion& a31, const expansion& a32, const expansion& a33
826 ) {
827 // Development w.r.t. first row
828
2/6
✓ Branch 6 taken 5954490 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✓ Branch 9 taken 5954490 times.
✗ Branch 11 not taken.
✗ Branch 12 not taken.
 5954490 const expansion& c11 = expansion_det2x2(a22, a23, a32, a33);
829
2/6
✓ Branch 6 taken 5954490 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✓ Branch 9 taken 5954490 times.
✗ Branch 11 not taken.
✗ Branch 12 not taken.
 5954490 const expansion& c12 = expansion_det2x2(a23, a21, a33, a31);
830
2/6
✓ Branch 6 taken 5954490 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✓ Branch 9 taken 5954490 times.
✗ Branch 11 not taken.
✗ Branch 12 not taken.
 5954490 const expansion& c13 = expansion_det2x2(a21, a22, a31, a32);
831
2/6
✓ Branch 6 taken 5954490 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✓ Branch 9 taken 5954490 times.
✗ Branch 11 not taken.
✗ Branch 12 not taken.
 5954490 const expansion& a11c11 = expansion_product(a11, c11);
832
2/6
✓ Branch 6 taken 5954490 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✓ Branch 9 taken 5954490 times.
✗ Branch 11 not taken.
✗ Branch 12 not taken.
 5954490 const expansion& a12c12 = expansion_product(a12, c12);
833
2/6
✓ Branch 6 taken 5954490 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✓ Branch 9 taken 5954490 times.
✗ Branch 11 not taken.
✗ Branch 12 not taken.
 5954490 const expansion& a13c13 = expansion_product(a13, c13);
834 5954490 return this->assign_sum(a11c11, a12c12, a13c13);
835 }
836
837 ✗ expansion& expansion::assign_det_111_2x3(
838 const expansion& a21, const expansion& a22, const expansion& a23,
839 const expansion& a31, const expansion& a32, const expansion& a33
840 ) {
841 ✗ const expansion& c11 = expansion_det2x2(a22, a23, a32, a33);
842 ✗ const expansion& c12 = expansion_det2x2(a23, a21, a33, a31);
843 ✗ const expansion& c13 = expansion_det2x2(a21, a22, a31, a32);
844 ✗ return this->assign_sum(c11, c12, c13);
845 }
846
847 // ============= geometric operations ==================================
848
849 10088462 expansion& expansion::assign_sq_dist(
850 const double* p1, const double* p2, coord_index_t dim
851 ) {
852
1/6
✗ Branch 2 not taken.
✓ Branch 3 taken 10088462 times.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
✗ Branch 8 not taken.
✗ Branch 9 not taken.
 10088462 geo_debug_assert(capacity() >= sq_dist_capacity(dim));
853
1/6
✗ Branch 0 not taken.
✓ Branch 1 taken 10088462 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
 10088462 geo_debug_assert(dim > 0);
854
2/2
✓ Branch 0 taken 6053094 times.
✓ Branch 1 taken 4035368 times.
 10088462 if(dim == 1) {
855 double d0, d1;
856 6053094 two_diff(p1[0], p2[0], d1, d0);
857 6053094 two_square(d1, d0, x_);
858
1/2
✓ Branch 1 taken 6053094 times.
✗ Branch 2 not taken.
 6053094 set_length(6);
859 } else {
860 // "Distillation" (see Shewchuk's paper) is computed recursively,
861 // by splitting the list of expansions to sum into two halves.
862 4035368 coord_index_t dim1 = dim / 2;
863 4035368 coord_index_t dim2 = coord_index_t(dim - dim1);
864 4035368 const double* p1_2 = p1 + dim1;
865 4035368 const double* p2_2 = p2 + dim1;
866
2/6
✓ Branch 6 taken 4035368 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✓ Branch 9 taken 4035368 times.
✗ Branch 11 not taken.
✗ Branch 12 not taken.
 4035368 expansion& d1 = expansion_sq_dist(p1, p2, dim1);
867
2/6
✓ Branch 6 taken 4035368 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✓ Branch 9 taken 4035368 times.
✗ Branch 11 not taken.
✗ Branch 12 not taken.
 4035368 expansion& d2 = expansion_sq_dist(p1_2, p2_2, dim2);
868 4035368 this->assign_sum(d1, d2);
869 }
870 10088462 return *this;
871 }
872
873 10254566 expansion& expansion::assign_dot_at(
874 const double* p1, const double* p2, const double* p0,
875 coord_index_t dim
876 ) {
877
1/6
✗ Branch 2 not taken.
✓ Branch 3 taken 10254566 times.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
✗ Branch 8 not taken.
✗ Branch 9 not taken.
 10254566 geo_debug_assert(capacity() >= dot_at_capacity(dim));
878
2/2
✓ Branch 0 taken 6152790 times.
✓ Branch 1 taken 4101776 times.
 10254566 if(dim == 1) {
879
880 double v[2];
881 6152790 two_diff(p1[0], p0[0], v[1], v[0]);
882 double w[2];
883 6152790 two_diff(p2[0], p0[0], w[1], w[0]);
884 6152790 two_two_product(v, w, x_);
885
1/2
✓ Branch 1 taken 6152790 times.
✗ Branch 2 not taken.
 6152790 set_length(8);
886 } else {
887 // "Distillation" (see Shewchuk's paper) is computed recursively,
888 // by splitting the list of expansions to sum into two halves.
889 4101776 coord_index_t dim1 = dim / 2;
890 4101776 coord_index_t dim2 = coord_index_t(dim - dim1);
891 4101776 const double* p1_2 = p1 + dim1;
892 4101776 const double* p2_2 = p2 + dim1;
893 4101776 const double* p0_2 = p0 + dim1;
894
2/6
✓ Branch 6 taken 4101776 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✓ Branch 9 taken 4101776 times.
✗ Branch 11 not taken.
✗ Branch 12 not taken.
 4101776 expansion& d1 = expansion_dot_at(p1, p2, p0, dim1);
895
2/6
✓ Branch 6 taken 4101776 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✓ Branch 9 taken 4101776 times.
✗ Branch 11 not taken.
✗ Branch 12 not taken.
 4101776 expansion& d2 = expansion_dot_at(p1_2, p2_2, p0_2, dim2);
896 4101776 this->assign_sum(d1, d2);
897 }
898 10254566 return *this;
899 }
900
901 ✗ expansion& expansion::assign_length2(
902 const expansion& x, const expansion& y, const expansion& z
903 ) {
904 ✗ const expansion& x2 = expansion_square(x);
905 ✗ const expansion& y2 = expansion_square(y);
906 ✗ const expansion& z2 = expansion_square(z);
907 ✗ this->assign_sum(x2,y2,z2);
908 ✗ return *this;
909 }
910
911 /************************************************************************/
912
913 1558643 bool expansion::is_same_as(const expansion& rhs) const {
914
2/2
✓ Branch 2 taken 403089 times.
✓ Branch 3 taken 1155554 times.
 1558643 if(length() != rhs.length()) {
915 403089 return false;
916 }
917
2/2
✓ Branch 1 taken 1391686 times.
✓ Branch 2 taken 747665 times.
 2139351 for(index_t i=0; i<length(); ++i) {
918
2/2
✓ Branch 0 taken 407889 times.
✓ Branch 1 taken 983797 times.
 1391686 if(x_[i] != rhs.x_[i]) {
919 407889 return false;
920 }
921 }
922 747665 return true;
923 }
924
925 ✗ bool expansion::is_same_as(double rhs) const {
926 ✗ if(length() != 1) {
927 ✗ return false;
928 }
929 ✗ return (x_[0] == rhs);
930 }
931
932 4214581 Sign expansion::compare(const expansion& rhs) const {
933 // Fast path: different signs or both zero
934 4214581 Sign s1 = sign();
935 4214581 Sign s2 = rhs.sign();
936
4/4
✓ Branch 0 taken 1514206 times.
✓ Branch 1 taken 2700375 times.
✓ Branch 2 taken 492630 times.
✓ Branch 3 taken 1021576 times.
 4214581 if(s1 == ZERO && s2 == ZERO) {
937 492630 return ZERO;
938 }
939
2/2
✓ Branch 0 taken 2163308 times.
✓ Branch 1 taken 1558643 times.
 3721951 if(s1 != s2) {
940
2/2
✓ Branch 0 taken 718569 times.
✓ Branch 1 taken 1444739 times.
 2163308 return (int(s1) > int(s2) ? POSITIVE : NEGATIVE);
941 }
942
943 // Fast path: same internal representation
944
2/2
✓ Branch 1 taken 747665 times.
✓ Branch 2 taken 810978 times.
 1558643 if(is_same_as(rhs)) {
945 747665 return ZERO;
946 }
947
948 // Compute difference and return sign of difference
949 810978 index_t capa = diff_capacity(*this, rhs);
950
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 810978 times.
 810978 if(capa > MAX_CAPACITY_ON_STACK) {
951 ✗ expansion* d = new_expansion_on_heap(capa);
952 ✗ d->assign_diff(*this, rhs);
953 ✗ Sign result = d->sign();
954 ✗ delete_expansion_on_heap(d);
955 ✗ return result;
956 }
957
2/6
✓ Branch 6 taken 810978 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✓ Branch 9 taken 810978 times.
✗ Branch 11 not taken.
✗ Branch 12 not taken.
 810978 const expansion& d = expansion_diff(*this, rhs);
958 810978 return d.sign();
959 }
960
961 ✗ Sign expansion::compare(double rhs) const {
962 // Fast path: different signs or both zero
963 ✗ Sign s1 = sign();
964 ✗ Sign s2 = geo_sgn(rhs);
965 ✗ if(s1 == ZERO && s2 == ZERO) {
966 ✗ return ZERO;
967 }
968 ✗ if(s1 != s2) {
969 ✗ return (int(s1) > int(s2) ? POSITIVE : NEGATIVE);
970 }
971
972 // Fast path: same internal representation
973 ✗ if(is_same_as(rhs)) {
974 ✗ return ZERO;
975 }
976
977 // Compute difference and return sign of difference
978 ✗ index_t capa = diff_capacity(*this, rhs);
979 ✗ if(capa > MAX_CAPACITY_ON_STACK) {
980 ✗ expansion* d = new_expansion_on_heap(capa);
981 ✗ d->assign_diff(*this, rhs);
982 ✗ Sign result = d->sign();
983 ✗ delete_expansion_on_heap(d);
984 ✗ return result;
985 }
986 ✗ const expansion& d = expansion_diff(*this, rhs);
987 ✗ return d.sign();
988 }
989
990
991 /************************************************************************/
992
993 ✗ void expansion::show_all_stats() {
994 #ifdef PCK_STATS
995 // Place holder: if we compute statistics for expansions,
996 // the code here will be called if sys:stats is specified
997 // on command line.
998 #endif
999 ✗ }
1000
1001 /************************************************************************/
1002
1003 ✗ Sign sign_of_expansion_determinant(
1004 const expansion& a00,const expansion& a01,
1005 const expansion& a10,const expansion& a11
1006 ) {
1007 ✗ const expansion& result = expansion_det2x2(a00, a01, a10, a11);
1008 ✗ return result.sign();
1009 }
1010
1011 ✗ Sign sign_of_expansion_determinant(
1012 const expansion& a00,const expansion& a01,const expansion& a02,
1013 const expansion& a10,const expansion& a11,const expansion& a12,
1014 const expansion& a20,const expansion& a21,const expansion& a22
1015 ) {
1016 // First compute the det2x2
1017 const expansion& m01 =
1018 ✗ expansion_det2x2(a00, a10, a01, a11);
1019 const expansion& m02 =
1020 ✗ expansion_det2x2(a00, a20, a01, a21);
1021 const expansion& m12 =
1022 ✗ expansion_det2x2(a10, a20, a11, a21);
1023
1024 // Now compute the minors of rank 3
1025 ✗ const expansion& z1 = expansion_product(m01,a22);
1026 ✗ const expansion& z2 = expansion_product(m02,a12).negate();
1027 ✗ const expansion& z3 = expansion_product(m12,a02);
1028
1029 ✗ const expansion& result = expansion_sum3(z1,z2,z3);
1030 ✗ return result.sign();
1031 }
1032
1033 ✗ Sign sign_of_expansion_determinant(
1034 const expansion& a00,const expansion& a01,
1035 const expansion& a02,const expansion& a03,
1036 const expansion& a10,const expansion& a11,
1037 const expansion& a12,const expansion& a13,
1038 const expansion& a20,const expansion& a21,
1039 const expansion& a22,const expansion& a23,
1040 const expansion& a30,const expansion& a31,
1041 const expansion& a32,const expansion& a33
1042 ) {
1043
1044 // First compute the det2x2
1045 const expansion& m01 =
1046 ✗ expansion_det2x2(a10,a00,a11,a01);
1047 const expansion& m02 =
1048 ✗ expansion_det2x2(a20,a00,a21,a01);
1049 const expansion& m03 =
1050 ✗ expansion_det2x2(a30,a00,a31,a01);
1051 const expansion& m12 =
1052 ✗ expansion_det2x2(a20,a10,a21,a11);
1053 const expansion& m13 =
1054 ✗ expansion_det2x2(a30,a10,a31,a11);
1055 const expansion& m23 =
1056 ✗ expansion_det2x2(a30,a20,a31,a21);
1057
1058 // Now compute the minors of rank 3
1059 ✗ const expansion& m012_1 = expansion_product(m12,a02);
1060 ✗ expansion& m012_2 = expansion_product(m02,a12); m012_2.negate();
1061 ✗ const expansion& m012_3 = expansion_product(m01,a22);
1062 ✗ const expansion& m012 = expansion_sum3(m012_1, m012_2, m012_3);
1063
1064 ✗ const expansion& m013_1 = expansion_product(m13,a02);
1065 ✗ expansion& m013_2 = expansion_product(m03,a12); m013_2.negate();
1066
1067 ✗ const expansion& m013_3 = expansion_product(m01,a32);
1068 ✗ const expansion& m013 = expansion_sum3(m013_1, m013_2, m013_3);
1069
1070 ✗ const expansion& m023_1 = expansion_product(m23,a02);
1071 ✗ expansion& m023_2 = expansion_product(m03,a22); m023_2.negate();
1072 ✗ const expansion& m023_3 = expansion_product(m02,a32);
1073 ✗ const expansion& m023 = expansion_sum3(m023_1, m023_2, m023_3);
1074
1075 ✗ const expansion& m123_1 = expansion_product(m23,a12);
1076 ✗ expansion& m123_2 = expansion_product(m13,a22); m123_2.negate();
1077 ✗ const expansion& m123_3 = expansion_product(m12,a32);
1078 ✗ const expansion& m123 = expansion_sum3(m123_1, m123_2, m123_3);
1079
1080 // Now compute the minors of rank 4
1081 ✗ const expansion& m0123_1 = expansion_product(m123,a03);
1082 ✗ const expansion& m0123_2 = expansion_product(m023,a13);
1083 ✗ const expansion& m0123_3 = expansion_product(m013,a23);
1084 ✗ const expansion& m0123_4 = expansion_product(m012,a33);
1085
1086 ✗ const expansion& z1 = expansion_sum(m0123_1, m0123_3);
1087 ✗ const expansion& z2 = expansion_sum(m0123_2, m0123_4);
1088
1089 ✗ const expansion& result = expansion_diff(z1,z2);
1090 ✗ return result.sign();
1091 }
1092
1093 /************************************************************************/
1094
1095 2289445 void expansion::optimize() {
1096 2289445 compress_expansion(*this);
1097 2289445 }
1098
1099 /************************************************************************/
1100
1101 }
1102