net.sf.kdgcommons.collections

Interface InplaceSort.Accessor

Enclosing class:

InplaceSort

public static interface InplaceSort.Accessor

The sort uses an implementation of this interface to access an array-like structure. There are internal implementations for Java arrays and lists; you will need to provide your own implementation for other structures.

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

Method Summary

Modifier and Type	Method and Description
int	compare(int index1, int index2) Compares the values at two positions within the array-like structure.
int	end() The maximum bound of the search (exclusive).
int	start() The minimum bound of the search (inclusive).
void	swap(int index1, int index2) Swaps the values at two positions within the array-like structure.

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(int index1,
            int index2)

Compares the values at two positions within the array-like structure. Returns the normal comparator values: < 0, 0, > 0.

swap

void swap(int index1,
          int index2)

Swaps the values at two positions within the array-like structure.