|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.ints.AbstractIntCollection
it.unimi.dsi.fastutil.ints.AbstractIntList
it.unimi.dsi.fastutil.ints.IntArrayList
A type-specific array-based list; provides some additional methods that use polymorphism to reduce type juggling.
This class implements a lightweight, fast, open, optimized,
reuse-oriented version of array-based lists. Instances of this class
represent a list with an 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 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 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 FormField Summary | |
static int |
DEFAULT_INITIAL_CAPACITY
The initial default capacity of an array list. |
static long |
serialVersionUID
|
Constructor Summary | |
IntArrayList()
Creates a new array list with DEFAULT_INITIAL_CAPACITY capacity. |
|
IntArrayList(Collection c)
Creates a new array list and fills it with a given collection. |
|
IntArrayList(int capacity)
Creates a new array list with given capacity. |
|
IntArrayList(int[] a)
Creates a new array list and fills it with the elements of a given array. |
|
IntArrayList(int[] a,
int offset,
int length)
Creates a new array list and fills it with the elements of a given array. |
|
IntArrayList(IntCollection c)
Creates a new array list and fills it with a given type-specific collection. |
|
IntArrayList(IntIterator i)
Creates a new array list and fills it with the elements returned by a type-specific iterator.. |
|
IntArrayList(IntList l)
Creates a new array list and fills it with a given type-specific list. |
|
IntArrayList(Iterator i)
Creates a new array list and fills it with the elements returned by an iterator.. |
Method Summary | |
boolean |
add(int k)
|
void |
add(int index,
int k)
|
boolean |
addAll(int index,
IntCollection c)
Delegates to a more generic method. |
boolean |
addAll(int index,
IntList l)
Delegates to a more generic method. |
boolean |
addAll(IntList l)
Delegates to a more generic method. |
void |
addElements(int index,
int[] a,
int offset,
int length)
Adds elements to this type-specific list using optimized system calls. |
void |
clear()
|
Object |
clone()
|
int |
compareTo(IntArrayList l)
|
int[] |
elements()
Returns the backing array of this list. |
void |
ensureCapacity(int capacity)
Ensures that this array list can contain the given number of entries without resizing. |
boolean |
equals(IntArrayList l)
|
void |
getElements(int from,
int[] a,
int offset,
int length)
Copies element of this type-specific list into the given array using optimized system calls. |
int |
getInt(int index)
|
int |
indexOf(int k)
|
IntListIterator |
intListIterator(int index)
Returns a type-specific list iterator on the list starting at a given index. |
boolean |
isEmpty()
Checks whether the stack is empty. |
int |
lastIndexOf(int k)
|
boolean |
rem(int 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. |
int |
removeInt(int index)
|
int |
set(int index,
int k)
|
int |
size()
|
void |
size(int size)
Sets the size of this list. |
int[] |
toIntArray(int[] a)
Builds a primitive type array containing the items of this collection. |
void |
trim()
Trims this array list so that the capacity is equal to the size. |
void |
trim(int n)
Trims the backing array if it is too large. |
static IntArrayList |
wrap(int[] a)
Wraps a given array into an array list. |
static IntArrayList |
wrap(int[] a,
int length)
Wraps a given array into an array list of given size. |
Methods inherited from class it.unimi.dsi.fastutil.ints.AbstractIntList |
add, addAll, addAll, addAll, addElements, compareTo, contains, equals, get, hashCode, indexOf, intIterator, intListIterator, intSubList, lastIndexOf, listIterator, listIterator, peek, peekInt, pop, popInt, push, push, remove, set, subList, top, topInt, toString |
Methods inherited from class it.unimi.dsi.fastutil.ints.AbstractIntCollection |
add, contains, containsAll, containsAll, iterator, rem, remove, removeAll, removeAll, retainAll, retainAll, toArray, toArray, toArray, toIntArray |
Methods inherited from class java.lang.Object |
getClass, notify, notifyAll, wait, wait, wait |
Methods inherited from interface java.util.List |
add, contains, containsAll, iterator, remove, removeAll, retainAll, toArray, toArray |
Methods inherited from interface it.unimi.dsi.fastutil.ints.IntCollection |
containsAll, removeAll, retainAll, toArray, toIntArray |
Field Detail |
public static final int DEFAULT_INITIAL_CAPACITY
public static final long serialVersionUID
Constructor Detail |
public IntArrayList(int capacity)
capacity
- the initial capacity of the array list (may be 0).public IntArrayList()
DEFAULT_INITIAL_CAPACITY
capacity.
public IntArrayList(Collection c)
c
- a collection that will be used to fill the array list.public IntArrayList(IntCollection c)
c
- a type-specific collection that will be used to fill the array list.public IntArrayList(IntList l)
l
- a type-specific list that will be used to fill the array list.public IntArrayList(int[] a)
a
- an array whose elements will be used to fill the array list.public IntArrayList(int[] a, int offset, int length)
a
- an 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 IntArrayList(Iterator i)
i
- an iterator whose returned elements will fill the array list.public IntArrayList(IntIterator i)
i
- a type-specific iterator whose returned elements will fill the array list.Method Detail |
public int[] elements()
public static IntArrayList wrap(int[] a, int length)
a
- an array to wrap.length
- the length of the resulting array list.
public static IntArrayList wrap(int[] a)
a
- an array to wrap.
public void ensureCapacity(int capacity)
capacity
- the new minimum capacity for this array list.public void add(int index, int k)
add
in interface IntList
add
in class AbstractIntList
public boolean add(int k)
add
in interface IntCollection
add
in class AbstractIntCollection
public boolean addAll(int index, IntCollection c)
AbstractIntList
addAll
in interface IntList
addAll
in class AbstractIntList
public boolean addAll(int index, IntList l)
AbstractIntList
addAll
in interface IntList
addAll
in class AbstractIntList
public boolean addAll(IntList l)
AbstractIntList
addAll
in interface IntList
addAll
in class AbstractIntList
public int getInt(int index)
getInt
in interface IntList
List.get(int)
public int indexOf(int k)
indexOf
in interface IntList
indexOf
in class AbstractIntList
public int lastIndexOf(int k)
lastIndexOf
in interface IntList
lastIndexOf
in class AbstractIntList
public int removeInt(int index)
removeInt
in interface IntList
removeInt
in class AbstractIntList
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 AbstractIntList
public int set(int index, int k)
set
in interface IntList
set
in class AbstractIntList
public void clear()
clear
in interface List
clear
in class AbstractIntCollection
public int size()
size
in interface List
public void size(int size)
IntList
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 IntList
size
in class AbstractIntList
public boolean isEmpty()
Stack
isEmpty
in interface List
isEmpty
in class AbstractIntCollection
public void trim()
ArrayList.trimToSize()
public void trim(int n)
n
, this method does nothing. Otherwise, it trims the
array length to n
.
This method is useful when reusing lists. Clearing a list leaves the array length untouched. If you are reusing a list many times, you can call this method with a typical size to avoid keeping around a very large array just because of a few large transient lists.
n
- the threshold for the trimming.public void getElements(int from, int[] a, int offset, int length)
getElements
in interface IntList
getElements
in class AbstractIntList
from
- the start index (inclusive).a
- the destination 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)
removeElements
in interface IntList
removeElements
in class AbstractIntList
from
- the start index (inclusive).to
- the end index (exclusive).public void addElements(int index, int[] a, int offset, int length)
addElements
in interface IntList
addElements
in class AbstractIntList
index
- the index at which to add elements.a
- the array containing the elements.offset
- the offset of the first element to add.length
- the number of elements to add.public int[] toIntArray(int[] a)
IntCollection
toIntArray
in interface IntCollection
toIntArray
in class AbstractIntCollection
public IntListIterator intListIterator(int index)
IntList
The iterator returned by the List.listIterator()
method and by this
method are identical; however, using this method you can save a type casting.
intListIterator
in interface IntList
List.listIterator(int)
public Object clone()
public boolean equals(IntArrayList l)
public int compareTo(IntArrayList l)
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |