cern.colt.list
Class SimpleLongArrayList

java.lang.Object
  extended by cern.colt.PersistentObject
      extended by cern.colt.list.AbstractCollection
          extended by cern.colt.list.AbstractList
              extended by cern.colt.list.AbstractLongList
                  extended by cern.colt.list.SimpleLongArrayList
All Implemented Interfaces:
java.io.Serializable, java.lang.Cloneable

public class SimpleLongArrayList
extends AbstractLongList

Resizable list holding 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.

See Also:
Serialized Form

Field Summary
protected  long[] elements
          The array buffer into which the elements of the list are stored.
protected  int size
          The size of the list.
 
Fields inherited from class cern.colt.PersistentObject
serialVersionUID
 
Constructor Summary
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.
 
Method Summary
 void ensureCapacity(int minCapacity)
          Ensures that the receiver can hold at least the specified number of elements without needing to allocate new internal memory.
protected  long getQuick(int index)
          Returns the element at the specified position in the receiver; WARNING: Does not check preconditions.
protected  void setQuick(int index, long element)
          Replaces the element at the specified position in the receiver with the specified element; WARNING: Does not check preconditions.
 void trimToSize()
          Trims the capacity of the receiver to be the receiver's current size.
 
Methods inherited from class cern.colt.list.AbstractLongList
add, addAllOfFromTo, beforeInsert, beforeInsertAllOfFromTo, beforeInsertDummies, 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, toString
 
Methods inherited from class cern.colt.list.AbstractList
addAllOf, beforeInsertAllOf, checkRange, checkRangeFromTo, clear, mergeSort, quickSort, remove, setSize, shuffle, sort, sortFromTo
 
Methods inherited from class cern.colt.list.AbstractCollection
isEmpty
 
Methods inherited from class java.lang.Object
finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
 

Field Detail

elements

protected long[] elements
The array buffer into which the elements of the list are stored. The capacity of the list is the length of this array buffer.


size

protected int size
The size of the list.

Constructor Detail

SimpleLongArrayList

public SimpleLongArrayList()
Constructs an empty list.


SimpleLongArrayList

public SimpleLongArrayList(long[] elements)
Constructs a list containing the specified elements. The initial size and capacity of the list is the length of the array. WARNING: For efficiency reasons and to keep memory usage low, the array is not copied. So if subsequently you modify the specified array directly via the [] operator, be sure you know what you're doing.

Parameters:
elements - the array to be backed by the the constructed list

SimpleLongArrayList

public SimpleLongArrayList(int initialCapacity)
Constructs an empty list with the specified initial capacity.

Parameters:
initialCapacity - the number of elements the receiver can hold without auto-expanding itself by allocating new internal memory.
Method Detail

ensureCapacity

public void ensureCapacity(int minCapacity)
Ensures that the receiver can hold at least the specified number of elements without needing to allocate new internal memory. If necessary, allocates new internal memory and increases the capacity of the receiver.

Specified by:
ensureCapacity in class AbstractLongList
Parameters:
minCapacity - the desired minimum capacity.

getQuick

protected long getQuick(int index)
Returns the element at the specified position in the receiver; WARNING: Does not check preconditions. Provided with invalid parameters this method may return invalid elements without throwing any exception! You should only use this method when you are absolutely sure that the index is within bounds. Precondition (unchecked): index >= 0 && index < size().

Specified by:
getQuick in class AbstractLongList
Parameters:
index - index of element to return.

setQuick

protected void setQuick(int index,
                        long element)
Replaces the element at the specified position in the receiver with the specified element; WARNING: Does not check preconditions. Provided with invalid parameters this method may access invalid indexes without throwing any exception! You should only use this method when you are absolutely sure that the index is within bounds. Precondition (unchecked): index >= 0 && index < size().

Specified by:
setQuick in class AbstractLongList
Parameters:
index - index of element to replace.
element - element to be stored at the specified position.

trimToSize

public void trimToSize()
Trims the capacity of the receiver to be the receiver's current size. An application can use this operation to minimize the storage of the receiver.

Overrides:
trimToSize in class AbstractList