Docjar: A Java Source and Docuemnt Enginecom.*    java.*    javax.*    org.*    all    new    plug-in

Quick Search    Search Deep

Uses of Package
java.util

Classes in java.util used by java.util
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.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.
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.
Collection
          Interface that represents a collection of objects.
Collections.ReverseComparator
          The implementation of Collections.reverseOrder() 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.SynchronizedMap
          The implementation of Collections.synchronizedMap(Map) 55 .
Collections.SynchronizedSet
          The implementation of Collections.synchronizedSet(Set) 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.UnmodifiableMap
          The implementation of Collections.unmodifiableMap(Map) 55 .
Collections.UnmodifiableSet
          The implementation of Collections.unmodifiableSet(Set) 55 .
Comparator
          Interface for objects that specify an ordering between objects.
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.
Enumeration
          Interface for lists of objects that can be returned in sequence.
EventListener
          Empty interface that is implemented by classes that need to receive events.
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.EntryEnumerator
          Enumeration view of the entries in this Hashtable, providing sequential access to its elements.
Hashtable.EntryIterator
          A class which implements the Iterator interface and is used for iterating over Hashtables.
Hashtable.HashEntry
          Class to represent an entry in the hash table.
InvalidPropertiesFormatException
           
Iterator
          An object which iterates over a collection.
LinkedHashMap.LinkedHashEntry
          Class to represent an entry in the hash table.
LinkedHashSet
          This class provides a hashtable-backed implementation of the Set interface, with predictable traversal order.
LinkedList.Entry
          Class to represent an entry in the list.
List
          An ordered collection (also known as a list).
ListIterator
          An extended version of Iterator to support the extra features of Lists.
Locale
          Locales represent a specific country and culture.
Map
          An object that maps keys onto values.
Map.Entry
          A map entry (key-value pair).
NoSuchElementException
          Exception thrown when an attempt is made to access an element that does not exist.
Observable
          This class represents an object which is observable.
Observer
          Interface that is implemented when a class wants to be informed of changes in Observable objects.
Properties
          A set of persistent properties, which can be saved or loaded from a stream.
Random
          This class generates pseudorandom numbers.
RandomAccess
          Marker interface used to inform List implementations that they support fast (usually constant time) random access.
ResourceBundle
          A resource bundle contains locale-specific data.
ResourceBundle.BundleKey
          Cache key for the ResourceBundle cache.
Set
          A collection that contains no duplicates.
SortedMap
          A map which guarantees its key's iteration order.
SortedSet
          A set which guarantees its iteration order.
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.Node
          Class to represent an entry in the tree.
Vector
          The Vector classes implements growable arrays of Objects.
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.
WeakHashMap.WeakBucket.WeakEntry
          This class gives the Entry representation of the current bucket.
WeakHashMap.WeakEntrySet
          The entry set.