summaryrefslogtreecommitdiff
path: root/jstests/core/geo_s2ordering.js
diff options
context:
space:
mode:
Diffstat (limited to 'jstests/core/geo_s2ordering.js')
-rw-r--r--jstests/core/geo_s2ordering.js16
1 files changed, 8 insertions, 8 deletions
diff --git a/jstests/core/geo_s2ordering.js b/jstests/core/geo_s2ordering.js
index fa41592e773..84b78edecfb 100644
--- a/jstests/core/geo_s2ordering.js
+++ b/jstests/core/geo_s2ordering.js
@@ -2,16 +2,16 @@
// actually matters for lookup speed. That is, if we're looking for a non-geo key of which
// there are not many, the index order (nongeo, geo) should be faster than (geo, nongeo)
// for 2dsphere.
-t = db.geo_s2ordering
+t = db.geo_s2ordering;
t.drop();
-needle = "hari"
+needle = "hari";
// We insert lots of points in a region and look for a non-geo key which is rare.
function makepoints(needle) {
- lat = 0
- lng = 0
- points = 50.0
+ lat = 0;
+ lng = 0;
+ points = 50.0;
var bulk = t.initializeUnorderedBulkOp();
for (var x = -points; x < points; x += 1) {
for (var y = -points; y < points; y += 1) {
@@ -36,10 +36,10 @@ function runTest(index) {
return stats;
}
-makepoints(needle)
+makepoints(needle);
// Indexing non-geo first should be quicker.
-fast = runTest({nongeo: 1, geo: "2dsphere"})
-slow = runTest({geo: "2dsphere", nongeo: 1})
+fast = runTest({nongeo: 1, geo: "2dsphere"});
+slow = runTest({geo: "2dsphere", nongeo: 1});
// The nReturned should be the same
assert.eq(fast.nReturned, 1);
assert.eq(slow.nReturned, 1);