Uses of Interface
java.util.Comparator
Package
Description
Provides classes that are fundamental to the design of the Java
programming language.
Provides classes and interfaces for handling text, dates, numbers,
and messages in a manner independent of natural languages.
The main API for dates, times, instants, and durations.
Generic API for calendar systems other than the default ISO.
Contains the collections framework, some internationalization support classes,
a service loader, properties, random number generation, string parsing
and scanning classes, base64 encoding and decoding, a bit array, and
several miscellaneous utility classes.
Utility classes commonly useful in concurrent programming.
Functional interfaces provide target types for lambda expressions
and method references.
Classes to support functional-style operations on streams of elements, such
as map-reduce transformations on collections.
Provides a set of "lightweight" (all-Java language) components
that, to the maximum degree possible, work the same on all platforms.
Provides classes and interfaces for dealing with
javax.swing.JTable
.-
Uses of Comparator in java.lang
Modifier and TypeFieldDescriptionstatic final Comparator
<String> String.CASE_INSENSITIVE_ORDER
A Comparator that ordersString
objects as bycompareToIgnoreCase
. -
Uses of Comparator in java.text
Modifier and TypeClassDescriptionclass
TheCollator
class performs locale-sensitiveString
comparison.class
TheRuleBasedCollator
class is a concrete subclass ofCollator
that provides a simple, data-driven, table collator. -
Uses of Comparator in java.time
Modifier and TypeMethodDescriptionstatic Comparator
<OffsetDateTime> OffsetDateTime.timeLineOrder()
Gets a comparator that compares twoOffsetDateTime
instances based solely on the instant. -
Uses of Comparator in java.time.chrono
Modifier and TypeMethodDescriptionstatic Comparator
<ChronoLocalDate> ChronoLocalDate.timeLineOrder()
Gets a comparator that comparesChronoLocalDate
in time-line order ignoring the chronology.static Comparator
<ChronoLocalDateTime<?>> ChronoLocalDateTime.timeLineOrder()
Gets a comparator that comparesChronoLocalDateTime
in time-line order ignoring the chronology.static Comparator
<ChronoZonedDateTime<?>> ChronoZonedDateTime.timeLineOrder()
Gets a comparator that comparesChronoZonedDateTime
in time-line order ignoring the chronology. -
Uses of Comparator in java.util
Modifier and TypeMethodDescriptionComparator
<? super E> PriorityQueue.comparator()
Returns the comparator used to order the elements in this queue, ornull
if this queue is sorted according to the natural ordering of its elements.Comparator
<? super K> SortedMap.comparator()
Returns the comparator used to order the keys in this map, ornull
if this map uses the natural ordering of its keys.Comparator
<? super E> SortedSet.comparator()
Returns the comparator used to order the elements in this set, ornull
if this set uses the natural ordering of its elements.Comparator
<? super K> TreeMap.comparator()
Comparator
<? super E> TreeSet.comparator()
static <T,
U extends Comparable<? super U>>
Comparator<T> Accepts a function that extracts aComparable
sort key from a typeT
, and returns aComparator<T>
that compares by that sort key.static <T,
U> Comparator <T> Comparator.comparing
(Function<? super T, ? extends U> keyExtractor, Comparator<? super U> keyComparator) Accepts a function that extracts a sort key from a typeT
, and returns aComparator<T>
that compares by that sort key using the specifiedComparator
.static <K extends Comparable<? super K>,
V>
Comparator<Map.Entry<K, V>> Map.Entry.comparingByKey()
Returns a comparator that comparesMap.Entry
in natural order on key.static <K,
V> Comparator <Map.Entry<K, V>> Map.Entry.comparingByKey
(Comparator<? super K> cmp) Returns a comparator that comparesMap.Entry
by key using the givenComparator
.static <K,
V extends Comparable<? super V>>
Comparator<Map.Entry<K, V>> Map.Entry.comparingByValue()
Returns a comparator that comparesMap.Entry
in natural order on value.static <K,
V> Comparator <Map.Entry<K, V>> Map.Entry.comparingByValue
(Comparator<? super V> cmp) Returns a comparator that comparesMap.Entry
by value using the givenComparator
.static <T> Comparator
<T> Comparator.comparingDouble
(ToDoubleFunction<? super T> keyExtractor) Accepts a function that extracts adouble
sort key from a typeT
, and returns aComparator<T>
that compares by that sort key.static <T> Comparator
<T> Comparator.comparingInt
(ToIntFunction<? super T> keyExtractor) Accepts a function that extracts anint
sort key from a typeT
, and returns aComparator<T>
that compares by that sort key.static <T> Comparator
<T> Comparator.comparingLong
(ToLongFunction<? super T> keyExtractor) Accepts a function that extracts along
sort key from a typeT
, and returns aComparator<T>
that compares by that sort key.default Comparator
<? super T> Spliterator.getComparator()
static <T extends Comparable<? super T>>
Comparator<T> Comparator.naturalOrder()
Returns a comparator that comparesComparable
objects in natural order.static <T> Comparator
<T> Comparator.nullsFirst
(Comparator<? super T> comparator) Returns a null-friendly comparator that considersnull
to be less than non-null.static <T> Comparator
<T> Comparator.nullsLast
(Comparator<? super T> comparator) Returns a null-friendly comparator that considersnull
to be greater than non-null.default Comparator
<T> Comparator.reversed()
Returns a comparator that imposes the reverse ordering of this comparator.static <T> Comparator
<T> Collections.reverseOrder()
Returns a comparator that imposes the reverse of the natural ordering on a collection of objects that implement theComparable
interface.static <T> Comparator
<T> Collections.reverseOrder
(Comparator<T> cmp) Returns a comparator that imposes the reverse ordering of the specified comparator.static <T extends Comparable<? super T>>
Comparator<T> Comparator.reverseOrder()
Returns a comparator that imposes the reverse of the natural ordering.default Comparator
<T> Comparator.thenComparing
(Comparator<? super T> other) Returns a lexicographic-order comparator with another comparator.default <U extends Comparable<? super U>>
Comparator<T> Comparator.thenComparing
(Function<? super T, ? extends U> keyExtractor) Returns a lexicographic-order comparator with a function that extracts aComparable
sort key.default <U> Comparator
<T> Comparator.thenComparing
(Function<? super T, ? extends U> keyExtractor, Comparator<? super U> keyComparator) Returns a lexicographic-order comparator with a function that extracts a key to be compared with the givenComparator
.default Comparator
<T> Comparator.thenComparingDouble
(ToDoubleFunction<? super T> keyExtractor) Returns a lexicographic-order comparator with a function that extracts adouble
sort key.default Comparator
<T> Comparator.thenComparingInt
(ToIntFunction<? super T> keyExtractor) Returns a lexicographic-order comparator with a function that extracts anint
sort key.default Comparator
<T> Comparator.thenComparingLong
(ToLongFunction<? super T> keyExtractor) Returns a lexicographic-order comparator with a function that extracts along
sort key.Modifier and TypeMethodDescriptionstatic <T> int
Arrays.binarySearch
(T[] a, int fromIndex, int toIndex, T key, Comparator<? super T> c) Searches a range of the specified array for the specified object using the binary search algorithm.static <T> int
Arrays.binarySearch
(T[] a, T key, Comparator<? super T> c) Searches the specified array for the specified object using the binary search algorithm.static <T> int
Collections.binarySearch
(List<? extends T> list, T key, Comparator<? super T> c) Searches the specified list for the specified object using the binary search algorithm.static <T> int
Arrays.compare
(T[] a, int aFromIndex, int aToIndex, T[] b, int bFromIndex, int bToIndex, Comparator<? super T> cmp) Compares twoObject
arrays lexicographically over the specified ranges.static <T> int
Arrays.compare
(T[] a, T[] b, Comparator<? super T> cmp) Compares twoObject
arrays lexicographically using a specified comparator.static <T> int
Objects.compare
(T a, T b, Comparator<? super T> c) Returns 0 if the arguments are identical andc.compare(a, b)
otherwise.static <T,
U> Comparator <T> Comparator.comparing
(Function<? super T, ? extends U> keyExtractor, Comparator<? super U> keyComparator) Accepts a function that extracts a sort key from a typeT
, and returns aComparator<T>
that compares by that sort key using the specifiedComparator
.static <K,
V> Comparator <Map.Entry<K, V>> Map.Entry.comparingByKey
(Comparator<? super K> cmp) Returns a comparator that comparesMap.Entry
by key using the givenComparator
.static <K,
V> Comparator <Map.Entry<K, V>> Map.Entry.comparingByValue
(Comparator<? super V> cmp) Returns a comparator that comparesMap.Entry
by value using the givenComparator
.static <T> boolean
Arrays.equals
(T[] a, int aFromIndex, int aToIndex, T[] b, int bFromIndex, int bToIndex, Comparator<? super T> cmp) Returns true if the two specified arrays of Objects, over the specified ranges, are equal to one another.static <T> boolean
Arrays.equals
(T[] a, T[] a2, Comparator<? super T> cmp) Returnstrue
if the two specified arrays of Objects are equal to one another.static <T> T
Collections.max
(Collection<? extends T> coll, Comparator<? super T> comp) Returns the maximum element of the given collection, according to the order induced by the specified comparator.static <T> T
Collections.min
(Collection<? extends T> coll, Comparator<? super T> comp) Returns the minimum element of the given collection, according to the order induced by the specified comparator.static <T> int
Arrays.mismatch
(T[] a, int aFromIndex, int aToIndex, T[] b, int bFromIndex, int bToIndex, Comparator<? super T> cmp) Finds and returns the relative index of the first mismatch between twoObject
arrays over the specified ranges, otherwise return -1 if no mismatch is found.static <T> int
Arrays.mismatch
(T[] a, T[] b, Comparator<? super T> cmp) Finds and returns the index of the first mismatch between twoObject
arrays, otherwise return -1 if no mismatch is found.static <T> Comparator
<T> Comparator.nullsFirst
(Comparator<? super T> comparator) Returns a null-friendly comparator that considersnull
to be less than non-null.static <T> Comparator
<T> Comparator.nullsLast
(Comparator<? super T> comparator) Returns a null-friendly comparator that considersnull
to be greater than non-null.static <T> void
Arrays.parallelSort
(T[] a, int fromIndex, int toIndex, Comparator<? super T> cmp) Sorts the specified range of the specified array of objects according to the order induced by the specified comparator.static <T> void
Arrays.parallelSort
(T[] a, Comparator<? super T> cmp) Sorts the specified array of objects according to the order induced by the specified comparator.static <T> Comparator
<T> Collections.reverseOrder
(Comparator<T> cmp) Returns a comparator that imposes the reverse ordering of the specified comparator.static <T> void
Arrays.sort
(T[] a, int fromIndex, int toIndex, Comparator<? super T> c) Sorts the specified range of the specified array of objects according to the order induced by the specified comparator.static <T> void
Arrays.sort
(T[] a, Comparator<? super T> c) Sorts the specified array of objects according to the order induced by the specified comparator.static <T> void
Collections.sort
(List<T> list, Comparator<? super T> c) Sorts the specified list according to the order induced by the specified comparator.default void
List.sort
(Comparator<? super E> c) Sorts this list according to the order induced by the specifiedComparator
(optional operation).default Comparator
<T> Comparator.thenComparing
(Comparator<? super T> other) Returns a lexicographic-order comparator with another comparator.default <U> Comparator
<T> Comparator.thenComparing
(Function<? super T, ? extends U> keyExtractor, Comparator<? super U> keyComparator) Returns a lexicographic-order comparator with a function that extracts a key to be compared with the givenComparator
.ModifierConstructorDescriptionPriorityQueue
(int initialCapacity, Comparator<? super E> comparator) Creates aPriorityQueue
with the specified initial capacity that orders its elements according to the specified comparator.PriorityQueue
(Comparator<? super E> comparator) Creates aPriorityQueue
with the default initial capacity and whose elements are ordered according to the specified comparator.TreeMap
(Comparator<? super K> comparator) Constructs a new, empty tree map, ordered according to the given comparator.TreeSet
(Comparator<? super E> comparator) Constructs a new, empty tree set, sorted according to the specified comparator. -
Uses of Comparator in java.util.concurrent
Modifier and TypeMethodDescriptionComparator
<? super K> ConcurrentSkipListMap.comparator()
Comparator
<? super E> ConcurrentSkipListSet.comparator()
Comparator
<? super E> PriorityBlockingQueue.comparator()
Returns the comparator used to order the elements in this queue, ornull
if this queue uses the natural ordering of its elements.ModifierConstructorDescriptionConcurrentSkipListMap
(Comparator<? super K> comparator) Constructs a new, empty map, sorted according to the specified comparator.ConcurrentSkipListSet
(Comparator<? super E> comparator) Constructs a new, empty set that orders its elements according to the specified comparator.PriorityBlockingQueue
(int initialCapacity, Comparator<? super E> comparator) Creates aPriorityBlockingQueue
with the specified initial capacity that orders its elements according to the specified comparator. -
Uses of Comparator in java.util.function
Modifier and TypeMethodDescriptionstatic <T> BinaryOperator
<T> BinaryOperator.maxBy
(Comparator<? super T> comparator) Returns aBinaryOperator
which returns the greater of two elements according to the specifiedComparator
.static <T> BinaryOperator
<T> BinaryOperator.minBy
(Comparator<? super T> comparator) Returns aBinaryOperator
which returns the lesser of two elements according to the specifiedComparator
. -
Uses of Comparator in java.util.stream
Modifier and TypeMethodDescriptionStream.max
(Comparator<? super T> comparator) Returns the maximum element of this stream according to the providedComparator
.Collectors.maxBy
(Comparator<? super T> comparator) Returns aCollector
that produces the maximal element according to a givenComparator
, described as anOptional<T>
.Stream.min
(Comparator<? super T> comparator) Returns the minimum element of this stream according to the providedComparator
.Collectors.minBy
(Comparator<? super T> comparator) Returns aCollector
that produces the minimal element according to a givenComparator
, described as anOptional<T>
.Stream.sorted
(Comparator<? super T> comparator) Returns a stream consisting of the elements of this stream, sorted according to the providedComparator
. -
Uses of Comparator in javax.swing
Modifier and TypeMethodDescriptionComparator
<?> DefaultRowSorter.getComparator
(int column) Returns theComparator
for the specified column.protected Comparator
<? super Component> SortingFocusTraversalPolicy.getComparator()
Returns the Comparator which will be used to sort the Components in a focus traversal cycle.Modifier and TypeMethodDescriptionvoid
DefaultRowSorter.setComparator
(int column, Comparator<?> comparator) Sets theComparator
to use when sorting the specified column.protected void
SortingFocusTraversalPolicy.setComparator
(Comparator<? super Component> comparator) Sets the Comparator which will be used to sort the Components in a focus traversal cycle.ModifierConstructorDescriptionSortingFocusTraversalPolicy
(Comparator<? super Component> comparator) Constructs a SortingFocusTraversalPolicy with the specified Comparator. -
Uses of Comparator in javax.swing.table
Modifier and TypeMethodDescriptionComparator
<?> TableRowSorter.getComparator
(int column) Returns theComparator
for the specified column.