* The Enumerations returned by Vector's elements method are not
     * fail-fast.
     
     * Note that the fail-fast behavior of an iterator cannot be guaranteed
     * as it is, generally speaking, impossible to make any hard guarantees in the
     * presence of unsynchronized concurrent modification.  Fail-fast iterators
     * throw ConcurrentModificationException on a best-effort basis. 
     * Therefore, it would be wrong to write a program that depended on this
     * exception for its correctness:  the fail-fast behavior of iterators
     * should be used only to detect bugs.
     *
     * @see List
     * @see ArrayList
     * @see LinkedList
     * @since   JDK1.0
     */
     public class Vector extends AbstractList
            implements List, RandomAccess, Cloneable, java.io.Serializable
     {
        /**
         * The array buffer into which the components of the vector are
         * stored. The capacity of the vector is the length of this array buffer, 
         * and is at least large enough to contain all the vector's elements.
         *
         * Any array elements following the last element in the Vector are null.
         *
         * @serial
         */
        protected Object elementData[];

        /**
         * The number of valid components in this Vector object. 
         * Components elementData[0] through 
         * elementData[elementCount-1] are the actual items.
         *
         * @serial
         */
        protected int elementCount;

        /**
         * The amount by which the capacity of the vector is automatically 
         * incremented when its size becomes greater than its capacity.  If 
         * the capacity increment is less than or equal to zero, the capacity
         * of the vector is doubled each time it needs to grow.
         *
         * @serial
         */
        protected int capacityIncrement;

        /** use serialVersionUID from JDK 1.0.2 for interoperability */