Java初学日记九之ArrayList源码解析

ArrayList

1、初始化

无参初始化

  public ArrayList() {
	this.elementData = DEFAULTCAPACITY_EMPTY_ELEMENTDATA;
  }

指定容量大小的初始化

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

指定初始数据的初始化

  public ArrayList(Collection<? extends E> c) {
	// elementData是保存数组的容器，默认为null
	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 {
	  // 若无数据传入，则默认为空数组
	  this.elementData = EMPTY_ELEMENTDATA;
	}
  }

使用无参构造器初始化时，容量默认为0(1.8新特性)，只有进行添加数据时容量才会变为10。

2、添加元素及扩容

 public boolean add(E e) {
	//确保数组大小足够，不够需要扩容
	ensureCapacityInternal(size + 1);  // Increments modCount!!
	elementData[size++] = e;
	return true;
  }
  // 扩容数组
  private void grow(int minCapacity) {
        // overflow-conscious code
        int oldCapacity = elementData.length;
        int newCapacity = oldCapacity + (oldCapacity >> 1);
        // 如果新的容量大小小于容器容量大小，容器容量不变
        if (newCapacity - minCapacity < 0)
            newCapacity = minCapacity;
          
         // 如果新容量大小大于最大容量，返回int类型最大值为容量大小
        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();
        // 如果容量大小大于MAX_ARRAY_SIZE，返回int类型最大值
        return (minCapacity > MAX_ARRAY_SIZE) ?
            Integer.MAX_VALUE :
            MAX_ARRAY_SIZE;
    }

查找元素下标

    public int indexOf(Object o) {
        if (o == null) {
            for (int i = 0; i < size; i++)
                if (elementData[i]==null)
                    return i;
        } else {
            for (int i = 0; i < size; i++)
                if (o.equals(elementData[i]))
                    return i;
        }
        return -1;
    }

查找最后一个元素的下标

public int lastIndexOf(Object o) {
        if (o == null) {
            for (int i = size-1; i >= 0; i--)
                if (elementData[i]==null)
                    return i;
        } else {
            for (int i = size-1; i >= 0; i--)
                if (o.equals(elementData[i]))
                    return i;
        }
        return -1;
    }

复制数组

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

在指定位置添加数据

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

删除元素

public E remove(int index) {
        rangeCheck(index);

        modCount++;
        E oldValue = elementData(index);

        int numMoved = size - index - 1;
        if (numMoved > 0)
            System.arraycopy(elementData, index+1, elementData, index,
                             numMoved);
        elementData[--size] = null; // clear to let GC do its work

        return oldValue;
    }

清空数组

 public void clear() {
        modCount++;

        // clear to let GC do its work
        for (int i = 0; i < size; i++)
            elementData[i] = null;

        size = 0;
    }