< A B C D E F G H I K L M N P R S T U V W

<

<S,T>copy(List<S>, List<T>) - Static method in class java.util.Collections
Copies all of the elements from one list into another.
<T,S>singletonMap(T, S) - Static method in class java.util.Collections
Returns an immutable map, mapping only the specified key to the specified value.
<T,S>synchronizedMap(Map<T,S>) - Static method in class java.util.Collections
Returns a synchronized (thread-safe) map backed by the specified map.
<T,S>synchronizedSortedMap(SortedMap<T,S>) - Static method in class java.util.Collections
Returns a synchronized (thread-safe) sorted map backed by the specified sorted map.
<T,S>unmodifiableMap(Map<T,S>) - Static method in class java.util.Collections
Returns an unmodifiable view of the specified map.
<T,S>unmodifiableSortedMap(SortedMap<T,S>) - Static method in class java.util.Collections
Returns an unmodifiable view of the specified sorted map.
<T>asList(T[]) - Static method in class java.util.Arrays
Returns a fixed-size list backed by the specified array.
<T>binarySearch(List<T>, T, Comparator<T>) - Static method in class java.util.Collections
Searches the specified list for the specified object using the binary search algorithm.
<T>binarySearch(T[], T) - Static method in class java.util.Arrays
Searches the specified array for the specified object using the binary search algorithm.
<T>binarySearch(T[], T, Comparator<T>) - Static method in class java.util.Arrays
Searches the specified array for the specified object using the binary search algorithm.
<T>containsAll(Collection<T>) - Method in interface java.util.Collection<E>
Returns true if this collection contains all of the elements in the specified collection.
<T>containsAll(Collection<T>) - Method in class java.util.AbstractCollection<E>
Returns true if this collection contains all of the elements in the specified collection.
<T>containsAll(Collection<T>) - Method in interface java.util.Set<E>
Returns true if this set contains all of the elements of the specified collection.
<T>containsAll(Collection<T>) - Method in interface java.util.List<E>
Returns true if this list contains all of the elements of the specified collection.
<T>containsAll(Collection<T>) - Method in class java.util.Vector<E>
Returns true if this Vector contains all of the elements in the specified Collection.
<T>enumeration(Collection<T>) - Static method in class java.util.Collections
Returns an enumeration over the specified collection.
<T>fill(List<T>, T) - Static method in class java.util.Collections
Replaces all of the elements of the specified list with the specified element.
<T>fill(T[], int, int, T) - Static method in class java.util.Arrays
Assigns the specified Object reference to each element of the specified range of the specified array of Objects.
<T>fill(T[], T) - Static method in class java.util.Arrays
Assigns the specified Object reference to each element of the specified array of Objects.
<T>iteratorBinarySearch(List<T>, Object) - Static method in class java.util.Collections
 
<T>iteratorBinarySearch(List<T>, T, Comparator<T>) - Static method in class java.util.Collections
 
<T>list(Enumeration<T>) - Static method in class java.util.Collections
Returns an array list containing the elements returned by the specified enumeration in the order they are returned by the enumeration.
<T>max(Collection<T>) - Static method in class java.util.Collections
Returns the maximum element of the given collection, according to the natural ordering of its elements.
<T>max(Collection<T>, Comparator<T>) - Static method in class java.util.Collections
Returns the maximum element of the given collection, according to the order induced by the specified comparator.
<T>min(Collection<T>) - Static method in class java.util.Collections
Returns the minimum element of the given collection, according to the natural ordering of its elements.
<T>min(Collection<T>, Comparator<T>) - Static method in class java.util.Collections
Returns the minimum element of the given collection, according to the order induced by the specified comparator.
<T>nCopies(int, T) - Static method in class java.util.Collections
Returns an immutable list consisting of n copies of the specified object.
<T>removeAll(Collection<T>) - Method in interface java.util.Collection<E>
Removes all this collection's elements that are also contained in the specified collection (optional operation).
<T>removeAll(Collection<T>) - Method in class java.util.AbstractCollection<E>
Removes from this collection all of its elements that are contained in the specified collection (optional operation).
<T>removeAll(Collection<T>) - Method in interface java.util.Set<E>
Removes from this set all of its elements that are contained in the specified collection (optional operation).
<T>removeAll(Collection<T>) - Method in class java.util.AbstractSet<E>
Removes from this set all of its elements that are contained in the specified collection (optional operation).
<T>removeAll(Collection<T>) - Method in interface java.util.List<E>
Removes from this list all the elements that are contained in the specified collection (optional operation).
<T>removeAll(Collection<T>) - Method in class java.util.Vector<E>
Removes from this Vector all of its elements that are contained in the specified Collection.
<T>replaceAll(List<T>, T, T) - Static method in class java.util.Collections
Replaces all occurrences of one specified value in a list with another.
<T>retainAll(Collection<T>) - Method in interface java.util.Collection<E>
Retains only the elements in this collection that are contained in the specified collection (optional operation).
<T>retainAll(Collection<T>) - Method in class java.util.AbstractCollection<E>
Retains only the elements in this collection that are contained in the specified collection (optional operation).
<T>retainAll(Collection<T>) - Method in interface java.util.Set<E>
Retains only the elements in this set that are contained in the specified collection (optional operation).
<T>retainAll(Collection<T>) - Method in interface java.util.List<E>
Retains only the elements in this list that are contained in the specified collection (optional operation).
<T>retainAll(Collection<T>) - Method in class java.util.Vector<E>
Retains only the elements in this Vector that are contained in the specified Collection.
<T>reverse(List<T>) - Static method in class java.util.Collections
Reverses the order of the elements in the specified list.
<T>rotate(List<T>, int) - Static method in class java.util.Collections
Rotates the elements in the specified list by the specified distance.
<T>shuffle(List<T>) - Static method in class java.util.Collections
Randomly permutes the specified list using a default source of randomness.
<T>shuffle(List<T>, Random) - Static method in class java.util.Collections
Randomly permute the specified list using the specified source of randomness.
<T>singletonList(T) - Static method in class java.util.Collections
Returns an immutable list containing only the specified object.
<T>sort(List<T>) - Static method in class java.util.Collections
Sorts the specified list into ascending order, according to the natural ordering of its elements.
<T>sort(List<T>, Comparator<T>) - Static method in class java.util.Collections
Sorts the specified list according to the order induced by the specified comparator.
<T>sort(T[]) - Static method in class java.util.Arrays
Sorts the specified array of objects into ascending order, according to the natural ordering of its elements.
<T>sort(T[], Comparator<T>) - Static method in class java.util.Arrays
Sorts the specified array of objects according to the order induced by the specified comparator.
<T>swap(List<T>, int, int) - Static method in class java.util.Collections
Swaps the elements at the specified positions in the specified list.
<T>synchronizedCollection(Collection<T>) - Static method in class java.util.Collections
Returns a synchronized (thread-safe) collection backed by the specified collection.
<T>synchronizedList(List<T>) - Static method in class java.util.Collections
Returns a synchronized (thread-safe) list backed by the specified list.
<T>synchronizedSet(Set<T>) - Static method in class java.util.Collections
Returns a synchronized (thread-safe) set backed by the specified set.
<T>synchronizedSortedSet(SortedSet<T>) - Static method in class java.util.Collections
Returns a synchronized (thread-safe) sorted set backed by the specified sorted set.
<T>toArray(T[]) - Method in interface java.util.Collection<E>
Returns an array containing all of the elements in this collection; the runtime type of the returned array is that of the specified array.
<T>toArray(T[]) - Method in class java.util.AbstractCollection<E>
Returns an array containing all of the elements in this collection; the runtime type of the returned array is that of the specified array.
<T>toArray(T[]) - Method in interface java.util.Set<E>
Returns an array containing all of the elements in this set; the runtime type of the returned array is that of the specified array.
<T>toArray(T[]) - Method in interface java.util.List<E>
Returns an array containing all of the elements in this list in proper sequence; the runtime type of the returned array is that of the specified array.
<T>toArray(T[]) - Method in class java.util.ArrayList<E>
Returns an array containing all of the elements in this list in the correct order; the runtime type of the returned array is that of the specified array.
<T>toArray(T[]) - Method in class java.util.LinkedList<E>
Returns an array containing all of the elements in this list in the correct order; the runtime type of the returned array is that of the specified array.
<T>toArray(T[]) - Method in class java.util.Vector<E>
Returns an array containing all of the elements in this Vector in the correct order; the runtime type of the returned array is that of the specified array.
<T>unmodifiableList(List<T>) - Static method in class java.util.Collections
Returns an unmodifiable view of the specified list.
<T>unmodifiableSet(Set<T>) - Static method in class java.util.Collections
Returns an unmodifiable view of the specified set.
<T>unmodifiableSortedSet(SortedSet<T>) - Static method in class java.util.Collections
Returns an unmodifiable view of the specified sorted set.

