totalcross.util

Class ArrayList4D<E>

java.lang.Object

java.util.AbstractCollection<E>

java.util.AbstractList<E>

totalcross.util.ArrayList4D<E>

All Implemented Interfaces:

java.lang.Cloneable, java.lang.Iterable<E>, java.util.Collection<E>, java.util.List<E>, java.util.RandomAccess

public class ArrayList4D<E>
extends java.util.AbstractList<E>
implements java.util.List<E>, java.util.RandomAccess, java.lang.Cloneable

An array-backed implementation of the List interface. This implements all optional list operations, and permits null elements, so that it is better than Vector, which it replaces. Random access is roughly constant time, and iteration is roughly linear time, so it is nice and fast, with less overhead than a LinkedList.

Each list has a capacity, and as the array reaches that capacity it is automatically transferred to a larger array. You also have access to ensureCapacity and trimToSize to control the backing array's size, avoiding reallocation or wasted memory.

ArrayList is not synchronized, so if you need multi-threaded access, consider using:
List l = Collections.synchronizedList(new ArrayList(...));

The iterators are fail-fast, meaning that any structural modification, except for remove() called on the iterator itself, cause the iterator to throw a ConcurrentModificationException rather than exhibit non-deterministic behavior.

See Also:

Collection, List, LinkedList, Vector, Collections.synchronizedList(List), AbstractList

Field Summary

Fields inherited from class java.util.AbstractList

modCount

Constructor Summary

Constructors

Constructor and Description
ArrayList4D() Construct a new ArrayList with the default capacity (16).
ArrayList4D(java.util.Collection<? extends E> c) Construct a new ArrayList, and initialize it with the elements in the supplied Collection.
ArrayList4D(int capacity) Construct a new ArrayList with the supplied initial capacity.

Method Summary

Modifier and Type	Method and Description
boolean	add(E e) Appends the supplied element to the end of this list.
void	add(int index, E e) Adds the supplied element at the specified index, shifting all elements currently at that index or higher one to the right.
boolean	addAll(java.util.Collection<? extends E> c) Add each element in the supplied Collection to this List.
boolean	addAll(int index, java.util.Collection<? extends E> c) Add all elements in the supplied collection, inserting them beginning at the specified index.
void	clear() Removes all elements from this List
java.lang.Object	clone() Creates a shallow copy of this ArrayList (elements are not cloned).
boolean	contains(java.lang.Object e) Returns true iff element is in this ArrayList.
void	ensureCapacity(int minCapacity) Guarantees that this list will have at least enough capacity to hold minCapacity elements.
E	get(int index) Retrieves the element at the user-supplied index.
int	indexOf(java.lang.Object e) Returns the lowest index at which element appears in this List, or -1 if it does not appear.
boolean	isEmpty() Checks if the list is empty.
int	lastIndexOf(java.lang.Object e) Returns the highest index at which element appears in this List, or -1 if it does not appear.
E	remove(int index) Removes the element at the user-supplied index.
protected void	removeRange(int fromIndex, int toIndex) Removes all elements in the half-open interval [fromIndex, toIndex).
E	set(int index, E e) Sets the element at the specified index.
int	size() Returns the number of elements in this list.
void	sort(java.util.Comparator<? super E> c)
java.lang.Object[]	toArray() Returns an Object array containing all of the elements in this ArrayList.
<T> T[]	toArray(T[] a) Returns an Array whose component type is the runtime component type of the passed-in Array.
void	trimToSize() Trims the capacity of this List to be equal to its size; a memory saver.

Methods inherited from class java.util.AbstractList

equals, hashCode, iterator, listIterator, listIterator, subList

Methods inherited from class java.util.AbstractCollection

containsAll, remove, removeAll, retainAll, toString

Methods inherited from class java.lang.Object

finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.util.List

containsAll, equals, hashCode, iterator, listIterator, listIterator, remove, removeAll, replaceAll, retainAll, spliterator, subList

