LongLinkedList (HPPC-RT v0.7.5 API Documentation)

java.lang.Object
- com.carrotsearch.hppcrt.AbstractLongCollection
- - com.carrotsearch.hppcrt.lists.LongLinkedList

All Implemented Interfaces:

LongCollection, LongContainer, LongDeque, LongIndexedContainer, java.lang.Cloneable, java.lang.Iterable<LongCursor>, java.util.RandomAccess
```
@Generated(date="2017-07-11T19:16:26+0200",
           value="KTypeLinkedList.java")
public class LongLinkedList
extends AbstractLongCollection
implements LongIndexedContainer, LongDeque, java.lang.Cloneable
```
An double-linked list of longs. This is an hybrid of LongDeque and LongIndexedContainer, with the ability to push or remove values from either head or tail, in constant time. The drawback is the double-linked list ones, i.e insert(index), remove(index) are O(N) since they must traverse the collection to reach the index. In addition, elements could by pushed or removed from the middle of the list without moving big amounts of memory, contrary to LongArrayLists. Like LongDeques, the double-linked list can also be iterated in reverse. Plus, the Iterator or reversed-iterator supports powerful methods to modify/delete/set the neighbors, in replacement of the error-prone java.util.Iterator ones. A compact representation is used to store and manipulate all elements, without creating Objects for links. Reallocations are governed by a ArraySizingStrategy and may be expensive if they move around really large chunks of memory.
Important note: NEVER USE java.util.Iterator methods ! They are here only for enhanced-loop syntax, and using them directly will only lead to unpredictable results. Use the specialized methods of LongLinkedList.ValueIterator or LongLinkedList.DescendingValueIterator instead.

Nested Class Summary

Nested Classes
Modifier and Type	Class and Description
`class`	`LongLinkedList.DescendingValueIterator` A specialized iterator implementation for `descendingIterator()`s.
`class`	`LongLinkedList.ValueIterator` A specialized iterator implementation for `iterator()`s.

Field Summary

Fields
Modifier and Type	Field and Description
`protected long[]`	`beforeAfterPointers` Represent the before / after nodes for each element of the buffer, such as buffer[i] nodes are beforeAfterPointers[i] where the 32 highest bits represent the unsigned before index in buffer : (beforeAfterPointers[i] & 0xFFFFFFFF00000000) >> 32 the 32 lowest bits represent the unsigned after index in buffer : (beforeAfterPointers[i] & 0x00000000FFFFFFFF)
`long[]`	`buffer` Internal array for storing the list.
`protected IteratorPool<LongCursor,LongLinkedList.DescendingValueIterator>`	`descendingValueIteratorPool` internal pool of DescendingValueIterator (must be created in constructor)
`protected int`	`elementsCount` Current number of elements stored in `buffer`.
`protected static int`	`HEAD_POSITION` Respective positions of head and tail elements of the list, as a position in buffer, such as after head is the actual first element of the list, before tail is the actual last element of the list.
`protected ArraySizingStrategy`	`resizer` Buffer resizing strategy.
`protected static int`	`TAIL_POSITION`
`protected IteratorPool<LongCursor,LongLinkedList.ValueIterator>`	`valueIteratorPool` internal pool of ValueIterator (must be created in constructor)

Fields inherited from class com.carrotsearch.hppcrt.AbstractLongCollection
containsNegateTestPredicate, containsTestPredicate, negatePredicate, testContainer, testPredicate

Constructor Summary

Constructors
Constructor and Description
`LongLinkedList()` Default constructor: Create with default sizing strategy and initial capacity for storing `Containers.DEFAULT_EXPECTED_ELEMENTS` elements.
`LongLinkedList(int initialCapacity)` Create with default sizing strategy and the given initial capacity.
`LongLinkedList(int initialCapacity, ArraySizingStrategy resizer)` Create with a custom buffer resizing strategy.
`LongLinkedList(LongContainer container)` Creates a new list from elements of another container.

Method Summary

