/** * Copyright (C) 2018-present MongoDB, Inc. * * This program is free software: you can redistribute it and/or modify * it under the terms of the Server Side Public License, version 1, * as published by MongoDB, Inc. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * Server Side Public License for more details. * * You should have received a copy of the Server Side Public License * along with this program. If not, see * . * * As a special exception, the copyright holders give permission to link the * code of portions of this program with the OpenSSL library under certain * conditions as described in each individual source file and distribute * linked combinations including the program with the OpenSSL library. You * must comply with the Server Side Public License in all respects for * all of the code used other than as permitted herein. If you modify file(s) * with this exception, you may extend this exception to your version of the * file(s), but you are not obligated to do so. If you do not wish to do so, * delete this exception statement from your version. If you delete this * exception statement from all source files in the program, then also delete * it in the license file. */ #include "mongo/db/storage/sorted_data_interface_test_harness.h" #include #include #include "mongo/db/storage/sorted_data_interface.h" #include "mongo/unittest/unittest.h" auto mongo::SortedDataInterfaceHarnessHelper::newSortedDataInterface( bool unique, bool partial, std::initializer_list toInsert) -> std::unique_ptr { invariant(std::is_sorted( toInsert.begin(), toInsert.end(), IndexEntryComparison(Ordering::make(BSONObj())))); auto index = newSortedDataInterface(unique, partial); insertToIndex(this, index.get(), toInsert); return index; } void mongo::insertToIndex(OperationContext* opCtx, SortedDataInterface* index, std::initializer_list toInsert) { WriteUnitOfWork wuow(opCtx); for (auto&& entry : toInsert) { ASSERT_OK(index->insert(opCtx, makeKeyString(index, entry.key, entry.loc), true)); } wuow.commit(); } void mongo::removeFromIndex(OperationContext* opCtx, SortedDataInterface* index, std::initializer_list toRemove) { WriteUnitOfWork wuow(opCtx); for (auto&& entry : toRemove) { index->unindex(opCtx, makeKeyString(index, entry.key, entry.loc), true); } wuow.commit(); } mongo::KeyString::Value mongo::makeKeyString(SortedDataInterface* sorted, BSONObj bsonKey, boost::optional rid) { KeyString::Builder builder(sorted->getKeyStringVersion(), bsonKey, sorted->getOrdering()); if (rid) { builder.appendRecordId(*rid); } return builder.getValueCopy(); } mongo::KeyString::Value mongo::makeKeyStringForSeek(SortedDataInterface* sorted, BSONObj bsonKey, bool isForward, bool inclusive) { BSONObj finalKey = BSONObj::stripFieldNames(bsonKey); KeyString::Builder builder(sorted->getKeyStringVersion(), finalKey, sorted->getOrdering(), isForward == inclusive ? KeyString::Discriminator::kExclusiveBefore : KeyString::Discriminator::kExclusiveAfter); return builder.getValueCopy(); } namespace mongo { namespace { std::function()> sortedDataInterfaceHarnessFactory; } void registerSortedDataInterfaceHarnessHelperFactory( std::function()> factory) { sortedDataInterfaceHarnessFactory = std::move(factory); } auto newSortedDataInterfaceHarnessHelper() -> std::unique_ptr { return sortedDataInterfaceHarnessFactory(); } namespace { TEST(SortedDataInterface, InsertWithDups1) { const auto harnessHelper(newSortedDataInterfaceHarnessHelper()); const std::unique_ptr sorted( harnessHelper->newSortedDataInterface(/*unique=*/false, /*partial=*/false)); { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); { WriteUnitOfWork uow(opCtx.get()); ASSERT_OK(sorted->insert( opCtx.get(), makeKeyString(sorted.get(), BSON("" << 1), RecordId(5, 2)), true)); uow.commit(); } } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); { WriteUnitOfWork uow(opCtx.get()); ASSERT_OK(sorted->insert( opCtx.get(), makeKeyString(sorted.get(), BSON("" << 1), RecordId(6, 2)), true)); uow.commit(); } } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); ASSERT_EQUALS(2, sorted->numEntries(opCtx.get())); long long x = 0; sorted->fullValidate(opCtx.get(), &x, nullptr); ASSERT_EQUALS(2, x); } } TEST(SortedDataInterface, InsertWithDups2) { const auto harnessHelper(newSortedDataInterfaceHarnessHelper()); const std::unique_ptr sorted( harnessHelper->newSortedDataInterface(/*unique=*/false, /*partial=*/false)); { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); { WriteUnitOfWork uow(opCtx.get()); ASSERT_OK(sorted->insert( opCtx.get(), makeKeyString(sorted.get(), BSON("" << 1), RecordId(5, 18)), true)); uow.commit(); } } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); { WriteUnitOfWork uow(opCtx.get()); ASSERT_OK(sorted->insert( opCtx.get(), makeKeyString(sorted.get(), BSON("" << 1), RecordId(5, 20)), true)); uow.commit(); } } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); ASSERT_EQUALS(2, sorted->numEntries(opCtx.get())); } } TEST(SortedDataInterface, InsertWithDups3AndRollback) { const auto harnessHelper(newSortedDataInterfaceHarnessHelper()); const std::unique_ptr sorted( harnessHelper->newSortedDataInterface(/*unique=*/false, /*partial=*/false)); { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); { WriteUnitOfWork uow(opCtx.get()); ASSERT_OK(sorted->insert( opCtx.get(), makeKeyString(sorted.get(), BSON("" << 1), RecordId(5, 18)), true)); uow.commit(); } } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); { WriteUnitOfWork uow(opCtx.get()); ASSERT_OK(sorted->insert( opCtx.get(), makeKeyString(sorted.get(), BSON("" << 1), RecordId(5, 20)), true)); // no commit } } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); ASSERT_EQUALS(1, sorted->numEntries(opCtx.get())); } } TEST(SortedDataInterface, InsertNoDups1) { const auto harnessHelper(newSortedDataInterfaceHarnessHelper()); const std::unique_ptr sorted( harnessHelper->newSortedDataInterface(/*unique=*/true, /*partial=*/false)); { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); { WriteUnitOfWork uow(opCtx.get()); ASSERT_OK(sorted->insert( opCtx.get(), makeKeyString(sorted.get(), BSON("" << 1), RecordId(5, 18)), false)); uow.commit(); } } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); { WriteUnitOfWork uow(opCtx.get()); ASSERT_OK(sorted->insert( opCtx.get(), makeKeyString(sorted.get(), BSON("" << 2), RecordId(5, 20)), false)); uow.commit(); } } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); ASSERT_EQUALS(2, sorted->numEntries(opCtx.get())); } } TEST(SortedDataInterface, InsertNoDups2) { const auto harnessHelper(newSortedDataInterfaceHarnessHelper()); const std::unique_ptr sorted( harnessHelper->newSortedDataInterface(/*unique=*/true, /*partial=*/false)); { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); { WriteUnitOfWork uow(opCtx.get()); ASSERT_OK(sorted->insert( opCtx.get(), makeKeyString(sorted.get(), BSON("" << 1), RecordId(5, 2)), false)); uow.commit(); } } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); { WriteUnitOfWork uow(opCtx.get()); ASSERT_NOT_OK(sorted->insert( opCtx.get(), makeKeyString(sorted.get(), BSON("" << 1), RecordId(5, 4)), false)); uow.commit(); } } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); ASSERT_EQUALS(1, sorted->numEntries(opCtx.get())); } } TEST(SortedDataInterface, InsertNoDups3) { const auto harnessHelper(newSortedDataInterfaceHarnessHelper()); const std::unique_ptr sorted( harnessHelper->newSortedDataInterface(/*unique=*/false, /*partial=*/false)); { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); { WriteUnitOfWork uow(opCtx.get()); ASSERT_OK(sorted->insert( opCtx.get(), makeKeyString(sorted.get(), BSON("" << 1), RecordId(5, 2)), false)); uow.commit(); } } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); { WriteUnitOfWork uow(opCtx.get()); ASSERT_NOT_OK(sorted->insert( opCtx.get(), makeKeyString(sorted.get(), BSON("" << 1), RecordId(5, 4)), false)); uow.commit(); } } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); ASSERT_EQUALS(1, sorted->numEntries(opCtx.get())); } } TEST(SortedDataInterface, Unindex1) { const auto harnessHelper(newSortedDataInterfaceHarnessHelper()); const std::unique_ptr sorted( harnessHelper->newSortedDataInterface(/*unique=*/false, /*partial=*/false)); { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); { WriteUnitOfWork uow(opCtx.get()); ASSERT_OK(sorted->insert( opCtx.get(), makeKeyString(sorted.get(), BSON("" << 1), RecordId(5, 18)), true)); uow.commit(); } } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); ASSERT_EQUALS(1, sorted->numEntries(opCtx.get())); } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); { WriteUnitOfWork uow(opCtx.get()); sorted->unindex( opCtx.get(), makeKeyString(sorted.get(), BSON("" << 1), RecordId(5, 20)), true); ASSERT_EQUALS(1, sorted->numEntries(opCtx.get())); uow.commit(); } } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); ASSERT_EQUALS(1, sorted->numEntries(opCtx.get())); } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); { WriteUnitOfWork uow(opCtx.get()); sorted->unindex( opCtx.get(), makeKeyString(sorted.get(), BSON("" << 2), RecordId(5, 18)), true); ASSERT_EQUALS(1, sorted->numEntries(opCtx.get())); uow.commit(); } } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); ASSERT_EQUALS(1, sorted->numEntries(opCtx.get())); } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); { WriteUnitOfWork uow(opCtx.get()); sorted->unindex( opCtx.get(), makeKeyString(sorted.get(), BSON("" << 1), RecordId(5, 18)), true); ASSERT(sorted->isEmpty(opCtx.get())); uow.commit(); } } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); ASSERT(sorted->isEmpty(opCtx.get())); } } TEST(SortedDataInterface, Unindex2Rollback) { const auto harnessHelper(newSortedDataInterfaceHarnessHelper()); const std::unique_ptr sorted( harnessHelper->newSortedDataInterface(/*unique=*/false, /*partial=*/false)); { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); { WriteUnitOfWork uow(opCtx.get()); ASSERT_OK(sorted->insert( opCtx.get(), makeKeyString(sorted.get(), BSON("" << 1), RecordId(5, 18)), true)); uow.commit(); } } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); ASSERT_EQUALS(1, sorted->numEntries(opCtx.get())); } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); { WriteUnitOfWork uow(opCtx.get()); sorted->unindex( opCtx.get(), makeKeyString(sorted.get(), BSON("" << 1), RecordId(5, 18)), true); ASSERT(sorted->isEmpty(opCtx.get())); // no commit } } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); ASSERT_EQUALS(1, sorted->numEntries(opCtx.get())); } } TEST(SortedDataInterface, CursorIterate1) { const auto harnessHelper(newSortedDataInterfaceHarnessHelper()); const std::unique_ptr sorted( harnessHelper->newSortedDataInterface(/*unique=*/false, /*partial=*/false)); int N = 5; for (int i = 0; i < N; i++) { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); { WriteUnitOfWork uow(opCtx.get()); ASSERT_OK(sorted->insert( opCtx.get(), makeKeyString(sorted.get(), BSON("" << i), RecordId(5, i * 2)), true)); uow.commit(); } } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); const std::unique_ptr cursor(sorted->newCursor(opCtx.get())); int n = 0; for (auto entry = cursor->seek(makeKeyStringForSeek(sorted.get(), BSONObj(), true, true)); entry; entry = cursor->next()) { ASSERT_EQ(entry, IndexKeyEntry(BSON("" << n), RecordId(5, n * 2))); n++; } ASSERT_EQUALS(N, n); } } TEST(SortedDataInterface, CursorIterate1WithSaveRestore) { const auto harnessHelper(newSortedDataInterfaceHarnessHelper()); const std::unique_ptr sorted( harnessHelper->newSortedDataInterface(/*unique=*/false, /*partial=*/false)); int N = 5; for (int i = 0; i < N; i++) { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); { WriteUnitOfWork uow(opCtx.get()); ASSERT_OK(sorted->insert( opCtx.get(), makeKeyString(sorted.get(), BSON("" << i), RecordId(5, i * 2)), true)); uow.commit(); } } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); const std::unique_ptr cursor(sorted->newCursor(opCtx.get())); int n = 0; for (auto entry = cursor->seek(makeKeyStringForSeek(sorted.get(), BSONObj(), true, true)); entry; entry = cursor->next()) { ASSERT_EQ(entry, IndexKeyEntry(BSON("" << n), RecordId(5, n * 2))); n++; cursor->save(); cursor->restore(); } ASSERT_EQUALS(N, n); } } TEST(SortedDataInterface, CursorIterateAllDupKeysWithSaveRestore) { const auto harnessHelper(newSortedDataInterfaceHarnessHelper()); const std::unique_ptr sorted( harnessHelper->newSortedDataInterface(/*unique=*/false, /*partial=*/false)); int N = 5; for (int i = 0; i < N; i++) { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); { WriteUnitOfWork uow(opCtx.get()); ASSERT_OK(sorted->insert( opCtx.get(), makeKeyString(sorted.get(), BSON("" << 5), RecordId(5, i * 2)), true)); uow.commit(); } } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); const std::unique_ptr cursor(sorted->newCursor(opCtx.get())); int n = 0; for (auto entry = cursor->seek(makeKeyStringForSeek(sorted.get(), BSONObj(), true, true)); entry; entry = cursor->next()) { ASSERT_EQ(entry, IndexKeyEntry(BSON("" << 5), RecordId(5, n * 2))); n++; cursor->save(); cursor->restore(); } ASSERT_EQUALS(N, n); } } TEST(SortedDataInterface, Locate1) { const auto harnessHelper(newSortedDataInterfaceHarnessHelper()); const std::unique_ptr sorted( harnessHelper->newSortedDataInterface(/*unique=*/false, /*partial=*/false)); BSONObj key = BSON("" << 1); RecordId loc(5, 16); { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); const std::unique_ptr cursor(sorted->newCursor(opCtx.get())); ASSERT(!cursor->seek(makeKeyStringForSeek(sorted.get(), key, true, true))); } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); { WriteUnitOfWork uow(opCtx.get()); ASSERT_OK(sorted->insert(opCtx.get(), makeKeyString(sorted.get(), key, loc), true)); uow.commit(); } } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); const std::unique_ptr cursor(sorted->newCursor(opCtx.get())); ASSERT_EQ(cursor->seek(makeKeyStringForSeek(sorted.get(), key, true, true)), IndexKeyEntry(key, loc)); } } TEST(SortedDataInterface, Locate2) { const auto harnessHelper(newSortedDataInterfaceHarnessHelper()); const std::unique_ptr sorted( harnessHelper->newSortedDataInterface(/*unique=*/false, /*partial=*/false)); { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); { WriteUnitOfWork uow(opCtx.get()); ASSERT_OK(sorted->insert( opCtx.get(), makeKeyString(sorted.get(), BSON("" << 1), RecordId(1, 2)), true)); ASSERT_OK(sorted->insert( opCtx.get(), makeKeyString(sorted.get(), BSON("" << 2), RecordId(1, 4)), true)); ASSERT_OK(sorted->insert( opCtx.get(), makeKeyString(sorted.get(), BSON("" << 3), RecordId(1, 6)), true)); uow.commit(); } } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); const std::unique_ptr cursor(sorted->newCursor(opCtx.get())); ASSERT_EQ(cursor->seek(makeKeyStringForSeek(sorted.get(), BSON("a" << 2), true, true)), IndexKeyEntry(BSON("" << 2), RecordId(1, 4))); ASSERT_EQ(cursor->next(), IndexKeyEntry(BSON("" << 3), RecordId(1, 6))); ASSERT_EQ(cursor->next(), boost::none); } } TEST(SortedDataInterface, Locate2Empty) { const auto harnessHelper(newSortedDataInterfaceHarnessHelper()); const std::unique_ptr sorted( harnessHelper->newSortedDataInterface(/*unique=*/false, /*partial=*/false)); { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); { WriteUnitOfWork uow(opCtx.get()); ASSERT_OK(sorted->insert( opCtx.get(), makeKeyString(sorted.get(), BSON("" << 1), RecordId(1, 2)), true)); ASSERT_OK(sorted->insert( opCtx.get(), makeKeyString(sorted.get(), BSON("" << 2), RecordId(1, 4)), true)); ASSERT_OK(sorted->insert( opCtx.get(), makeKeyString(sorted.get(), BSON("" << 3), RecordId(1, 6)), true)); uow.commit(); } } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); const std::unique_ptr cursor(sorted->newCursor(opCtx.get())); ASSERT_EQ(cursor->seek(makeKeyStringForSeek(sorted.get(), BSONObj(), true, true)), IndexKeyEntry(BSON("" << 1), RecordId(1, 2))); } { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); const std::unique_ptr cursor( sorted->newCursor(opCtx.get(), false)); ASSERT_EQ(cursor->seek(makeKeyStringForSeek(sorted.get(), BSONObj(), false, false)), boost::none); } } TEST(SortedDataInterface, Locate3Descending) { const auto harnessHelper(newSortedDataInterfaceHarnessHelper()); const std::unique_ptr sorted( harnessHelper->newSortedDataInterface(/*unique=*/false, /*partial=*/false)); auto buildEntry = [](int i) { return IndexKeyEntry(BSON("" << i), RecordId(1, i * 2)); }; { const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); for (int i = 0; i < 10; i++) { if (i == 6) continue; WriteUnitOfWork uow(opCtx.get()); auto entry = buildEntry(i); ASSERT_OK(sorted->insert( opCtx.get(), makeKeyString(sorted.get(), entry.key, entry.loc), true)); uow.commit(); } } const ServiceContext::UniqueOperationContext opCtx(harnessHelper->newOperationContext()); std::unique_ptr cursor(sorted->newCursor(opCtx.get(), true)); ASSERT_EQ(cursor->seek(makeKeyStringForSeek(sorted.get(), BSON("" << 5), true, true)), buildEntry(5)); ASSERT_EQ(cursor->next(), buildEntry(7)); cursor = sorted->newCursor(opCtx.get(), /*forward*/ false); ASSERT_EQ( cursor->seek(makeKeyStringForSeek(sorted.get(), BSON("" << 5), false, /*inclusive*/ false)), buildEntry(4)); cursor = sorted->newCursor(opCtx.get(), /*forward*/ false); ASSERT_EQ( cursor->seek(makeKeyStringForSeek(sorted.get(), BSON("" << 5), false, /*inclusive*/ true)), buildEntry(5)); ASSERT_EQ(cursor->next(), buildEntry(4)); cursor = sorted->newCursor(opCtx.get(), /*forward*/ false); ASSERT_EQ( cursor->seek(makeKeyStringForSeek(sorted.get(), BSON("" << 5), false, /*inclusive*/ false)), buildEntry(4)); ASSERT_EQ(cursor->next(), buildEntry(3)); cursor = sorted->newCursor(opCtx.get(), /*forward*/ false); ASSERT_EQ( cursor->seek(makeKeyStringForSeek(sorted.get(), BSON("" << 6), false, /*inclusive*/ true)), buildEntry(5)); ASSERT_EQ(cursor->next(), buildEntry(4)); cursor = sorted->newCursor(opCtx.get(), /*forward*/ false); ASSERT_EQ(cursor->seek( makeKeyStringForSeek(sorted.get(), BSON("" << 500), false, /*inclusive*/ true)), buildEntry(9)); ASSERT_EQ(cursor->next(), buildEntry(8)); } TEST(SortedDataInterface, Locate4) { const auto harnessHelper = newSortedDataInterfaceHarnessHelper(); auto sorted = harnessHelper->newSortedDataInterface(/*unique=*/false, /*partial=*/false, { {BSON("" << 1), RecordId(1, 2)}, {BSON("" << 1), RecordId(1, 4)}, {BSON("" << 1), RecordId(1, 6)}, {BSON("" << 2), RecordId(1, 8)}, }); { auto opCtx = harnessHelper->newOperationContext(); auto cursor = sorted->newCursor(opCtx.get()); ASSERT_EQ(cursor->seek(makeKeyStringForSeek(sorted.get(), BSON("a" << 1), true, true)), IndexKeyEntry(BSON("" << 1), RecordId(1, 2))); ASSERT_EQ(cursor->next(), IndexKeyEntry(BSON("" << 1), RecordId(1, 4))); ASSERT_EQ(cursor->next(), IndexKeyEntry(BSON("" << 1), RecordId(1, 6))); ASSERT_EQ(cursor->next(), IndexKeyEntry(BSON("" << 2), RecordId(1, 8))); ASSERT_EQ(cursor->next(), boost::none); } { auto opCtx = harnessHelper->newOperationContext(); auto cursor = sorted->newCursor(opCtx.get(), false); ASSERT_EQ(cursor->seek(makeKeyStringForSeek(sorted.get(), BSON("a" << 1), false, true)), IndexKeyEntry(BSON("" << 1), RecordId(1, 6))); ASSERT_EQ(cursor->next(), IndexKeyEntry(BSON("" << 1), RecordId(1, 4))); ASSERT_EQ(cursor->next(), IndexKeyEntry(BSON("" << 1), RecordId(1, 2))); ASSERT_EQ(cursor->next(), boost::none); } } } // namespace } // namespace mongo