Methods inherited from interface java.util.Collection

parallelStream, removeIf, stream

Methods inherited from interface java.lang.Iterable

forEach

Constructor Detail

ArrayList4D

public ArrayList4D(int capacity)

Construct a new ArrayList with the supplied initial capacity.

Parameters:

capacity - initial capacity of this ArrayList

Throws:

java.lang.IllegalArgumentException - if capacity is negative

ArrayList4D

public ArrayList4D()

Construct a new ArrayList with the default capacity (16).

ArrayList4D

public ArrayList4D(java.util.Collection<? extends E> c)

Construct a new ArrayList, and initialize it with the elements in the supplied Collection. The initial capacity is 110% of the Collection's size.

Parameters:

c - the collection whose elements will initialize this list

Throws:

java.lang.NullPointerException - if c is null

Method Detail

trimToSize

public void trimToSize()

Trims the capacity of this List to be equal to its size; a memory saver.

ensureCapacity

public void ensureCapacity(int minCapacity)

Guarantees that this list will have at least enough capacity to hold minCapacity elements. This implementation will grow the list to max(current * 2, minCapacity) if (minCapacity > current). The JCL says explictly that "this method increases its capacity to minCap", while the JDK 1.3 online docs specify that the list will grow to at least the size specified.

Parameters:

minCapacity - the minimum guaranteed capacity

size

public int size()

Returns the number of elements in this list.

Specified by:

size in interface java.util.Collection<E>

Specified by:

size in interface java.util.List<E>

Specified by:

size in class java.util.AbstractCollection<E>

Returns:

the list size

isEmpty

public boolean isEmpty()

Checks if the list is empty.

Specified by:

isEmpty in interface java.util.Collection<E>

Specified by:

isEmpty in interface java.util.List<E>

Overrides:

isEmpty in class java.util.AbstractCollection<E>

Returns:

true if there are no elements

contains

public boolean contains(java.lang.Object e)

Returns true iff element is in this ArrayList.

Specified by:

contains in interface java.util.Collection<E>

Specified by:

contains in interface java.util.List<E>

Overrides:

contains in class java.util.AbstractCollection<E>

Parameters:

e - the element whose inclusion in the List is being tested

Returns:

true if the list contains e

indexOf

public int indexOf(java.lang.Object e)

Returns the lowest index at which element appears in this List, or -1 if it does not appear.

Specified by:

indexOf in interface java.util.List<E>

Overrides:

indexOf in class java.util.AbstractList<E>

Parameters:

e - the element whose inclusion in the List is being tested

Returns:

the index where e was found

lastIndexOf

public int lastIndexOf(java.lang.Object e)

Returns the highest index at which element appears in this List, or -1 if it does not appear.

Specified by:

lastIndexOf in interface java.util.List<E>

Overrides:

lastIndexOf in class java.util.AbstractList<E>

Parameters:

e - the element whose inclusion in the List is being tested

Returns:

the index where e was found

clone

public java.lang.Object clone()

Creates a shallow copy of this ArrayList (elements are not cloned).

Overrides:

clone in class java.lang.Object

Returns:

the cloned object

toArray

public java.lang.Object[] toArray()

Returns an Object array containing all of the elements in this ArrayList. The array is independent of this list.

Specified by:

toArray in interface java.util.Collection<E>

Specified by:

toArray in interface java.util.List<E>

Overrides:

toArray in class java.util.AbstractCollection<E>

Returns:

an array representation of this list

toArray

public <T> T[] toArray(T[] a)

Returns an Array whose component type is the runtime component type of the passed-in Array. The returned Array is populated with all of the elements in this ArrayList. If the passed-in Array is not large enough to store all of the elements in this List, a new Array will be created and returned; if the passed-in Array is larger than the size of this List, then size() index will be set to null.

Specified by:

toArray in interface java.util.Collection<E>

Specified by:

toArray in interface java.util.List<E>

Overrides:

toArray in class java.util.AbstractCollection<E>

