public class FloatArrayList extends AbstractFloatList implements RandomAccess, Cloneable, Serializable
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 doubling its current length), 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 FormAbstractFloatList.FloatSubList| Modifier and Type | Field and Description |
|---|---|
static int |
DEFAULT_INITIAL_CAPACITY
The initial default capacity of an array list.
|
| Constructor and Description |
|---|
FloatArrayList()
Creates a new array list with
DEFAULT_INITIAL_CAPACITY capacity. |
FloatArrayList(Collection<? extends Float> c)
Creates a new array list and fills it with a given collection.
|
FloatArrayList(float[] a)
Creates a new array list and fills it with the elements of a given array.
|
FloatArrayList(float[] a,
int offset,
int length)
Creates a new array list and fills it with the elements of a given array.
|
FloatArrayList(FloatCollection c)
Creates a new array list and fills it with a given type-specific collection.
|
FloatArrayList(FloatIterator i)
Creates a new array list and fills it with the elements returned by a type-specific iterator..
|
FloatArrayList(FloatList l)
Creates a new array list and fills it with a given type-specific list.
|
FloatArrayList(int capacity)
Creates a new array list with given capacity.
|
FloatArrayList(Iterator<? extends Float> i)
Creates a new array list and fills it with the elements returned by an iterator..
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(float k) |
void |
add(int index,
float k) |
boolean |
addAll(int index,
FloatCollection c)
Delegates to a more generic method.
|
boolean |
addAll(int index,
FloatList l)
Delegates to a more generic method.
|
void |
addElements(int index,
float[] a,
int offset,
int length)
Adds elements to this type-specific list using optimized system calls.
|
void |
clear() |
FloatArrayList |
clone() |
int |
compareTo(FloatArrayList l)
Compares this array list to another array list.
|
float[] |
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(FloatArrayList l)
Compares this type-specific array list to another one.
|
void |
getElements(int from,
float[] a,
int offset,
int length)
Copies element of this type-specific list into the given array using optimized system calls.
|
float |
getFloat(int index) |
int |
indexOf(float k) |
boolean |
isEmpty()
Checks whether the stack is empty.
|
int |
lastIndexOf(float k) |
FloatListIterator |
listIterator(int index)
Returns a type-specific list iterator on the list starting at a given index.
|
boolean |
rem(float k)
|
void |
removeElements(int from,
int to)
Removes elements of this type-specific list using optimized system calls.
|
float |
removeFloat(int index) |
float |
set(int index,
float k) |
int |
size() |
void |
size(int size)
Sets the size of this list.
|
float[] |
toFloatArray(float[] a)
Returns 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 FloatArrayList |
wrap(float[] a)
Wraps a given array into an array list.
|
static FloatArrayList |
wrap(float[] a,
int length)
Wraps a given array into an array list of given size.
|
add, addAll, addAll, addAll, addAll, addElements, compareTo, contains, equals, floatListIterator, floatListIterator, floatSubList, get, hashCode, indexOf, iterator, lastIndexOf, listIterator, peek, peekFloat, pop, popFloat, push, push, remove, remove, set, subList, top, topFloat, toStringadd, contains, containsAll, containsAll, floatIterator, rem, removeAll, removeAll, retainAll, retainAll, toArray, toArray, toArray, toFloatArrayadd, contains, containsAll, removeAll, replaceAll, retainAll, sort, spliterator, toArray, toArraycontainsAll, floatIterator, removeAll, retainAll, toArray, toArray, toFloatArrayparallelStream, removeIf, streampublic static final int DEFAULT_INITIAL_CAPACITY
public FloatArrayList(int capacity)
capacity - the initial capacity of the array list (may be 0).public FloatArrayList()
DEFAULT_INITIAL_CAPACITY capacity.public FloatArrayList(Collection<? extends Float> c)
c - a collection that will be used to fill the array list.public FloatArrayList(FloatCollection c)
c - a type-specific collection that will be used to fill the array list.public FloatArrayList(FloatList l)
l - a type-specific list that will be used to fill the array list.public FloatArrayList(float[] a)
a - an array whose elements will be used to fill the array list.public FloatArrayList(float[] 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 FloatArrayList(Iterator<? extends Float> i)
i - an iterator whose returned elements will fill the array list.public FloatArrayList(FloatIterator i)
i - a type-specific iterator whose returned elements will fill the array list.public float[] elements()
public static FloatArrayList wrap(float[] a, int length)
a - an array to wrap.length - the length of the resulting array list.public static FloatArrayList wrap(float[] 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,
float k)
add in interface FloatListadd in class AbstractFloatListList.add(int,Object)public boolean add(float k)
add in interface FloatCollectionadd in interface FloatListadd in class AbstractFloatListCollection.add(Object)public float getFloat(int index)
getFloat in interface FloatListList.get(int)public int indexOf(float k)
indexOf in interface FloatListindexOf in class AbstractFloatListList.indexOf(Object)public int lastIndexOf(float k)
lastIndexOf in interface FloatListlastIndexOf in class AbstractFloatListList.lastIndexOf(Object)public float removeFloat(int index)
removeFloat in interface FloatListremoveFloat in class AbstractFloatListList.remove(int)public boolean rem(float k)
FloatCollectionremove(), 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 FloatCollectionrem in class AbstractFloatListCollection.remove(Object)public float set(int index,
float k)
set in interface FloatListset in class AbstractFloatListList.set(int,Object)public void clear()
clear in interface Collection<Float>clear in interface List<Float>clear in class AbstractCollection<Float>public int size()
size in interface Collection<Float>size in interface List<Float>size in class AbstractCollection<Float>public void size(int size)
FloatListIf 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 FloatListsize in class AbstractFloatListsize - the new size.public boolean isEmpty()
Stackpublic 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,
float[] a,
int offset,
int length)
getElements in interface FloatListgetElements in class AbstractFloatListfrom - 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 FloatListremoveElements in class AbstractFloatListfrom - the start index (inclusive).to - the end index (exclusive).public void addElements(int index,
float[] a,
int offset,
int length)
addElements in interface FloatListaddElements in class AbstractFloatListindex - 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 float[] toFloatArray(float[] a)
FloatCollectionNote that, contrarily to Collection.toArray(Object[]), this methods just writes all elements of this collection: no special value will be added after the last one.
toFloatArray in interface FloatCollectiontoFloatArray in class AbstractFloatCollectiona - if this array is big enough, it will be used to store this collection.Collection.toArray(Object[])public boolean addAll(int index,
FloatCollection c)
AbstractFloatListaddAll in interface FloatListaddAll in class AbstractFloatListList.add(int,Object)public boolean addAll(int index,
FloatList l)
AbstractFloatListaddAll in interface FloatListaddAll in class AbstractFloatListList.add(int,Object)public FloatListIterator listIterator(int index)
FloatListlistIterator in interface FloatListlistIterator in interface List<Float>listIterator in class AbstractFloatListList.listIterator(int)public FloatArrayList clone()
public boolean equals(FloatArrayList 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(FloatArrayList l)
This method exists only for sake of efficiency. The implementation inherited from the abstract implementation would already work.
l - an array list.