1 files changed, 30 insertions, 0 deletions
diff --git a/jstests/core/query/sort/sort8.js b/jstests/core/query/sort/sort8.js
new file mode 100644
index 00000000000..fa0b0040de1
--- /dev/null
+++ b/jstests/core/query/sort/sort8.js
@@ -0,0 +1,30 @@
+// Check sorting of arrays indexed by key SERVER-2884
+
+t = db.jstests_sort8;
+t.drop();
+
+t.save({a: [1, 10]});
+t.save({a: 5});
+unindexedForward = t.find().sort({a: 1}).toArray();
+unindexedReverse = t.find().sort({a: -1}).toArray();
+t.createIndex({a: 1});
+indexedForward = t.find().sort({a: 1}).hint({a: 1}).toArray();
+indexedReverse = t.find().sort({a: -1}).hint({a: 1}).toArray();
+
+assert.eq(unindexedForward, indexedForward);
+assert.eq(unindexedReverse, indexedReverse);
+
+// Sorting is based on array members, not the array itself.
+assert.eq([1, 10], unindexedForward[0].a);
+assert.eq([1, 10], unindexedReverse[0].a);
+
+// Now try with a bounds constraint.
+t.dropIndexes();
+unindexedForward = t.find({a: {$gte: 5}}).sort({a: 1}).toArray();
+unindexedReverse = t.find({a: {$lte: 5}}).sort({a: -1}).toArray();
+t.createIndex({a: 1});
+indexedForward = t.find({a: {$gte: 5}}).sort({a: 1}).hint({a: 1}).toArray();
+indexedReverse = t.find({a: {$lte: 5}}).sort({a: -1}).hint({a: 1}).toArray();
+
+assert.eq(unindexedForward, indexedForward);
+assert.eq(unindexedReverse, indexedReverse);