File: sorth.js

package info (click to toggle)
mongodb 1%3A2.4.10-5
  • links: PTS, VCS
  • area: main
  • in suites: jessie-kfreebsd
  • size: 82,464 kB
  • sloc: cpp: 740,225; ansic: 152,098; sh: 13,820; python: 11,864; makefile: 1,012; perl: 922; pascal: 617; java: 452; lisp: 222; asm: 174
file content (21 lines) | stat: -rw-r--r-- 555 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
// An in order index is picked over a scan and order index when the in order index has sufficient
// matches to be picked, see discussion in SERVER-4150.

t = db.jstests_sorth;
t.drop();

t.ensureIndex( {a:1} );
t.ensureIndex( {b:1} );

function checkIndex( index, n ) {
    t.remove();
    for( i = 0; i < n; ++i ) {
        t.save( {a:i%2,b:i} );
    }
    explain = t.find( {a:0,b:{$gte:0}} ).sort( {b:1} ).explain( true );
    assert.eq( index, explain.cursor );
}

checkIndex( "BtreeCursor a_1", 100 );
checkIndex( "BtreeCursor b_1", 500 );
t.drop();