Differences between vector and arraylist

Differences between vector and arraylist
Collection
Shortlist
│ Invalid parameter list
│ ├ Arraylist
│ Vector
│ Elastic Stack
Sorted set
Map
├ Hashtable
├ Hashmap
└ Weakhashmap
　　

 

Sometimes the vector is better; sometimes the arraylist is better; sometimes you don't want to use one. Hopefully, you are not expecting a simple and clear answer, because the answer depends on what you are using them. The following are four considerations:
　　
　　API
　　
Synchronization-synchronization
　　
Data growth-data growth
　　
Usage-usage patterns
　　
Let me explain it one by one.
　　
　　API
　　
In the Java programming language (Addison-Wesley, June 2000), Ken Arnold, James Gosling, and David Holmes describe vector in this way. It is something similar to arraylist, so from the API point of view, they are very similar. However, there are some slight differences between them.
　　
　　Synchronization
　　
Vectors can be synchronized, meaning that any method to operate the content of a vector is thread-safe. On the other hand, arraylist is not synchronized, so it is not thread-safe. If you know this, you will find that the synchronization of vector will cause minor performance issues. Therefore, if you do not need thread security, use arraylist. Why do we have to pay for unnecessary synchronization?
　　
　　Data Growth
　　
In fact, both arraylist and vector use an array internally to store data. You need to remember this when using either of them during programming. When you insert an element into an arraylist or vector, if the internal array space is insufficient, this object (the translator presses: refers to the arraylist or vector you are using) it is necessary to expand its size. By default, vector generates a double size, while arraylist increases the size by 50%. As long as you use these classes properly, you can end the performance price you pay when adding new elements. It is always the best way to specify the maximum capacity used in your programming by specifying the initial capacity of the object (the translator's press: refers to the arraylist or vector you are using. By carefully specifying the capacity, you can avoid changing the internal array capacity in the future. If you don't know how much data is there, when you know the growth rate of data, vector does have a little advantage, because you can specify the value-added, the method mentioned by the author should be setsize (INT newsize) sets the size of this vector .).
　　
　　Usage Patterns
　　
Arraylist and vector get elements from the specified position. Adding and deleting elements from the end of the container are very effective. All these operations can be performed at a constant level (O (1 )). However, adding or deleting an element from another location is quite time-consuming. The time needed is O (n-I), where N represents the number of elements, I indicates the position of the element to be added or deleted. These operations take more time because you need to move the I and higher elements one by one. So what are the above descriptions?
　　
This means that if you get an element or add or delete an element from the end of the array, you can use vector and arraylist. If you want to perform other operations on the array content, configure another container for yourself. In comparison, the sort list can add and delete elements at any position within the constant level time (O (1. However, retrieving an element will take a little longer. The time must be O (I). This I is the position of the element. Using arraylist is also very simple, because you can simply use an index instead of constructing an iterator. The partition list also creates an internal object for each inserted element. Therefore, you must also know that junk objects are generated at the same time.
　　
Finally, practical Java (Addison-Wesley, Feb. 2000) in Peter Haggar's "Practice 41", we recommend that you use a normal original array to replace vector and arrayliste, especially for efficiency-first code. By using arrays, you can avoid synchronization, additional method calls, and non-idealized size changes. You only pay for additional development time.

 

Arraylist and vector use arrays to store data. The number of elements in the array is greater than that in the actual storage to add and insert elements. Both allow direct serial number index elements, however, data insertion is designed to move array elements and other memory operations. Therefore, index data is inserted slowly. Because vector uses the Synchronized Method (thread-safe), its performance is inferior to that of arraylist, the sort list uses a two-way linked list for storage. Data indexed by serial number needs to be traversed forward or backward. However, when inserting data, you only need to record the items before and after this item, so the insertion speed is faster!

Linear tables, linked lists, and hash tables are common data structures. During Java Development, JDK provides a series of corresponding classes for us to implement basic data structures. These classes are in the Java. util package. This article attempts to explain the functions of each class and how to use these classes correctly through a simple description.

Collection
Shortlist
│ Invalid parameter list
│ ├ Arraylist
│ Vector
│ Elastic Stack
Sorted set
Map
├ Hashtable
├ Hashmap
└ Weakhashmap

Collection Interface
Collection is the most basic collection interface. A collection represents a group of objects, namely, elements of the collection ). Some collections allow the same elements while others do not. Some can be sorted, while others cannot. The Java SDK does not provide classes that directly inherit from collections. The classes provided by the Java SDK are the "subinterfaces" that inherit from collections, such as list and set.
All classes that implement the collection interface must provide two standard constructor: A non-parameter constructor is used to create an empty collection, A constructor with the collection parameter is used to create a new collection, which has the same elements as the imported collection. The next constructor allows you to copy a collection.
How to traverse every element in the collection? Regardless of the actual type of collection, it supports an iterator () method. This method returns an iterator, and each element in the collection can be accessed one by one using this iterator. The typical usage is as follows:
Iterator it = collection. iterator (); // obtain an iterator
While (it. hasnext ()){
Object OBJ = it. Next (); // obtain the next element.
}
The two interfaces derived from the collection interface are list and set.

List Interface
List is an ordered collection, which can be used to precisely control the insert position of each element. You can use an index (the position of an element in the list, similar to an array subscript) to access the elements in the list, which is similar to an array in Java.
Unlike the set mentioned below, the list can have the same element.
In addition to the iterator () method required for the collection interface, list also provides a listiterator () method to return a listiterator interface. Compared with the standard iterator interface, listiterator has some more add () you can add, delete, and set elements to traverse forward or backward.
Common classes that implement the list interface include the list, arraylist, vector, and stack.

Sort list class
The listlist interface allows null elements. In addition, the values list provides additional get, remove, and insert methods at the beginning or end of the values list. These operations enable the queue list to be used as a stack, queue, or two-way Queue (deque ).
Note that the synchronized list method is not available. If multiple threads access a list at the same time, they must implement access synchronization by themselves. One solution is to construct a synchronized list when creating a list:
List list = collections. synchronizedlist (new collections list (...));

Arraylist class
Arraylist implements an array of variable sizes. It allows all elements, including null. Arraylist is not synchronized.
Size, isempty, get, set method running time is constant. However, the overhead of the add method is the constant of the allocation. It takes O (n) to add n elements. The running time of other methods is linear.
Each arraylist instance has a capacity, that is, the size of the array used to store elements. This capacity can automatically increase with the addition of new elements, but the growth algorithm is not defined. When a large number of elements need to be inserted, you can call the ensurecapacity method before insertion to increase the arraylist capacity to improve the insertion efficiency.
Like the synchronized list, arraylist is also non-synchronous (unsynchronized ).

Vector
The vector is very similar to the arraylist, but the vector is synchronized. Although the iterator created by vector is the same interface as the iterator created by arraylist, because vector is synchronous, when an iterator is created and in use, another thread changes the state of the vector (for example, adding or deleting some elements). When calling the iterator method, concurrentmodificationexception is thrown. Therefore, this exception must be caught.

Stack
Stack inherits from vector to implement a post-import, first-out stack. Stack provides five additional methods to make the Vector used as a stack. The basic push and pop methods also include the elements of the peek method to get the top of the stack. The empty method tests whether the stack is empty. The search method checks the position of an element in the stack. The stack is empty after being created.

Set Interface
Set is a collection that does not contain repeated elements, that is, the two elements E1 and E2 both have e1.equals (E2) = false, and set has a maximum of null elements.
Obviously, the set constructor has a constraint that the imported collection parameter cannot contain repeated elements.
Note: You must be careful when operating mutable objects ). If a variable element in a set changes its state, object. Equals (object) = true may cause some problems.

