ArrayList-CSDN博客

本文链接：https://blog.csdn.net/qq_39021699/article/details/116028042

文章目录

ArrayList

ArrayList

简介

ArrayList是常用的是数据存储容器，底层是数组，查询效率很高，线程bu’an’q

优缺点

**优点： **

底层是数组，查询的效率很高
顺序插入元素时效率很高，自动扩容

缺点：

插入和删除元素的效率低
线程不安全

ArrayList 和 LinkedList 的区别

	ArrayList	LinkedList
数据结构	动态数组	双向链表
查询	效率很高	需要移动指针从前往后查找，效率很低
增加删除	首尾的增删效率高，其他低	很高
空间占用	较低	节点储存数据，每个节点上还有两个引用指向前后元素

ArrayList 和 Vector 的区别

	ArrayList	Vector
线程安全性	不安全	安全
性能	高	较低
扩容	1.5	2

源码分析

基础属性

public class ArrayList<E> extends AbstractList<E>
        implements List<E>, RandomAccess, Cloneable, java.io.Serializable
{
    private static final long serialVersionUID = 8683452581122892189L;

    /**
     * Default initial capacity.
     * 默认初始化容量
     */
    private static final int DEFAULT_CAPACITY = 10;

    /**
     * Shared empty array instance used for empty instances.
     */
    private static final Object[] EMPTY_ELEMENTDATA = {};

    /**
     * Shared empty array instance used for default sized empty instances. We
     * distinguish this from EMPTY_ELEMENTDATA to know how much to inflate when
     * first element is added.
     * 初始化时为自动地容量，用它来初始化ArrayList
     */
    private static final Object[] DEFAULTCAPACITY_EMPTY_ELEMENTDATA = {};

    /**
     * The array buffer into which the elements of the ArrayList are stored.
     * The capacity of the ArrayList is the length of this array buffer. Any
     * empty ArrayList with elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA
     * will be expanded to DEFAULT_CAPACITY when the first element is added.
     * 底层所用到的数组，非私有，transient 在已经实现序列化的类中，不允许某变量序列化
     */
    transient Object[] elementData; // non-private to simplify nested class access

    /**
     * The size of the ArrayList (the number of elements it contains).
     *
     * @serial
     */
    private int size;
    /**
     * 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;

transient

transient关键字的作用是让某些被修饰的成员变量不被序列化。
ArrayList实现了 Serializable 接口，而在 ArrayList的声明中有： transient Object[] elementData;，使得elementData不会参与序列化操作。
ArrayList在序列化时会调用writeObject() 方法，将size和element写入ObjectOutputStream；反序列化时调用readObject() ，从ObjectInputStream获取size和element，再恢复到elementData。

原因：

elementData是一个缓存数组，它通常会预留一些容量，等容量不足时再扩充容量，那么有些空间可能就没有实际存储元素，采用上诉的方式来实现序列化时，就可以保证只序列化实际存储的那些元素，而不是整个数组，从而节省空间和时间。

    private void writeObject(java.io.ObjectOutputStream s)
        throws java.io.IOException{
        // Write out element count, and any hidden stuff
        int expectedModCount = modCount;
        s.defaultWriteObject();

        // Write out size as capacity for behavioural compatibility with clone()
        s.writeInt(size);

        // Write out all elements in the proper order.
        for (int i=0; i<size; i++) {
            s.writeObject(elementData[i]);
        }

        if (modCount != expectedModCount) {
            throw new ConcurrentModificationException();
        }
    }

构造方法

/**
 * 根据initialCapacity 初始化一个空数组
 */
public ArrayList(int initialCapacity) {
    if (initialCapacity > 0) {
        this.elementData = new Object[initialCapacity];
    } else if (initialCapacity == 0) {
        this.elementData = EMPTY_ELEMENTDATA;
    } else {
        throw new IllegalArgumentException("Illegal Capacity: "+
                                           initialCapacity);
    }
}

/**
 * 不带参数初始化，默认容量为10
 */
public ArrayList() {
    this.elementData = DEFAULTCAPACITY_EMPTY_ELEMENTDATA;
}

/**
 * 通过集合做参数的形式初始化
 */
public ArrayList(Collection<? extends E> c) {
    elementData = c.toArray();
    if ((size = elementData.length) != 0) {
        // c.toArray might (incorrectly) not return Object[] (see 6260652)
        if (elementData.getClass() != Object[].class)
            elementData = Arrays.copyOf(elementData, size, Object[].class);
    } else {
        // replace with empty array.
        this.elementData = EMPTY_ELEMENTDATA;
    }
}

基础方法

clone

    /**
     * Returns a shallow copy of this <tt>ArrayList</tt> instance.  (The
     * elements themselves are not copied.)
     *
     * @return a clone of this <tt>ArrayList</tt> instance
     */
    public Object clone() {
        try {
            ArrayList<?> v = (ArrayList<?>) super.clone();
            v.elementData = Arrays.copyOf(elementData, size);
            v.modCount = 0;
            return v;
        } catch (CloneNotSupportedException e) {
            // this shouldn't happen, since we are Cloneable
            throw new InternalError(e);
        }
    }

trimToSize

最小化实例存储，将容器大小调整为当前元素所占用的容量大小。

    /**
     * Trims the capacity of this <tt>ArrayList</tt> instance to be the
     * list's current size.  An application can use this operation to minimize
     * the storage of an <tt>ArrayList</tt> instance.
     */
    public void trimToSize() {
        modCount++;
        if (size < elementData.length) {
            elementData = (size == 0)
              ? EMPTY_ELEMENTDATA
              : Arrays.copyOf(elementData, size);
        }
    }

add(E e)

在数组末尾添加元素

    /**
     * Appends the specified element to the end of this list.
     *
     * @param e element to be appended to this list
     * @return <tt>true</tt> (as specified by {@link Collection#add})
     */
    public boolean add(E e) {
        ensureCapacityInternal(size + 1);  // Increments modCount!!
        elementData[size++] = e;
        return true;
    }
    private void ensureCapacityInternal(int minCapacity) {
        ensureExplicitCapacity(calculateCapacity(elementData, minCapacity));
    }
    //计算容量
    //如果elementData是空，则返回默认容量10和size+1的最大值，否则返回size+1
    private static int calculateCapacity(Object[] elementData, int minCapacity) {
        if (elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA) {
            return Math.max(DEFAULT_CAPACITY, minCapacity);
        }
        return minCapacity;
    }
    //确保容量
    private void ensureExplicitCapacity(int minCapacity) {
        modCount++;//计数的
        // overflow-conscious code
        //如果size+1 > elementData.length证明数组已经放满，则增加容量，调用grow()
        if (minCapacity - elementData.length > 0)
            grow(minCapacity);
    }
      /**
     * Increases the capacity to ensure that it can hold at least the
     * number of elements specified by the minimum capacity argument.
     *
     * @param minCapacity the desired minimum capacity
     */
    private void grow(int minCapacity) {
        // overflow-conscious code
        // 如果新容量 < 最小容量， 则将最小容量赋值给新容量            
        // 如果 oldCapacity=1, 则 minCapacity=1+1=2   newCapacity=1+(1>>1)=1
        int oldCapacity = elementData.length;
        int newCapacity = oldCapacity + (oldCapacity >> 1);//1.5
        if (newCapacity - minCapacity < 0)
            newCapacity = minCapacity;
        if (newCapacity - MAX_ARRAY_SIZE > 0)
            newCapacity = hugeCapacity(minCapacity);
        // minCapacity is usually close to size, so this is a win:
        elementData = Arrays.copyOf(elementData, newCapacity);
    }

以上就是调用add(E e)方法的所用流程：

调用了ensureCapacityInternal()方法.注意参数是size+1
ensureCapacityInternal调用2个方法
calculateCapacity来计算容量：如果elementData是空，则返回默认容量10和size+1的最大值，否则返回size+1
ensureExplicitCapacity来确保容量（如果size+1 > elementData.length证明数组已经放满，则增加容量，调用grow()）
扩容

size + 1

如果集合添加元素成功后，集合中的实际元素个数
确保扩容不会出错

默认size== 0； 0 + 0 >> 1 = 0;

add(int index, E element)

    public void add(int index, E element) {
        rangeCheckForAdd(index);//越界异常检测方法

        ensureCapacityInternal(size + 1);  // Increments modCount!!
        System.arraycopy(elementData, index, elementData, index + 1,
                         size - index);
        elementData[index] = element;
        size++;
    }