Class Vector

Ports/CLDC11/src/java/util/Vector.java:36–1189

///
/// - java.lang.StringBuffer
public class Vector<E> extends AbstractList<E> implements List<E>,
        RandomAccess {

    /// The number of elements or the size of the vector.
    protected int elementCount;

    /// The elements of the vector.
    protected Object[] elementData;

    /// How many elements should be added to the vector when it is detected that
    /// it needs to grow to accommodate extra entries. If this value is zero or
    /// negative the size will be doubled if an increase is needed.
    protected int capacityIncrement;

    private static final int DEFAULT_SIZE = 10;

    /// Constructs a new vector using the default capacity.
    public Vector() {
        this(DEFAULT_SIZE, 0);
    }

    /// Constructs a new vector using the specified capacity.
    ///
    /// #### Parameters
    ///
    /// - `capacity`: the initial capacity of the new vector.
    ///
    /// #### Throws
    ///
    /// - `IllegalArgumentException`: if `capacity` is negative.
    public Vector(int capacity) {
        this(capacity, 0);
    }

    /// Constructs a new vector using the specified capacity and capacity
    /// increment.
    ///
    /// #### Parameters
    ///
    /// - `capacity`: the initial capacity of the new vector.
    ///
    /// - `capacityIncrement`: the amount to increase the capacity when this vector is full.
    ///
    /// #### Throws
    ///
    /// - `IllegalArgumentException`: if `capacity` is negative.
    public Vector(int capacity, int capacityIncrement) {
        if (capacity < 0) {
            throw new IllegalArgumentException();
        }
        elementData = newElementArray(capacity);
        elementCount = 0;
        this.capacityIncrement = capacityIncrement;
    }

    /// Constructs a new instance of `Vector` containing the elements in
    /// `collection`. The order of the elements in the new `Vector`
    /// is dependent on the iteration order of the seed collection.