|
Class Summary |
| AbstractCollection |
A basic implementation of most of the methods in the Collection interface to
make it easier to create a collection. |
| AbstractList |
A basic implementation of most of the methods in the List interface to make
it easier to create a List based on a random-access data structure. |
| AbstractList.RandomAccessSubList |
This class is a RandomAccess version of SubList, as required by
AbstractList.subList(int, int) 55 . |
| AbstractList.SubList |
This class follows the implementation requirements set forth in
AbstractList.subList(int, int) 55 . |
| AbstractMap |
An abstract implementation of Map to make it easier to create your own
implementations. |
| AbstractMap.BasicMapEntry |
A class which implements Map.Entry. |
| AbstractSequentialList |
Abstract superclass to make it easier to implement the List interface when
backed by a sequential-access store, such as a linked list. |
| AbstractSet |
An abstract implementation of Set to make it easier to create your own
implementations. |
| ArrayList |
An array-backed implementation of the List interface. |
| Arrays |
This class contains various static utility methods performing operations on
arrays, and a method to provide a List "view" of an array to facilitate
using arrays with Collection-based APIs. |
| Arrays.ArrayList |
Inner class used by Arrays.asList(Object[]) 55 to provide a list interface
to an array. |
| BitSet |
This class can be thought of in two ways. |
| Calendar |
This class is an abstract base class for Calendars, which can be
used to convert between Date objects and a set of
integer fields which represent YEAR,
MONTH, DAY, etc. |
| Collections |
Utility class consisting of static methods that operate on, or return
Collections. |
| Collections.CopiesList |
The implementation of Collections.nCopies(int, Object) 55 . |
| Collections.EmptyList |
The implementation of Collections.EMPTY_LIST 55 . |
| Collections.EmptyMap |
The implementation of Collections.EMPTY_MAP 55 . |
| Collections.EmptySet |
The implementation of Collections.EMPTY_SET 55 . |
| Collections.ReverseComparator |
The implementation of Collections.reverseOrder() 55 . |
| Collections.SingletonList |
The implementation of Collections.singletonList(Object) 55 . |
| Collections.SingletonMap |
The implementation of Collections.singletonMap(Object, Object) 55 . |
| Collections.SingletonSet |
The implementation of Collections.singleton(Object) 55 . |
| Collections.SynchronizedCollection |
The implementation of Collections.synchronizedCollection(Collection) 55 . |
| Collections.SynchronizedIterator |
The implementation of the various iterator methods in the
synchronized classes. |
| Collections.SynchronizedList |
The implementation of Collections.synchronizedList(List) 55 for sequential
lists. |
| Collections.SynchronizedListIterator |
The implementation of SynchronizedList#listIterator(). |
| Collections.SynchronizedMap |
The implementation of Collections.synchronizedMap(Map) 55 . |
| Collections.SynchronizedRandomAccessList |
The implementation of Collections.synchronizedList(List) 55 for random-access
lists. |
| Collections.SynchronizedSet |
The implementation of Collections.synchronizedSet(Set) 55 . |
| Collections.SynchronizedSortedMap |
The implementation of Collections.synchronizedSortedMap(SortedMap) 55 . |
| Collections.SynchronizedSortedSet |
The implementation of Collections.synchronizedSortedSet(SortedSet) 55 . |
| Collections.UnmodifiableCollection |
The implementation of Collections.unmodifiableCollection(Collection) 55 . |
| Collections.UnmodifiableIterator |
The implementation of the various iterator methods in the
unmodifiable classes. |
| Collections.UnmodifiableList |
The implementation of Collections.unmodifiableList(List) 55 for sequential
lists. |
| Collections.UnmodifiableListIterator |
The implementation of UnmodifiableList#listIterator(). |
| Collections.UnmodifiableMap |
The implementation of Collections.unmodifiableMap(Map) 55 . |
| Collections.UnmodifiableMap.UnmodifiableEntrySet |
The implementation of UnmodifiableMap#entrySet(). |
| Collections.UnmodifiableRandomAccessList |
The implementation of Collections.unmodifiableList(List) 55 for random-access
lists. |
| Collections.UnmodifiableSet |
The implementation of Collections.unmodifiableSet(Set) 55 . |
| Collections.UnmodifiableSortedMap |
The implementation of Collections.unmodifiableSortedMap(SortedMap) 55 . |
| Collections.UnmodifiableSortedSet |
The implementation of Collections.synchronizedSortedMap(SortedMap) 55 . |
| Currency |
Representation of a currency for a particular locale. |
| Date |
This class represents a specific time in milliseconds since the epoch. |
| Dictionary |
A Dictionary maps keys to values; how it does that is
implementation-specific. |
| EventListenerProxy |
An abstract wrapper for event listeners. |
| EventObject |
Represents Events fired by Objects. |
| GregorianCalendar |
This class represents the Gregorian calendar, that is used in most
countries all over the world. |
| HashMap |
This class provides a hashtable-backed implementation of the
Map interface. |
| HashMap.HashEntry |
Class to represent an entry in the hash table. |
| HashSet |
This class provides a HashMap-backed implementation of the Set interface. |
| Hashtable |
A class which implements a hashtable data structure. |
| Hashtable.HashEntry |
Class to represent an entry in the hash table. |
| IdentityHashMap |
This class provides a hashtable-backed implementation of the
Map interface, but uses object identity to do its hashing. |
| LinkedHashMap |
This class provides a hashtable-backed implementation of the
Map interface, with predictable traversal order. |
| LinkedHashSet |
This class provides a hashtable-backed implementation of the
Set interface, with predictable traversal order. |
| LinkedList |
Linked list implementation of the List interface. |
| LinkedList.Entry |
Class to represent an entry in the list. |
| ListResourceBundle |
A ListResouceBundle provides an easy way, to create your own
resource bundle. |
| Locale |
Locales represent a specific country and culture. |
| LocaleData |
|
| Observable |
This class represents an object which is observable. |
| Properties |
A set of persistent properties, which can be saved or loaded from a stream. |
| PropertyPermission |
This class represents the permission to access and modify a property.
The name is the name of the property, e.g. |
| PropertyPermissionCollection |
This class provides the implementation for
PropertyPermission.newPermissionCollection(). |
| PropertyResourceBundle |
This class is a concrete ResourceBundle that gets it
resources from a property file. |
| Random |
This class generates pseudorandom numbers. |
| ResourceBundle |
A resource bundle contains locale-specific data. |
| ResourceBundle.BundleKey |
Cache key for the ResourceBundle cache. |
| SimpleTimeZone |
This class represents a simple time zone offset and handles
daylight savings. |
| Stack |
|
| StringTokenizer |
This class splits a string into tokens. |
| Timer |
Timer that can run TimerTasks at a later time. |
| Timer.Scheduler |
The scheduler that executes all the tasks on a particular TaskQueue,
reschedules any repeating tasks and that waits when no task has to be
executed immediately. |
| Timer.TaskQueue |
Priority Task Queue. |
| TimerTask |
Task that can be run at a later time if given to a Timer. |
| TimeZone |
This class represents a time zone offset and handles daylight savings. |
| TreeMap |
This class provides a red-black tree implementation of the SortedMap
interface. |
| TreeMap.Node |
Class to represent an entry in the tree. |
| TreeSet |
This class provides a TreeMap-backed implementation of the SortedSet
interface. |
| Vector |
The Vector classes implements growable arrays of Objects. |
| VMTimeZone |
|
| WeakHashMap |
A weak hash map has only weak references to the key. |
| WeakHashMap.WeakBucket |
A bucket is a weak reference to the key, that contains a strong
reference to the value, a pointer to the next bucket and its slot
number. |