Each vector tries to optimize storage management by maintaining a capacity and a capacityIncrement. The capacity is always at least as large as the vector size; it is usually larger because as components are added to the vector, the vector's storage increases in chunks the size of capacityIncrement. An application can increase the capacity of a vector before inserting a large number of components; this reduces the amount of incremental reallocation.
The Iterators returned by Vector's iterator and listIterator methods are fail-fast: if the Vector is structurally modified at any time after the Iterator is created, in any way except through the Iterator's own remove or add methods, the Iterator will throw a ConcurrentModificationException. Thus, in the face of concurrent modification, the Iterator fails quickly and cleanly, rather than risking arbitrary, non-deterministic behavior at an undetermined time in the future. 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.
As of the Java 2 platform v1.2, this class was retrofitted to implement the List interface, making it a member of the Java Collections Framework. Unlike the new collection implementations, Vector is synchronized.
| Field Summary | ||
protected int |
capacityIncrement The amount by which the capacity of the vector is automatically
incremented when its size becomes greater than its capacity. |
|
protected int |
elementCount The number of valid components in this Vector object. |
|
protected Object[] |
elementData The array buffer into which the components of the vector are
stored. |
|
| Fields inherited from class java.util.AbstractList |
| modCount |
| Constructor Summary | ||
| Vector() Constructs an empty vector so that its internal data array
has size 10 and its standard capacity increment is
zero. |
||
| Vector(int initialCapacity) Constructs an empty vector with the specified initial capacity and
with its capacity increment equal to zero. |
||
| Vector(int initialCapacity, int capacityIncrement) Constructs an empty vector with the specified initial capacity and
capacity increment. |
||
| Vector(Collection<? extends E> c) Constructs a vector containing the elements of the specified
collection, in the order they are returned by the collection's
iterator. |
| Method Summary | ||
boolean |
add(E e) Appends the specified element to the end of this Vector. |
|
void |
add(int index, E element) Inserts the specified element at the specified position in this Vector. |
|
boolean |
addAll(int index, Collection<? extends E> c) Inserts all of the elements in the specified Collection into this
Vector at the specified position. |
|
boolean |
addAll(Collection<? extends E> c) Appends all of the elements in the specified Collection to the end of
this Vector, in the order that they are returned by the specified
Collection's Iterator. |
|
void |
addElement(E obj) Adds the specified component to the end of this vector,
increasing its size by one. |
|
int |
capacity() Returns the current capacity of this vector. |
|
void |
clear() Removes all of the elements from this Vector. |
|
| clone() Returns a clone of this vector. |
||
boolean |
contains(Object o) Returns true if this vector contains the specified element. |
|
boolean |
containsAll(Collection<?> c) Returns true if this Vector contains all of the elements in the
specified Collection. |
|
void |
copyInto(Object[] anArray) Copies the components of this vector into the specified array. |
|
| elementAt(int index) Returns the component at the specified index. |
||
| elements() Returns an enumeration of the components of this vector. |
||
void |
ensureCapacity(int minCapacity) Increases the capacity of this vector, if necessary, to ensure
that it can hold at least the number of components specified by
the minimum capacity argument. |
|
boolean |
equals(Object o) Compares the specified Object with this Vector for equality. |
|
| firstElement() Returns the first component (the item at index 0) of
this vector. |
||
| get(int index) Returns the element at the specified position in this Vector. |
||
int |
hashCode() Returns the hash code value for this Vector. |
|
int |
indexOf(Object o) Returns the index of the first occurrence of the specified element
in this vector, or -1 if this vector does not contain the element. |
|
int |
indexOf(Object o, int index) Returns the index of the first occurrence of the specified element in
this vector, searching forwards from index, or returns -1 if
the element is not found. |
|
void |
insertElementAt(E obj, int index) Inserts the specified object as a component in this vector at the
specified index. |
|
boolean |
isEmpty() Tests if this vector has no components. |
|
| lastElement() Returns the last component of the vector. |
||
int |
lastIndexOf(Object o) Returns the index of the last occurrence of the specified element
in this vector, or -1 if this vector does not contain the element. |
|
int |
lastIndexOf(Object o, int index) Returns the index of the last occurrence of the specified element in
this vector, searching backwards from index, or returns -1 if
the element is not found. |
|
| remove(int index) Removes the element at the specified position in this Vector. |
||
boolean |
remove(Object o) Removes the first occurrence of the specified element in this Vector
If the Vector does not contain the element, it is unchanged. |
|
boolean |
removeAll(Collection<?> c) Removes from this Vector all of its elements that are contained in the
specified Collection. |
|
void |
removeAllElements() Removes all components from this vector and sets its size to zero. |
|
boolean |
removeElement(Object obj) Removes the first (lowest-indexed) occurrence of the argument
from this vector. |
|
void |
removeElementAt(int index) Deletes the component at the specified index. |
|
protected void |
removeRange(int fromIndex, int toIndex) Removes from this List all of the elements whose index is between
fromIndex, inclusive and toIndex, exclusive. |
|
boolean |
retainAll(Collection<?> c) Retains only the elements in this Vector that are contained in the
specified Collection. |
|
| set(int index, E element) Replaces the element at the specified position in this Vector with the
specified element. |
||
void |
setElementAt(E obj, int index) Sets the component at the specified index of this
vector to be the specified object. |
|
void |
setSize(int newSize) Sets the size of this vector. |
|
int |
size() Returns the number of components in this vector. |
|
| subList(int fromIndex, int toIndex) Returns a view of the portion of this List between fromIndex,
inclusive, and toIndex, exclusive. |
||
Object[] |
toArray() Returns an array containing all of the elements in this Vector
in the correct order. |
|
T[] |
toArray(T[] a) Returns an array containing all of the elements in this Vector in the
correct order; the runtime type of the returned array is that of the
specified array. |
|
| toString() Returns a string representation of this Vector, containing
the String representation of each element. |
||
void |
trimToSize() Trims the capacity of this vector to be the vector's current
size. |
|
| Methods inherited from class java.util.AbstractList |
| iterator, listIterator, listIterator |
| Methods inherited from class java.lang.Object |
| finalize, getClass, notify, notifyAll, wait, wait, wait |
Any array elements following the last element in the Vector are null.
If the current capacity of this vector is less than minCapacity, then its capacity is increased by replacing its internal data array, kept in the field elementData, with a larger one. The size of the new data array will be the old size plus capacityIncrement, unless the value of capacityIncrement is less than or equal to zero, in which case the new capacity will be twice the old capacity; but if this new size is still smaller than minCapacity, then the new capacity will be minCapacity.
This method is identical in functionality to the get(int) method (which is part of the List interface).
size() - 1.The index must be a value greater than or equal to 0 and less than the current size of the vector.
This method is identical in functionality to the set(int, E) method (which is part of the List interface). Note that the set method reverses the order of the parameters, to more closely match array usage. Note also that the set method returns the old value that was stored at the specified position.
The index must be a value greater than or equal to 0 and less than the current size of the vector.
This method is identical in functionality to the remove(int) method (which is part of the List interface). Note that the remove method returns the old value that was stored at the specified position.
The index must be a value greater than or equal to 0 and less than or equal to the current size of the vector. (If the index is equal to the current size of the vector, the new element is appended to the Vector.)
This method is identical in functionality to the add(int, E) method (which is part of the List interface). Note that the add method reverses the order of the parameters, to more closely match array usage.
This method is identical in functionality to the add(E) method (which is part of the List interface).
This method is identical in functionality to the remove(Object) method (which is part of the List interface).
If the Vector fits in the specified array with room to spare (i.e., the array has more elements than the Vector), the element in the array immediately following the end of the Vector is set to null. (This is useful in determining the length of the Vector only if the caller knows that the Vector does not contain any null elements.)
This method eliminates the need for explicit range operations (of the sort that commonly exist for arrays). Any operation that expects a List can be used as a range operation by operating on a subList view instead of a whole List. For example, the following idiom removes a range of elements from a List:
list.subList(from, to).clear();Similar idioms may be constructed for indexOf and lastIndexOf, and all of the algorithms in the Collections class can be applied to a subList.
The semantics of the List returned by this method become undefined if the backing list (i.e., this List) is structurally modified in any way other than via the returned List. (Structural modifications are those that change the size of the List, or otherwise perturb it in such a fashion that iterations in progress may yield incorrect results.)