private int binaryEmptySlotSearch ( ) { int low = 0 ; int high = count ; int mid = 0 ; int compare = 0 ; while ( low < high ) { mid = ( low + high ) / 2 ; compare = compare ( mid ) ; if ( compare < 0 ) { high = mid ; } else if ( compare > 0 ) { low = mid + 1 ; } else { return - 1 ; } } return low ; }
Returns the index of the lowest element > the given search target or count or - 1 if target is found