directory-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From elecha...@apache.org
Subject [directory-mavibot] branch single-value updated: Removed dead functions
Date Tue, 02 Jan 2018 22:45:45 GMT
This is an automated email from the ASF dual-hosted git repository.

elecharny pushed a commit to branch single-value
in repository https://gitbox.apache.org/repos/asf/directory-mavibot.git


The following commit(s) were added to refs/heads/single-value by this push:
     new 29a0c3e  Removed dead functions
29a0c3e is described below

commit 29a0c3efffd05f3273121b86386ef971830110ac
Author: Emmanuel L├ęcharny <elecharny@symas.com>
AuthorDate: Tue Jan 2 23:45:44 2018 +0100

    Removed dead functions
---
 .../directory/mavibot/btree/BTreeFactory.java      | 102 ---------------------
 1 file changed, 102 deletions(-)

diff --git a/mavibot/src/main/java/org/apache/directory/mavibot/btree/BTreeFactory.java b/mavibot/src/main/java/org/apache/directory/mavibot/btree/BTreeFactory.java
index c1a365b..a49e20e 100644
--- a/mavibot/src/main/java/org/apache/directory/mavibot/btree/BTreeFactory.java
+++ b/mavibot/src/main/java/org/apache/directory/mavibot/btree/BTreeFactory.java
@@ -434,69 +434,6 @@ public class BTreeFactory<K, V>
     //--------------------------------------------------------------------------------------------
     // Utility method
     //--------------------------------------------------------------------------------------------
-    /**
-     * Includes the intermediate nodes in the path up to and including the right most leaf
of the tree
-     *
-     * @param btree the b-tree
-     * @return a LinkedList of all the nodes and the final leaf
-     */
-    /* no qualifier*/static <K, V> LinkedList<ParentPos<K, V>> getPathToRightMostLeaf(
BTree<K, V> btree )
-    {
-        LinkedList<ParentPos<K, V>> stack = new LinkedList<ParentPos<K,
V>>();
-
-        ParentPos<K, V> last = new ParentPos<>( btree.getRootPage(), btree.getRootPage().getPageNbElems()
);
-        stack.push( last );
-
-        if ( btree.getRootPage().isLeaf() )
-        {
-            Page<K, V> leaf = btree.getRootPage();
-            //ValueHolder<V> valueHolder = ( ( Leaf<K, V> ) leaf ).getValue(
last.pos );
-        }
-        else
-        {
-            Page<K, V> node = btree.getRootPage();
-
-            while ( true )
-            {
-                //Page<K, V> p = transaction.getPage( btreeInfo, ( ( AbstractPage )parentPos.page
).children[parentPos.pos] );
-                Page<K, V> p = ( ( AbstractPage<K, V> ) node ).getPage( node.getPageNbElems()
);
-
-                last = new ParentPos<>( p, p.getPageNbElems() );
-                stack.push( last );
-
-                if ( p.isLeaf() )
-                {
-                    Page<K, V> leaf = last.page;
-                    //ValueHolder<V> valueHolder = ( ( Leaf<K, V> ) leaf ).getValue(
last.pos );
-                    break;
-                }
-            }
-        }
-
-        return stack;
-    }
-
-
-    //--------------------------------------------------------------------------------------------
-    // Persisted b-tree methods
-    //--------------------------------------------------------------------------------------------
-    /**
-     * Set the rootPage offset of the b-tree
-     *
-     * @param btree The b-tree to update
-     * @param rootPageOffset The rootPageOffset to set
-     */
-    /* no qualifier*/static <K, V> void setRootPageOffset( BTree<K, V> btree,
long rootPageOffset )
-    {
-        if ( btree instanceof BTree )
-        {
-            btree.getBtreeHeader().setRootPageOffset( rootPageOffset );
-        }
-        else
-        {
-            throw new IllegalArgumentException( "The b-tree must be a PersistedBTree" );
-        }
-    }
 
 
     /**
@@ -531,43 +468,4 @@ public class BTreeFactory<K, V>
         KeyHolder<K> keyHolder = new KeyHolder<>( btreeInfo.getKeySerializer(),
buffer );
         ( ( AbstractPage<K, V> ) page ).setKey( pos, keyHolder );
     }
-
-
-    /**
-     * Includes the intermediate nodes in the path up to and including the left most leaf
of the tree
-     *
-     * @param btree The b-tree to process
-     * @return a LinkedList of all the nodes and the final leaf
-     */
-    /* no qualifier*/static <K, V> LinkedList<ParentPos<K, V>> getPathToLeftMostLeaf(
BTree<K, V> btree )
-    {
-        if ( btree instanceof BTree )
-        {
-            LinkedList<ParentPos<K, V>> stack = new LinkedList<ParentPos<K,
V>>();
-
-            ParentPos<K, V> first = new ParentPos<K, V>( btree.getRootPage(),
0 );
-            stack.push( first );
-
-            Page<K, V> node = btree.getRootPage();
-
-            while ( true )
-            {
-                Page<K, V> page = ( ( AbstractPage<K, V> ) node ).getPage( 0
);
-
-                first = new ParentPos<K, V>( page, 0 );
-                stack.push( first );
-
-                if ( page.isLeaf() )
-                {
-                    break;
-                }
-            }
-
-            return stack;
-        }
-        else
-        {
-            throw new IllegalArgumentException( "The b-tree must be a PersistedBTree" );
-        }
-    }
 }

-- 
To stop receiving notification emails like this one, please contact
['"commits@directory.apache.org" <commits@directory.apache.org>'].

Mime
View raw message