Author: elecharny
Date: Wed Apr 3 14:42:51 2013
New Revision: 1464050
URL: http://svn.apache.org/r1464050
Log:
Renamed the brows(K) method to browseFrom(K), in order to be able to browse a
specific revision
Modified:
labs/mavibot/branches/mavibot-multivalue-support/mavibot/src/main/java/org/apache/mavibot/btree/BTree.java
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/main/java/org/apache/mavibot/btree/BTree.java
URL:
http://svn.apache.org/viewvc/labs/mavibot/branches/mavibot-multivalue-support/mavibot/src/main/java/org/apache/mavibot/btree/BTree.java?rev=1464050&r1=1464049&r2=1464050&view=diff
==============================================================================
---
labs/mavibot/branches/mavibot-multivalue-support/mavibot/src/main/java/org/apache/mavibot/btree/BTree.java
(original)
+++
labs/mavibot/branches/mavibot-multivalue-support/mavibot/src/main/java/org/apache/mavibot/btree/BTree.java
Wed Apr 3 14:42:51 2013
@@ -974,7 +974,7 @@ public class BTree<K, V>
* @return A cursor on the btree
* @throws IOException
*/
- public Cursor<K, V> browse( K key ) throws IOException
+ public Cursor<K, V> browseFrom( K key ) throws IOException
{
Transaction<K, V> transaction = beginReadTransaction();
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=1464050&r1=1464049&r2=1464050&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 14:42:51 2013
@@ -625,7 +625,7 @@ public class InMemoryBTreeTest
// Browse starting at position 10
int pos = 10;
- Cursor<Integer, String> cursor = btree.browse( sortedValues[pos] );
+ Cursor<Integer, String> cursor = btree.browseFrom( sortedValues[pos] );
while ( cursor.hasNext() )
{
@@ -641,7 +641,7 @@ public class InMemoryBTreeTest
cursor.close();
// Now, start on a non existing key (7)
- cursor = btree.browse( 7 );
+ cursor = btree.browseFrom( 7 );
// We should start reading values superior to 7, so value 8 at
position 6 in the array
pos = 6;
@@ -709,7 +709,7 @@ public class InMemoryBTreeTest
// Browse starting at position 10
int pos = 10;
- Cursor<Integer, String> cursor = btree.browse( sortedValues[pos] );
+ Cursor<Integer, String> cursor = btree.browseFrom( sortedValues[pos] );
while ( cursor.hasPrev() )
{
@@ -726,7 +726,7 @@ public class InMemoryBTreeTest
cursor.close();
// Now, start on a non existing key (7)
- cursor = btree.browse( 7 );
+ cursor = btree.browseFrom( 7 );
// We should start reading values superior to 7, so value 8 at
position 6 in the array
pos = 6;
@@ -793,7 +793,7 @@ public class InMemoryBTreeTest
}
// Start to browse in the middle
- Cursor<Integer, String> cursor = btree.browse( 8 );
+ Cursor<Integer, String> cursor = btree.browseFrom( 8 );
assertTrue( cursor.hasNext() );
@@ -1027,7 +1027,7 @@ public class InMemoryBTreeTest
assertTrue( btree.hasKey( 8 ) );
assertFalse( btree.hasKey( 11 ) );
- Cursor<Integer, String> cursor = btree.browse( 11 );
+ Cursor<Integer, String> cursor = btree.browseFrom( 11 );
assertFalse( cursor.hasNext() );
}
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
