public class ReferenceBigArrayBigList<K> extends AbstractReferenceBigList<K> implements RandomAccess, Cloneable, Serializable
This class implements a lightweight, fast, open, optimized,
reuse-oriented version of big-array-based big lists. Instances of this class
represent a big list with a big array that is enlarged as needed when new entries
are created (by doubling the current length), but is
never made smaller (even on a clear()
). A family of
trimming methods lets you control the size of the
backing big array; this is particularly useful if you reuse instances of this class.
Range checks are equivalent to those of java.util
's classes, but
they are delayed as much as possible.
The backing big array is exposed by the elements()
method. If an instance
of this class was created by wrapping,
backing-array reallocations will be performed using reflection, so that
elements()
can return a big array of the same type of the original big array; the comments
about efficiency made in ObjectArrays
apply here.
This class implements the bulk methods removeElements()
,
addElements()
and getElements()
using
high-performance system calls (e.g., System.arraycopy()
instead of
expensive loops.
ArrayList
,
Serialized FormAbstractReferenceBigList.ReferenceSubList<K>
Modifier and Type | Field and Description |
---|---|
static int |
DEFAULT_INITIAL_CAPACITY
The initial default capacity of a big-array big list.
|
Constructor and Description |
---|
ReferenceBigArrayBigList()
Creates a new big-array big list with
DEFAULT_INITIAL_CAPACITY capacity. |
ReferenceBigArrayBigList(Iterator<? extends K> i)
Creates a new big-array big list and fills it with the elements returned by an iterator..
|
ReferenceBigArrayBigList(K[][] a)
Creates a new big-array big list and fills it with the elements of a given big array.
|
ReferenceBigArrayBigList(K[][] a,
long offset,
long length)
Creates a new big-array big list and fills it with the elements of a given big array.
|
ReferenceBigArrayBigList(long capacity)
Creates a new big-array big list with given capacity.
|
ReferenceBigArrayBigList(ObjectIterator<? extends K> i)
Creates a new big-array big list and fills it with the elements returned by a type-specific iterator..
|
ReferenceBigArrayBigList(ReferenceBigList<? extends K> l)
Creates a new big-array big list and fills it with a given type-specific list.
|
ReferenceBigArrayBigList(ReferenceCollection<? extends K> c)
Creates a new big-array big list and fills it with a given type-specific collection.
|
Modifier and Type | Method and Description |
---|---|
boolean |
add(K k) |
void |
add(long index,
K k)
Inserts the specified element at the specified position in this big list (optional operation).
|
void |
addElements(int index,
K[][] a,
long offset,
long length)
Adds elements to this type-specific list using optimized system calls.
|
void |
clear() |
ReferenceBigArrayBigList<K> |
clone() |
K[][] |
elements()
Returns the backing big array of this big list.
|
void |
ensureCapacity(long capacity)
Ensures that this big-array big list can contain the given number of entries without resizing.
|
boolean |
equals(ReferenceBigArrayBigList<K> l)
Compares this type-specific big-array list to another one.
|
K |
get(long index)
Returns the element at the specified position.
|
void |
getElements(int from,
Object[][] a,
long offset,
long length)
Copies element of this type-specific list into the given big array using optimized system calls.
|
long |
indexOf(Object k)
Returns the index of the first occurrence of the specified element in this big list, or -1 if this big list does not contain the element.
|
boolean |
isEmpty()
Checks whether the stack is empty.
|
long |
lastIndexOf(Object k)
Returns the index of the last occurrence of the specified element in this big list, or -1 if this big list does not contain the element.
|
ObjectBigListIterator<K> |
listIterator(int index) |
boolean |
rem(Object k) |
K |
remove(long index)
Removes the element at the specified position.
|
boolean |
remove(Object o) |
void |
removeElements(int from,
int to)
Removes elements of this type-specific list using optimized system calls.
|
K |
set(long index,
K k)
Replaces the element at the specified position in this big list with the specified element (optional operation).
|
void |
size(long size)
Sets the size of this big list.
|
long |
size64()
Returns the size of this data structure as a long.
|
void |
trim()
Trims this big-array big list so that the capacity is equal to the size.
|
void |
trim(long n)
Trims the backing big array if it is too large.
|
static <K> ReferenceBigArrayBigList<K> |
wrap(K[][] a)
Wraps a given big array into a big-array big list.
|
static <K> ReferenceBigArrayBigList<K> |
wrap(K[][] a,
long length)
Wraps a given big array into a big-array list of given size.
|
addAll, addAll, addAll, addElements, addElements, contains, equals, get, getElements, hashCode, iterator, listIterator, listIterator, peek, pop, push, remove, removeElements, set, size, size, subList, top, toString
containsAll, objectIterator, removeAll, retainAll, toArray, toArray
objectIterator, toArray
containsAll, removeAll, retainAll, toArray
public static final int DEFAULT_INITIAL_CAPACITY
public ReferenceBigArrayBigList(long capacity)
capacity
- the initial capacity of the array list (may be 0).public ReferenceBigArrayBigList()
DEFAULT_INITIAL_CAPACITY
capacity.public ReferenceBigArrayBigList(ReferenceCollection<? extends K> c)
c
- a type-specific collection that will be used to fill the array list.public ReferenceBigArrayBigList(ReferenceBigList<? extends K> l)
l
- a type-specific list that will be used to fill the array list.public ReferenceBigArrayBigList(K[][] a)
Note that this constructor makes it easy to build big lists from literal arrays
declared as type[][] {{ init_values }}
.
The only constraint is that the number of initialisation values is
below BigArrays.SEGMENT_SIZE
.
a
- a big array whose elements will be used to fill the array list.public ReferenceBigArrayBigList(K[][] a, long offset, long length)
Note that this constructor makes it easy to build big lists from literal arrays
declared as type[][] {{ init_values }}
.
The only constraint is that the number of initialisation values is
below BigArrays.SEGMENT_SIZE
.
a
- a big array whose elements will be used to fill the array list.offset
- the first element to use.length
- the number of elements to use.public ReferenceBigArrayBigList(Iterator<? extends K> i)
i
- an iterator whose returned elements will fill the array list.public ReferenceBigArrayBigList(ObjectIterator<? extends K> i)
i
- a type-specific iterator whose returned elements will fill the array list.public K[][] elements()
If this big-array big list was created by wrapping a given big array, it is guaranteed that the type of the returned big array will be the same. Otherwise, the returned big array will be an big array of objects.
public static <K> ReferenceBigArrayBigList<K> wrap(K[][] a, long length)
a
- a big array to wrap.length
- the length of the resulting big-array list.public static <K> ReferenceBigArrayBigList<K> wrap(K[][] a)
a
- a big array to wrap.public void ensureCapacity(long capacity)
capacity
- the new minimum capacity for this big-array big list.public void add(long index, K k)
BigList
add
in interface BigList<K>
add
in class AbstractReferenceBigList<K>
index
- a position in the big list.k
- an element to be inserted.List.add(int,Object)
public boolean add(K k)
add
in interface Collection<K>
add
in class AbstractReferenceBigList<K>
public K get(long index)
BigList
get
in interface BigList<K>
index
- a position in the big list.List.get(int)
public long indexOf(Object k)
BigList
indexOf
in interface BigList<K>
indexOf
in class AbstractReferenceBigList<K>
k
- the object to search for.List.indexOf(Object)
public long lastIndexOf(Object k)
BigList
lastIndexOf
in interface BigList<K>
lastIndexOf
in class AbstractReferenceBigList<K>
k
- the object to search for.List.lastIndexOf(Object)
public K remove(long index)
BigList
remove
in interface BigList<K>
remove
in class AbstractReferenceBigList<K>
index
- a position in the big list.List.remove(int)
public boolean rem(Object k)
public boolean remove(Object o)
remove
in interface Collection<K>
remove
in class AbstractCollection<K>
public K set(long index, K k)
BigList
set
in interface BigList<K>
set
in class AbstractReferenceBigList<K>
index
- a position in the big list.k
- the element to be stored at the specified position.List.set(int,Object)
public void clear()
clear
in interface Collection<K>
clear
in class AbstractCollection<K>
public long size64()
Size64
public void size(long size)
BigList
If the specified size is smaller than the current size, the last elements are
discarded. Otherwise, they are filled with 0/null
/false
.
public boolean isEmpty()
Stack
isEmpty
in interface Stack<K>
isEmpty
in interface Collection<K>
isEmpty
in class AbstractReferenceCollection<K>
public void trim()
ArrayList.trimToSize()
public void trim(long n)
n
, this method does nothing. Otherwise, it trims the
big-array length to the maximum between n
and size64()
.
This method is useful when reusing big lists. Clearing a big list leaves the big-array length untouched. If you are reusing a big list many times, you can call this method with a typical size to avoid keeping around a very large big array just because of a few large transient big lists.
n
- the threshold for the trimming.public void getElements(int from, Object[][] a, long offset, long length)
from
- the start index (inclusive).a
- the destination big array.offset
- the offset into the destination array where to store the first element copied.length
- the number of elements to be copied.public void removeElements(int from, int to)
from
- the start index (inclusive).to
- the end index (exclusive).public void addElements(int index, K[][] a, long offset, long length)
index
- the index at which to add elements.a
- the big array containing the elements.offset
- the offset of the first element to add.length
- the number of elements to add.public ObjectBigListIterator<K> listIterator(int index)
listIterator
in class AbstractReferenceBigList<K>
public ReferenceBigArrayBigList<K> clone()
public boolean equals(ReferenceBigArrayBigList<K> l)
This method exists only for sake of efficiency. The implementation inherited from the abstract implementation would already work.
l
- a type-specific big-array list.