A

AbstractCollection() - Constructor for class java.util.AbstractCollection<E>
Sole constructor.
AbstractCollection<E> - class java.util.AbstractCollection<E>.
This class provides a skeletal implementation of the Collection interface, to minimize the effort required to implement this interface.
AbstractList() - Constructor for class java.util.AbstractList<A>
Sole constructor.
AbstractList<A> - class java.util.AbstractList<A>.
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).
AbstractMap() - Constructor for class java.util.AbstractMap<A,B>
Sole constructor.
AbstractMap<A,B> - class java.util.AbstractMap<A,B>.
This class provides a skeletal implementation of the Map interface, to minimize the effort required to implement this interface.
AbstractSequentialList() - Constructor for class java.util.AbstractSequentialList<A>
Sole constructor.
AbstractSequentialList<A> - class java.util.AbstractSequentialList<A>.
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).
AbstractSet() - Constructor for class java.util.AbstractSet<E>
Sole constructor.
AbstractSet<E> - class java.util.AbstractSet<E>.
This class provides a skeletal implementation of the Set interface to minimize the effort required to implement this interface.
add(A) - Method in class java.util.AbstractList<A>
Appends the specified element to the end of this List (optional operation).
add(E) - Method in interface java.util.Collection<E>
Ensures that this collection contains the specified element (optional operation).
add(E) - Method in class java.util.AbstractCollection<E>
Ensures that this collection contains the specified element (optional operation).
add(E) - Method in interface java.util.Set<E>
Adds the specified element to this set if it is not already present (optional operation).
add(E) - Method in interface java.util.List<E>
Appends the specified element to the end of this list (optional operation).
add(E) - Method in interface java.util.ListIterator<E>
Inserts the specified element into the list (optional operation).
add(E) - Method in class java.util.ArrayList<E>
Appends the specified element to the end of this list.
add(E) - Method in class java.util.LinkedList<E>
Appends the specified element to the end of this list.
add(E) - Method in class java.util.HashSet<E>
Adds the specified element to this set if it is not already present.
add(E) - Method in class java.util.TreeSet<E>
Adds the specified element to this set if it is not already present.
add(E) - Method in class java.util.Vector<E>
Appends the specified element to the end of this Vector.
add(int, A) - Method in class java.util.AbstractList<A>
Inserts the specified element at the specified position in this list (optional operation).
add(int, A) - Method in class java.util.AbstractSequentialList<A>
Inserts the specified element at the specified position in this list.
add(int, E) - Method in interface java.util.List<E>
Inserts the specified element at the specified position in this list (optional operation).
add(int, E) - Method in class java.util.ArrayList<E>
Inserts the specified element at the specified position in this list.
add(int, E) - Method in class java.util.LinkedList<E>
Inserts the specified element at the specified position in this list.
add(int, E) - Method in class java.util.Vector<E>
Inserts the specified element at the specified position in this Vector.
addAll(Collection<E>) - Method in interface java.util.Collection<E>
Adds all of the elements in the specified collection to this collection (optional operation).
addAll(Collection<E>) - Method in class java.util.AbstractCollection<E>
Adds all of the elements in the specified collection to this collection (optional operation).
addAll(Collection<E>) - Method in interface java.util.Set<E>
Adds all of the elements in the specified collection to this set if they're not already present (optional operation).
addAll(Collection<E>) - Method in interface java.util.List<E>
Appends all of the elements in the specified collection to the end of this list, in the order that they are returned by the specified collection's iterator (optional operation).
addAll(Collection<E>) - Method in class java.util.ArrayList<E>
Appends all of the elements in the specified Collection to the end of this list, in the order that they are returned by the specified Collection's Iterator.
addAll(Collection<E>) - Method in class java.util.LinkedList<E>
Appends all of the elements in the specified collection to the end of this list, in the order that they are returned by the specified collection's iterator.
addAll(Collection<E>) - Method in class java.util.TreeSet<E>
Adds all of the elements in the specified collection to this set.
addAll(Collection<E>) - Method in class java.util.Vector<E>
Appends all of the elements in the specified Collection to the end of this Vector, in the order that they are returned by the specified Collection's Iterator.
addAll(int, Collection<A>) - Method in class java.util.AbstractList<A>
Inserts all of the elements in the specified collection into this list at the specified position (optional operation).
addAll(int, Collection<A>) - Method in class java.util.AbstractSequentialList<A>
Inserts all of the elements in in the specified collection into this list at the specified position.
addAll(int, Collection<E>) - Method in interface java.util.List<E>
Inserts all of the elements in the specified collection into this list at the specified position (optional operation).
addAll(int, Collection<E>) - Method in class java.util.ArrayList<E>
Inserts all of the elements in the specified Collection into this list, starting at the specified position.
addAll(int, Collection<E>) - Method in class java.util.LinkedList<E>
Inserts all of the elements in the specified collection into this list, starting at the specified position.
addAll(int, Collection<E>) - Method in class java.util.Vector<E>
Inserts all of the elements in in the specified Collection into this Vector at the specified position.
addElement(E) - Method in class java.util.Vector<E>
Adds the specified component to the end of this vector, increasing its size by one.
addFirst(E) - Method in class java.util.LinkedList<E>
Inserts the given element at the beginning of this list.
addLast(E) - Method in class java.util.LinkedList<E>
Appends the given element to the end of this list.
ArrayList() - Constructor for class java.util.ArrayList<E>
Constructs an empty list.
ArrayList(Collection<E>) - Constructor for class java.util.ArrayList<E>
Constructs a list containing the elements of the specified collection, in the order they are returned by the collection's iterator.
ArrayList(int) - Constructor for class java.util.ArrayList<E>
Constructs an empty list with the specified initial capacity.
ArrayList<E> - class java.util.ArrayList<E>.
Resizable-array implementation of the List interface.
Arrays - class java.util.Arrays.
This class contains various methods for manipulating arrays (such as sorting and searching).

B

binarySearch(byte[], byte) - Static method in class java.util.Arrays
Searches the specified array of bytes for the specified value using the binary search algorithm.
binarySearch(char[], char) - Static method in class java.util.Arrays
Searches the specified array of chars for the specified value using the binary search algorithm.
binarySearch(double[], double) - Static method in class java.util.Arrays
Searches the specified array of doubles for the specified value using the binary search algorithm.
binarySearch(float[], float) - Static method in class java.util.Arrays
Searches the specified array of floats for the specified value using the binary search algorithm.
binarySearch(int[], int) - Static method in class java.util.Arrays
Searches the specified array of ints for the specified value using the binary search algorithm.
binarySearch(List, Object) - Static method in class java.util.Collections
Searches the specified list for the specified object using the binary search algorithm.
binarySearch(long[], long) - Static method in class java.util.Arrays
Searches the specified array of longs for the specified value using the binary search algorithm.
binarySearch(short[], short) - Static method in class java.util.Arrays
Searches the specified array of shorts for the specified value using the binary search algorithm.

C

