Java集合 Vector源码

Vector说明：
(1)permits all elements,including null
(2)使用数组实现存储 protected Object[] elementData;
(3)线程安全，在开发中需要线程同步安全时，考虑使用Vector

//无参构造器->默认初始化大小10
public Vector() {
    this(10);
}

//有参构造器
public Vector(int initialCapacity) {
    this(initialCapacity, 0);
}

//有参构造，自定义每次扩容大小capacityIncrement
public Vector(int initialCapacity, int capacityIncrement) {
    super();
    if (initialCapacity < 0)
        throw new IllegalArgumentException("Illegal Capacity: "+
                initialCapacity);
    this.elementData = new Object[initialCapacity];
    this.capacityIncrement = capacityIncrement;
}

//扩容机制
public synchronized boolean add(E e) {
    modCount++;
    ensureCapacityHelper(elementCount + 1);
    elementData[elementCount++] = e;
    return true;
}

private void ensureCapacityHelper(int minCapacity) {
    // overflow-conscious code
    if (minCapacity - elementData.length > 0)
        grow(minCapacity);
}

// 如果capacityIncrement>0 newCapacity=oldCapacity+capacityIncrement;否则为2倍的oldCapacity
private void grow(int minCapacity) {
    // overflow-conscious code
    int oldCapacity = elementData.length;
    int newCapacity = oldCapacity + ((capacityIncrement > 0) ?
            capacityIncrement : oldCapacity);
    if (newCapacity - minCapacity < 0)
        newCapacity = minCapacity;
    if (newCapacity - MAX_ARRAY_SIZE > 0)
        newCapacity = hugeCapacity(minCapacity);
    elementData = Arrays.copyOf(elementData, newCapacity);
}

//自定义初始容量和每次扩容大小（初始大小20，每次扩容5）
public static void main(String[] args) {
    Vector vector = new Vector(20, 5);
    for (int i = 0; i < 20 ; i++) {
        vector.add(i);
    }
    vector.add("test");
}

Vector与ArrayList对比：

Vector jdk1.0
Vector方法带synchronized是线程安全的，效率不高；
Vector无参默认大小10，后按2倍扩容，有参按2倍扩容(也可自定义每次扩容大小capacityIncrement)

ArrayList jdk1.2
ArrayList是线程不安全的，效率高
ArrayList无参初始为空数组，第一次扩容10，后按1.5倍扩容