- All Implemented Interfaces:
- Serializable, Cloneable, Iterable<T>, Collection<T>, List<T>, RandomAccess
public class SparseArrayList<T>extends ArrayList<T>
SparseList implements a sparse array. This class is identical to java.util.ArrayList, except that it permits assignment to array indexes that are beyond the current length of the list, using the expected set() and add() methods. The list is extended and null-filled in that case.
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 SparseList());
The iterators returned by this class's iterator and listIterator methods are fail-fast: if list is structurally modified at any time after the iterator is created, in any way except through the iterator's own remove or add methods, the iterator will throw a ConcurrentModificationException. Thus, in the face of concurrent modification, the iterator fails quickly and cleanly, rather than risking arbitrary, non-deterministic behavior at an undetermined time in the future.
- See Also:
- Serialized Form
Constructors Constructor and Description
SparseArrayList()Allocate a new SparseList object with the same default initial capacity as a java.util.ArrayList object created with its default constructor.
SparseArrayList(Collection<T> c)Constructs a list containing the elements of the specified collection, in the order they are returned by the collection's iterator.
SparseArrayList(int initialCapacity)Constructs an empty list with the specified initial capacity.
Methods Modifier and Type Method and Description
add(int index, T element)Inserts the specified element at the specified position in this list.
set(int index, T element)Replaces the element at the specified position in this list with the specified element.
Methods inherited from class java.util.ArrayList
add, addAll, addAll, clear, clone, contains, ensureCapacity, get, indexOf, isEmpty, iterator, lastIndexOf, listIterator, listIterator, remove, remove, removeAll, retainAll, size, subList, toArray, toArray, trimToSize
public SparseArrayList(int initialCapacity)Constructs an empty list with the specified initial capacity.
initialCapacity- the initial capacity of the list.
IllegalArgumentException- if the specified initial capacity is negative
public SparseArrayList(Collection<T> c)Constructs a list containing the elements of the specified collection, in the order they are returned by the collection's iterator. The SparseList instance has an initial capacity of 110% the size of the specified collection.
c- the collection whose elements are to be placed into this list.
NullPointerException- if the specified collection is null.
public void add(int index, T element)Inserts the specified element at the specified position in this list. Shifts the element currently at that position (if any) and any subsequent elements to the right (adds one to their indices). If the specified index is beyond the end of the list, then this method behaves exactly like
public T set(int index, T element) throws IndexOutOfBoundsExceptionReplaces the element at the specified position in this list with the specified element. Unlike a regular ArrayList, this method does not throw an exception if the passed-in index is beyond the end of the array; instead, it extends the array (via ensureCapacity()) so that the index is legal. (But, the index must be positive.)
- Specified by:
index- index of element to replace or store
element- element to be stored at the specified position
- the element previously at the specified position, or null
IndexOutOfBoundsException- if index is negative
SCaVis 1.7 © jWork.org