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
|
/**
* 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.
*/
#pragma once
#include <vector>
#include "mongo/bson/util/builder.h"
#include "mongo/db/matcher/expression.h"
namespace mongo {
// output from enumerator to query planner
class IndexTag : public MatchExpression::TagData {
public:
static const size_t kNoIndex;
IndexTag() : index(kNoIndex), pos(0) {}
IndexTag(size_t i) : index(i), pos(0) { }
IndexTag(size_t i, size_t p) : index(i), pos(p) { }
virtual ~IndexTag() { }
virtual void debugString(StringBuilder* builder) const {
*builder << " || Selected Index #" << index << " pos " << pos;
}
virtual MatchExpression::TagData* clone() const {
return new IndexTag(index, pos);
}
// What index should we try to use for this leaf?
size_t index;
// What position are we in the index? (Compound.)
size_t pos;
};
// used internally
class RelevantTag : public MatchExpression::TagData {
public:
RelevantTag() { }
std::vector<size_t> first;
std::vector<size_t> notFirst;
// We don't know the full path from a node unless we keep notes as we traverse from the
// root. We do this once and store it.
// TODO: Do a FieldRef / StringData pass.
// TODO: We might want this inside of the MatchExpression.
string path;
virtual void debugString(StringBuilder* builder) const {
*builder << "First: ";
for (size_t i = 0; i < first.size(); ++i) {
*builder << first[i] << " ";
}
*builder << "notFirst: ";
for (size_t i = 0; i < notFirst.size(); ++i) {
*builder << notFirst[i] << " ";
}
*builder << "full path: " << path;
}
virtual MatchExpression::TagData* clone() const {
RelevantTag* ret = new RelevantTag();
ret->first = first;
ret->notFirst = notFirst;
return ret;
}
};
/**
* Tags each node of the tree with the lowest numbered index that the sub-tree rooted at that
* node uses.
*
* Nodes that satisfy Indexability::nodeCanUseIndexOnOwnField are already tagged if there
* exists an index that that node can use.
*/
void tagForSort(MatchExpression* tree);
/**
* Sorts the tree using its IndexTag(s). Nodes that use the same index are adjacent to one
* another.
*/
void sortUsingTags(MatchExpression* tree);
} // namespace mongo
|