capacity() - Method in class java.util.Vector<E>
Returns the current capacity of this vector.
capacityIncrement - Variable in class java.util.Vector<E>
The amount by which the capacity of the vector is automatically incremented when its size becomes greater than its capacity.
clear() - Method in interface java.util.Collection<E>
Removes all of the elements from this collection (optional operation).
clear() - Method in class java.util.AbstractCollection<E>
Removes all of the elements from this collection (optional operation).
clear() - Method in interface java.util.Set<E>
Removes all of the elements from this set (optional operation).
clear() - Method in interface java.util.List<E>
Removes all of the elements from this list (optional operation).
clear() - Method in class java.util.AbstractList<A>
Removes all of the elements from this collection (optional operation).
clear() - Method in interface java.util.Map<K,V>
Removes all mappings from this map (optional operation).
clear() - Method in class java.util.AbstractMap<A,B>
Removes all mappings from this map (optional operation).
clear() - Method in class java.util.ArrayList<E>
Removes all of the elements from this list.
clear() - Method in class java.util.LinkedList<E>
Removes all of the elements from this list.
clear() - Method in class java.util.HashMap<K,V>
Removes all mappings from this map.
clear() - Method in class java.util.HashSet<E>
Removes all of the elements from this set.
clear() - Method in class java.util.Hashtable<K,V>
Clears this hashtable so that it contains no keys.
clear() - Method in class java.util.IdentityHashMap<K,V>
Removes all mappings from this map.
clear() - Method in class java.util.LinkedHashMap<K,V>
Removes all mappings from this map.
clear() - Method in class java.util.TreeMap<K,V>
Removes all mappings from this TreeMap.
clear() - Method in class java.util.TreeSet<E>
Removes all of the elements from this set.
clear() - Method in class java.util.Vector<E>
Removes all of the elements from this Vector.
clear() - Method in class java.util.WeakHashMap<K,V>
Removes all mappings from this map.
clone() - Method in class java.util.AbstractMap<A,B>
Returns a shallow copy of this AbstractMap instance: the keys and values themselves are not cloned.
clone() - Method in class java.util.ArrayList<E>
Returns a shallow copy of this ArrayList instance.
clone() - Method in class java.util.LinkedList<E>
Returns a shallow copy of this LinkedList.
clone() - Method in class java.util.HashMap<K,V>
Returns a shallow copy of this HashMap instance: the keys and values themselves are not cloned.
clone() - Method in class java.util.HashSet<E>
Returns a shallow copy of this HashSet instance: the elements themselves are not cloned.
clone() - Method in class java.util.Hashtable<K,V>
Creates a shallow copy of this hashtable.
clone() - Method in class java.util.IdentityHashMap<K,V>
Returns a shallow copy of this identity hash map: the keys and values themselves are not cloned.
clone() - Method in class java.util.LinkedHashMap<K,V>
Returns a shallow copy of this LinkedHashMap instance: the keys and values themselves are not cloned.
clone() - Method in class java.util.TreeMap<K,V>
Returns a shallow copy of this TreeMap instance.
clone() - Method in class java.util.TreeSet<E>
Returns a shallow copy of this TreeSet instance.
clone() - Method in class java.util.Vector<E>
Returns a clone of this vector.
Collection<E> - interface java.util.Collection<E>.
The root interface in the collection hierarchy.
Collections - class java.util.Collections.
This class consists exclusively of static methods that operate on or return collections.
Comparable<T> - interface java.lang.Comparable<T>.
This interface imposes a total ordering on the objects of each class that implements it.
comparator() - Method in interface java.util.SortedMap<K,V>
Returns the comparator associated with this sorted map, or null if it uses its keys' natural ordering.
comparator() - Method in interface java.util.SortedSet<E>
Returns the comparator associated with this sorted set, or null if it uses its elements' natural ordering.
comparator() - Method in class java.util.TreeMap<K,V>
Returns the comparator used to order this map, or null if this map uses its keys' natural order.
comparator() - Method in class java.util.TreeSet<E>
Returns the comparator used to order this sorted set, or null if this tree set uses its elements natural ordering.
Comparator<A> - interface java.util.Comparator<A>.
A comparison function, which imposes a total ordering on some collection of objects.
compare(A, A) - Method in interface java.util.Comparator<A>
Compares its two arguments for order.
compareTo(T) - Method in interface java.lang.Comparable<T>
Compares this object with the specified object for order.
contains(Object) - Method in interface java.util.Collection<E>
Returns true if this collection contains the specified element.
contains(Object) - Method in class java.util.AbstractCollection<E>
Returns true if this collection contains the specified element.
contains(Object) - Method in interface java.util.Set<E>
Returns true if this set contains the specified element.
contains(Object) - Method in interface java.util.List<E>
Returns true if this list contains the specified element.
contains(Object) - Method in class java.util.ArrayList<E>
Returns true if this list contains the specified element.
contains(Object) - Method in class java.util.LinkedList<E>
Returns true if this list contains the specified element.
contains(Object) - Method in class java.util.HashSet<E>
Returns true if this set contains the specified element.
contains(Object) - Method in class java.util.Hashtable<K,V>
Tests if some key maps into the specified value in this hashtable.
contains(Object) - Method in class java.util.TreeSet<E>
Returns true if this set contains the specified element.
contains(Object) - Method in class java.util.Vector<E>
Tests if the specified object is a component in this vector.
containsKey(Object) - Method in interface java.util.Map<K,V>
Returns true if this map contains a mapping for the specified key.
containsKey(Object) - Method in class java.util.AbstractMap<A,B>
Returns true if this map contains a mapping for the specified key.
containsKey(Object) - Method in class java.util.HashMap<K,V>
Returns true if this map contains a mapping for the specified key.
containsKey(Object) - Method in class java.util.Hashtable<K,V>
Tests if the specified object is a key in this hashtable.
containsKey(Object) - Method in class java.util.IdentityHashMap<K,V>
Tests whether the specified object reference is a key in this identity hash map.
containsKey(Object) - Method in class java.util.TreeMap<K,V>
Returns true if this map contains a mapping for the specified key.
containsKey(Object) - Method in class java.util.WeakHashMap<K,V>
Returns true if this map contains a mapping for the specified key.
containsValue(Object) - Method in interface java.util.Map<K,V>
Returns true if this map maps one or more keys to the specified value.
containsValue(Object) - Method in class java.util.AbstractMap<A,B>
Returns true if this map maps one or more keys to this value.
containsValue(Object) - Method in class java.util.HashMap<K,V>
Returns true if this map maps one or more keys to the specified value.
containsValue(Object) - Method in class java.util.Hashtable<K,V>
Returns true if this Hashtable maps one or more keys to this value.
containsValue(Object) - Method in class java.util.IdentityHashMap<K,V>
Tests whether the specified object reference is a value in this identity hash map.
containsValue(Object) - Method in class java.util.LinkedHashMap<K,V>
Returns true if this map maps one or more keys to the specified value.
containsValue(Object) - Method in class java.util.TreeMap<K,V>
Returns true if this map maps one or more keys to the specified value.
copyInto(Object[]) - Method in class java.util.Vector<E>
Copies the components of this vector into the specified array.

D

Dictionary() - Constructor for class java.util.Dictionary<K,V>
Sole constructor.
Dictionary<K,V> - class java.util.Dictionary<K,V>.
The Dictionary class is the abstract parent of any class, such as Hashtable, which maps keys to values.

E