Map Interface
Note that map does not inherit the collection interface. Map provides the key ing between key and value. A map cannot contain the same key, and each key can only map one value. The map interface provides three sets of views. The map content can be treated as a set of keys, a set of values, or a set of key-value ing.

Hashtable class
Hashtable inherits the map interface and implements a key-value ing hash table. Any non-null object can be used as a key or value.
Put (Key, value) is used for adding data, and get (key) is used for retrieving data. The time overhead of these two basic operations is constant.
Hashtable uses the initial capacity and load factor parameters to adjust the performance. Generally, the default load factor 0.75 achieves a better balance between time and space. Increasing the load factor can save space, but the corresponding search time will increase, which affects operations such as get and put.
A simple example of hashtable is as follows: Put 1, 2, 3 into hashtable, and their keys are "one", "two", and "three ":
Hashtable numbers = new hashtable ();
Numbers. Put ("one", new INTEGER (1 ));
Numbers. Put ("two", new INTEGER (2 ));
Numbers. Put ("three", new INTEGER (3 ));
To retrieve a number, such as 2, use the corresponding key:
Integer n = (integer) numbers. Get ("two ");
System. Out. println ("Two =" + n );
As the key object is determined by calculating its hash function, any object used as the key must implement the hashcode and equals methods. The hashcode and equals Methods inherit from the root class object. If you use a custom class as the key, be very careful. According to the definition of the hash function, if the two objects are the same, that is, if obj1.equals (obj2) = true, their hashcode must be the same, but if two objects are different, their hashcode is not necessarily different. If the hashcode of two different objects is the same, this phenomenon is called a conflict. A conflict will increase the time overhead for operating the hash table. Therefore, the hashcode () method should be defined as much as possible to speed up the operation of the hash table.
If the same object has different hashcode, operations on the hash table will produce unexpected results (the expected get method returns NULL). To avoid this problem, you only need to remember one: the equals and hashcode methods must be rewritten at the same time, instead of writing only one of them.
Hashtable is synchronous.

