org.conqat.lib.commons.collections

Class SortableDataUtils

java.lang.Object

org.conqat.lib.commons.collections.SortableDataUtils

public class SortableDataUtils
extends java.lang.Object

Abstraction for sortable/comparable data. This class supports basic algorithms, such as sorting and binary search on any data which can be mapped to a random access list. The main benefit of this class, is that the type of data is operated on must not be known (or be a concrete type), thus it can also be used to sort data spread over multiple lists or arrays.

Author:

hummelb

Constructor Summary

Constructors

Constructor and Description
SortableDataUtils()

Method Summary

Modifier and Type	Method and Description
static int	binarySearch(ISortableData data, int elementIndex) Performs a binary search for the element at the given index.
static void	sort(ISortableData data) Sorts the data in place using a randomized quick sort algorithm.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

SortableDataUtils

public SortableDataUtils()

Method Detail

binarySearch

public static int binarySearch(ISortableData data,
                               int elementIndex)

Performs a binary search for the element at the given index. The returned index will be the first index at which the element could be inserted without violating the sorting order. If the underlying data is not sorted, the result is undefined. The result will be between 0 and ISortableData.size() inclusive. The given element index may be larger than ISortableData.size(), i.e. the element does not have to be in the list.

sort

public static void sort(ISortableData data)

Sorts the data in place using a randomized quick sort algorithm.