public class IntBigArrayBigList extends AbstractIntBigList implements java.util.RandomAccess, java.lang.Cloneable, java.io.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.
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 FormAbstractIntBigList.IntSubList| Modifier and Type | Field and Description |
|---|---|
static int |
DEFAULT_INITIAL_CAPACITY
The initial default capacity of a big-array big list.
|
| Constructor and Description |
|---|
IntBigArrayBigList()
Creates a new big-array big list with
DEFAULT_INITIAL_CAPACITY
capacity. |
IntBigArrayBigList(int[][] a)
Creates a new big-array big list and fills it with the elements of a given
big array.
|
IntBigArrayBigList(int[][] a,
long offset,
long length)
Creates a new big-array big list and fills it with the elements of a given
big array.
|
IntBigArrayBigList(IntBigList l)
Creates a new big-array big list and fills it with a given type-specific
list.
|
IntBigArrayBigList(IntCollection c)
Creates a new big-array big list and fills it with a given type-specific
collection.
|
IntBigArrayBigList(IntIterator i)
Creates a new big-array big list and fills it with the elements returned by a
type-specific iterator..
|
IntBigArrayBigList(java.util.Iterator<? extends java.lang.Integer> i)
Creates a new big-array big list and fills it with the elements returned by
an iterator..
|
IntBigArrayBigList(long capacity)
Creates a new big-array big list with given capacity.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(int k)
Ensures that this collection contains the specified element (optional
operation).
|
void |
add(long index,
int k)
Inserts the specified element at the specified position in this type-specific
big list (optional operation).
|
void |
addElements(long index,
int[][] a,
long offset,
long length)
Adds elements to this type-specific list using optimized system calls.
|
void |
clear()
This implementation delegates to
AbstractIntBigList.removeElements(long, long). |
IntBigArrayBigList |
clone() |
int |
compareTo(IntBigArrayBigList l)
Compares this big list to another big list.
|
int[][] |
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(IntBigArrayBigList l)
Compares this type-specific big-array list to another one.
|
void |
getElements(long from,
int[][] a,
long offset,
long length)
Copies element of this type-specific list into the given big array using
optimized system calls.
|
int |
getInt(long index)
Returns the element at the specified position.
|
long |
indexOf(int k)
Returns the index of the first occurrence of the specified element in this
type-specific big list, or -1 if this big list does not contain the element.
|
boolean |
isEmpty()
Checks whether the stack is empty.
|
long |
lastIndexOf(int k)
Returns the index of the last occurrence of the specified element in this
type-specific big list, or -1 if this big list does not contain the element.
|
IntBigListIterator |
listIterator(long index)
Returns a type-specific list iterator on this type-specific big list starting
at a given index.
|
boolean |
rem(int k)
Removes a single instance of the specified element from this collection, if
it is present (optional operation).
|
boolean |
removeAll(java.util.Collection<?> c) |
boolean |
removeAll(IntCollection c)
Remove from this collection all elements in the given type-specific
collection.
|
void |
removeElements(long from,
long to)
Removes elements of this type-specific list using optimized system calls.
|
int |
removeInt(long index)
Removes the element at the specified position.
|
int |
set(long index,
int 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 IntBigArrayBigList |
wrap(int[][] a)
Wraps a given big array into a big-array big list.
|
static IntBigArrayBigList |
wrap(int[][] a,
long length)
Wraps a given big array into a big-array list of given size.
|
add, addAll, addAll, addAll, addAll, addAll, addAll, addElements, compareTo, contains, equals, get, hashCode, indexOf, iterator, lastIndexOf, listIterator, peek, peekInt, pop, popInt, push, push, remove, set, size, subList, top, topInt, toStringadd, contains, containsAll, remove, retainAll, toArray, toIntArray, toIntArrayadd, contains, containsAll, remove, removeIf, removeIf, retainAll, toArray, toIntArray, toIntArraycontainsAll, parallelStream, retainAll, spliterator, stream, toArray, toArrayforEach, forEachpublic static final int DEFAULT_INITIAL_CAPACITY
public IntBigArrayBigList(long capacity)
capacity - the initial capacity of the array list (may be 0).public IntBigArrayBigList()
DEFAULT_INITIAL_CAPACITY
capacity.public IntBigArrayBigList(IntCollection c)
c - a type-specific collection that will be used to fill the array
list.public IntBigArrayBigList(IntBigList l)
l - a type-specific list that will be used to fill the array list.public IntBigArrayBigList(int[][] 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 IntBigArrayBigList(int[][] 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 IntBigArrayBigList(java.util.Iterator<? extends java.lang.Integer> i)
i - an iterator whose returned elements will fill the array list.public IntBigArrayBigList(IntIterator i)
i - a type-specific iterator whose returned elements will fill the
array list.public int[][] elements()
public static IntBigArrayBigList wrap(int[][] a, long length)
a - a big array to wrap.length - the length of the resulting big-array list.public static IntBigArrayBigList wrap(int[][] 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,
int k)
AbstractIntBigList
This implementation always throws an UnsupportedOperationException.
add in interface IntBigListadd in class AbstractIntBigListBigList.add(long,Object)public boolean add(int k)
AbstractIntBigList
This implementation always throws an UnsupportedOperationException.
This implementation delegates to the type-specific version of
BigList.add(long, Object).
add in interface IntCollectionadd in class AbstractIntBigListCollection.add(Object)public int getInt(long index)
IntBigListgetInt in interface IntBigListBigList.get(long)public long indexOf(int k)
IntBigListindexOf in interface IntBigListindexOf in class AbstractIntBigListBigList.indexOf(Object)public long lastIndexOf(int k)
IntBigListlastIndexOf in interface IntBigListlastIndexOf in class AbstractIntBigListBigList.lastIndexOf(Object)public int removeInt(long index)
AbstractIntBigList
This implementation always throws an UnsupportedOperationException.
removeInt in interface IntBigListremoveInt in class AbstractIntBigListBigList.remove(long)public boolean rem(int k)
AbstractIntBigList
This implementation delegates to indexOf().
rem in interface IntCollectionrem in class AbstractIntBigListCollection.remove(Object)public int set(long index,
int k)
AbstractIntBigList
This implementation always throws an UnsupportedOperationException.
set in interface IntBigListset in class AbstractIntBigListBigList.set(long,Object)public boolean removeAll(IntCollection c)
IntCollectionremoveAll in interface IntCollectionremoveAll in class AbstractIntCollectionc - a type-specific collection.true if this collection changed as a result of the call.Collection.removeAll(Collection)public boolean removeAll(java.util.Collection<?> c)
removeAll in interface java.util.Collection<java.lang.Integer>removeAll in class java.util.AbstractCollection<java.lang.Integer>public void clear()
AbstractIntBigList
This implementation delegates to AbstractIntBigList.removeElements(long, long).
clear in interface java.util.Collection<java.lang.Integer>clear in class AbstractIntBigListpublic 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.
size in interface BigList<java.lang.Integer>size in class AbstractIntBigListsize - the new size.public boolean isEmpty()
Stackpublic 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(long from,
int[][] a,
long offset,
long length)
getElements in interface IntBigListgetElements in class AbstractIntBigListfrom - 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(long from,
long to)
removeElements in interface IntBigListremoveElements in class AbstractIntBigListfrom - the start index (inclusive).to - the end index (exclusive).public void addElements(long index,
int[][] a,
long offset,
long length)
addElements in interface IntBigListaddElements in class AbstractIntBigListindex - 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 IntBigListIterator listIterator(long index)
AbstractIntBigList
Note that this specification strengthens the one given in
BigList.listIterator(long).
This implementation is based on the random-access methods.
listIterator in interface BigList<java.lang.Integer>listIterator in interface IntBigListlistIterator in class AbstractIntBigListindex - index of first element to be returned from the big-list iterator.BigList.listIterator(long)public IntBigArrayBigList clone()
clone in class java.lang.Objectpublic boolean equals(IntBigArrayBigList 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(IntBigArrayBigList l)
This method exists only for sake of efficiency. The implementation inherited from the abstract implementation would already work.
l - a big list.