Class Vector
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 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 the elements method are not fail-fast; if the Vector is structurally modified at any time after the enumeration is created then the results of enumerating are undefined.
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. If a thread-safe implementation is not needed, it is recommended to use ArrayList in place of Vector .
Convert array to Vector
In this section we will learn how to convert an array to vector. Actually array is used is used to store similar data types but Vector is used to store object data type and object can be of String or of any class.
Convert array to Vector
In this section we will learn how to convert an array to vector. Actually array is used is used to store similar data types but Vector is used to store object data type and object can be of String or of any class.
Convert array to Vector
In this section we will learn how to convert an array to vector. Actually array is used is used to store similar data types but Vector is used to store object data type and object can be of String or of any class. In the code given below first we will declare an object array, then create a list for that defined object array. List is a subclass of collection so that we will use list to create vector.
ConvertArrayToVector.java
public class ConvertArrayToVector
public static void main(String[] args)
// declare and initialize array of object of given class. Object[] arrObject = ;
//create list for this object array. List list = Arrays.asList(arrObject);
// create vector for given list. Vector vector = new Vector(list);
// access the elements of the vector. Enumeration enume = vector.elements(); while (enume.hasMoreElements()) < System.out.println(enume.nextElement().toString()); >> >
Mahendra Mon Sep 01 17:13:57 GMT+05:30 2008 Girish
Vector in Java Tutorial with Examples
Java Vector tutorial with examples will help you understand how to use Vector class in an easy way. The Vector in Java is an implementation of the List interface that grows automatically as we add elements to it.
The Vector class is contained in the java.util package so we have to import the java.util package using the import statement to use the Vector class in the code.
The Vector class was a part of Java 1.0, but in Java 2, the Vector class was rewritten to implement the List interface and thus it became the part of the Java Collection Framework.
Unlike the ArrayList class in Java, the Vector is synchronized but it comes with a cost. If the application does not need thread safety, it is recommended to use the ArrayList instead of the Vector class to get better performance.
Like the ArrayList, the Vector class is also a dynamic array of objects. It maintains an internal array to store its elements and the size of this array is increased or decreased automatically as needed. The size of this internal array is called the capacity of the Vector.
The size of the internal array is increased automatically by a certain number when the vector size becomes greater than the internal array size. This certain number is called the capacity increment of the Vector.
The Vector elements can be accessed using the index just like an array. The index of the elements starts from 0 and ends at the size of the vector – 1 index.
How to create new objects of the Java Vector class?
The Vector class in Java provides several constructors using which we can create new objects of it. The default constructor creates a new and empty vector object.