|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.objects.AbstractObjectCollection
it.unimi.dsi.fastutil.objects.AbstractObjectList
it.unimi.dsi.fastutil.objects.ObjectArrayList
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 FormNested Class Summary |
Nested classes inherited from class it.unimi.dsi.fastutil.objects.AbstractObjectList |
AbstractObjectList.ObjectSubList |
Field Summary | |
static int |
DEFAULT_INITIAL_CAPACITY
The initial default capacity of an array list. |
static long |
serialVersionUID
|
Constructor Summary | |
ObjectArrayList()
Creates a new array list with DEFAULT_INITIAL_CAPACITY capacity. |
|
ObjectArrayList(Collection c)
Creates a new array list and fills it with a given collection. |
|
ObjectArrayList(int capacity)
Creates a new array list with given capacity. |
|
ObjectArrayList(Iterator i)
Creates a new array list and fills it with the elements returned by an iterator.. |
|
ObjectArrayList(Object[] a)
Creates a new array list and fills it with the elements of a given array. |
|
ObjectArrayList(Object[] a,
int offset,
int length)
Creates a new array list and fills it with the elements of a given array. |
|
ObjectArrayList(ObjectCollection c)
Creates a new array list and fills it with a given type-specific collection. |
|
ObjectArrayList(ObjectIterator i)
Creates a new array list and fills it with the elements returned by a type-specific iterator.. |
|
ObjectArrayList(ObjectList l)
Creates a new array list and fills it with a given type-specific list. |
Method Summary | |
void |
add(int index,
Object k)
|
boolean |
add(Object k)
|
boolean |
addAll(int index,
ObjectCollection c)
Delegates to a more generic method. |
boolean |
addAll(int index,
ObjectList l)
Delegates to a more generic method. |
boolean |
addAll(ObjectList l)
Delegates to a more generic method. |
void |
addElements(int index,
Object[] a,
int offset,
int length)
Adds elements to this type-specific list using optimized system calls. |
void |
clear()
|
Object |
clone()
|
int |
compareTo(ObjectArrayList l)
|
Object[] |
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(ObjectArrayList l)
Compares this type-specific array list to another one. |
Object |
get(int index)
|
void |
getElements(int from,
Object[] a,
int offset,
int length)
Copies element of this type-specific list into the given array using optimized system calls. |
int |
indexOf(Object k)
|
boolean |
isEmpty()
Checks whether the stack is empty. |
int |
lastIndexOf(Object k)
|
ObjectListIterator |
objectListIterator(int index)
Returns a type-specific list iterator on the list starting at a given index. |
boolean |
rem(Object k)
|
Object |
remove(int index)
|
void |
removeElements(int from,
int to)
Removes elements of this type-specific list using optimized system calls. |
Object |
set(int index,
Object k)
|
int |
size()
|
void |
size(int size)
Sets the size of this list. |
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 ObjectArrayList |
wrap(Object[] a)
Wraps a given array into an array list. |
static ObjectArrayList |
wrap(Object[] a,
int length)
Wraps a given array into an array list of given size. |
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObjectList |
addAll, addAll, addAll, addElements, compareTo, contains, equals, hashCode, listIterator, listIterator, objectIterator, objectListIterator, objectSubList, peek, pop, push, subList, top, toString |
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObjectCollection |
containsAll, iterator, remove, removeAll, retainAll, toArray, toArray |
Methods inherited from class java.lang.Object |
getClass, notify, notifyAll, wait, wait, wait |
Methods inherited from interface java.util.List |
containsAll, iterator, remove, removeAll, retainAll, toArray, toArray |
Field Detail |
public static final int DEFAULT_INITIAL_CAPACITY
public static final long serialVersionUID
Constructor Detail |
public ObjectArrayList(int capacity)
capacity
- the initial capacity of the array list (may be 0).public ObjectArrayList()
DEFAULT_INITIAL_CAPACITY
capacity.
public ObjectArrayList(Collection c)
c
- a collection that will be used to fill the array list.public ObjectArrayList(ObjectCollection c)
c
- a type-specific collection that will be used to fill the array list.public ObjectArrayList(ObjectList l)
l
- a type-specific list that will be used to fill the array list.public ObjectArrayList(Object[] a)
a
- an array whose elements will be used to fill the array list.public ObjectArrayList(Object[] 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 ObjectArrayList(Iterator i)
i
- an iterator whose returned elements will fill the array list.public ObjectArrayList(ObjectIterator i)
i
- a type-specific iterator whose returned elements will fill the array list.Method Detail |
public Object[] elements()
public static ObjectArrayList wrap(Object[] a, int length)
a
- an array to wrap.length
- the length of the resulting array list.
public static ObjectArrayList wrap(Object[] 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, Object k)
add
in interface List
add
in class AbstractObjectList
public boolean add(Object k)
add
in interface List
add
in class AbstractObjectList
public boolean addAll(int index, ObjectCollection c)
AbstractObjectList
addAll
in class AbstractObjectList
public boolean addAll(int index, ObjectList l)
AbstractObjectList
addAll
in class AbstractObjectList
public boolean addAll(ObjectList l)
AbstractObjectList
addAll
in class AbstractObjectList
public Object get(int index)
get
in interface List
public int indexOf(Object k)
indexOf
in interface List
indexOf
in class AbstractObjectList
public int lastIndexOf(Object k)
lastIndexOf
in interface List
lastIndexOf
in class AbstractObjectList
public Object remove(int index)
remove
in interface List
remove
in class AbstractObjectList
public boolean rem(Object k)
rem
in class AbstractObjectList
public Object set(int index, Object k)
set
in interface List
set
in class AbstractObjectList
public void clear()
clear
in interface List
clear
in class AbstractObjectCollection
public int size()
size
in interface List
public void size(int size)
ObjectList
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 ObjectList
size
in class AbstractObjectList
public boolean isEmpty()
Stack
isEmpty
in interface List
isEmpty
in class AbstractObjectCollection
public void trim()
ArrayList.trimToSize()
public void trim(int n)
n
, this method does nothing. Otherwise, it trims the
array length to the maximum between n
and size()
.
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, Object[] a, int offset, int length)
getElements
in interface ObjectList
getElements
in class AbstractObjectList
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 ObjectList
removeElements
in class AbstractObjectList
from
- the start index (inclusive).to
- the end index (exclusive).public void addElements(int index, Object[] a, int offset, int length)
addElements
in interface ObjectList
addElements
in class AbstractObjectList
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 ObjectListIterator objectListIterator(int index)
ObjectList
The iterator returned by the List.listIterator()
method and by this
method are identical; however, using this method you can save a type casting.
objectListIterator
in interface ObjectList
objectListIterator
in class AbstractObjectList
public Object clone()
public boolean equals(ObjectArrayList l)
This method exists only for sake of efficiency. The implementation inherited from the abstract implementation would already work.
l
- a type-specific array list.
public int compareTo(ObjectArrayList l)
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |