commit 23a47f40fb2f0ac18c43c2cb169bd6becfd70464
author Emmanuel Lécharny <elecharny@apache.org> Sun Sep 13 15:55:24 2015 +0000
committer Emmanuel Lécharny <elecharny@apache.org> Sun Sep 13 15:55:24 2015 +0000
tree 4f6db515b4e8a7fac4f6f9f9037cf3485da8a987
parent c2985f380f2d6cff441904dcbc86e99edc9a9e8d

Defined a constant for the maximum stack size

mavibot/src/main/java/org/apache/directory/mavibot/btree/AbstractBTree.java

diff --git a/mavibot/src/main/java/org/apache/directory/mavibot/btree/AbstractBTree.java b/mavibot/src/main/java/org/apache/directory/mavibot/btree/AbstractBTree.java
index 5d91424..7b50c04 100644
--- a/mavibot/src/main/java/org/apache/directory/mavibot/btree/AbstractBTree.java
+++ b/mavibot/src/main/java/org/apache/directory/mavibot/btree/AbstractBTree.java
@@ -97,6 +97,9 @@
     /** The TransactionManager used for this BTree */
     protected TransactionManager transactionManager;
 
+    /** The size of the stack to use to manage tree searches */
+    private final static int MAX_STACK_DEPTH = 32;
+
 
     /**
      * Starts a Read Only transaction. If the transaction is not closed, it will be
@@ -135,7 +138,7 @@
         }
         else
         {
-            ParentPos<K, V>[] stack = ( ParentPos<K, V>[] ) Array.newInstance( ParentPos.class, 32 );
+            ParentPos<K, V>[] stack = ( ParentPos<K, V>[] ) Array.newInstance( ParentPos.class, MAX_STACK_DEPTH );
 
             TupleCursor<K, V> cursor = getRootPage().browse( transaction, stack, 0 );
 
@@ -166,7 +169,7 @@
         }
         else
         {
-            ParentPos<K, V>[] stack = ( ParentPos<K, V>[] ) Array.newInstance( ParentPos.class, 32 );
+            ParentPos<K, V>[] stack = ( ParentPos<K, V>[] ) Array.newInstance( ParentPos.class, MAX_STACK_DEPTH );
 
             // And get the cursor
             TupleCursor<K, V> cursor = getRootPage( transaction.getRevision() ).browse( transaction, stack, 0 );
@@ -189,7 +192,7 @@
 
         ReadTransaction<K, V> transaction = beginReadTransaction();
 
-        ParentPos<K, V>[] stack = ( ParentPos<K, V>[] ) Array.newInstance( ParentPos.class, 32 );
+        ParentPos<K, V>[] stack = ( ParentPos<K, V>[] ) Array.newInstance( ParentPos.class, MAX_STACK_DEPTH );
 
         try
         {
@@ -223,7 +226,7 @@
         }
         else
         {
-            ParentPos<K, V>[] stack = ( ParentPos<K, V>[] ) Array.newInstance( ParentPos.class, 32 );
+            ParentPos<K, V>[] stack = ( ParentPos<K, V>[] ) Array.newInstance( ParentPos.class, MAX_STACK_DEPTH );
 
             // And get the cursor
             TupleCursor<K, V> cursor = getRootPage( transaction.getRevision() ).browse( key, transaction, stack, 0 );
@@ -1030,7 +1033,7 @@
         }
         else
         {
-            ParentPos<K, K>[] stack = ( ParentPos<K, K>[] ) Array.newInstance( ParentPos.class, 32 );
+            ParentPos<K, K>[] stack = ( ParentPos<K, K>[] ) Array.newInstance( ParentPos.class, MAX_STACK_DEPTH );
 
             KeyCursor<K> cursor = getRootPage().browseKeys( transaction, stack, 0 );