ArrayList

ArrayList
Name	ArrayList
Type	Dynamic array
Developer	Sun Microsystems; Oracle Corporation
First release	JDK 1.2 (1998)
Implemented in	Java
License	GNU General Public License (for OpenJDK) / Oracle Binary Code License

ArrayList

ArrayList is a resizable-array implementation of the List interface in the Java platform, introduced by Sun Microsystems and standardized within the Java Collections Framework. It provides ordered, indexed storage of object references and automatic capacity management, supporting random access and iteration suitable for many application domains including web services, desktop software, and large-scale data processing. Implementations used in OpenJDK and Oracle JDK are widely deployed across projects from Apache Hadoop to Spring Framework, influencing libraries and tools in the Java ecosystem.

Overview

ArrayList implements the java.util.List interface and is part of the Java Collections Framework designed by Sun Microsystems engineers working with the Java Community Process. It stores elements in a contiguous array internally, allowing constant-time positional access and efficient traversal useful for systems such as Apache Tomcat, Eclipse, and NetBeans. Typical uses appear in frameworks like Spring, Hibernate, and Jakarta EE, and in tooling from IntelliJ IDEA, Android SDK, and Gradle where dynamic resizing and index-based operations are convenient. Language-level support via the Java Virtual Machine and tooling from Oracle and OpenJDK ensures interoperability with projects such as Maven, Ant, and Jenkins.

Implementation and Internal Structure

The core implementation maintains an internal array (often named elementData) and an integer size field; capacity grows when additions exceed current capacity. Growth policies in HotSpot/OpenJDK historically use a formula (newCapacity = oldCapacity + (oldCapacity >> 1)) to increase by about 50%, balancing memory overhead and reallocation cost. Constructors allow initialCapacity hints and creation from existing Collections, optimizing interactions with types such as ArrayDeque, LinkedList, and Vector. Internal behavior affects serialization and deserialization in the Java Serialization API, impacting enterprise use in Jakarta EE servers and cloud platforms like Amazon Web Services and Google Cloud Platform. Optimizations in JDK implementations influence performance profiles in applications like Apache Kafka, Elasticsearch, and Cassandra.

Common Operations and Performance

Random access via get(index) is O(1), benefiting use cases in libraries like Guava, Apache Commons, and JavaFX. Adding at the end is amortized O(1) due to geometric growth; inserting or removing at arbitrary positions is O(n) because of array copy operations often implemented with System.arraycopy, which itself is optimized in HotSpot and used by frameworks such as Netty and Akka. Iteration with a for-each loop or explicit Iterator is common in projects like Spring MVC and Play Framework; fail-fast behavior on concurrent modification helps detect incorrect sharing in multithreaded environments influenced by practices from Google, Facebook, and Microsoft. Memory usage is proportional to capacity; excess capacity can be trimmed via trimToSize, a method used in performance-sensitive code like Android apps and real-time trading systems.

Usage and Examples

Common creation patterns include new ArrayList<>() and new ArrayList<>(existingCollection), where existing collections may be instances of LinkedList, HashSet, or TreeSet from libraries such as Apache Commons Collections and Eclipse Collections. Typical idioms appear in tutorials from Oracle, books by authors at O’Reilly and Manning, and courses from Coursera and edX that demonstrate loops, streams, and lambda expressions interacting with ArrayList. Integration examples include converting to arrays for JNI or JNI-bound libraries, using subList for windowed operations in analytics stacks like Apache Flink and Apache Beam, and combining with Collections.unmodifiableList in security-sensitive modules in projects like OpenJDK and Eclipse RCP. Code examples in popular IDEs such as IntelliJ IDEA and Visual Studio Code often illustrate add, remove, set, and clear operations.

Thread Safety and Concurrency Considerations

ArrayList is not synchronized; concurrent modification by threads without external synchronization can lead to data races and undefined behavior, a concern in multithreaded platforms like Akka, Play Framework, and the Java Concurrency utilities. For safe concurrent access, developers often use Collections.synchronizedList (backed by ArrayList) or switch to thread-safe collections such as CopyOnWriteArrayList and ConcurrentLinkedDeque from java.util.concurrent, patterns adopted in server frameworks like Netty and application servers including WildFly and GlassFish. Alternatives for high-concurrency scenarios include using ImmutableList from Guava or persistent collections from Clojure, and applying explicit synchronization strategies seen in projects by IBM, Red Hat, and Oracle.

Alternatives and Comparisons

ArrayList is frequently compared with LinkedList, Vector, CopyOnWriteArrayList, and arrays (T[]) in terms of access and modification costs. LinkedList offers constant-time insertions and removals at ends and iterator-based operations useful in streaming pipelines like Apache Camel, but pays a penalty for random access. Vector is synchronized and legacy, historically used in Swing and older JDK codebases from Sun and IBM, whereas CopyOnWriteArrayList targets read-heavy concurrency patterns in frameworks like Spring Security. Primitive-specialized libraries such as fastutil and HPPC provide memory and performance advantages for numeric-heavy workloads found in Hadoop, Spark, and numerical libraries from MathWorks and NumPy interop layers. Choice among these options depends on project constraints from corporate environments like Google, Amazon, Facebook, and enterprise stacks provided by Oracle and Red Hat.

Category:Java platform