javase源码-ArrayList

javase

javase源码阅读

ArrayList

构造器

	//ArrayList的默认长度
	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.
     */
	//用于默认大小的空实例的共享空数组实例。我们将其与 EMPTY_ELEMENTDATA 区分开来，以了解添加第一个元素时要膨胀多少。
    private static final Object[] DEFAULTCAPACITY_EMPTY_ELEMENTDATA = {};

	/**
     * The size of the ArrayList (the number of elements it contains).
     * 当前长度
     * @serial
     */
    private int size;


    /**
     * Constructs an empty list with the specified initial capacity.
     *
     * @param  initialCapacity  the initial capacity of the list
     * @throws IllegalArgumentException if the specified initial capacity
     *         is negative
	 * 构造一个指定容量大小的ArrayList
     */
    public ArrayList(int initialCapacity) {
        if (initialCapacity > 0) {
			//创建一个大于0的ArrayList
            this.elementData = new Object[initialCapacity];
        } else if (initialCapacity == 0) {
            this.elementData = EMPTY_ELEMENTDATA;
        } else {
            throw new IllegalArgumentException("Illegal Capacity: "+
                                               initialCapacity);
        }
    }

    /**
     * Constructs an empty list with an initial capacity of ten.
     * 构造一个初始容量为 10 的空列表。容量大小为10 但是内容为0
     */
    public ArrayList() {
        this.elementData = DEFAULTCAPACITY_EMPTY_ELEMENTDATA;
    }

    /**
     * Constructs a list containing the elements of the specified
     * collection, in the order they are returned by the collection's
     * iterator.
     *
     * @param c the collection whose elements are to be placed into this list
     * @throws NullPointerException if the specified collection is null
     */
    public ArrayList(Collection<? extends E> c) {
        Object[] a = c.toArray();
        if ((size = a.length) != 0) {
            if (c.getClass() == ArrayList.class) {
                elementData = a;
            } else {
                elementData = Arrays.copyOf(a, size, Object[].class);
            }
        } else {
            // replace with empty array.
            elementData = EMPTY_ELEMENTDATA;
        }
    }

添加

 public boolean add(E e) {
	//判断容量是否足够
    ensureCapacityInternal(size + 1);  // Increments modCount!!
    elementData[size++] = e;
    return true;
}


private void ensureCapacityInternal(int minCapacity) {
	//判断容量是否足够
    ensureExplicitCapacity(calculateCapacity(elementData, minCapacity));
}

private void ensureExplicitCapacity(int minCapacity) {
	modCount++;

	// overflow-conscious code 如果当前容量不足，扩容
	if (minCapacity - elementData.length > 0)
		grow(minCapacity);
}

扩容

private void grow(int minCapacity) {
        // overflow-conscious code 将原数组容量存储
        int oldCapacity = elementData.length;
        //数组新容量，在原来基础上扩展0.5倍，即原来的1.5倍
        int newCapacity = oldCapacity + (oldCapacity >> 1);
        //容量大小不足以最小容量，就等于最小需要的容量
        if (newCapacity - minCapacity < 0)
            newCapacity = minCapacity;
        //如果新长度减去ArrayList最大容量，将当前容量置为最小需要容量
        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);
}

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

获取元素

 public E get(int index) {
	//判断索引是否越界
	rangeCheck(index);
	//返回
	return elementData(index);
}

E elementData(int index) {
	//返回数组中index位置的元素
	return (E) elementData[index];
}