public class ObjectBigArrayBigList<K> extends AbstractObjectBigList<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 FormAbstractObjectBigList.ObjectSubList<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 |
|---|
ObjectBigArrayBigList()
Creates a new big-array big list with
DEFAULT_INITIAL_CAPACITY
capacity. |
ObjectBigArrayBigList(Iterator<? extends K> i)
Creates a new big-array big list and fills it with the elements returned
by an iterator..
|
ObjectBigArrayBigList(K[][] a)
Creates a new big-array big list and fills it with the elements of a
given big array.
|
ObjectBigArrayBigList(K[][] a,
long offset,
long length)
Creates a new big-array big list and fills it with the elements of a
given big array.
|
ObjectBigArrayBigList(long capacity)
Creates a new big-array big list with given capacity.
|
ObjectBigArrayBigList(ObjectBigList<? extends K> l)
Creates a new big-array big list and fills it with a given type-specific
list.
|
ObjectBigArrayBigList(ObjectCollection<? extends K> c)
Creates a new big-array big list and fills it with a given type-specific
collection.
|
ObjectBigArrayBigList(ObjectIterator<? extends K> i)
Creates a new big-array big list and fills it with the elements returned
by a type-specific iterator..
|
| 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() |
ObjectBigArrayBigList<K> |
clone() |
int |
compareTo(ObjectBigArrayBigList<? extends K> l)
Compares this big list to another big list.
|
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(ObjectBigArrayBigList<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(long index)
Returns a type-specific list iterator on this type-specific big list
starting at a given index.
|
boolean |
rem(Object k) |
K |
remove(long index)
Removes the element at the specified position.
|
boolean |
remove(Object o)
Delegates to
AbstractObjectCollection.rem(Object). |
boolean |
removeAll(Collection<?> c)
Remove from this collection all elements in the given collection.
|
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> ObjectBigArrayBigList<K> |
wrap(K[][] a)
Wraps a given big array into a big-array big list.
|
static <K> ObjectBigArrayBigList<K> |
wrap(K[][] a,
long length)
Wraps a given big array into a big-array list of given size.
|
addAll, addAll, addAll, addElements, addElements, compareTo, contains, equals, get, getElements, hashCode, iterator, listIterator, listIterator, peek, pop, push, remove, removeElements, set, size, size, subList, top, toStringcontainsAll, objectIterator, retainAll, toArray, toArrayobjectIterator, toArraycontainsAll, parallelStream, removeIf, retainAll, spliterator, stream, toArraypublic static final int DEFAULT_INITIAL_CAPACITY
public ObjectBigArrayBigList(long capacity)
capacity - the initial capacity of the array list (may be 0).public ObjectBigArrayBigList()
DEFAULT_INITIAL_CAPACITY
capacity.public ObjectBigArrayBigList(ObjectCollection<? extends K> c)
c - a type-specific collection that will be used to fill the array
list.public ObjectBigArrayBigList(ObjectBigList<? extends K> l)
l - a type-specific list that will be used to fill the array list.public ObjectBigArrayBigList(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 ObjectBigArrayBigList(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 ObjectBigArrayBigList(Iterator<? extends K> i)
i - an iterator whose returned elements will fill the array list.public ObjectBigArrayBigList(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> ObjectBigArrayBigList<K> wrap(K[][] a, long length)
a - a big array to wrap.length - the length of the resulting big-array list.public static <K> ObjectBigArrayBigList<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)
BigListadd in interface BigList<K>add in class AbstractObjectBigList<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 AbstractObjectBigList<K>public K get(long index)
BigListget in interface BigList<K>index - a position in the big list.List.get(int)public long indexOf(Object k)
BigListindexOf in interface BigList<K>indexOf in class AbstractObjectBigList<K>k - the object to search for.List.indexOf(Object)public long lastIndexOf(Object k)
BigListlastIndexOf in interface BigList<K>lastIndexOf in class AbstractObjectBigList<K>k - the object to search for.List.lastIndexOf(Object)public K remove(long index)
BigListremove in interface BigList<K>remove in class AbstractObjectBigList<K>index - a position in the big list.List.remove(int)public boolean rem(Object k)
rem in class AbstractObjectCollection<K>public boolean remove(Object o)
AbstractObjectCollectionAbstractObjectCollection.rem(Object).remove in interface Collection<K>remove in class AbstractObjectCollection<K>public K set(long index, K k)
BigListset in interface BigList<K>set in class AbstractObjectBigList<K>index - a position in the big list.k - the element to be stored at the specified position.List.set(int,Object)public boolean removeAll(Collection<?> c)
AbstractObjectCollectionremoveAll in interface Collection<K>removeAll in class AbstractObjectCollection<K>c - a collection.true if this collection changed as a result of the
call.public void clear()
clear in interface Collection<K>clear in class AbstractCollection<K>public long size64()
Size64public void size(long size)
BigListIf 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()
StackisEmpty in interface Stack<K>isEmpty in interface Collection<K>isEmpty in class AbstractObjectCollection<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(long index)
ObjectBigListlistIterator in interface BigList<K>listIterator in interface ObjectBigList<K>listIterator in class AbstractObjectBigList<K>index - index of first element to be returned from the big-list iterator.BigList.listIterator(long)public ObjectBigArrayBigList<K> clone()
public boolean equals(ObjectBigArrayBigList<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.public int compareTo(ObjectBigArrayBigList<? extends K> l)
This method exists only for sake of efficiency. The implementation inherited from the abstract implementation would already work.
l - a big list.