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
|
/**
* 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/value.h"
#include "mongo/db/pipeline/accumulation_statement.h"
#include "mongo/db/pipeline/expression_context.h"
#include "mongo/db/query/query_knobs_gen.h"
namespace mongo {
using boost::intrusive_ptr;
using std::vector;
REGISTER_ACCUMULATOR(addToSet, genericParseSingleExpressionAccumulator<AccumulatorAddToSet>);
const char* AccumulatorAddToSet::getOpName() const {
return "$addToSet";
}
void AccumulatorAddToSet::processInternal(const Value& input, bool merging) {
auto addValue = [this](auto&& val) {
bool inserted = _set.insert(val).second;
if (inserted) {
_memUsageBytes += val.getApproximateSize();
uassert(ErrorCodes::ExceededMemoryLimit,
str::stream()
<< "$addToSet used too much memory and cannot spill to disk. Memory limit: "
<< _maxMemUsageBytes << " bytes",
_memUsageBytes < _maxMemUsageBytes);
}
};
if (!merging) {
if (!input.missing()) {
addValue(input);
}
} else {
// If we're merging, we need to take apart the arrays we receive and put their elements into
// the array we are collecting. If we didn't, then we'd get an array of arrays, with one
// array from each merge source.
invariant(input.getType() == Array);
for (auto&& val : input.getArray()) {
addValue(val);
}
}
}
Value AccumulatorAddToSet::getValue(bool toBeMerged) {
return Value(vector<Value>(_set.begin(), _set.end()));
}
AccumulatorAddToSet::AccumulatorAddToSet(ExpressionContext* const expCtx,
boost::optional<int> maxMemoryUsageBytes)
: AccumulatorState(expCtx),
_set(expCtx->getValueComparator().makeUnorderedValueSet()),
_maxMemUsageBytes(maxMemoryUsageBytes.value_or(internalQueryMaxAddToSetBytes.load())) {
_memUsageBytes = sizeof(*this);
}
void AccumulatorAddToSet::reset() {
_set = getExpressionContext()->getValueComparator().makeUnorderedValueSet();
_memUsageBytes = sizeof(*this);
}
intrusive_ptr<AccumulatorState> AccumulatorAddToSet::create(ExpressionContext* const expCtx) {
return new AccumulatorAddToSet(expCtx, boost::none);
}
} // namespace mongo
|
