searches this sequence for a specific element using a binary search . the sequence must already be sorted into ascending order according to the specified comparator . if it is not sorted , the results are undefined . concode_field_sep long serialVersionUID concode_field_sep Iterator<? extends IndexedSeq<T>> sliding concode_elem_sep Iterator<? extends IndexedSeq<T>> sliding concode_elem_sep Iterator<? extends IndexedSeq<T>> crossProduct concode_elem_sep Option<? extends IndexedSeq<T>> tailOption concode_elem_sep IndexedSeq<T> prepend concode_elem_sep IndexedSeq<T> replace concode_elem_sep IndexedSeq<T> takeWhile concode_elem_sep IndexedSeq<T> patch concode_elem_sep IndexedSeq<T> removeAll concode_elem_sep IndexedSeq<T> removeAll concode_elem_sep IndexedSeq<T> removeAll concode_elem_sep IndexedSeq<T> slice concode_elem_sep IndexedSeq<T> removeFirst concode_elem_sep IndexedSeq<T> narrow concode_elem_sep IndexedSeq<T> sortBy concode_elem_sep IndexedSeq<T> sortBy concode_elem_sep IndexedSeq<Tuple2<T,U>> zip concode_elem_sep IndexedSeq<T> init concode_elem_sep Iterator<? extends IndexedSeq<T>> grouped concode_elem_sep T last concode_elem_sep Tuple3<? extends IndexedSeq<T1>,? extends IndexedSeq<T2>,? extends IndexedSeq<T3>> unzip3 concode_elem_sep int indexWhere concode_elem_sep IndexedSeq<T> intersperse concode_elem_sep Iterator<T> reverseIterator concode_elem_sep int findSlice concode_elem_sep IndexedSeq<U> flatMap concode_elem_sep IndexedSeq<T> take concode_elem_sep IndexedSeq<T> sorted concode_elem_sep IndexedSeq<T> sorted concode_elem_sep IndexedSeq<U> unit concode_elem_sep IndexedSeq<? extends IndexedSeq<T>> combinations concode_elem_sep IndexedSeq<? extends IndexedSeq<T>> combinations concode_elem_sep boolean endsWith concode_elem_sep IndexedSeq<T> padTo concode_elem_sep IndexedSeq<T> removeAt concode_elem_sep int segmentLength concode_elem_sep IndexedSeq<Tuple2<T,Integer>> zipWithIndex concode_elem_sep IndexedSeq<U> zipWithIndex concode_elem_sep IndexedSeq<T> insertAll concode_elem_sep IndexedSeq<R> zipWith concode_elem_sep IndexedSeq<T> drop concode_elem_sep Option<? extends IndexedSeq<T>> initOption concode_elem_sep IndexedSeq<T> dropRight concode_elem_sep IndexedSeq<T> scan concode_elem_sep IndexedSeq<T> takeRight concode_elem_sep IndexedSeq<T> distinct concode_elem_sep IndexedSeq<T> insert concode_elem_sep int lastIndexOfSlice concode_elem_sep int lastIndexOfSlice concode_elem_sep IndexedSeq<T> update concode_elem_sep Map<C,? extends IndexedSeq<T>> groupBy concode_elem_sep int binarySearch concode_elem_sep IndexedSeq<? extends IndexedSeq<T>> permutations concode_elem_sep IndexedSeq<U> scanLeft concode_elem_sep Tuple2<? extends IndexedSeq<T1>,? extends IndexedSeq<T2>> unzip concode_elem_sep IndexedSeq<T> removeLast concode_elem_sep IndexedSeq<T> replaceAll concode_elem_sep IndexedSeq<T> remove concode_elem_sep Tuple2<? extends IndexedSeq<T>,? extends IndexedSeq<T>> partition concode_elem_sep IndexedSeq<T> distinctBy concode_elem_sep IndexedSeq<T> distinctBy concode_elem_sep IndexedSeq<U> map concode_elem_sep IndexedSeq<T> takeUntil concode_elem_sep int lastIndexWhere concode_elem_sep IndexedSeq<T> appendAll concode_elem_sep IndexedSeq<T> tail concode_elem_sep IndexedSeq<U> scanRight concode_elem_sep IndexedSeq<Tuple2<T,U>> zipAll concode_elem_sep IndexedSeq<T> subSequence concode_elem_sep IndexedSeq<T> subSequence concode_elem_sep IndexedSeq<T> dropWhile concode_elem_sep IndexedSeq<T> reverse concode_elem_sep IndexedSeq<T> peek concode_elem_sep IndexedSeq<T> filter concode_elem_sep IndexedSeq<T> prependAll concode_elem_sep IndexedSeq<T> dropUntil concode_elem_sep IndexedSeq<T> append concode_elem_sep IndexedSeq<T> retainAll concode_elem_sep Tuple2<? extends IndexedSeq<T>,? extends IndexedSeq<T>> span concode_elem_sep boolean startsWith
int function ( T arg0 , Comparator < ? super T > arg1 ) { Objects . requireNonNull ( arg1 , "srini_string" ) ; IntUnaryOperator loc0 = midIndex -> { T midVal = get ( midIndex ) ; return arg1 . compare ( midVal , arg0 ) ; } ; return IndexedSeqModule . Search . binarySearch ( this , loc0 ) ; }