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
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
|
// cusrortests.cpp // cursor related unit tests
//
/**
* Copyright (C) 2009 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/>.
*/
#include "pch.h"
#include "../db/clientcursor.h"
#include "../db/instance.h"
#include "../db/btree.h"
#include "../db/queryutil.h"
#include "dbtests.h"
namespace CursorTests {
namespace BtreeCursorTests {
// The ranges expressed in these tests are impossible given our query
// syntax, so going to do them a hacky way.
class Base {
protected:
static const char *ns() { return "unittests.cursortests.Base"; }
FieldRangeVector *vec( int *vals, int len, int direction = 1 ) {
FieldRangeSet s( "", BSON( "a" << 1 ), true );
for( int i = 0; i < len; i += 2 ) {
_objs.push_back( BSON( "a" << BSON( "$gte" << vals[ i ] << "$lte" << vals[ i + 1 ] ) ) );
FieldRangeSet s2( "", _objs.back(), true );
if ( i == 0 ) {
s.range( "a" ) = s2.range( "a" );
}
else {
s.range( "a" ) |= s2.range( "a" );
}
}
// orphan idxSpec for this test
IndexSpec *idxSpec = new IndexSpec( BSON( "a" << 1 ) );
return new FieldRangeVector( s, *idxSpec, direction );
}
DBDirectClient _c;
private:
vector< BSONObj > _objs;
};
class MultiRange : public Base {
public:
void run() {
dblock lk;
const char *ns = "unittests.cursortests.BtreeCursorTests.MultiRange";
{
DBDirectClient c;
for( int i = 0; i < 10; ++i )
c.insert( ns, BSON( "a" << i ) );
ASSERT( c.ensureIndex( ns, BSON( "a" << 1 ) ) );
}
int v[] = { 1, 2, 4, 6 };
boost::shared_ptr< FieldRangeVector > frv( vec( v, 4 ) );
Client::Context ctx( ns );
scoped_ptr<BtreeCursor> _c( BtreeCursor::make( nsdetails( ns ), 1, nsdetails( ns )->idx(1), frv, 1 ) );
BtreeCursor &c = *_c.get();
ASSERT_EQUALS( "BtreeCursor a_1 multi", c.toString() );
double expected[] = { 1, 2, 4, 5, 6 };
for( int i = 0; i < 5; ++i ) {
ASSERT( c.ok() );
ASSERT_EQUALS( expected[ i ], c.currKey().firstElement().number() );
c.advance();
}
ASSERT( !c.ok() );
}
};
class MultiRangeGap : public Base {
public:
void run() {
dblock lk;
const char *ns = "unittests.cursortests.BtreeCursorTests.MultiRangeGap";
{
DBDirectClient c;
for( int i = 0; i < 10; ++i )
c.insert( ns, BSON( "a" << i ) );
for( int i = 100; i < 110; ++i )
c.insert( ns, BSON( "a" << i ) );
ASSERT( c.ensureIndex( ns, BSON( "a" << 1 ) ) );
}
int v[] = { -50, 2, 40, 60, 109, 200 };
boost::shared_ptr< FieldRangeVector > frv( vec( v, 6 ) );
Client::Context ctx( ns );
scoped_ptr<BtreeCursor> _c( BtreeCursor::make(nsdetails( ns ), 1, nsdetails( ns )->idx(1), frv, 1 ) );
BtreeCursor &c = *_c.get();
ASSERT_EQUALS( "BtreeCursor a_1 multi", c.toString() );
double expected[] = { 0, 1, 2, 109 };
for( int i = 0; i < 4; ++i ) {
ASSERT( c.ok() );
ASSERT_EQUALS( expected[ i ], c.currKey().firstElement().number() );
c.advance();
}
ASSERT( !c.ok() );
}
};
class MultiRangeReverse : public Base {
public:
void run() {
dblock lk;
const char *ns = "unittests.cursortests.BtreeCursorTests.MultiRangeReverse";
{
DBDirectClient c;
for( int i = 0; i < 10; ++i )
c.insert( ns, BSON( "a" << i ) );
ASSERT( c.ensureIndex( ns, BSON( "a" << 1 ) ) );
}
int v[] = { 1, 2, 4, 6 };
boost::shared_ptr< FieldRangeVector > frv( vec( v, 4, -1 ) );
Client::Context ctx( ns );
scoped_ptr<BtreeCursor> _c( BtreeCursor::make( nsdetails( ns ), 1, nsdetails( ns )->idx(1), frv, -1 ) );
BtreeCursor& c = *_c.get();
ASSERT_EQUALS( "BtreeCursor a_1 reverse multi", c.toString() );
double expected[] = { 6, 5, 4, 2, 1 };
for( int i = 0; i < 5; ++i ) {
ASSERT( c.ok() );
ASSERT_EQUALS( expected[ i ], c.currKey().firstElement().number() );
c.advance();
}
ASSERT( !c.ok() );
}
};
class Base2 {
public:
virtual ~Base2() { _c.dropCollection( ns() ); }
protected:
static const char *ns() { return "unittests.cursortests.Base2"; }
DBDirectClient _c;
virtual BSONObj idx() const = 0;
virtual int direction() const { return 1; }
void insert( const BSONObj &o ) {
_objs.push_back( o );
_c.insert( ns(), o );
}
void check( const BSONObj &spec ) {
{
BSONObj keypat = idx();
//cout << keypat.toString() << endl;
_c.ensureIndex( ns(), idx() );
}
Client::Context ctx( ns() );
FieldRangeSet frs( ns(), spec, true );
// orphan spec for this test.
IndexSpec *idxSpec = new IndexSpec( idx() );
boost::shared_ptr< FieldRangeVector > frv( new FieldRangeVector( frs, *idxSpec, direction() ) );
scoped_ptr<BtreeCursor> c( BtreeCursor::make( nsdetails( ns() ), 1, nsdetails( ns() )->idx( 1 ), frv, direction() ) );
Matcher m( spec );
int count = 0;
while( c->ok() ) {
ASSERT( m.matches( c->current() ) );
c->advance();
++count;
}
int expectedCount = 0;
for( vector< BSONObj >::const_iterator i = _objs.begin(); i != _objs.end(); ++i ) {
if ( m.matches( *i ) ) {
++expectedCount;
}
}
ASSERT_EQUALS( expectedCount, count );
}
private:
dblock _lk;
vector< BSONObj > _objs;
};
class EqEq : public Base2 {
public:
void run() {
insert( BSON( "a" << 4 << "b" << 5 ) );
insert( BSON( "a" << 4 << "b" << 5 ) );
insert( BSON( "a" << 4 << "b" << 4 ) );
insert( BSON( "a" << 5 << "b" << 4 ) );
check( BSON( "a" << 4 << "b" << 5 ) );
}
virtual BSONObj idx() const { return BSON( "a" << 1 << "b" << 1 ); }
};
class EqRange : public Base2 {
public:
void run() {
insert( BSON( "a" << 3 << "b" << 5 ) );
insert( BSON( "a" << 4 << "b" << 0 ) );
insert( BSON( "a" << 4 << "b" << 5 ) );
insert( BSON( "a" << 4 << "b" << 6 ) );
insert( BSON( "a" << 4 << "b" << 6 ) );
insert( BSON( "a" << 4 << "b" << 10 ) );
insert( BSON( "a" << 4 << "b" << 11 ) );
insert( BSON( "a" << 5 << "b" << 5 ) );
check( BSON( "a" << 4 << "b" << BSON( "$gte" << 1 << "$lte" << 10 ) ) );
}
virtual BSONObj idx() const { return BSON( "a" << 1 << "b" << 1 ); }
};
class EqIn : public Base2 {
public:
void run() {
insert( BSON( "a" << 3 << "b" << 5 ) );
insert( BSON( "a" << 4 << "b" << 0 ) );
insert( BSON( "a" << 4 << "b" << 5 ) );
insert( BSON( "a" << 4 << "b" << 6 ) );
insert( BSON( "a" << 4 << "b" << 6 ) );
insert( BSON( "a" << 4 << "b" << 10 ) );
insert( BSON( "a" << 4 << "b" << 11 ) );
insert( BSON( "a" << 5 << "b" << 5 ) );
check( BSON( "a" << 4 << "b" << BSON( "$in" << BSON_ARRAY( 5 << 6 << 11 ) ) ) );
}
virtual BSONObj idx() const { return BSON( "a" << 1 << "b" << 1 ); }
};
class RangeEq : public Base2 {
public:
void run() {
insert( BSON( "a" << 0 << "b" << 4 ) );
insert( BSON( "a" << 1 << "b" << 4 ) );
insert( BSON( "a" << 4 << "b" << 3 ) );
insert( BSON( "a" << 5 << "b" << 4 ) );
insert( BSON( "a" << 7 << "b" << 4 ) );
insert( BSON( "a" << 4 << "b" << 4 ) );
insert( BSON( "a" << 9 << "b" << 6 ) );
insert( BSON( "a" << 11 << "b" << 1 ) );
insert( BSON( "a" << 11 << "b" << 4 ) );
check( BSON( "a" << BSON( "$gte" << 1 << "$lte" << 10 ) << "b" << 4 ) );
}
virtual BSONObj idx() const { return BSON( "a" << 1 << "b" << 1 ); }
};
class RangeIn : public Base2 {
public:
void run() {
insert( BSON( "a" << 0 << "b" << 4 ) );
insert( BSON( "a" << 1 << "b" << 5 ) );
insert( BSON( "a" << 4 << "b" << 3 ) );
insert( BSON( "a" << 5 << "b" << 4 ) );
insert( BSON( "a" << 7 << "b" << 5 ) );
insert( BSON( "a" << 4 << "b" << 4 ) );
insert( BSON( "a" << 9 << "b" << 6 ) );
insert( BSON( "a" << 11 << "b" << 1 ) );
insert( BSON( "a" << 11 << "b" << 4 ) );
check( BSON( "a" << BSON( "$gte" << 1 << "$lte" << 10 ) << "b" << BSON( "$in" << BSON_ARRAY( 4 << 6 ) ) ) );
}
virtual BSONObj idx() const { return BSON( "a" << 1 << "b" << 1 ); }
};
class AbortImplicitScan : public Base {
public:
void run() {
dblock lk;
IndexSpec idx( BSON( "a" << 1 << "b" << 1 ) );
_c.ensureIndex( ns(), idx.keyPattern );
for( int i = 0; i < 300; ++i ) {
_c.insert( ns(), BSON( "a" << i << "b" << 5 ) );
}
FieldRangeSet frs( ns(), BSON( "b" << 3 ), true );
boost::shared_ptr<FieldRangeVector> frv( new FieldRangeVector( frs, idx, 1 ) );
Client::Context ctx( ns() );
scoped_ptr<BtreeCursor> c( BtreeCursor::make( nsdetails( ns() ), 1, nsdetails( ns() )->idx(1), frv, 1 ) );
long long initialNscanned = c->nscanned();
ASSERT( initialNscanned < 200 );
ASSERT( c->ok() );
c->advance();
ASSERT( c->nscanned() > initialNscanned );
ASSERT( c->nscanned() < 200 );
ASSERT( c->ok() );
}
};
} // namespace BtreeCursorTests
class All : public Suite {
public:
All() : Suite( "cursor" ) {}
void setupTests() {
add< BtreeCursorTests::MultiRange >();
add< BtreeCursorTests::MultiRangeGap >();
add< BtreeCursorTests::MultiRangeReverse >();
add< BtreeCursorTests::EqEq >();
add< BtreeCursorTests::EqRange >();
add< BtreeCursorTests::EqIn >();
add< BtreeCursorTests::RangeEq >();
add< BtreeCursorTests::RangeIn >();
add< BtreeCursorTests::AbortImplicitScan >();
}
} myall;
} // namespace CursorTests
|
