 -- Method on AbstractCollection: public abstract Iterator iterator ()
     Return an Iterator over this collection. The iterator must provide the hasNext and next methods and should in addition provide remove if the collection is modifiable.

 -- Method on AbstractCollection: public abstract int size ()
     Return the number of elements in this collection.

 -- Method on AbstractCollection: public boolean add (java.lang.Object O)
     Add an object to the collection. This implementation always throws an UnsupportedOperationException - it should be overridden if the collection is to be modifiable.

 -- Method on AbstractCollection: public boolean addAll (java.util.Collection C)
     Add all the elements of a given collection to this collection. This implementation obtains an Iterator over the given collection and iterates over it, adding each element with the add(Object) method (thus this method will fail with an UnsupportedOperationException if the add method does).

 -- Method on AbstractCollection: public void clear ()
     Remove all elements from the collection. This implementation obtains an iterator over the collection and calls next and remove on it repeatedly (thus this method will fail with an UnsupportedOperationException if the Iterator's remove method does) until there are no more elements to remove. Many implementations will have a faster way of doing this.

 -- Method on AbstractCollection: public boolean contains (java.lang.Object O)
     Test whether this collection contains a given object. That is, if the collection has an element e such that (o == null ? e == null : o.equals(e)). This implementation obtains an iterator over the collection and iterates over it, testing each element for equality with the given object. If it is equal, true is returned. Otherwise false is returned when the end of the collection is reached.

 -- Method on AbstractCollection: public boolean containsAll (java.util.Collection C)
     Tests whether this collection contains all the elements in a given collection. This implementation iterates over the given collection, testing whether each element is contained in this collection. If any one is not, false is returned. Otherwise true is returned.

 -- Method on AbstractCollection: public boolean isEmpty ()
     Test whether this collection is empty. This implementation returns size() == 0.

 -- Method on AbstractCollection: public boolean remove (java.lang.Object O)
     Remove a single instance of an object from this collection. That is, remove one element e such that (o == null ? e == null : o.equals(e)), if such an element exists. This implementation obtains an iterator over the collection and iterates over it, testing each element for equality with the given object. If it is equal, it is removed by the iterator's remove method (thus this method will fail with an UnsupportedOperationException if the Iterator's remove method does). After the first element has been removed, true is returned; if the end of the collection is reached, false is returned.

 -- Method on AbstractCollection: public boolean removeAll (java.util.Collection C)
     Remove from this collection all its elements that are contained in a given collection. This implementation iterates over this collection, and for each element tests if it is contained in the given collection. If so, it is removed by the Iterator's remove method (thus this method will fail with an UnsupportedOperationException if the Iterator's remove method does).

 -- Method on AbstractCollection: public boolean retainAll (java.util.Collection C)
     Remove from this collection all its elements that are not contained in a given collection. This implementation iterates over this collection, and for each element tests if it is contained in the given collection. If not, it is removed by the Iterator's remove method (thus this method will fail with an UnsupportedOperationException if the Iterator's remove method does).

 -- Method on AbstractCollection: public Object toArray ()
     Return an array containing the elements of this collection. This implementation creates an Object array of size size() and then iterates over the collection, setting each element of the array from the value returned by the iterator.

 -- Method on AbstractCollection: public Object toArray (java.lang.Object[] A)
     Copy the collection into a given array if it will fit, or into a dynamically created array of the same run-time type as the given array if not. If there is space remaining in the array, the first element after the end of the collection is set to null (this is only useful if the collection is known to contain no null elements, however). This implementation first tests whether the given array is large enough to hold all the elements of the collection. If not, the reflection API is used to allocate a new array of the same run-time type. Next an iterator is obtained over the collection and the elements are placed in the array as they are returned by the iterator. Finally the first spare element, if any, of the array is set to null, and the created array is returned.

 -- Method on AbstractCollection: public String toString ()
     Creates a String representation of the Collection. The string returned is of the form "[a, b, ...]" where a and b etc are the results of calling toString on the elements of the collection. This implementation obtains an Iterator over the Collection and adds each element to a StringBuffer as it is returned by the iterator.

 -- Method on AbstractList: public abstract Object get (int INDEX)

 -- Method on AbstractList: public void add (int INDEX, java.lang.Object O)

 -- Method on AbstractList: public boolean add (java.lang.Object O)

 -- Method on AbstractList: public boolean addAll (int INDEX, java.util.Collection C)

 -- Method on AbstractList: public void clear ()

 -- Method on AbstractList: public boolean equals (java.lang.Object O)

 -- Method on AbstractList: public int hashCode ()

 -- Method on AbstractList: public int indexOf (java.lang.Object O)

 -- Method on AbstractList: public Iterator iterator ()

 -- Method on AbstractList: public int lastIndexOf (java.lang.Object O)

 -- Method on AbstractList: public ListIterator listIterator ()
     Return an Iterator over this List. This implementation calls listIterator(0).

 -- Method on AbstractList: public ListIterator listIterator (int INDEX)

 -- Method on AbstractList: public Object remove (int INDEX)

 -- Method on AbstractList: protected void removeRange (int FROMINDEX, int TOINDEX)
     Remove a subsection of the list. This is called by the clear and removeRange methods of the class which implements subList, which are difficult for subclasses to override directly. Therefore, this method should be overridden instead by the more efficient implementation, if one exists.

     This implementation first checks for illegal or out of range arguments. It then obtains a ListIterator over the list using listIterator(fromIndex). It then calls next() and remove() on this iterator repeatedly, toIndex - fromIndex times.

 -- Method on AbstractList: public Object set (int INDEX, java.lang.Object O)

 -- Method on AbstractList: public List subList (int FROMINDEX, int TOINDEX)

 -- Method on AbstractMap: public void clear ()
     Remove all entries from this Map. This default implementation calls entrySet().clear().

 -- Method on AbstractMap: public boolean containsKey (java.lang.Object KEY)

 -- Method on AbstractMap: public boolean containsValue (java.lang.Object VALUE)

 -- Method on AbstractMap: public abstract Set entrySet ()

 -- Method on AbstractMap: public boolean equals (java.lang.Object O)

 -- Method on AbstractMap: public Object get (java.lang.Object KEY)

 -- Method on AbstractMap: public int hashCode ()

 -- Method on AbstractMap: public boolean isEmpty ()

 -- Method on AbstractMap: public Set keySet ()

 -- Method on AbstractMap: public Object put (java.lang.Object KEY, java.lang.Object VALUE)

 -- Method on AbstractMap: public void putAll (java.util.Map M)

 -- Method on AbstractMap: public Object remove (java.lang.Object KEY)

 -- Method on AbstractMap: public int size ()

 -- Method on AbstractMap: public String toString ()

 -- Method on AbstractMap: public Collection values ()

 -- Method on AbstractSequentialList: public abstract ListIterator listIterator (int INDEX)
     Returns a ListIterator over the list, starting from position index. Subclasses must provide an implementation of this method.

 -- Method on AbstractSequentialList: public void add (int INDEX, java.lang.Object O)
     Add an element to the list at a given index. This implementation obtains a ListIterator positioned at the specified index, and then adds the element using the ListIterator's add method.

 -- Method on AbstractSequentialList: public boolean addAll (int INDEX, java.util.Collection C)

 -- Method on AbstractSequentialList: public Object get (int INDEX)

 -- Method on AbstractSequentialList: public Iterator iterator ()
     Return an Iterator over this List. This implementation returns listIterator().

 -- Method on AbstractSequentialList: public Object remove (int INDEX)

 -- Method on AbstractSequentialList: public Object set (int INDEX, java.lang.Object O)

 -- Method on AbstractSet: public boolean equals (java.lang.Object O)
     Tests whether the given object is equal to this Set. This implementation first checks whether this set <em>is</em> the given object, and returns true if so. Otherwise, if o is a Set and is the same size as this one, it returns the result of calling containsAll on the given Set. Otherwise, it returns false.

 -- Method on AbstractSet: public int hashCode ()
     Returns a hash code for this Set. The hash code of a Set is the sum of the hash codes of all its elements, except that the hash code of null is defined to be zero. This implementation obtains an Iterator over the Set, and sums the results.

 -- Method on ArrayList: public void ensureCapacity (int MINCAPACITY)
     Guarantees that this list will have at least enough capacity to hold minCapacity elements.

 -- Method on ArrayList: public boolean add (java.lang.Object E)
     Appends the supplied element to the end of this list.

 -- Method on ArrayList: public Object get (int INDEX)
     Retrieves the element at the user-supplied index.

 -- Method on ArrayList: public int size ()
     Returns the number of elements in this list

 -- Method on ArrayList: public Object remove (int INDEX)
     Removes the element at the user-supplied index

 -- Method on ArrayList: protected void removeRange (int FROMINDEX, int TOINDEX)
     Removes all elements in the half-open interval [iFromIndex, iToIndex).

 -- Method on ArrayList: public void add (int INDEX, java.lang.Object E)
     Adds the supplied element at the specified index, shifting all elements currently at that index or higher one to the right.

 -- Method on ArrayList: public boolean addAll (java.util.Collection C)
     Add each element in the supplied Collection to this List.

 -- Method on ArrayList: public boolean addAll (int INDEX, java.util.Collection C)
     Add all elements in the supplied collection, inserting them beginning at the specified index.

 -- Method on ArrayList: public Object clone ()
     Creates a shallow copy of this ArrayList

 -- Method on ArrayList: public boolean contains (java.lang.Object E)
     Returns true iff oElement is in this ArrayList.

 -- Method on ArrayList: public int indexOf (java.lang.Object E)
     Returns the lowest index at which oElement appears in this List, or -1 if it does not appear.

 -- Method on ArrayList: public int lastIndexOf (java.lang.Object E)
     Returns the highest index at which oElement appears in this List, or -1 if it does not appear.

 -- Method on ArrayList: public void clear ()
     Removes all elements from this List

 -- Method on ArrayList: public Object set (int INDEX, java.lang.Object E)
     Sets the element at the specified index.

 -- Method on ArrayList: public Object toArray ()
     Returns an Object Array containing all of the elements in this ArrayList

 -- Method on ArrayList: public Object toArray (java.lang.Object[] ARRAY)
     Returns an Array whose component type is the runtime component type of the passed-in Array.  The returned Array is populated with all of the elements in this ArrayList.  If the passed-in Array is not large enough to store all of the elements in this List, a new Array will be created and returned; if the passed-in Array is <i>larger</i> than the size of this List, then size() index will be set to null.

 -- Method on ArrayList: public void trimToSize ()
     Trims the capacity of this List to be equal to its size; a memory saver.

 -- Method on Arrays: public static int binarySearch (byte[] A, byte KEY)
     Perform a binary search of a byte array for a key. The array must be sorted (as by the sort() method) - if it is not, the behaviour of this method is undefined, and may be an infinite loop. If the array contains the key more than once, any one of them may be found. Note: although the specification allows for an infinite loop if the array is unsorted, it will not happen in this implementation.

 -- Method on Arrays: public static int binarySearch (char[] A, char KEY)
     Perform a binary search of a char array for a key. The array must be sorted (as by the sort() method) - if it is not, the behaviour of this method is undefined, and may be an infinite loop. If the array contains the key more than once, any one of them may be found. Note: although the specification allows for an infinite loop if the array is unsorted, it will not happen in this implementation.

 -- Method on Arrays: public static int binarySearch (double[] A, double KEY)
     Perform a binary search of a double array for a key. The array must be sorted (as by the sort() method) - if it is not, the behaviour of this method is undefined, and may be an infinite loop. If the array contains the key more than once, any one of them may be found. Note: although the specification allows for an infinite loop if the array is unsorted, it will not happen in this implementation.

 -- Method on Arrays: public static int binarySearch (float[] A, float KEY)
     Perform a binary search of a float array for a key. The array must be sorted (as by the sort() method) - if it is not, the behaviour of this method is undefined, and may be an infinite loop. If the array contains the key more than once, any one of them may be found. Note: although the specification allows for an infinite loop if the array is unsorted, it will not happen in this implementation.

 -- Method on Arrays: public static int binarySearch (int[] A, int KEY)
     Perform a binary search of an int array for a key. The array must be sorted (as by the sort() method) - if it is not, the behaviour of this method is undefined, and may be an infinite loop. If the array contains the key more than once, any one of them may be found. Note: although the specification allows for an infinite loop if the array is unsorted, it will not happen in this implementation.

 -- Method on Arrays: public static int binarySearch (long[] A, long KEY)
     Perform a binary search of a long array for a key. The array must be sorted (as by the sort() method) - if it is not, the behaviour of this method is undefined, and may be an infinite loop. If the array contains the key more than once, any one of them may be found. Note: although the specification allows for an infinite loop if the array is unsorted, it will not happen in this implementation.

 -- Method on Arrays: public static int binarySearch (short[] A, short KEY)
     Perform a binary search of a short array for a key. The array must be sorted (as by the sort() method) - if it is not, the behaviour of this method is undefined, and may be an infinite loop. If the array contains the key more than once, any one of them may be found. Note: although the specification allows for an infinite loop if the array is unsorted, it will not happen in this implementation.

 -- Method on Arrays: public static int binarySearch (java.lang.Object[] A, java.lang.Object KEY)
     Perform a binary search of an Object array for a key, using the natural ordering of the elements. The array must be sorted (as by the sort() method) - if it is not, the behaviour of this method is undefined, and may be an infinite loop. Further, the key must be comparable with every item in the array. If the array contains the key more than once, any one of them may be found. Note: although the specification allows for an infinite loop if the array is unsorted, it will not happen in this (JCL) implementation.

 -- Method on Arrays: public static int binarySearch (java.lang.Object[] A, java.lang.Object KEY, java.util.Comparator C)
     Perform a binary search of an Object array for a key, using a supplied Comparator. The array must be sorted (as by the sort() method with the same Comparator) - if it is not, the behaviour of this method is undefined, and may be an infinite loop. Further, the key must be comparable with every item in the array. If the array contains the key more than once, any one of them may be found. Note: although the specification allows for an infinite loop if the array is unsorted, it will not happen in this (JCL) implementation.

 -- Method on Arrays: public static boolean equals (byte[] A1, byte[] A2)
     Compare two byte arrays for equality.

 -- Method on Arrays: public static boolean equals (char[] A1, char[] A2)
     Compare two char arrays for equality.

 -- Method on Arrays: public static boolean equals (double[] A1, double[] A2)
     Compare two double arrays for equality.

 -- Method on Arrays: public static boolean equals (float[] A1, float[] A2)
     Compare two float arrays for equality.

 -- Method on Arrays: public static boolean equals (long[] A1, long[] A2)
     Compare two long arrays for equality.

 -- Method on Arrays: public static boolean equals (short[] A1, short[] A2)
     Compare two short arrays for equality.

 -- Method on Arrays: public static boolean equals (boolean[] A1, boolean[] A2)
     Compare two boolean arrays for equality.

 -- Method on Arrays: public static boolean equals (int[] A1, int[] A2)
     Compare two int arrays for equality.

 -- Method on Arrays: public static boolean equals (java.lang.Object[] A1, java.lang.Object[] A2)
     Compare two Object arrays for equality.

 -- Method on Arrays: public static void fill (boolean[] A, boolean VAL)
     Fill an array with a boolean value.

 -- Method on Arrays: public static void fill (boolean[] A, int FROMINDEX, int TOINDEX, boolean VAL)
     Fill a range of an array with a boolean value.

 -- Method on Arrays: public static void fill (byte[] A, byte VAL)
     Fill an array with a byte value.

 -- Method on Arrays: public static void fill (byte[] A, int FROMINDEX, int TOINDEX, byte VAL)
     Fill a range of an array with a byte value.

 -- Method on Arrays: public static void fill (char[] A, char VAL)
     Fill an array with a char value.

 -- Method on Arrays: public static void fill (char[] A, int FROMINDEX, int TOINDEX, char VAL)
     Fill a range of an array with a char value.

 -- Method on Arrays: public static void fill (double[] A, double VAL)
     Fill an array with a double value.

 -- Method on Arrays: public static void fill (double[] A, int FROMINDEX, int TOINDEX, double VAL)
     Fill a range of an array with a double value.

 -- Method on Arrays: public static void fill (float[] A, float VAL)
     Fill an array with a float value.

 -- Method on Arrays: public static void fill (float[] A, int FROMINDEX, int TOINDEX, float VAL)
     Fill a range of an array with a float value.

 -- Method on Arrays: public static void fill (int[] A, int VAL)
     Fill an array with an int value.

 -- Method on Arrays: public static void fill (int[] A, int FROMINDEX, int TOINDEX, int VAL)
     Fill a range of an array with an int value.

 -- Method on Arrays: public static void fill (long[] A, long VAL)
     Fill an array with a long value.

 -- Method on Arrays: public static void fill (long[] A, int FROMINDEX, int TOINDEX, long VAL)
     Fill a range of an array with a long value.

 -- Method on Arrays: public static void fill (short[] A, short VAL)
     Fill an array with a short value.

 -- Method on Arrays: public static void fill (short[] A, int FROMINDEX, int TOINDEX, short VAL)
     Fill a range of an array with a short value.

 -- Method on Arrays: public static void fill (java.lang.Object[] A, java.lang.Object VAL)
     Fill an array with an Object value.

 -- Method on Arrays: public static void fill (java.lang.Object[] A, int FROMINDEX, int TOINDEX, java.lang.Object VAL)
     Fill a range of an array with an Object value.

 -- Method on Arrays: public static void sort (byte[] A)
     Sort a byte array into ascending order. The sort algorithm is an optimised quicksort, as described in Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", Software-Practice and Experience, Vol. 23(11) P. 1249-1265 (November 1993). This algorithm gives nlog(n) performance on many arrays that would take quadratic time with a standard quicksort.

 -- Method on Arrays: public static void sort (byte[] A, int FROMINDEX, int TOINDEX)

 -- Method on Arrays: public static void sort (char[] A)
     Sort a char array into ascending order. The sort algorithm is an optimised quicksort, as described in Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", Software-Practice and Experience, Vol. 23(11) P. 1249-1265 (November 1993). This algorithm gives nlog(n) performance on many arrays that would take quadratic time with a standard quicksort.

 -- Method on Arrays: public static void sort (char[] A, int FROMINDEX, int TOINDEX)

 -- Method on Arrays: public static void sort (double[] A)
     Sort a double array into ascending order. The sort algorithm is an optimised quicksort, as described in Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", Software-Practice and Experience, Vol. 23(11) P. 1249-1265 (November 1993). This algorithm gives nlog(n) performance on many arrays that would take quadratic time with a standard quicksort. Note that this implementation, like Sun's, has undefined behaviour if the array contains any NaN values.

 -- Method on Arrays: public static void sort (double[] A, int FROMINDEX, int TOINDEX)

 -- Method on Arrays: public static void sort (float[] A)
     Sort a float array into ascending order. The sort algorithm is an optimised quicksort, as described in Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", Software-Practice and Experience, Vol. 23(11) P. 1249-1265 (November 1993). This algorithm gives nlog(n) performance on many arrays that would take quadratic time with a standard quicksort. Note that this implementation, like Sun's, has undefined behaviour if the array contains any NaN values.

 -- Method on Arrays: public static void sort (float[] A, int FROMINDEX, int TOINDEX)

 -- Method on Arrays: public static void sort (int[] A)
     Sort an int array into ascending order. The sort algorithm is an optimised quicksort, as described in Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", Software-Practice and Experience, Vol. 23(11) P. 1249-1265 (November 1993). This algorithm gives nlog(n) performance on many arrays that would take quadratic time with a standard quicksort.

 -- Method on Arrays: public static void sort (int[] A, int FROMINDEX, int TOINDEX)

 -- Method on Arrays: public static void sort (long[] A)
     Sort a long array into ascending order. The sort algorithm is an optimised quicksort, as described in Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", Software-Practice and Experience, Vol. 23(11) P. 1249-1265 (November 1993). This algorithm gives nlog(n) performance on many arrays that would take quadratic time with a standard quicksort.

 -- Method on Arrays: public static void sort (long[] A, int FROMINDEX, int TOINDEX)

 -- Method on Arrays: public static void sort (short[] A)
     Sort a short array into ascending order. The sort algorithm is an optimised quicksort, as described in Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", Software-Practice and Experience, Vol. 23(11) P. 1249-1265 (November 1993). This algorithm gives nlog(n) performance on many arrays that would take quadratic time with a standard quicksort.

 -- Method on Arrays: public static void sort (short[] A, int FROMINDEX, int TOINDEX)

 -- Method on Arrays: public static void sort (java.lang.Object[] A)
     Sort an array of Objects according to their natural ordering. The sort is guaranteed to be stable, that is, equal elements will not be reordered. The sort algorithm is a mergesort with the merge omitted if the last element of one half comes before the first element of the other half. This algorithm gives guaranteed O(nlog(n)) time, at the expense of making a copy of the array.

 -- Method on Arrays: public static void sort (java.lang.Object[] A, java.util.Comparator C)
     Sort an array of Objects according to a Comparator. The sort is guaranteed to be stable, that is, equal elements will not be reordered. The sort algorithm is a mergesort with the merge omitted if the last element of one half comes before the first element of the other half. This algorithm gives guaranteed O(nlog(n)) time, at the expense of making a copy of the array.

 -- Method on Arrays: public static void sort (java.lang.Object[] A, int FROMINDEX, int TOINDEX)
     Sort an array of Objects according to their natural ordering. The sort is guaranteed to be stable, that is, equal elements will not be reordered. The sort algorithm is a mergesort with the merge omitted if the last element of one half comes before the first element of the other half. This algorithm gives guaranteed O(nlog(n)) time, at the expense of making a copy of the array.

 -- Method on Arrays: public static void sort (java.lang.Object[] A, int FROMINDEX, int TOINDEX, java.util.Comparator C)
     Sort an array of Objects according to a Comparator. The sort is guaranteed to be stable, that is, equal elements will not be reordered. The sort algorithm is a mergesort with the merge omitted if the last element of one half comes before the first element of the other half. This algorithm gives guaranteed O(nlog(n)) time, at the expense of making a copy of the array.

 -- Method on Arrays: public static List asList (java.lang.Object[] A)
     Returns a list "view" of the specified array. This method is intended to make it easy to use the Collections API with existing array-based APIs and programs.

 -- Method on BitSet: public void and (java.util.BitSet BS)
     Performs the logical AND operation on this bit set and the given set.  This means it builds the intersection of the two sets.  The result is stored into this bit set.

 -- Method on BitSet: public void andNot (java.util.BitSet BS)
     Performs the logical AND operation on this bit set and the complement of the given set.  This means it selects every element in the first set, that isn't in the second set.  The result is stored into this bit set.

 -- Method on BitSet: public void clear (int POS)
     Removes the integer bitIndex from this set. That is the corresponding bit is cleared.  If the index is not in the set, this method does nothing.

 -- Method on BitSet: public Object clone ()
     Create a clone of this bit set, that is an instance of the same class and contains the same elements.  But it doesn't change when this bit set changes.

 -- Method on BitSet: public boolean equals (java.lang.Object OBJ)
     Returns true if the obj is a bit set that contains exactly the same elements as this bit set, otherwise false.

 -- Method on BitSet: public boolean get (int POS)
     Returns true if the integer bitIndex is in this bit set, otherwise false.

 -- Method on BitSet: public int hashCode ()
     Returns a hash code value for this bit set.  The hash code of two bit sets containing the same integers is identical.  The algorithm used to compute it is as follows:

     Suppose the bits in the BitSet were to be stored in an array of long integers called bits, in such a manner that bit k is set in the BitSet (for non-negative values of k) if and only if

     <pre> ((k/64) < bits.length) && ((bits[k/64] & (1L << (bit % 64))) != 0) </pre>

     Then the following definition of the hashCode method would be a correct implementation of the actual algorithm:

     <pre> public int hashCode() long h = 1234; for (int i = bits.length-1; i>=0; i--) h ^= bits[i] * (i + 1);

     return (int)((h >> 32) ^ h);

     </pre>

     Note that the hash code values changes, if the set is changed.

 -- Method on BitSet: public int length ()
     Returns the logical number of bits actually used by this bit set.  It returns the index of the highest set bit plus one. Note that this method doesn't return the number of set bits.

 -- Method on BitSet: public void or (java.util.BitSet BS)
     Performs the logical OR operation on this bit set and the given set.  This means it builds the union of the two sets.  The result is stored into this bit set, which grows as necessary.

 -- Method on BitSet: public void set (int POS)
     Add the integer bitIndex to this set.  That is the corresponding bit is set to true.  If the index was already in the set, this method does nothing.  The size of this structure is automatically increased as necessary.

 -- Method on BitSet: public int size ()
     Returns the number of bits actually used by this bit set.  Note that this method doesn't return the number of set bits.

 -- Method on BitSet: public String toString ()
     Returns the string representation of this bit set.  This consists of a comma separated list of the integers in this set surrounded by curly braces.  There is a space after each comma.

 -- Method on BitSet: public void xor (java.util.BitSet BS)
     Performs the logical XOR operation on this bit set and the given set.  This means it builds the symmetric remainder of the two sets (the elements that are in one set, but not in the other).  The result is stored into this bit set, which grows as necessary.

 -- Method on Calendar: public static synchronized Calendar getInstance ()
     Creates a calendar representing the actual time, using the default time zone and locale.

 -- Method on Calendar: public static synchronized Calendar getInstance (java.util.TimeZone ZONE)
     Creates a calendar representing the actual time, using the given time zone and the default locale.

 -- Method on Calendar: public static synchronized Calendar getInstance (java.util.Locale LOCALE)
     Creates a calendar representing the actual time, using the default time zone and the given locale.

 -- Method on Calendar: public static synchronized Calendar getInstance (java.util.TimeZone ZONE, java.util.Locale LOCALE)
     Creates a calendar representing the actual time, using the given time zone and locale.

 -- Method on Calendar: public static synchronized Locale getAvailableLocales ()
     Gets the set of locales for which a Calendar is availiable.

 -- Method on Calendar: protected abstract void computeTime ()
     Converts the time field values (fields) to milliseconds since the epoch UTC (time).  Override this method if you write your own Calendar.

 -- Method on Calendar: protected abstract void computeFields ()
     Converts the milliseconds since the epoch UTC (time) to time fields (fields). Override this method if you write your own Calendar.

 -- Method on Calendar: public final Date getTime ()
     Converts the time represented by this object to a Date-Object.

 -- Method on Calendar: public final void setTime (java.util.Date DATE)
     Sets this Calender's time to the given Date.  All time fields are invalidated by this method.

 -- Method on Calendar: protected long getTimeInMillis ()
     Returns the time represented by this Calendar.

 -- Method on Calendar: protected void setTimeInMillis (long TIME)
     Sets this Calender's time to the given Time.  All time fields are invalidated by this method.

 -- Method on Calendar: public final int get (int FIELD)
     Gets the value of the specified field.  They are recomputed if they are invalid.

 -- Method on Calendar: protected final int internalGet (int FIELD)
     Gets the value of the specified field. This method doesn't recompute the fields, if they are invalid.

 -- Method on Calendar: public final void set (int FIELD, int VALUE)
     Sets the time field with the given value.  This does invalidate the time in milliseconds.

 -- Method on Calendar: public final void set (int YEAR, int MONTH, int DATE)
     Sets the fields for year, month, and date

 -- Method on Calendar: public final void set (int YEAR, int MONTH, int DATE, int HOUR, int MINUTE)
     Sets the fields for year, month, date, hour, and minute

 -- Method on Calendar: public final void set (int YEAR, int MONTH, int DATE, int HOUR, int MINUTE, int SECOND)
     Sets the fields for year, month, date, hour, and minute

 -- Method on Calendar: public final void clear ()
     Clears the values of all the time fields.

 -- Method on Calendar: public final void clear (int FIELD)
     Clears the values of the specified time field.

 -- Method on Calendar: public final boolean isSet (int FIELD)
     Determines if the specified field has a valid value.

 -- Method on Calendar: protected void complete ()
     Fills any unset fields in the time field list

 -- Method on Calendar: public boolean equals (java.lang.Object O)
     Compares the given calender with this.

 -- Method on Calendar: public int hashCode ()
     Returns a hash code for this calendar.

 -- Method on Calendar: public boolean before (java.lang.Object O)
     Compares the given calender with this.

 -- Method on Calendar: public boolean after (java.lang.Object O)
     Compares the given calender with this.

 -- Method on Calendar: public abstract void add (int FIELD, int AMOUNT)
     Adds the specified amount of time to the given time field.  The amount may be negative to subtract the time.  If the field overflows it does what you expect: Jan, 25 + 10 Days is Feb, 4.

 -- Method on Calendar: public abstract void roll (int FIELD, boolean UP)
     Rolls the specified time field up or down.  This means add one to the specified field, but don't change the other fields.  If the maximum for this field is reached, start over with the minimum value.  <br>

     <strong>Note:</strong> There may be situation, where the other fields must be changed, e.g rolling the month on May, 31. The date June, 31 is automatically converted to July, 1.

 -- Method on Calendar: public void roll (int FIELD, int AMOUNT)
     Rolls up or down the specified time field by the given amount. A negative amount rolls down.  The default implementation is call roll(int, boolean) for the specified amount.

     Subclasses should override this method to do more intuitiv things.

 -- Method on Calendar: public void setTimeZone (java.util.TimeZone ZONE)
     Sets the time zone to the specified value.

 -- Method on Calendar: public TimeZone getTimeZone ()
     Gets the time zone of this calendar

 -- Method on Calendar: public void setLenient (boolean LENIENT)
     Specifies if the date/time interpretation should be lenient. If the flag is set, a date such as "February 30, 1996" will be treated as the 29th day after the February 1.  If this flag is false, such dates will cause an exception.

 -- Method on Calendar: public boolean isLenient ()
     Tells if the date/time interpretation is lenient.

 -- Method on Calendar: public void setFirstDayOfWeek (int VALUE)
     Sets what the first day of week is.  This is used for WEEK_OF_MONTH and WEEK_OF_YEAR fields.

 -- Method on Calendar: public int getFirstDayOfWeek ()
     Gets what the first day of week is.  This is used for WEEK_OF_MONTH and WEEK_OF_YEAR fields.

 -- Method on Calendar: public void setMinimalDaysInFirstWeek (int VALUE)
     Sets how many days are required in the first week of the year. If the first day of the year should be the first week you should set this value to 1.  If the first week must be a full week, set it to 7.

 -- Method on Calendar: public int getMinimalDaysInFirstWeek ()
     Gets how many days are required in the first week of the year.

 -- Method on Calendar: public abstract int getMinimum (int FIELD)
     Gets the smallest value that is allowed for the specified field.

 -- Method on Calendar: public abstract int getMaximum (int FIELD)
     Gets the biggest value that is allowed for the specified field.

 -- Method on Calendar: public abstract int getGreatestMinimum (int FIELD)
     Gets the greatest minimum value that is allowed for the specified field.

 -- Method on Calendar: public abstract int getLeastMaximum (int FIELD)
     Gets the smallest maximum value that is allowed for the specified field.  For example this is 28 for DAY_OF_MONTH.

 -- Method on Calendar: public Object clone ()
     Return a clone of this object.

 -- Method on Calendar: public String toString ()
     Returns a string representation of this object.  It is mainly for debugging purposes and its content is implementation specific.

 -- Method on Collection: public int size ()

 -- Method on Collection: public boolean isEmpty ()

 -- Method on Collection: public boolean contains (java.lang.Object O)

 -- Method on Collection: public Iterator iterator ()

 -- Method on Collection: public Object toArray ()

 -- Method on Collection: public Object toArray (java.lang.Object[] A)

 -- Method on Collection: public boolean add (java.lang.Object O)

 -- Method on Collection: public boolean remove (java.lang.Object O)

 -- Method on Collection: public boolean containsAll (java.util.Collection C)

 -- Method on Collection: public boolean addAll (java.util.Collection C)

 -- Method on Collection: public boolean removeAll (java.util.Collection C)

 -- Method on Collection: public boolean retainAll (java.util.Collection C)

 -- Method on Collection: public void clear ()

 -- Method on Collection: public boolean equals (java.lang.Object O)

 -- Method on Collection: public int hashCode ()

 -- Method on Collections: public static int binarySearch (java.util.List L, java.lang.Object KEY)
     Perform a binary search of a List for a key, using the natural ordering of the elements. The list must be sorted (as by the sort() method) - if it is not, the behaviour of this method is undefined, and may be an infinite loop. Further, the key must be comparable with every item in the list. If the list contains the key more than once, any one of them may be found. To avoid pathological behaviour on sequential-access lists, a linear search is used if (l instanceof AbstractSequentialList). Note: although the specification allows for an infinite loop if the list is unsorted, it will not happen in this (Classpath) implementation.

 -- Method on Collections: public static int binarySearch (java.util.List L, java.lang.Object KEY, java.util.Comparator C)
     Perform a binary search of a List for a key, using a supplied Comparator. The list must be sorted (as by the sort() method with the same Comparator) - if it is not, the behaviour of this method is undefined, and may be an infinite loop. Further, the key must be comparable with every item in the list. If the list contains the key more than once, any one of them may be found. To avoid pathological behaviour on sequential-access lists, a linear search is used if (l instanceof AbstractSequentialList). Note: although the specification allows for an infinite loop if the list is unsorted, it will not happen in this (Classpath) implementation.

 -- Method on Collections: public static void copy (java.util.List DEST, java.util.List SOURCE)
     Copy one list to another. If the destination list is longer than the source list, the remaining elements are unaffected. This method runs in linear time.

 -- Method on Collections: public static Enumeration enumeration (java.util.Collection C)
     Returns an Enumeration over a collection. This allows interoperability with legacy APIs that require an Enumeration as input.

 -- Method on Collections: public static void fill (java.util.List L, java.lang.Object VAL)
     Replace every element of a list with a given value. This method runs in linear time.

 -- Method on Collections: public static Object max (java.util.Collection C)
     Find the maximum element in a Collection, according to the natural ordering of the elements. This implementation iterates over the Collection, so it works in linear time.

 -- Method on Collections: public static Object max (java.util.Collection C, java.util.Comparator ORDER)
     Find the maximum element in a Collection, according to a specified Comparator. This implementation iterates over the Collection, so it works in linear time.

 -- Method on Collections: public static Object min (java.util.Collection C)
     Find the minimum element in a Collection, according to the natural ordering of the elements. This implementation iterates over the Collection, so it works in linear time.

 -- Method on Collections: public static Object min (java.util.Collection C, java.util.Comparator ORDER)
     Find the minimum element in a Collection, according to a specified Comparator. This implementation iterates over the Collection, so it works in linear time.

 -- Method on Collections: public static List nCopies (int N, java.lang.Object O)
     Creates an immutable list consisting of the same object repeated n times. The returned object is tiny, consisting of only a single reference to the object and a count of the number of elements. It is Serializable.

 -- Method on Collections: public static void reverse (java.util.List L)
     Reverse a given list. This method works in linear time.

 -- Method on Collections: public static Comparator reverseOrder ()
     Get a comparator that implements the reverse of natural ordering. This is intended to make it easy to sort into reverse order, by simply passing Collections.reverseOrder() to the sort method. The return value of this method is Serializable.

 -- Method on Collections: public static void shuffle (java.util.List L)
     Shuffle a list according to a default source of randomness. The algorithm used would result in a perfectly fair shuffle (that is, each element would have an equal chance of ending up in any position) with a perfect source of randomness; in practice the results are merely very close to perfect.

     This method operates in linear time on a random-access list, but may take quadratic time on a sequential-access list. Note: this (classpath) implementation will never take quadratic time, but it does make a copy of the list. This is in line with the behaviour of the sort methods and seems preferable.

 -- Method on Collections: public static void shuffle (java.util.List L, java.util.Random R)
     Shuffle a list according to a given source of randomness. The algorithm used iterates backwards over the list, swapping each element with an element randomly selected from the elements in positions less than or equal to it (using r.nextInt(int)).

     This algorithm would result in a perfectly fair shuffle (that is, each element would have an equal chance of ending up in any position) if r were a perfect source of randomness. In practise (eg if r = new Random()) the results are merely very close to perfect.

     This method operates in linear time on a random-access list, but may take quadratic time on a sequential-access list. Note: this (classpath) implementation will never take quadratic time, but it does make a copy of the list. This is in line with the behaviour of the sort methods and seems preferable.

 -- Method on Collections: public static Set singleton (java.lang.Object O)
     Obtain an immutable Set consisting of a single element. The return value of this method is Serializable.

 -- Method on Collections: public static List singletonList (java.lang.Object O)
     Obtain an immutable List consisting of a single element. The return value of this method is Serializable.

 -- Method on Collections: public static Map singletonMap (java.lang.Object KEY, java.lang.Object VALUE)
     Obtain an immutable Map consisting of a single key value pair. The return value of this method is Serializable.

 -- Method on Collections: public static void sort (java.util.List L)
     Sort a list according to the natural ordering of its elements. The list must be modifiable, but can be of fixed size. The sort algorithm is precisely that used by Arrays.sort(Object[]), which offers guaranteed nlog(n) performance. This implementation dumps the list into an array, sorts the array, and then iterates over the list setting each element from the array.

 -- Method on Collections: public static void sort (java.util.List L, java.util.Comparator C)
     Sort a list according to a specified Comparator. The list must be modifiable, but can be of fixed size. The sort algorithm is precisely that used by Arrays.sort(Object[], Comparator), which offers guaranteed nlog(n) performance. This implementation dumps the list into an array, sorts the array, and then iterates over the list setting each element from the array.

 -- Method on Collections: public static Collection synchronizedCollection (java.util.Collection C)

 -- Method on Collections: public static List synchronizedList (java.util.List L)

 -- Method on Collections: public static Map synchronizedMap (java.util.Map M)

 -- Method on Collections: public static Set synchronizedSet (java.util.Set S)

 -- Method on Collections: public static SortedMap synchronizedSortedMap (java.util.SortedMap M)

 -- Method on Collections: public static SortedSet synchronizedSortedSet (java.util.SortedSet S)

 -- Method on Collections: public static Collection unmodifiableCollection (java.util.Collection C)

 -- Method on Collections: public static List unmodifiableList (java.util.List L)

 -- Method on Collections: public static Map unmodifiableMap (java.util.Map M)

 -- Method on Collections: public static Set unmodifiableSet (java.util.Set S)

 -- Method on Collections: public static SortedMap unmodifiableSortedMap (java.util.SortedMap M)

 -- Method on Collections: public static SortedSet unmodifiableSortedSet (java.util.SortedSet S)

 -- Method on Comparator: public int compare (java.lang.Object O1, java.lang.Object O2)

 -- Method on Comparator: public boolean equals (java.lang.Object OBJ)

 -- Method on Date: public static long parse (java.lang.String STRING)

 -- Method on Date: public boolean after (java.util.Date WHEN)

 -- Method on Date: public boolean before (java.util.Date WHEN)

 -- Method on Date: public boolean equals (java.lang.Object OBJ)

 -- Method on Date: public long getTime ()

 -- Method on Date: public int hashCode ()

 -- Method on Date: public void setTime (long MILLIS)

 -- Method on Date: public int getYear ()

 -- Method on Date: public int getMonth ()

 -- Method on Date: public int getDate ()

 -- Method on Date: public int getDay ()

 -- Method on Date: public int getHours ()

 -- Method on Date: public int getMinutes ()

 -- Method on Date: public int getSeconds ()

 -- Method on Date: public void setYear (int YEAR)

 -- Method on Date: public void setMonth (int MONTH)

 -- Method on Date: public void setDate (int DATE)

 -- Method on Date: public void setHours (int HOURS)

 -- Method on Date: public void setMinutes (int MINUTES)

 -- Method on Date: public void setSeconds (int SECONDS)

 -- Method on Date: public int getTimezoneOffset ()

 -- Method on Date: public String toString ()

 -- Method on Date: public String toGMTString ()

 -- Method on Date: public String toLocaleString ()

 -- Method on Date: public static long UTC (int YEAR, int MONTH, int DATE, int HOURS, int MINUTES, int SECONDS)

 -- Method on Dictionary: public abstract Enumeration elements ()

 -- Method on Dictionary: public abstract Object get (java.lang.Object KEY)
