public class SimpleLongArrayList extends AbstractLongList
long elements; implemented with arrays;
not efficient; just to demonstrate which methods you must override to
implement a fully functional list. First see the package summary and javadoc tree view to get the broad picture.| Constructor and Description |
|---|
SimpleLongArrayList()
Constructs an empty list.
|
SimpleLongArrayList(int initialCapacity)
Constructs an empty list with the specified initial capacity.
|
SimpleLongArrayList(long[] elements)
Constructs a list containing the specified elements.
|
| Modifier and Type | Method and Description |
|---|---|
void |
ensureCapacity(int minCapacity)
Ensures that the receiver can hold at least the specified number of
elements without needing to allocate new internal memory.
|
void |
trimToSize()
Trims the capacity of the receiver to be the receiver's current size.
|
add, addAllOfFromTo, beforeInsert, beforeInsertAllOfFromTo, binarySearch, binarySearchFromTo, clone, contains, delete, elements, elements, equals, fillFromToWith, forEach, get, indexOf, indexOfFromTo, lastIndexOf, lastIndexOfFromTo, mergeSortFromTo, mergeSortFromTo, partFromTo, quickSortFromTo, quickSortFromTo, removeAll, removeFromTo, replaceFromToWithFrom, replaceFromToWithFromTo, replaceFromWith, retainAll, reverse, set, setSizeRaw, shuffleFromTo, size, times, toList, toStringaddAllOf, beforeInsertAllOf, clear, mergeSort, quickSort, remove, setSize, shuffle, sort, sortFromToisEmptypublic SimpleLongArrayList()
public SimpleLongArrayList(long[] elements)
elements - the array to be backed by the the constructed listpublic SimpleLongArrayList(int initialCapacity)
initialCapacity - the number of elements the receiver can hold without
auto-expanding itself by allocating new internal memory.public void ensureCapacity(int minCapacity)
ensureCapacity in class AbstractLongListminCapacity - the desired minimum capacity.public void trimToSize()
trimToSize in class AbstractListJump to the Parallel Colt Homepage