| Package | Description |
|---|---|
| it.unimi.dsi.fastutil | |
| it.unimi.dsi.fastutil.ints |
Provides type-specific classes for integer elements or keys.
|
| 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.parallelQuickSort(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 a parallel quicksort.
|
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 parallel quicksort.
|
| Constructor and Description |
|---|
ForkJoinGenericQuickSort(int from,
int to,
IntComparator comp,
Swapper swapper) |
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractIntComparator
An abstract class facilitating the creation of type-specific comparators.
|
protected static class |
IntComparators.NaturalImplicitComparator
A type-specific comparator mimicking the natural order.
|
protected static class |
IntComparators.OppositeComparator |
protected static class |
IntComparators.OppositeImplicitComparator
A type-specific comparator mimicking the opposite of the natural order.
|
| Modifier and Type | Field and Description |
|---|---|
protected IntComparator |
Int2ObjectSortedMaps.Singleton.comparator |
static IntComparator |
IntComparators.NATURAL_COMPARATOR |
static IntComparator |
IntComparators.OPPOSITE_COMPARATOR |
| Modifier and Type | Method and Description |
|---|---|
IntComparator |
IntSortedSets.EmptySet.comparator() |
IntComparator |
IntSortedSets.Singleton.comparator() |
IntComparator |
IntSortedSets.SynchronizedSortedSet.comparator() |
IntComparator |
IntSortedSets.UnmodifiableSortedSet.comparator() |
IntComparator |
IntSortedSet.comparator()
Returns the comparator associated with this sorted set, or null if it uses its elements' natural ordering.
|
IntComparator |
Int2ObjectSortedMaps.EmptySortedMap.comparator() |
IntComparator |
Int2ObjectSortedMaps.Singleton.comparator() |
IntComparator |
Int2ObjectSortedMaps.SynchronizedSortedMap.comparator() |
IntComparator |
Int2ObjectSortedMaps.UnmodifiableSortedMap.comparator() |
IntComparator |
Int2ObjectSortedMap.comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
IntComparator |
Int2ObjectLinkedOpenHashMap.comparator() |
IntComparator |
AbstractInt2ObjectSortedMap.KeySet.comparator() |
static IntComparator |
IntComparators.oppositeComparator(IntComparator c)
Returns a comparator representing the opposite order of the given comparator.
|
| 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 int |
IntHeaps.downHeap(int[] heap,
int size,
int i,
IntComparator c)
Moves the given element down into the heap until it reaches the lowest possible position.
|
static Comparator<? super Map.Entry<Integer,?>> |
Int2ObjectSortedMaps.entryComparator(IntComparator comparator)
Returns a comparator for entries based on a given comparator on keys.
|
static void |
IntHeaps.makeHeap(int[] heap,
int size,
IntComparator c)
Makes an array into a heap.
|
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 IntComparator |
IntComparators.oppositeComparator(IntComparator c)
Returns a comparator representing the opposite order of the given comparator.
|
static void |
IntArrays.parallelQuickSort(int[] x,
IntComparator comp)
Sorts an array according to the order induced by the specified
comparator using a parallel quicksort.
|
static void |
IntArrays.parallelQuickSort(int[] x,
int from,
int to,
IntComparator comp)
Sorts the specified range of elements according to the order induced by the specified
comparator using a parallel quicksort.
|
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.
|
static <V> Int2ObjectSortedMap<V> |
Int2ObjectSortedMaps.singleton(Integer key,
V value,
IntComparator comparator)
RETURNS a type-specific immutable sorted map containing only the specified pair.
|
static IntSortedSet |
IntSortedSets.singleton(int element,
IntComparator comparator)
Returns a type-specific immutable sorted set containing only the specified element, and using a specified comparator.
|
static <V> Int2ObjectSortedMap<V> |
Int2ObjectSortedMaps.singleton(int key,
V value,
IntComparator comparator)
Returns a type-specific immutable sorted map containing only the specified pair.
|
static IntSortedSet |
IntSortedSets.singleton(Object element,
IntComparator comparator)
Returns a type-specific immutable sorted set containing only the specified element, and using a specified comparator.
|
static int |
IntHeaps.upHeap(int[] heap,
int size,
int i,
IntComparator c)
Moves the given element up in the heap until it reaches the highest possible position.
|
| Constructor and Description |
|---|
ForkJoinQuickSortComp(int[] x,
int from,
int to,
IntComparator comp) |
OppositeComparator(IntComparator c) |
Singleton(int key,
V value,
IntComparator comparator) |
Copyright © 2016. All rights reserved.