The methods of Java.Util.Concurrent.LinkedBlockingDeque are listed below. For a list of all members, see the LinkedBlockingDeque Members list.
See Also: Inherited members from Java.Util.AbstractQueue
AddFirst(Java.Lang.Object)Documentation for this section has not yet been entered. | ||
AddLast(Java.Lang.Object)Documentation for this section has not yet been entered. | ||
DescendingIterator()Returns an iterator over the elements in this deque in reverse sequential order. | ||
DrainTo(ICollection)Documentation for this section has not yet been entered. | ||
DrainTo(ICollection, int)Documentation for this section has not yet been entered. | ||
override | Iterator()Returns an iterator over the elements in this deque in proper sequence. | |
override | Offer(Java.Lang.Object)Documentation for this section has not yet been entered. | |
Offer(Java.Lang.Object, long, TimeUnit)Documentation for this section has not yet been entered. | ||
OfferFirst(Java.Lang.Object)Documentation for this section has not yet been entered. | ||
OfferFirst(Java.Lang.Object, long, TimeUnit)Documentation for this section has not yet been entered. | ||
OfferLast(Java.Lang.Object)Documentation for this section has not yet been entered. | ||
OfferLast(Java.Lang.Object, long, TimeUnit)Documentation for this section has not yet been entered. | ||
override | Peek()Retrieves, but does not remove, the head of the queue represented by this deque (in other words, the first element of this deque), or returns null if this deque is empty. | |
PeekFirst()Retrieves, but does not remove, the first element of this deque, or returns null if this deque is empty. | ||
PeekLast()Retrieves, but does not remove, the last element of this deque, or returns null if this deque is empty. | ||
override | Poll()Retrieves and removes the head of the queue represented by this deque (in other words, the first element of this deque), or returns null if this deque is empty. | |
Poll(long, TimeUnit)Retrieves and removes the head of the queue represented by this deque (in other words, the first element of this deque), waiting up to the specified wait time if necessary for an element to become available. | ||
PollFirst()Retrieves and removes the first element of this deque, or returns null if this deque is empty. | ||
PollFirst(long, TimeUnit)Retrieves and removes the first element of this deque, waiting up to the specified wait time if necessary for an element to become available. | ||
PollLast()Retrieves and removes the last element of this deque, or returns null if this deque is empty. | ||
PollLast(long, TimeUnit)Retrieves and removes the last element of this deque, waiting up to the specified wait time if necessary for an element to become available. | ||
Pop()Pops an element from the stack represented by this deque. | ||
Push(Java.Lang.Object)Documentation for this section has not yet been entered. | ||
Put(Java.Lang.Object)Documentation for this section has not yet been entered. | ||
PutFirst(Java.Lang.Object)Documentation for this section has not yet been entered. | ||
PutLast(Java.Lang.Object)Documentation for this section has not yet been entered. | ||
RemainingCapacity()Returns the number of additional elements that this deque can ideally (in the absence of memory or resource constraints) accept without blocking. | ||
RemoveFirst()Retrieves and removes the first element of this deque. | ||
RemoveFirstOccurrence(Java.Lang.Object)Removes the first occurrence of the specified element from this deque. | ||
RemoveLast()Retrieves and removes the last element of this deque. | ||
RemoveLastOccurrence(Java.Lang.Object)Removes the last occurrence of the specified element from this deque. | ||
override | Size()Returns the number of elements in this deque. | |
Take()Retrieves and removes the head of the queue represented by this deque (in other words, the first element of this deque), waiting if necessary until an element becomes available. | ||
TakeFirst()Retrieves and removes the first element of this deque, waiting if necessary until an element becomes available. | ||
TakeLast()Retrieves and removes the last element of this deque, waiting if necessary until an element becomes available. |