elementAt(int) - Method in class java.util.Vector<E>
Returns the component at the specified index.
elementCount - Variable in class java.util.Vector<E>
The number of valid components in this Vector object.
elementData - Variable in class java.util.Vector<E>
The array buffer into which the components of the vector are stored.
elements() - Method in class java.util.Dictionary<K,V>
Returns an enumeration of the values in this dictionary.
elements() - Method in class java.util.Hashtable<K,V>
Returns an enumeration of the values in this hashtable.
elements() - Method in class java.util.Vector<E>
Returns an enumeration of the components of this vector.
EMPTY_LIST - Static variable in class java.util.Collections
The empty list (immutable).
EMPTY_MAP - Static variable in class java.util.Collections
The empty map (immutable).
EMPTY_SET - Static variable in class java.util.Collections
The empty set (immutable).
empty() - Method in class java.util.Stack<E>
Tests if this stack is empty.
ensureCapacity(int) - Method in class java.util.ArrayList<E>
Increases the capacity of this ArrayList instance, if necessary, to ensure that it can hold at least the number of elements specified by the minimum capacity argument.
ensureCapacity(int) - Method in class java.util.Vector<E>
Increases the capacity of this vector, if necessary, to ensure that it can hold at least the number of components specified by the minimum capacity argument.
entrySet() - Method in interface java.util.Map<K,V>
Returns a set view of the mappings contained in this map.
entrySet() - Method in class java.util.AbstractMap<A,B>
Returns a set view of the mappings contained in this map.
entrySet() - Method in class java.util.HashMap<K,V>
Returns a collection view of the mappings contained in this map.
entrySet() - Method in class java.util.Hashtable<K,V>
Returns a Set view of the entries contained in this Hashtable.
entrySet() - Method in class java.util.IdentityHashMap<K,V>
Returns a set view of the mappings contained in this map.
entrySet() - Method in class java.util.TreeMap<K,V>
Returns a set view of the mappings contained in this map.
entrySet() - Method in class java.util.WeakHashMap<K,V>
Returns a Set view of the mappings in this map.
Enumeration<E> - interface java.util.Enumeration<E>.
An object that implements the Enumeration interface generates a series of elements, one at a time.
equals(boolean[], boolean[]) - Static method in class java.util.Arrays
Returns true if the two specified arrays of booleans are equal to one another.
equals(byte[], byte[]) - Static method in class java.util.Arrays
Returns true if the two specified arrays of bytes are equal to one another.
equals(char[], char[]) - Static method in class java.util.Arrays
Returns true if the two specified arrays of chars are equal to one another.
equals(double[], double[]) - Static method in class java.util.Arrays
Returns true if the two specified arrays of doubles are equal to one another.
equals(float[], float[]) - Static method in class java.util.Arrays
Returns true if the two specified arrays of floats are equal to one another.
equals(int[], int[]) - Static method in class java.util.Arrays
Returns true if the two specified arrays of ints are equal to one another.
equals(long[], long[]) - Static method in class java.util.Arrays
Returns true if the two specified arrays of longs are equal to one another.
equals(Object) - Method in interface java.util.Collection<E>
Compares the specified object with this collection for equality.
equals(Object) - Method in interface java.util.Set<E>
Compares the specified object with this set for equality.
equals(Object) - Method in class java.util.AbstractSet<E>
Compares the specified object with this set for equality.
equals(Object) - Method in interface java.util.List<E>
Compares the specified object with this list for equality.
equals(Object) - Method in class java.util.AbstractList<A>
Compares the specified object with this list for equality.
equals(Object) - Method in interface java.util.Map<K,V>
Compares the specified object with this map for equality.
equals(Object) - Method in interface java.util.Map.Entry<K,V>
Compares the specified object with this entry for equality.
equals(Object) - Method in class java.util.AbstractMap<A,B>
Compares the specified object with this map for equality.
equals(Object) - Method in interface java.util.Comparator<A>
Indicates whether some other object is "equal to" this Comparator.
equals(Object) - Method in class java.util.Hashtable<K,V>
Compares the specified Object with this Map for equality, as per the definition in the Map interface.
equals(Object) - Method in class java.util.IdentityHashMap<K,V>
Compares the specified object with this map for equality.
equals(Object) - Method in class java.util.Vector<E>
Compares the specified Object with this Vector for equality.
equals(Object[], Object[]) - Static method in class java.util.Arrays
Returns true if the two specified arrays of Objects are equal to one another.
equals(short[], short[]) - Static method in class java.util.Arrays
Returns true if the two specified arrays of shorts are equal to one another.

F

fill(boolean[], boolean) - Static method in class java.util.Arrays
Assigns the specified boolean value to each element of the specified array of booleans.
fill(boolean[], int, int, boolean) - Static method in class java.util.Arrays
Assigns the specified boolean value to each element of the specified range of the specified array of booleans.
fill(byte[], byte) - Static method in class java.util.Arrays
Assigns the specified byte value to each element of the specified array of bytes.
fill(byte[], int, int, byte) - Static method in class java.util.Arrays
Assigns the specified byte value to each element of the specified range of the specified array of bytes.
fill(char[], char) - Static method in class java.util.Arrays
Assigns the specified char value to each element of the specified array of chars.
fill(char[], int, int, char) - Static method in class java.util.Arrays
Assigns the specified char value to each element of the specified range of the specified array of chars.
fill(double[], double) - Static method in class java.util.Arrays
Assigns the specified double value to each element of the specified array of doubles.
fill(double[], int, int, double) - Static method in class java.util.Arrays
Assigns the specified double value to each element of the specified range of the specified array of doubles.
fill(float[], float) - Static method in class java.util.Arrays
Assigns the specified float value to each element of the specified array of floats.
fill(float[], int, int, float) - Static method in class java.util.Arrays
Assigns the specified float value to each element of the specified range of the specified array of floats.
fill(int[], int) - Static method in class java.util.Arrays
Assigns the specified int value to each element of the specified array of ints.
fill(int[], int, int, int) - Static method in class java.util.Arrays
Assigns the specified int value to each element of the specified range of the specified array of ints.
fill(long[], int, int, long) - Static method in class java.util.Arrays
Assigns the specified long value to each element of the specified range of the specified array of longs.
fill(long[], long) - Static method in class java.util.Arrays
Assigns the specified long value to each element of the specified array of longs.
fill(short[], int, int, short) - Static method in class java.util.Arrays
Assigns the specified short value to each element of the specified range of the specified array of shorts.
fill(short[], short) - Static method in class java.util.Arrays
Assigns the specified short value to each element of the specified array of shorts.
first() - Method in interface java.util.SortedSet<E>
Returns the first (lowest) element currently in this sorted set.
first() - Method in class java.util.TreeSet<E>
Returns the first (lowest) element currently in this sorted set.
firstElement() - Method in class java.util.Vector<E>
Returns the first component (the item at index 0) of this vector.
firstKey() - Method in interface java.util.SortedMap<K,V>
Returns the first (lowest) key currently in this sorted map.
firstKey() - Method in class java.util.TreeMap<K,V>
Returns the first (lowest) key currently in this sorted map.

G

get(int) - Method in interface java.util.List<E>
Returns the element at the specified position in this list.
get(int) - Method in class java.util.AbstractList<A>
Returns the element at the specified position in this list.
get(int) - Method in class java.util.ArrayList<E>
Returns the element at the specified position in this list.
get(int) - Method in class java.util.AbstractSequentialList<A>
Returns the element at the specified position in this list.
get(int) - Method in class java.util.LinkedList<E>
Returns the element at the specified position in this list.
get(int) - Method in class java.util.Vector<E>
Returns the element at the specified position in this Vector.
get(Object) - Method in interface java.util.Map<K,V>
Returns the value to which this map maps the specified key.
get(Object) - Method in class java.util.AbstractMap<A,B>
Returns the value to which this map maps the specified key.
get(Object) - Method in class java.util.Dictionary<K,V>
Returns the value to which the key is mapped in this dictionary.
get(Object) - Method in class java.util.HashMap<K,V>
Returns the value to which this map maps the specified key.
get(Object) - Method in class java.util.Hashtable<K,V>
Returns the value to which the specified key is mapped in this hashtable.
get(Object) - Method in class java.util.IdentityHashMap<K,V>
Returns the value to which the specified key is mapped in this identity hash map, or null if the map contains no mapping for this key.
get(Object) - Method in class java.util.LinkedHashMap<K,V>
Returns the value to which this map maps the specified key.
get(Object) - Method in class java.util.TreeMap<K,V>
Returns the value to which this map maps the specified key.
get(Object) - Method in class java.util.WeakHashMap<K,V>
Returns the value to which this map maps the specified key.
getFirst() - Method in class java.util.LinkedList<E>
Returns the first element in this list.
getKey() - Method in interface java.util.Map.Entry<K,V>
Returns the key corresponding to this entry.
getLast() - Method in class java.util.LinkedList<E>
Returns the last element in this list.
getValue() - Method in interface java.util.Map.Entry<K,V>
Returns the value corresponding to this entry.

H

