blob: 6d98859132e5cca7670c88c1e78ab8628fa2db2a (
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
|
// Cannot implicitly shard accessed collections because of extra shard key index in sharded
// collection.
// @tags: [assumes_no_implicit_index_creation]
t = db.bigkeysidxtest;
var keys = [];
var str = "aaaabbbbccccddddeeeeffffgggghhhh";
while (str.length < 20000) {
keys.push(str);
str = str + str;
}
function doInsert(order) {
if (order == 1) {
for (var i = 0; i < 10; i++) {
t.insert({_id: i, k: keys[i]});
}
} else {
for (var i = 9; i >= 0; i--) {
t.insert({_id: i, k: keys[i]});
}
}
}
var expect = null;
function check() {
assert(t.validate().valid);
assert.eq(5, t.count());
var c = t.find({k: /^a/}).count();
assert.eq(5, c);
}
function runTest(order) {
t.drop();
t.ensureIndex({k: 1});
doInsert(order);
check(); // check incremental addition
t.reIndex();
check(); // check bottom up
t.drop();
doInsert(order);
assert.eq(1, t.getIndexes().length);
t.ensureIndex({k: 1});
assert.eq(1, t.getIndexes().length);
t.drop();
doInsert(order);
assert.eq(1, t.getIndexes().length);
t.ensureIndex({k: 1}, {background: true});
assert.eq(1, t.getIndexes().length);
}
runTest(1);
runTest(2);
|