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
|
/**
* Copyright (C) 2013 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/>.
*
* 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/db/index/btree_access_method.h"
#include <vector>
#include "mongo/base/status.h"
#include "mongo/db/jsobj.h"
#include "mongo/db/keypattern.h"
namespace mongo {
using std::vector;
// Standard Btree implementation below.
BtreeAccessMethod::BtreeAccessMethod(IndexCatalogEntry* btreeState, SortedDataInterface* btree)
: IndexAccessMethod(btreeState, 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());
}
if (0 == _descriptor->version()) {
_keyGenerator.reset(new BtreeKeyGeneratorV0(fieldNames, fixed, _descriptor->isSparse()));
} else if (1 == _descriptor->version()) {
_keyGenerator.reset(new BtreeKeyGeneratorV1(
fieldNames, fixed, _descriptor->isSparse(), btreeState->getCollator()));
} else {
massert(16745, "Invalid index version for key generation.", false);
}
}
void BtreeAccessMethod::getKeys(const BSONObj& obj, BSONObjSet* keys) const {
// SERVER-22726 represents the work to gather and persist the path-level multikey information.
// Until that's done, we may as well avoid computing the prefixes of the indexed fields that
// cause the index to be multikey.
MultikeyPaths* multikeyPaths = nullptr;
_keyGenerator->getKeys(obj, keys, multikeyPaths);
}
} // namespace mongo
|