集合 Vector 底层扩容机制 jdk 1.8

package com.li.springboot.text;

import java.util.Vector;

public class Text {
    public static void main(String[] args) {
        Vector vector = new Vector();
        for(int i = 0;i <= 10;i++){
            vector.add(i);
        }

    }
}

1.Vector vector = new Vector();

  public Vector() {
        this(10);
    }

this(10)

 public Vector(int initialCapacity) {//10
        this(initialCapacity, 0);
    }

this(initialCapacity, 0);

  public Vector(int initialCapacity, int capacityIncrement) {
        super();
        if (initialCapacity < 0)
            throw new IllegalArgumentException("Illegal Capacity: "+
                                               initialCapacity);
        this.elementData = new Object[initialCapacity];
        this.capacityIncrement = capacityIncrement;
    }

2.vector.add(i);

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

 ensureCapacityHelper(elementCount + 1);

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

grow(minCapacity);

 private void grow(int minCapacity) {
        // overflow-conscious code
        int oldCapacity = elementData.length;

        //扩容算法：                       capacityIncrement 默认为0
        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);
    }