it.unimi.dsi.fastutil.bytes

Class ByteBigArrayBigList

java.lang.Object

java.util.AbstractCollection<Byte>

it.unimi.dsi.fastutil.bytes.AbstractByteCollection

it.unimi.dsi.fastutil.bytes.AbstractByteBigList

it.unimi.dsi.fastutil.bytes.ByteBigArrayBigList

All Implemented Interfaces:

BigList<Byte>, ByteBigList, ByteCollection, ByteIterable, ByteStack, Size64, Stack<Byte>, Serializable, Cloneable, Comparable<BigList<? extends Byte>>, Iterable<Byte>, Collection<Byte>, RandomAccess

public class ByteBigArrayBigList
extends AbstractByteBigList
implements RandomAccess, Cloneable, Serializable

A type-specific big list based on a big array; provides some additional methods that use polymorphism to avoid (un)boxing.

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.

See Also:

ArrayList, Serialized Form

Nested Class Summary

Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.bytes.AbstractByteBigList

AbstractByteBigList.ByteSubList

Field Summary

Fields

Modifier and Type	Field and Description
static int	DEFAULT_INITIAL_CAPACITY The initial default capacity of a big-array big list.

Constructor Summary

Constructors

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.

Method Summary

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(long index) Returns a type-specific list iterator on this type-specific big list starting at a given index.
boolean	rem(byte k) Note that this method should be called remove(), but the clash with the similarly named index-based method in the List interface forces us to use a distinguished name.
boolean	removeAll(ByteCollection c) Remove from this collection all elements in the given type-specific collection.
boolean	removeAll(Collection<?> c) Remove from this collection all elements in the given collection.
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.

Methods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByteBigList

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, toString

Methods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByteCollection

add, byteIterator, contains, containsAll, containsAll, rem, remove, retainAll, retainAll, toArray, toArray, toArray, toByteArray, toByteArray

Methods inherited from class java.lang.Object

getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface it.unimi.dsi.fastutil.bytes.ByteCollection

byteIterator, containsAll, retainAll, toArray, toArray, toByteArray, toByteArray

Methods inherited from interface java.util.Collection

add, contains, containsAll, parallelStream, remove, removeIf, retainAll, spliterator, stream, toArray

Methods inherited from interface java.lang.Iterable

forEach

Field Detail

DEFAULT_INITIAL_CAPACITY

public static final int DEFAULT_INITIAL_CAPACITY

The initial default capacity of a big-array big list.

See Also:

Constant Field Values

Constructor Detail

ByteBigArrayBigList

public ByteBigArrayBigList(long capacity)

Creates a new big-array big list with given capacity.

Parameters:

capacity - the initial capacity of the array list (may be 0).

ByteBigArrayBigList

public ByteBigArrayBigList()

Creates a new big-array big list with DEFAULT_INITIAL_CAPACITY capacity.

ByteBigArrayBigList

public ByteBigArrayBigList(ByteCollection c)

Creates a new big-array big list and fills it with a given type-specific collection.

Parameters:

c - a type-specific collection that will be used to fill the array list.

ByteBigArrayBigList

public ByteBigArrayBigList(ByteBigList l)

Creates a new big-array big list and fills it with a given type-specific list.

Parameters:

l - a type-specific list that will be used to fill the array list.

ByteBigArrayBigList

public ByteBigArrayBigList(byte[][] a)

Creates a new big-array big list and fills it with the elements of a given big array.

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.

Parameters:

a - a big array whose elements will be used to fill the array list.

ByteBigArrayBigList

public 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.

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.

Parameters:

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.

ByteBigArrayBigList

public ByteBigArrayBigList(Iterator<? extends Byte> i)

Creates a new big-array big list and fills it with the elements returned by an iterator..

Parameters:

i - an iterator whose returned elements will fill the array list.

ByteBigArrayBigList

public ByteBigArrayBigList(ByteIterator i)

Creates a new big-array big list and fills it with the elements returned by a type-specific iterator..

Parameters:

i - a type-specific iterator whose returned elements will fill the array list.

Method Detail

elements

public byte[][] elements()

Returns the backing big array of this big list.

Returns:

the backing big array.

wrap

public static ByteBigArrayBigList wrap(byte[][] a,
                                       long length)

Wraps a given big array into a big-array list of given size.

Parameters:

a - a big array to wrap.

length - the length of the resulting big-array list.

Returns:

a new big-array list of the given size, wrapping the given big array.

wrap

public static ByteBigArrayBigList wrap(byte[][] a)

Wraps a given big array into a big-array big list.

Parameters:

a - a big array to wrap.

Returns:

a new big-array big list wrapping the given array.

ensureCapacity

public void ensureCapacity(long capacity)

Ensures that this big-array big list can contain the given number of entries without resizing.

Parameters:

capacity - the new minimum capacity for this big-array big list.

add

public void add(long index,
                byte k)

Specified by:

add in interface ByteBigList

Overrides:

add in class AbstractByteBigList

See Also:

