blob: 42b0e15814715a32b5852c33850aef0a55d32289 (
plain)
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
|
/**
* Copyright (c) 2011 10gen Inc.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License, version 3,
* as published by the Free Software Foundation.
*
* 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
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include "mongo/pch.h"
#include "mongo/db/pipeline/accumulator.h"
#include "mongo/db/pipeline/value.h"
namespace mongo {
void AccumulatorMinMax::processInternal(const Value& input, bool merging) {
// nullish values should have no impact on result
if (!input.nullish()) {
/* compare with the current value; swap if appropriate */
int cmp = Value::compare(_val, input) * _sense;
if (cmp > 0 || _val.missing()) { // missing is lower than all other values
_val = input;
_memUsageBytes = sizeof(*this) + input.getApproximateSize() - sizeof(Value);
}
}
}
Value AccumulatorMinMax::getValue(bool toBeMerged) const {
return _val;
}
AccumulatorMinMax::AccumulatorMinMax(int theSense)
:_sense(theSense)
{
verify((_sense == 1) || (_sense == -1));
_memUsageBytes = sizeof(*this);
}
void AccumulatorMinMax::reset() {
_val = Value();
_memUsageBytes = sizeof(*this);
}
intrusive_ptr<Accumulator> AccumulatorMinMax::createMin() {
return new AccumulatorMinMax(1);
}
intrusive_ptr<Accumulator> AccumulatorMinMax::createMax() {
return new AccumulatorMinMax(-1);
}
const char *AccumulatorMinMax::getOpName() const {
if (_sense == 1)
return "$min";
return "$max";
}
}
|
