blob: 86172cb3338fd90e3ec3d1e09502f8cb328db5ca (
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
|
/**
* 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 "pch.h"
#include "accumulator.h"
#include "db/pipeline/value.h"
namespace mongo {
Value AccumulatorMinMax::evaluate(const Document& pDocument) const {
verify(vpOperand.size() == 1);
Value prhs(vpOperand[0]->evaluate(pDocument));
// nullish values should have no impact on result
if (!prhs.nullish()) {
/* compare with the current value; swap if appropriate */
int cmp = Value::compare(pValue, prhs) * sense;
if (cmp > 0 || pValue.missing()) // missing is lower than all other values
pValue = prhs;
}
return Value();
}
AccumulatorMinMax::AccumulatorMinMax(int theSense):
AccumulatorSingleValue(),
sense(theSense) {
verify((sense == 1) || (sense == -1));
}
intrusive_ptr<Accumulator> AccumulatorMinMax::createMin(
const intrusive_ptr<ExpressionContext> &pCtx) {
intrusive_ptr<AccumulatorMinMax> pAccumulator(
new AccumulatorMinMax(1));
return pAccumulator;
}
intrusive_ptr<Accumulator> AccumulatorMinMax::createMax(
const intrusive_ptr<ExpressionContext> &pCtx) {
intrusive_ptr<AccumulatorMinMax> pAccumulator(
new AccumulatorMinMax(-1));
return pAccumulator;
}
const char *AccumulatorMinMax::getOpName() const {
if (sense == 1)
return "$min";
return "$max";
}
}
|
