private int binarySearch(T x,int from,int to){
  while (from <= to) {
    int m=(from + to) >>> 1;
    if (comp.compare(x,data[m]) >= 0) {
      from=m + 1;
    }
 else {
      to=m - 1;
    }
  }
  return from;
}

private int binarySearch ( T x , int from , int to ) { while ( from <= to ) { int m = ( from + to ) > > > 1 ; if ( comp . compare ( x , data [ m ] ) >= 0 ) { from = m + 1 ; } else { to = m - 1 ; } } return from ; }
find the index of the element that is larger than x .
