High Performance Primitive Collections 0.10.0 · com.carrotsearch.hppc.LongDeque

Method Summary

Modifier and Type	Method and Description
public void	addFirst(long e) Inserts the specified element at the front of this deque.
public void	addLast(long e) Inserts the specified element at the end of this deque.
public <T extends LongProcedure> T	descendingForEach(T procedure) Applies a `procedure` to all elements in tail-to-head order.
public <T extends LongPredicate> T	descendingForEach(T predicate) Applies a `predicate` to container elements as long, as the predicate returns `true`.
public Iterator<LongCursor>	Returns: An iterator over elements in this deque in tail-to-head order. descendingIterator()
public long	Returns: the head of this deque. getFirst() Retrieves the first element of this deque but does not remove it.
public long	Returns: the head of this deque. getLast() Retrieves the last element of this deque but does not remove it.
public int	Returns: The deleted element's index or `-1` if the element was not found. removeFirst(long e) Removes the first element that equals `e`.
public long	Returns: the head (first) element of this deque. removeFirst() Retrieves and removes the first element of this deque.
public int	Returns: The deleted element's index or `-1` if the element was not found. removeLast(long e) Removes the last element that equals `e`.
public long	Returns: the tail of this deque. removeLast() Retrieves and removes the last element of this deque.

Inherited from com.carrotsearch.hppc.LongCollection:: clear release removeAll removeAll removeAll retainAll retainAll

addFirst	back to summary
public void addFirst(long e) Inserts the specified element at the front of this deque.

addLast	back to summary
public void addLast(long e) Inserts the specified element at the end of this deque.

descendingForEach	back to summary
public <T extends LongProcedure> T descendingForEach(T procedure) Applies a `procedure` to all elements in tail-to-head order.

descendingForEach	back to summary
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.

descendingIterator	back to summary
public Iterator<LongCursor> descendingIterator() Returns:Iterator<LongCursor> An iterator over elements in this deque in tail-to-head order.

getFirst	back to summary
public long getFirst() Retrieves the first element of this deque but does not remove it. Returns:long the head of this deque.

getFirst

public long getFirst()

Retrieves the first element of this deque but does not remove it.

getLast	back to summary
public long getLast() Retrieves the last element of this deque but does not remove it. Returns:long the head of this deque.

getLast

public long getLast()

Retrieves the last element of this deque but does not remove it.

removeFirst back to summary

removeFirst	back to summary
public int removeFirst(long e) Removes the first element that equals `e`. Returns:int The deleted element's index or `-1` if the element was not found.

public int removeFirst(long e)

Removes the first element that equals e.

Returns:int: The deleted element's index or -1 if the element was not found.

removeFirst	back to summary
public long removeFirst() Retrieves and removes the first element of this deque. Returns:long the head (first) element of this deque.

removeFirst

public long removeFirst()

Retrieves and removes the first element of this deque.

removeLast back to summary

removeLast	back to summary
public int removeLast(long e) Removes the last element that equals `e`. Returns:int The deleted element's index or `-1` if the element was not found.

public int removeLast(long e)

Removes the last element that equals e.

Returns:int: The deleted element's index or -1 if the element was not found.

removeLast	back to summary
public long removeLast() Retrieves and removes the last element of this deque. Returns:long the tail of this deque.

removeLast

public long removeLast()

Retrieves and removes the last element of this deque.