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
|
/*
* Copyright (C) 2010 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/>.
*/
// client.cpp
#include "stdafx.h"
#include "../client/dbclient.h"
#include "dbtests.h"
#include "../db/concurrency.h"
namespace ClientTests {
class Base {
public:
Base( string coll ){
_ns = (string)"test." + coll;
}
virtual ~Base(){
db.dropCollection( _ns );
}
const char * ns(){ return _ns.c_str(); }
string _ns;
DBDirectClient db;
};
class DropIndex : public Base {
public:
DropIndex() : Base( "dropindex" ){}
void run(){
db.insert( ns() , BSON( "x" << 2 ) );
ASSERT_EQUALS( 1 , db.getIndexes( ns() )->itcount() );
db.ensureIndex( ns() , BSON( "x" << 1 ) );
ASSERT_EQUALS( 2 , db.getIndexes( ns() )->itcount() );
db.dropIndex( ns() , BSON( "x" << 1 ) );
ASSERT_EQUALS( 1 , db.getIndexes( ns() )->itcount() );
db.ensureIndex( ns() , BSON( "x" << 1 ) );
ASSERT_EQUALS( 2 , db.getIndexes( ns() )->itcount() );
db.dropIndexes( ns() );
ASSERT_EQUALS( 1 , db.getIndexes( ns() )->itcount() );
}
};
class ReIndex : public Base {
public:
ReIndex() : Base( "reindex" ){}
void run(){
db.insert( ns() , BSON( "x" << 2 ) );
ASSERT_EQUALS( 1 , db.getIndexes( ns() )->itcount() );
db.ensureIndex( ns() , BSON( "x" << 1 ) );
ASSERT_EQUALS( 2 , db.getIndexes( ns() )->itcount() );
db.reIndex( ns() );
ASSERT_EQUALS( 2 , db.getIndexes( ns() )->itcount() );
}
};
class ReIndex2 : public Base {
public:
ReIndex2() : Base( "reindex2" ){}
void run(){
db.insert( ns() , BSON( "x" << 2 ) );
ASSERT_EQUALS( 1 , db.getIndexes( ns() )->itcount() );
db.ensureIndex( ns() , BSON( "x" << 1 ) );
ASSERT_EQUALS( 2 , db.getIndexes( ns() )->itcount() );
BSONObj out;
ASSERT( db.runCommand( "test" , BSON( "reIndex" << "reindex2" ) , out ) );
ASSERT_EQUALS( 2 , out["nIndexes"].number() );
ASSERT_EQUALS( 2 , db.getIndexes( ns() )->itcount() );
}
};
class CS_10 : public Base {
public:
CS_10() : Base( "CS_10" ) {}
void run() {
string longs( 770, 'c' );
for( int i = 0; i < 11; ++i )
db.insert( ns(), BSON( "a" << i << "b" << longs ) );
db.ensureIndex( ns(), BSON( "a" << 1 << "b" << 1 ) );
auto_ptr< DBClientCursor > c = db.query( ns(), Query().sort( BSON( "a" << 1 << "b" << 1 ) ), 2 );
ASSERT_EQUALS( 11, c->itcount() );
}
};
class All : public Suite {
public:
All() : Suite( "client" ){
}
void setupTests(){
add<DropIndex>();
add<ReIndex>();
add<ReIndex2>();
add<CS_10>();
}
} all;
}
|
