SERVER-13635 Added tests for SortedDataInterface.

Expand set of generic SortedDataInterface tests.
Includes tests for the following functions:
  - SortedDataInterface::dupKeyCheck
  - SortedDataInterface::fullValidate
  - SortedDataInterface::getSpaceUsedBytes
  - SortedDataInterface::insert
  - SortedDataInterface::touch
  - SortedDataInterface::unindex
  - SortedDataInterface::Cursor::getDirection
  - SortedDataInterface::Cursor::isEOF
  - SortedDataInterface::Cursor::pointsToSamePlaceAs

Add tests for SortedDataInterface::Cursor::locate.

Add save/restore position tests.
Includes tests for the following functions:
  - SortedDataInterface::Cursor::restorePosition
  - SortedDataInterface::Cursor::savePosition

Add tests for SortedDataInterface::Cursor::advanceTo.
Only tests single-key indices, not those with compound keys.

Closes #804

Signed-off-by: Benety Goh <benety@mongodb.com>

1 files changed, 200 insertions, 0 deletions

diff --git a/src/mongo/db/storage/sorted_data_interface_test_cursor.cpp b/src/mongo/db/storage/sorted_data_interface_test_cursor.cpp
new file mode 100644
index 00000000000..3a22f66099a
--- /dev/null
+++ b/src/mongo/db/storage/sorted_data_interface_test_cursor.cpp
@@ -0,0 +1,200 @@
+// sorted_data_interface_test_cursor.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 {
+
+    // Call getDirection() on a forward cursor and verify the result equals +1.
+    TEST( SortedDataInterface, GetCursorDirection ) {
+        scoped_ptr<HarnessHelper> harnessHelper( newHarnessHelper() );
+        scoped_ptr<SortedDataInterface> sorted( harnessHelper->newSortedDataInterface() );
+
+        {
+            scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() );
+            scoped_ptr<SortedDataInterface::Cursor> cursor( sorted->newCursor( opCtx.get(), 1 ) );
+            ASSERT_EQUALS( 1, cursor->getDirection() );
+        }
+    }
+
+    // Call getDirection() on a reverse cursor and verify the result equals -1.
+    TEST( SortedDataInterface, GetCursorDirectionReversed ) {
+        scoped_ptr<HarnessHelper> harnessHelper( newHarnessHelper() );
+        scoped_ptr<SortedDataInterface> sorted( harnessHelper->newSortedDataInterface() );
+
+        {
+            scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() );
+            scoped_ptr<SortedDataInterface::Cursor> cursor( sorted->newCursor( opCtx.get(), -1 ) );
+            ASSERT_EQUALS( -1, cursor->getDirection() );
+        }
+    }
+
+    // Verify that a forward cursor is positioned at EOF when the index is empty.
+    TEST( SortedDataInterface, CursorIsEOFWhenEmpty ) {
+        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() );
+            scoped_ptr<SortedDataInterface::Cursor> cursor( sorted->newCursor( opCtx.get(), 1 ) );
+
+            ASSERT( !cursor->locate( minKey, minDiskLoc ) );
+            ASSERT( cursor->isEOF() );
+
+            // Cursor at EOF should remain at EOF when advanced
+            cursor->advance();
+            ASSERT( cursor->isEOF() );
+        }
+    }
+
+    // Verify that a reverse cursor is positioned at EOF when the index is empty.
+    TEST( SortedDataInterface, CursorIsEOFWhenEmptyReversed ) {
+        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() );
+            scoped_ptr<SortedDataInterface::Cursor> cursor( sorted->newCursor( opCtx.get(), -1 ) );
+
+            ASSERT( !cursor->locate( maxKey, maxDiskLoc ) );
+            ASSERT( cursor->isEOF() );
+
+            // Cursor at EOF should remain at EOF when advanced
+            cursor->advance();
+            ASSERT( cursor->isEOF() );
+        }
+    }
+
+    // Call advance() on a forward cursor until it is exhausted.
+    // When a cursor positioned at EOF is advanced, it stays at EOF.
+    TEST( SortedDataInterface, ExhaustCursor ) {
+        scoped_ptr<HarnessHelper> harnessHelper( newHarnessHelper() );
+        scoped_ptr<SortedDataInterface> sorted( harnessHelper->newSortedDataInterface() );
+
+        {
+            scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() );
+            ASSERT( sorted->isEmpty( opCtx.get() ) );
+        }
+
+        int nToInsert = 10;
+        for ( int i = 0; i < nToInsert; i++ ) {
+            scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() );
+            {
+                WriteUnitOfWork uow( opCtx.get() );
+                BSONObj key = BSON( "" << i );
+                DiskLoc loc( 42, i * 2 );
+                ASSERT_OK( sorted->insert( opCtx.get(), key, loc, false ) );
+                uow.commit();
+            }
+        }
+
+        {
+            scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() );
+            ASSERT_EQUALS( nToInsert, sorted->numEntries( opCtx.get() ) );
+        }
+
+        {
+            scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() );
+            scoped_ptr<SortedDataInterface::Cursor> cursor( sorted->newCursor( opCtx.get(), 1 ) );
+            ASSERT( !cursor->locate( minKey, minDiskLoc ) );
+            for ( int i = 0; i < nToInsert; i++ ) {
+                ASSERT( !cursor->isEOF() );
+                ASSERT_EQUALS( BSON( "" << i ), cursor->getKey() );
+                ASSERT_EQUALS( DiskLoc( 42, i * 2 ), cursor->getDiskLoc() );
+                cursor->advance();
+            }
+            ASSERT( cursor->isEOF() );
+
+            // Cursor at EOF should remain at EOF when advanced
+            cursor->advance();
+            ASSERT( cursor->isEOF() );
+        }
+    }
+
+    // Call advance() on a reverse cursor until it is exhausted.
+    // When a cursor positioned at EOF is advanced, it stays at EOF.
+    TEST( SortedDataInterface, ExhaustCursorReversed ) {
+        scoped_ptr<HarnessHelper> harnessHelper( newHarnessHelper() );
+        scoped_ptr<SortedDataInterface> sorted( harnessHelper->newSortedDataInterface() );
+
+        {
+            scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() );
+            ASSERT( sorted->isEmpty( opCtx.get() ) );
+        }
+
+        int nToInsert = 10;
+        for ( int i = 0; i < nToInsert; i++ ) {
+            scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() );
+            {
+                WriteUnitOfWork uow( opCtx.get() );
+                BSONObj key = BSON( "" << i );
+                DiskLoc loc( 42, i * 2 );
+                ASSERT_OK( sorted->insert( opCtx.get(), key, loc, false ) );
+                uow.commit();
+            }
+        }
+
+        {
+            scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() );
+            ASSERT_EQUALS( nToInsert, sorted->numEntries( opCtx.get() ) );
+        }
+
+        {
+            scoped_ptr<OperationContext> opCtx( harnessHelper->newOperationContext() );
+            scoped_ptr<SortedDataInterface::Cursor> cursor( sorted->newCursor( opCtx.get(), -1 ) );
+            ASSERT( !cursor->locate( maxKey, maxDiskLoc ) );
+            for ( int i = nToInsert - 1; i >= 0; i-- ) {
+                ASSERT( !cursor->isEOF() );
+                ASSERT_EQUALS( BSON( "" << i ), cursor->getKey() );
+                ASSERT_EQUALS( DiskLoc( 42, i * 2 ), cursor->getDiskLoc() );
+                cursor->advance();
+            }
+            ASSERT( cursor->isEOF() );
+
+            // Cursor at EOF should remain at EOF when advanced
+            cursor->advance();
+            ASSERT( cursor->isEOF() );
+        }
+    }
+
+} // namespace mongo