hashCode() - Method in interface java.util.Collection<E>
Returns the hash code value for this collection.
hashCode() - Method in interface java.util.Set<E>
Returns the hash code value for this set.
hashCode() - Method in class java.util.AbstractSet<E>
Returns the hash code value for this set.
hashCode() - Method in interface java.util.List<E>
Returns the hash code value for this list.
hashCode() - Method in class java.util.AbstractList<A>
Returns the hash code value for this list.
hashCode() - Method in interface java.util.Map<K,V>
Returns the hash code value for this map.
hashCode() - Method in interface java.util.Map.Entry<K,V>
Returns the hash code value for this map entry.
hashCode() - Method in class java.util.AbstractMap<A,B>
Returns the hash code value for this map.
hashCode() - Method in class java.util.Hashtable<K,V>
Returns the hash code value for this Map as per the definition in the Map interface.
hashCode() - Method in class java.util.IdentityHashMap<K,V>
Returns the hash code value for this map.
hashCode() - Method in class java.util.Vector<E>
Returns the hash code value for this Vector.
HashMap() - Constructor for class java.util.HashMap<K,V>
Constructs a new, empty map with a default capacity and load factor, which is 0.75.
HashMap(int) - Constructor for class java.util.HashMap<K,V>
Constructs a new, empty map with the specified initial capacity and default load factor, which is 0.75.
HashMap(int, float) - Constructor for class java.util.HashMap<K,V>
Constructs a new, empty map with the specified initial capacity and the specified load factor.
HashMap(Map<K,V>) - Constructor for class java.util.HashMap<K,V>
Constructs a new map with the same mappings as the given map.
HashMap<K,V> - class java.util.HashMap<K,V>.
Hash table based implementation of the Map interface.
HashSet() - Constructor for class java.util.HashSet<E>
Constructs a new, empty set; the backing HashMap instance has default capacity and load factor, which is 0.75.
HashSet(Collection<E>) - Constructor for class java.util.HashSet<E>
Constructs a new set containing the elements in the specified collection.
HashSet(int) - Constructor for class java.util.HashSet<E>
Constructs a new, empty set; the backing HashMap instance has the specified initial capacity and default load factor, which is 0.75.
HashSet(int, float) - Constructor for class java.util.HashSet<E>
Constructs a new, empty set; the backing HashMap instance has the specified initial capacity and the specified load factor.
HashSet<E> - class java.util.HashSet<E>.
This class implements the Set interface, backed by a hash table (actually a HashMap instance).
Hashtable() - Constructor for class java.util.Hashtable<K,V>
Constructs a new, empty hashtable with a default capacity and load factor, which is 0.75.
Hashtable(int) - Constructor for class java.util.Hashtable<K,V>
Constructs a new, empty hashtable with the specified initial capacity and default load factor, which is 0.75.
Hashtable(int, float) - Constructor for class java.util.Hashtable<K,V>
Constructs a new, empty hashtable with the specified initial capacity and the specified load factor.
Hashtable(Map) - Constructor for class java.util.Hashtable<K,V>
Constructs a new hashtable with the same mappings as the given Map.
Hashtable<K,V> - class java.util.Hashtable<K,V>.
This class implements a hashtable, which maps keys to values.
hasMoreElements() - Method in interface java.util.Enumeration<E>
Tests if this enumeration contains more elements.
hasNext() - Method in interface java.util.Iterator<E>
Returns true if the iteration has more elements.
hasNext() - Method in interface java.util.ListIterator<E>
Returns true if this list iterator has more elements when traversing the list in the forward direction.
hasPrevious() - Method in interface java.util.ListIterator<E>
Returns true if this list iterator has more elements when traversing the list in the reverse direction.
headMap(K) - Method in interface java.util.SortedMap<K,V>
Returns a view of the portion of this sorted map whose keys are strictly less than toKey.
headMap(K) - Method in class java.util.TreeMap<K,V>
Returns a view of the portion of this map whose keys are strictly less than toKey.
headSet(E) - Method in interface java.util.SortedSet<E>
Returns a view of the portion of this sorted set whose elements are strictly less than toElement.
headSet(E) - Method in class java.util.TreeSet<E>
Returns a view of the portion of this set whose elements are strictly less than toElement.

I

IdentityHashMap() - Constructor for class java.util.IdentityHashMap<K,V>
Constructs a new, empty identity hash map with a default expected maximum size (21).
IdentityHashMap(int) - Constructor for class java.util.IdentityHashMap<K,V>
Constructs a new, empty map with the specified expected maximum size.
IdentityHashMap(Map<K,V>) - Constructor for class java.util.IdentityHashMap<K,V>
Constructs a new identity hash map containing the keys-value mappings in the specified map.
IdentityHashMap<K,V> - class java.util.IdentityHashMap<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).
indexOf(Object) - Method in interface java.util.List<E>
Returns the index in this list of the first occurrence of the specified element, or -1 if this list does not contain this element.
indexOf(Object) - Method in class java.util.AbstractList<A>
Returns the index in this list of the first occurence of the specified element, or -1 if the list does not contain this element.
indexOf(Object) - Method in class java.util.ArrayList<E>
Searches for the first occurence of the given argument, testing for equality using the equals method.
indexOf(Object) - Method in class java.util.LinkedList<E>
Returns the index in this list of the first occurrence of the specified element, or -1 if the List does not contain this element.
indexOf(Object) - Method in class java.util.Vector<E>
Searches for the first occurence of the given argument, testing for equality using the equals method.
indexOf(Object, int) - Method in class java.util.Vector<E>
Searches for the first occurence of the given argument, beginning the search at index, and testing for equality using the equals method.
indexOfSubList(List, List) - Static method in class java.util.Collections
Returns the starting position of the first occurrence of the specified target list within the specified source list, or -1 if there is no such occurrence.
insertElementAt(E, int) - Method in class java.util.Vector<E>
Inserts the specified object as a component in this vector at the specified index.
isEmpty() - Method in interface java.util.Collection<E>
Returns true if this collection contains no elements.
isEmpty() - Method in class java.util.AbstractCollection<E>
Returns true if this collection contains no elements.
isEmpty() - Method in interface java.util.Set<E>
Returns true if this set contains no elements.
isEmpty() - Method in interface java.util.List<E>
Returns true if this list contains no elements.
isEmpty() - Method in interface java.util.Map<K,V>
Returns true if this map contains no key-value mappings.
isEmpty() - Method in class java.util.AbstractMap<A,B>
Returns true if this map contains no key-value mappings.
isEmpty() - Method in class java.util.ArrayList<E>
Tests if this list has no elements.
isEmpty() - Method in class java.util.Dictionary<K,V>
Tests if this dictionary maps no keys to value.
isEmpty() - Method in class java.util.HashMap<K,V>
Returns true if this map contains no key-value mappings.
isEmpty() - Method in class java.util.HashSet<E>
Returns true if this set contains no elements.
isEmpty() - Method in class java.util.Hashtable<K,V>
Tests if this hashtable maps no keys to values.
isEmpty() - Method in class java.util.IdentityHashMap<K,V>
Returns true if this identity hash map contains no key-value mappings.
isEmpty() - Method in class java.util.TreeSet<E>
Returns true if this set contains no elements.
isEmpty() - Method in class java.util.Vector<E>
Tests if this vector has no components.
isEmpty() - Method in class java.util.WeakHashMap<K,V>
Returns true if this map contains no key-value mappings.
iterator() - Method in interface java.util.Collection<E>
Returns an iterator over the elements in this collection.
iterator() - Method in class java.util.AbstractCollection<E>
Returns an iterator over the elements contained in this collection.
iterator() - Method in interface java.util.Set<E>
Returns an iterator over the elements in this set.
iterator() - Method in interface java.util.List<E>
Returns an iterator over the elements in this list in proper sequence.
iterator() - Method in class java.util.AbstractList<A>
Returns an iterator over the elements in this list in proper sequence.
iterator() - Method in class java.util.AbstractSequentialList<A>
Returns an iterator over the elements in this list (in proper sequence).
iterator() - Method in class java.util.HashSet<E>
Returns an iterator over the elements in this set.
iterator() - Method in class java.util.TreeSet<E>
Returns an iterator over the elements in this set.
Iterator<E> - interface java.util.Iterator<E>.
An iterator over a collection.

K

keys() - Method in class java.util.Dictionary<K,V>
Returns an enumeration of the keys in this dictionary.
keys() - Method in class java.util.Hashtable<K,V>
Returns an enumeration of the keys in this hashtable.
keySet() - Method in interface java.util.Map<K,V>
Returns a set view of the keys contained in this map.
keySet() - Method in class java.util.AbstractMap<A,B>
Returns a Set view of the keys contained in this map.
keySet() - Method in class java.util.HashMap<K,V>
Returns a set view of the keys contained in this map.
keySet() - Method in class java.util.Hashtable<K,V>
Returns a Set view of the keys contained in this Hashtable.
keySet() - Method in class java.util.IdentityHashMap<K,V>
Returns an identity-based set view of the keys contained in this map.
keySet() - Method in class java.util.TreeMap<K,V>
Returns a Set view of the keys contained in this map.

