| |
|
| java.util.Vector
| Vector | | public class Vector extends AbstractList implements List<E>,RandomAccess,Cloneable,java.io.Serializable(Code) | | The
Vector class implements a growable array of
objects. Like an array, it contains components that can be
accessed using an integer index. However, the size of a
Vector can grow or shrink as needed to accommodate
adding and removing items after the
Vector has been created.
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 this class's
Vector.iterator() iterator and
Vector.listIterator(int) 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
ListIterator.remove remove or
ListIterator.add(Object) 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
Enumeration Enumerations returned by
the
Vector.elements() 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.
author:
Lee Boynton
author:
Jonathan Payne
version:
1.113, 06/11/07
See Also: Collection
See Also: List
See Also: ArrayList
See Also: LinkedList
since:
JDK1.0 |
| Inner Class :final class ListItr extends Itr implements ListIterator<E> | |
| 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. |
| Constructor Summary | |
| public | Vector(int initialCapacity, int capacityIncrement)
Constructs an empty vector with the specified initial capacity and
capacity increment. | | public | Vector(int initialCapacity)
Constructs an empty vector with the specified initial capacity and
with its capacity increment equal to zero. | | public | Vector()
Constructs an empty vector so that its internal data array
has size
10 and its standard capacity increment is
zero. | | public | 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 | |
| public synchronized boolean | add(E e)
Appends the specified element to the end of this Vector. | | public void | add(int index, E element)
Inserts the specified element at the specified position in this Vector. | | public synchronized 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. | | public synchronized boolean | addAll(int index, Collection<? extends E> c)
Inserts all of the elements in the specified Collection into this
Vector at the specified position. | | public synchronized void | addElement(E obj)
Adds the specified component to the end of this vector,
increasing its size by one. | | public synchronized int | capacity()
Returns the current capacity of this vector. | | public void | clear()
Removes all of the elements from this Vector. | | public synchronized Object | clone()
Returns a clone of this vector. | | public boolean | contains(Object o)
Returns
true if this vector contains the specified element. | | public synchronized boolean | containsAll(Collection c)
Returns true if this Vector contains all of the elements in the
specified Collection. | | public synchronized void | copyInto(Object[] anArray)
Copies the components of this vector into the specified array. | | public synchronized E | elementAt(int index)
Returns the component at the specified index. | | E | elementData(int index)
| | public Enumeration<E> | elements()
Returns an enumeration of the components of this vector. | | public synchronized 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.
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. | | public synchronized boolean | equals(Object o)
Compares the specified Object with this Vector for equality. | | public synchronized E | firstElement()
Returns the first component (the item at index
0 ) of
this vector. | | public synchronized E | get(int index)
Returns the element at the specified position in this Vector. | | public synchronized int | hashCode()
Returns the hash code value for this Vector. | | public 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. | | public synchronized 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. | | public synchronized void | insertElementAt(E obj, int index)
Inserts the specified object as a component in this vector at the
specified
index . | | public synchronized boolean | isEmpty()
Tests if this vector has no components. | | public synchronized Iterator<E> | iterator()
Returns an iterator over the elements in this list in proper sequence. | | public synchronized E | lastElement()
Returns the last component of the vector. | | public synchronized 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. | | public synchronized 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. | | public synchronized ListIterator<E> | listIterator(int index)
Returns a list iterator over the elements in this list (in proper
sequence), starting at the specified position in the list. | | public synchronized ListIterator<E> | listIterator()
Returns a list iterator over the elements in this list (in proper
sequence). | | public 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. | | public synchronized E | remove(int index)
Removes the element at the specified position in this Vector.
Shifts any subsequent elements to the left (subtracts one from their
indices). | | public synchronized boolean | removeAll(Collection c)
Removes from this Vector all of its elements that are contained in the
specified Collection. | | public synchronized void | removeAllElements()
Removes all components from this vector and sets its size to zero. | | public synchronized boolean | removeElement(Object obj)
Removes the first (lowest-indexed) occurrence of the argument
from this vector. | | public synchronized void | removeElementAt(int index)
Deletes the component at the specified index. | | protected synchronized void | removeRange(int fromIndex, int toIndex)
Removes from this list all of the elements whose index is between
fromIndex , inclusive, and
toIndex , exclusive. | | public synchronized boolean | retainAll(Collection c)
Retains only the elements in this Vector that are contained in the
specified Collection. | | public synchronized E | set(int index, E element)
Replaces the element at the specified position in this Vector with the
specified element. | | public synchronized void | setElementAt(E obj, int index)
Sets the component at the specified
index of this
vector to be the specified object. | | public synchronized void | setSize(int newSize)
Sets the size of this vector. | | public synchronized int | size()
Returns the number of components in this vector. | | public synchronized List<E> | subList(int fromIndex, int toIndex)
Returns a view of the portion of this List between fromIndex,
inclusive, and toIndex, exclusive. | | public synchronized Object[] | toArray()
Returns an array containing all of the elements in this Vector
in the correct order. | | public synchronized 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. | | public synchronized String | toString()
Returns a string representation of this Vector, containing
the String representation of each element. | | public synchronized void | trimToSize()
Trims the capacity of this vector to be the vector's current
size. |
| capacityIncrement | | protected int capacityIncrement(Code) | | 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.
|
| elementCount | | protected int elementCount(Code) | | The number of valid components in this
Vector object.
Components
elementData[0] through
elementData[elementCount-1] are the actual items.
|
| elementData | | protected Object[] elementData(Code) | | 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.
|
| Vector | | public Vector(int initialCapacity, int capacityIncrement)(Code) | | Constructs an empty vector with the specified initial capacity and
capacity increment.
Parameters:
initialCapacity - the initial capacity of the vector
Parameters:
capacityIncrement - the amount by which the capacity isincreased when the vector overflows
throws:
IllegalArgumentException - if the specified initial capacityis negative |
| Vector | | public Vector(int initialCapacity)(Code) | | Constructs an empty vector with the specified initial capacity and
with its capacity increment equal to zero.
Parameters:
initialCapacity - the initial capacity of the vector
throws:
IllegalArgumentException - if the specified initial capacityis negative |
| Vector | | public Vector()(Code) | | Constructs an empty vector so that its internal data array
has size
10 and its standard capacity increment is
zero.
|
| Vector | | public Vector(Collection<? extends E> c)(Code) | | Constructs a vector containing the elements of the specified
collection, in the order they are returned by the collection's
iterator.
Parameters:
c - the collection whose elements are to be placed into thisvector
throws:
NullPointerException - if the specified collection is null
since:
1.2 |
| add | | public synchronized boolean add(E e)(Code) | | Appends the specified element to the end of this Vector.
Parameters:
e - element to be appended to this Vector true (as specified by Collection.add)
since:
1.2 |
| add | | public void add(int index, E element)(Code) | | Inserts the specified element at the specified position in this Vector.
Shifts the element currently at that position (if any) and any
subsequent elements to the right (adds one to their indices).
Parameters:
index - index at which the specified element is to be inserted
Parameters:
element - element to be inserted
throws:
ArrayIndexOutOfBoundsException - if the index is out of range( index < 0 || index > size() )
since:
1.2 |
| addAll | | public synchronized boolean addAll(Collection<? extends E> c)(Code) | | 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. The behavior of this operation is undefined if
the specified Collection is modified while the operation is in progress.
(This implies that the behavior of this call is undefined if the
specified Collection is this Vector, and this Vector is nonempty.)
Parameters:
c - elements to be inserted into this Vector true if this Vector changed as a result of the call
throws:
NullPointerException - if the specified collection is null
since:
1.2 |
| addAll | | public synchronized boolean addAll(int index, Collection<? extends E> c)(Code) | | Inserts all of the elements in the specified Collection into this
Vector at the specified position. Shifts the element currently at
that position (if any) and any subsequent elements to the right
(increases their indices). The new elements will appear in the Vector
in the order that they are returned by the specified Collection's
iterator.
Parameters:
index - index at which to insert the first element from thespecified collection
Parameters:
c - elements to be inserted into this Vector true if this Vector changed as a result of the call
throws:
ArrayIndexOutOfBoundsException - if the index is out of range( index < 0 || index > size() )
throws:
NullPointerException - if the specified collection is null
since:
1.2 |
| addElement | | public synchronized void addElement(E obj)(Code) | | Adds the specified component to the end of this vector,
increasing its size by one. The capacity of this vector is
increased if its size becomes greater than its capacity.
This method is identical in functionality to the
Vector.add(Object) add(E) method (which is part of the
List interface).
Parameters:
obj - the component to be added |
| capacity | | public synchronized int capacity()(Code) | | Returns the current capacity of this vector.
the current capacity (the length of its internaldata array, kept in the field elementData of this vector) |
| clear | | public void clear()(Code) | | Removes all of the elements from this Vector. The Vector will
be empty after this call returns (unless it throws an exception).
since:
1.2 |
| clone | | public synchronized Object clone()(Code) | | Returns a clone of this vector. The copy will contain a
reference to a clone of the internal data array, not a reference
to the original internal data array of this
Vector object.
a clone of this vector |
| contains | | public boolean contains(Object o)(Code) | | Returns
true if this vector contains the specified element.
More formally, returns
true if and only if this vector
contains at least one element
e such that
(o==null ? e==null : o.equals(e)).
Parameters:
o - element whose presence in this vector is to be tested true if this vector contains the specified element |
| containsAll | | public synchronized boolean containsAll(Collection c)(Code) | | Returns true if this Vector contains all of the elements in the
specified Collection.
Parameters:
c - a collection whose elements will be tested for containmentin this Vector true if this Vector contains all of the elements in thespecified collection
throws:
NullPointerException - if the specified collection is null |
| copyInto | | public synchronized void copyInto(Object[] anArray)(Code) | | Copies the components of this vector into the specified array.
The item at index
k in this vector is copied into
component
k of
anArray .
Parameters:
anArray - the array into which the components get copied
throws:
NullPointerException - if the given array is null
throws:
IndexOutOfBoundsException - if the specified array is notlarge enough to hold all the components of this vector
throws:
ArrayStoreException - if a component of this vector is not ofa runtime type that can be stored in the specified array
See Also: Vector.toArray(Object[]) |
| elementAt | | public synchronized E elementAt(int index)(Code) | | Returns the component at the specified index.
This method is identical in functionality to the
Vector.get(int) method (which is part of the
List interface).
Parameters:
index - an index into this vector the component at the specified index
throws:
ArrayIndexOutOfBoundsException - if the index is out of range( index < 0 || index >= size() ) |
| elementData | | E elementData(int index)(Code) | | |
| elements | | public Enumeration<E> elements()(Code) | | Returns an enumeration of the components of this vector. The
returned
Enumeration object will generate all items in
this vector. The first item generated is the item at index
0 ,
then the item at index
1 , and so on.
an enumeration of the components of this vector
See Also: Iterator |
| ensureCapacity | | public synchronized void ensureCapacity(int minCapacity)(Code) | | 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.
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 .
Parameters:
minCapacity - the desired minimum capacity |
| equals | | public synchronized boolean equals(Object o)(Code) | | Compares the specified Object with this Vector for equality. Returns
true if and only if the specified Object is also a List, both Lists
have the same size, and all corresponding pairs of elements in the two
Lists are equal. (Two elements
e1 and
e2 are equal if
(e1==null ? e2==null : e1.equals(e2)) .) In other words, two Lists are defined to be
equal if they contain the same elements in the same order.
Parameters:
o - the Object to be compared for equality with this Vector true if the specified Object is equal to this Vector |
| firstElement | | public synchronized E firstElement()(Code) | | Returns the first component (the item at index
0 ) of
this vector.
the first component of this vector
throws:
NoSuchElementException - if this vector has no components |
| get | | public synchronized E get(int index)(Code) | | Returns the element at the specified position in this Vector.
Parameters:
index - index of the element to return object at the specified index
throws:
ArrayIndexOutOfBoundsException - if the index is out of range( index < 0 || index >= size() )
since:
1.2 |
| hashCode | | public synchronized int hashCode()(Code) | | Returns the hash code value for this Vector.
|
| indexOf | | public int indexOf(Object o)(Code) | | Returns the index of the first occurrence of the specified element
in this vector, or -1 if this vector does not contain the element.
More formally, returns the lowest index
i such that
(o==null ? get(i)==null : o.equals(get(i))),
or -1 if there is no such index.
Parameters:
o - element to search for the index of the first occurrence of the specified element inthis vector, or -1 if this vector does not contain the element |
| indexOf | | public synchronized int indexOf(Object o, int index)(Code) | | 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.
More formally, returns the lowest index
i such that
(i >= index && (o==null ? get(i)==null : o.equals(get(i)))),
or -1 if there is no such index.
Parameters:
o - element to search for
Parameters:
index - index to start searching from the index of the first occurrence of the element inthis vector at position index or later in the vector; -1 if the element is not found.
throws:
IndexOutOfBoundsException - if the specified index is negative
See Also: Object.equals(Object) |
| insertElementAt | | public synchronized void insertElementAt(E obj, int index)(Code) | | Inserts the specified object as a component in this vector at the
specified
index . Each component in this vector with
an index greater or equal to the specified
index is
shifted upward to have an index one greater than the value it had
previously.
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
Vector.add(int,Object) 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.
Parameters:
obj - the component to insert
Parameters:
index - where to insert the new component
throws:
ArrayIndexOutOfBoundsException - if the index is out of range( index < 0 || index > size() ) |
| isEmpty | | public synchronized boolean isEmpty()(Code) | | Tests if this vector has no components.
true if and only if this vector hasno components, that is, its size is zero; false otherwise. |
| iterator | | public synchronized Iterator<E> iterator()(Code) | | Returns an iterator over the elements in this list in proper sequence.
The returned iterator is fail-fast.
an iterator over the elements in this list in proper sequence |
| lastElement | | public synchronized E lastElement()(Code) | | Returns the last component of the vector.
the last component of the vector, i.e., the component at indexsize() - 1.
throws:
NoSuchElementException - if this vector is empty |
| lastIndexOf | | public synchronized int lastIndexOf(Object o)(Code) | | Returns the index of the last occurrence of the specified element
in this vector, or -1 if this vector does not contain the element.
More formally, returns the highest index
i such that
(o==null ? get(i)==null : o.equals(get(i))),
or -1 if there is no such index.
Parameters:
o - element to search for the index of the last occurrence of the specified element inthis vector, or -1 if this vector does not contain the element |
| lastIndexOf | | public synchronized int lastIndexOf(Object o, int index)(Code) | | 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.
More formally, returns the highest index
i such that
(i <= index && (o==null ? get(i)==null : o.equals(get(i)))),
or -1 if there is no such index.
Parameters:
o - element to search for
Parameters:
index - index to start searching backwards from the index of the last occurrence of the element at positionless than or equal to index in this vector;-1 if the element is not found.
throws:
IndexOutOfBoundsException - if the specified index is greaterthan or equal to the current size of this vector |
| listIterator | | public synchronized ListIterator<E> listIterator(int index)(Code) | | Returns a list iterator over the elements in this list (in proper
sequence), starting at the specified position in the list.
The specified index indicates the first element that would be
returned by an initial call to
ListIterator.next next .
An initial call to
ListIterator.previous previous would
return the element with the specified index minus one.
The returned list iterator is fail-fast.
throws:
IndexOutOfBoundsException - |
| remove | | public boolean remove(Object o)(Code) | | Removes the first occurrence of the specified element in this Vector
If the Vector does not contain the element, it is unchanged. More
formally, removes the element with the lowest index i such that
(o==null ? get(i)==null : o.equals(get(i))) (if such
an element exists).
Parameters:
o - element to be removed from this Vector, if present true if the Vector contained the specified element
since:
1.2 |
| remove | | public synchronized E remove(int index)(Code) | | Removes the element at the specified position in this Vector.
Shifts any subsequent elements to the left (subtracts one from their
indices). Returns the element that was removed from the Vector.
throws:
ArrayIndexOutOfBoundsException - if the index is out of range( index < 0 || index >= size() )
Parameters:
index - the index of the element to be removed element that was removed
since:
1.2 |
| removeAll | | public synchronized boolean removeAll(Collection c)(Code) | | Removes from this Vector all of its elements that are contained in the
specified Collection.
Parameters:
c - a collection of elements to be removed from the Vector true if this Vector changed as a result of the call
throws:
ClassCastException - if the types of one or more elementsin this vector are incompatible with the specifiedcollection (optional)
throws:
NullPointerException - if this vector contains one or more nullelements and the specified collection does not support nullelements (optional), or if the specified collection is null
since:
1.2 |
| removeAllElements | | public synchronized void removeAllElements()(Code) | | Removes all components from this vector and sets its size to zero.
This method is identical in functionality to the
Vector.clear method (which is part of the
List interface).
|
| removeElement | | public synchronized boolean removeElement(Object obj)(Code) | | Removes the first (lowest-indexed) occurrence of the argument
from this vector. If the object is found in this vector, each
component in the vector with an index greater or equal to the
object's index is shifted downward to have an index one smaller
than the value it had previously.
This method is identical in functionality to the
Vector.remove(Object) method (which is part of the
List interface).
Parameters:
obj - the component to be removed true if the argument was a component of thisvector; false otherwise. |
| removeElementAt | | public synchronized void removeElementAt(int index)(Code) | | Deletes the component at the specified index. Each component in
this vector with an index greater or equal to the specified
index is shifted downward to have an index one
smaller than the value it had previously. The size of this vector
is decreased by
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
Vector.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.
Parameters:
index - the index of the object to remove
throws:
ArrayIndexOutOfBoundsException - if the index is out of range( index < 0 || index >= size() ) |
| removeRange | | protected synchronized void removeRange(int fromIndex, int toIndex)(Code) | | Removes from this list all of the elements whose index is between
fromIndex , inclusive, and
toIndex , exclusive.
Shifts any succeeding elements to the left (reduces their index).
This call shortens the list by
(toIndex - fromIndex) elements.
(If
toIndex==fromIndex , this operation has no effect.)
|
| retainAll | | public synchronized boolean retainAll(Collection c)(Code) | | Retains only the elements in this Vector that are contained in the
specified Collection. In other words, removes from this Vector all
of its elements that are not contained in the specified Collection.
Parameters:
c - a collection of elements to be retained in this Vector(all other elements are removed) true if this Vector changed as a result of the call
throws:
ClassCastException - if the types of one or more elementsin this vector are incompatible with the specifiedcollection (optional)
throws:
NullPointerException - if this vector contains one or more nullelements and the specified collection does not support nullelements (optional), or if the specified collection is null
since:
1.2 |
| set | | public synchronized E set(int index, E element)(Code) | | Replaces the element at the specified position in this Vector with the
specified element.
Parameters:
index - index of the element to replace
Parameters:
element - element to be stored at the specified position the element previously at the specified position
throws:
ArrayIndexOutOfBoundsException - if the index is out of range( index < 0 || index >= size() )
since:
1.2 |
| setElementAt | | public synchronized void setElementAt(E obj, int index)(Code) | | Sets the component at the specified
index of this
vector to be the specified object. The previous component at that
position is discarded.
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
Vector.set(int,Object) 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.
Parameters:
obj - what the component is to be set to
Parameters:
index - the specified index
throws:
ArrayIndexOutOfBoundsException - if the index is out of range( index < 0 || index >= size() ) |
| setSize | | public synchronized void setSize(int newSize)(Code) | | Sets the size of this vector. If the new size is greater than the
current size, new
null items are added to the end of
the vector. If the new size is less than the current size, all
components at index
newSize and greater are discarded.
Parameters:
newSize - the new size of this vector
throws:
ArrayIndexOutOfBoundsException - if the new size is negative |
| size | | public synchronized int size()(Code) | | Returns the number of components in this vector.
the number of components in this vector |
| subList | | public synchronized List<E> subList(int fromIndex, int toIndex)(Code) | | Returns a view of the portion of this List between fromIndex,
inclusive, and toIndex, exclusive. (If fromIndex and toIndex are
equal, the returned List is empty.) The returned List is backed by this
List, so changes in the returned List are reflected in this List, and
vice-versa. The returned List supports all of the optional List
operations supported by this List.
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.)
Parameters:
fromIndex - low endpoint (inclusive) of the subList
Parameters:
toIndex - high endpoint (exclusive) of the subList a view of the specified range within this List
throws:
IndexOutOfBoundsException - if an endpoint index value is out of range (fromIndex < 0 || toIndex > size)
throws:
IllegalArgumentException - if the endpoint indices are out of order (fromIndex > toIndex) |
| toArray | | public synchronized Object[] toArray()(Code) | | Returns an array containing all of the elements in this Vector
in the correct order.
since:
1.2 |
| toArray | | public synchronized T[] toArray(T[] a)(Code) | | 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. If the Vector fits in the specified array, it is
returned therein. Otherwise, a new array is allocated with the runtime
type of the specified array and the size of this Vector.
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.)
Parameters:
a - the array into which the elements of the Vector are tobe stored, if it is big enough; otherwise, a new array of thesame runtime type is allocated for this purpose. an array containing the elements of the Vector
throws:
ArrayStoreException - if the runtime type of a is not a supertypeof the runtime type of every element in this Vector
throws:
NullPointerException - if the given array is null
since:
1.2 |
| toString | | public synchronized String toString()(Code) | | Returns a string representation of this Vector, containing
the String representation of each element.
|
| trimToSize | | public synchronized void trimToSize()(Code) | | Trims the capacity of this vector to be the vector's current
size. If the capacity of this vector is larger than its current
size, then the capacity is changed to equal the size by replacing
its internal data array, kept in the field
elementData ,
with a smaller one. An application can use this operation to
minimize the storage of a vector.
|
|
|
|