com.carrotsearch.hppcrt

Interface IntDeque

All Superinterfaces:

IntCollection, IntContainer, java.lang.Iterable<IntCursor>

All Known Implementing Classes:

IntArrayDeque, IntLinkedList

@Generated(date="2017-07-11T19:16:23+0200",
           value="KTypeDeque.java")
public interface IntDeque
extends IntCollection

A double-sided queue of ints.

Method Summary

Modifier and Type	Method and Description
void	addFirst(int e1) Inserts the specified element at the front of this deque.
void	addLast(int e1) Inserts the specified element at the end of this deque.
<T extends IntPredicate> T	descendingForEach(T predicate) Applies a predicate to container elements as long, as the predicate returns true.
<T extends IntProcedure> T	descendingForEach(T procedure) Applies a procedure to all container elements.
java.util.Iterator<IntCursor>	descendingIterator()
int	getFirst() Retrieves, but does not remove, the first element of this deque.
int	getLast() Retrieves, but does not remove, the last element of this deque.
int	removeFirst() Retrieves and removes the first element of this deque.
int	removeFirst(int e1) Removes the first element that equals e1, returning its deleted position or -1 if the element was not found.
int	removeLast() Retrieves and removes the last element of this deque.
int	removeLast(int e1) Removes the last element that equals e1, returning its deleted position or -1 if the element was not found.

Methods inherited from interface com.carrotsearch.hppcrt.IntCollection

clear, removeAll, removeAll, removeAll, retainAll, retainAll

Methods inherited from interface com.carrotsearch.hppcrt.IntContainer

capacity, contains, forEach, forEach, isEmpty, iterator, size, toArray, toArray

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Method Detail

removeFirst

int removeFirst(int e1)

Removes the first element that equals e1, returning its deleted position or -1 if the element was not found.

removeLast

int removeLast(int e1)

Removes the last element that equals e1, returning its deleted position or -1 if the element was not found.

addFirst

void addFirst(int e1)

Inserts the specified element at the front of this deque.

Parameters:

e1 - the element to add

addLast

void addLast(int e1)

Inserts the specified element at the end of this deque.

Parameters:

e1 - the element to add

removeFirst

int removeFirst()

Retrieves and removes the first element of this deque. Precondition : the deque is not empty !

Returns:

the head element of this deque.

Throws:

java.lang.AssertionError - if this deque is empty and assertions are enabled.

removeLast

int removeLast()

Retrieves and removes the last element of this deque. Precondition : the deque is not empty !

Returns:

the tail of this deque.

Throws:

java.lang.AssertionError - if this deque is empty and assertions are enabled.

getFirst

int getFirst()

Retrieves, but does not remove, the first element of this deque. Precondition : the deque is not empty !

Returns:

the head of this deque.

Throws:

java.lang.AssertionError - if this deque is empty and assertions are enabled.

getLast

int getLast()

Retrieves, but does not remove, the last element of this deque. Precondition : the deque is not empty !

Returns:

the tail of this deque.

Throws:

java.lang.AssertionError - if this deque is empty and assertions are enabled.

descendingIterator

java.util.Iterator<IntCursor> descendingIterator()

Returns:

An iterator over elements in this deque in tail-to-head order.

descendingForEach

<T extends IntProcedure> T descendingForEach(T procedure)

Applies a procedure to all container elements.

descendingForEach

<T extends IntPredicate> T descendingForEach(T predicate)

Applies a predicate to container elements as long, as the predicate returns true. The iteration is interrupted otherwise.