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
|
// @tags: [
// does_not_support_stepdowns,
// uses_testing_only_commands,
// ]
// Test query stage merge sorting.
t = db.stages_mergesort;
t.drop();
var collname = "stages_mergesort";
var N = 10;
for (var i = 0; i < N; ++i) {
t.insert({foo: 1, bar: N - i - 1});
t.insert({baz: 1, bar: i});
}
t.ensureIndex({foo: 1, bar: 1});
t.ensureIndex({baz: 1, bar: 1});
// foo == 1
// We would (internally) use "": MinKey and "": MaxKey for the bar index bounds.
ixscan1 = {
ixscan: {
args: {
keyPattern: {foo: 1, bar: 1},
startKey: {foo: 1, bar: 0},
endKey: {foo: 1, bar: 100000},
startKeyInclusive: true,
endKeyInclusive: true,
direction: 1
}
}
};
// baz == 1
ixscan2 = {
ixscan: {
args: {
keyPattern: {baz: 1, bar: 1},
startKey: {baz: 1, bar: 0},
endKey: {baz: 1, bar: 100000},
startKeyInclusive: true,
endKeyInclusive: true,
direction: 1
}
}
};
mergesort = {
mergeSort: {args: {nodes: [ixscan1, ixscan2], pattern: {bar: 1}}}
};
res = db.runCommand({stageDebug: {plan: mergesort, collection: collname}});
assert.eq(res.ok, 1);
assert.eq(res.results.length, 2 * N);
assert.eq(res.results[0].bar, 0);
assert.eq(res.results[2 * N - 1].bar, N - 1);
|
