IntCollection, IntContainer, java.lang.Iterable<IntCursor>IntArrayDeque@Generated(date="2018-05-21T12:24:05+0200", value="KTypeDeque.java") public interface IntDeque extends IntCollection
Deque| Modifier and Type | Method | Description |
|---|---|---|
void |
addFirst(int e) |
Inserts the specified element at the front of this deque.
|
void |
addLast(int e) |
Inserts the specified element at the end of this deque.
|
<T extends IntProcedure> |
descendingForEach(T procedure) |
Applies a
procedure to all elements in tail-to-head order. |
java.util.Iterator<IntCursor> |
descendingIterator() |
|
int |
getFirst() |
Retrieves the first element of this deque but does not remove it.
|
int |
getLast() |
Retrieves the last element of this deque but does not remove it.
|
int |
removeFirst() |
Retrieves and removes the first element of this deque.
|
int |
removeFirst(int e) |
Removes the first element that equals
e. |
int |
removeLast() |
Retrieves and removes the last element of this deque.
|
int |
removeLast(int e) |
Removes the last element that equals
e. |
clear, release, removeAll, removeAll, removeAll, retainAll, retainAllint removeFirst(int e)
e.-1 if the element
was not found.int removeLast(int e)
e.-1 if the element
was not found.void addFirst(int e)
void addLast(int e)
int removeFirst()
int removeLast()
int getFirst()
int getLast()
java.util.Iterator<IntCursor> descendingIterator()
<T extends IntProcedure> T descendingForEach(T procedure)
procedure to all elements in tail-to-head order.<T extends IntPredicate> T descendingForEach(T predicate)
predicate to container elements as long, as the
predicate returns true. The iteration is interrupted
otherwise.Copyright © 2018 Carrot Search s.c.. All Rights Reserved.