summaryrefslogtreecommitdiff
path: root/jstests/core/geo_fiddly_box2.js
diff options
context:
space:
mode:
authorMike Grundy <michael.grundy@10gen.com>2016-02-04 12:29:01 -0500
committerMike Grundy <michael.grundy@10gen.com>2016-02-09 13:41:02 -0500
commit3bed8596d18275d1561e4f44f1f0bd72c1e038f1 (patch)
tree788eaed3c7a692a424f080d16a8841dc8afa3c13 /jstests/core/geo_fiddly_box2.js
parent985e2a0be95709ac064c57f0a9bb385a55937285 (diff)
downloadmongo-3bed8596d18275d1561e4f44f1f0bd72c1e038f1.tar.gz
SERVER-22341 fix jslint errors in jstests/core with eslint --fix
Conflicts: jstests/core/count_hint.js
Diffstat (limited to 'jstests/core/geo_fiddly_box2.js')
-rw-r--r--jstests/core/geo_fiddly_box2.js42
1 files changed, 21 insertions, 21 deletions
diff --git a/jstests/core/geo_fiddly_box2.js b/jstests/core/geo_fiddly_box2.js
index 0588abfa1de..c0be0f2c8dc 100644
--- a/jstests/core/geo_fiddly_box2.js
+++ b/jstests/core/geo_fiddly_box2.js
@@ -3,30 +3,30 @@
// The setup to reproduce is to create a set of points and a really big bounds so that we are required to do
// exact lookups on the points to get correct results.
-t = db.geo_fiddly_box2
-t.drop()
+t = db.geo_fiddly_box2;
+t.drop();
-t.insert( { "letter" : "S", "position" : [ -3, 0 ] } )
-t.insert( { "letter" : "C", "position" : [ -2, 0 ] } )
-t.insert( { "letter" : "R", "position" : [ -1, 0 ] } )
-t.insert( { "letter" : "A", "position" : [ 0, 0 ] } )
-t.insert( { "letter" : "B", "position" : [ 1, 0 ] } )
-t.insert( { "letter" : "B", "position" : [ 2, 0 ] } )
-t.insert( { "letter" : "L", "position" : [ 3, 0 ] } )
-t.insert( { "letter" : "E", "position" : [ 4, 0 ] } )
+t.insert( { "letter" : "S", "position" : [ -3, 0 ] } );
+t.insert( { "letter" : "C", "position" : [ -2, 0 ] } );
+t.insert( { "letter" : "R", "position" : [ -1, 0 ] } );
+t.insert( { "letter" : "A", "position" : [ 0, 0 ] } );
+t.insert( { "letter" : "B", "position" : [ 1, 0 ] } );
+t.insert( { "letter" : "B", "position" : [ 2, 0 ] } );
+t.insert( { "letter" : "L", "position" : [ 3, 0 ] } );
+t.insert( { "letter" : "E", "position" : [ 4, 0 ] } );
-t.ensureIndex( { position : "2d" } )
-result = t.find( { "position" : { "$within" : { "$box" : [ [ -3, -1 ], [ 0, 1 ] ] } } } )
-assert.eq( 4, result.count() )
+t.ensureIndex( { position : "2d" } );
+result = t.find( { "position" : { "$within" : { "$box" : [ [ -3, -1 ], [ 0, 1 ] ] } } } );
+assert.eq( 4, result.count() );
-t.dropIndex( { position : "2d" } )
-t.ensureIndex( { position : "2d" }, { min : -10000000, max : 10000000 } )
+t.dropIndex( { position : "2d" } );
+t.ensureIndex( { position : "2d" }, { min : -10000000, max : 10000000 } );
-result = t.find( { "position" : { "$within" : { "$box" : [ [ -3, -1 ], [ 0, 1 ] ] } } } )
-assert.eq( 4, result.count() )
+result = t.find( { "position" : { "$within" : { "$box" : [ [ -3, -1 ], [ 0, 1 ] ] } } } );
+assert.eq( 4, result.count() );
-t.dropIndex( { position : "2d" } )
-t.ensureIndex( { position : "2d" }, { min : -1000000000, max : 1000000000 } )
+t.dropIndex( { position : "2d" } );
+t.ensureIndex( { position : "2d" }, { min : -1000000000, max : 1000000000 } );
-result = t.find( { "position" : { "$within" : { "$box" : [ [ -3, -1 ], [ 0, 1 ] ] } } } )
-assert.eq( 4, result.count() )
+result = t.find( { "position" : { "$within" : { "$box" : [ [ -3, -1 ], [ 0, 1 ] ] } } } );
+assert.eq( 4, result.count() );