- add
bool add(E e)
- addFirst
void addFirst(E e)
- addLast
void addLast(E e)
- contains
bool contains(E o)
Undocumented in source. Be warned that the author may not have intended to support it.
- element
E element()
Retrieves, but does not remove, the head of the queue represented by
this deque. This method differs from {@link #peek peek} only in that
itempty.
- getFirst
E getFirst()
Undocumented in source. Be warned that the author may not have intended to support it.
- getLast
E getLast()
Undocumented in source. Be warned that the author may not have intended to support it.
- offer
bool offer(E e)
- offer
bool offer(E e, Duration timeout)
Links the provided element as the last in the queue, waiting up to the
specified time to do so if the queue is full.
<p>
This method is equivalent to {@link #offerLast(Object, long, TimeUnit)}
- offerFirst
bool offerFirst(E e)
Undocumented in source. Be warned that the author may not have intended to support it.
- offerLast
bool offerLast(E e)
Undocumented in source. Be warned that the author may not have intended to support it.
- offerLast
bool offerLast(E e, Duration timeout)
Undocumented in source. Be warned that the author may not have intended to support it.
- opEquals
bool opEquals(IObject o)
Undocumented in source. Be warned that the author may not have intended to support it.
- opEquals
bool opEquals(Object o)
Undocumented in source. Be warned that the author may not have intended to support it.
- peek
E peek()
Undocumented in source. Be warned that the author may not have intended to support it.
- peekFirst
E peekFirst()
Undocumented in source. Be warned that the author may not have intended to support it.
- peekLast
E peekLast()
Undocumented in source. Be warned that the author may not have intended to support it.
- poll
E poll()
Undocumented in source. Be warned that the author may not have intended to support it.
- poll
E poll(Duration timeout)
Unlinks the first element in the queue, waiting up to the specified time
to do so if the queue is empty.
- pollFirst
E pollFirst()
Undocumented in source. Be warned that the author may not have intended to support it.
- pollFirst
E pollFirst(Duration timeout)
Undocumented in source. Be warned that the author may not have intended to support it.
- pollLast
E pollLast()
Undocumented in source. Be warned that the author may not have intended to support it.
- pop
E pop()
- push
void push(E e)
- put
void put(E e)
Links the provided element as the last in the queue, waiting until there
is space to do so if the queue is full.
- putLast
void putLast(E e)
Undocumented in source. Be warned that the author may not have intended to support it.
- remove
E remove()
Retrieves and removes the head of the queue represented by this deque.
This method differs from {@link #poll poll} only in that it throws an
exception if this deque is empty.
- remove
bool remove(E o)
Removes the first occurrence of the specified element from this deque.
If the deque does not contain the element, it is unchanged.
More formally, removes the first element {@code e} such that
{@code o == e} (if such an element exists).
Returns {@code true} if this deque contained the specified element
(or equivalently, if this deque changed as a result of the call).
- removeFirst
E removeFirst()
- removeFirstOccurrence
bool removeFirstOccurrence(E o)
Undocumented in source. Be warned that the author may not have intended to support it.
- removeLast
E removeLast()
- take
E take()
Unlinks the first element in the queue, waiting until there is an element
to unlink if the queue is empty.
- takeFirst
E takeFirst()
Undocumented in source. Be warned that the author may not have intended to support it.
- toHash
size_t toHash()
Undocumented in source. Be warned that the author may not have intended to support it.
- toString
string toString()
Undocumented in source. Be warned that the author may not have intended to support it.