summaryrefslogtreecommitdiff
path: root/jstests/core/covered_multikey.js
diff options
context:
space:
mode:
Diffstat (limited to 'jstests/core/covered_multikey.js')
-rw-r--r--jstests/core/covered_multikey.js22
1 files changed, 11 insertions, 11 deletions
diff --git a/jstests/core/covered_multikey.js b/jstests/core/covered_multikey.js
index cb5e97d8dbb..297728545ab 100644
--- a/jstests/core/covered_multikey.js
+++ b/jstests/core/covered_multikey.js
@@ -15,7 +15,7 @@ load("jstests/libs/analyze_plan.js");
let coll = db.covered_multikey;
coll.drop();
-assert.writeOK(coll.insert({a: 1, b: [2, 3, 4]}));
+assert.commandWorked(coll.insert({a: 1, b: [2, 3, 4]}));
assert.commandWorked(coll.createIndex({a: 1, b: 1}));
assert.eq(1, coll.find({a: 1, b: 2}, {_id: 0, a: 1}).itcount());
@@ -25,8 +25,8 @@ assert(isIxscan(db, explainRes.queryPlanner.winningPlan));
assert(!planHasStage(db, explainRes.queryPlanner.winningPlan, "FETCH"));
coll.drop();
-assert.writeOK(coll.insert({a: 1, b: [1, 2, 3], c: 3, d: 5}));
-assert.writeOK(coll.insert({a: [1, 2, 3], b: 1, c: 4, d: 6}));
+assert.commandWorked(coll.insert({a: 1, b: [1, 2, 3], c: 3, d: 5}));
+assert.commandWorked(coll.insert({a: [1, 2, 3], b: 1, c: 4, d: 6}));
assert.commandWorked(coll.createIndex({a: 1, b: 1, c: -1, d: -1}));
let cursor = coll.find({a: 1, b: 1}, {_id: 0, c: 1, d: 1}).sort({c: -1, d: -1});
@@ -41,7 +41,7 @@ assert(!planHasStage(db, explainRes.queryPlanner.winningPlan, "FETCH"));
// Verify that a query cannot be covered over a path which is multikey due to an empty array.
coll.drop();
-assert.writeOK(coll.insert({a: []}));
+assert.commandWorked(coll.insert({a: []}));
assert.commandWorked(coll.createIndex({a: 1}));
assert.eq({a: []}, coll.findOne({a: []}, {_id: 0, a: 1}));
explainRes = coll.explain("queryPlanner").find({a: []}, {_id: 0, a: 1}).finish();
@@ -53,7 +53,7 @@ assert.eq(true, ixscanStage.isMultiKey);
// Verify that a query cannot be covered over a path which is multikey due to a single-element
// array.
coll.drop();
-assert.writeOK(coll.insert({a: [2]}));
+assert.commandWorked(coll.insert({a: [2]}));
assert.commandWorked(coll.createIndex({a: 1}));
assert.eq({a: [2]}, coll.findOne({a: 2}, {_id: 0, a: 1}));
explainRes = coll.explain("queryPlanner").find({a: 2}, {_id: 0, a: 1}).finish();
@@ -65,9 +65,9 @@ assert.eq(true, ixscanStage.isMultiKey);
// Verify that a query cannot be covered over a path which is multikey due to a single-element
// array, where the path is made multikey by an update rather than an insert.
coll.drop();
-assert.writeOK(coll.insert({a: 2}));
+assert.commandWorked(coll.insert({a: 2}));
assert.commandWorked(coll.createIndex({a: 1}));
-assert.writeOK(coll.update({}, {$set: {a: [2]}}));
+assert.commandWorked(coll.update({}, {$set: {a: [2]}}));
assert.eq({a: [2]}, coll.findOne({a: 2}, {_id: 0, a: 1}));
explainRes = coll.explain("queryPlanner").find({a: 2}, {_id: 0, a: 1}).finish();
assert(planHasStage(db, explainRes.queryPlanner.winningPlan, "IXSCAN"));
@@ -78,12 +78,12 @@ assert.eq(true, ixscanStage.isMultiKey);
// Verify that a trailing empty array makes a 2dsphere index multikey.
coll.drop();
assert.commandWorked(coll.createIndex({"a.b": 1, c: "2dsphere"}));
-assert.writeOK(coll.insert({a: {b: 1}, c: {type: "Point", coordinates: [0, 0]}}));
+assert.commandWorked(coll.insert({a: {b: 1}, c: {type: "Point", coordinates: [0, 0]}}));
explainRes = coll.explain().find().hint({"a.b": 1, c: "2dsphere"}).finish();
ixscanStage = getPlanStage(explainRes.queryPlanner.winningPlan, "IXSCAN");
assert.neq(null, ixscanStage);
assert.eq(false, ixscanStage.isMultiKey);
-assert.writeOK(coll.insert({a: {b: []}, c: {type: "Point", coordinates: [0, 0]}}));
+assert.commandWorked(coll.insert({a: {b: []}, c: {type: "Point", coordinates: [0, 0]}}));
explainRes = coll.explain().find().hint({"a.b": 1, c: "2dsphere"}).finish();
ixscanStage = getPlanStage(explainRes.queryPlanner.winningPlan, "IXSCAN");
assert.neq(null, ixscanStage);
@@ -92,7 +92,7 @@ assert.eq(true, ixscanStage.isMultiKey);
// Verify that a mid-path empty array makes a 2dsphere index multikey.
coll.drop();
assert.commandWorked(coll.createIndex({"a.b": 1, c: "2dsphere"}));
-assert.writeOK(coll.insert({a: [], c: {type: "Point", coordinates: [0, 0]}}));
+assert.commandWorked(coll.insert({a: [], c: {type: "Point", coordinates: [0, 0]}}));
explainRes = coll.explain().find().hint({"a.b": 1, c: "2dsphere"}).finish();
ixscanStage = getPlanStage(explainRes.queryPlanner.winningPlan, "IXSCAN");
assert.neq(null, ixscanStage);
@@ -101,7 +101,7 @@ assert.eq(true, ixscanStage.isMultiKey);
// Verify that a single-element array makes a 2dsphere index multikey.
coll.drop();
assert.commandWorked(coll.createIndex({"a.b": 1, c: "2dsphere"}));
-assert.writeOK(coll.insert({a: {b: [3]}, c: {type: "Point", coordinates: [0, 0]}}));
+assert.commandWorked(coll.insert({a: {b: [3]}, c: {type: "Point", coordinates: [0, 0]}}));
explainRes = coll.explain().find().hint({"a.b": 1, c: "2dsphere"}).finish();
ixscanStage = getPlanStage(explainRes.queryPlanner.winningPlan, "IXSCAN");
assert.neq(null, ixscanStage);