public class IntBigArrayBigList extends AbstractIntBigList 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.
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(Iterator<? extends 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) |
void |
add(long index,
int k) |
void |
addElements(int index,
int[][] a,
long offset,
long length)
Adds elements to this type-specific list using optimized system calls.
|
void |
clear() |
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(int 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) |
long |
indexOf(int k) |
boolean |
isEmpty()
Checks whether the stack is empty.
|
long |
lastIndexOf(int k) |
IntBigListIterator |
listIterator(int index) |
boolean |
rem(int k)
|
void |
removeElements(int from,
int to)
Removes elements of this type-specific list using optimized system calls.
|
int |
removeInt(long index) |
int |
set(long index,
int k) |
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, addAll, addElements, addElements, compareTo, contains, equals, get, getElements, getInt, hashCode, indexOf, iterator, lastIndexOf, listIterator, listIterator, peek, peekInt, pop, popInt, push, push, remove, remove, removeElements, removeInt, set, set, size, size, subList, top, topInt, toString
add, contains, containsAll, containsAll, intIterator, rem, remove, removeAll, removeAll, retainAll, retainAll, toArray, toArray, toArray, toIntArray, toIntArray
containsAll, intIterator, removeAll, retainAll, toArray, toArray, toIntArray, toIntArray
add, contains, containsAll, remove, removeAll, retainAll, toArray
public 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(Iterator<? extends 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)
add
in interface IntBigList
add
in class AbstractIntBigList
List.add(int,Object)
public boolean add(int k)
add
in interface IntCollection
add
in class AbstractIntBigList
Collection.add(Object)
public int getInt(long index)
getInt
in interface IntBigList
BigList.get(long)
public long indexOf(int k)
indexOf
in interface IntBigList
indexOf
in class AbstractIntBigList
BigList.indexOf(Object)
public long lastIndexOf(int k)
lastIndexOf
in interface IntBigList
lastIndexOf
in class AbstractIntBigList
BigList.lastIndexOf(Object)
public int removeInt(long index)
removeInt
in interface IntBigList
removeInt
in class AbstractIntBigList
BigList.remove(long)
public boolean rem(int k)
IntCollection
remove()
, but the clash
with the similarly named index-based method in the List
interface
forces us to use a distinguished name. For simplicity, the set interfaces reinstates
remove()
.rem
in interface IntCollection
rem
in class AbstractIntBigList
Collection.remove(Object)
public int set(long index, int k)
set
in interface IntBigList
set
in class AbstractIntBigList
BigList.set(long,Object)
public void clear()
clear
in interface Collection<Integer>
clear
in class AbstractCollection<Integer>
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
.
size
in interface BigList<Integer>
size
in class AbstractIntBigList
size
- the new size.public boolean isEmpty()
Stack
isEmpty
in interface Stack<Integer>
isEmpty
in interface Collection<Integer>
isEmpty
in class AbstractIntCollection
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, int[][] 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, int[][] 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 IntBigListIterator listIterator(int index)
listIterator
in class AbstractIntBigList
public IntBigArrayBigList clone()
public 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.