throws NullPointerException

 -- Method on Dictionary: public abstract boolean isEmpty ()

 -- Method on Dictionary: public abstract Enumeration keys ()

 -- Method on Dictionary: public abstract Object put (java.lang.Object KEY, java.lang.Object ELEM)
throws NullPointerException

 -- Method on Dictionary: public abstract Object remove (java.lang.Object KEY)
throws NullPointerException

 -- Method on Dictionary: public abstract int size ()

 -- Method on Enumeration: public boolean hasMoreElements ()

 -- Method on Enumeration: public Object nextElement ()
throws NoSuchElementException

 -- Method on EventObject: public Object getSource ()

 -- Method on EventObject: public String toString ()

 -- Method on GregorianCalendar: public int getMinimum (int CALFIELD)

 -- Method on GregorianCalendar: public int getGreatestMinimum (int CALFIELD)

 -- Method on GregorianCalendar: public int getMaximum (int CALFIELD)

 -- Method on GregorianCalendar: public int getLeastMaximum (int CALFIELD)

 -- Method on GregorianCalendar: protected native void computeFields ()

 -- Method on GregorianCalendar: protected native void computeTime ()

 -- Method on GregorianCalendar: public void add (int FLD, int AMOUNT)

 -- Method on GregorianCalendar: public void roll (int FLD, boolean UP)

 -- Method on GregorianCalendar: public final Date getGregorianChange ()

 -- Method on GregorianCalendar: public void setGregorianChange (java.util.Date DATE)

 -- Method on GregorianCalendar: public boolean isLeapYear (int YEAR)

 -- Method on GregorianCalendar: public boolean after (java.lang.Object CAL)

 -- Method on GregorianCalendar: public boolean before (java.lang.Object CAL)

 -- Method on GregorianCalendar: public boolean equals (java.lang.Object OBJ)

 -- Method on GregorianCalendar: public int hashCode ()

 -- Method on HashMap: public int size ()
     returns the number of kay-value mappings currently in this Map

 -- Method on HashMap: public boolean isEmpty ()
     returns true if there are no key-value mappings currently in this Map

 -- Method on HashMap: public boolean containsValue (java.lang.Object VALUE)
     returns true if this HashMap contains a value <pre>o</pre>, such that <pre>o.equals(value)</pre>.

 -- Method on HashMap: public boolean containsKey (java.lang.Object KEY)
     returns true if the supplied object equals (<pre>equals()</pre>) a key in this HashMap

 -- Method on HashMap: public Object get (java.lang.Object KEY)
     return the value in this Hashtable associated with the supplied key, or <pre>null</pre> if the key maps to nothing

 -- Method on HashMap: public Object put (java.lang.Object KEY, java.lang.Object VALUE)
     puts the supplied value into the Map, mapped by the supplied key

 -- Method on HashMap: public Object remove (java.lang.Object KEY)
     removes from the HashMap and returns the value which is mapped by the supplied key; if the key maps to nothing, then the HashMap remains unchanged, and <pre>null</pre> is returned

 -- Method on HashMap: public void putAll (java.util.Map M)

 -- Method on HashMap: public void clear ()

 -- Method on HashMap: public Object clone ()
     returns a shallow clone of this HashMap (i.e. the Map itself is cloned, but its contents are not)

 -- Method on HashMap: public Set keySet ()
     returns a "set view" of this HashMap's keys

 -- Method on HashMap: public Collection values ()
     Returns a "collection view" (or "bag view") of this HashMap's values.

 -- Method on HashMap: public Set entrySet ()
     Returns a "set view" of this HashMap's entries.

 -- Method on HashSet: public boolean add (java.lang.Object O)
     adds the given Object to the set if it is not already in the Set, returns true if teh element was added, false otherwise

 -- Method on HashSet: public void clear ()
     empties this Set of all elements; this is a fast operation [O(1)]

 -- Method on HashSet: public Object clone ()
     returns a shallow copy of this Set (the Set itself is cloned; its elements are not)

 -- Method on HashSet: public boolean contains (java.lang.Object O)
     returns true if the supplied element is in this Set, false otherwise

 -- Method on HashSet: public boolean isEmpty ()
     returns true if this set has no elements in it (size() == 0)

 -- Method on HashSet: public Iterator iterator ()
     returns an Iterator over the elements of this Set; the Iterator allows removal of elements

 -- Method on HashSet: public boolean remove (java.lang.Object O)
     removes the supplied Object from this Set if it is in the Set; returns true if an element was removed, false otherwise

 -- Method on HashSet: public int size ()
     returns the number of elements in this Set

 -- Method on Hashtable: public int size ()
     Returns the number of key-value mappings currently in this Map

 -- Method on Hashtable: public boolean isEmpty ()
     returns true if there are no key-value mappings currently in this Map

 -- Method on Hashtable: public synchronized Enumeration keys ()

 -- Method on Hashtable: public synchronized Enumeration elements ()

 -- Method on Hashtable: public synchronized boolean contains (java.lang.Object VALUE)
     returns true if this Hashtable contains a value <pre>o</pre>, such that <pre>o.equals(value)</pre>.

     Note: this is one of the <i>old</i> Hashtable methods which does not like null values; it throws NullPointerException if the supplied parameter is null.

 -- Method on Hashtable: public boolean containsValue (java.lang.Object VALUE)
     returns true if this Hashtable contains a value <pre>o</pre>, such that <pre>o.equals(value)</pre>.

 -- Method on Hashtable: public synchronized boolean containsKey (java.lang.Object KEY)
     returns true if the supplied object equals (<pre>equals()</pre>) a key in this Hashtable

 -- Method on Hashtable: public synchronized Object get (java.lang.Object KEY)
     return the value in this Hashtable associated with the supplied key, or <pre>null</pre> if the key maps to nothing

 -- Method on Hashtable: public synchronized Object put (java.lang.Object KEY, java.lang.Object VALUE)
     puts the supplied value into the Map, mapped by the supplied key

 -- Method on Hashtable: public synchronized Object remove (java.lang.Object KEY)
     removes from the table and returns the value which is mapped by the supplied key; if the key maps to nothing, then the table remains unchanged, and <pre>null</pre> is returned

 -- Method on Hashtable: public synchronized void putAll (java.util.Map M)

 -- Method on Hashtable: public synchronized void clear ()

 -- Method on Hashtable: public synchronized Object clone ()
     returns a shallow clone of this Hashtable (i.e. the Map itself is cloned, but its contents are not)

 -- Method on Hashtable: public synchronized String toString ()

 -- Method on Hashtable: public Set keySet ()
     returns a "set view" of this Hashtable's keys

 -- Method on Hashtable: public Collection values ()
     Returns a "collection view" (or "bag view") of this Hashtable's values.

 -- Method on Hashtable: public Set entrySet ()
     Returns a "set view" of this Hashtable's entries.

 -- Method on Hashtable: public boolean equals (java.lang.Object O)
     returns true if this Hashtable equals the supplied Object <pre>o</pre>; that is: <pre> if (o instanceof Map) and o.keySet().equals(keySet()) and for each key in o.keySet(), o.get(key).equals(get(key)) </pre>

 -- Method on Hashtable: public int hashCode ()
     a Map's hashCode is the sum of the hashCodes of all of its Map.Entry objects

 -- Method on Hashtable: protected void rehash ()
     increases the size of the Hashtable and rehashes all keys to new array indices; this is called when the addition of a new value would cause size() > threshold. Note that the existing Entry objects are reused in the new hash table.

 -- Method on Iterator: public boolean hasNext ()

 -- Method on Iterator: public Object next ()

 -- Method on Iterator: public void remove ()

 -- Method on LinkedList: public Object getFirst ()

 -- Method on LinkedList: public Object getLast ()

 -- Method on LinkedList: public Object removeFirst ()

 -- Method on LinkedList: public Object removeLast ()

 -- Method on LinkedList: public void addFirst (java.lang.Object O)

 -- Method on LinkedList: public void addLast (java.lang.Object O)

 -- Method on LinkedList: public boolean contains (java.lang.Object O)

 -- Method on LinkedList: public int size ()

 -- Method on LinkedList: public boolean add (java.lang.Object O)

 -- Method on LinkedList: public boolean remove (java.lang.Object O)

 -- Method on LinkedList: public boolean addAll (java.util.Collection C)

 -- Method on LinkedList: public boolean addAll (int INDEX, java.util.Collection C)

 -- Method on LinkedList: public void clear ()

 -- Method on LinkedList: public Object get (int INDEX)

 -- Method on LinkedList: public Object set (int INDEX, java.lang.Object O)

 -- Method on LinkedList: public void add (int INDEX, java.lang.Object O)

 -- Method on LinkedList: public Object remove (int INDEX)

 -- Method on LinkedList: public int indexOf (java.lang.Object O)

 -- Method on LinkedList: public int lastIndexOf (java.lang.Object O)

 -- Method on LinkedList: public ListIterator listIterator (int INDEX)
     Obtain a ListIterator over this list, starting at a given index. The ListIterator returned by this method supports the add, remove and set methods.

 -- Method on LinkedList: public Object clone ()
     Create a shallow copy of this LinkedList.

 -- Method on LinkedList: public Object toArray ()

 -- Method on LinkedList: public Object toArray (java.lang.Object[] ARRAY)

 -- Method on ListIterator: public boolean hasNext ()

 -- Method on ListIterator: public Object next ()

 -- Method on ListIterator: public boolean hasPrevious ()

 -- Method on ListIterator: public Object previous ()

 -- Method on ListIterator: public int nextIndex ()

 -- Method on ListIterator: public int previousIndex ()

 -- Method on ListIterator: public void remove ()

 -- Method on ListIterator: public void set (java.lang.Object O)

 -- Method on ListIterator: public void add (java.lang.Object O)

 -- Method on List: public void add (int INDEX, java.lang.Object O)
     Insert an element into the list at a given position.

 -- Method on List: public boolean add (java.lang.Object O)
     Add an element to the end of the list.

 -- Method on List: public boolean addAll (int INDEX, java.util.Collection C)
     Insert the contents of a collection into the list at a given position.

 -- Method on List: public boolean addAll (java.util.Collection C)
     Add the contents of a collection to the end of the list.

 -- Method on List: public void clear ()
     Clear the list, such that a subsequent call to isEmpty() would return true.

 -- Method on List: public boolean contains (java.lang.Object O)
     Test whether this list contains a given object as one of its elements.

 -- Method on List: public boolean containsAll (java.util.Collection C)
     Test whether this list contains every element in a given collection.

 -- Method on List: public boolean equals (java.lang.Object O)
     Test whether this list is equal to another object. A List is defined to be equal to an object if and only if that object is also a List, and the two lists are equal. Two lists l1 and l2 are defined to be equal if and only if l1.size() == l2.size(), and for every integer n between 0 and l1.size() - 1 inclusive, l1.get(n) == null ? l2.get(n) == null : l1.get(n).equals(l2.get(n)).

 -- Method on List: public Object get (int INDEX)
     Get the element at a given index in this list.

 -- Method on List: public int hashCode ()
     Obtain a hash code for this list. In order to obey the general contract of the hashCode method of class Object, this value is calculated as follows: <pre> hashCode = 1; Iterator i = list.iterator(); while (i.hasNext()) Object obj = i.next(); hashCode = 31*hashCode + (obj==null ? 0 : obj.hashCode());

     </pre> This ensures that the general contract of Object.hashCode() is adhered to.

 -- Method on List: public int indexOf (java.lang.Object O)
     Obtain the first index at which a given object is to be found in this list.

 -- Method on List: public boolean isEmpty ()
     Test whether this list is empty, that is, if size() == 0.

 -- Method on List: public Iterator iterator ()
     Obtain an Iterator over this list.

 -- Method on List: public int lastIndexOf (java.lang.Object O)
     Obtain the last index at which a given object is to be found in this list.

 -- Method on List: public ListIterator listIterator ()
     Obtain a ListIterator over this list, starting at the beginning.

 -- Method on List: public ListIterator listIterator (int INDEX)
     Obtain a ListIterator over this list, starting at a given position.

 -- Method on List: public Object remove (int INDEX)
     Remove the element at a given position in this list.

 -- Method on List: public boolean remove (java.lang.Object O)
     Remove the first occurence of an object from this list. That is, remove the first element e such that o == null ? e == null : o.equals(e).

 -- Method on List: public boolean removeAll (java.util.Collection C)
     Remove all elements of a given collection from this list. That is, remove every element e such that c.contains(e).

 -- Method on List: public boolean retainAll (java.util.Collection C)
     Remove all elements of this list that are not contained in a given collection. That is, remove every element e such that !c.contains(e).

 -- Method on List: public Object set (int INDEX, java.lang.Object O)
     Replace an element of this list with another object.

 -- Method on List: public int size ()
     Get the number of elements in this list.

 -- Method on List: public List subList (int FROMINDEX, int TOINDEX)
     Obtain a List view of a subsection of this list, from fromIndex (inclusive) to toIndex (exclusive). The returned list should be modifiable if and only if this list is modifiable. Changes to the returned list should be reflected in this list. If this list is structurally modified in any way other than through the returned list, the result of any subsequent operations on the returned list is undefined.

 -- Method on List: public Object toArray ()
     Copy the current contents of this list into an array.

 -- Method on List: public Object toArray (java.lang.Object[] A)
     Copy the current contents of this list into an array. If the array passed as an argument has length less than that of this list, an array of the same run-time type as a, and length equal to the length of this list, is allocated using Reflection. Otherwise, a itself is used. The elements of this list are copied into it, and if there is space in the array, the following element is set to null. The resultant array is returned. Note: The fact that the following element is set to null is only useful if it is known that this list does not contain any null elements.

 -- Method on ListResourceBundle: public final Object handleGetObject (java.lang.String KEY)

 -- Method on ListResourceBundle: public Enumeration getKeys ()

 -- Method on ListResourceBundle: protected abstract Object getContents ()

 -- Method on Locale: public Object clone ()

 -- Method on Locale: public boolean equals (java.lang.Object OBJ)

 -- Method on Locale: public String getCountry ()

 -- Method on Locale: public String getLanguage ()

 -- Method on Locale: public String getVariant ()

 -- Method on Locale: public int hashCode ()

 -- Method on Locale: public static Locale getDefault ()

 -- Method on Locale: public static void setDefault (java.util.Locale NEWLOCALE)

 -- Method on Locale: public String toString ()

 -- Method on Map: public void clear ()

 -- Method on Map: public boolean containsKey (java.lang.Object KEY)

 -- Method on Map: public boolean containsValue (java.lang.Object VALUE)

 -- Method on Map: public Set entrySet ()

 -- Method on Map: public boolean equals (java.lang.Object O)

 -- Method on Map: public Object get (java.lang.Object KEY)

 -- Method on Map: public Object put (java.lang.Object KEY, java.lang.Object VALUE)

 -- Method on Map: public int hashCode ()

 -- Method on Map: public boolean isEmpty ()

 -- Method on Map: public Set keySet ()

 -- Method on Map: public void putAll (java.util.Map M)

 -- Method on Map: public Object remove (java.lang.Object O)

 -- Method on Map: public int size ()

 -- Method on Map: public Collection values ()

 -- Method on Map.Entry: public Object getKey ()

 -- Method on Map.Entry: public Object getValue ()

 -- Method on Map.Entry: public Object setValue (java.lang.Object VALUE)

 -- Method on Map.Entry: public int hashCode ()

 -- Method on Map.Entry: public boolean equals (java.lang.Object O)

 -- Method on MissingResourceException: public String getClassName ()

 -- Method on MissingResourceException: public String getKey ()

 -- Method on Observable: public synchronized void addObserver (java.util.Observer OBS)

 -- Method on Observable: protected synchronized void clearChanged ()

 -- Method on Observable: public synchronized int countObservers ()

 -- Method on Observable: public synchronized void deleteObserver (java.util.Observer OBS)

 -- Method on Observable: public synchronized void deleteObservers ()

 -- Method on Observable: public synchronized boolean hasChanged ()

 -- Method on Observable: public void notifyObservers ()

 -- Method on Observable: public void notifyObservers (java.lang.Object ARG)

 -- Method on Observable: protected synchronized void setChanged ()

 -- Method on Observer: public void update (java.util.Observable OBSERVED, java.lang.Object ARG)

 -- Method on Properties: public void load (java.io.InputStream INSTREAM)
