blob: fbbfbece5e3da22c4a2ee289e106321ac1848918 (
plain)
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
|
// ordering.h
/* Copyright 2009 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.
*/
#pragma once
namespace mongo {
/** A precomputation of a BSON key pattern.
The constructor is private to make conversion more explicit so we notice where we call make().
Over time we should push this up higher and higher.
*/
class Ordering {
const unsigned bits;
const unsigned nkeys;
Ordering(unsigned b,unsigned n) : bits(b),nkeys(n) { }
public:
/** so, for key pattern { a : 1, b : -1 }
get(0) == 1
get(1) == -1
*/
int get(int i) const {
return ((1 << i) & bits) ? -1 : 1;
}
// for woCompare...
unsigned descending(unsigned mask) const { return bits & mask; }
operator string() const {
StringBuilder buf(32);
for ( unsigned i=0; i<nkeys; i++)
buf.append( get(i) > 0 ? "+" : "-" );
return buf.str();
}
static Ordering make(const BSONObj& obj) {
unsigned b = 0;
BSONObjIterator k(obj);
unsigned n = 0;
while( 1 ) {
BSONElement e = k.next();
if( e.eoo() )
break;
uassert( 13103, "too many compound keys", n <= 31 );
if( e.number() < 0 )
b |= (1 << n);
n++;
}
return Ordering(b,n);
}
};
}
|
