| Package | Description |
|---|---|
| java.lang |
Back 2 Browser Bytecode Translator
Copyright (C) 2012 Jaroslav Tulach
|
| java.util |
Back 2 Browser Bytecode Translator
Copyright (C) 2012 Jaroslav Tulach
|
| java.util.concurrent |
Utility classes commonly useful in concurrent programming.
|
| Modifier and Type | Field and Description |
|---|---|
static Comparator<String> |
String.CASE_INSENSITIVE_ORDER
A Comparator that orders
String objects as by
compareToIgnoreCase. |
| Modifier and Type | Method and Description |
|---|---|
Comparator<? super E> |
TreeSet.comparator() |
Comparator<? super K> |
TreeMap.comparator() |
Comparator<? super E> |
SortedSet.comparator()
Returns the comparator used to order the elements in this set,
or null if this set uses the natural ordering of its elements.
|
Comparator<? super K> |
SortedMap.comparator()
Returns the comparator used to order the keys in this map, or
null if this map uses the natural ordering of its keys. |
Comparator<? super E> |
PriorityQueue.comparator()
Returns the comparator used to order the elements in this
queue, or
null if this queue is sorted according to
the natural ordering of its elements. |
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.
|
| Modifier and Type | Method and Description |
|---|---|
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,
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 |
Objects.compare(T a,
T b,
Comparator<? super T> c)
Returns 0 if the arguments are identical and
c.compare(a, b) otherwise. |
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.
|
| Constructor and Description |
|---|
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> 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.
|
| Modifier and Type | Method and Description |
|---|---|
Comparator<? super E> |
PriorityBlockingQueue.comparator()
Returns the comparator used to order the elements in this queue,
or
null if this queue uses the natural ordering of its elements. |
Comparator<? super E> |
ConcurrentSkipListSet.comparator() |
Comparator<? super K> |
ConcurrentSkipListMap.comparator() |
| Constructor and Description |
|---|
ConcurrentSkipListMap(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 a
PriorityBlockingQueue with the specified initial
capacity that orders its elements according to the specified
comparator. |
Copyright © 2019 API Design. All Rights Reserved.