42 lines
1.6 KiB
JavaScript
42 lines
1.6 KiB
JavaScript
|
|
t = db.regex5
|
|
t.drop()
|
|
|
|
// Add filler data to make sure that indexed solutions are
|
|
// chosen over collection scans.
|
|
for (var i = 0; i < 10; i++) {
|
|
t.save({filler: "filler"});
|
|
}
|
|
|
|
t.save( { x : [ "abc" , "xyz1" ] } )
|
|
t.save( { x : [ "ac" , "xyz2" ] } )
|
|
|
|
a = /.*b.*c/
|
|
x = /.*y.*/
|
|
|
|
doit = function() {
|
|
|
|
assert.eq( 1 , t.find( { x : a } ).count() , "A" );
|
|
assert.eq( 2 , t.find( { x : x } ).count() , "B" );
|
|
assert.eq( 2 , t.find( { x : { $in: [ x ] } } ).count() , "C" ); // SERVER-322
|
|
assert.eq( 1 , t.find( { x : { $in: [ a, "xyz1" ] } } ).count() , "D" ); // SERVER-322
|
|
assert.eq( 2 , t.find( { x : { $in: [ a, "xyz2" ] } } ).count() , "E" ); // SERVER-322
|
|
assert.eq( 1 , t.find( { x : { $all : [ a , x ] } } ).count() , "F" ); // SERVER-505
|
|
assert.eq( 1 , t.find( { x : { $all : [ a , "abc" ] } } ).count() , "G" ); // SERVER-505
|
|
assert.eq( 0 , t.find( { x : { $all : [ a , "ac" ] } } ).count() , "H" ); // SERVER-505
|
|
assert.eq( 10 , t.find( { x : { $nin: [ x ] } } ).count() , "I" ); // SERVER-322
|
|
assert.eq( 11 , t.find( { x : { $nin: [ a, "xyz1" ] } } ).count() , "J" ); // SERVER-322
|
|
assert.eq( 10 , t.find( { x : { $nin: [ a, "xyz2" ] } } ).count() , "K" ); // SERVER-322
|
|
assert.eq( 2 , t.find( { x : { $not: { $nin: [ x ] } } } ).count() , "L" ); // SERVER-322
|
|
assert.eq( 11 , t.find( { x : { $nin: [ /^a.c/ ] } } ).count() , "M" ) // SERVER-322
|
|
}
|
|
|
|
doit();
|
|
t.ensureIndex( {x:1} );
|
|
print( "now indexed" );
|
|
doit();
|
|
|
|
// SERVER-505
|
|
assert.eq( 0, t.find( { x : { $all: [ "a", /^a/ ] } } ).itcount());
|
|
assert.eq( 2, t.find( { x : { $all: [ /^a/ ] } } ).itcount());
|