Hashmap class
Hashmap is similar to hashtable. The difference is that hashmap is non-synchronous and allows null, that is, null value and null key ., However, when hashmap is treated as a collection (the values () method can return the collection), its iteration suboperation time overhead is proportional to the capacity of hashmap. Therefore, if the performance of iterative operations is very important, do not set the hashmap initialization capacity too high or the load factor too low.

Weakhashmap class
Weakhashmap is an improved hashmap that implements "weak references" to keys. If a key is no longer referenced by external entities, it can be recycled by GC.

Summary
If operations such as stacks and queues are involved, you should consider using the list. For elements that need to be inserted and deleted quickly, you should use the random list. If you need to quickly access elements randomly, you should use the arraylist.
If the program is in a single-threaded environment or the access is only performed in one thread, the efficiency of non-synchronous classes is high. If multiple threads may operate on one class at the same time, synchronous classes should be used.
Pay special attention to the operations on the hash table. The equals and hashcode methods should be correctly rewritten as the key object.
Try to return the interface rather than the actual type. For example, if the list is returned rather than the arraylist, the client code does not need to be changed if you need to replace the arraylist with the explain list later. This is for abstract programming.

Synchronization
The vector is synchronized. Some methods in this class ensure that the objects in the vector are thread-safe. Arraylist is asynchronous, so the objects in arraylist are not thread-safe. Because the synchronization requirements will affect the execution efficiency, it is a good choice to use arraylist if you do not need a thread-safe set, this avoids unnecessary performance overhead due to synchronization.
Data Growth
In terms of the internal implementation mechanism, both arraylist and vector use arrays to control objects in the set. When you add elements to these two types, if the number of elements exceeds the current length of the internal array, both of them need to extend the length of the internal array, by default, vector automatically doubles the length of the original array, and arraylist is 50% of the original length. Therefore, the space occupied by this set is always larger than what you actually need. Therefore, if you want to save a large amount of data in the collection, using vector has some advantages, because you can avoid unnecessary resource overhead by setting the initialization size of the collection.
Usage mode
In arraylist and vector, it takes the same time to search for data from a specified position (through an index) or add or remove an element at the end of the set, this time is represented by O (1. However, if an element is added or removed from another position in the Set, the time consumed will grow linearly: O (n-I), where N represents the number of elements in the set, I indicates the index location where the element is added or removed. Why? It is assumed that all elements after the I and I elements in the collection must be displaced during the above operations. What does all this mean?
This means that you can only search for elements at a specific position or add or remove elements at the end of the set. You can use vector or arraylist. For other operations, you 'd better select another set operation class. For example, does the linklist set class take the same time to add or remove any element from the set? O (1), but it is slow to index an element-O (I), where I is the index position. it is also easy to use arraylist, because you can simply use indexes instead of creating iterator objects. Linklist also creates an object for each inserted element, and you need to understand that it also brings additional overhead.