throws IOException
     Reads a property list from an input stream.  The stream should have the following format: <br>

     An empty line or a line starting with # or ! is ignored.  An backslash (\) at the end of the line makes the line continueing on the next line (but make sure there is no whitespace after the backslash). Otherwise, each line describes a key/value pair. <br>

     The chars up to the first whitespace, = or : are the key.  You can include this caracters in the key, if you precede them with a backslash (\). The key is followed by optional whitespaces, optionally one = or :, and optionally some more whitespaces.  The rest of the line is the resource belonging to the key. <br>

     Escape sequences \t, \n, \r, \\, \", \', \!, \#, \ (a space), and unicode characters with the \uxxxx notation are detected, and converted to the corresponding single character. <br>

     <pre> # This is a comment key     = value k\:5      \ a string starting with space and ending with newline\n # This is a multiline specification; note that the value contains # no white space. weekdays: Sunday,Monday,Tuesday,Wednesday,\ Thursday,Friday,Saturday # The safest way to include a space at the end of a value: label   = Name:\u0020 </pre>

 -- Method on Properties: public void save (java.io.OutputStream OUT, java.lang.String HEADER)
     Calls store(OutputStream out, String header) and ignores the IOException that may be thrown.

 -- Method on Properties: public void store (java.io.OutputStream OUT, java.lang.String HEADER)
