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
|
/**
* 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.
*/
#include "mongo/db/index/btree_access_method.h"
#include <vector>
#include "mongo/base/status.h"
#include "mongo/base/status_with.h"
#include "mongo/db/catalog/index_catalog_entry.h"
#include "mongo/db/index/expression_keys_private.h"
#include "mongo/db/jsobj.h"
#include "mongo/db/keypattern.h"
namespace mongo {
using std::vector;
// Standard Btree implementation below.
BtreeAccessMethod::BtreeAccessMethod(IndexCatalogEntry* btreeState,
std::unique_ptr<SortedDataInterface> btree)
: SortedDataIndexAccessMethod(btreeState, std::move(btree)) {
// The key generation wants these values.
vector<const char*> fieldNames;
vector<BSONElement> fixed;
BSONObjIterator it(_descriptor->keyPattern());
while (it.more()) {
BSONElement elt = it.next();
fieldNames.push_back(elt.fieldName());
fixed.push_back(BSONElement());
}
_keyGenerator =
std::make_unique<BtreeKeyGenerator>(fieldNames,
fixed,
_descriptor->isSparse(),
getSortedDataInterface()->getKeyStringVersion(),
getSortedDataInterface()->getOrdering());
}
void BtreeAccessMethod::validateDocument(const CollectionPtr& collection,
const BSONObj& obj,
const BSONObj& keyPattern) const {
ExpressionKeysPrivate::validateDocumentCommon(collection, obj, keyPattern);
}
void BtreeAccessMethod::doGetKeys(OperationContext* opCtx,
const CollectionPtr& collection,
SharedBufferFragmentBuilder& pooledBufferBuilder,
const BSONObj& obj,
GetKeysContext context,
KeyStringSet* keys,
KeyStringSet* multikeyMetadataKeys,
MultikeyPaths* multikeyPaths,
const boost::optional<RecordId>& id) const {
const auto skipMultikey = context == GetKeysContext::kValidatingKeys &&
!_descriptor->getEntry()->isMultikey(opCtx, collection);
_keyGenerator->getKeys(pooledBufferBuilder,
obj,
skipMultikey,
keys,
multikeyPaths,
_indexCatalogEntry->getCollator(),
id);
}
} // namespace mongo
|
