| 43 | /// https://en.wikipedia.org/wiki/Kahan_summation_algorithm#Further_enhancements |
| 44 | template <typename Range = std::initializer_list<double>> |
| 45 | double NeumaierSum(Range&& inputs) { |
| 46 | double sum = 0, c = 0; |
| 47 | for (const double v : inputs) { |
| 48 | double t = sum + v; |
| 49 | if (std::isfinite(t)) { |
| 50 | if (std::abs(sum) >= std::abs(v)) { |
| 51 | // If sum is bigger, low-order digits of v are lost... |
| 52 | c += (sum - t) + v; |
| 53 | } else { |
| 54 | // ... else low-order digits of sum are lost. |
| 55 | c += (v - t) + sum; |
| 56 | } |
| 57 | } |
| 58 | sum = t; |
| 59 | } |
| 60 | return sum + c; |
| 61 | } |
| 62 | |
| 63 | /// Based-2 logarithm that works only on powers of two. |
| 64 | template <typename T> |