mirror of
https://github.com/mongodb/mongo.git
synced 2024-12-01 09:32:32 +01:00
63 lines
1.5 KiB
JavaScript
63 lines
1.5 KiB
JavaScript
db.capped2.drop();
|
|
db._dbCommand( { create: "capped2", capped: true, size: 1000, $nExtents: 11, autoIndexId: false } );
|
|
tzz = db.capped2;
|
|
|
|
function debug( x ) {
|
|
// print( x );
|
|
}
|
|
|
|
var val = new Array( 2000 );
|
|
var c = "";
|
|
for( i = 0; i < 2000; ++i, c += "-" ) {
|
|
val[ i ] = { a: c };
|
|
}
|
|
|
|
function checkIncreasing( i ) {
|
|
res = tzz.find().sort( { $natural: -1 } );
|
|
assert( res.hasNext(), "A" );
|
|
var j = i;
|
|
while( res.hasNext() ) {
|
|
try {
|
|
assert.eq( val[ j-- ].a, res.next().a, "B" );
|
|
} catch( e ) {
|
|
debug( "capped2 err " + j );
|
|
throw e;
|
|
}
|
|
}
|
|
res = tzz.find().sort( { $natural: 1 } );
|
|
assert( res.hasNext(), "C" );
|
|
while( res.hasNext() )
|
|
assert.eq( val[ ++j ].a, res.next().a, "D" );
|
|
assert.eq( j, i, "E" );
|
|
}
|
|
|
|
function checkDecreasing( i ) {
|
|
res = tzz.find().sort( { $natural: -1 } );
|
|
assert( res.hasNext(), "F" );
|
|
var j = i;
|
|
while( res.hasNext() ) {
|
|
assert.eq( val[ j++ ].a, res.next().a, "G" );
|
|
}
|
|
res = tzz.find().sort( { $natural: 1 } );
|
|
assert( res.hasNext(), "H" );
|
|
while( res.hasNext() )
|
|
assert.eq( val[ --j ].a, res.next().a, "I" );
|
|
assert.eq( j, i, "J" );
|
|
}
|
|
|
|
for( i = 0 ;; ++i ) {
|
|
debug( "capped 2: " + i );
|
|
tzz.save( val[ i ] );
|
|
if ( tzz.count() == 0 ) {
|
|
assert( i > 100, "K" );
|
|
break;
|
|
}
|
|
checkIncreasing( i );
|
|
}
|
|
|
|
for( i = 600 ; i >= 0 ; --i ) {
|
|
debug( "capped 2: " + i );
|
|
tzz.save( val[ i ] );
|
|
checkDecreasing( i );
|
|
}
|