Uses of Interface
java.util.Comparator

Packages that use Comparator

java.lang	Provides classes that are fundamental to the design of the Java programming language.
java.text	Provides classes and interfaces for handling text, dates, numbers, and messages in a manner independent of natural languages.
java.util	Contains the collections framework, legacy collection classes, event model, date and time facilities, internationalization, and miscellaneous utility classes (a string tokenizer, a random-number generator, and a bit array).
java.util.concurrent	Utility classes commonly useful in concurrent programming.
javax.swing	Provides a set of "lightweight" (all-Java language) components that, to the maximum degree possible, work the same on all platforms.

Uses of Comparator in java.lang

Fields in java.lang declared as Comparator

static Comparator<String>

String.CASE_INSENSITIVE_ORDER A Comparator that orders String objects as by compareToIgnoreCase.

Uses of Comparator in java.text

Classes in java.text that implement Comparator

class	Collator The Collator class performs locale-sensitive String comparison.
class	RuleBasedCollator The RuleBasedCollator class is a concrete subclass of Collator that provides a simple, data-driven, table collator.

Uses of Comparator in java.util

Methods in java.util that return Comparator

Comparator<? super K>	TreeMap.comparator() Returns the comparator used to order this map, or null if this map uses its keys' natural order.
Comparator<? super E>	PriorityQueue.comparator() Returns the comparator used to order this collection, or null if this collection is sorted according to its elements natural ordering (using Comparable).
Comparator<? super E>	TreeSet.comparator() Returns the comparator used to order this sorted set, or null if this tree set uses its elements natural ordering.
Comparator<? super E>	SortedSet.comparator() Returns the comparator associated with this sorted set, or null if it uses its elements' natural ordering.
Comparator<? super K>	SortedMap.comparator() Returns the comparator associated with this sorted map, or null if it uses its keys' natural ordering.
static <T> Comparator<T>	Collections.reverseOrder() Returns a comparator that imposes the reverse of the natural ordering on a collection of objects that implement the Comparable interface.
static <T> Comparator<T>	Collections.reverseOrder(Comparator<T> cmp) Returns a comparator that imposes the reverse ordering of the specified comparator.

Methods in java.util with parameters of type Comparator

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.binarySearch(T[] a, T key, Comparator<? super T> c) Searches the specified array for the specified object using the binary search algorithm.
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> Comparator<T>	Collections.reverseOrder(Comparator<T> cmp) Returns a comparator that imposes the reverse ordering of 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.
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	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.

Constructors in java.util with parameters of type Comparator

PriorityQueue(int initialCapacity, Comparator<? super E> comparator)
Creates a PriorityQueue with the specified initial capacity that orders its elements according to the specified comparator.

TreeMap(Comparator<? super K> c)
Constructs a new, empty map, sorted according to the given comparator.

TreeSet(Comparator<? super E> c)
Constructs a new, empty set, sorted according to the specified comparator.

Uses of Comparator in java.util.concurrent

Methods in java.util.concurrent that return Comparator

Comparator<? super E>

PriorityBlockingQueue.comparator() Returns the comparator used to order this collection, or null if this collection is sorted according to its elements natural ordering (using Comparable).

Constructors in java.util.concurrent with parameters of type Comparator

PriorityBlockingQueue(int initialCapacity, Comparator<? super E> comparator)
Creates a PriorityBlockingQueue with the specified initial capacity that orders its elements according to the specified comparator.

Uses of Comparator in javax.swing

Methods in javax.swing that return Comparator

protected Comparator<? super Component>

SortingFocusTraversalPolicy.getComparator() Returns the Comparator which will be used to sort the Components in a focus traversal cycle.

Methods in javax.swing with parameters of type Comparator

protected void

SortingFocusTraversalPolicy.setComparator(Comparator<? super Component> comparator) Sets the Comparator which will be used to sort the Components in a focus traversal cycle.

Constructors in javax.swing with parameters of type Comparator

SortingFocusTraversalPolicy(Comparator<? super Component> comparator)
Constructs a SortingFocusTraversalPolicy with the specified Comparator.