You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@directory.apache.org by el...@apache.org on 2015/02/12 09:59:25 UTC

svn commit: r1659172 - /directory/mavibot/trunk/mavibot/src/test/java/org/apache/directory/mavibot/btree/PersistedBTreeBrowseTest.java

Author: elecharny
Date: Thu Feb 12 08:59:25 2015
New Revision: 1659172

URL: http://svn.apache.org/r1659172
Log:
Fixed the test, which was not injecting all the values

Modified:
    directory/mavibot/trunk/mavibot/src/test/java/org/apache/directory/mavibot/btree/PersistedBTreeBrowseTest.java

Modified: directory/mavibot/trunk/mavibot/src/test/java/org/apache/directory/mavibot/btree/PersistedBTreeBrowseTest.java
URL: http://svn.apache.org/viewvc/directory/mavibot/trunk/mavibot/src/test/java/org/apache/directory/mavibot/btree/PersistedBTreeBrowseTest.java?rev=1659172&r1=1659171&r2=1659172&view=diff
==============================================================================
--- directory/mavibot/trunk/mavibot/src/test/java/org/apache/directory/mavibot/btree/PersistedBTreeBrowseTest.java (original)
+++ directory/mavibot/trunk/mavibot/src/test/java/org/apache/directory/mavibot/btree/PersistedBTreeBrowseTest.java Thu Feb 12 08:59:25 2015
@@ -1179,17 +1179,36 @@ public class PersistedBTreeBrowseTest
         Random r = new Random( System.currentTimeMillis() );
 
         // Inject some data
-        for ( long i = 0L; i < 5000L; i++ )
+        for ( long i = 0L; i < 500L; i++ )
         {
             values.add( i );
         }
 
+        long sum = 0L;
+
+        for ( int i = 0; i < 500; i++ )
+        {
+            sum += values.get( i );
+        }
+
+        assertEquals( ( 500 * 499 ) / 2, sum );
+
         for ( int i = 0; i < 500; i++ )
         {
             int index = r.nextInt( 500 - i );
             randomVals[i] = values.get( index );
+            values.remove( index );
         }
 
+        sum = 0L;
+
+        for ( int i = 0; i < 500; i++ )
+        {
+            sum += randomVals[i];
+        }
+
+        assertEquals( ( 500 * 499 ) / 2, sum );
+
         // Inject some data
         for ( int i = 0; i < 500; i++ )
         {
@@ -1205,14 +1224,37 @@ public class PersistedBTreeBrowseTest
 
             assertTrue( cursor.hasNext() );
             Long expected = i;
+            boolean error = false;
 
             while ( cursor.hasNext() )
             {
                 Tuple<Long, String> tuple = cursor.next();
+
+                if ( expected != tuple.getKey() )
+                {
+                    System.out.println( "Error on " + expected );
+                    error = true;
+                    break;
+                }
                 assertEquals( expected, tuple.getKey() );
                 expected++;
             }
 
+            expected = i;
+
+            if ( error )
+            {
+                cursor.close();
+                cursor = btree.browseFrom( i );
+
+                while ( cursor.hasNext() )
+                {
+                    Tuple<Long, String> tuple = cursor.next();
+                    assertEquals( expected, tuple.getKey() );
+                    expected++;
+                }
+            }
+
             cursor.close();
         }
     }