L

last() - Method in interface java.util.SortedSet<E>
Returns the last (highest) element currently in this sorted set.
last() - Method in class java.util.TreeSet<E>
Returns the last (highest) element currently in this sorted set.
lastElement() - Method in class java.util.Vector<E>
Returns the last component of the vector.
lastIndexOf(Object) - Method in interface java.util.List<E>
Returns the index in this list of the last occurrence of the specified element, or -1 if this list does not contain this element.
lastIndexOf(Object) - Method in class java.util.AbstractList<A>
Returns the index in this list of the last occurence of the specified element, or -1 if the list does not contain this element.
lastIndexOf(Object) - Method in class java.util.ArrayList<E>
Returns the index of the last occurrence of the specified object in this list.
lastIndexOf(Object) - Method in class java.util.LinkedList<E>
Returns the index in this list of the last occurrence of the specified element, or -1 if the list does not contain this element.
lastIndexOf(Object) - Method in class java.util.Vector<E>
Returns the index of the last occurrence of the specified object in this vector.
lastIndexOf(Object, int) - Method in class java.util.Vector<E>
Searches backwards for the specified object, starting from the specified index, and returns an index to it.
lastIndexOfSubList(List, List) - Static method in class java.util.Collections
Returns the starting position of the last occurrence of the specified target list within the specified source list, or -1 if there is no such occurrence.
lastKey() - Method in interface java.util.SortedMap<K,V>
Returns the last (highest) key currently in this sorted map.
lastKey() - Method in class java.util.TreeMap<K,V>
Returns the last (highest) key currently in this sorted map.
LinkedHashMap() - Constructor for class java.util.LinkedHashMap<K,V>
Constructs a new, empty insertion-ordered LinkedHashMap instance with a default capacity and load factor (0.75).
LinkedHashMap(int) - Constructor for class java.util.LinkedHashMap<K,V>
Constructs a new, empty insertion-ordered LinkedHashMap instance with the specified initial capacity and a default load factor (0.75).
LinkedHashMap(int, float) - Constructor for class java.util.LinkedHashMap<K,V>
Constructs a new, empty insertion-ordered LinkedHashMap instance with the specified initial capacity and load factor.
LinkedHashMap(int, float, boolean) - Constructor for class java.util.LinkedHashMap<K,V>
Constructs a new, empty linked hash map with the specified initial capacity, load factor and ordering mode.
LinkedHashMap(Map<K,V>) - Constructor for class java.util.LinkedHashMap<K,V>
Constructs a new insertion-ordered LinkedHashMap instance with the same mappings as the specified map.
LinkedHashMap<K,V> - class java.util.LinkedHashMap<K,V>.
Hash table and linked list implementation of the Map interface, with predictable iteration order.
LinkedHashSet() - Constructor for class java.util.LinkedHashSet<E>
Constructs a new, empty linked hash set with the default initial capacity and load factor (0.75).
LinkedHashSet(Collection<E>) - Constructor for class java.util.LinkedHashSet<E>
Constructs a new linked hash set with the same elements as the specified collection.
LinkedHashSet(int) - Constructor for class java.util.LinkedHashSet<E>
Constructs a new, empty linked hash set with the specified initial capacity and the default load factor (0.75).
LinkedHashSet(int, float) - Constructor for class java.util.LinkedHashSet<E>
Constructs a new, empty linked hash set with the specified initial capacity and load factor.
LinkedHashSet<E> - class java.util.LinkedHashSet<E>.
Hash table and linked list implementation of the Set interface, with predictable iteration order.
LinkedList() - Constructor for class java.util.LinkedList<E>
Constructs an empty list.
LinkedList(Collection<E>) - Constructor for class java.util.LinkedList<E>
Constructs a list containing the elements of the specified collection, in the order they are returned by the collection's iterator.
LinkedList<E> - class java.util.LinkedList<E>.
Linked list implementation of the List interface.
List<E> - interface java.util.List<E>.
An ordered collection (also known as a sequence).
listIterator() - Method in interface java.util.List<E>
Returns a list iterator of the elements in this list (in proper sequence).
listIterator() - Method in class java.util.AbstractList<A>
Returns an iterator of the elements in this list (in proper sequence).
listIterator(int) - Method in interface java.util.List<E>
Returns a list iterator of the elements in this list (in proper sequence), starting at the specified position in this list.
listIterator(int) - Method in class java.util.AbstractList<A>
Returns a list iterator of the elements in this list (in proper sequence), starting at the specified position in the list.
listIterator(int) - Method in class java.util.AbstractSequentialList<A>
Returns a list iterator over the elements in this list (in proper sequence).
listIterator(int) - Method in class java.util.LinkedList<E>
Returns a list-iterator of the elements in this list (in proper sequence), starting at the specified position in the list.
ListIterator<E> - interface java.util.ListIterator<E>.
An iterator for lists that allows the programmer to traverse the list in either direction, modify the list during iteration, and obtain the iterator's current position in the list.

M

Map.Entry<K,V> - interface java.util.Map.Entry<K,V>.
A map entry (key-value pair).
Map<K,V> - interface java.util.Map<K,V>.
An object that maps keys to values.
modCount - Variable in class java.util.AbstractList<A>
The number of times this list has been structurally modified.

N

next() - Method in interface java.util.Iterator<E>
Returns the next element in the iteration.
next() - Method in interface java.util.ListIterator<E>
Returns the next element in the list.
nextElement() - Method in interface java.util.Enumeration<E>
Returns the next element of this enumeration if this enumeration object has at least one more element to provide.
nextIndex() - Method in interface java.util.ListIterator<E>
Returns the index of the element that would be returned by a subsequent call to next.

P

peek() - Method in class java.util.Stack<E>
Looks at the object at the top of this stack without removing it from the stack.
pop() - Method in class java.util.Stack<E>
Removes the object at the top of this stack and returns that object as the value of this function.
previous() - Method in interface java.util.ListIterator<E>
Returns the previous element in the list.
previousIndex() - Method in interface java.util.ListIterator<E>
Returns the index of the element that would be returned by a subsequent call to previous.
push(E) - Method in class java.util.Stack<E>
Pushes an item onto the top of this stack.
put(A, B) - Method in class java.util.AbstractMap<A,B>
Associates the specified value with the specified key in this map (optional operation).
put(K, V) - Method in interface java.util.Map<K,V>
Associates the specified value with the specified key in this map (optional operation).
put(K, V) - Method in class java.util.Dictionary<K,V>
Maps the specified key to the specified value in this dictionary.
put(K, V) - Method in class java.util.HashMap<K,V>
Associates the specified value with the specified key in this map.
put(K, V) - Method in class java.util.Hashtable<K,V>
Maps the specified key to the specified value in this hashtable.
put(K, V) - Method in class java.util.IdentityHashMap<K,V>
Associates the specified value with the specified key in this identity hash map.
put(K, V) - Method in class java.util.TreeMap<K,V>
Associates the specified value with the specified key in this map.
put(K, V) - Method in class java.util.WeakHashMap<K,V>
Updates this map so that the given key maps to the given value.
putAll(Map<A,B>) - Method in class java.util.AbstractMap<A,B>
Copies all of the mappings from the specified map to this map (optional operation).
putAll(Map<K,V>) - Method in interface java.util.Map<K,V>
Copies all of the mappings from the specified map to this map (optional operation).
putAll(Map<K,V>) - Method in class java.util.Hashtable<K,V>
Copies all of the mappings from the specified Map to this Hashtable These mappings will replace any mappings that this Hashtable had for any of the keys currently in the specified Map.
putAll(Map<K,V>) - Method in class java.util.TreeMap<K,V>
Copies all of the mappings from the specified map to this map.

R

