If no such object exists, the list should be 'wrapped' using the Synchronizing on some object that naturally encapsulates the list. Resizes the backing array merely setting the value of an element is notĪ structural modification.) This is typically accomplished by

(A structural modification isĪny operation that adds or deletes one or more elements, or explicitly If multiple threads access an ArrayList instance concurrently,Īnd at least one of the threads modifies the list structurally, it Note that this implementation is not synchronized. This may reduce the amount of incremental reallocation. Specified beyond the fact that adding an element has constant amortizedĪn application can increase the capacity of an ArrayList instanceīefore adding a large number of elements using the ensureCapacity It is alwaysĪt least as large as the list size. The size of the array used to store the elements in the list. To that for the LinkedList implementation.Įach ArrayList instance has a capacity. That is, adding n elements requires O(n) time. The add operation runs in amortized constant time, Iterator, and listIterator operations run in constant Vector, except that it is unsynchronized.) This class provides methods to manipulate the size of the array that is In addition to implementing the List interface, ImplementsĪll optional list operations, and permits all elements, including Resizable-array implementation of the List interface.

Java array sort