Uses of Interface it.unimi.dsi.fastutil.longs.LongComparator (fastutil-object-common 8.3.1 API)

Packages that use LongComparator
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.longs	Provides type-specific classes for long elements or keys.

Uses of LongComparator in it.unimi.dsi.fastutil

Methods in it.unimi.dsi.fastutil with parameters of type LongComparator
Modifier and Type	Method and Description
`static void`	BigArrays.`mergeSort(long from, long to, LongComparator comp, BigSwapper swapper)` Sorts the specified range of elements using the specified big swapper and according to the order induced by the specified comparator using mergesort.
`static void`	BigArrays.`quickSort(long from, long to, LongComparator comp, BigSwapper swapper)` Sorts the specified range of elements using the specified big swapper and according to the order induced by the specified comparator using quicksort.

Uses of LongComparator in it.unimi.dsi.fastutil.longs

Classes in it.unimi.dsi.fastutil.longs that implement LongComparator
Modifier and Type	Class and Description
`class`	`AbstractLongComparator` 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`	`LongComparators.NaturalImplicitComparator` A type-specific comparator mimicking the natural order.
`protected static class`	`LongComparators.OppositeComparator`
`protected static class`	`LongComparators.OppositeImplicitComparator` A type-specific comparator mimicking the opposite of the natural order.

Fields in it.unimi.dsi.fastutil.longs declared as LongComparator
Modifier and Type	Field and Description
`protected LongComparator`	Long2ReferenceRBTreeMap.`actualComparator` This map's actual comparator; it may differ from `Long2ReferenceRBTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected LongComparator`	Long2IntAVLTreeMap.`actualComparator` This map's actual comparator; it may differ from `Long2IntAVLTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected LongComparator`	Long2LongRBTreeMap.`actualComparator` This map's actual comparator; it may differ from `Long2LongRBTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected LongComparator`	Long2DoubleRBTreeMap.`actualComparator` This map's actual comparator; it may differ from `Long2DoubleRBTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected LongComparator`	Long2BooleanAVLTreeMap.`actualComparator` This map's actual comparator; it may differ from `Long2BooleanAVLTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected LongComparator`	Long2CharRBTreeMap.`actualComparator` This map's actual comparator; it may differ from `Long2CharRBTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected LongComparator`	Long2FloatRBTreeMap.`actualComparator` This map's actual comparator; it may differ from `Long2FloatRBTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected LongComparator`	Long2ShortRBTreeMap.`actualComparator` This map's actual comparator; it may differ from `Long2ShortRBTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected LongComparator`	Long2ByteAVLTreeMap.`actualComparator` This map's actual comparator; it may differ from `Long2ByteAVLTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected LongComparator`	Long2ByteRBTreeMap.`actualComparator` This map's actual comparator; it may differ from `Long2ByteRBTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected LongComparator`	Long2CharAVLTreeMap.`actualComparator` This map's actual comparator; it may differ from `Long2CharAVLTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected LongComparator`	LongAVLTreeSet.`actualComparator` This set's actual comparator; it may differ from `LongAVLTreeSet.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected LongComparator`	Long2DoubleAVLTreeMap.`actualComparator` This map's actual comparator; it may differ from `Long2DoubleAVLTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected LongComparator`	Long2FloatAVLTreeMap.`actualComparator` This map's actual comparator; it may differ from `Long2FloatAVLTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected LongComparator`	LongRBTreeSet.`actualComparator` This set's actual comparator; it may differ from `LongRBTreeSet.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected LongComparator`	Long2LongAVLTreeMap.`actualComparator` This map's actual comparator; it may differ from `Long2LongAVLTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected LongComparator`	Long2ShortAVLTreeMap.`actualComparator` This map's actual comparator; it may differ from `Long2ShortAVLTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected LongComparator`	Long2BooleanRBTreeMap.`actualComparator` This map's actual comparator; it may differ from `Long2BooleanRBTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected LongComparator`	Long2ObjectAVLTreeMap.`actualComparator` This map's actual comparator; it may differ from `Long2ObjectAVLTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected LongComparator`	Long2ObjectRBTreeMap.`actualComparator` This map's actual comparator; it may differ from `Long2ObjectRBTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected LongComparator`	Long2ReferenceAVLTreeMap.`actualComparator` This map's actual comparator; it may differ from `Long2ReferenceAVLTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected LongComparator`	Long2IntRBTreeMap.`actualComparator` This map's actual comparator; it may differ from `Long2IntRBTreeMap.storedComparator` because it is always a type-specific comparator, so it could be derived from the former by wrapping.
`protected LongComparator`	LongArrayPriorityQueue.`c` The type-specific comparator used in this queue.
`protected LongComparator`	LongHeapSemiIndirectPriorityQueue.`c` The type-specific comparator used in this queue.
`protected LongComparator`	LongArrayIndirectPriorityQueue.`c` The type-specific comparator used in this queue.
`protected LongComparator`	LongHeapPriorityQueue.`c` The type-specific comparator used in this queue.
`protected LongComparator`	Long2ByteSortedMaps.Singleton.`comparator`
`protected LongComparator`	Long2ShortSortedMaps.Singleton.`comparator`
`protected LongComparator`	Long2FloatSortedMaps.Singleton.`comparator`
`protected LongComparator`	Long2ReferenceSortedMaps.Singleton.`comparator`
`protected LongComparator`	Long2CharSortedMaps.Singleton.`comparator`
`protected LongComparator`	Long2BooleanSortedMaps.Singleton.`comparator`
`protected LongComparator`	Long2ObjectSortedMaps.Singleton.`comparator`
`protected LongComparator`	Long2DoubleSortedMaps.Singleton.`comparator`
`protected LongComparator`	Long2IntSortedMaps.Singleton.`comparator`
`protected LongComparator`	Long2LongSortedMaps.Singleton.`comparator`
`static LongComparator`	LongComparators.`NATURAL_COMPARATOR`
`static LongComparator`	LongComparators.`OPPOSITE_COMPARATOR`

Methods in it.unimi.dsi.fastutil.longs that return LongComparator
Modifier and Type	Method and Description
`static LongComparator`	LongComparators.`asLongComparator(Comparator<? super Long> c)` Returns a type-specific comparator that is equivalent to the given comparator.
`LongComparator`	LongPriorityQueue.`comparator()` Returns the comparator associated with this priority queue, or null if it uses its elements' natural ordering.
`LongComparator`	Long2ByteSortedMaps.EmptySortedMap.`comparator()`
`LongComparator`	Long2ByteSortedMaps.Singleton.`comparator()`
`LongComparator`	Long2ByteSortedMaps.SynchronizedSortedMap.`comparator()`
`LongComparator`	Long2ByteSortedMaps.UnmodifiableSortedMap.`comparator()`
`LongComparator`	Long2ReferenceRBTreeMap.`comparator()`
`LongComparator`	AbstractLong2ByteSortedMap.KeySet.`comparator()`
`LongComparator`	Long2ShortSortedMaps.EmptySortedMap.`comparator()`
`LongComparator`	Long2ShortSortedMaps.Singleton.`comparator()`
`LongComparator`	Long2ShortSortedMaps.SynchronizedSortedMap.`comparator()`
`LongComparator`	Long2ShortSortedMaps.UnmodifiableSortedMap.`comparator()`
`LongComparator`	Long2CharSortedMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`LongComparator`	Long2IntAVLTreeMap.`comparator()`
`LongComparator`	LongSortedSets.EmptySet.`comparator()`
`LongComparator`	LongSortedSets.Singleton.`comparator()`
`LongComparator`	LongSortedSets.SynchronizedSortedSet.`comparator()`
`LongComparator`	LongSortedSets.UnmodifiableSortedSet.`comparator()`
`LongComparator`	LongArrayFIFOQueue.`comparator()` Returns the comparator associated with this priority queue, or null if it uses its elements' natural ordering.
`LongComparator`	Long2IntSortedMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`LongComparator`	LongArrayPriorityQueue.`comparator()`
`LongComparator`	Long2LongRBTreeMap.`comparator()`
`LongComparator`	LongHeapSemiIndirectPriorityQueue.`comparator()`
`LongComparator`	AbstractLong2CharSortedMap.KeySet.`comparator()`
`LongComparator`	Long2ByteSortedMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`LongComparator`	Long2DoubleRBTreeMap.`comparator()`
`LongComparator`	LongLinkedOpenCustomHashSet.`comparator()`
`LongComparator`	LongIndirectPriorityQueue.`comparator()` Returns the type-specific comparator associated with this queue.
`LongComparator`	Long2BooleanAVLTreeMap.`comparator()`
`LongComparator`	Long2FloatSortedMaps.EmptySortedMap.`comparator()`
`LongComparator`	Long2FloatSortedMaps.Singleton.`comparator()`
`LongComparator`	Long2FloatSortedMaps.SynchronizedSortedMap.`comparator()`
`LongComparator`	Long2FloatSortedMaps.UnmodifiableSortedMap.`comparator()`
`LongComparator`	Long2ReferenceSortedMaps.EmptySortedMap.`comparator()`
`LongComparator`	Long2ReferenceSortedMaps.Singleton.`comparator()`
`LongComparator`	Long2ReferenceSortedMaps.SynchronizedSortedMap.`comparator()`
`LongComparator`	Long2ReferenceSortedMaps.UnmodifiableSortedMap.`comparator()`
`LongComparator`	Long2IntLinkedOpenHashMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`LongComparator`	Long2CharRBTreeMap.`comparator()`
`LongComparator`	Long2ByteLinkedOpenHashMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`LongComparator`	Long2CharSortedMaps.EmptySortedMap.`comparator()`
`LongComparator`	Long2CharSortedMaps.Singleton.`comparator()`
`LongComparator`	Long2CharSortedMaps.SynchronizedSortedMap.`comparator()`
`LongComparator`	Long2CharSortedMaps.UnmodifiableSortedMap.`comparator()`
`LongComparator`	Long2ShortLinkedOpenHashMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`LongComparator`	Long2FloatRBTreeMap.`comparator()`
`LongComparator`	Long2ReferenceSortedMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`LongComparator`	Long2ShortRBTreeMap.`comparator()`
`LongComparator`	Long2ObjectLinkedOpenHashMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`LongComparator`	Long2LongSortedMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`LongComparator`	Long2ByteAVLTreeMap.`comparator()`
`LongComparator`	Long2CharLinkedOpenHashMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`LongComparator`	Long2BooleanLinkedOpenHashMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`LongComparator`	Long2ByteRBTreeMap.`comparator()`
`LongComparator`	AbstractLong2ObjectSortedMap.KeySet.`comparator()`
`LongComparator`	AbstractLong2ShortSortedMap.KeySet.`comparator()`
`LongComparator`	Long2BooleanSortedMaps.EmptySortedMap.`comparator()`
`LongComparator`	Long2BooleanSortedMaps.Singleton.`comparator()`
`LongComparator`	Long2BooleanSortedMaps.SynchronizedSortedMap.`comparator()`
`LongComparator`	Long2BooleanSortedMaps.UnmodifiableSortedMap.`comparator()`
`LongComparator`	Long2CharAVLTreeMap.`comparator()`
`LongComparator`	Long2ObjectSortedMaps.EmptySortedMap.`comparator()`
`LongComparator`	Long2ObjectSortedMaps.Singleton.`comparator()`
`LongComparator`	Long2ObjectSortedMaps.SynchronizedSortedMap.`comparator()`
`LongComparator`	Long2ObjectSortedMaps.UnmodifiableSortedMap.`comparator()`
`LongComparator`	Long2FloatLinkedOpenHashMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`LongComparator`	AbstractLong2FloatSortedMap.KeySet.`comparator()`
`LongComparator`	LongAVLTreeSet.`comparator()`
`LongComparator`	AbstractLong2LongSortedMap.KeySet.`comparator()`
`LongComparator`	Long2DoubleSortedMaps.EmptySortedMap.`comparator()`
`LongComparator`	Long2DoubleSortedMaps.Singleton.`comparator()`
`LongComparator`	Long2DoubleSortedMaps.SynchronizedSortedMap.`comparator()`
`LongComparator`	Long2DoubleSortedMaps.UnmodifiableSortedMap.`comparator()`
`LongComparator`	Long2BooleanSortedMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`LongComparator`	LongArrayIndirectPriorityQueue.`comparator()`
`LongComparator`	Long2DoubleAVLTreeMap.`comparator()`
`LongComparator`	LongLinkedOpenHashSet.`comparator()`
`LongComparator`	Long2FloatSortedMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`LongComparator`	Long2FloatAVLTreeMap.`comparator()`
`LongComparator`	Long2DoubleLinkedOpenHashMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`LongComparator`	Long2DoubleSortedMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`LongComparator`	LongSortedSet.`comparator()`
`LongComparator`	LongRBTreeSet.`comparator()`
`LongComparator`	LongHeapPriorityQueue.`comparator()`
`LongComparator`	Long2IntSortedMaps.EmptySortedMap.`comparator()`
`LongComparator`	Long2IntSortedMaps.Singleton.`comparator()`
`LongComparator`	Long2IntSortedMaps.SynchronizedSortedMap.`comparator()`
`LongComparator`	Long2IntSortedMaps.UnmodifiableSortedMap.`comparator()`
`LongComparator`	Long2LongAVLTreeMap.`comparator()`
`LongComparator`	Long2ShortAVLTreeMap.`comparator()`
`LongComparator`	LongPriorityQueues.SynchronizedPriorityQueue.`comparator()`
`LongComparator`	Long2LongLinkedOpenHashMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`LongComparator`	Long2BooleanRBTreeMap.`comparator()`
`LongComparator`	Long2ObjectAVLTreeMap.`comparator()`
`LongComparator`	Long2ObjectSortedMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`LongComparator`	Long2ShortSortedMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`LongComparator`	Long2LongSortedMaps.EmptySortedMap.`comparator()`
`LongComparator`	Long2LongSortedMaps.Singleton.`comparator()`
`LongComparator`	Long2LongSortedMaps.SynchronizedSortedMap.`comparator()`
`LongComparator`	Long2LongSortedMaps.UnmodifiableSortedMap.`comparator()`
`LongComparator`	AbstractLong2BooleanSortedMap.KeySet.`comparator()`
`LongComparator`	Long2ReferenceLinkedOpenHashMap.`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`LongComparator`	Long2ObjectRBTreeMap.`comparator()`
`LongComparator`	AbstractLong2ReferenceSortedMap.KeySet.`comparator()`
`LongComparator`	AbstractLong2DoubleSortedMap.KeySet.`comparator()`
`LongComparator`	Long2ReferenceAVLTreeMap.`comparator()`
`LongComparator`	AbstractLong2IntSortedMap.KeySet.`comparator()`
`LongComparator`	Long2IntRBTreeMap.`comparator()`
`static LongComparator`	LongComparators.`oppositeComparator(LongComparator c)` Returns a comparator representing the opposite order of the given comparator.
`LongComparator`	LongComparators.NaturalImplicitComparator.`reversed()`
`LongComparator`	LongComparators.OppositeImplicitComparator.`reversed()`
`LongComparator`	LongComparators.OppositeComparator.`reversed()`
`default LongComparator`	LongComparator.`reversed()`
`default LongComparator`	LongComparator.`thenComparing(LongComparator 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.longs with parameters of type LongComparator
Modifier and Type	Method and Description
`static long`	LongBigArrays.`binarySearch(long[][] a, long key, LongComparator c)` Searches a big array for the specified value using the binary search algorithm and a specified comparator.
`static long`	LongBigArrays.`binarySearch(long[][] a, long from, long to, long key, LongComparator c)` Searches a range of the specified big array for the specified value using the binary search algorithm and a specified comparator.
`static int`	LongArrays.`binarySearch(long[] a, int from, int to, long key, LongComparator c)` Searches a range of the specified array for the specified value using the binary search algorithm and a specified comparator.
`static int`	LongArrays.`binarySearch(long[] a, long key, LongComparator c)` Searches an array for the specified value using the binary search algorithm and a specified comparator.
`static int`	LongIndirectHeaps.`downHeap(long[] refArray, int[] heap, int[] inv, int size, int i, LongComparator c)` Moves the given element down into the indirect heap until it reaches the lowest possible position.
`static int`	LongSemiIndirectHeaps.`downHeap(long[] refArray, int[] heap, int size, int i, LongComparator c)` Moves the given element down into the semi-indirect heap until it reaches the lowest possible position.
`static int`	LongHeaps.`downHeap(long[] heap, int size, int i, LongComparator c)` Moves the given element down into the heap until it reaches the lowest possible position.
`static Comparator<? super Map.Entry<Long,?>>`	Long2ByteSortedMaps.`entryComparator(LongComparator comparator)` Returns a comparator for entries based on a given comparator on keys.
`static Comparator<? super Map.Entry<Long,?>>`	Long2ShortSortedMaps.`entryComparator(LongComparator comparator)` Returns a comparator for entries based on a given comparator on keys.
`static Comparator<? super Map.Entry<Long,?>>`	Long2FloatSortedMaps.`entryComparator(LongComparator comparator)` Returns a comparator for entries based on a given comparator on keys.
`static Comparator<? super Map.Entry<Long,?>>`	Long2ReferenceSortedMaps.`entryComparator(LongComparator comparator)` Returns a comparator for entries based on a given comparator on keys.
`static Comparator<? super Map.Entry<Long,?>>`	Long2CharSortedMaps.`entryComparator(LongComparator comparator)` Returns a comparator for entries based on a given comparator on keys.
`static Comparator<? super Map.Entry<Long,?>>`	Long2BooleanSortedMaps.`entryComparator(LongComparator comparator)` Returns a comparator for entries based on a given comparator on keys.
`static Comparator<? super Map.Entry<Long,?>>`	Long2ObjectSortedMaps.`entryComparator(LongComparator comparator)` Returns a comparator for entries based on a given comparator on keys.
`static Comparator<? super Map.Entry<Long,?>>`	Long2DoubleSortedMaps.`entryComparator(LongComparator comparator)` Returns a comparator for entries based on a given comparator on keys.
`static Comparator<? super Map.Entry<Long,?>>`	Long2IntSortedMaps.`entryComparator(LongComparator comparator)` Returns a comparator for entries based on a given comparator on keys.
`static Comparator<? super Map.Entry<Long,?>>`	Long2LongSortedMaps.`entryComparator(LongComparator comparator)` Returns a comparator for entries based on a given comparator on keys.
`static int`	LongSemiIndirectHeaps.`front(long[] refArray, int[] heap, int size, int[] a, LongComparator c)` Retrieves the front of a heap in a given array using a given comparator.
`static void`	LongIndirectHeaps.`makeHeap(long[] refArray, int[] heap, int[] inv, int size, LongComparator c)` Creates an indirect heap from a given index array.
`static void`	LongSemiIndirectHeaps.`makeHeap(long[] refArray, int[] heap, int size, LongComparator c)` Creates a semi-indirect heap from a given index array.
`static void`	LongIndirectHeaps.`makeHeap(long[] refArray, int offset, int length, int[] heap, int[] inv, LongComparator c)` Creates an indirect heap in the given array.
`static void`	LongSemiIndirectHeaps.`makeHeap(long[] refArray, int offset, int length, int[] heap, LongComparator c)` Creates a semi-indirect heap in the given array.
`static int[]`	LongSemiIndirectHeaps.`makeHeap(long[] refArray, int offset, int length, LongComparator c)` Creates a semi-indirect heap, allocating its heap array.
`static void`	LongHeaps.`makeHeap(long[] heap, int size, LongComparator c)` Makes an array into a heap.
`static void`	LongArrays.`mergeSort(long[] a, int from, int to, LongComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator using mergesort.
`static void`	LongArrays.`mergeSort(long[] a, int from, int to, LongComparator comp, long[] 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`	LongArrays.`mergeSort(long[] a, LongComparator comp)` Sorts an array according to the order induced by the specified comparator using mergesort.
`static LongComparator`	LongComparators.`oppositeComparator(LongComparator c)` Returns a comparator representing the opposite order of the given comparator.
`static void`	LongArrays.`parallelQuickSort(long[] x, int from, int to, LongComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator using a parallel quicksort.
`static void`	LongArrays.`parallelQuickSort(long[] x, LongComparator comp)` Sorts an array according to the order induced by the specified comparator using a parallel quicksort.
`static void`	LongBigArrays.`quickSort(long[][] x, LongComparator comp)` Sorts the specified big array according to the order induced by the specified comparator using quicksort.
`static void`	LongBigArrays.`quickSort(long[][] x, long from, long to, LongComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator using quicksort.
`static void`	LongArrays.`quickSort(long[] x, int from, int to, LongComparator comp)` Sorts the specified range of elements according to the order induced by the specified comparator using quicksort.
`static void`	LongArrays.`quickSort(long[] x, LongComparator comp)` Sorts an array according to the order induced by the specified comparator using quicksort.
`static Long2BooleanSortedMap`	Long2BooleanSortedMaps.`singleton(long key, boolean value, LongComparator comparator)` Returns a type-specific immutable sorted map containing only the specified pair.
`static Long2BooleanSortedMap`	Long2BooleanSortedMaps.`singleton(Long key, Boolean value, LongComparator comparator)` RETURNS a type-specific immutable sorted map containing only the specified pair.
`static Long2ByteSortedMap`	Long2ByteSortedMaps.`singleton(long key, byte value, LongComparator comparator)` Returns a type-specific immutable sorted map containing only the specified pair.
`static Long2ByteSortedMap`	Long2ByteSortedMaps.`singleton(Long key, Byte value, LongComparator comparator)` RETURNS a type-specific immutable sorted map containing only the specified pair.
`static Long2CharSortedMap`	Long2CharSortedMaps.`singleton(Long key, Character value, LongComparator comparator)` RETURNS a type-specific immutable sorted map containing only the specified pair.
`static Long2CharSortedMap`	Long2CharSortedMaps.`singleton(long key, char value, LongComparator comparator)` Returns a type-specific immutable sorted map containing only the specified pair.
`static Long2DoubleSortedMap`	Long2DoubleSortedMaps.`singleton(long key, double value, LongComparator comparator)` Returns a type-specific immutable sorted map containing only the specified pair.
`static Long2DoubleSortedMap`	Long2DoubleSortedMaps.`singleton(Long key, Double value, LongComparator comparator)` RETURNS a type-specific immutable sorted map containing only the specified pair.
`static Long2FloatSortedMap`	Long2FloatSortedMaps.`singleton(long key, float value, LongComparator comparator)` Returns a type-specific immutable sorted map containing only the specified pair.
`static Long2FloatSortedMap`	Long2FloatSortedMaps.`singleton(Long key, Float value, LongComparator comparator)` RETURNS a type-specific immutable sorted map containing only the specified pair.
`static Long2IntSortedMap`	Long2IntSortedMaps.`singleton(Long key, Integer value, LongComparator comparator)` RETURNS a type-specific immutable sorted map containing only the specified pair.
`static Long2IntSortedMap`	Long2IntSortedMaps.`singleton(long key, int value, LongComparator comparator)` Returns a type-specific immutable sorted map containing only the specified pair.
`static LongSortedSet`	LongSortedSets.`singleton(long element, LongComparator comparator)` Returns a type-specific immutable sorted set containing only the specified element, and using a specified comparator.
`static Long2LongSortedMap`	Long2LongSortedMaps.`singleton(long key, long value, LongComparator comparator)` Returns a type-specific immutable sorted map containing only the specified pair.
`static Long2LongSortedMap`	Long2LongSortedMaps.`singleton(Long key, Long value, LongComparator comparator)` RETURNS a type-specific immutable sorted map containing only the specified pair.
`static Long2ShortSortedMap`	Long2ShortSortedMaps.`singleton(long key, short value, LongComparator comparator)` Returns a type-specific immutable sorted map containing only the specified pair.
`static Long2ShortSortedMap`	Long2ShortSortedMaps.`singleton(Long key, Short value, LongComparator comparator)` RETURNS a type-specific immutable sorted map containing only the specified pair.
`static <V> Long2ReferenceSortedMap<V>`	Long2ReferenceSortedMaps.`singleton(long key, V value, LongComparator comparator)` Returns a type-specific immutable sorted map containing only the specified pair.
`static <V> Long2ObjectSortedMap<V>`	Long2ObjectSortedMaps.`singleton(long key, V value, LongComparator comparator)` Returns a type-specific immutable sorted map containing only the specified pair.
`static <V> Long2ReferenceSortedMap<V>`	Long2ReferenceSortedMaps.`singleton(Long key, V value, LongComparator comparator)` RETURNS a type-specific immutable sorted map containing only the specified pair.
`static <V> Long2ObjectSortedMap<V>`	Long2ObjectSortedMaps.`singleton(Long key, V value, LongComparator comparator)` RETURNS a type-specific immutable sorted map containing only the specified pair.
`static LongSortedSet`	LongSortedSets.`singleton(Object element, LongComparator comparator)` Returns a type-specific immutable sorted set containing only the specified element, and using a specified comparator.
`void`	LongLists.EmptyList.`sort(LongComparator comparator)`
`void`	LongLists.Singleton.`sort(LongComparator comparator)`
`void`	LongLists.SynchronizedList.`sort(LongComparator comparator)`
`void`	LongLists.UnmodifiableList.`sort(LongComparator comparator)`
`default void`	LongList.`sort(LongComparator comparator)` Sort a list using a type-specific comparator.
`void`	LongArrayList.`sort(LongComparator comp)`
`static void`	LongArrays.`stableSort(long[] a, int from, int to, LongComparator 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.
`static void`	LongArrays.`stableSort(long[] a, LongComparator 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.
`default LongComparator`	LongComparator.`thenComparing(LongComparator 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`	LongArrays.`unstableSort(long[] a, int from, int to, LongComparator 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.
`static void`	LongArrays.`unstableSort(long[] a, LongComparator 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.
`void`	LongLists.EmptyList.`unstableSort(LongComparator comparator)`
`void`	LongLists.Singleton.`unstableSort(LongComparator comparator)`
`void`	LongLists.SynchronizedList.`unstableSort(LongComparator comparator)`
`void`	LongLists.UnmodifiableList.`unstableSort(LongComparator comparator)`
`default void`	LongList.`unstableSort(LongComparator comparator)` Sorts this list using a sort not assured to be stable.
`void`	LongArrayList.`unstableSort(LongComparator comp)`
`static int`	LongIndirectHeaps.`upHeap(long[] refArray, int[] heap, int[] inv, int size, int i, LongComparator c)` Moves the given element up in the indirect heap until it reaches the highest possible position.
`static int`	LongSemiIndirectHeaps.`upHeap(long[] refArray, int[] heap, int size, int i, LongComparator c)` Moves the given element up in the semi-indirect heap until it reaches the highest possible position.
`static int`	LongHeaps.`upHeap(long[] heap, int size, int i, LongComparator c)` Moves the given element up in the heap until it reaches the highest possible position.

Constructors in it.unimi.dsi.fastutil.longs with parameters of type LongComparator
Constructor and Description
`ForkJoinQuickSortComp(long[] x, int from, int to, LongComparator comp)`
`LongArrayIndirectPriorityQueue(long[] refArray, int[] a, int size, LongComparator c)` Wraps a given array in a queue using a given comparator.
`LongArrayIndirectPriorityQueue(long[] refArray, int[] a, LongComparator c)` Wraps a given array in a queue using a given comparator.
`LongArrayIndirectPriorityQueue(long[] refArray, int capacity, LongComparator c)` Creates a new empty queue without elements with a given capacity and comparator.
`LongArrayIndirectPriorityQueue(long[] refArray, LongComparator c)` Creates a new empty queue with capacity equal to the length of the reference array and a given comparator.
`LongArrayPriorityQueue(int capacity, LongComparator c)` Creates a new empty queue with a given capacity and comparator.
`LongArrayPriorityQueue(long[] a, int size, LongComparator c)` Wraps a given array in a queue using a given comparator.
`LongArrayPriorityQueue(long[] a, LongComparator c)` Wraps a given array in a queue using a given comparator.
`LongArrayPriorityQueue(LongComparator c)` Creates a new empty queue with a given comparator.
`LongHeapIndirectPriorityQueue(long[] refArray, int[] a, int size, LongComparator c)` Wraps a given array in a queue using a given comparator.
`LongHeapIndirectPriorityQueue(long[] refArray, int[] a, LongComparator c)` Wraps a given array in a queue using a given comparator.
`LongHeapIndirectPriorityQueue(long[] refArray, int capacity, LongComparator c)` Creates a new empty queue with a given capacity and comparator.
`LongHeapIndirectPriorityQueue(long[] refArray, LongComparator c)` Creates a new empty queue with capacity equal to the length of the reference array and a given comparator.
`LongHeapPriorityQueue(Collection<? extends Long> collection, LongComparator c)` Creates a queue using the elements in a collection using a given comparator.
`LongHeapPriorityQueue(int capacity, LongComparator c)` Creates a new empty queue with a given capacity and comparator.
`LongHeapPriorityQueue(long[] a, int size, LongComparator c)` Wraps a given array in a queue using a given comparator.
`LongHeapPriorityQueue(long[] a, LongComparator c)` Wraps a given array in a queue using a given comparator.
`LongHeapPriorityQueue(LongCollection collection, LongComparator c)` Creates a queue using the elements in a type-specific collection using a given comparator.
`LongHeapPriorityQueue(LongComparator c)` Creates a new empty queue with a given comparator.
`LongHeapSemiIndirectPriorityQueue(long[] refArray, int[] a, int size, LongComparator c)` Wraps a given array in a queue using a given comparator.
`LongHeapSemiIndirectPriorityQueue(long[] refArray, int[] a, LongComparator c)` Wraps a given array in a queue using a given comparator.
`LongHeapSemiIndirectPriorityQueue(long[] refArray, int capacity, LongComparator c)` Creates a new empty queue without elements with a given capacity and comparator.
`LongHeapSemiIndirectPriorityQueue(long[] refArray, LongComparator c)` Creates a new empty queue with capacity equal to the length of the reference array and a given comparator.
`OppositeComparator(LongComparator c)`
`Singleton(long key, boolean value, LongComparator comparator)`
`Singleton(long key, byte value, LongComparator comparator)`
`Singleton(long key, char value, LongComparator comparator)`
`Singleton(long key, double value, LongComparator comparator)`
`Singleton(long key, float value, LongComparator comparator)`
`Singleton(long key, int value, LongComparator comparator)`
`Singleton(long element, LongComparator comparator)`
`Singleton(long key, long value, LongComparator comparator)`
`Singleton(long key, short value, LongComparator comparator)`
`Singleton(long key, V value, LongComparator comparator)`
`Singleton(long key, V value, LongComparator comparator)`

Uses of Interfaceit.unimi.dsi.fastutil.longs.LongComparator

Uses of LongComparator in it.unimi.dsi.fastutil

Uses of LongComparator in it.unimi.dsi.fastutil.longs

Uses of Interface
it.unimi.dsi.fastutil.longs.LongComparator