rehash() - Method in class java.util.Hashtable<K,V>
Increases the capacity of and internally reorganizes this hashtable, in order to accommodate and access its entries more efficiently.
remove() - Method in interface java.util.Iterator<E>
Removes from the underlying collection the last element returned by the iterator (optional operation).
remove() - Method in interface java.util.ListIterator<E>
Removes from the list the last element that was returned by next or previous (optional operation).
remove(int) - Method in interface java.util.List<E>
Removes the element at the specified position in this list (optional operation).
remove(int) - Method in class java.util.AbstractList<A>
Removes the element at the specified position in this list (optional operation).
remove(int) - Method in class java.util.ArrayList<E>
Removes the element at the specified position in this list.
remove(int) - Method in class java.util.AbstractSequentialList<A>
Removes the element at the specified position in this list.
remove(int) - Method in class java.util.LinkedList<E>
Removes the element at the specified position in this list.
remove(int) - Method in class java.util.Vector<E>
Removes the element at the specified position in this Vector.
remove(Object) - Method in interface java.util.Collection<E>
Removes a single instance of the specified element from this collection, if it is present (optional operation).
remove(Object) - Method in class java.util.AbstractCollection<E>
Removes a single instance of the specified element from this collection, if it is present (optional operation).
remove(Object) - Method in interface java.util.Set<E>
Removes the specified element from this set if it is present (optional operation).
remove(Object) - Method in interface java.util.List<E>
Removes the first occurrence in this list of the specified element (optional operation).
remove(Object) - Method in interface java.util.Map<K,V>
Removes the mapping for this key from this map if present (optional operation).
remove(Object) - Method in class java.util.AbstractMap<A,B>
Removes the mapping for this key from this map if present (optional operation).
remove(Object) - Method in class java.util.LinkedList<E>
Removes the first occurrence of the specified element in this list.
remove(Object) - Method in class java.util.Dictionary<K,V>
Removes the key (and its corresponding value) from this dictionary.
remove(Object) - Method in class java.util.HashMap<K,V>
Removes the mapping for this key from this map if present.
remove(Object) - Method in class java.util.HashSet<E>
Removes the given element from this set if it is present.
remove(Object) - Method in class java.util.Hashtable<K,V>
Removes the key (and its corresponding value) from this hashtable.
remove(Object) - Method in class java.util.IdentityHashMap<K,V>
Removes the mapping for this key from this map if present.
remove(Object) - Method in class java.util.LinkedHashMap<K,V>
Removes the mapping for this key from this map if present.
remove(Object) - Method in class java.util.TreeMap<K,V>
Removes the mapping for this key from this TreeMap if present.
remove(Object) - Method in class java.util.TreeSet<E>
Removes the given element from this set if it is present.
remove(Object) - Method in class java.util.Vector<E>
Removes the first occurrence of the specified element in this Vector If the Vector does not contain the element, it is unchanged.
remove(Object) - Method in class java.util.WeakHashMap<K,V>
Removes the mapping for the given key from this map, if present.
removeAllElements() - Method in class java.util.Vector<E>
Removes all components from this vector and sets its size to zero.
removeElement(Object) - Method in class java.util.Vector<E>
Removes the first (lowest-indexed) occurrence of the argument from this vector.
removeElementAt(int) - Method in class java.util.Vector<E>
Deletes the component at the specified index.
removeFirst() - Method in class java.util.LinkedList<E>
Removes and returns the first element from this list.
removeLast() - Method in class java.util.LinkedList<E>
Removes and returns the last element from this list.
removeRange(int, int) - Method in class java.util.AbstractList<A>
Removes from this list all of the elements whose index is between fromIndex, inclusive, and toIndex, exclusive.
removeRange(int, int) - Method in class java.util.ArrayList<E>
Removes from this List all of the elements whose index is between fromIndex, inclusive and toIndex, exclusive.
removeRange(int, int) - Method in class java.util.Vector<E>
Removes from this List all of the elements whose index is between fromIndex, inclusive and toIndex, exclusive.
reverseOrder() - Static method in class java.util.Collections
Returns a comparator that imposes the reverse of the natural ordering on a collection of objects that implement the Comparable interface.

S

search(Object) - Method in class java.util.Stack<E>
Returns the 1-based position where an object is on this stack.
set(E) - Method in interface java.util.ListIterator<E>
Replaces the last element returned by next or previous with the specified element (optional operation).
set(int, A) - Method in class java.util.AbstractList<A>
Replaces the element at the specified position in this list with the specified element (optional operation).
set(int, A) - Method in class java.util.AbstractSequentialList<A>
Replaces the element at the specified position in this list with the specified element.
set(int, E) - Method in interface java.util.List<E>
Replaces the element at the specified position in this list with the specified element (optional operation).
set(int, E) - Method in class java.util.ArrayList<E>
Replaces the element at the specified position in this list with the specified element.
set(int, E) - Method in class java.util.LinkedList<E>
Replaces the element at the specified position in this list with the specified element.
set(int, E) - Method in class java.util.Vector<E>
Replaces the element at the specified position in this Vector with the specified element.
Set<E> - interface java.util.Set<E>.
A collection that contains no duplicate elements.
setElementAt(E, int) - Method in class java.util.Vector<E>
Sets the component at the specified index of this vector to be the specified object.
setSize(int) - Method in class java.util.Vector<E>
Sets the size of this vector.
setValue(V) - Method in interface java.util.Map.Entry<K,V>
Replaces the value corresponding to this entry with the specified value (optional operation).
singleton(Object) - Static method in class java.util.Collections
Returns an immutable set containing only the specified object.
size() - Method in interface java.util.Collection<E>
Returns the number of elements in this collection.
size() - Method in class java.util.AbstractCollection<E>
Returns the number of elements in this collection.
size() - Method in interface java.util.Set<E>
Returns the number of elements in this set (its cardinality).
size() - Method in interface java.util.List<E>
Returns the number of elements in this list.
size() - Method in interface java.util.Map<K,V>
Returns the number of key-value mappings in this map.
size() - Method in class java.util.AbstractMap<A,B>
Returns the number of key-value mappings in this map.
size() - Method in class java.util.ArrayList<E>
Returns the number of elements in this list.
size() - Method in class java.util.LinkedList<E>
Returns the number of elements in this list.
size() - Method in class java.util.Dictionary<K,V>
Returns the number of entries (dinstint keys) in this dictionary.
size() - Method in class java.util.HashMap<K,V>
Returns the number of key-value mappings in this map.
size() - Method in class java.util.HashSet<E>
Returns the number of elements in this set (its cardinality).
size() - Method in class java.util.Hashtable<K,V>
Returns the number of keys in this hashtable.
size() - Method in class java.util.IdentityHashMap<K,V>
Returns the number of key-value mappings in this identity hash map.
size() - Method in class java.util.TreeMap<K,V>
Returns the number of key-value mappings in this map.
size() - Method in class java.util.TreeSet<E>
Returns the number of elements in this set (its cardinality).
size() - Method in class java.util.Vector<E>
Returns the number of components in this vector.
size() - Method in class java.util.WeakHashMap<K,V>
Returns the number of key-value mappings in this map.
sort(byte[]) - Static method in class java.util.Arrays
Sorts the specified array of bytes into ascending numerical order.
sort(byte[], int, int) - Static method in class java.util.Arrays
Sorts the specified range of the specified array of bytes into ascending numerical order.
sort(char[]) - Static method in class java.util.Arrays
Sorts the specified array of chars into ascending numerical order.
sort(char[], int, int) - Static method in class java.util.Arrays
Sorts the specified range of the specified array of chars into ascending numerical order.
sort(double[]) - Static method in class java.util.Arrays
Sorts the specified array of doubles into ascending numerical order.
sort(double[], int, int) - Static method in class java.util.Arrays
Sorts the specified range of the specified array of doubles into ascending numerical order.
sort(float[]) - Static method in class java.util.Arrays
Sorts the specified array of floats into ascending numerical order.
sort(float[], int, int) - Static method in class java.util.Arrays
Sorts the specified range of the specified array of floats into ascending numerical order.
sort(int[]) - Static method in class java.util.Arrays
Sorts the specified array of ints into ascending numerical order.
sort(int[], int, int) - Static method in class java.util.Arrays
Sorts the specified range of the specified array of ints into ascending numerical order.
sort(long[]) - Static method in class java.util.Arrays
Sorts the specified array of longs into ascending numerical order.
sort(long[], int, int) - Static method in class java.util.Arrays
Sorts the specified range of the specified array of longs into ascending numerical order.
sort(Object[], int, int) - Static method in class java.util.Arrays
Sorts the specified range of the specified array of objects into ascending order, according to the natural ordering of its elements.
sort(Object[], int, int, Comparator) - Static method in class java.util.Arrays
Sorts the specified range of the specified array of objects according to the order induced by the specified comparator.
sort(short[]) - Static method in class java.util.Arrays
Sorts the specified array of shorts into ascending numerical order.
sort(short[], int, int) - Static method in class java.util.Arrays
Sorts the specified range of the specified array of shorts into ascending numerical order.
SortedMap<K,V> - interface java.util.SortedMap<K,V>.
A map that further guarantees that it will be in ascending key order, sorted according to the natural ordering of its keys (see the Comparable interface), or by a comparator provided at sorted map creation time.
SortedSet<E> - interface java.util.SortedSet<E>.
A set that further guarantees that its iterator will traverse the set in ascending element order, sorted according to the natural ordering of its elements (see Comparable), or by a Comparator provided at sorted set creation time.
Stack() - Constructor for class java.util.Stack<E>
Creates an empty Stack.
Stack<E> - class java.util.Stack<E>.
The Stack class represents a last-in-first-out (LIFO) stack of objects.
subList(int, int) - Method in interface java.util.List<E>
Returns a view of the portion of this list between the specified fromIndex, inclusive, and toIndex, exclusive.
subList(int, int) - Method in class java.util.AbstractList<A>
Returns a view of the portion of this list between fromIndex, inclusive, and toIndex, exclusive.
subList(int, int) - Method in class java.util.Vector<E>
Returns a view of the portion of this List between fromIndex, inclusive, and toIndex, exclusive.
subMap(K, K) - Method in interface java.util.SortedMap<K,V>
Returns a view of the portion of this sorted map whose keys range from fromKey, inclusive, to toKey, exclusive.
subMap(K, K) - Method in class java.util.TreeMap<K,V>
Returns a view of the portion of this map whose keys range from fromKey, inclusive, to toKey, exclusive.
subSet(E, E) - Method in interface java.util.SortedSet<E>
Returns a view of the portion of this sorted set whose elements range from fromElement, inclusive, to toElement, exclusive.
subSet(E, E) - Method in class java.util.TreeSet<E>
Returns a view of the portion of this set whose elements range from fromElement, inclusive, to toElement, exclusive.

