Interface | Description |
---|---|
Collection<E> |
General-purpose interface for storing collections of objects.
|
Comparator<T> |
An interface used a basis for implementing custom ordering.
|
Deque<E> |
A collection designed for holding elements prior to processing.
|
Enumeration<E> |
An interface to generate a series of elements, one at a time.
|
EventListener |
A tag interface that other "listener" interfaces can extend to indicate their
adherence to the observer pattern.
|
Iterator<E> |
See the
official Java API doc for details.
|
List<E> |
Represents a sequence of objects.
|
ListIterator<E> |
Uses Java 1.5 ListIterator for documentation.
|
Map<K,V> |
Abstract interface for maps.
|
Map.Entry<K,V> |
Represents an individual map entry.
|
NavigableMap<K,V> |
Sorted map providing additional query operations and views.
|
NavigableSet<E> |
A
SortedSet with more flexible queries. |
Queue<E> |
A collection designed for holding elements prior to processing.
|
RandomAccess |
Indicates that a data structure supports constant-time random access to its
contained objects.
|
Set<E> |
Represents a set of unique objects.
|
SortedMap<K,V> |
A map with ordering.
|
SortedSet<E> |
A set known to be in ascending order.
|
Class | Description |
---|---|
AbstractCollection<E> |
Skeletal implementation of the Collection interface.
|
AbstractCollection |
Skeletal implementation of the Collection interface.
|
AbstractHashMap |
Implementation of Map interface based on a hash table.
|
AbstractList<E> |
Skeletal implementation of the List interface.
|
AbstractList |
Skeletal implementation of the List interface.
|
AbstractMap<K,V> |
Skeletal implementation of the Map interface.
|
AbstractMap |
Skeletal implementation of the Map interface.
|
AbstractMap.SimpleEntry<K,V> | |
AbstractMap.SimpleImmutableEntry<K,V> | |
AbstractMapEntry |
Basic
Map.Entry implementation that implements hashCode, equals, and
toString. |
AbstractNavigableMap |
Skeletal implementation of a NavigableMap.
|
AbstractQueue<E> |
Skeletal implementation of the Queue interface.
|
AbstractQueue |
Skeletal implementation of the Queue interface.
|
AbstractSequentialList<E> |
Skeletal implementation of the List interface.
|
AbstractSequentialList |
Skeletal implementation of the List interface.
|
AbstractSet<E> |
Skeletal implementation of the Set interface.
|
AbstractSet |
Skeletal implementation of the Set interface.
|
ArrayList |
Resizeable array implementation of the List interface.
|
ArrayList<E> |
Resizeable array implementation of the List interface.
|
Arrays |
Utility methods related to native arrays.
|
Arrays |
Utility methods related to native arrays.
|
Collection |
General-purpose interface for storing collections of objects.
|
Collections |
Utility methods that operate on collections.
|
Collections |
Utility methods that operate on collections.
|
Comparator |
An interface used a basis for implementing custom ordering.
|
Comparators | |
ConcurrentModificationDetector |
A helper to detect concurrent modifications to collections.
|
ConcurrentModificationException |
See the
official Java API doc for details.
|
Date |
Represents a date and time.
|
Date |
Represents a date and time.
|
Deque |
A collection designed for holding elements prior to processing.
|
EmptyStackException |
See the
official Java API doc for details.
|
Enumeration |
An interface to generate a series of elements, one at a time.
|
EnumMap<K extends Enum<K>,V> | |
EnumMap |
A
Map of Enum s. |
EnumSet |
A
Set of Enum s. |
EnumSet<E extends Enum<E>> | |
EventListener |
A tag interface that other "listener" interfaces can extend to indicate their
adherence to the observer pattern.
|
EventObject |
Available as a superclass of event objects.
|
EventObject |
Available as a superclass of event objects.
|
HashMap |
Implementation of Map interface based on a hash table.
|
HashMap<K,V> |
Implementation of Map interface based on a hash table.
|
HashSet |
Implements a set in terms of a hash table.
|
HashSet<E> |
Implements a set in terms of a hash table.
|
IdentityHashMap<K,V> |
Map using reference equality on keys.
|
IdentityHashMap |
Map using reference equality on keys.
|
InternalJsHashCodeMap |
A simple wrapper around JavaScriptObject to provide
Map -like semantics for any
key type. |
InternalJsMapFactory |
A factory to create internal JS map instances for modern browsers.
|
InternalJsStringMap |
A simple wrapper around JavaScriptObject to provide
Map -like semantics where
the key type is string. |
Iterator |
See the
official Java API doc for details.
|
LinkedHashMap |
Hash table implementation of the Map interface with predictable iteration
order.
|
LinkedHashMap<K,V> |
Hash table implementation of the Map interface with predictable iteration
order.
|
LinkedHashSet |
Hash table and linked-list implementation of the Set interface with
predictable iteration order.
|
LinkedHashSet<E> |
Hash table and linked-list implementation of the Set interface with
predictable iteration order.
|
LinkedList |
Linked list implementation.
|
LinkedList<E> |
Linked list implementation.
|
List |
Represents a sequence of objects.
|
ListIterator |
Uses Java 1.5 ListIterator for documentation.
|
Locale |
A very simple emulation of Locale for shared-code patterns like
String.toUpperCase(Locale.US) . |
Locale |
A very simple emulation of Locale for shared-code patterns like
String.toUpperCase(Locale.US) . |
Map |
Abstract interface for maps.
|
MissingResourceException |
See the
official Java API doc for details.
|
NavigableMap |
Sorted map providing additional query operations and views.
|
NavigableSet |
A
SortedSet with more flexible queries. |
NoSuchElementException |
See the
official Java API doc for details.
|
Objects |
See the
official Java API doc for details.
|
Objects |
See the
official Java API doc for details.
|
PriorityQueue<E> |
An unbounded priority queue based on a priority heap.
|
PriorityQueue |
An unbounded priority queue based on a priority heap.
|
Queue |
A collection designed for holding elements prior to processing.
|
Random |
This class provides methods that generates pseudo-random numbers of different
types, such as
int , long , double , and float . |
Random |
This class provides methods that generates pseudo-random numbers of different
types, such as
int , long , double , and float . |
RandomAccess |
Indicates that a data structure supports constant-time random access to its
contained objects.
|
Set |
Represents a set of unique objects.
|
SortedMap |
A map with ordering.
|
SortedSet |
A set known to be in ascending order.
|
Stack |
Maintains a last-in, first-out collection of objects.
|
Stack<E> |
Maintains a last-in, first-out collection of objects.
|
TooManyListenersException |
Thrown when the subject of an observer cannot support additional observers.
|
TreeMap<K,V> |
Implements a TreeMap using a red-black tree.
|
TreeMap |
Implements a TreeMap using a red-black tree.
|
TreeSet |
Implements a set using a TreeMap.
|
TreeSet<E> |
Implements a set using a TreeMap.
|
Vector |
To keep performance characteristics in line with Java community expectations,
Vector is a wrapper around ArrayList . |
Vector<E> |
To keep performance characteristics in line with Java community expectations,
Vector is a wrapper around ArrayList . |
Exception | Description |
---|---|
ConcurrentModificationException |
See the
official Java API doc for details.
|
EmptyStackException |
See the
official Java API doc for details.
|
MissingResourceException |
See the
official Java API doc for details.
|
NoSuchElementException |
See the
official Java API doc for details.
|
TooManyListenersException |
Thrown when the subject of an observer cannot support additional observers.
|
Copyright © 2018. All rights reserved.