public void test_htree_math_addressBits_10(){
  final int addressBits=10;
  final StringBuilder sb=new StringBuilder();
  doHTreeMath(addressBits,sb);
  if (log.isInfoEnabled())   log.info(sb.toString());
}

public void test_htree_math_addressBits_10 ( ) { final int addressBits = 10 ; final StringBuilder sb = new StringBuilder ( ) ; doHTreeMath ( addressBits , sb ) ; if ( log . isInfoEnabled ( ) ) log . info ( sb . toString ( ) ) ; }
exercise the hash tree math for an 10 - bit address space ( this corresponds to a 4k page ) .
