private static int |
Partitioning.binarySearchFromTo(int a,
int from,
int to,
IntComparator comp) |
Finds the given key "a" within some generic data using the binary search algorithm.
|
static int |
Sorting.binarySearchFromTo(int from,
int to,
IntComparator comp) |
Generically searches the list for the specified value using
the binary search algorithm.
|
static void |
Partitioning.genericPartition(int from,
int to,
int splitFrom,
int splitTo,
int[] splitIndexes,
IntComparator comp,
IntComparator comp2,
IntComparator comp3,
Swapper swapper) |
|
private static int |
Partitioning.genericPartition(int from,
int to,
int splitter,
IntComparator comp,
Swapper swapper) |
|
private static void |
GenericSorting.inplace_merge(int first,
int middle,
int last,
IntComparator comp,
Swapper swapper) |
Transforms two consecutive sorted ranges into a single sorted
range.
|
private static int |
GenericSorting.lower_bound(int first,
int last,
int x,
IntComparator comp) |
Performs a binary search on an already-sorted range: finds the first
position where an element can be inserted without violating the ordering.
|
private static int |
GenericSorting.med3(int a,
int b,
int c,
IntComparator comp) |
Returns the index of the median of the three indexed chars.
|
private static int |
Partitioning.med3(int a,
int b,
int c,
IntComparator comp) |
Returns the index of the median of the three indexed chars.
|
private static int |
Sorting.med3(int[] x,
int a,
int b,
int c,
IntComparator comp) |
Returns the index of the median of the three indexed chars.
|
static void |
GenericSorting.mergeSort(int fromIndex,
int toIndex,
IntComparator c,
Swapper swapper) |
Sorts the specified range of elements according
to the order induced by the specified comparator.
|
static void |
Sorting.mergeSort(int[] a,
int fromIndex,
int toIndex,
IntComparator c) |
Sorts the specified range of the specified array of elements according
to the order induced by the specified comparator.
|
private static void |
Sorting.mergeSort1(int[] src,
int[] dest,
int low,
int high,
IntComparator c) |
|
static void |
GenericSorting.quickSort(int fromIndex,
int toIndex,
IntComparator c,
Swapper swapper) |
Sorts the specified range of elements according
to the order induced by the specified comparator.
|
static void |
Sorting.quickSort(int[] a,
int fromIndex,
int toIndex,
IntComparator c) |
Sorts the specified range of the specified array of elements according
to the order induced by the specified comparator.
|
private static void |
GenericSorting.quickSort1(int off,
int len,
IntComparator comp,
Swapper swapper) |
Sorts the specified sub-array into ascending order.
|
private static void |
Sorting.quickSort1(int[] x,
int off,
int len,
IntComparator comp) |
Sorts the specified sub-array of chars into ascending order.
|
private static int |
GenericSorting.upper_bound(int first,
int last,
int x,
IntComparator comp) |
Performs a binary search on an already-sorted range: finds the last
position where an element can be inserted without violating the ordering.
|