diff options
Diffstat (limited to 'src/mongo/db/storage/sorted_data_interface_test_insert.cpp')
-rw-r--r-- | src/mongo/db/storage/sorted_data_interface_test_insert.cpp | 338 |
1 files changed, 338 insertions, 0 deletions
diff --git a/src/mongo/db/storage/sorted_data_interface_test_insert.cpp b/src/mongo/db/storage/sorted_data_interface_test_insert.cpp new file mode 100644 index 00000000000..3813c46eb1d --- /dev/null +++ b/src/mongo/db/storage/sorted_data_interface_test_insert.cpp @@ -0,0 +1,338 @@ +// sorted_data_interface_test_insert.cpp + +/** + * Copyright (C) 2014 MongoDB Inc. + * + * This program is free software: you can redistribute it and/or modify + * it under the terms of the GNU Affero General Public License, version 3, + * as published by the Free Software Foundation. + * + * 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 + * GNU Affero General Public License for more details. + * + * You should have received a copy of the GNU Affero General Public License + * along with this program. If not, see <http://www.gnu.org/licenses/>. + * + * 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 GNU Affero General 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 "mongo/db/storage/sorted_data_interface.h" +#include "mongo/unittest/unittest.h" + +namespace mongo { + + // Insert a key and verify that the number of entries in the index equals 1. + TEST( SortedDataInterface, Insert ) { + scoped_ptr<HarnessHelper> harnessHelper( newHarnessHelper() ); + scoped_ptr<SortedDataInterface> sorted( harnessHelper->newSortedDataInterface() ); + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + ASSERT( sorted->isEmpty( opCtx.get() ) ); + } + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + { + WriteUnitOfWork uow( opCtx.get() ); + ASSERT_OK( sorted->insert( opCtx.get(), key1, loc1, false ) ); + uow.commit(); + } + } + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + ASSERT_EQUALS( 1, sorted->numEntries( opCtx.get() ) ); + } + } + + // Insert a compound key and verify that the number of entries in the index equals 1. + TEST( SortedDataInterface, InsertCompoundKey ) { + scoped_ptr<HarnessHelper> harnessHelper( newHarnessHelper() ); + scoped_ptr<SortedDataInterface> sorted( harnessHelper->newSortedDataInterface() ); + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + ASSERT( sorted->isEmpty( opCtx.get() ) ); + } + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + { + WriteUnitOfWork uow( opCtx.get() ); + ASSERT_OK( sorted->insert( opCtx.get(), compoundKey1a, loc1, false ) ); + uow.commit(); + } + } + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + ASSERT_EQUALS( 1, sorted->numEntries( opCtx.get() ) ); + } + } + + // Insert multiple, distinct keys at the same DiskLoc and verify that the + // number of entries in the index equals the number that were inserted, even + // when duplicates are not allowed. + TEST( SortedDataInterface, InsertSameDiskLoc ) { + scoped_ptr<HarnessHelper> harnessHelper( newHarnessHelper() ); + scoped_ptr<SortedDataInterface> sorted( harnessHelper->newSortedDataInterface() ); + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + ASSERT( sorted->isEmpty( opCtx.get() ) ); + } + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + { + WriteUnitOfWork uow( opCtx.get() ); + ASSERT_OK( sorted->insert( opCtx.get(), key1, loc1, false ) ); + ASSERT_OK( sorted->insert( opCtx.get(), key2, loc1, false ) ); + uow.commit(); + } + } + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + ASSERT_EQUALS( 2, sorted->numEntries( opCtx.get() ) ); + } + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + { + WriteUnitOfWork uow( opCtx.get() ); + ASSERT_OK( sorted->insert( opCtx.get(), key3, loc1, false ) ); + uow.commit(); + } + } + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + ASSERT_EQUALS( 3, sorted->numEntries( opCtx.get() ) ); + } + } + + // Insert multiple, distinct keys at the same DiskLoc and verify that the + // number of entries in the index equals the number that were inserted, even + // when duplicates are allowed. + TEST( SortedDataInterface, InsertSameDiskLocWithDupsAllowed ) { + scoped_ptr<HarnessHelper> harnessHelper( newHarnessHelper() ); + scoped_ptr<SortedDataInterface> sorted( harnessHelper->newSortedDataInterface() ); + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + ASSERT( sorted->isEmpty( opCtx.get() ) ); + } + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + { + WriteUnitOfWork uow( opCtx.get() ); + ASSERT_OK( sorted->insert( opCtx.get(), key1, loc1, false ) ); + ASSERT_OK( sorted->insert( opCtx.get(), key2, loc1, true /* allow duplicates */ ) ); + uow.commit(); + } + } + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + ASSERT_EQUALS( 2, sorted->numEntries( opCtx.get() ) ); + } + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + { + WriteUnitOfWork uow( opCtx.get() ); + ASSERT_OK( sorted->insert( opCtx.get(), key3, loc1, true /* allow duplicates */ ) ); + uow.commit(); + } + } + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + ASSERT_EQUALS( 3, sorted->numEntries( opCtx.get() ) ); + } + } + + // Insert the same key multiple times and verify that only 1 entry exists + // in the index when duplicates are not allowed. + TEST( SortedDataInterface, InsertSameKey ) { + scoped_ptr<HarnessHelper> harnessHelper( newHarnessHelper() ); + scoped_ptr<SortedDataInterface> sorted( harnessHelper->newSortedDataInterface() ); + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + ASSERT( sorted->isEmpty( opCtx.get() ) ); + } + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + { + WriteUnitOfWork uow( opCtx.get() ); + ASSERT_OK( sorted->insert( opCtx.get(), key1, loc1, false ) ); + ASSERT_NOT_OK( sorted->insert( opCtx.get(), key1, loc2, false ) ); + uow.commit(); + } + } + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + ASSERT_EQUALS( 1, sorted->numEntries( opCtx.get() ) ); + } + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + { + WriteUnitOfWork uow( opCtx.get() ); + ASSERT_NOT_OK( sorted->insert( opCtx.get(), key1, loc2, false ) ); + uow.commit(); + } + } + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + ASSERT_EQUALS( 1, sorted->numEntries( opCtx.get() ) ); + } + } + + // Insert the same key multiple times and verify that all entries exists + // in the index when duplicates are allowed. + TEST( SortedDataInterface, InsertSameKeyWithDupsAllowed ) { + scoped_ptr<HarnessHelper> harnessHelper( newHarnessHelper() ); + scoped_ptr<SortedDataInterface> sorted( harnessHelper->newSortedDataInterface() ); + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + ASSERT( sorted->isEmpty( opCtx.get() ) ); + } + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + { + WriteUnitOfWork uow( opCtx.get() ); + ASSERT_OK( sorted->insert( opCtx.get(), key1, loc1, false ) ); + ASSERT_OK( sorted->insert( opCtx.get(), key1, loc2, true /* allow duplicates */ ) ); + uow.commit(); + } + } + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + ASSERT_EQUALS( 2, sorted->numEntries( opCtx.get() ) ); + } + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + { + WriteUnitOfWork uow( opCtx.get() ); + ASSERT_OK( sorted->insert( opCtx.get(), key1, loc3, true /* allow duplicates */ ) ); + uow.commit(); + } + } + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + ASSERT_EQUALS( 3, sorted->numEntries( opCtx.get() ) ); + } + } + + // Insert multiple keys and verify that the number of entries + // in the index equals the number that were inserted. + TEST( SortedDataInterface, InsertMultiple ) { + scoped_ptr<HarnessHelper> harnessHelper( newHarnessHelper() ); + scoped_ptr<SortedDataInterface> sorted( harnessHelper->newSortedDataInterface() ); + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + ASSERT( sorted->isEmpty( opCtx.get() ) ); + } + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + { + WriteUnitOfWork uow( opCtx.get() ); + ASSERT_OK( sorted->insert( opCtx.get(), key1, loc1, false ) ); + ASSERT_OK( sorted->insert( opCtx.get(), key2, loc2, false ) ); + uow.commit(); + } + } + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + ASSERT_EQUALS( 2, sorted->numEntries( opCtx.get() ) ); + } + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + { + WriteUnitOfWork uow( opCtx.get() ); + ASSERT_OK( sorted->insert( opCtx.get(), key3, loc3, false ) ); + uow.commit(); + } + } + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + ASSERT_EQUALS( 3, sorted->numEntries( opCtx.get() ) ); + } + } + + // Insert multiple compound keys and verify that the number of entries + // in the index equals the number that were inserted. + TEST( SortedDataInterface, InsertMultipleCompoundKeys ) { + scoped_ptr<HarnessHelper> harnessHelper( newHarnessHelper() ); + scoped_ptr<SortedDataInterface> sorted( harnessHelper->newSortedDataInterface() ); + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + ASSERT( sorted->isEmpty( opCtx.get() ) ); + } + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + { + WriteUnitOfWork uow( opCtx.get() ); + ASSERT_OK( sorted->insert( opCtx.get(), compoundKey1a, loc1, false ) ); + ASSERT_OK( sorted->insert( opCtx.get(), compoundKey1b, loc2, false ) ); + ASSERT_OK( sorted->insert( opCtx.get(), compoundKey2b, loc3, false ) ); + uow.commit(); + } + } + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + ASSERT_EQUALS( 3, sorted->numEntries( opCtx.get() ) ); + } + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + { + WriteUnitOfWork uow( opCtx.get() ); + ASSERT_OK( sorted->insert( opCtx.get(), compoundKey1c, loc4, false ) ); + ASSERT_OK( sorted->insert( opCtx.get(), compoundKey3a, loc5, false ) ); + uow.commit(); + } + } + + { + scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() ); + ASSERT_EQUALS( 5, sorted->numEntries( opCtx.get() ) ); + } + } + +} // namespace mongo |