All Methods Static Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`void`	`add(long... elements)` Vararg-signature method for adding elements at the end of the list.
`void`	`add(long e1)` Adds an element to the end of this container (the last index is incremented by one).
`void`	`add(long[] elements, int start, int length)` Add all elements from a range of given array to the list, equivalent to addLast()
`void`	`add(long e1, long e2)` Appends two elements at the end of the list.
`int`	`addAll(java.lang.Iterable<? extends LongCursor> iterable)` Adds all elements from another iterable, equivalent to addLast()
`int`	`addAll(LongContainer container)` Adds all elements from another container, equivalent to addLast()
`int`	`addFirst(java.lang.Iterable<? extends LongCursor> iterable)` Inserts all elements from the given iterable to the front of this list.
`void`	`addFirst(long... elements)` Vararg-signature method for adding elements at the front of this deque.
`void`	`addFirst(long e1)` Inserts the specified element at the front of this deque.
`int`	`addFirst(LongContainer container)` Inserts all elements from the given container to the front of this list.
`int`	`addLast(java.lang.Iterable<? extends LongCursor> iterable)` Inserts all elements from the given iterable to the end of this list.
`void`	`addLast(long... elements)` Add all elements (var-args signature) to the list, equivalent of add(final long... elements)
`void`	`addLast(long e1)` Inserts the specified element at the end of this deque.
`void`	`addLast(long[] elements, int start, int length)` Add all elements from a range of given array to the list.
`int`	`addLast(LongContainer container)` Inserts all elements from the given container to the end of this list.
`int`	`capacity()` Return the maximum number of elements this container is guaranteed to hold without reallocating.
`void`	`clear()` Sets the number of stored elements to zero.
`LongLinkedList`	`clone()` Clone this object.
`boolean`	`contains(long e1)` Lookup a given element in the container.
`<T extends LongPredicate> T`	`descendingForEach(T predicate)` Applies a `predicate` to container elements as long, as the predicate returns `true`.
`<T extends LongProcedure> T`	`descendingForEach(T procedure)` Applies a `procedure` to all container elements.
`LongLinkedList.DescendingValueIterator`	`descendingIterator()` Returns an iterator over the values of this list (in tail to head order).
`protected boolean`	`ensureBufferSpace(int expectedAdditions)` Ensures the internal buffer has enough free slots to store `expectedAdditions`.
`void`	`ensureCapacity(int minCapacity)` Increases the capacity of this instance, if necessary, to ensure that it can hold at least the number of elements specified by the minimum capacity argument.
`boolean`	`equals(java.lang.Object obj)`
`<T extends LongPredicate> T`	`forEach(T predicate)` Applies a `predicate` to container elements, as long as the predicate returns `true`.
`<T extends LongProcedure> T`	`forEach(T procedure)` Applies a `procedure` to all container elements.
`<T extends LongPredicate> T`	`forEach(T predicate, int fromIndex, int toIndex)` Applies `predicate` to a slice of the container, `fromIndex`, inclusive, to `toIndex`, exclusive, or until predicate returns `false`.
`<T extends LongProcedure> T`	`forEach(T procedure, int fromIndex, int toIndex)` Applies `procedure` to a slice of the container, `fromIndex`, inclusive, to `toIndex`, exclusive.
`static LongLinkedList`	`from(long... elements)` Create a list from a variable number of arguments or an array of `long`.
`static LongLinkedList`	`from(LongContainer container)` Create a list from elements of another container.
`long`	`get(int index)`
`long`	`getFirst()` Retrieves, but does not remove, the first element of this deque.
`long`	`getLast()` Retrieves, but does not remove, the last element of this deque.
`protected int`	`gotoIndex(int index)` Traverse the list to index, return the position in buffer when reached.
`int`	`hashCode()`
`int`	`indexOf(long e1)` Returns the index of the first occurrence of the specified element in this list, or -1 if this list does not contain the element.
`void`	`insert(int index, long e1)` Inserts the specified element at the specified position in this list.
`LongLinkedList.ValueIterator`	`iterator()` The iterator is implemented as a cursor and it returns the same cursor instance on every call, to avoid boxing of primitive types.
`int`	`lastIndexOf(long e1)` Returns the index of the last occurrence of the specified element in this list, or -1 if this list does not contain the element.
`static LongLinkedList`	`newInstance()` Returns a new object of this class with no need to declare generic type (shortcut instead of using a constructor).
`static LongLinkedList`	`newInstance(int initialCapacity)` Returns a new object of this class with no need to declare generic type (shortcut instead of using a constructor).
`long`	`remove(int index)` Removes the element at the specified position in this list and returns it.
`int`	`removeAll(long e1)` Removes all occurrences of `e` from this collection.
`int`	`removeAll(LongPredicate predicate)` Removes all elements in this collection for which the given predicate returns `true`.
`long`	`removeFirst()` Retrieves and removes the first element of this deque.
`int`	`removeFirst(long e1)` Removes the first element that equals `e1`, returning its deleted position or `-1` if the element was not found.
`long`	`removeLast()` Retrieves and removes the last element of this deque.
`int`	`removeLast(long e1)` Removes the last element that equals `e1`, returning its deleted position or `-1` if the element was not found.
`void`	`removeRange(int fromIndex, int toIndex)` Removes from this list all of the elements whose index is between `fromIndex`, inclusive, and `toIndex`, exclusive.
`long`	`set(int index, long e1)` Replaces the element at the specified position in this list with the specified element.
`int`	`size()` Return the current number of elements in this container.
`void`	`sort()` In-place sort the whole list by natural ordering (smaller first)
`void`	`sort(int beginIndex, int endIndex)` In-place sort the list from [beginIndex, endIndex[ by natural ordering (smaller first) *WARNING: This method runs in O(nnlog(n)).*
`void`	`sort(int beginIndex, int endIndex, LongComparator comp)` In-place sort the list from [beginIndex, endIndex[ using a `LongComparator` * *WARNING: This method runs in O(nnlog(n)).*
`void`	`sort(LongComparator comp)` In-place sort the whole list using a `LongComparator`
`long[]`	`toArray(long[] target)` Default implementation for: Copies all elements of this container to an existing array of the same type.

Methods inherited from class com.carrotsearch.hppcrt.AbstractLongCollection
isEmpty, removeAll, retainAll, retainAll, toArray, toString

Methods inherited from class java.lang.Object
finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface com.carrotsearch.hppcrt.LongCollection
removeAll, retainAll, retainAll

Methods inherited from interface com.carrotsearch.hppcrt.LongContainer
isEmpty, toArray

Methods inherited from interface java.lang.Iterable
forEach, spliterator

- Field Detail
  - buffer
```
public long[] buffer
```
    Internal array for storing the list. The array may be larger than the current size (size()).
    Direct list iteration: iterate buffer[i] for i in [2; size()+2[, but beware, it is out of order w.r.t the real list order !
  - beforeAfterPointers
```
protected long[] beforeAfterPointers
```
    Represent the before / after nodes for each element of the buffer, such as buffer[i] nodes are beforeAfterPointers[i] where the 32 highest bits represent the unsigned before index in buffer : (beforeAfterPointers[i] & 0xFFFFFFFF00000000) >> 32 the 32 lowest bits represent the unsigned after index in buffer : (beforeAfterPointers[i] & 0x00000000FFFFFFFF)
  - HEAD_POSITION
```
protected static final int HEAD_POSITION
```
    Respective positions of head and tail elements of the list, as a position in buffer, such as after head is the actual first element of the list, before tail is the actual last element of the list. Technically, head and tail have hardcoded positions of 0 and 1, and occupy buffer[0] and buffer[1] virtually. So real buffer elements starts at index 2. In addition, they are initialized in such a way that the element "before" HEAD_POSITION is still HEAD_POSITION, and that the element "after" TAIL_POSITION is TAIL_POSITION, so that it is impossible to go out of range.
    
    See Also:
    
    Constant Field Values
  - TAIL_POSITION
```
protected static final int TAIL_POSITION
```
    See Also:
    
    Constant Field Values
  - elementsCount
```
protected int elementsCount
```
    Current number of elements stored in buffer. Beware, the real number of elements is elementsCount - 2
  - resizer
```
protected final ArraySizingStrategy resizer
```
    Buffer resizing strategy.
  - valueIteratorPool
```
protected final IteratorPool<LongCursor,LongLinkedList.ValueIterator> valueIteratorPool
```
    internal pool of ValueIterator (must be created in constructor)
  - descendingValueIteratorPool
```
protected final IteratorPool<LongCursor,LongLinkedList.DescendingValueIterator> descendingValueIteratorPool
```
    internal pool of DescendingValueIterator (must be created in constructor)
- Constructor Detail
  - LongLinkedList
```
public LongLinkedList()
```
    Default constructor: Create with default sizing strategy and initial capacity for storing Containers.DEFAULT_EXPECTED_ELEMENTS elements.
    
    See Also:
    
    BoundedProportionalArraySizingStrategy
  - LongLinkedList
```
public LongLinkedList(int initialCapacity)
```
    Create with default sizing strategy and the given initial capacity.
    
    See Also:
    
    BoundedProportionalArraySizingStrategy
  - LongLinkedList
```
public LongLinkedList(int initialCapacity,
                      ArraySizingStrategy resizer)
```
    Create with a custom buffer resizing strategy.
  - LongLinkedList
```
public LongLinkedList(LongContainer container)
```
    Creates a new list from elements of another container.
- Method Detail
  - add
```
public void add(long e1)
```
    Adds an element to the end of this container (the last index is incremented by one).
    
    Specified by:
    
    add in interface LongIndexedContainer
  - add
```
public void add(long e1,
                long e2)
```
    Appends two elements at the end of the list. To add more than two elements, use add (vararg-version) or access the buffer directly (tight loop).
  - addLast
```
public void addLast(long... elements)
```
    Add all elements (var-args signature) to the list, equivalent of add(final long... elements)
    
    Parameters:
    
    elements -
    
    See Also:
    
    add(long[])
  - addLast
```
public void addLast(long[] elements,
                    int start,
                    int length)
```
    Add all elements from a range of given array to the list.
  - add
```
public void add(long[] elements,
                int start,
                int length)
```
    Add all elements from a range of given array to the list, equivalent to addLast()
  - add
```
public void add(long... elements)
```
    Vararg-signature method for adding elements at the end of the list.
    This method is handy, but costly if used in tight loops (anonymous array passing)
  - addAll
```
public int addAll(LongContainer container)
```
    Adds all elements from another container, equivalent to addLast()
  - addAll
```
public int addAll(java.lang.Iterable<? extends LongCursor> iterable)
```
    Adds all elements from another iterable, equivalent to addLast()
  - insert
```
public void insert(int index,
                   long e1)
```
    Inserts the specified element at the specified position in this list.
    
    Specified by:
    
    insert in interface LongIndexedContainer
    
    Parameters:
    
    index - The index at which the element should be inserted, shifting any existing and subsequent elements to the right. Precondition : index must be valid !
  - get
```
public long get(int index)
```
    Specified by:
    
    get in interface LongIndexedContainer
    
    Returns:
    
    Returns the element at index index from the list. Precondition : index must be valid !
  - set
```
public long set(int index,
                long e1)
```
    Replaces the element at the specified position in this list with the specified element. Precondition : index must be valid !
    
    Specified by:
    
    set in interface LongIndexedContainer
    
    Returns:
    
    Returns the previous value in the list.
  - remove
```
public long remove(int index)
```
    Removes the element at the specified position in this list and returns it. Precondition : index must be valid !
    Careful. Do not confuse this method with the overridden signature in Java Collections (List.remove(Object)). Use: LongCollection.removeAll(long), LongIndexedContainer.removeFirst(long) or LongIndexedContainer.removeLast(long) depending on the actual need.
    
    Specified by:
    
    remove in interface LongIndexedContainer
  - removeRange
```
public void removeRange(int fromIndex,
                        int toIndex)
```
    Removes from this list all of the elements whose index is between fromIndex, inclusive, and toIndex, exclusive.
    
    Specified by:
    
    removeRange in interface LongIndexedContainer
  - removeFirst
```
public int removeFirst(long e1)
```
    Removes the first element that equals e1, returning its deleted position or -1 if the element was not found.
    
    Specified by:
    
    removeFirst in interface LongDeque
    
    Specified by:
    
    removeFirst in interface LongIndexedContainer
  - removeLast
```
public int removeLast(long e1)
```
    Removes the last element that equals e1, returning its deleted position or -1 if the element was not found.
    
    Specified by:
    
    removeLast in interface LongDeque
    
    Specified by:
    
    removeLast in interface LongIndexedContainer
  - removeAll
```
public int removeAll(long e1)
```
    Removes all occurrences of e from this collection.
    
    Specified by:
    
    removeAll in interface LongCollection
    
    Parameters:
    
    e1 - Element to be removed from this collection, if present.
    
    Returns:
    
    The number of removed elements as a result of this call.
  - contains
```
public boolean contains(long e1)
```
    Lookup a given element in the container. This operation has no speed guarantees (may be linear with respect to the size of this container).
    
    Specified by:
    
    contains in interface LongContainer
    
    Returns:
    
    Returns true if this container has an element equal to e.
  - indexOf
```
public int indexOf(long e1)
```
    Returns the index of the first occurrence of the specified element in this list, or -1 if this list does not contain the element.
    
    Specified by:
    
    indexOf in interface LongIndexedContainer
  - lastIndexOf
```
public int lastIndexOf(long e1)
```
    Returns the index of the last occurrence of the specified element in this list, or -1 if this list does not contain the element.
    
    Specified by:
    
    lastIndexOf in interface LongIndexedContainer
  - ensureCapacity
```
public void ensureCapacity(int minCapacity)
```
    Increases the capacity of this instance, if necessary, to ensure that it can hold at least the number of elements specified by the minimum capacity argument.
  - ensureBufferSpace
```
protected boolean ensureBufferSpace(int expectedAdditions)
```
    Ensures the internal buffer has enough free slots to store expectedAdditions. Increases internal buffer size if needed.
    
    Returns:
    
    true if a reallocation occurs
  - size
```
public int size()
```
    Return the current number of elements in this container. The time for calculating the container's size may take O(n) time, although implementing classes should try to maintain the current size and return in constant time.
    
    Specified by:
    
    size in interface LongContainer
  - capacity
```
public int capacity()
```
    Return the maximum number of elements this container is guaranteed to hold without reallocating. The time for calculating the container's capacity may take O(n) time.
    
    Specified by:
    
    capacity in interface LongContainer
  - clear
```
public void clear()
```
    Sets the number of stored elements to zero.
    
    Specified by:
    
    clear in interface LongCollection
  - toArray
```
public long[] toArray(long[] target)
```
    Default implementation for: Copies all elements of this container to an existing array of the same type.
    
    Specified by:
    
    toArray in interface LongContainer
    
    Overrides:
    
    toArray in class AbstractLongCollection
    
    Parameters:
    
    target - The target array must be large enough to hold all elements, i.e >= LongContainer.size().
    
    Returns:
    
    Returns the target argument for chaining.
  - clone
```
public LongLinkedList clone()
```
    Clone this object. The returned clone will use the same resizing strategy.
    
    Overrides:
    
    clone in class java.lang.Object
  - hashCode
```
public int hashCode()
```
    Overrides:
    
    hashCode in class java.lang.Object
  - equals
```
public boolean equals(java.lang.Object obj)
```
    Overrides:
    
    equals in class java.lang.Object
  - gotoIndex
```
protected int gotoIndex(int index)
```
    Traverse the list to index, return the position in buffer when reached. This is a O(n) operation !.
    
    Parameters:
    
    index -
    
    Returns:
  - iterator
```
public LongLinkedList.ValueIterator iterator()
```
    The iterator is implemented as a cursor and it returns the same cursor instance on every call, to avoid boxing of primitive types. To read the current value, or index as in get(int), use the cursor's public fields. The iterator points to "head", such as ValueIterator.gotoNext() is the first element of the list. Enhanced-loop syntax:
```
 for (LongCursor c : container) {
 System.out.println("index=" + c.index + " value=" + c.value);
 }
 
```
    Or :
```
 ValueIterator it = list.iterator();
 while (it.hasAfter())
 {
 final LongCursor c = it.gotoNext().cursor;
 System.out.println("buffer index="
 + c.index + " value=" + c.value);
 }
 
 // release the iterator at the end !
 it.release()
 
```
    Specified by:
    
    iterator in interface LongContainer
    
    Specified by:
    
    iterator in interface java.lang.Iterable<LongCursor>
    
    See Also:
    
    LongLinkedList.ValueIterator
  - descendingIterator
```
public LongLinkedList.DescendingValueIterator descendingIterator()
```
    Returns an iterator over the values of this list (in tail to head order). The iterator points to the "head", such as DescendingValueIterator.gotoNext() is the last element of the list, since it is a "reversed" iteration. The iterator is implemented as a cursor and it returns the same cursor instance on every call to avoid boxing of primitive types. To read the current value, or index as in get(int), use the cursor's public fields. An example is shown below. *
```
 DescendingValueIterator it = list.descendingIterator();
 while (it.hasAfter())
 {
 final LongCursor c = it.gotoNext().cursor;
 System.out.println("buffer index="
 + c.index + " value=" + c.value);
 }
 
 // release the iterator at the end !
 it.release()
 
```
    Specified by:
    
    descendingIterator in interface LongDeque
    
    Returns:
    
    An iterator over elements in this deque in tail-to-head order.
    
    See Also:
    
    LongLinkedList.DescendingValueIterator
  - forEach
```
public <T extends LongProcedure> T forEach(T procedure)
```
    Applies a procedure to all container elements. Returns the argument (any subclass of LongProcedure. This lets the caller to call methods of the argument by chaining the call (even if the argument is an anonymous type) to retrieve computed values, for example (IntContainer):
```
 int count = container.forEach(new IntProcedure() {
      int count; // this is a field declaration in an anonymous class.
      public void apply(int value) { count++; }}).count;
 
```
    Specified by:
    
    forEach in interface LongContainer
  - forEach
```
public <T extends LongProcedure> T forEach(T procedure,
                                           int fromIndex,
                                           int toIndex)
```
    Applies procedure to a slice of the container, fromIndex, inclusive, to toIndex, exclusive.
    
    Specified by:
    
    forEach in interface LongIndexedContainer
  - forEach
```
public <T extends LongPredicate> T forEach(T predicate)
```
    Applies a predicate to container elements, as long as the predicate returns true. The iteration is interrupted otherwise.
    
    Specified by:
    
    forEach in interface LongContainer
  - forEach
```
public <T extends LongPredicate> T forEach(T predicate,
                                           int fromIndex,
                                           int toIndex)
```
    Applies predicate to a slice of the container, fromIndex, inclusive, to toIndex, exclusive, or until predicate returns false.
    
    Specified by:
    
    forEach in interface LongIndexedContainer
  - descendingForEach
```
public <T extends LongProcedure> T descendingForEach(T procedure)
```
    Applies a procedure to all container elements.
    
    Specified by:
    
    descendingForEach in interface LongDeque
  - descendingForEach
```
public <T extends LongPredicate> T descendingForEach(T predicate)
```
    Applies a predicate to container elements as long, as the predicate returns true. The iteration is interrupted otherwise.
    
    Specified by:
    
    descendingForEach in interface LongDeque
  - removeAll
```
public int removeAll(LongPredicate predicate)
```
    Removes all elements in this collection for which the given predicate returns true.
    
    Specified by:
    
    removeAll in interface LongCollection
    
    Returns:
    
    Returns the number of removed elements.
  - newInstance
```
public static LongLinkedList newInstance()
```
    Returns a new object of this class with no need to declare generic type (shortcut instead of using a constructor).
  - newInstance
```
public static LongLinkedList newInstance(int initialCapacity)
```
    Returns a new object of this class with no need to declare generic type (shortcut instead of using a constructor).
  - from
```
public static LongLinkedList from(long... elements)
```
    Create a list from a variable number of arguments or an array of long. The elements are copied from the argument to the internal buffer.
  - from
```
public static LongLinkedList from(LongContainer container)
```
    Create a list from elements of another container.
  - sort
```
public void sort(int beginIndex,
                 int endIndex)
```
    In-place sort the list from [beginIndex, endIndex[ by natural ordering (smaller first)
    WARNING: This method runs in O(n*n*log(n)). Consider yourself warned.
    
    Parameters:
    
    beginIndex - the start index to be sorted
    
    endIndex - the end index to be sorted (excluded)
  - sort
```
public void sort(int beginIndex,
                 int endIndex,
                 LongComparator comp)
```
    In-place sort the list from [beginIndex, endIndex[ using a LongComparator *
    WARNING: This method runs in O(n*n*log(n)). Consider yourself warned.
    
    Parameters:
    
    beginIndex - the start index to be sorted
    
    endIndex - the end index to be sorted (excluded)
  - sort
```
public void sort()
```
    In-place sort the whole list by natural ordering (smaller first)
  - sort
```
public void sort(LongComparator comp)
```
    In-place sort the whole list using a LongComparator
  - addFirst
```
public void addFirst(long e1)
```
    Description copied from interface: LongDeque
    
    Inserts the specified element at the front of this deque.
    
    Specified by:
    
    addFirst in interface LongDeque
    
    Parameters:
    
    e1 - the element to add
  - addFirst
```
public int addFirst(LongContainer container)
```
    Inserts all elements from the given container to the front of this list.
    
    Returns:
    
    Returns the number of elements actually added as a result of this call.
  - addFirst
```
public void addFirst(long... elements)
```
    Vararg-signature method for adding elements at the front of this deque.
    This method is handy, but costly if used in tight loops (anonymous array passing)
  - addFirst
```
public int addFirst(java.lang.Iterable<? extends LongCursor> iterable)
```
    Inserts all elements from the given iterable to the front of this list.
    
    Returns:
    
    Returns the number of elements actually added as a result of this call.
  - addLast
```
public void addLast(long e1)
```
    Description copied from interface: LongDeque
    
    Inserts the specified element at the end of this deque.
    
    Specified by:
    
    addLast in interface LongDeque
    
    Parameters:
    
    e1 - the element to add
  - addLast
```
public int addLast(LongContainer container)
```
    Inserts all elements from the given container to the end of this list.
    
    Returns:
    
    Returns the number of elements actually added as a result of this call.
  - addLast
```
public int addLast(java.lang.Iterable<? extends LongCursor> iterable)
```
    Inserts all elements from the given iterable to the end of this list.
    
    Returns:
    
    Returns the number of elements actually added as a result of this call.
  - removeFirst
```
public long removeFirst()
```
    Description copied from interface: LongDeque
    
    Retrieves and removes the first element of this deque. Precondition : the deque is not empty !
    
    Specified by:
    
    removeFirst in interface LongDeque
    
    Returns:
    
    the head element of this deque.
  - removeLast
```
public long removeLast()
```
    Description copied from interface: LongDeque
    
    Retrieves and removes the last element of this deque. Precondition : the deque is not empty !
    
    Specified by:
    
    removeLast in interface LongDeque
    
    Returns:
    
    the tail of this deque.
  - getFirst
```
public long getFirst()
```
    Description copied from interface: LongDeque
    
    Retrieves, but does not remove, the first element of this deque. Precondition : the deque is not empty !
    
    Specified by:
    
    getFirst in interface LongDeque
    
    Returns:
    
    the head of this deque.
  - getLast
```
public long getLast()
```
    Description copied from interface: LongDeque
    
    Retrieves, but does not remove, the last element of this deque. Precondition : the deque is not empty !
    
    Specified by:
    
    getLast in interface LongDeque
    
    Returns:
    
    the tail of this deque.

Class LongLinkedList

Nested Class Summary

Field Summary

Fields inherited from class com.carrotsearch.hppcrt.AbstractLongCollection

Constructor Summary

Method Summary

Methods inherited from class com.carrotsearch.hppcrt.AbstractLongCollection

Methods inherited from class java.lang.Object

Methods inherited from interface com.carrotsearch.hppcrt.LongCollection

Methods inherited from interface com.carrotsearch.hppcrt.LongContainer

Methods inherited from interface java.lang.Iterable

Field Detail

buffer

beforeAfterPointers

HEAD_POSITION

TAIL_POSITION

elementsCount

resizer

valueIteratorPool

descendingValueIteratorPool

Constructor Detail

LongLinkedList

LongLinkedList

LongLinkedList

LongLinkedList

Method Detail

add

add

addLast

addLast

add

add

addAll

addAll

insert

get

set

remove

removeRange

removeFirst

removeLast

removeAll

contains

indexOf

lastIndexOf

ensureCapacity

ensureBufferSpace

size

capacity

clear

toArray

clone

hashCode

equals

gotoIndex

iterator

descendingIterator

forEach

forEach

forEach

forEach

descendingForEach

descendingForEach

removeAll

newInstance

newInstance

from

from

sort

sort

sort

sort

addFirst

addFirst

addFirst

addFirst

addLast

addLast

addLast

removeFirst