private final ArrayList<Integer> findChildren(int index){
  ArrayList<Integer> ret=new ArrayList<Integer>();
  StartEntry se=new StartEntry();
  EndEntry ee=new EndEntry();
  int child=index + 1;
  while ((child >= 0) && (child < numEntries)) {
    boolean haveEE=readEntries(child,se,ee);
    if (se.parentIndex == index)     ret.add(child);
    if (!haveEE)     break;
    if (child != ee.startIndex)     break;
    child=se.endIndex + 1;
  }
  return ret;
}

private final ArrayList < Integer > findChildren ( int index ) { ArrayList < Integer > ret = new ArrayList < Integer > ( ) ; StartEntry se = new StartEntry ( ) ; EndEntry ee = new EndEntry ( ) ; int child = index + 1 ; while ( ( child >= 0 ) && ( child < numEntries ) ) { boolean haveEE = readEntries ( child , se , ee ) ; if ( se . parentIndex == index ) ret . add ( child ) ; if ( ! haveEE ) break ; if ( child != ee . startIndex ) break ; child = se . endIndex + 1 ; } return ret ; }
find all children of a node .
