You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@labs.apache.org by el...@apache.org on 2013/04/03 13:02:10 UTC

svn commit: r1463913 - /labs/mavibot/branches/mavibot-multivalue-support/mavibot/src/test/java/org/apache/mavibot/btree/InMemoryBTreeTest.java

Author: elecharny
Date: Wed Apr  3 11:02:09 2013
New Revision: 1463913

URL: http://svn.apache.org/r1463913
Log:
Fix a compilation failure after having removed the duplicated method exist().

Modified:
    labs/mavibot/branches/mavibot-multivalue-support/mavibot/src/test/java/org/apache/mavibot/btree/InMemoryBTreeTest.java

Modified: labs/mavibot/branches/mavibot-multivalue-support/mavibot/src/test/java/org/apache/mavibot/btree/InMemoryBTreeTest.java
URL: http://svn.apache.org/viewvc/labs/mavibot/branches/mavibot-multivalue-support/mavibot/src/test/java/org/apache/mavibot/btree/InMemoryBTreeTest.java?rev=1463913&r1=1463912&r2=1463913&view=diff
==============================================================================
--- labs/mavibot/branches/mavibot-multivalue-support/mavibot/src/test/java/org/apache/mavibot/btree/InMemoryBTreeTest.java (original)
+++ labs/mavibot/branches/mavibot-multivalue-support/mavibot/src/test/java/org/apache/mavibot/btree/InMemoryBTreeTest.java Wed Apr  3 11:02:09 2013
@@ -906,11 +906,11 @@ public class InMemoryBTreeTest
 
         for ( int i = 1; i < 21; i++ )
         {
-            assertTrue( btree.exist( 5 ) );
+            assertTrue( btree.hasKey( 5 ) );
         }
 
-        assertFalse( btree.exist( 0 ) );
-        assertFalse( btree.exist( 21 ) );
+        assertFalse( btree.hasKey( 0 ) );
+        assertFalse( btree.hasKey( 21 ) );
     }
 
 
@@ -1014,24 +1014,24 @@ public class InMemoryBTreeTest
         // Create a BTree with pages containing 8 elements
         BTree<Integer, String> btree = new BTree<Integer, String>( "test", new IntSerializer(), new StringSerializer() );
         btree.setPageSize( 8 );
-        for( int i=0; i < 11; i++ )
+        for ( int i = 0; i < 11; i++ )
         {
             btree.insert( i, String.valueOf( i ) );
         }
-        
-        for( int i=0; i < 11; i++ )
+
+        for ( int i = 0; i < 11; i++ )
         {
             assertNotNull( btree.get( i ) );
         }
-        
+
         assertTrue( btree.hasKey( 8 ) );
         assertFalse( btree.hasKey( 11 ) );
-        
+
         Cursor<Integer, String> cursor = btree.browse( 11 );
         assertFalse( cursor.hasNext() );
     }
 
-    
+
     private Page<Integer, String> createLeaf( BTree<Integer, String> btree, long revision,
         Tuple<Integer, String>... tuples )
     {
@@ -1709,7 +1709,7 @@ public class InMemoryBTreeTest
         // Adding an element with a null value
         btree.insert( 100, null );
 
-        assertTrue( btree.exist( 100 ) );
+        assertTrue( btree.hasKey( 100 ) );
 
         try
         {



---------------------------------------------------------------------
To unsubscribe, e-mail: commits-unsubscribe@labs.apache.org
For additional commands, e-mail: commits-help@labs.apache.org