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
|
/**
* Copyright (C) 2019-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/document_source_queue.h"
namespace mongo {
REGISTER_INTERNAL_DOCUMENT_SOURCE(queue,
LiteParsedDocumentSourceDefault::parse,
DocumentSourceQueue::createFromBson,
true);
boost::intrusive_ptr<DocumentSource> DocumentSourceQueue::createFromBson(
BSONElement arrayElem, const boost::intrusive_ptr<ExpressionContext>& expCtx) {
uassert(5858201,
"literal documents specification must be an array",
arrayElem.type() == BSONType::Array);
auto queue = DocumentSourceQueue::create(expCtx);
// arrayElem is an Array and can be iterated through by using .Obj() method
for (const auto& elem : arrayElem.Obj()) {
uassert(5858202,
"literal documents specification must be an array of objects",
elem.type() == BSONType::Object);
queue->emplace_back(Document{elem.Obj()}.getOwned());
}
return queue;
}
boost::intrusive_ptr<DocumentSourceQueue> DocumentSourceQueue::create(
const boost::intrusive_ptr<ExpressionContext>& expCtx,
boost::optional<StringData> aliasStageName) {
return new DocumentSourceQueue({}, expCtx, aliasStageName);
}
DocumentSourceQueue::DocumentSourceQueue(std::deque<GetNextResult> results,
const boost::intrusive_ptr<ExpressionContext>& expCtx,
boost::optional<StringData> aliasStageName)
: DocumentSource(kStageName /* pass the real stage name here for execution stats */, expCtx),
_queue(std::move(results)),
_aliasStageName(std::move(aliasStageName)) {}
const char* DocumentSourceQueue::getSourceName() const {
return _aliasStageName.value_or(kStageName).rawData();
}
DocumentSource::GetNextResult DocumentSourceQueue::doGetNext() {
if (_queue.empty()) {
return GetNextResult::makeEOF();
}
auto next = std::move(_queue.front());
_queue.pop_front();
return next;
}
Value DocumentSourceQueue::serialize(SerializationOptions opts) const {
if (opts.redactFieldNames || opts.replacementForLiteralArgs) {
MONGO_UNIMPLEMENTED_TASSERT(7484319);
}
ValueArrayStream vals;
for (const auto& elem : _queue) {
vals << elem.getDocument().getOwned();
}
return Value(DOC(kStageName << vals.done()));
}
} // namespace mongo
|