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
|
// test min / max query parameters
load("jstests/libs/fixture_helpers.js"); // For FixtureHelpers.
load("jstests/aggregation/extras/utils.js"); // For resultsEq.
addData = function() {
t.save({a: 1, b: 1});
t.save({a: 1, b: 2});
t.save({a: 2, b: 1});
t.save({a: 2, b: 2});
};
t = db.jstests_minmax;
t.drop();
t.ensureIndex({a: 1, b: 1});
addData();
printjson(t.find().min({a: 1, b: 2}).max({a: 2, b: 1}).toArray());
assert.eq(1, t.find().min({a: 1, b: 2}).max({a: 2, b: 1}).toArray().length);
assert.eq(2, t.find().min({a: 1, b: 2}).max({a: 2, b: 1.5}).toArray().length);
assert.eq(2, t.find().min({a: 1, b: 2}).max({a: 2, b: 2}).toArray().length);
// just one bound
assert.eq(3, t.find().min({a: 1, b: 2}).toArray().length);
assert.eq(3, t.find().max({a: 2, b: 1.5}).toArray().length);
assert.eq(3, t.find().min({a: 1, b: 2}).hint({a: 1, b: 1}).toArray().length);
assert.eq(3, t.find().max({a: 2, b: 1.5}).hint({a: 1, b: 1}).toArray().length);
t.drop();
t.ensureIndex({a: 1, b: -1});
addData();
assert.eq(4, t.find().min({a: 1, b: 2}).toArray().length);
assert.eq(4, t.find().max({a: 2, b: 0.5}).toArray().length);
assert.eq(1, t.find().min({a: 2, b: 1}).toArray().length);
assert.eq(1, t.find().max({a: 1, b: 1.5}).toArray().length);
assert.eq(4, t.find().min({a: 1, b: 2}).hint({a: 1, b: -1}).toArray().length);
assert.eq(4, t.find().max({a: 2, b: 0.5}).hint({a: 1, b: -1}).toArray().length);
assert.eq(1, t.find().min({a: 2, b: 1}).hint({a: 1, b: -1}).toArray().length);
assert.eq(1, t.find().max({a: 1, b: 1.5}).hint({a: 1, b: -1}).toArray().length);
// hint doesn't match
assert.throws(function() {
t.find().min({a: 1}).hint({a: 1, b: -1}).toArray();
});
assert.throws(function() {
t.find().min({a: 1, b: 1}).max({a: 1}).hint({a: 1, b: -1}).toArray();
});
assert.throws(function() {
t.find().min({b: 1}).max({a: 1, b: 2}).hint({a: 1, b: -1}).toArray();
});
assert.throws(function() {
t.find().min({a: 1}).hint({$natural: 1}).toArray();
});
assert.throws(function() {
t.find().max({a: 1}).hint({$natural: 1}).toArray();
});
// Reverse direction scan of the a:1 index between a:6 (inclusive) and a:3 (exclusive).
t.drop();
t.ensureIndex({a: 1});
for (i = 0; i < 10; ++i) {
t.save({_id: i, a: i});
}
if (0) { // SERVER-3766
reverseResult = t.find().min({a: 6}).max({a: 3}).sort({a: -1}).hint({a: 1}).toArray();
assert.eq([{_id: 6, a: 6}, {_id: 5, a: 5}, {_id: 4, a: 4}], reverseResult);
}
//
// SERVER-15015.
//
// Test ascending index.
t.drop();
t.ensureIndex({a: 1});
t.insert({a: 3});
t.insert({a: 4});
t.insert({a: 5});
var cursor = t.find().min({a: 4});
if (FixtureHelpers.numberOfShardsForCollection(t) === 1) {
assert.eq(4, cursor.next().a);
assert.eq(5, cursor.next().a);
} else {
// With more than one shard, we cannot assume the results will come back in order, since we
// did not request a sort.
assert(resultsEq([cursor.next().a, cursor.next().a], [4, 5]));
}
assert(!cursor.hasNext());
cursor = t.find().max({a: 4});
assert.eq(3, cursor.next()["a"]);
assert(!cursor.hasNext());
// Test descending index.
t.dropIndexes();
t.ensureIndex({a: -1});
cursor = t.find().min({a: 4});
if (FixtureHelpers.numberOfShardsForCollection(t) === 1) {
assert.eq(4, cursor.next().a);
assert.eq(3, cursor.next().a);
} else {
// With more than one shard, we cannot assume the results will come back in order, since we
// did not request a sort.
assert(resultsEq([cursor.next().a, cursor.next().a], [4, 3]));
}
assert(!cursor.hasNext());
cursor = t.find().max({a: 4});
assert.eq(5, cursor.next()["a"]);
assert(!cursor.hasNext());
|
