summaryrefslogtreecommitdiff
path: root/jstests/core/geo_circle1.js
diff options
context:
space:
mode:
authorJonathan Abrahams <jonathan@mongodb.com>2016-03-09 12:17:50 -0500
committerJonathan Abrahams <jonathan@mongodb.com>2016-03-09 12:18:14 -0500
commit4ae691e8edc87d0e3cfb633bb91c328426be007b (patch)
tree52079a593f54382ca13a2e741633eab1b6271893 /jstests/core/geo_circle1.js
parenta025d43f3ce2efc1fb1282a718f5d286fa0a4dc1 (diff)
downloadmongo-4ae691e8edc87d0e3cfb633bb91c328426be007b.tar.gz
SERVER-22468 Format JS code with approved style in jstests/
Diffstat (limited to 'jstests/core/geo_circle1.js')
-rw-r--r--jstests/core/geo_circle1.js63
1 files changed, 33 insertions, 30 deletions
diff --git a/jstests/core/geo_circle1.js b/jstests/core/geo_circle1.js
index c4b79e645ab..a679a408b32 100644
--- a/jstests/core/geo_circle1.js
+++ b/jstests/core/geo_circle1.js
@@ -2,45 +2,48 @@
t = db.geo_circle1;
t.drop();
-searches = [
- [ [ 5 , 5 ] , 3 ] ,
- [ [ 5 , 5 ] , 1 ] ,
- [ [ 5 , 5 ] , 5 ] ,
- [ [ 0 , 5 ] , 5 ] ,
-];
-correct = searches.map( function(z){ return []; } );
+searches = [[[5, 5], 3], [[5, 5], 1], [[5, 5], 5], [[0, 5], 5], ];
+correct = searches.map(function(z) {
+ return [];
+});
num = 0;
-for ( x=0; x<=20; x++ ){
- for ( y=0; y<=20; y++ ){
- o = { _id : num++ , loc : [ x , y ] };
- t.save( o );
- for ( i=0; i<searches.length; i++ )
- if ( Geo.distance( [ x , y ] , searches[i][0] ) <= searches[i][1] )
- correct[i].push( o );
+for (x = 0; x <= 20; x++) {
+ for (y = 0; y <= 20; y++) {
+ o = {
+ _id: num++,
+ loc: [x, y]
+ };
+ t.save(o);
+ for (i = 0; i < searches.length; i++)
+ if (Geo.distance([x, y], searches[i][0]) <= searches[i][1])
+ correct[i].push(o);
}
}
-t.ensureIndex( { loc : "2d" } );
+t.ensureIndex({loc: "2d"});
-for ( i=0; i<searches.length; i++ ){
- //print( tojson( searches[i] ) + "\t" + correct[i].length )
- q = { loc : { $within : { $center : searches[i] } } };
+for (i = 0; i < searches.length; i++) {
+ // print( tojson( searches[i] ) + "\t" + correct[i].length )
+ q = {
+ loc: {$within: {$center: searches[i]}}
+ };
- //correct[i].forEach( printjson )
- //printjson( q );
- //t.find( q ).forEach( printjson )
+ // correct[i].forEach( printjson )
+ // printjson( q );
+ // t.find( q ).forEach( printjson )
- //printjson( Array.sort( correct[i].map( function(z){ return z._id; } ) ) )
- //printjson( Array.sort( t.find(q).map( function(z){ return z._id; } ) ) )
-
- assert.eq( correct[i].length , t.find( q ).itcount() , "itcount : " + tojson( searches[i] ) );
- assert.eq( correct[i].length , t.find( q ).count() , "count : " + tojson( searches[i] ) );
- var explain = t.find( q ).explain("executionStats");
- print( 'explain for ' + tojson( q , '' , true ) + ' = ' + tojson( explain ) );
+ // printjson( Array.sort( correct[i].map( function(z){ return z._id; } ) ) )
+ // printjson( Array.sort( t.find(q).map( function(z){ return z._id; } ) ) )
+
+ assert.eq(correct[i].length, t.find(q).itcount(), "itcount : " + tojson(searches[i]));
+ assert.eq(correct[i].length, t.find(q).count(), "count : " + tojson(searches[i]));
+ var explain = t.find(q).explain("executionStats");
+ print('explain for ' + tojson(q, '', true) + ' = ' + tojson(explain));
// The index should be at least minimally effective in preventing the full collection
// scan.
- assert.gt( t.find().count(), explain.executionStats.totalKeysExamined,
- "nscanned : " + tojson( searches[i] ) );
+ assert.gt(t.find().count(),
+ explain.executionStats.totalKeysExamined,
+ "nscanned : " + tojson(searches[i]));
}