throws IOException
     Writes the key/value pairs to the given output stream. <br>

     If header is not null, this method writes a comment containing the header as first line to the stream.  The next line (or first line if header is null) contains a comment with the current date. Afterwards the key/value pairs are written to the stream in the following format. <br>

     Each line has the form key = value.  Newlines, Returns and tabs are written as \n,\t,\r resp. The characters \, !, #, = and : are preceeded by a backslash.  Spaces are preceded with a backslash, if and only if they are at the beginning of the key.  Characters that are not in the ascii range 33 to 127 are written in the \uxxxx Form.

 -- Method on Properties: public Object setProperty (java.lang.String KEY, java.lang.String VALUE)
     Adds the given key/value pair to this properties.  This calls the hashtable method put.

 -- Method on Properties: public String getProperty (java.lang.String KEY)
     Gets the property with the specified key in this property list. If the key is not found, the default property list is searched. If the property is not found in default or the default of default, null is returned.

 -- Method on Properties: public String getProperty (java.lang.String KEY, java.lang.String DEFAULTVALUE)
     Gets the property with the specified key in this property list.  If the key is not found, the default property list is searched.  If the property is not found in default or the default of default, the specified defaultValue is returned.

 -- Method on Properties: public Enumeration propertyNames ()
     Returns an enumeration of all keys in this property list, including the keys in the default property list.

 -- Method on Properties: public void list (java.io.PrintStream OUT)
     Writes the key/value pairs to the given print stream.  They are written in the way, described in the method store.

 -- Method on Properties: public void list (java.io.PrintWriter OUT)
     Writes the key/value pairs to the given print writer.  They are written in the way, described in the method store.

 -- Method on PropertyPermission: public boolean implies (java.security.Permission P)
     Check if this permission implies p.  This returns true iff all of the following conditions are true:

       * p is a PropertyPermission

       * this.getName() implies p.getName(), e.g. java.* implies java.home

       * this.getActions is a subset of p.getActions

 -- Method on PropertyPermission: public String getActions ()
     Returns the action string.  Note that this may differ from the string given at the constructor:  The actions are converted to lowercase and may be reordered.

 -- Method on PropertyPermission: public boolean equals (java.lang.Object OBJ)
     Check to see whether this object is the same as another PropertyPermission object.

 -- Method on PropertyPermission: public PermissionCollection newPermissionCollection ()
     Returns a permission collection suitable to take PropertyPermission objects.

 -- Method on PropertyResourceBundle: public Enumeration getKeys ()

 -- Method on PropertyResourceBundle: public Object handleGetObject (java.lang.String KEY)

 -- Method on Random: protected synchronized int next (int BITS)

 -- Method on Random: public boolean nextBoolean ()

 -- Method on Random: public void nextBytes (byte[] BUF)

 -- Method on Random: public double nextDouble ()

 -- Method on Random: public float nextFloat ()

 -- Method on Random: public synchronized double nextGaussian ()

 -- Method on Random: public int nextInt ()

 -- Method on Random: public int nextInt (int N)

 -- Method on Random: public long nextLong ()

 -- Method on Random: public synchronized void setSeed (long SEED)

 -- Method on ResourceBundle: public Locale getLocale ()

 -- Method on ResourceBundle: public final String getString (java.lang.String KEY)
