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) 2017 MongoDB 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/update/pop_node.h"
#include "mongo/db/matcher/expression_parser.h"
namespace mongo {
Status PopNode::init(BSONElement modExpr, const boost::intrusive_ptr<ExpressionContext>& expCtx) {
auto popVal = MatchExpressionParser::parseIntegerElementToLong(modExpr);
if (!popVal.isOK()) {
return popVal.getStatus();
}
if (popVal.getValue() != 1LL && popVal.getValue() != -1LL) {
return {ErrorCodes::FailedToParse,
str::stream() << "$pop expects 1 or -1, found: " << popVal.getValue()};
}
_popFromFront = (popVal.getValue() == -1LL);
return Status::OK();
}
ModifierNode::ModifyResult PopNode::updateExistingElement(
mutablebson::Element* element, std::shared_ptr<FieldRef> elementPath) const {
invariant(element->ok());
uassert(ErrorCodes::TypeMismatch,
str::stream() << "Path '" << elementPath->dottedField()
<< "' contains an element of non-array type '"
<< typeName(element->getType())
<< "'",
element->getType() == BSONType::Array);
if (!element->hasChildren()) {
// The path exists and contains an array, but the array is empty.
return ModifyResult::kNoOp;
}
auto elementToRemove = _popFromFront ? element->leftChild() : element->rightChild();
invariant(elementToRemove.remove());
return ModifyResult::kNormalUpdate;
}
void PopNode::validateUpdate(mutablebson::ConstElement updatedElement,
mutablebson::ConstElement leftSibling,
mutablebson::ConstElement rightSibling,
std::uint32_t recursionLevel,
ModifyResult modifyResult) const {
invariant(modifyResult == ModifyResult::kNormalUpdate);
// Removing elements from an array cannot increase BSON depth or modify a DBRef, so we can
// override validateUpdate to do nothing.
}
} // namespace mongo
|
