public class ByteBigArrayBigList extends AbstractByteBigList 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 FormAbstractByteBigList.ByteSubList| Modifier and Type | Field and Description |
|---|---|
static int |
DEFAULT_INITIAL_CAPACITY
The initial default capacity of a big-array big list.
|
| Constructor and Description |
|---|
ByteBigArrayBigList()
Creates a new big-array big list with
DEFAULT_INITIAL_CAPACITY capacity. |
ByteBigArrayBigList(byte[][] a)
Creates a new big-array big list and fills it with the elements of a given big array.
|
ByteBigArrayBigList(byte[][] a,
long offset,
long length)
Creates a new big-array big list and fills it with the elements of a given big array.
|
ByteBigArrayBigList(ByteBigList l)
Creates a new big-array big list and fills it with a given type-specific list.
|
ByteBigArrayBigList(ByteCollection c)
Creates a new big-array big list and fills it with a given type-specific collection.
|
ByteBigArrayBigList(ByteIterator i)
Creates a new big-array big list and fills it with the elements returned by a type-specific iterator..
|
ByteBigArrayBigList(Iterator<? extends Byte> i)
Creates a new big-array big list and fills it with the elements returned by an iterator..
|
ByteBigArrayBigList(long capacity)
Creates a new big-array big list with given capacity.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(byte k) |
void |
add(long index,
byte k) |
void |
addElements(int index,
byte[][] a,
long offset,
long length)
Adds elements to this type-specific list using optimized system calls.
|
void |
clear() |
ByteBigArrayBigList |
clone() |
int |
compareTo(ByteBigArrayBigList l)
Compares this big list to another big list.
|
byte[][] |
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(ByteBigArrayBigList l)
Compares this type-specific big-array list to another one.
|
byte |
getByte(long index) |
void |
getElements(int from,
byte[][] a,
long offset,
long length)
Copies element of this type-specific list into the given big array using optimized system calls.
|
long |
indexOf(byte k) |
boolean |
isEmpty()
Checks whether the stack is empty.
|
long |
lastIndexOf(byte k) |
ByteBigListIterator |
listIterator(int index) |
boolean |
rem(byte k)
|
byte |
removeByte(long index) |
void |
removeElements(int from,
int to)
Removes elements of this type-specific list using optimized system calls.
|
byte |
set(long index,
byte 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 ByteBigArrayBigList |
wrap(byte[][] a)
Wraps a given big array into a big-array big list.
|
static ByteBigArrayBigList |
wrap(byte[][] 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, getByte, getElements, hashCode, indexOf, iterator, lastIndexOf, listIterator, listIterator, peek, peekByte, pop, popByte, push, push, remove, remove, removeByte, removeElements, set, set, size, size, subList, top, topByte, toStringadd, byteIterator, contains, containsAll, containsAll, rem, remove, removeAll, removeAll, retainAll, retainAll, toArray, toArray, toArray, toByteArray, toByteArraybyteIterator, containsAll, removeAll, retainAll, toArray, toArray, toByteArray, toByteArrayadd, contains, containsAll, parallelStream, remove, removeAll, removeIf, retainAll, spliterator, stream, toArraypublic static final int DEFAULT_INITIAL_CAPACITY
public ByteBigArrayBigList(long capacity)
capacity - the initial capacity of the array list (may be 0).public ByteBigArrayBigList()
DEFAULT_INITIAL_CAPACITY capacity.public ByteBigArrayBigList(ByteCollection c)
c - a type-specific collection that will be used to fill the array list.public ByteBigArrayBigList(ByteBigList l)
l - a type-specific list that will be used to fill the array list.public ByteBigArrayBigList(byte[][] 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 ByteBigArrayBigList(byte[][] 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 ByteBigArrayBigList(Iterator<? extends Byte> i)
i - an iterator whose returned elements will fill the array list.public ByteBigArrayBigList(ByteIterator i)
i - a type-specific iterator whose returned elements will fill the array list.public byte[][] elements()
public static ByteBigArrayBigList wrap(byte[][] a, long length)
a - a big array to wrap.length - the length of the resulting big-array list.public static ByteBigArrayBigList wrap(byte[][] 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,
byte k)
add in interface ByteBigListadd in class AbstractByteBigListList.add(int,Object)public boolean add(byte k)
add in interface ByteCollectionadd in class AbstractByteBigListCollection.add(Object)public byte getByte(long index)
getByte in interface ByteBigListBigList.get(long)public long indexOf(byte k)
indexOf in interface ByteBigListindexOf in class AbstractByteBigListBigList.indexOf(Object)public long lastIndexOf(byte k)
lastIndexOf in interface ByteBigListlastIndexOf in class AbstractByteBigListBigList.lastIndexOf(Object)public byte removeByte(long index)
removeByte in interface ByteBigListremoveByte in class AbstractByteBigListBigList.remove(long)public boolean rem(byte k)
ByteCollectionremove(), 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 ByteCollectionrem in class AbstractByteBigListCollection.remove(Object)public byte set(long index,
byte k)
set in interface ByteBigListset in class AbstractByteBigListBigList.set(long,Object)public void clear()
clear in interface Collection<Byte>clear in class AbstractCollection<Byte>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.
size in interface BigList<Byte>size in class AbstractByteBigListsize - the new size.public boolean isEmpty()
StackisEmpty in interface Stack<Byte>isEmpty in interface Collection<Byte>isEmpty in class AbstractByteCollectionpublic 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,
byte[][] 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,
byte[][] 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 ByteBigListIterator listIterator(int index)
listIterator in class AbstractByteBigListpublic ByteBigArrayBigList clone()
public boolean equals(ByteBigArrayBigList 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(ByteBigArrayBigList l)
This method exists only for sake of efficiency. The implementation inherited from the abstract implementation would already work.
l - a big list.