1 files changed, 37 insertions, 37 deletions
diff --git a/jstests/core/sortb.js b/jstests/core/sortb.js
index 953062a05ec..34fb94951e9 100644
--- a/jstests/core/sortb.js
+++ b/jstests/core/sortb.js
@@ -1,41 +1,41 @@
 // Test that the in memory sort capacity limit is checked for all "top N" sort candidates.
 // SERVER-4716
 (function() {
-    "use strict";
-
-    load("jstests/libs/fixture_helpers.js");  // For FixtureHelpers.
-
-    const t = db.jstests_sortb;
-    t.drop();
-
-    t.ensureIndex({b: 1});
-
-    let i;
-    for (i = 0; i < 100; ++i) {
-        t.save({a: i, b: i});
-    }
-
-    const numShards = FixtureHelpers.numberOfShardsForCollection(t);
-    const numLargeDocumentsToWrite = 120 * numShards;
-
-    // These large documents will not be part of the initial set of "top 100" matches, and they will
-    // not be part of the final set of "top 100" matches returned to the client.  However, they are
-    // an intermediate set of "top 100" matches and should trigger an in memory sort capacity
-    // exception.
-    const big = new Array(1024 * 1024).toString();
-    for (; i < 100 + numLargeDocumentsToWrite; ++i) {
-        t.save({a: i, b: i, big: big});
-    }
-
-    for (; i < 200 + numLargeDocumentsToWrite; ++i) {
-        t.save({a: i, b: i});
-    }
-
-    assert.throws(function() {
-        t.find().sort({a: -1}).hint({b: 1}).limit(100).itcount();
-    });
-    assert.throws(function() {
-        t.find().sort({a: -1}).hint({b: 1}).showDiskLoc().limit(100).itcount();
-    });
-    t.drop();
+"use strict";
+
+load("jstests/libs/fixture_helpers.js");  // For FixtureHelpers.
+
+const t = db.jstests_sortb;
+t.drop();
+
+t.ensureIndex({b: 1});
+
+let i;
+for (i = 0; i < 100; ++i) {
+    t.save({a: i, b: i});
+}
+
+const numShards = FixtureHelpers.numberOfShardsForCollection(t);
+const numLargeDocumentsToWrite = 120 * numShards;
+
+// These large documents will not be part of the initial set of "top 100" matches, and they will
+// not be part of the final set of "top 100" matches returned to the client.  However, they are
+// an intermediate set of "top 100" matches and should trigger an in memory sort capacity
+// exception.
+const big = new Array(1024 * 1024).toString();
+for (; i < 100 + numLargeDocumentsToWrite; ++i) {
+    t.save({a: i, b: i, big: big});
+}
+
+for (; i < 200 + numLargeDocumentsToWrite; ++i) {
+    t.save({a: i, b: i});
+}
+
+assert.throws(function() {
+    t.find().sort({a: -1}).hint({b: 1}).limit(100).itcount();
+});
+assert.throws(function() {
+    t.find().sort({a: -1}).hint({b: 1}).showDiskLoc().limit(100).itcount();
+});
+t.drop();
 })();