List.add(int,Object)

add

public boolean add(byte k)

Specified by:

add in interface ByteCollection

Overrides:

add in class AbstractByteBigList

See Also:

Collection.add(Object)

getByte

public byte getByte(long index)

Specified by:

getByte in interface ByteBigList

See Also:

BigList.get(long)

indexOf

public long indexOf(byte k)

Specified by:

indexOf in interface ByteBigList

Overrides:

indexOf in class AbstractByteBigList

See Also:

BigList.indexOf(Object)

lastIndexOf

public long lastIndexOf(byte k)

Specified by:

lastIndexOf in interface ByteBigList

Overrides:

lastIndexOf in class AbstractByteBigList

See Also:

BigList.lastIndexOf(Object)

removeByte

public byte removeByte(long index)

Specified by:

removeByte in interface ByteBigList

Overrides:

removeByte in class AbstractByteBigList

See Also:

BigList.remove(long)

rem

public boolean rem(byte k)

Description copied from interface: ByteCollection

Note that this method should be called 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().

Specified by:

rem in interface ByteCollection

Overrides:

rem in class AbstractByteBigList

See Also:

Collection.remove(Object)

set

public byte set(long index,
                byte k)

Specified by:

set in interface ByteBigList

Overrides:

set in class AbstractByteBigList

See Also:

BigList.set(long,Object)

removeAll

public boolean removeAll(ByteCollection c)

Description copied from class: AbstractByteCollection

Remove from this collection all elements in the given type-specific collection.

Specified by:

removeAll in interface ByteCollection

Overrides:

removeAll in class AbstractByteCollection

Parameters:

c - a type-specific collection.

Returns:

true if this collection changed as a result of the call.

See Also:

Collection.removeAll(Collection)

removeAll

public boolean removeAll(Collection<?> c)

Description copied from class: AbstractByteCollection

Remove from this collection all elements in the given collection. If the collection is an instance of this class, it uses faster iterators.

Specified by:

removeAll in interface Collection<Byte>

Overrides:

removeAll in class AbstractByteCollection

Parameters:

c - a collection.

Returns:

true if this collection changed as a result of the call.

clear

public void clear()

Specified by:

clear in interface Collection<Byte>

Overrides:

clear in class AbstractCollection<Byte>

size64

public long size64()

Description copied from interface: Size64

Returns the size of this data structure as a long.

Specified by:

size64 in interface Size64

Returns:

the size of this data structure.

size

public void size(long size)

Description copied from interface: BigList

Sets the size of this big list.

If the specified size is smaller than the current size, the last elements are discarded. Otherwise, they are filled with 0/null/false.

Specified by:

size in interface BigList<Byte>

Overrides:

size in class AbstractByteBigList

Parameters:

size - the new size.

isEmpty

public boolean isEmpty()

Description copied from interface: Stack

Checks whether the stack is empty.

Specified by:

isEmpty in interface Stack<Byte>

Specified by:

isEmpty in interface Collection<Byte>

Overrides:

isEmpty in class AbstractByteCollection

Returns:

true if the stack is empty.

trim

public void trim()

Trims this big-array big list so that the capacity is equal to the size.

See Also:

ArrayList.trimToSize()

trim

public void trim(long n)

Trims the backing big array if it is too large. If the current big array length is smaller than or equal to 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.

Parameters:

n - the threshold for the trimming.

getElements

public 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.

Parameters:

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.

removeElements

public void removeElements(int from,
                           int to)

Removes elements of this type-specific list using optimized system calls.

Parameters:

from - the start index (inclusive).

to - the end index (exclusive).

addElements

public void addElements(int index,
                        byte[][] a,
                        long offset,
                        long length)

Adds elements to this type-specific list using optimized system calls.

Parameters:

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.

listIterator

public ByteBigListIterator listIterator(long index)

Description copied from interface: ByteBigList

Returns a type-specific list iterator on this type-specific big list starting at a given index.

Specified by:

listIterator in interface BigList<Byte>

Specified by:

listIterator in interface ByteBigList

Overrides:

listIterator in class AbstractByteBigList

Parameters:

index - index of first element to be returned from the big-list iterator.

Returns:

a big-list iterator of the elements in this big list, starting at the specified position in this big list.

See Also:

BigList.listIterator(long)

clone

public ByteBigArrayBigList clone()

Overrides:

clone in class Object

equals

public boolean equals(ByteBigArrayBigList l)

Compares this type-specific big-array list to another one.

This method exists only for sake of efficiency. The implementation inherited from the abstract implementation would already work.

Parameters:

l - a type-specific big-array list.

Returns:

true if the argument contains the same elements of this type-specific big-array list.

compareTo

public int compareTo(ByteBigArrayBigList l)

Compares this big list to another big list.

This method exists only for sake of efficiency. The implementation inherited from the abstract implementation would already work.

Parameters:

l - a big list.

Returns:

a negative integer, zero, or a positive integer as this big list is lexicographically less than, equal to, or greater than the argument.