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
|
// @file queryutil-inl.h - Inline definitions for frequently called queryutil.h functions
/* Copyright 2011 10gen Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
namespace mongo {
inline bool FieldInterval::equality() const {
if ( _cachedEquality == -1 ) {
_cachedEquality = ( _lower._inclusive && _upper._inclusive && _lower._bound.woCompare( _upper._bound, false ) == 0 );
}
return _cachedEquality;
}
inline bool FieldRange::equality() const {
return
!empty() &&
min().woCompare( max(), false ) == 0 &&
maxInclusive() &&
minInclusive();
}
inline bool FieldRange::inQuery() const {
if ( equality() ) {
return true;
}
for( vector<FieldInterval>::const_iterator i = _intervals.begin(); i != _intervals.end(); ++i ) {
if ( !i->equality() ) {
return false;
}
}
return true;
}
/**
* TODO Assumes intervals are contiguous and minKey/maxKey will not be
* matched against.
*/
inline bool FieldRange::nontrivial() const {
return
! empty() &&
( _intervals.size() != 1 ||
minKey.firstElement().woCompare( min(), false ) != 0 ||
maxKey.firstElement().woCompare( max(), false ) != 0 );
}
inline const FieldRange &FieldRangeSet::range( const char *fieldName ) const {
map<string,FieldRange>::const_iterator f = _ranges.find( fieldName );
if ( f == _ranges.end() )
return trivialRange();
return f->second;
}
inline FieldRange &FieldRangeSet::range( const char *fieldName ) {
map<string,FieldRange>::iterator f = _ranges.find( fieldName );
if ( f == _ranges.end() ) {
_ranges.insert( make_pair( string( fieldName ), trivialRange() ) );
return _ranges.find( fieldName )->second;
}
return f->second;
}
inline int FieldRangeSet::nNontrivialRanges() const {
int count = 0;
for( map<string,FieldRange>::const_iterator i = _ranges.begin(); i != _ranges.end(); ++i ) {
if ( i->second.nontrivial() )
++count;
}
return count;
}
inline bool FieldRangeSet::matchPossible() const {
for( map<string,FieldRange>::const_iterator i = _ranges.begin(); i != _ranges.end(); ++i ) {
if ( i->second.empty() ) {
return false;
}
}
return true;
}
inline bool FieldRangeSet::matchPossibleForIndex( const BSONObj &keyPattern ) const {
if ( !_singleKey ) {
return matchPossible();
}
BSONObjIterator i( keyPattern );
while( i.more() ) {
BSONElement e = i.next();
if ( e.fieldName() == string( "$natural" ) ) {
return true;
}
if ( range( e.fieldName() ).empty() ) {
return false;
}
}
return true;
}
inline long long FieldRangeVector::size() {
long long ret = 1;
for( vector<FieldRange>::const_iterator i = _ranges.begin(); i != _ranges.end(); ++i ) {
ret *= i->intervals().size();
}
return ret;
}
inline FieldRangeSetPair *OrRangeGenerator::topFrsp() const {
FieldRangeSetPair *ret = new FieldRangeSetPair( _baseSet );
if (_orSets.size()) {
*ret &= _orSets.front();
}
return ret;
}
inline FieldRangeSetPair *OrRangeGenerator::topFrspOriginal() const {
FieldRangeSetPair *ret = new FieldRangeSetPair( _baseSet );
if (_originalOrSets.size()) {
*ret &= _originalOrSets.front();
}
return ret;
}
inline bool FieldRangeSetPair::matchPossibleForIndex( NamespaceDetails *d, int idxNo, const BSONObj &keyPattern ) const {
assertValidIndexOrNoIndex( d, idxNo );
if ( !matchPossible() ) {
return false;
}
if ( idxNo < 0 ) {
// multi key matchPossible() is true, so return true.
return true;
}
return frsForIndex( d, idxNo ).matchPossibleForIndex( keyPattern );
}
inline void FieldRangeSetPair::assertValidIndexOrNoIndex( const NamespaceDetails *d, int idxNo ) const {
massert( 14049, "FieldRangeSetPair invalid index specified", idxNo >= -1 );
if ( idxNo >= 0 ) {
assertValidIndex( d, idxNo );
}
}
} // namespace mongo
|