T

tailMap(K) - Method in interface java.util.SortedMap<K,V>
Returns a view of the portion of this sorted map whose keys are greater than or equal to fromKey.
tailMap(K) - Method in class java.util.TreeMap<K,V>
Returns a view of the portion of this map whose keys are greater than or equal to fromKey.
tailSet(E) - Method in interface java.util.SortedSet<E>
Returns a view of the portion of this sorted set whose elements are greater than or equal to fromElement.
tailSet(E) - Method in class java.util.TreeSet<E>
Returns a view of the portion of this set whose elements are greater than or equal to fromElement.
toArray() - Method in interface java.util.Collection<E>
Returns an array containing all of the elements in this collection.
toArray() - Method in class java.util.AbstractCollection<E>
Returns an array containing all of the elements in this collection.
toArray() - Method in interface java.util.Set<E>
Returns an array containing all of the elements in this set.
toArray() - Method in interface java.util.List<E>
Returns an array containing all of the elements in this list in proper sequence.
toArray() - Method in class java.util.ArrayList<E>
Returns an array containing all of the elements in this list in the correct order.
toArray() - Method in class java.util.LinkedList<E>
Returns an array containing all of the elements in this list in the correct order.
toArray() - Method in class java.util.Vector<E>
Returns an array containing all of the elements in this Vector in the correct order.
toString() - Method in class java.util.AbstractCollection<E>
Returns a string representation of this collection.
toString() - Method in class java.util.AbstractMap<A,B>
Returns a string representation of this map.
toString() - Method in class java.util.Hashtable<K,V>
Returns a string representation of this Hashtable object in the form of a set of entries, enclosed in braces and separated by the ASCII characters "" (comma and space).
toString() - Method in class java.util.Vector<E>
Returns a string representation of this Vector, containing the String representation of each element.
TreeMap() - Constructor for class java.util.TreeMap<K,V>
Constructs a new, empty map, sorted according to the keys' natural order.
TreeMap(Comparator<K>) - Constructor for class java.util.TreeMap<K,V>
Constructs a new, empty map, sorted according to the given comparator.
TreeMap(Map<K,V>) - Constructor for class java.util.TreeMap<K,V>
Constructs a new map containing the same mappings as the given map, sorted according to the keys' natural order.
TreeMap(SortedMap<K,V>) - Constructor for class java.util.TreeMap<K,V>
Constructs a new map containing the same mappings as the given SortedMap, sorted according to the same ordering.
TreeMap<K,V> - class java.util.TreeMap<K,V>.
Red-Black tree based implementation of the SortedMap interface.
TreeSet() - Constructor for class java.util.TreeSet<E>
Constructs a new, empty set, sorted according to the elements' natural order.
TreeSet(Collection<E>) - Constructor for class java.util.TreeSet<E>
Constructs a new set containing the elements in the specified collection, sorted according to the elements' natural order.
TreeSet(Comparator<E>) - Constructor for class java.util.TreeSet<E>
Constructs a new, empty set, sorted according to the given comparator.
TreeSet(SortedSet<E>) - Constructor for class java.util.TreeSet<E>
Constructs a new set containing the same elements as the given sorted set, sorted according to the same ordering.
TreeSet<E> - class java.util.TreeSet<E>.
This class implements the Set interface, backed by a TreeMap instance.
trimToSize() - Method in class java.util.ArrayList<E>
Trims the capacity of this ArrayList instance to be the list's current size.
trimToSize() - Method in class java.util.Vector<E>
Trims the capacity of this vector to be the vector's current size.

U

unmodifiableCollection(Collection) - Static method in class java.util.Collections
Returns an unmodifiable view of the specified collection.

V

values() - Method in interface java.util.Map<K,V>
Returns a collection view of the values contained in this map.
values() - Method in class java.util.AbstractMap<A,B>
Returns a collection view of the values contained in this map.
values() - Method in class java.util.HashMap<K,V>
Returns a collection view of the values contained in this map.
values() - Method in class java.util.Hashtable<K,V>
Returns a Collection view of the values contained in this Hashtable.
values() - Method in class java.util.IdentityHashMap<K,V>
Returns a collection view of the values contained in this map.
values() - Method in class java.util.TreeMap<K,V>
Returns a collection view of the values contained in this map.
Vector() - Constructor for class java.util.Vector<E>
Constructs an empty vector so that its internal data array has size 10 and its standard capacity increment is zero.
Vector(Collection<E>) - Constructor for class java.util.Vector<E>
Constructs a vector containing the elements of the specified collection, in the order they are returned by the collection's iterator.
Vector(int) - Constructor for class java.util.Vector<E>
Constructs an empty vector with the specified initial capacity and with its capacity increment equal to zero.
Vector(int, int) - Constructor for class java.util.Vector<E>
Constructs an empty vector with the specified initial capacity and capacity increment.
Vector<E> - class java.util.Vector<E>.
The Vector class implements a growable array of objects.

W

WeakHashMap() - Constructor for class java.util.WeakHashMap<K,V>
Constructs a new, empty WeakHashMap with the default initial capacity and the default load factor, which is 0.75.
WeakHashMap(int) - Constructor for class java.util.WeakHashMap<K,V>
Constructs a new, empty WeakHashMap with the given initial capacity and the default load factor, which is 0.75.
WeakHashMap(int, float) - Constructor for class java.util.WeakHashMap<K,V>
Constructs a new, empty WeakHashMap with the given initial capacity and the given load factor.
WeakHashMap(Map<K,V>) - Constructor for class java.util.WeakHashMap<K,V>
Constructs a new WeakHashMap with the same mappings as the specified Map.
WeakHashMap<K,V> - class java.util.WeakHashMap<K,V>.
A hashtable-based Map implementation with weak keys.

< A B C D E F G H I K L M N P R S T U V W