blob: 531b97b19fb7134b1b14525f4f8dd309744c234e (
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
|
/**
* 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 AccumulatorFirst::processInternal(const Value& input, bool merging) {
/* only remember the first value seen */
if (!_haveFirst) {
// can't use pValue.missing() since we want the first value even if missing
_haveFirst = true;
_first = input;
_memUsageBytes = sizeof(*this) + input.getApproximateSize() - sizeof(Value);
}
}
Value AccumulatorFirst::getValue(bool toBeMerged) const {
return _first;
}
AccumulatorFirst::AccumulatorFirst()
: _haveFirst(false)
{
_memUsageBytes = sizeof(*this);
}
void AccumulatorFirst::reset() {
_haveFirst = false;
_first = Value();
_memUsageBytes = sizeof(*this);
}
intrusive_ptr<Accumulator> AccumulatorFirst::create() {
return new AccumulatorFirst();
}
const char *AccumulatorFirst::getOpName() const {
return "$first";
}
}
|