throws MissingResourceException

 -- Method on ResourceBundle: public final String getStringArray (java.lang.String KEY)
throws MissingResourceException

 -- Method on ResourceBundle: public final Object getObject (java.lang.String KEY)
throws MissingResourceException

 -- Method on ResourceBundle: public static final ResourceBundle getBundle (java.lang.String BASENAME)
throws MissingResourceException

 -- Method on ResourceBundle: public static final ResourceBundle getBundle (java.lang.String BASENAME, java.util.Locale LOCALE)

 -- Method on ResourceBundle: public static final ResourceBundle getBundle (java.lang.String BASENAME, java.util.Locale LOCALE, java.lang.ClassLoader LOADER)
throws MissingResourceException

 -- Method on ResourceBundle: protected void setParent (java.util.ResourceBundle PARENT)

 -- Method on ResourceBundle: protected abstract Object handleGetObject (java.lang.String KEY)
throws MissingResourceException

 -- Method on ResourceBundle: public abstract Enumeration getKeys ()

 -- Method on Set: public boolean add (java.lang.Object O)

 -- Method on Set: public boolean addAll (java.util.Collection C)

 -- Method on Set: public void clear ()

 -- Method on Set: public boolean contains (java.lang.Object O)

 -- Method on Set: public boolean containsAll (java.util.Collection C)

 -- Method on Set: public boolean equals (java.lang.Object O)

 -- Method on Set: public int hashCode ()

 -- Method on Set: public boolean isEmpty ()

 -- Method on Set: public Iterator iterator ()

 -- Method on Set: public boolean remove (java.lang.Object O)

 -- Method on Set: public boolean removeAll (java.util.Collection C)

 -- Method on Set: public boolean retainAll (java.util.Collection C)

 -- Method on Set: public int size ()

 -- Method on Set: public Object toArray ()

 -- Method on SimpleTimeZone: public void setStartYear (int YEAR)
     Sets the first year, where daylight savings applies.  The daylight savings rule never apply for years in the BC era.  Note that this is gregorian calendar specific.

 -- Method on SimpleTimeZone: public void setStartRule (int MONTH, int DAY, int DAYOFWEEK, int TIME)
     Sets the daylight savings start rule.  You must also set the end rule with setEndRule or the result of getOffset is undefined.  For the parameters see the ten-argument constructor above.

 -- Method on SimpleTimeZone: public void setEndRule (int MONTH, int DAY, int DAYOFWEEK, int TIME)
     Sets the daylight savings end rule.  You must also set the start rule with setStartRule or the result of getOffset is undefined. For the parameters see the ten-argument constructor above.

 -- Method on SimpleTimeZone: public int getOffset (int ERA, int YEAR, int MONTH, int DAY, int DAYOFWEEK, int MILLIS)
     Gets the time zone offset, for current date, modified in case of daylight savings.  This is the offset to add to UTC to get the local time.

     In the standard JDK the results given by this method may result in inaccurate results at the end of February or the beginning of March. To avoid this, you should use Calendar instead: <pre> offset = cal.get(Calendar.ZONE_OFFSET) + cal.get(Calendar.DST_OFFSET); </pre> You could also use in

     This version doesn't suffer this inaccuracy.

 -- Method on SimpleTimeZone: public int getRawOffset ()
     Returns the time zone offset to GMT in milliseconds, ignoring day light savings.

 -- Method on SimpleTimeZone: public void setRawOffset (int RAWOFFSET)
     Sets the standard time zone offset to GMT.

 -- Method on SimpleTimeZone: public int getDSTSavings ()
     Gets the daylight savings offset.  This is a positive offset in milliseconds with respect to standard time.  Typically this is one hour, but for some time zones this may be half an our.

 -- Method on SimpleTimeZone: public boolean useDaylightTime ()
     Returns if this time zone uses daylight savings time.

 -- Method on SimpleTimeZone: public boolean inDaylightTime (java.util.Date DATE)
     Determines if the given date is in daylight savings time.

 -- Method on SimpleTimeZone: public synchronized int hashCode ()
     Generates the hashCode for the SimpleDateFormat object.  It is the rawOffset, possibly, if useDaylightSavings is true, xored with startYear, startMonth, startDayOfWeekInMonth, ..., endTime.

 -- Method on SimpleTimeZone: public synchronized boolean equals (java.lang.Object O)

 -- Method on SimpleTimeZone: public boolean hasSameRules (java.util.TimeZone OTHER)
     Test if the other time zone uses the same rule and only possibly differs in ID.  This implementation for this particular class will return true if the other object is a SimpleTimeZone, the raw offsets and useDaylight are identical and if useDaylight is true, also the start and end datas are identical.

 -- Method on SimpleTimeZone: public String toString ()
     Returns a string representation of this SimpleTimeZone object.

 -- Method on SortedMap: public Comparator comparator ()

 -- Method on SortedMap: public Object firstKey ()

 -- Method on SortedMap: public SortedMap headMap (java.lang.Object TOKEY)

 -- Method on SortedMap: public Object lastKey ()

 -- Method on SortedMap: public SortedMap subMap (java.lang.Object FROMKEY, java.lang.Object TOKEY)

 -- Method on SortedMap: public SortedMap tailMap (java.lang.Object FROMKEY)

 -- Method on SortedSet: public Comparator comparator ()

 -- Method on SortedSet: public Object first ()

 -- Method on SortedSet: public SortedSet headSet (java.lang.Object TOELEMENT)

 -- Method on SortedSet: public Object last ()

 -- Method on SortedSet: public SortedSet subSet (java.lang.Object FROMELEMENT, java.lang.Object TOELEMENT)

 -- Method on SortedSet: public SortedSet tailSet (java.lang.Object FROMELEMENT)

 -- Method on Stack: public boolean empty ()

 -- Method on Stack: public synchronized Object peek ()

 -- Method on Stack: public synchronized Object pop ()

 -- Method on Stack: public Object push (java.lang.Object OBJ)

 -- Method on Stack: public synchronized int search (java.lang.Object OBJ)

 -- Method on StringTokenizer: public int countTokens ()

 -- Method on StringTokenizer: public boolean hasMoreElements ()

 -- Method on StringTokenizer: public boolean hasMoreTokens ()

 -- Method on StringTokenizer: public Object nextElement ()

 -- Method on StringTokenizer: public String nextToken ()

 -- Method on StringTokenizer: public String nextToken (java.lang.String DELIMS)

 -- Method on Timer: public void cancel ()
     Cancels the execution of the scheduler. If a task is executing it will normally finish execution, but no other tasks will be executed and no more tasks can be scheduled.

 -- Method on Timer: public void schedule (java.util.TimerTask TASK, java.util.Date DATE)
     Schedules the task at the specified data for one time execution.

 -- Method on Timer: public void schedule (java.util.TimerTask TASK, java.util.Date DATE, long PERIOD)
     Schedules the task at the specified date and reschedules the task every period milliseconds after the last execution of the task finishes until this timer or the task is canceled.

 -- Method on Timer: public void schedule (java.util.TimerTask TASK, long DELAY)
     Schedules the task after the specified delay milliseconds for one time execution.

 -- Method on Timer: public void schedule (java.util.TimerTask TASK, long DELAY, long PERIOD)
     Schedules the task after the delay milliseconds and reschedules the task every period milliseconds after the last execution of the task finishes until this timer or the task is canceled.

 -- Method on Timer: public void scheduleAtFixedRate (java.util.TimerTask TASK, java.util.Date DATE, long PERIOD)
     Schedules the task at the specified date and reschedules the task at a fixed rate every period milliseconds until this timer or the task is canceled.

 -- Method on Timer: public void scheduleAtFixedRate (java.util.TimerTask TASK, long DELAY, long PERIOD)
     Schedules the task after the delay milliseconds and reschedules the task at a fixed rate every period milliseconds until this timer or the task is canceled.

 -- Method on Timer: protected void finalize ()
     Tells the scheduler that the Timer task died so there will be no more new tasks scheduled.

 -- Method on TimerTask: public boolean cancel ()
     Marks the task as canceled and prevents any further execution. Returns true if the task was scheduled for any execution in the future and this cancel operation prevents that execution from happening.

     A task that has been canceled can never be scheduled again.

     In this implementation the TimerTask it is possible that the Timer does keep a reference to the TimerTask until the first time the TimerTask is actually scheduled. But the reference will disappear immediatly when cancel is called from within the TimerTask run method.

 -- Method on TimerTask: public abstract void run ()
     Method that is called when this task is scheduled for execution.

 -- Method on TimerTask: public long scheduledExecutionTime ()
     Returns the last time this task was scheduled or (when called by the task from the run method) the time the current execution of the task was scheduled. When the task has not yet run the return value is undefined.

     Can be used (when the task is scheduled at fixed rate) to see the difference between the requested schedule time and the actual time that can be found with System.currentTimeMillis().

 -- Method on TimeZone: public abstract int getOffset (int ERA, int YEAR, int MONTH, int DAY, int DAYOFWEEK, int MILLISECONDS)
     Gets the time zone offset, for current date, modified in case of daylight savings.  This is the offset to add to UTC to get the local time.

 -- Method on TimeZone: public abstract int getRawOffset ()
     Gets the time zone offset, ignoring daylight savings.  This is the offset to add to UTC to get the local time.

 -- Method on TimeZone: public abstract void setRawOffset (int OFFSETMILLIS)
     Sets the time zone offset, ignoring daylight savings.  This is the offset to add to UTC to get the local time.

 -- Method on TimeZone: public String getID ()
     Gets the identifier of this time zone. For instance, PST for Pacific Standard Time.

 -- Method on TimeZone: public void setID (java.lang.String ID)
     Sets the identifier of this time zone. For instance, PST for Pacific Standard Time.

 -- Method on TimeZone: public final String getDisplayName ()
     This method returns a string name of the time zone suitable for displaying to the user.  The string returned will be the long description of the timezone in the current locale.  The name displayed will assume daylight savings time is not in effect.

 -- Method on TimeZone: public final String getDisplayName (java.util.Locale LOCALE)
     This method returns a string name of the time zone suitable for displaying to the user.  The string returned will be the long description of the timezone in the specified locale. The name displayed will assume daylight savings time is not in effect.

 -- Method on TimeZone: public final String getDisplayName (boolean DST, int STYLE)
     This method returns a string name of the time zone suitable for displaying to the user.  The string returned will be of the specified type in the current locale.

 -- Method on TimeZone: public String getDisplayName (boolean DST, int STYLE, java.util.Locale LOCALE)
     This method returns a string name of the time zone suitable for displaying to the user.  The string returned will be of the specified type in the specified locale.

 -- Method on TimeZone: public abstract boolean useDaylightTime ()
     Returns true, if this time zone uses Daylight Savings Time.

 -- Method on TimeZone: public abstract boolean inDaylightTime (java.util.Date DATE)
     Returns true, if the given date is in Daylight Savings Time in this time zone.

 -- Method on TimeZone: public static TimeZone getTimeZone (java.lang.String ID)
     Gets the TimeZone for the given ID.

 -- Method on TimeZone: public static String getAvailableIDs (int RAWOFFSET)
     Gets the available IDs according to the given time zone offset.

 -- Method on TimeZone: public static String getAvailableIDs ()
     Gets all available IDs.

 -- Method on TimeZone: public static TimeZone getDefault ()
     Returns the time zone under which the host is running.  This can be changed with setDefault.

 -- Method on TimeZone: public static void setDefault (java.util.TimeZone ZONE)

 -- Method on TimeZone: public boolean hasSameRules (java.util.TimeZone OTHER)
     Test if the other time zone uses the same rule and only possibly differs in ID.  This implementation for this particular class will return true if the raw offsets are identical.  Subclasses should override this method if they use daylight savings.

 -- Method on TimeZone: public Object clone ()
     Returns a clone of this object.  I can't imagine, why this is useful for a time zone.

 -- Method on Vector: public synchronized void copyInto (java.lang.Object[] ANARRAY)
     Copies the contents of a provided array into the Vector.  If the array is too large to fit in the Vector, an ArrayIndexOutOfBoundsException is thrown.  Old elements in the Vector are overwritten by the new elements

 -- Method on Vector: public synchronized void trimToSize ()
     Trims the Vector down to size.  If the internal data array is larger than the number of Objects its holding, a new array is constructed that precisely holds the elements.

 -- Method on Vector: public synchronized void ensureCapacity (int MINCAPACITY)
     Ensures that <b>minCapacity</b> elements can fit within this Vector. If it cannot hold this many elements, the internal data array is expanded in the following manner.  If the current size plus the capacityIncrement is sufficient, the internal array is expanded by capacityIncrement. If capacityIncrement is non-positive, the size is doubled.  If neither is sufficient, the internal array is expanded to size minCapacity

 -- Method on Vector: public synchronized void setSize (int NEWSIZE)
     Explicitly sets the size of the internal data array, copying the old values to the new internal array.  If the new array is smaller than the old one, old values that don't fit are lost. If the new size is larger than the old one, the vector is padded with null entries.

 -- Method on Vector: public int capacity ()
     Returns the size of the internal data array (not the amount of elements contained in the Vector)

 -- Method on Vector: public int size ()
     Returns the number of elements stored in this Vector

 -- Method on Vector: public boolean isEmpty ()
     Returns true if this Vector is empty, false otherwise

 -- Method on Vector: public synchronized int indexOf (java.lang.Object E, int INDEX)
     Searches the vector starting at <b>index</b> for object <b>elem</b> and returns the index of the first occurence of this Object.  If the object is not found, -1 is returned

 -- Method on Vector: public int indexOf (java.lang.Object ELEM)
     Returns the first occurence of <b>elem</b> in the Vector, or -1 if <b>elem</b> is not found.

 -- Method on Vector: public boolean contains (java.lang.Object ELEM)
     Returns true if <b>elem</b> is contained in this Vector, false otherwise.

 -- Method on Vector: public synchronized int lastIndexOf (java.lang.Object E, int INDEX)
     Returns the index of the first occurence of <b>elem</b>, when searching backwards from <b>index</b>.  If the object does not occur in this Vector, -1 is returned.

 -- Method on Vector: public int lastIndexOf (java.lang.Object ELEM)
     Returns the last index of <b>elem</b> within this Vector, or -1 if the object is not within the Vector

 -- Method on Vector: public synchronized Object elementAt (int INDEX)
     Returns the Object stored at <b>index</b>.  If index is out of range an ArrayIndexOutOfBoundsException is thrown.

 -- Method on Vector: public synchronized Object firstElement ()
     Returns the first element in the Vector.  If there is no first Object (The vector is empty), a NoSuchElementException is thrown.

 -- Method on Vector: public synchronized Object lastElement ()
     Returns the last element in the Vector.  If the Vector has no last element (The vector is empty), a NoSuchElementException is thrown.

 -- Method on Vector: public synchronized void setElementAt (java.lang.Object OBJ, int INDEX)
     Places <b>obj</b> at <b>index</b> within the Vector.  If <b>index</b> refers to an index outside the Vector, an ArrayIndexOutOfBoundsException is thrown.

 -- Method on Vector: public synchronized Object set (int INDEX, java.lang.Object ELEMENT)
     Puts <b>element</b> into the Vector at position <b>index</b> and returns the Object that previously occupied that position.

 -- Method on Vector: public synchronized void removeElementAt (int INDEX)
     Removes the element at <b>index</b>, and shifts all elements at positions greater than index to their index - 1.

 -- Method on Vector: public void insertElementAt (java.lang.Object OBJ, int INDEX)
     Inserts a new element into the Vector at <b>index</b>.  Any elements at or greater than index are shifted up one position.

 -- Method on Vector: public synchronized void addElement (java.lang.Object OBJ)
     Adds an element to the Vector at the end of the Vector.  If the vector cannot hold the element with its present capacity, its size is increased based on the same rules followed if ensureCapacity was called with the argument currentSize+1.

 -- Method on Vector: public synchronized boolean removeElement (java.lang.Object OBJ)
     Removes the first occurence of the given object from the Vector. If such a remove was performed (the object was found), true is returned. If there was no such object, false is returned.

 -- Method on Vector: public synchronized void removeAllElements ()
     Removes all elements from the Vector.  Note that this does not resize the internal data array.

 -- Method on Vector: public synchronized Object clone ()
     Creates a new Vector with the same contents as this one.

 -- Method on Vector: public synchronized Object toArray ()
     Returns an Object array with the contents of this Vector, in the order they are stored within this Vector.  Note that the Object array returned is not the internal data array, and that it holds only the elements within the Vector.  This is similar to creating a new Object[] with the size of this Vector, then calling Vector.copyInto(yourArray).

 -- Method on Vector: public synchronized Object toArray (java.lang.Object[] ARRAY)
     Returns an array containing the contents of this Vector. If the provided array is large enough, the contents are copied into that array, and a null is placed in the position size(). In this manner, you can obtain the size of a Vector by the position of the null element.  If the type of the provided array cannot hold the elements, an ArrayStoreException is thrown.

     If the provided array is not large enough, a new one is created with the contents of the Vector, and no null element.  The new array is of the same runtime type as the provided array.

 -- Method on Vector: public synchronized Object get (int INDEX)
     Returns the element at position <b>index</b>

 -- Method on Vector: public boolean remove (java.lang.Object O)
     Removes the given Object from the Vector.  If it exists, true is returned, if not, false is returned.

 -- Method on Vector: public synchronized boolean add (java.lang.Object O)
     Adds an object to the Vector.

 -- Method on Vector: public void add (int INDEX, java.lang.Object ELEMENT)
     Adds an object at the specified index.  Elements at or above index are shifted up one position.

 -- Method on Vector: public synchronized Object remove (int INDEX)
     Removes the element at the specified index, and returns it.

 -- Method on Vector: public void clear ()
     Clears all elements in the Vector and sets its size to 0

 -- Method on Vector: public synchronized boolean containsAll (java.util.Collection C)

 -- Method on Vector: public synchronized boolean addAll (java.util.Collection C)

 -- Method on Vector: public synchronized boolean removeAll (java.util.Collection C)

 -- Method on Vector: public synchronized boolean retainAll (java.util.Collection C)

 -- Method on Vector: public synchronized boolean addAll (int INDEX, java.util.Collection C)

 -- Method on Vector: public synchronized boolean equals (java.lang.Object C)

 -- Method on Vector: public synchronized int hashCode ()

 -- Method on Vector: public synchronized String toString ()
     Returns a string representation of this Vector in the form [element0, element1, ... elementN]

 -- Method on Vector: public synchronized Enumeration elements ()
     Returns an Enumeration of the elements of this List. The Enumeration returned is compatible behavior-wise with the 1.1 elements() method, in that it does not check for concurrent modification.

 -- Method on Vector: public List subList (int FROMINDEX, int TOINDEX)

 -- Method on Vector: protected synchronized void removeRange (int FROMINDEX, int TOINDEX)

 -- Method on WeakHashMap: public int size ()
     Returns the size of this hash map.  Note that the size() may shrink spontanously, if the some of the keys were only weakly reachable.

 -- Method on WeakHashMap: public boolean isEmpty ()
     Tells if the map is empty.  Note that the result may change spontanously, if all of the keys were only weakly reachable.

 -- Method on WeakHashMap: public boolean containsKey (java.lang.Object KEY)
     Tells if the map contains the given key.  Note that the result may change spontanously, if all the key was only weakly reachable.

 -- Method on WeakHashMap: public Object get (java.lang.Object KEY)
     Gets the value the key will be mapped to.

 -- Method on WeakHashMap: public Object put (java.lang.Object KEY, java.lang.Object VALUE)
     Adds a new key/value mapping to this map.

 -- Method on WeakHashMap: public Object remove (java.lang.Object KEY)
     Removes the key and the corresponding value from this map.

 -- Method on WeakHashMap: public Set entrySet ()
     Returns a set representation of the entries in this map.  This set will not have strong references to the keys, so they can be silently removed.  The returned set has therefore the same strange behaviour (shrinking size(), disappearing entries) as this weak hash map.