// This tests that 2dsphere indices can be ordered arbitrarily, and that the ordering
// 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.
// @tags: [assumes_balancer_off, operations_longer_than_stepdown_interval_in_txns]
(function() {
"use strict";

const coll = db.geo_s2ordering;
coll.drop();

const needle = "hari";

// We insert lots of points in a region and look for a non-geo key which is rare.
function makepoints(needle) {
    const lat = 0;
    const lng = 0;
    const points = 50.0;

    const bulk = coll.initializeUnorderedBulkOp();
    for (let x = -points; x < points; x += 1) {
        for (let y = -points; y < points; y += 1) {
            bulk.insert({
                nongeo: x.toString() + "," + y.toString(),
                geo: {type: "Point", coordinates: [lng + x / points, lat + y / points]}
            });
        }
    }
    bulk.insert({nongeo: needle, geo: {type: "Point", coordinates: [0, 0]}});
    assert.writeOK(bulk.execute());
}

function runTest(index) {
    assert.commandWorked(coll.ensureIndex(index));
    const cursor =
        coll.find({nongeo: needle, geo: {$within: {$centerSphere: [[0, 0], Math.PI / 180.0]}}});
    const stats = cursor.explain("executionStats").executionStats;
    assert.commandWorked(coll.dropIndex(index));
    return stats;
}

makepoints(needle);

// Indexing non-geo first should be quicker.
const fast = runTest({nongeo: 1, geo: "2dsphere"});
const slow = runTest({geo: "2dsphere", nongeo: 1});

// The nReturned should be the same.
assert.eq(fast.nReturned, 1);
assert.eq(slow.nReturned, 1);

// Only one document is examined, since we use the index.
assert.eq(fast.totalDocsExamined, 1);
assert.eq(slow.totalDocsExamined, 1);

// The ordering actually matters for lookup speed.
// totalKeysExamined is a direct measure of its speed.
assert.lt(fast.totalKeysExamined, slow.totalKeysExamined);
}());