src/java/org/apache/cassandra/utils/MerkleTree.java
/**
     * Initializes this tree by splitting it until hashdepth is reached,
     * or until an additional level of splits would violate maxsize.
     *
     * NB: Replaces all nodes in the tree.
     */
Initializes this tree by splitting it until hashdepth is reached,
or until an additional level of splits would violate maxsize.

Replaces all nodes in the tree.
Initializes this tree by splitting it until hashdepth is reached or until an additional level of splits would violate maxsize . Replaces all nodes in the tree .
public void init()
    {
        byte sizedepth = (byte)(Math.log10(maxsize) / Math.log10(2));
        byte depth = (byte)Math.min(sizedepth, hashdepth);
        root = initHelper(fullRange.left, fullRange.right, (byte)0, depth);
        size = (long)Math.pow(2, depth);
    }
public void init ( ) { byte sizedepth = ( byte ) ( Math . log10 ( maxsize ) / Math . log10 ( 2 ) ) ; byte depth = ( byte ) Math . min ( sizedepth , hashdepth ) ; root = initHelper ( fullRange . left , fullRange . right , ( byte ) 0 , depth ) ; size = ( long ) Math . pow ( 2 , depth ) ; }
Initializes this tree by splitting it until hashdepth is reached,
 or until an additional level of splits would violate maxsize.
Initializes this tree by splitting it until hashdepth is reached or until an additional level of splits would violate maxsize .
// determine the depth to which we can safely split the tree