Class
|
This class provides a skeletal implementation of the Collection interface, to minimize the effort required to implement this interface.
|
AbstractCollection<E>
|
This class provides a skeletal implementation of the List interface to minimize the effort required to implement this interface backed by a "random access" data store (such as an array).
|
AbstractList<E>
|
This class provides a skeletal implementation of the Map interface, to minimize the effort required to implement this interface.
|
AbstractMap<K,V>
|
An Entry maintaining a key and a value.
|
AbstractMap.SimpleEntry<K,V>
|
An Entry maintaining an immutable key and value.
|
AbstractMap.SimpleImmutableEntry<K,V>
|
This class provides skeletal implementations of some Queue operations.
|
AbstractQueue<E>
|
This class provides a skeletal implementation of the List interface to minimize the effort required to implement this interface backed by a "sequential access" data store (such as a linked list).
|
AbstractSequentialList<E>
|
This class provides a skeletal implementation of the Set interface to minimize the effort required to implement this interface.
|
AbstractSet<E>
|
Resizable-array implementation of the Deque interface.
|
ArrayDeque<E>
|
Resizable-array implementation of the List interface.
|
ArrayList<E>
|
This class contains various methods for manipulating arrays (such as sorting and searching).
|
Arrays
|
This class consists exclusively of static methods for obtaining encoders and decoders for the Base64 encoding scheme.
|
Base64
|
This class implements a decoder for decoding byte data using the Base64 encoding scheme as specified in RFC 4648 and RFC 2045.
|
Base64.Decoder
|
This class implements an encoder for encoding byte data using the Base64 encoding scheme as specified in RFC 4648 and RFC 2045.
|
Base64.Encoder
|
This class implements a vector of bits that grows as needed.
|
BitSet
|
This class is an abstract class that provides methods for converting between a specific instant in time and a set of calendar fields such as YEAR, MONTH, DAY_OF_MONTH, HOUR, and so on, and for manipulating the calendar fields, such as getting the date of the next week.
|
Calendar
|
This is used for creating a Calendar from various date-time parameters.
|
Calendar.Builder
|
This class consists exclusively of static methods that operate on or return collections.
|
Collections
|
Represents a currency.
|
Currency
|
This class represents a specific instant in time, with millisecond precision.
|
Date
|
This class is the abstract parent of any class, such as Hashtable, which maps keys to values.
|
Dictionary<K,V>
|
A state object for collecting statistics such as count, min, max, sum, and average.
|
DoubleSummaryStatistics
|
A specialized Map implementation for use with enum type keys.
|
EnumMap<K extends Enum<K>,V>
|
A specialized Set implementation for use with enum types.
|
EnumSet<E extends Enum<E>>
|
An abstract wrapper class for an EventListener class which associates a set of additional parameters with the listener.
|
EventListenerProxy<T extends EventListener>
|
The root class from which all event state objects shall be derived.
|
EventObject
|
FomattableFlags are passed to the Formattable.formatTo() method and modify the output format for Formattables.
|
FormattableFlags
|
An interpreter for printf-style format strings.
|
Formatter
|
This is a concrete subclass of Calendar and provides the standard calendar system used by most of the world.
|
GregorianCalendar
|
Hash table based implementation of the Map interface.
|
HashMap<K,V>
|
This class implements the Set interface, backed by a hash table (actually a HashMap instance).
|
HashSet<E>
|
This class implements a hash table, which maps keys to values.
|
Hashtable<K,V>
|
This class implements the Map interface with a hash table, using reference-equality in place of object-equality when comparing keys (and values).
|
IdentityHashMap<K,V>
|
A state object for collecting statistics such as count, min, max, sum, and average.
|
IntSummaryStatistics
|
Hash table and linked list implementation of the Map interface, with predictable iteration order.
|
LinkedHashMap<K,V>
|
Hash table and linked list implementation of the Set interface, with predictable iteration order.
|
LinkedHashSet<E>
|
Doubly-linked list implementation of the List and Deque interfaces.
|
LinkedList<E>
|
This is an abstract subclass of ResourceBundle that manages resources for a locale in a convenient and easy to use list.
|
ListResourceBundle
|
This object represents a specific geographical, political, or cultural region.
|
Locale
|
This class expresses a Language Range defined in RFC 4647 Matching of Language Tags.
|
Locale.Builder
|
Builder is used to build instances of Locale from values configured by the setters.
|
Locale.LanguageRange
|
A state object for collecting statistics such as count, min, max, sum, and average.
|
LongSummaryStatistics
|
This class consists of static utility methods for operating on objects.
|
Objects
|
This class represents an observable object, or "data" in the model-view paradigm.
|
Observable
|
A container object which may or may not contain a non-null value.
|
Optional<T>
|
A container object which may or may not contain a double value.
|
OptionalDouble
|
A container object which may or may not contain a int value.
|
OptionalInt
|
A container object which may or may not contain a long value.
|
OptionalLong
|
An unbounded priority queue based on a priority heap.
|
PriorityQueue<E>
|
This class represents a persistent set of properties.
|
Properties
|
This class is for property permissions.
|
PropertyPermission
|
This is a concrete subclass of ResourceBundle that manages resources for a locale using a set of static strings from a property file.
|
PropertyResourceBundle
|
An instance of this class is used to generate a stream of pseudorandom numbers.
|
Random
|
Resource bundles contain locale-specific objects.
|
ResourceBundle
|
This defines a set of callback methods that are invoked by the ResourceBundle.getBundle factory methods during the bundle loading process.
|
ResourceBundle.Control
|
A simple text scanner which can parse primitive types and strings using regular expressions.
|
Scanner
|
A simple service-provider loading facility.
|
ServiceLoader<S>
|
This is a concrete subclass of TimeZone that represents a time zone for use with a Gregorian calendar.
|
SimpleTimeZone
|
Static classes and methods for operating on or creating instances of Spliterator and its primitive specializations Spliterator.OfInt, Spliterator.OfLong, and Spliterator.OfDouble.
|
Spliterators
|
An abstract Spliterator.OfDouble that implements trySplit to permit limited parallelism.
|
Spliterators.AbstractDoubleSpliterator
|
An abstract Spliterator.OfInt that implements trySplit to permit limited parallelism.
|
Spliterators.AbstractIntSpliterator
|
An abstract Spliterator.OfLong that implements trySplit to permit limited parallelism.
|
Spliterators.AbstractLongSpliterator
|
An abstract Spliterator that implements trySplit to permit limited parallelism.
|
Spliterators.AbstractSpliterator<T>
|
A generator of uniform pseudorandom values applicable for use in (among other contexts) isolated parallel computations that may generate subtasks.
|
SplittableRandom
|
This class represents a last-in-first-out (LIFO) stack of objects.
|
Stack<E>
|
StringJoiner is used to construct a sequence of characters separated by a delimiter and optionally starting with a supplied prefix and ending with a supplied suffix.
|
StringJoiner
|
The string tokenizer class allows an application to break a string into tokens.
|
StringTokenizer
|
A facility for threads to schedule tasks for future execution in a background thread.
|
Timer
|
A task that can be scheduled for one-time or repeated execution by a Timer.
|
TimerTask
|
TimeZone represents a time zone offset, and also figures out daylight savings.
|
TimeZone
|
A Red-Black tree based NavigableMap implementation.
|
TreeMap<K,V>
|
A NavigableSet implementation based on a TreeMap.
|
TreeSet<E>
|
A class that represents an immutable universally unique identifier (UUID).
|
UUID
|
This class implements a growable array of objects.
|
Vector<E>
|
Hash table based implementation of the Map interface, with weak keys.
|
WeakHashMap<K,V>
|