Uses of Interface it.unimi.dsi.fastutil.ints.IntComparator (fastutil-object-short-maps 8.3.1 API)

Packages that use IntComparator
Package	Description
it.unimi.dsi.fastutil	Provides static data/methods used by all implementations and some non-type-specific classes that do not belong to `it.unimi.dsi.fastutil.objects`.
it.unimi.dsi.fastutil.ints	Provides type-specific classes for integer elements or keys.

Uses of IntComparator in it.unimi.dsi.fastutil

Methods in it.unimi.dsi.fastutil with parameters of type IntComparator
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.

Constructors in it.unimi.dsi.fastutil with parameters of type IntComparator
Constructor and Description
`ForkJoinGenericQuickSort(int from, int to, IntComparator comp, Swapper swapper)`

Uses of IntComparator in it.unimi.dsi.fastutil.ints

Classes in it.unimi.dsi.fastutil.ints that implement IntComparator
Modifier and Type	Class and Description
`class`	`AbstractIntComparator` Deprecated. As of fastutil 8 this class is no longer necessary, as its only previous abstract method is now a default method of the type-specific interface.
`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.

Fields in it.unimi.dsi.fastutil.ints declared as IntComparator
Modifier and Type	Field and Description
`protected IntComparator`	Int2LongRBTreeMap.`actualComparator` This map's actual comparator; it may differ from `Int2LongRBTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected IntComparator`	IntAVLTreeSet.`actualComparator` This set's actual comparator; it may differ from `IntAVLTreeSet.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected IntComparator`	Int2ReferenceRBTreeMap.`actualComparator` This map's actual comparator; it may differ from `Int2ReferenceRBTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected IntComparator`	IntRBTreeSet.`actualComparator` This set's actual comparator; it may differ from `IntRBTreeSet.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected IntComparator`	Int2CharAVLTreeMap.`actualComparator` This map's actual comparator; it may differ from `Int2CharAVLTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected IntComparator`	Int2ByteRBTreeMap.`actualComparator` This map's actual comparator; it may differ from `Int2ByteRBTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected IntComparator`	Int2IntAVLTreeMap.`actualComparator` This map's actual comparator; it may differ from `Int2IntAVLTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected IntComparator`	Int2ShortRBTreeMap.`actualComparator` This map's actual comparator; it may differ from `Int2ShortRBTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected IntComparator`	Int2ReferenceAVLTreeMap.`actualComparator` This map's actual comparator; it may differ from `Int2ReferenceAVLTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected IntComparator`	Int2IntRBTreeMap.`actualComparator` This map's actual comparator; it may differ from `Int2IntRBTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected IntComparator`	Int2DoubleRBTreeMap.`actualComparator` This map's actual comparator; it may differ from `Int2DoubleRBTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected IntComparator`	Int2FloatRBTreeMap.`actualComparator` This map's actual comparator; it may differ from `Int2FloatRBTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected IntComparator`	Int2ShortAVLTreeMap.`actualComparator` This map's actual comparator; it may differ from `Int2ShortAVLTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected IntComparator`	Int2BooleanRBTreeMap.`actualComparator` This map's actual comparator; it may differ from `Int2BooleanRBTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected IntComparator`	Int2ObjectRBTreeMap.`actualComparator` This map's actual comparator; it may differ from `Int2ObjectRBTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected IntComparator`	Int2LongAVLTreeMap.`actualComparator` This map's actual comparator; it may differ from `Int2LongAVLTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected IntComparator`	Int2CharRBTreeMap.`actualComparator` This map's actual comparator; it may differ from `Int2CharRBTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected IntComparator`	Int2FloatAVLTreeMap.`actualComparator` This map's actual comparator; it may differ from `Int2FloatAVLTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected IntComparator`	Int2BooleanAVLTreeMap.`actualComparator` This map's actual comparator; it may differ from `Int2BooleanAVLTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected IntComparator`	Int2DoubleAVLTreeMap.`actualComparator` This map's actual comparator; it may differ from `Int2DoubleAVLTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected IntComparator`	Int2ByteAVLTreeMap.`actualComparator` This map's actual comparator; it may differ from `Int2ByteAVLTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected IntComparator`	Int2ObjectAVLTreeMap.`actualComparator` This map's actual comparator; it may differ from `Int2ObjectAVLTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected IntComparator`	IntArrayPriorityQueue.`c` The type-specific comparator used in this queue.
`protected IntComparator`	IntHeapPriorityQueue.`c` The type-specific comparator used in this queue.
`protected IntComparator`	IntArrayIndirectPriorityQueue.`c` The type-specific comparator used in this queue.
`protected IntComparator`	IntHeapSemiIndirectPriorityQueue.`c` The type-specific comparator used in this queue.
`protected IntComparator`	Int2FloatSortedMaps.Singleton.`comparator`
`protected IntComparator`	Int2CharSortedMaps.Singleton.`comparator`
`protected IntComparator`	Int2ByteSortedMaps.Singleton.`comparator`
`protected IntComparator`	Int2ObjectSortedMaps.Singleton.`comparator`
`protected IntComparator`	Int2ShortSortedMaps.Singleton.`comparator`
`protected IntComparator`	Int2DoubleSortedMaps.Singleton.`comparator`
`protected IntComparator`	Int2ReferenceSortedMaps.Singleton.`comparator`
`protected IntComparator`	Int2LongSortedMaps.Singleton.`comparator`
`protected IntComparator`	Int2BooleanSortedMaps.Singleton.`comparator`
`protected IntComparator`	Int2IntSortedMaps.Singleton.`comparator`
`static IntComparator`	IntComparators.`NATURAL_COMPARATOR`
`static IntComparator`	IntComparators.`OPPOSITE_COMPARATOR`

Methods in it.unimi.dsi.fastutil.ints that return IntComparator
Modifier and Type	Method and Description
`static IntComparator`	IntComparators.`asIntComparator(Comparator<? super Integer> c)` Returns a type-specific comparator that is equivalent to the given comparator.
`IntComparator`	AbstractInt2IntSortedMap.KeySet.`comparator()`
`IntComparator`	AbstractInt2ObjectSortedMap.KeySet.`comparator()`
`IntComparator`	Int2LongRBTreeMap.`comparator()`
`IntComparator`	IntAVLTreeSet.`comparator()`
`IntComparator`	Int2ReferenceRBTreeMap.`comparator()`
`IntComparator`	Int2ObjectSortedMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`IntComparator`	Int2LongSortedMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`IntComparator`	IntLinkedOpenHashSet.`comparator()`
`IntComparator`	Int2ByteSortedMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`IntComparator`	Int2FloatSortedMaps.EmptySortedMap.`comparator()`
`IntComparator`	Int2FloatSortedMaps.Singleton.`comparator()`
`IntComparator`	Int2FloatSortedMaps.SynchronizedSortedMap.`comparator()`
`IntComparator`	Int2FloatSortedMaps.UnmodifiableSortedMap.`comparator()`
`IntComparator`	IntRBTreeSet.`comparator()`
`IntComparator`	Int2CharSortedMaps.EmptySortedMap.`comparator()`
`IntComparator`	Int2CharSortedMaps.Singleton.`comparator()`
`IntComparator`	Int2CharSortedMaps.SynchronizedSortedMap.`comparator()`
`IntComparator`	Int2CharSortedMaps.UnmodifiableSortedMap.`comparator()`
`IntComparator`	AbstractInt2ByteSortedMap.KeySet.`comparator()`
`IntComparator`	Int2DoubleLinkedOpenHashMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`IntComparator`	Int2FloatSortedMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`IntComparator`	Int2LongLinkedOpenHashMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`IntComparator`	IntArrayFIFOQueue.`comparator()` Returns the comparator associated with this priority queue, or null if it uses its elements' natural ordering.
`IntComparator`	Int2ByteSortedMaps.EmptySortedMap.`comparator()`
`IntComparator`	Int2ByteSortedMaps.Singleton.`comparator()`
`IntComparator`	Int2ByteSortedMaps.SynchronizedSortedMap.`comparator()`
`IntComparator`	Int2ByteSortedMaps.UnmodifiableSortedMap.`comparator()`
`IntComparator`	Int2ByteLinkedOpenHashMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`IntComparator`	IntArrayPriorityQueue.`comparator()`
`IntComparator`	Int2CharAVLTreeMap.`comparator()`
`IntComparator`	Int2ReferenceSortedMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`IntComparator`	Int2ObjectSortedMaps.EmptySortedMap.`comparator()`
`IntComparator`	Int2ObjectSortedMaps.Singleton.`comparator()`
`IntComparator`	Int2ObjectSortedMaps.SynchronizedSortedMap.`comparator()`
`IntComparator`	Int2ObjectSortedMaps.UnmodifiableSortedMap.`comparator()`
`IntComparator`	IntSortedSets.EmptySet.`comparator()`
`IntComparator`	IntSortedSets.Singleton.`comparator()`
`IntComparator`	IntSortedSets.SynchronizedSortedSet.`comparator()`
`IntComparator`	IntSortedSets.UnmodifiableSortedSet.`comparator()`
`IntComparator`	Int2ByteRBTreeMap.`comparator()`
`IntComparator`	Int2ShortSortedMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`IntComparator`	Int2IntSortedMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`IntComparator`	Int2IntAVLTreeMap.`comparator()`
`IntComparator`	Int2ShortRBTreeMap.`comparator()`
`IntComparator`	Int2ShortSortedMaps.EmptySortedMap.`comparator()`
`IntComparator`	Int2ShortSortedMaps.Singleton.`comparator()`
`IntComparator`	Int2ShortSortedMaps.SynchronizedSortedMap.`comparator()`
`IntComparator`	Int2ShortSortedMaps.UnmodifiableSortedMap.`comparator()`
`IntComparator`	Int2ReferenceAVLTreeMap.`comparator()`
`IntComparator`	Int2DoubleSortedMaps.EmptySortedMap.`comparator()`
`IntComparator`	Int2DoubleSortedMaps.Singleton.`comparator()`
`IntComparator`	Int2DoubleSortedMaps.SynchronizedSortedMap.`comparator()`
`IntComparator`	Int2DoubleSortedMaps.UnmodifiableSortedMap.`comparator()`
`IntComparator`	Int2IntRBTreeMap.`comparator()`
`IntComparator`	AbstractInt2LongSortedMap.KeySet.`comparator()`
`IntComparator`	Int2ReferenceSortedMaps.EmptySortedMap.`comparator()`
`IntComparator`	Int2ReferenceSortedMaps.Singleton.`comparator()`
`IntComparator`	Int2ReferenceSortedMaps.SynchronizedSortedMap.`comparator()`
`IntComparator`	Int2ReferenceSortedMaps.UnmodifiableSortedMap.`comparator()`
`IntComparator`	AbstractInt2FloatSortedMap.KeySet.`comparator()`
`IntComparator`	Int2DoubleRBTreeMap.`comparator()`
`IntComparator`	Int2DoubleSortedMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`IntComparator`	IntHeapPriorityQueue.`comparator()`
`IntComparator`	Int2LongSortedMaps.EmptySortedMap.`comparator()`
`IntComparator`	Int2LongSortedMaps.Singleton.`comparator()`
`IntComparator`	Int2LongSortedMaps.SynchronizedSortedMap.`comparator()`
`IntComparator`	Int2LongSortedMaps.UnmodifiableSortedMap.`comparator()`
`IntComparator`	Int2FloatRBTreeMap.`comparator()`
`IntComparator`	IntIndirectPriorityQueue.`comparator()` Returns the type-specific comparator associated with this queue.
`IntComparator`	Int2ShortAVLTreeMap.`comparator()`
`IntComparator`	IntPriorityQueues.SynchronizedPriorityQueue.`comparator()`
`IntComparator`	Int2BooleanLinkedOpenHashMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`IntComparator`	IntSortedSet.`comparator()`
`IntComparator`	IntArrayIndirectPriorityQueue.`comparator()`
`IntComparator`	Int2BooleanRBTreeMap.`comparator()`
`IntComparator`	AbstractInt2ShortSortedMap.KeySet.`comparator()`
`IntComparator`	Int2CharSortedMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`IntComparator`	Int2ObjectRBTreeMap.`comparator()`
`IntComparator`	AbstractInt2BooleanSortedMap.KeySet.`comparator()`
`IntComparator`	Int2LongAVLTreeMap.`comparator()`
`IntComparator`	AbstractInt2DoubleSortedMap.KeySet.`comparator()`
`IntComparator`	IntHeapSemiIndirectPriorityQueue.`comparator()`
`IntComparator`	Int2ObjectLinkedOpenHashMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`IntComparator`	Int2ReferenceLinkedOpenHashMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`IntComparator`	Int2CharRBTreeMap.`comparator()`
`IntComparator`	Int2FloatAVLTreeMap.`comparator()`
`IntComparator`	Int2BooleanAVLTreeMap.`comparator()`
`IntComparator`	AbstractInt2ReferenceSortedMap.KeySet.`comparator()`
`IntComparator`	Int2CharLinkedOpenHashMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`IntComparator`	Int2DoubleAVLTreeMap.`comparator()`
`IntComparator`	IntLinkedOpenCustomHashSet.`comparator()`
`IntComparator`	Int2ByteAVLTreeMap.`comparator()`
`IntComparator`	Int2BooleanSortedMaps.EmptySortedMap.`comparator()`
`IntComparator`	Int2BooleanSortedMaps.Singleton.`comparator()`
`IntComparator`	Int2BooleanSortedMaps.SynchronizedSortedMap.`comparator()`
`IntComparator`	Int2BooleanSortedMaps.UnmodifiableSortedMap.`comparator()`
`IntComparator`	Int2FloatLinkedOpenHashMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`IntComparator`	Int2BooleanSortedMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`IntComparator`	IntPriorityQueue.`comparator()` Returns the comparator associated with this priority queue, or null if it uses its elements' natural ordering.
`IntComparator`	Int2ShortLinkedOpenHashMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`IntComparator`	Int2ObjectAVLTreeMap.`comparator()`
`IntComparator`	AbstractInt2CharSortedMap.KeySet.`comparator()`
`IntComparator`	Int2IntLinkedOpenHashMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`IntComparator`	Int2IntSortedMaps.EmptySortedMap.`comparator()`
`IntComparator`	Int2IntSortedMaps.Singleton.`comparator()`
`IntComparator`	Int2IntSortedMaps.SynchronizedSortedMap.`comparator()`
`IntComparator`	Int2IntSortedMaps.UnmodifiableSortedMap.`comparator()`
`static IntComparator`	IntComparators.`oppositeComparator(IntComparator c)` Returns a comparator representing the opposite order of the given comparator.
`IntComparator`	IntComparators.NaturalImplicitComparator.`reversed()`
`IntComparator`	IntComparators.OppositeImplicitComparator.`reversed()`
`IntComparator`	IntComparators.OppositeComparator.`reversed()`
`default IntComparator`	IntComparator.`reversed()`
`default IntComparator`	IntComparator.`thenComparing(IntComparator second)` Return a new comparator that first uses this comparator, then uses the second comparator if this comparator compared the two elements as equal.

Methods in it.unimi.dsi.fastutil.ints with parameters of type IntComparator
Modifier and Type	Method and Description
`static long`	IntBigArrays.`binarySearch(int[][] a, int key, IntComparator c)` Searches a big array for the specified value using the binary search algorithm and a specified comparator.
`static long`	IntBigArrays.`binarySearch(int[][] a, long from, long to, int key, IntComparator c)` Searches a range of the specified big array for the specified value using the binary search algorithm and a specified comparator.
`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`	IntIndirectHeaps.`downHeap(int[] refArray, int[] heap, int[] inv, int size, int i, IntComparator c)` Moves the given element down into the indirect heap until it reaches the lowest possible position.
`static int`	IntSemiIndirectHeaps.`downHeap(int[] refArray, int[] heap, int size, int i, IntComparator c)` Moves the given element down into the semi-indirect heap until it reaches the lowest possible position.
`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,?>>`	Int2FloatSortedMaps.`entryComparator(IntComparator comparator)` Returns a comparator for entries based on a given comparator on keys.
`static Comparator<? super Map.Entry<Integer,?>>`	Int2CharSortedMaps.`entryComparator(IntComparator comparator)` Returns a comparator for entries based on a given comparator on keys.
`static Comparator<? super Map.Entry<Integer,?>>`	Int2ByteSortedMaps.`entryComparator(IntComparator comparator)` Returns a comparator for entries based on a given comparator on keys.
`static Comparator<? super Map.Entry<Integer,?>>`	Int2ObjectSortedMaps.`entryComparator(IntComparator comparator)` Returns a comparator for entries based on a given comparator on keys.
`static Comparator<? super Map.Entry<Integer,?>>`	Int2ShortSortedMaps.`entryComparator(IntComparator comparator)` Returns a comparator for entries based on a given comparator on keys.
`static Comparator<? super Map.Entry<Integer,?>>`	Int2DoubleSortedMaps.`entryComparator(IntComparator comparator)` Returns a comparator for entries based on a given comparator on keys.
`static Comparator<? super Map.Entry<Integer,?>>`	Int2ReferenceSortedMaps.`entryComparator(IntComparator comparator)` Returns a comparator for entries based on a given comparator on keys.
`static Comparator<? super Map.Entry<Integer,?>>`	Int2LongSortedMaps.`entryComparator(IntComparator comparator)` Returns a comparator for entries based on a given comparator on keys.
`static Comparator<? super Map.Entry<Integer,?>>`	Int2BooleanSortedMaps.`entryComparator(IntComparator comparator)` Returns a comparator for entries based on a given comparator on keys.
`static Comparator<? super Map.Entry<Integer,?>>`	Int2IntSortedMaps.`entryComparator(IntComparator comparator)` Returns a comparator for entries based on a given comparator on keys.
`static int`	IntSemiIndirectHeaps.`front(int[] refArray, int[] heap, int size, int[] a, IntComparator c)` Retrieves the front of a heap in a given array using a given comparator.
`static void`	IntIndirectHeaps.`makeHeap(int[] refArray, int[] heap, int[] inv, int size, IntComparator c)` Creates an indirect heap from a given index array.
`static void`	IntSemiIndirectHeaps.`makeHeap(int[] refArray, int[] heap, int size, IntComparator c)` Creates a semi-indirect heap from a given index array.
`static void`	IntHeaps.`makeHeap(int[] heap, int size, IntComparator c)` Makes an array into a heap.
`static void`	IntIndirectHeaps.`makeHeap(int[] refArray, int offset, int length, int[] heap, int[] inv, IntComparator c)` Creates an indirect heap in the given array.
`static void`	IntSemiIndirectHeaps.`makeHeap(int[] refArray, int offset, int length, int[] heap, IntComparator c)` Creates a semi-indirect heap in the given array.
`static int[]`	IntSemiIndirectHeaps.`makeHeap(int[] refArray, int offset, int length, IntComparator c)` Creates a semi-indirect heap, allocating its heap array.
`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`	IntBigArrays.`quickSort(int[][] x, IntComparator comp)` Sorts the specified big array according to the order induced by the specified comparator using quicksort.
`static void`	IntBigArrays.`quickSort(int[][] x, long from, long to, IntComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator using 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 Int2BooleanSortedMap`	Int2BooleanSortedMaps.`singleton(int key, boolean value, IntComparator comparator)` Returns a type-specific immutable sorted map containing only the specified pair.
`static Int2ByteSortedMap`	Int2ByteSortedMaps.`singleton(int key, byte value, IntComparator comparator)` Returns a type-specific immutable sorted map containing only the specified pair.
`static Int2CharSortedMap`	Int2CharSortedMaps.`singleton(int key, char value, IntComparator comparator)` Returns a type-specific immutable sorted map containing only the specified pair.
`static Int2DoubleSortedMap`	Int2DoubleSortedMaps.`singleton(int key, double value, IntComparator comparator)` Returns a type-specific immutable sorted map containing only the specified pair.
`static Int2BooleanSortedMap`	Int2BooleanSortedMaps.`singleton(Integer key, Boolean value, IntComparator comparator)` RETURNS a type-specific immutable sorted map containing only the specified pair.
`static Int2ByteSortedMap`	Int2ByteSortedMaps.`singleton(Integer key, Byte value, IntComparator comparator)` RETURNS a type-specific immutable sorted map containing only the specified pair.
`static Int2CharSortedMap`	Int2CharSortedMaps.`singleton(Integer key, Character value, IntComparator comparator)` RETURNS a type-specific immutable sorted map containing only the specified pair.
`static Int2DoubleSortedMap`	Int2DoubleSortedMaps.`singleton(Integer key, Double value, IntComparator comparator)` RETURNS a type-specific immutable sorted map containing only the specified pair.
`static Int2FloatSortedMap`	Int2FloatSortedMaps.`singleton(Integer key, Float value, IntComparator comparator)` RETURNS a type-specific immutable sorted map containing only the specified pair.
`static Int2IntSortedMap`	Int2IntSortedMaps.`singleton(Integer key, Integer value, IntComparator comparator)` RETURNS a type-specific immutable sorted map containing only the specified pair.
`static Int2LongSortedMap`	Int2LongSortedMaps.`singleton(Integer key, Long value, IntComparator comparator)` RETURNS a type-specific immutable sorted map containing only the specified pair.
`static Int2ShortSortedMap`	Int2ShortSortedMaps.`singleton(Integer key, Short value, IntComparator comparator)` RETURNS a type-specific immutable sorted map containing only the specified pair.
`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 <V> Int2ReferenceSortedMap<V>`	Int2ReferenceSortedMaps.`singleton(Integer key, V value, IntComparator comparator)` RETURNS a type-specific immutable sorted map containing only the specified pair.
`static Int2FloatSortedMap`	Int2FloatSortedMaps.`singleton(int key, float 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 Int2IntSortedMap`	Int2IntSortedMaps.`singleton(int key, int value, IntComparator comparator)` Returns a type-specific immutable sorted map containing only the specified pair.
`static Int2LongSortedMap`	Int2LongSortedMaps.`singleton(int key, long value, IntComparator comparator)` Returns a type-specific immutable sorted map containing only the specified pair.
`static Int2ShortSortedMap`	Int2ShortSortedMaps.`singleton(int key, short value, IntComparator comparator)` Returns a type-specific immutable sorted map containing only the specified pair.
`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 <V> Int2ReferenceSortedMap<V>`	Int2ReferenceSortedMaps.`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.
`void`	IntLists.EmptyList.`sort(IntComparator comparator)`
`void`	IntLists.Singleton.`sort(IntComparator comparator)`
`void`	IntLists.SynchronizedList.`sort(IntComparator comparator)`
`void`	IntLists.UnmodifiableList.`sort(IntComparator comparator)`
`void`	IntArrayList.`sort(IntComparator comp)`
`default void`	IntList.`sort(IntComparator comparator)` Sort a list using a type-specific comparator.
`static void`	IntArrays.`stableSort(int[] a, IntComparator comp)` Sorts an array according to the order induced by the specified comparator, potentially dynamically choosing an appropriate algorithm given the type and size of the array.
`static void`	IntArrays.`stableSort(int[] a, int from, int to, IntComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator, potentially dynamically choosing an appropriate algorithm given the type and size of the array.
`default IntComparator`	IntComparator.`thenComparing(IntComparator second)` Return a new comparator that first uses this comparator, then uses the second comparator if this comparator compared the two elements as equal.
`static void`	IntArrays.`unstableSort(int[] a, IntComparator comp)` Sorts an array according to the order induced by the specified comparator, potentially dynamically choosing an appropriate algorithm given the type and size of the array.
`static void`	IntArrays.`unstableSort(int[] a, int from, int to, IntComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator, potentially dynamically choosing an appropriate algorithm given the type and size of the array.
`void`	IntLists.EmptyList.`unstableSort(IntComparator comparator)`
`void`	IntLists.Singleton.`unstableSort(IntComparator comparator)`
`void`	IntLists.SynchronizedList.`unstableSort(IntComparator comparator)`
`void`	IntLists.UnmodifiableList.`unstableSort(IntComparator comparator)`
`void`	IntArrayList.`unstableSort(IntComparator comp)`
`default void`	IntList.`unstableSort(IntComparator comparator)` Sorts this list using a sort not assured to be stable.
`static int`	IntIndirectHeaps.`upHeap(int[] refArray, int[] heap, int[] inv, int size, int i, IntComparator c)` Moves the given element up in the indirect heap until it reaches the highest possible position.
`static int`	IntSemiIndirectHeaps.`upHeap(int[] refArray, int[] heap, int size, int i, IntComparator c)` Moves the given element up in the semi-indirect heap until it reaches the highest possible position.
`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.

Constructors in it.unimi.dsi.fastutil.ints with parameters of type IntComparator
Constructor and Description
`ForkJoinQuickSortComp(int[] x, int from, int to, IntComparator comp)`
`IntArrayIndirectPriorityQueue(int[] refArray, int[] a, IntComparator c)` Wraps a given array in a queue using a given comparator.
`IntArrayIndirectPriorityQueue(int[] refArray, int[] a, int size, IntComparator c)` Wraps a given array in a queue using a given comparator.
`IntArrayIndirectPriorityQueue(int[] refArray, IntComparator c)` Creates a new empty queue with capacity equal to the length of the reference array and a given comparator.
`IntArrayIndirectPriorityQueue(int[] refArray, int capacity, IntComparator c)` Creates a new empty queue without elements with a given capacity and comparator.
`IntArrayPriorityQueue(int[] a, IntComparator c)` Wraps a given array in a queue using a given comparator.
`IntArrayPriorityQueue(int[] a, int size, IntComparator c)` Wraps a given array in a queue using a given comparator.
`IntArrayPriorityQueue(IntComparator c)` Creates a new empty queue with a given comparator.
`IntArrayPriorityQueue(int capacity, IntComparator c)` Creates a new empty queue with a given capacity and comparator.
`IntHeapIndirectPriorityQueue(int[] refArray, int[] a, IntComparator c)` Wraps a given array in a queue using a given comparator.
`IntHeapIndirectPriorityQueue(int[] refArray, int[] a, int size, IntComparator c)` Wraps a given array in a queue using a given comparator.
`IntHeapIndirectPriorityQueue(int[] refArray, IntComparator c)` Creates a new empty queue with capacity equal to the length of the reference array and a given comparator.
`IntHeapIndirectPriorityQueue(int[] refArray, int capacity, IntComparator c)` Creates a new empty queue with a given capacity and comparator.
`IntHeapPriorityQueue(Collection<? extends Integer> collection, IntComparator c)` Creates a queue using the elements in a collection using a given comparator.
`IntHeapPriorityQueue(int[] a, IntComparator c)` Wraps a given array in a queue using a given comparator.
`IntHeapPriorityQueue(int[] a, int size, IntComparator c)` Wraps a given array in a queue using a given comparator.
`IntHeapPriorityQueue(IntCollection collection, IntComparator c)` Creates a queue using the elements in a type-specific collection using a given comparator.
`IntHeapPriorityQueue(IntComparator c)` Creates a new empty queue with a given comparator.
`IntHeapPriorityQueue(int capacity, IntComparator c)` Creates a new empty queue with a given capacity and comparator.
`IntHeapSemiIndirectPriorityQueue(int[] refArray, int[] a, IntComparator c)` Wraps a given array in a queue using a given comparator.
`IntHeapSemiIndirectPriorityQueue(int[] refArray, int[] a, int size, IntComparator c)` Wraps a given array in a queue using a given comparator.
`IntHeapSemiIndirectPriorityQueue(int[] refArray, IntComparator c)` Creates a new empty queue with capacity equal to the length of the reference array and a given comparator.
`IntHeapSemiIndirectPriorityQueue(int[] refArray, int capacity, IntComparator c)` Creates a new empty queue without elements with a given capacity and comparator.
`OppositeComparator(IntComparator c)`
`Singleton(int key, boolean value, IntComparator comparator)`
`Singleton(int key, byte value, IntComparator comparator)`
`Singleton(int key, char value, IntComparator comparator)`
`Singleton(int key, double value, IntComparator comparator)`
`Singleton(int key, float value, IntComparator comparator)`
`Singleton(int element, IntComparator comparator)`
`Singleton(int key, int value, IntComparator comparator)`
`Singleton(int key, long value, IntComparator comparator)`
`Singleton(int key, short value, IntComparator comparator)`
`Singleton(int key, V value, IntComparator comparator)`
`Singleton(int key, V value, IntComparator comparator)`

Uses of Interfaceit.unimi.dsi.fastutil.ints.IntComparator

Uses of IntComparator in it.unimi.dsi.fastutil

Uses of IntComparator in it.unimi.dsi.fastutil.ints

Uses of Interface
it.unimi.dsi.fastutil.ints.IntComparator