2017-07-29 12:59:14
一、简介
1、Vector继承关系
2、Vector类扩容
Vector类的实现和ArrayList极其相似，都使用数组存储元素，但是扩容策略不一样，ArrayList基本是按照1.5倍的思路扩容，Vector是按照创建Vector对象时设置的capacityIncrement值递增的，如果该值没有设置或者为0，则直接Double，如下：
3、Vector的线程安全性
Vector号称是线程安全的，它的安全性来自于几乎给每个方法都添加了synchronized关键字，由于锁对象是当前对象，只要有一个线程在执行某一个加锁的方法，也就是获得到当前对象这个锁对象，其他线程基本都不能再使用这个Vector对象了...这是一种很残暴的设计，估计这可能是synchronized刚出来之时，JDK团队的一时兴奋之作吧~
举几个例子：
即便是有一些方法没有直接加synchronized关键字，至少它所调用的方法都是加了的。
4、Stack
Stack继承自Vector，提供了pop、push、peek、search等栈的特殊操作，源码如下：
package java.util; /**
* The <code>Stack</code> class represents a last-in-first-out
* (LIFO) stack of objects. It extends class <tt>Vector</tt> with five
* operations that allow a vector to be treated as a stack. The usual
* <tt>push</tt> and <tt>pop</tt> operations are provided, as well as a
* method to <tt>peek</tt> at the top item on the stack, a method to test
* for whether the stack is <tt>empty</tt>, and a method to <tt>search</tt>
* the stack for an item and discover how far it is from the top.
* <p>
* When a stack is first created, it contains no items.
*
* <p>A more complete and consistent set of LIFO stack operations is
* provided by the {@link Deque} interface and its implementations, which
* should be used in preference to this class. For example:
* <pre> {@code
* Deque<Integer> stack = new ArrayDeque<Integer>();}</pre>
*
* @author Jonathan Payne
* @since JDK1.0
*/
public
class Stack<E> extends Vector<E> {
/**
* Creates an empty Stack.
*/
public Stack() {
} /**
* Pushes an item onto the top of this stack. This has exactly
* the same effect as:
* <blockquote><pre>
* addElement(item)</pre></blockquote>
*
* @param item the item to be pushed onto this stack.
* @return the <code>item</code> argument.
* @see java.util.Vector#addElement
*/
public E push(E item) {
addElement(item); return item;
} /**
* Removes the object at the top of this stack and returns that
* object as the value of this function.
*
* @return The object at the top of this stack (the last item
* of the <tt>Vector</tt> object).
* @throws EmptyStackException if this stack is empty.
*/
public synchronized E pop() {
E obj;
int len = size(); obj = peek();
removeElementAt(len - 1); return obj;
} /**
* Looks at the object at the top of this stack without removing it
* from the stack.
*
* @return the object at the top of this stack (the last item
* of the <tt>Vector</tt> object).
* @throws EmptyStackException if this stack is empty.
*/
public synchronized E peek() {
int len = size(); if (len == 0)
throw new EmptyStackException();
return elementAt(len - 1);
} /**
* Tests if this stack is empty.
*
* @return <code>true</code> if and only if this stack contains
* no items; <code>false</code> otherwise.
*/
public boolean empty() {
return size() == 0;
} /**
* Returns the 1-based position where an object is on this stack.
* If the object <tt>o</tt> occurs as an item in this stack, this
* method returns the distance from the top of the stack of the
* occurrence nearest the top of the stack; the topmost item on the
* stack is considered to be at distance <tt>1</tt>. The <tt>equals</tt>
* method is used to compare <tt>o</tt> to the
* items in this stack.
*
* @param o the desired object.
* @return the 1-based position from the top of the stack where
* the object is located; the return value <code>-1</code>
* indicates that the object is not on the stack.
*/
public synchronized int search(Object o) {
int i = lastIndexOf(o); if (i >= 0) {
return size() - i;
}
return -1;
} /** use serialVersionUID from JDK 1.0.2 for interoperability */
private static final long serialVersionUID = 1224463164541339165L;
}
5、结尾
Vector和ArrayList的异同：
1、扩容策略不同；
2、线程安全的；
3、提供了一些独特的如removeElement()之类的方法；
4、其他方法的实现与ArrayList几乎是一致的，毕竟都是对数组的操作；
5、忽略这个类即可；