Parameters:

a - the passed-in Array

Returns:

an array representation of this list

Throws:

java.lang.ArrayStoreException - if the runtime type of a does not allow an element in this list

java.lang.NullPointerException - if a is null

get

public E get(int index)

Retrieves the element at the user-supplied index.

Specified by:

get in interface java.util.List<E>

Specified by:

get in class java.util.AbstractList<E>

Parameters:

index - the index of the element we are fetching

Throws:

java.lang.IndexOutOfBoundsException - if index < 0 || index >= size()

set

public E set(int index,
             E e)

Sets the element at the specified index. The new element, e, can be an object of any type or null.

Specified by:

set in interface java.util.List<E>

Overrides:

set in class java.util.AbstractList<E>

Parameters:

index - the index at which the element is being set

e - the element to be set

Returns:

the element previously at the specified index

Throws:

java.lang.IndexOutOfBoundsException - if index < 0 || index >= 0

add

public boolean add(E e)

Appends the supplied element to the end of this list. The element, e, can be an object of any type or null.

Specified by:

add in interface java.util.Collection<E>

Specified by:

add in interface java.util.List<E>

Overrides:

add in class java.util.AbstractList<E>

Parameters:

e - the element to be appended to this list

Returns:

true, the add will always succeed

add

public void add(int index,
                E e)

Adds the supplied element at the specified index, shifting all elements currently at that index or higher one to the right. The element, e, can be an object of any type or null.

Specified by:

add in interface java.util.List<E>

Overrides:

add in class java.util.AbstractList<E>

Parameters:

index - the index at which the element is being added

e - the item being added

Throws:

java.lang.IndexOutOfBoundsException - if index < 0 || index > size()

remove

public E remove(int index)

Removes the element at the user-supplied index.

Specified by:

remove in interface java.util.List<E>

Overrides:

remove in class java.util.AbstractList<E>

Parameters:

index - the index of the element to be removed

Returns:

the removed Object

Throws:

java.lang.IndexOutOfBoundsException - if index < 0 || index >= size()

clear

public void clear()

Removes all elements from this List

Specified by:

clear in interface java.util.Collection<E>

Specified by:

clear in interface java.util.List<E>

Overrides:

clear in class java.util.AbstractList<E>

addAll

public boolean addAll(java.util.Collection<? extends E> c)

Add each element in the supplied Collection to this List. It is undefined what happens if you modify the list while this is taking place; for example, if the collection contains this list. c can contain objects of any type, as well as null values.

Specified by:

addAll in interface java.util.Collection<E>

Specified by:

addAll in interface java.util.List<E>

Overrides:

addAll in class java.util.AbstractCollection<E>

Parameters:

c - a Collection containing elements to be added to this List

Returns:

true if the list was modified, in other words c is not empty

Throws:

java.lang.NullPointerException - if c is null

addAll

public boolean addAll(int index,
                      java.util.Collection<? extends E> c)

Add all elements in the supplied collection, inserting them beginning at the specified index. c can contain objects of any type, as well as null values.

Specified by:

addAll in interface java.util.List<E>

Overrides:

addAll in class java.util.AbstractList<E>

Parameters:

index - the index at which the elements will be inserted

c - the Collection containing the elements to be inserted

Throws:

java.lang.IndexOutOfBoundsException - if index < 0 || index > 0

java.lang.NullPointerException - if c is null

removeRange

protected void removeRange(int fromIndex,
                           int toIndex)

Removes all elements in the half-open interval [fromIndex, toIndex). Does nothing when toIndex is equal to fromIndex.

Overrides:

removeRange in class java.util.AbstractList<E>

Parameters:

fromIndex - the first index which will be removed

toIndex - one greater than the last index which will be removed

Throws:

java.lang.IndexOutOfBoundsException - if fromIndex > toIndex

sort

public void sort(java.util.Comparator<? super E> c)

Specified by:

sort in interface java.util.List<E>