summaryrefslogtreecommitdiff
path: root/jstests/core/geo_fiddly_box2.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_fiddly_box2.js
parenta025d43f3ce2efc1fb1282a718f5d286fa0a4dc1 (diff)
downloadmongo-4ae691e8edc87d0e3cfb633bb91c328426be007b.tar.gz
SERVER-22468 Format JS code with approved style in jstests/
Diffstat (limited to 'jstests/core/geo_fiddly_box2.js')
-rw-r--r--jstests/core/geo_fiddly_box2.js41
1 files changed, 21 insertions, 20 deletions
diff --git a/jstests/core/geo_fiddly_box2.js b/jstests/core/geo_fiddly_box2.js
index c0be0f2c8dc..6a40b5032b5 100644
--- a/jstests/core/geo_fiddly_box2.js
+++ b/jstests/core/geo_fiddly_box2.js
@@ -1,32 +1,33 @@
// Reproduces simple test for SERVER-2115
-// The setup to reproduce is to create a set of points and a really big bounds so that we are required to do
+// 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.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());