org.osgl.util.algo

Interface ArraySearch<T>

All Superinterfaces:

Algorithm, ArrayAlgorithm, Lang.Func5<T[],Integer,Integer,T,Comparator<T>,Integer>

All Known Implementing Classes:

ArrayBinarySearch

public interface ArraySearch<T>
extends ArrayAlgorithm, Lang.Func5<T[],Integer,Integer,T,Comparator<T>,Integer>

Created with IntelliJ IDEA. User: luog Date: 20/11/13 Time: 10:10 PM To change this template use File | Settings | File Templates.

Nested Class Summary

Nested classes/interfaces inherited from interface org.osgl.util.algo.ArrayAlgorithm

ArrayAlgorithm.Util

Method Summary

Modifier and Type	Method and Description
Integer	apply(T[] ts, Integer from, Integer to, T key, Comparator<T> comp) Search array region specified by from and to using the predicate specified

Method Detail

apply

Integer apply(T[] ts,
              Integer from,
              Integer to,
              T key,
              Comparator<T> comp)

Search array region specified by from and to using the predicate specified

Specified by:

apply in interface Lang.Func5<T[],Integer,Integer,T,Comparator<T>,Integer>

Parameters:

ts - the sorted array to be searched

from - the from index

to - the to index

key - the key to search the array

comp - the comparator function

Returns:

index of the search key, if it is contained in the array; otherwise, (-(insertion point) - 1). The insertion point is defined as the point at which the key would be inserted into the array: the index of the first element greater than the key, or a.length if all elements in the array are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.