ArrayList源码浅析

最新推荐文章于 2024-11-03 11:01:20 发布

Pandada。

最新推荐文章于 2024-11-03 11:01:20 发布

阅读量137

点赞数

分类专栏：集合文章标签： java

本文链接：https://blog.csdn.net/qq_41648688/article/details/114771484

版权

ArrayList是Java中实现List接口的一个类，提供常量时间的size、isEmpty、get、set等操作，线性时间的其他操作。ArrayList不是线程安全的，多线程环境下需要手动同步。本文详细分析了ArrayList的构造方法、扩容机制、get、set、add和remove方法。扩容主要通过ensureCapacityInternal在容量不足时以1.5倍进行，get和set方法直接根据数组下标访问，add方法在数组末尾添加元素，remove方法则涉及元素移动。

摘要由CSDN通过智能技术生成

ArrayList

$[外链图片转存失败,源站可能有防盗链机制,建议将图片保存下来直接上传(img-OoyHVF5C-1615655980593)(C:\Users\10374\AppData\Roaming\Typora\typora-user-images\image-20210314001916143.png)]$

Resizable-array implementation of the List interface. Implements all optional list operations, and permits all elements, including null. In addition to implementing the List interface, this class provides methods to manipulate the size of the array that is used internally to store the list. (This class is roughly equivalent to Vector, except that it is unsynchronized.)

List接口的可调整数组实现。实现所有可选的列表操作，并允许所有元素，包括null。除了实现List接口之外，该类还提供了一些方法来操作用于存储列表的内部数组的大小。(这个类大致相当于Vector，不同的是它是不同步的。)

The size, isEmpty, get, set, iterator, and listIterator operations run in constant time. The add operation runs in amortized constant time, that is, adding n elements requires O(n) time. All of the other operations run in linear time (roughly speaking). The constant factor is low compared to that for the LinkedList implementation.

size、isEmpty、get、set、iterator和listIterator操作在常量时间内运行。添加操作运行在平摊常数时间内，即添加n个元素需要O(n)时间。所有其他操作都在线性时间内运行(粗略地说)。与LinkedList实现相比，该常量因子较低。

Each ArrayList instance has a capacity. The capacity is the size of the array used to store the elements in the list. It is always at least as large as the list size. As elements are added to an ArrayList, its capacity grows automatically. The details of the growth policy are not specified beyond the fact that adding an element has constant amortized time cost.

每个ArrayList实例都有一个容量。容量是用于存储列表中元素的数组的大小。它总是至少与列表大小一样大。当元素被添加到ArrayList时，它的容量会自动增长。除了添加元素具有恒定的摊还时间成本这一事实之外，增长策略的细节没有被指定。

An application can increase the capacity of an ArrayList instance before adding a large number of elements using the ensureCapacity operation. This may reduce the amount of incremental reallocation.

应用程序可以在使用ensureCapacity操作添加大量元素之前增加ArrayList实例的容量。这可能会减少增量重新分配的数量。

Note that this implementation is not synchronized. If multiple threads access an ArrayList instance concurrently, and at least one of the threads modifies the list structurally, it must be synchronized externally. (A structural modification is any operation that adds or deletes one or more elements, or explicitly resizes the backing array; merely setting the value of an element is not a structural modification.) This is typically accomplished by synchronizing on some object that naturally encapsulates the list. If no such object exists, the list should be “wrapped” using the Collections.synchronizedList method. This is best done at creation time, to prevent accidental unsynchronized access to the list:
List list = Collections.synchronizedList(new ArrayList(…));
ArrayList是线程不安全的，多线程情况下必须外部同步。

	 /**
     * 默认初试容量
     */
    private static final int DEFAULT_CAPACITY = 10;

    /**
     * 空实体使用空数组
     */
    private static final Object[] EMPTY_ELEMENTDATA = {
   };

    /**
     *用于默认大小的空实例的共享空数组实例，以便知道何时膨胀多少添加第一个元素。
     */
    private static final Object[