Lines Matching defs:ArrayList

47  * <p>Each {@code ArrayList} instance has a <i>capacity</i>.  The capacity is
49 * at least as large as the list size. As elements are added to an ArrayList,
54 * <p>An application can increase the capacity of an {@code ArrayList} instance
59 * If multiple threads access an {@code ArrayList} instance concurrently,
71 * List list = Collections.synchronizedList(new ArrayList(...));</pre>
107 public class ArrayList<E> extends AbstractList<E>
130 * The array buffer into which the elements of the ArrayList are stored.
131 * The capacity of the ArrayList is the length of this array buffer. Any
132 * empty ArrayList with elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA
138 * The size of the ArrayList (the number of elements it contains).
151 public ArrayList(int initialCapacity) {
165 public ArrayList() {
177 public ArrayList(Collection<? extends E> c) {
191 * Trims the capacity of this {@code ArrayList} instance to be the
193 * the storage of an {@code ArrayList} instance.
205 * Increases the capacity of this {@code ArrayList} instance, if
349 * Returns a shallow copy of this {@code ArrayList} instance. (The
352 * @return a clone of this {@code ArrayList} instance
356 ArrayList<?> v = (ArrayList<?>) super.clone();
772 * Saves the state of the {@code ArrayList} instance to a stream
777 * @serialData The length of the array backing the {@code ArrayList}
801 * Reconstitutes the {@code ArrayList} instance from a stream (that is,
895 Object[] elementData = ArrayList.this.elementData;
908 ArrayList.this.remove(lastRet);
920 final int size = ArrayList.this.size;
968 Object[] elementData = ArrayList.this.elementData;
981 ArrayList.this.set(lastRet, e);
992 ArrayList.this.add(i, e);
1037 private final ArrayList<E> root;
1043 * Constructs a sublist of an arbitrary ArrayList.
1045 public SubList(ArrayList<E> root, int fromIndex, int toIndex) {
1312 public ArrayList<E>.ArrayListSpliterator trySplit() {
1336 ArrayList<E> lst = root;