Vactor底层扩容机制

Vactor底层扩容机制

 public class Vector_ {
    public static void main(String[] args) {
        //无参构造器，无参构造器底侧实际调用的是参数为10的有参构造器
        Vector vector = new Vector();
        for (int i = 0; i < 10; i++) {
            vector.add(i);
        }
        vector.add(100);
        System.out.println("vector=" + vector);

1. new Vector() 底层

       /*
           public Vector() {
               this(10);
           }
        补充：如果是  Vector vector = new Vector(8);
           走的方法:
           public Vector(int initialCapacity) {
               this(initialCapacity, 0);
           }
   

    2. vector.add(i)
         2
       ```java
       //下面这个方法就添加数据到vector集合,和ArrayList底层扩容机制相似
       public synchronized boolean add(E e) {
           modCount++;
           ensureCapacityHelper(elementCount + 1);
           elementData[elementCount++] = e;
         return true;
       }
       ```
       
       ​      2.2   确定是否需要扩容 条件 ： minCapacity - elementData.length>0
       
     ```java
       private void ensureCapacityHelper(int minCapacity) {
           // overflow-conscious code
           if (minCapacity - elementData.length > 0)
               grow(minCapacity);
       ```
       
       }
             2.3  如果 需要的数组大小 不够用，就扩容 , 扩容的算法
       
       ```java
               //newCapacity = oldCapacity + ((capacityIncrement > 0) ?
                    //                             capacityIncrement : 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);
               }
                    */
    
    }
    }
    ```