performs binary search of the upper bound in the given array . it is assumed that the array is sorted . the method is guaranteed to return the maximal index of the element that is less or equal to the given key . concode_field_sep PlaceHolder placeHolder concode_field_sep int lowerBound concode_elem_sep int lowerBound concode_elem_sep int lowerBound concode_elem_sep int lowerBound
int function ( T [ ] arg0 , T arg1 , Comparator < T > arg2 ) { return upperBound ( arg0 , arg1 , 0 , arg0 . length - 1 , Functions . < T > identitySelector ( ) , arg2 ) ; }