-
Notifications
You must be signed in to change notification settings - Fork 1
/
manysum.h
61 lines (59 loc) · 2.4 KB
/
manysum.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
/******************************************************/
/* */
/* manysum.h - add many numbers */
/* */
/******************************************************/
/* Copyright 2020 Pierre Abbat.
* This file is part of Wolkenbase.
*
* Wolkenbase is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* Wolkenbase is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with Wolkenbase. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef MANYSUM_H
#define MANYSUM_H
#include <map>
#include <vector>
#include <cmath>
/* Adds together many numbers (like millions) accurately.
* Each number is put in a bucket numbered by its exponent returned by frexp().
* If the sum of the number and what's in the bucket is too big to fit
* in the bucket, it is put into the next bucket up. If the sum is too small,
* it is not put into the next bucket down, as it has insignificant bits
* at the low end. This can happen only when adding numbers of opposite sign,
* which does not happen when computing volumes, as positive and negative
* volumes are added separately so that compaction of dirt can be computed.
*
* manysum is suited to sums where the number of addends is large and not known
* in advance and computing each one takes a long time. If the number of addends
* is known, or a bound is known, in advance and the addends are calculated
* quickly, it is better to allocate an array and use pairwise summation.
* See matrix.cpp and spiral.cpp for examples.
*/
class manysum
{
private:
std::map<int,double> bucket;
static int cnt;
public:
void clear();
void prune();
double total();
void dump();
manysum& operator+=(double x);
manysum& operator-=(double x);
};
double pairwisesum(double *a,unsigned n);
double pairwisesum(std::vector<double> &a);
long double pairwisesum(long double *a,unsigned n);
long double pairwisesum(std::vector<long double> &a);
#endif