您现在的位置是：网站首页 > 代码编程 > JAVA开发JAVA开发

【原】从源码层面分析Vector和ArrayList的区别

不忘初心 2019-03-17 围观() 评论() 点赞() 【JAVA开发】

简介：提到Vector和ArrayList的区别，张口就来的是什么？Vector是线程安全的，而ArrayList不是线程安全的。今天我们从源码层面来分析一下，这二者

提到Vector和ArrayList的区别，张口就来的是什么？Vector是线程安全的，而ArrayList不是线程安全的。

从源码层面分析Vector和ArrayList的区别

今天我们从源码层面来分析一下，这二者到底有何相似之处，又有何不同之处？

/**
 * 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.
 *
 * <p>Any array elements following the last element in the Vector are null.
 *
 * @serial
 */
protected Object[] elementData;

/**
 * The number of valid components in this {@code Vector} object.
 * Components {@code elementData[0]} through
 * {@code elementData[elementCount-1]} are the actual items.
 *
 * @serial
 */
protected int elementCount;

/**
 * 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.
 *
 * @serial
 */
protected int capacityIncrement;

没有找到类似于default的变量，但是除了elementData之外，还有两个变量：elementCount、capacityIncrement，第一个相当于ArrayList中的size属性，也就是元素的个数，但是第二个就是它特有的了，每次扩容的大小。

/**
 * Constructs an empty vector with the specified initial capacity and
 * capacity increment.
 *
 * @param   initialCapacity     the initial capacity of the vector
 * @param   capacityIncrement   the amount by which the capacity is
 *                              increased when the vector overflows
 * @throws IllegalArgumentException if the specified initial capacity
 *         is negative
 */
public Vector(int initialCapacity, int capacityIncrement) {
    super();
    if (initialCapacity < 0)
        throw new IllegalArgumentException("Illegal Capacity: "+
                                           initialCapacity);
    this.elementData = new Object[initialCapacity];
    this.capacityIncrement = capacityIncrement;
}

/**
 * Constructs an empty vector with the specified initial capacity and
 * with its capacity increment equal to zero.
 *
 * @param   initialCapacity   the initial capacity of the vector
 * @throws IllegalArgumentException if the specified initial capacity
 *         is negative
 */
public Vector(int initialCapacity) {
    this(initialCapacity, 0);
}

/**
 * Constructs an empty vector so that its internal data array
 * has size {@code 10} and its standard capacity increment is
 * zero.
 */
public Vector() {
    this(10);
}

从构造方法中可以看出，默认大小是10，这个跟ArrayList是一致的。

由于很多地方都是一样的，所以我就直接快速贴代码，然后在后面作总结了：

/**
 * Appends the specified element to the end of this Vector.
 *
 * @param e element to be appended to this Vector
 * @return {@code true} (as specified by {@link Collection#add})
 * @since 1.2
 */
public synchronized boolean add(E e) {
    modCount++;
    ensureCapacityHelper(elementCount + 1);
    elementData[elementCount++] = e;
    return true;
}

/**
 * This implements the unsynchronized semantics of ensureCapacity.
 * Synchronized methods in this class can internally call this
 * method for ensuring capacity without incurring the cost of an
 * extra synchronization.
 *
 * @see #ensureCapacity(int)
 */
private void ensureCapacityHelper(int minCapacity) {
    // overflow-conscious code
    if (minCapacity - elementData.length > 0)
        grow(minCapacity);
}

/**
 * The maximum size of array to allocate.
 * Some VMs reserve some header words in an array.
 * Attempts to allocate larger arrays may result in
 * OutOfMemoryError: Requested array size exceeds VM limit
 */
private static final int MAX_ARRAY_SIZE = Integer.MAX_VALUE - 8;

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);
}

private static int hugeCapacity(int minCapacity) {
    if (minCapacity < 0) // overflow
        throw new OutOfMemoryError();
    return (minCapacity > MAX_ARRAY_SIZE) ?
        Integer.MAX_VALUE :
        MAX_ARRAY_SIZE;
}

这几段代码看着是不是很眼熟，几乎与ArrayList的扩容一模一样，但是其中还是有细微的差异的，请大家看grow方法的newCapacity计算方式，在上面的构造方法中，默认capacityIncrement是0，这个会直接影响到newCapacity的值，如果直接new Vector()，那么这个newCapacity = oldCapacity + oldCapacity，也就是说扩容的增量是旧的容量的1倍。

相同点，总结如下：

1、默认大小都是10；

2、大小上限都是int的最大值；

3、扩容时机都是插入第n个元素；

不同点，总结如下：

1、Vector是线程安全的，ArrayList是线程不安全的；

2、Vector的扩容是直接2倍，ArrayList的扩容是1.5倍；

arraylist 数组