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
|
/**
* 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/>.
*
* 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 GNU Affero General 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/pipeline/expression_context.h"
#include "mongo/db/pipeline/value.h"
namespace mongo {
using boost::intrusive_ptr;
using std::vector;
void AccumulatorPush::processInternal(const Value& input, bool merging) {
if (!merging) {
if (!input.missing()) {
vpValue.push_back(input);
_memUsageBytes += input.getApproximateSize();
}
} 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.
verify(input.getType() == Array);
const vector<Value>& vec = input.getArray();
vpValue.insert(vpValue.end(), vec.begin(), vec.end());
for (size_t i = 0; i < vec.size(); i++) {
_memUsageBytes += vec[i].getApproximateSize();
}
}
}
Value AccumulatorPush::getValue(bool toBeMerged) const {
return Value(vpValue);
}
AccumulatorPush::AccumulatorPush() {
_memUsageBytes = sizeof(*this);
}
void AccumulatorPush::reset() {
vector<Value>().swap(vpValue);
_memUsageBytes = sizeof(*this);
}
intrusive_ptr<Accumulator> AccumulatorPush::create() {
return new AccumulatorPush();
}
const char* AccumulatorPush::getOpName() const {
return "$push";
}
}
|
