|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectjava.util.AbstractCollection<Long>
it.unimi.dsi.fastutil.longs.AbstractLongCollection
it.unimi.dsi.fastutil.longs.AbstractLongBigList
it.unimi.dsi.fastutil.longs.LongBigArrayBigList
public class LongBigArrayBigList
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 dividing the current length by the golden ratio), 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 FormNested Class Summary |
---|
Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.longs.AbstractLongBigList |
---|
AbstractLongBigList.LongSubList |
Field Summary | |
---|---|
static int |
DEFAULT_INITIAL_CAPACITY
The initial default capacity of a big-array big list. |
static long |
serialVersionUID
|
Constructor Summary | |
---|---|
LongBigArrayBigList()
Creates a new big-array big list with DEFAULT_INITIAL_CAPACITY capacity. |
|
LongBigArrayBigList(Iterator<? extends Long> i)
Creates a new big-array big list and fills it with the elements returned by an iterator.. |
|
LongBigArrayBigList(long capacity)
Creates a new big-array big list with given capacity. |
|
LongBigArrayBigList(long[][] a)
Creates a new big-array big list and fills it with the elements of a given big array. |
|
LongBigArrayBigList(long[][] a,
long offset,
long length)
Creates a new big-array big list and fills it with the elements of a given big array. |
|
LongBigArrayBigList(LongBigList l)
Creates a new big-array big list and fills it with a given type-specific list. |
|
LongBigArrayBigList(LongCollection c)
Creates a new big-array big list and fills it with a given type-specific collection. |
|
LongBigArrayBigList(LongIterator i)
Creates a new big-array big list and fills it with the elements returned by a type-specific iterator.. |
Method Summary | |
---|---|
boolean |
add(long k)
|
void |
add(long index,
long k)
|
void |
addElements(int index,
long[][] a,
long offset,
long length)
Adds elements to this type-specific list using optimized system calls. |
void |
clear()
|
LongBigArrayBigList |
clone()
|
int |
compareTo(LongBigArrayBigList l)
Compares this big list to another big list. |
long[][] |
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(LongBigArrayBigList l)
Compares this type-specific big-array list to another one. |
void |
getElements(int from,
long[][] a,
long offset,
long length)
Copies element of this type-specific list into the given big array using optimized system calls. |
long |
getLong(long index)
|
long |
indexOf(long k)
|
boolean |
isEmpty()
Checks whether the stack is empty. |
long |
lastIndexOf(long k)
|
LongBigListIterator |
listIterator(int index)
|
boolean |
rem(long 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. |
void |
removeElements(int from,
int to)
Removes elements of this type-specific list using optimized system calls. |
long |
removeLong(long index)
|
long |
set(long index,
long 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 LongBigArrayBigList |
wrap(long[][] a)
Wraps a given big array into a big-array big list. |
static LongBigArrayBigList |
wrap(long[][] a,
long length)
Wraps a given big array into a big-array list of given size. |
Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLongBigList |
---|
add, addAll, addAll, addAll, addAll, addAll, addAll, addAll, addElements, addElements, compareTo, contains, equals, get, getElements, getLong, hashCode, indexOf, iterator, lastIndexOf, listIterator, listIterator, peek, peekLong, pop, popLong, push, push, remove, remove, removeElements, removeLong, set, set, size, size, subList, top, topLong, toString |
Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLongCollection |
---|
add, contains, containsAll, containsAll, longIterator, rem, remove, removeAll, removeAll, retainAll, retainAll, toArray, toArray, toArray, toLongArray, toLongArray |
Methods inherited from class java.lang.Object |
---|
getClass, notify, notifyAll, wait, wait, wait |
Methods inherited from interface it.unimi.dsi.fastutil.longs.LongCollection |
---|
containsAll, longIterator, removeAll, retainAll, toArray, toArray, toLongArray, toLongArray |
Methods inherited from interface java.util.Collection |
---|
add, contains, containsAll, remove, removeAll, retainAll, toArray |
Field Detail |
---|
public static final long serialVersionUID
public static final int DEFAULT_INITIAL_CAPACITY
Constructor Detail |
---|
public LongBigArrayBigList(long capacity)
capacity
- the initial capacity of the array list (may be 0).public LongBigArrayBigList()
DEFAULT_INITIAL_CAPACITY
capacity.
public LongBigArrayBigList(LongCollection c)
c
- a type-specific collection that will be used to fill the array list.public LongBigArrayBigList(LongBigList l)
l
- a type-specific list that will be used to fill the array list.public LongBigArrayBigList(long[][] 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 LongBigArrayBigList(long[][] 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 LongBigArrayBigList(Iterator<? extends Long> i)
i
- an iterator whose returned elements will fill the array list.public LongBigArrayBigList(LongIterator i)
i
- a type-specific iterator whose returned elements will fill the array list.Method Detail |
---|
public long[][] elements()
public static LongBigArrayBigList wrap(long[][] a, long length)
a
- a big array to wrap.length
- the length of the resulting big-array list.
public static LongBigArrayBigList wrap(long[][] 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, long k)
add
in interface LongBigList
add
in class AbstractLongBigList
List.add(int,Object)
public boolean add(long k)
add
in interface LongCollection
add
in class AbstractLongBigList
Collection.add(Object)
public long getLong(long index)
getLong
in interface LongBigList
BigList.get(long)
public long indexOf(long k)
indexOf
in interface LongBigList
indexOf
in class AbstractLongBigList
BigList.indexOf(Object)
public long lastIndexOf(long k)
lastIndexOf
in interface LongBigList
lastIndexOf
in class AbstractLongBigList
BigList.lastIndexOf(Object)
public long removeLong(long index)
removeLong
in interface LongBigList
removeLong
in class AbstractLongBigList
BigList.remove(long)
public boolean rem(long k)
LongCollection
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 LongCollection
rem
in class AbstractLongBigList
Collection.remove(Object)
public long set(long index, long k)
set
in interface LongBigList
set
in class AbstractLongBigList
BigList.set(long,Object)
public void clear()
clear
in interface Collection<Long>
clear
in class AbstractCollection<Long>
public long size64()
Size64
size64
in interface 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<Long>
size
in class AbstractLongBigList
size
- the new size.public boolean isEmpty()
Stack
isEmpty
in interface Stack<Long>
isEmpty
in interface Collection<Long>
isEmpty
in class AbstractLongCollection
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, long[][] 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, long[][] 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 LongBigListIterator listIterator(int index)
listIterator
in class AbstractLongBigList
public LongBigArrayBigList clone()
clone
in class Object
public boolean equals(LongBigArrayBigList 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(LongBigArrayBigList l)
This method exists only for sake of efficiency. The implementation inherited from the abstract implementation would already work.
l
- a big list.
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |