HyperSQL Database 2.7.4 · org.hsqldb.lib.ArraySort · APIdia, the JavaDoc alternative

Access	Constructor and Description
public	ArraySort()

Method Summary

Modifier and Type	Method and Description
public static int	deDuplicate(Object[] array, int limit, Comparator<T> comparator)
public static void	insertionSort(Object[] array, Comparator<T> comparator, int lo0, int hi0)
private static void	moveAndInsertRow(Object[] array, int i, int j)
private static void	moveRows(Object[] array, int fromIndex, int toIndex, int rows)
pack-priv static void	quickSort(Object[] array, Comparator<T> comparator, int l, int r)
public static int	Returns: index or a negative value if not found searchFirst(Object[] Object[] array, int int start, int int limit, Object Object value, Comparator<T> Comparator c) Returns the index of the lowest element == the given search target, or when not found, a negative value -(insert position + 1)
public static void	sort(Object[] array, int limit, Comparator<T> comparator)
private static void	swap(Object[] array, int i1, int i2)

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

ArraySort	back to summary
public ArraySort()

deDuplicate	back to summary
public static int deDuplicate(Object[] array, int limit, Comparator<T> comparator)

insertionSort	back to summary
public static void insertionSort(Object[] array, Comparator<T> comparator, int lo0, int hi0)

moveAndInsertRow	back to summary
private static void moveAndInsertRow(Object[] array, int i, int j)

moveRows	back to summary
private static void moveRows(Object[] array, int fromIndex, int toIndex, int rows)

quickSort	back to summary
pack-priv static void quickSort(Object[] array, Comparator<T> comparator, int l, int r)

searchFirst	back to summary
public static int searchFirst(Object[] array, int start, int limit, Object value, Comparator<T> c) Returns the index of the lowest element == the given search target, or when not found, a negative value -(insert position + 1) Parameters array:Object[] Object[] start:int int limit:int int value:Object Object c:Comparator<T> Comparator Returns:int index or a negative value if not found

searchFirst

public static int searchFirst(Object[] array, int start, int limit, Object value, Comparator<T> c)

Returns the index of the lowest element == the given search target, or when not found, a negative value -(insert position + 1)

Parameters

Returns:int

index or a negative value if not found

sort	back to summary
public static void sort(Object[] array, int limit, Comparator<T> comparator)

swap	back to summary
private static void swap(Object[] array, int i1, int i2)