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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
|
/**
* Copyright (C) 2018-present MongoDB, Inc.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the Server Side Public License, version 1,
* as published by MongoDB, Inc.
*
* This program 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
* Server Side Public License for more details.
*
* You should have received a copy of the Server Side Public License
* along with this program. If not, see
* <http://www.mongodb.com/licensing/server-side-public-license>.
*
* As a special exception, the copyright holders give permission to link the
* code of portions of this program with the OpenSSL library under certain
* conditions as described in each individual source file and distribute
* linked combinations including the program with the OpenSSL library. You
* must comply with the Server Side Public License in all respects for
* all of the code used other than as permitted herein. If you modify file(s)
* with this exception, you may extend this exception to your version of the
* file(s), but you are not obligated to do so. If you do not wish to do so,
* delete this exception statement from your version. If you delete this
* exception statement from all source files in the program, then also delete
* it in the license file.
*/
#include "mongo/platform/basic.h"
#include "mongo/db/pipeline/accumulator.h"
#include "mongo/db/exec/document_value/document.h"
#include "mongo/db/exec/document_value/value.h"
#include "mongo/db/pipeline/accumulation_statement.h"
#include "mongo/db/pipeline/expression.h"
#include "mongo/db/pipeline/expression_context.h"
#include "mongo/db/pipeline/window_function/window_function_expression.h"
namespace mongo {
using boost::intrusive_ptr;
REGISTER_ACCUMULATOR(stdDevPop, genericParseSingleExpressionAccumulator<AccumulatorStdDevPop>);
REGISTER_ACCUMULATOR(stdDevSamp, genericParseSingleExpressionAccumulator<AccumulatorStdDevSamp>);
REGISTER_EXPRESSION(stdDevPop, ExpressionFromAccumulator<AccumulatorStdDevPop>::parse);
REGISTER_EXPRESSION(stdDevSamp, ExpressionFromAccumulator<AccumulatorStdDevSamp>::parse);
REGISTER_NON_REMOVABLE_WINDOW_FUNCTION(
stdDevPop, mongo::window_function::ExpressionFromAccumulator<AccumulatorStdDevPop>::parse);
REGISTER_NON_REMOVABLE_WINDOW_FUNCTION(
stdDevSamp, mongo::window_function::ExpressionFromAccumulator<AccumulatorStdDevSamp>::parse);
const char* AccumulatorStdDev::getOpName() const {
return (_isSamp ? "$stdDevSamp" : "$stdDevPop");
}
void AccumulatorStdDev::processInternal(const Value& input, bool merging) {
if (!merging) {
// non numeric types have no impact on standard deviation
if (!input.numeric())
return;
const double val = input.getDouble();
// This is an implementation of the following algorithm:
// http://en.wikipedia.org/wiki/Algorithms_for_calculating_variance#Online_algorithm
_count += 1;
const double delta = val - _mean;
if (delta != 0.0) {
_mean += delta / _count;
_m2 += delta * (val - _mean);
}
} else {
// This is what getValue(true) produced below.
verify(input.getType() == Object);
const double m2 = input["m2"].getDouble();
const double mean = input["mean"].getDouble();
const long long count = input["count"].getLong();
if (count == 0)
return; // This partition had no data to contribute.
// This is an implementation of the following algorithm:
// http://en.wikipedia.org/wiki/Algorithms_for_calculating_variance#Parallel_algorithm
const double delta = mean - _mean;
const long long newCount = count + _count;
if (delta != 0.0) {
// Avoid potential numerical stability issues.
_mean = ((_count * _mean) + (count * mean)) / newCount;
_m2 += delta * delta * (double(_count) * count / newCount);
}
_m2 += m2;
_count = newCount;
}
}
Value AccumulatorStdDev::getValue(bool toBeMerged) {
if (!toBeMerged) {
const long long adjustedCount = (_isSamp ? _count - 1 : _count);
if (adjustedCount <= 0)
return Value(BSONNULL); // standard deviation not well defined in this case
return Value(sqrt(_m2 / adjustedCount));
} else {
return Value(DOC("m2" << _m2 << "mean" << _mean << "count" << _count));
}
}
intrusive_ptr<AccumulatorState> AccumulatorStdDevSamp::create(ExpressionContext* const expCtx) {
return new AccumulatorStdDevSamp(expCtx);
}
intrusive_ptr<AccumulatorState> AccumulatorStdDevPop::create(ExpressionContext* const expCtx) {
return new AccumulatorStdDevPop(expCtx);
}
AccumulatorStdDev::AccumulatorStdDev(ExpressionContext* const expCtx, bool isSamp)
: AccumulatorState(expCtx), _isSamp(isSamp), _count(0), _mean(0), _m2(0) {
// This is a fixed size AccumulatorState so we never need to update this
_memUsageBytes = sizeof(*this);
}
void AccumulatorStdDev::reset() {
_count = 0;
_mean = 0;
_m2 = 0;
}
} // namespace mongo
|