summaryrefslogtreecommitdiff
path: root/jstests/cursor4.js
diff options
context:
space:
mode:
authorEliot Horowitz <eliot@10gen.com>2009-01-26 23:28:26 -0500
committerEliot Horowitz <eliot@10gen.com>2009-01-26 23:28:26 -0500
commitbc38646deb39f5d5af3cd33e34f49b596e837401 (patch)
tree33affd5a1fedb7f8cfad044d92c262d12158ff8b /jstests/cursor4.js
parentf235a0f1b1a8ad6fbbce046205d4b78e60bc1df8 (diff)
downloadmongo-bc38646deb39f5d5af3cd33e34f49b596e837401.tar.gz
imported tests
Diffstat (limited to 'jstests/cursor4.js')
-rw-r--r--jstests/cursor4.js48
1 files changed, 48 insertions, 0 deletions
diff --git a/jstests/cursor4.js b/jstests/cursor4.js
new file mode 100644
index 00000000000..1825ca20c7a
--- /dev/null
+++ b/jstests/cursor4.js
@@ -0,0 +1,48 @@
+// Test inequality bounds with multi-field sorting
+
+function checkResults( expected, cursor ) {
+ assert.eq( expected.length, cursor.count() );
+ for( i = 0; i < expected.length; ++i ) {
+ assert.eq( expected[ i ].a, cursor[ i ].a );
+ assert.eq( expected[ i ].b, cursor[ i ].b );
+ }
+}
+
+function testConstrainedFindMultiFieldSorting( db ) {
+ r = db.ed_db_cursor4_cfmfs;
+ r.drop();
+
+ entries = [ { a: 0, b: 0 },
+ { a: 0, b: 1 },
+ { a: 1, b: 1 },
+ { a: 1, b: 1 },
+ { a: 2, b: 0 } ];
+ for( i = 0; i < entries.length; ++i )
+ r.save( entries[ i ] );
+ r.ensureIndex( { a: 1, b: 1 } );
+ reverseEntries = entries.slice();
+ reverseEntries.reverse();
+
+ checkResults( entries.slice( 2, 4 ), r.find( { a: 1, b: 1 } ).sort( { a: 1, b: 1 } ) );
+ checkResults( entries.slice( 2, 4 ), r.find( { a: 1, b: 1 } ).sort( { a: -1, b: -1 } ) );
+
+ checkResults( entries.slice( 2, 5 ), r.find( { a: { $gt: 0 } } ).sort( { a: 1, b: 1 } ) );
+ checkResults( reverseEntries.slice( 0, 3 ), r.find( { a: { $gt: 0 } } ).sort( { a: -1, b: -1 } ) );
+ checkResults( entries.slice( 0, 4 ), r.find( { a: { $lt: 2 } } ).sort( { a: 1, b: 1 } ) );
+ checkResults( reverseEntries.slice( 1, 5 ), r.find( { a: { $lt: 2 } } ).sort( { a: -1, b: -1 } ) );
+
+ checkResults( entries.slice( 4, 5 ), r.find( { a: { $gt: 0 }, b: { $lt: 1 } } ).sort( { a: 1, b: 1 } ) );
+ checkResults( entries.slice( 2, 4 ), r.find( { a: { $gt: 0 }, b: { $gt: 0 } } ).sort( { a: 1, b: 1 } ) );
+
+ checkResults( reverseEntries.slice( 0, 1 ), r.find( { a: { $gt: 0 }, b: { $lt: 1 } } ).sort( { a: -1, b: -1 } ) );
+ checkResults( reverseEntries.slice( 1, 3 ), r.find( { a: { $gt: 0 }, b: { $gt: 0 } } ).sort( { a: -1, b: -1 } ) );
+
+ checkResults( entries.slice( 0, 1 ), r.find( { a: { $lt: 2 }, b: { $lt: 1 } } ).sort( { a: 1, b: 1 } ) );
+ checkResults( entries.slice( 1, 4 ), r.find( { a: { $lt: 2 }, b: { $gt: 0 } } ).sort( { a: 1, b: 1 } ) );
+
+ checkResults( reverseEntries.slice( 4, 5 ), r.find( { a: { $lt: 2 }, b: { $lt: 1 } } ).sort( { a: -1, b: -1 } ) );
+ checkResults( reverseEntries.slice( 1, 4 ), r.find( { a: { $lt: 2 }, b: { $gt: 0 } } ).sort( { a: -1, b: -1 } ) );
+}
+
+db = connect( "test" );
+testConstrainedFindMultiFieldSorting( db );