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
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
|
/**
* 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.
*/
#pragma once
#include <boost/optional.hpp>
#include <vector>
#include "mongo/base/status.h"
#include "mongo/bson/bsonmisc.h"
#include "mongo/bson/bsonobj.h"
#include "mongo/db/matcher/expression_path.h"
namespace mongo {
/**
* A path match expression which does not expand arrays at the end of the path, and which only
* matches if the path contains an array.
*/
class ArrayMatchingMatchExpression : public PathMatchExpression {
public:
ArrayMatchingMatchExpression(MatchType matchType,
boost::optional<StringData> path,
clonable_ptr<ErrorAnnotation> annotation = nullptr)
: PathMatchExpression(matchType,
path,
ElementPath::LeafArrayBehavior::kNoTraversal,
ElementPath::NonLeafArrayBehavior::kTraverse,
std::move(annotation)) {}
/**
* Returns whether or not the nested array, represented as the object 'anArray', matches.
*
* 'anArray' must be the nested array at this expression's path.
*/
virtual bool matchesArray(const BSONObj& anArray, MatchDetails* details) const = 0;
bool matchesSingleElement(const BSONElement&, MatchDetails* details = nullptr) const final;
bool equivalent(const MatchExpression* other) const override;
MatchCategory getCategory() const final {
return MatchCategory::kArrayMatching;
}
};
class ElemMatchObjectMatchExpression final : public ArrayMatchingMatchExpression {
public:
ElemMatchObjectMatchExpression(boost::optional<StringData> path,
std::unique_ptr<MatchExpression> sub,
clonable_ptr<ErrorAnnotation> annotation = nullptr);
bool matchesArray(const BSONObj& anArray, MatchDetails* details) const;
virtual std::unique_ptr<MatchExpression> clone() const {
std::unique_ptr<ElemMatchObjectMatchExpression> e =
std::make_unique<ElemMatchObjectMatchExpression>(
path(), _sub->clone(), _errorAnnotation);
if (getTag()) {
e->setTag(getTag()->clone());
}
return e;
}
virtual void debugString(StringBuilder& debug, int indentationLevel) const;
BSONObj getSerializedRightHandSide(SerializationOptions opts) const final;
std::vector<std::unique_ptr<MatchExpression>>* getChildVector() final {
return nullptr;
}
virtual size_t numChildren() const {
return 1;
}
virtual MatchExpression* getChild(size_t i) const {
tassert(6400204, "Out-of-bounds access to child of MatchExpression.", i < numChildren());
return _sub.get();
}
virtual void resetChild(size_t i, MatchExpression* other) {
tassert(6329401, "Out-of-bounds access to child of MatchExpression.", i < numChildren());
_sub.reset(other);
}
std::unique_ptr<MatchExpression> releaseChild() {
return std::move(_sub);
}
void resetChild(std::unique_ptr<MatchExpression> newChild) {
_sub = std::move(newChild);
}
void acceptVisitor(MatchExpressionMutableVisitor* visitor) final {
visitor->visit(this);
}
void acceptVisitor(MatchExpressionConstVisitor* visitor) const final {
visitor->visit(this);
}
private:
ExpressionOptimizerFunc getOptimizer() const final;
std::unique_ptr<MatchExpression> _sub;
};
class ElemMatchValueMatchExpression final : public ArrayMatchingMatchExpression {
public:
ElemMatchValueMatchExpression(boost::optional<StringData> path,
std::unique_ptr<MatchExpression> sub,
clonable_ptr<ErrorAnnotation> annotation = nullptr);
explicit ElemMatchValueMatchExpression(boost::optional<StringData> path,
clonable_ptr<ErrorAnnotation> annotation = nullptr);
void add(std::unique_ptr<MatchExpression> sub);
bool matchesArray(const BSONObj& anArray, MatchDetails* details) const;
virtual std::unique_ptr<MatchExpression> clone() const {
std::unique_ptr<ElemMatchValueMatchExpression> e =
std::make_unique<ElemMatchValueMatchExpression>(path(), _errorAnnotation);
for (size_t i = 0; i < _subs.size(); ++i) {
e->add(_subs[i]->clone());
}
if (getTag()) {
e->setTag(getTag()->clone());
}
return e;
}
virtual void debugString(StringBuilder& debug, int indentationLevel) const;
BSONObj getSerializedRightHandSide(SerializationOptions opts) const final;
std::vector<std::unique_ptr<MatchExpression>>* getChildVector() final {
return &_subs;
}
virtual size_t numChildren() const {
return _subs.size();
}
virtual MatchExpression* getChild(size_t i) const {
tassert(6400205, "Out-of-bounds access to child of MatchExpression.", i < numChildren());
return _subs[i].get();
}
virtual void resetChild(size_t i, MatchExpression* other) override {
tassert(6329402, "Out-of-bounds access to child of MatchExpression.", i < numChildren());
_subs[i].reset(other);
}
void acceptVisitor(MatchExpressionMutableVisitor* visitor) final {
visitor->visit(this);
}
void acceptVisitor(MatchExpressionConstVisitor* visitor) const final {
visitor->visit(this);
}
private:
ExpressionOptimizerFunc getOptimizer() const final;
bool _arrayElementMatchesAll(const BSONElement& e) const;
std::vector<std::unique_ptr<MatchExpression>> _subs;
};
class SizeMatchExpression : public ArrayMatchingMatchExpression {
public:
SizeMatchExpression(boost::optional<StringData> path,
int size,
clonable_ptr<ErrorAnnotation> annotation = nullptr);
std::unique_ptr<MatchExpression> clone() const final {
std::unique_ptr<SizeMatchExpression> e =
std::make_unique<SizeMatchExpression>(path(), _size, _errorAnnotation);
if (getTag()) {
e->setTag(getTag()->clone());
}
if (getInputParamId()) {
e->setInputParamId(*getInputParamId());
}
return e;
}
size_t numChildren() const override {
return 0;
}
MatchExpression* getChild(size_t i) const override {
tassert(6400206, "SizeMatchExpression does not have any children.", i < numChildren());
return nullptr;
}
void resetChild(size_t i, MatchExpression* other) override {
tassert(6329403, "SizeMatchExpression does not have any children.", i < numChildren());
}
std::vector<std::unique_ptr<MatchExpression>>* getChildVector() final {
return nullptr;
}
virtual bool matchesArray(const BSONObj& anArray, MatchDetails* details) const;
virtual void debugString(StringBuilder& debug, int indentationLevel) const;
BSONObj getSerializedRightHandSide(SerializationOptions opts) const final;
virtual bool equivalent(const MatchExpression* other) const;
int getData() const {
return _size;
}
void acceptVisitor(MatchExpressionMutableVisitor* visitor) final {
visitor->visit(this);
}
void acceptVisitor(MatchExpressionConstVisitor* visitor) const final {
visitor->visit(this);
}
void setInputParamId(boost::optional<InputParamId> paramId) {
_inputParamId = paramId;
}
boost::optional<InputParamId> getInputParamId() const {
return _inputParamId;
}
private:
virtual ExpressionOptimizerFunc getOptimizer() const final {
return [](std::unique_ptr<MatchExpression> expression) {
return expression;
};
}
int _size; // >= 0 real, < 0, nothing will match
boost::optional<InputParamId> _inputParamId;
};
} // namespace mongo
|