Package | Description |
---|---|
com.uwyn.jhighlight.fastutil | |
com.uwyn.jhighlight.fastutil.ints |
Modifier and Type | Method and Description |
---|---|
static void |
Arrays.mergeSort(int from,
int to,
IntComparator c,
Swapper swapper)
Sorts the specified range of elements using the specified swapper and according to the order induced by the specified
comparator using mergesort.
|
static void |
Arrays.quickSort(int from,
int to,
IntComparator comp,
Swapper swapper)
Sorts the specified range of elements using the specified swapper and according to the order induced by the specified
comparator using quicksort.
|
Modifier and Type | Method and Description |
---|---|
static int |
IntArrays.binarySearch(int[] a,
int key,
IntComparator c)
Searches an array for the specified value using
the binary search algorithm and a specified comparator.
|
static int |
IntArrays.binarySearch(int[] a,
int from,
int to,
int key,
IntComparator c)
Searches a range of the specified array for the specified value using
the binary search algorithm and a specified comparator.
|
static void |
IntArrays.mergeSort(int[] a,
IntComparator comp)
Sorts an array according to the order induced by the specified
comparator using mergesort.
|
static void |
IntArrays.mergeSort(int[] a,
int from,
int to,
IntComparator comp)
Sorts the specified range of elements according to the order induced by the specified
comparator using mergesort.
|
static void |
IntArrays.mergeSort(int[] a,
int from,
int to,
IntComparator comp,
int[] supp)
Sorts the specified range of elements according to the order induced by the specified
comparator using mergesort, using a given pre-filled support array.
|
static void |
IntArrays.quickSort(int[] x,
IntComparator comp)
Sorts an array according to the order induced by the specified
comparator using quicksort.
|
static void |
IntArrays.quickSort(int[] x,
int from,
int to,
IntComparator comp)
Sorts the specified range of elements according to the order induced by the specified
comparator using quicksort.
|
Copyright © 2011–2020. All rights reserved.