net.sf.kdgcommons.collections

Interface BinarySearch.Accessor<T>

Enclosing class:

BinarySearch

public static interface BinarySearch.Accessor<T>

Implement this interface if you're searching an already-sorted array-like structure. You can define accessors that look at the entire structure, or at a partial structure, depending on how you implement start() and end().

It is intended to be compatible with the like-named interface defined by InplaceSort, allowing a single implementation class for both.

Method Summary

Modifier and Type	Method and Description
int	compare(T value, int index) Compares an explicit value against the value at a given location in the array-like structure.
int	end() The maximum bound of the search (exclusive).
int	start() The minimum bound of the search (inclusive).

Method Detail

start

int start()

The minimum bound of the search (inclusive). Normally this is 0, but it may vary to search a subset of the array.

end

int end()

The maximum bound of the search (exclusive). Normally this is the length of the array, but may be a lower value.

compare

int compare(T value,
            int index)

Compares an explicit value against the value at a given location in the array-like structure. Returns the normal comparator values: <0, 0, >0.