ConcurrentLinkedDeque()
Constructs an empty deque.
ConcurrentLinkedDeque(Collection<? extends E> c)
Constructs a deque initially containing the elements of the given collection, added in traversal order of the collection's iterator.
boolean add(E e)
Inserts the specified element at the tail of this deque.
boolean addAll(Collection<? extends E> c)
Appends all of the elements in the specified collection to the end of this deque, in the order that they are returned by the specified collection's iterator.
void addFirst(E e)
Inserts the specified element at the front of this deque.
void addLast(E e)
Inserts the specified element at the end of this deque.
void clear()
Removes all of the elements from this deque.
boolean contains(Object o)
Returns true if this deque contains the specified element.
Iterator<E> descendingIterator()
Returns an iterator over the elements in this deque in reverse sequential order.
E element()
Retrieves, but does not remove, the head of the queue represented by this deque (in other words, the first element of this deque).
void forEach(Consumer<? super E> action)
Performs the given action for each element of the Iterable until all elements have been processed or the action throws an exception.
E getFirst()
Retrieves, but does not remove, the first element of this deque.
E getLast()
Retrieves, but does not remove, the last element of this deque.
boolean isEmpty()
Returns true if this collection contains no elements.
Iterator<E> iterator()
Returns an iterator over the elements in this deque in proper sequence.
boolean offer(E e)
Inserts the specified element at the tail of this deque.
boolean offerFirst(E e)
Inserts the specified element at the front of this deque.
boolean offerLast(E e)
Inserts the specified element at the end of this deque.
E 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.
E peekFirst()
Retrieves, but does not remove, the first element of this deque, or returns null if this deque is empty.
E peekLast()
Retrieves, but does not remove, the last element of this deque, or returns null if this deque is empty.
E 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.
E pollFirst()
Retrieves and removes the first element of this deque, or returns null if this deque is empty.
E pollLast()
Retrieves and removes the last element of this deque, or returns null if this deque is empty.
E pop()
Pops an element from the stack represented by this deque.
void push(E e)
Pushes an element onto the stack represented by this deque (in other words, at the head of this deque) if it is possible to do so immediately without violating capacity restrictions, throwing an IllegalStateException if no space is currently available.
E remove()
Retrieves and removes the head of the queue represented by this deque (in other words, the first element of this deque).
boolean remove(Object o)
Removes the first occurrence of the specified element from this deque.
boolean removeAll(Collection<?> c)
Removes all of this collection's elements that are also contained in the specified collection (optional operation).
E removeFirst()
Retrieves and removes the first element of this deque.
boolean removeFirstOccurrence(Object o)
Removes the first occurrence of the specified element from this deque.
boolean removeIf(Predicate<? super E> filter)
Removes all of the elements of this collection that satisfy the given predicate.
E removeLast()
Retrieves and removes the last element of this deque.
boolean removeLastOccurrence(Object o)
Removes the last occurrence of the specified element from this deque.
boolean retainAll(Collection<?> c)
Retains only the elements in this collection that are contained in the specified collection (optional operation).
int size()
Returns the number of elements in this deque.
Spliterator<E> spliterator()
Returns a
Spliterator
over the elements in this deque.
Object[] toArray()
Returns an array containing all of the elements in this deque, in proper sequence (from first to last element).
<T> T[] toArray(T[] a)
Returns an array containing all of the elements in this deque, in proper sequence (from first to last element); the runtime type of the returned array is that of the specified array.
String toString()
Returns a string representation of this collection.
containsAllcontainsAll, equals, hashCode, parallelStream, streampublic ConcurrentLinkedDeque()
Constructs an empty deque.
public ConcurrentLinkedDeque(Collection<? extends E> c)
Constructs a deque initially containing the elements of the given collection, added in traversal order of the collection's iterator.
c - the collection of elements to initially contain
NullPointerException - if the specified collection or any of its elements are null
public void addFirst(E e)
Inserts the specified element at the front of this deque. As the deque is unbounded, this method will never throw
IllegalStateException
.
addFirst in interface Deque<E>
e - the element to add
NullPointerException - if the specified element is null
public void addLast(E e)
Inserts the specified element at the end of this deque. As the deque is unbounded, this method will never throw
IllegalStateException
.
This method is equivalent to add(E).
addLast in interface Deque<E>
e - the element to add
NullPointerException - if the specified element is null
public boolean offerFirst(E e)
Inserts the specified element at the front of this deque. As the deque is unbounded, this method will never return false.
offerFirst in interface Deque<E>
e - the element to add
true (as specified by Deque.offerFirst(E))
NullPointerException - if the specified element is null
public boolean offerLast(E e)
Inserts the specified element at the end of this deque. As the deque is unbounded, this method will never return
false
.
This method is equivalent to add(E).
offerLast in interface Deque<E>
e - the element to add
true (as specified by Deque.offerLast(E))
NullPointerException - if the specified element is null
public E peekFirst()Description copied from interface:
Deque
Retrieves, but does not remove, the first element of this deque, or returns null if this deque is empty.
public E peekLast()Description copied from interface:
Deque
Retrieves, but does not remove, the last element of this deque, or returns null if this deque is empty.
public E getFirst()Description copied from interface:
Deque
Retrieves, but does not remove, the first element of this deque. This method differs from
peekFirst
only in that it throws an exception if this deque is empty.
getFirst in interface Deque<E>
NoSuchElementException - if this deque is empty
public E getLast()Description copied from interface:
Deque
Retrieves, but does not remove, the last element of this deque. This method differs from
peekLast
only in that it throws an exception if this deque is empty.
getLast in interface Deque<E>
NoSuchElementException - if this deque is empty
public E pollFirst()Description copied from interface:
Deque
Retrieves and removes the first element of this deque, or returns null if this deque is empty.
public E pollLast()Description copied from interface:
Deque
Retrieves and removes the last element of this deque, or returns null if this deque is empty.
public E removeFirst()Description copied from interface:
Deque
Retrieves and removes the first element of this deque. This method differs from
pollFirst
only in that it throws an exception if this deque is empty.
removeFirst in interface Deque<E>
NoSuchElementException - if this deque is empty
public E removeLast()Description copied from interface:
Deque
Retrieves and removes the last element of this deque. This method differs from
pollLast
only in that it throws an exception if this deque is empty.
removeLast in interface Deque<E>
NoSuchElementException - if this deque is empty
public boolean offer(E e)
Inserts the specified element at the tail of this deque. As the deque is unbounded, this method will never return false.
offer in interface Deque<E>
offer in interface Queue<E>
e - the element to add
true (as specified by Queue.offer(E))
NullPointerException - if the specified element is null
public boolean add(E e)
Inserts the specified element at the tail of this deque. As the deque is unbounded, this method will never throw
IllegalStateException
or return
false
.
add in interface Collection<E>
add in interface Deque<E>
add in interface Queue<E>
add in class AbstractCollection<E>
e - element whose presence in this collection is to be ensured
true (as specified by Collection.add(E))
NullPointerException - if the specified element is null
public E poll()Description copied from interface:
Deque
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.
This method is equivalent to Deque.pollFirst().
public E peek()Description copied from interface:
Deque
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.
This method is equivalent to Deque.peekFirst().
public E remove()Description copied from interface:
Deque
Retrieves and removes the head of the queue represented by this deque (in other words, the first element of this deque). This method differs from
poll()
only in that it throws an exception if this deque is empty.
This method is equivalent to Deque.removeFirst().
public E pop()Description copied from interface:
Deque
This method is equivalent to Deque.removeFirst().
pop in interface Deque<E>
NoSuchElementException - if this deque is empty
public E element()Description copied from interface:
Deque
Retrieves, but does not remove, the head of the queue represented by this deque (in other words, the first element of this deque). This method differs from
peek
only in that it throws an exception if this deque is empty.
This method is equivalent to Deque.getFirst().
public void push(E e)Description copied from interface:
Deque
Pushes an element onto the stack represented by this deque (in other words, at the head of this deque) if it is possible to do so immediately without violating capacity restrictions, throwing an
IllegalStateException
if no space is currently available.
This method is equivalent to Deque.addFirst(E).
push in interface Deque<E>
e - the element to push
NullPointerException - if the specified element is null and this deque does not permit null elements
public boolean removeFirstOccurrence(Object 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 e such that o.equals(e) (if such an element exists). Returns true if this deque contained the specified element (or equivalently, if this deque changed as a result of the call).
removeFirstOccurrence in interface Deque<E>
o - element to be removed from this deque, if present
true if the deque contained the specified element
NullPointerException - if the specified element is null
public boolean removeLastOccurrence(Object o)
Removes the last occurrence of the specified element from this deque. If the deque does not contain the element, it is unchanged. More formally, removes the last element e such that o.equals(e) (if such an element exists). Returns true if this deque contained the specified element (or equivalently, if this deque changed as a result of the call).
removeLastOccurrence in interface Deque<E>
o - element to be removed from this deque, if present
true if the deque contained the specified element
NullPointerException - if the specified element is null
public boolean contains(Object o)
Returns true if this deque contains the specified element. More formally, returns true if and only if this deque contains at least one element e such that o.equals(e).
contains in interface Collection<E>
contains in interface Deque<E>
contains in class AbstractCollection<E>
o - element whose presence in this deque is to be tested
true if this deque contains the specified element
public boolean isEmpty()
Returns true if this collection contains no elements.
isEmpty in interface Collection<E>
isEmpty in class AbstractCollection<E>
true if this collection contains no elements
public int size()
Returns the number of elements in this deque. If this deque contains more than
Integer.MAX_VALUE
elements, it returns
Integer.MAX_VALUE
.
Beware that, unlike in most collections, this method is NOT a constant-time operation. Because of the asynchronous nature of these deques, determining the current number of elements requires traversing them all to count them. Additionally, it is possible for the size to change during execution of this method, in which case the returned result will be inaccurate. Thus, this method is typically not very useful in concurrent applications.
size in interface Collection<E>
size in interface Deque<E>
size in class AbstractCollection<E>
public boolean remove(Object 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
e
such that
o.equals(e)
(if such an element exists). Returns
true
if this deque contained the specified element (or equivalently, if this deque changed as a result of the call).
This method is equivalent to removeFirstOccurrence(Object).
remove in interface Collection<E>
remove in interface Deque<E>
remove in class AbstractCollection<E>
o - element to be removed from this deque, if present
true if the deque contained the specified element
NullPointerException - if the specified element is null
public boolean addAll(Collection<? extends E> c)
Appends all of the elements in the specified collection to the end of this deque, in the order that they are returned by the specified collection's iterator. Attempts to addAll of a deque to itself result in IllegalArgumentException.
addAll in interface Collection<E>
addAll in interface Deque<E>
addAll in class AbstractCollection<E>
c - the elements to be inserted into this deque
true if this deque changed as a result of the call
NullPointerException - if the specified collection or any of its elements are null
IllegalArgumentException - if the collection is this deque
AbstractCollection.add(Object)
public void clear()
Removes all of the elements from this deque.
clear in interface Collection<E>
clear in class AbstractCollection<E>
public String toString()
Returns a string representation of this collection. The string representation consists of a list of the collection's elements in the order they are returned by its iterator, enclosed in square brackets (
"[]"
). Adjacent elements are separated by the characters
", "
(comma and space). Elements are converted to strings as by
String.valueOf(Object)
.
toString in class AbstractCollection<E>
public Object[] toArray()
Returns an array containing all of the elements in this deque, in proper sequence (from first to last element).
The returned array will be "safe" in that no references to it are maintained by this deque. (In other words, this method must allocate a new array). The caller is thus free to modify the returned array.
This method acts as bridge between array-based and collection-based APIs.
toArray in interface Collection<E>
toArray in class AbstractCollection<E>
public <T> T[] toArray(T[] a)
Returns an array containing all of the elements in this deque, in proper sequence (from first to last element); the runtime type of the returned array is that of the specified array. If the deque fits in the specified array, it is returned therein. Otherwise, a new array is allocated with the runtime type of the specified array and the size of this deque.
If this deque fits in the specified array with room to spare (i.e., the array has more elements than this deque), the element in the array immediately following the end of the deque is set to null.
Like the toArray() method, this method acts as bridge between array-based and collection-based APIs. Further, this method allows precise control over the runtime type of the output array, and may, under certain circumstances, be used to save allocation costs.
Suppose x is a deque known to contain only strings. The following code can be used to dump the deque into a newly allocated array of String:
String[] y = x.toArray(new String[0]);
Note that
toArray(new Object[0])
is identical in function to
toArray()
.
toArray in interface Collection<E>
toArray in class AbstractCollection<E>
T - the runtime type of the array to contain the collection
a - the array into which the elements of the deque are to be stored, if it is big enough; otherwise, a new array of the same runtime type is allocated for this purpose
ArrayStoreException - if the runtime type of the specified array is not a supertype of the runtime type of every element in this deque
NullPointerException - if the specified array is null
public Iterator<E> iterator()
The returned iterator is weakly consistent.
public Iterator<E> descendingIterator()
The returned iterator is weakly consistent.
descendingIterator in interface Deque<E>
public Spliterator<E> spliterator()
spliterator in interface Collection<E>
spliterator in interface Iterable<E>
Spliterator implements trySplit to permit limited parallelism.
Spliterator over the elements in this deque
public boolean removeIf(Predicate<? super E> filter)
Removes all of the elements of this collection that satisfy the given predicate. Errors or runtime exceptions thrown during iteration or by the predicate are relayed to the caller.
removeIf in interface Collection<E>
filter - a predicate which returns true for elements to be removed
true if any elements were removed
NullPointerException - if the specified filter is null
public boolean removeAll(Collection<?> c)
Removes all of this collection's elements that are also contained in the specified collection (optional operation). After this call returns, this collection will contain no elements in common with the specified collection.
removeAll in interface Collection<E>
removeAll in class AbstractCollection<E>
c - collection containing elements to be removed from this collection
true if this collection changed as a result of the call
NullPointerException - if this collection contains one or more null elements and the specified collection does not support null elements (optional), or if the specified collection is null
AbstractCollection.remove(Object), AbstractCollection.contains(Object)
public boolean retainAll(Collection<?> c)
Retains only the elements in this collection that are contained in the specified collection (optional operation). In other words, removes from this collection all of its elements that are not contained in the specified collection.
retainAll in interface Collection<E>
retainAll in class AbstractCollection<E>
c - collection containing elements to be retained in this collection
true if this collection changed as a result of the call
NullPointerException - if this collection contains one or more null elements and the specified collection does not permit null elements (optional), or if the specified collection is null
AbstractCollection.remove(Object), AbstractCollection.contains(Object)
public void forEach(Consumer<? super E> action)Description copied from interface:
Iterable
Performs the given action for each element of the
Iterable
until all elements have been processed or the action throws an exception. Actions are performed in the order of iteration, if that order is specified. Exceptions thrown by the action are relayed to the caller.
The behavior of this method is unspecified if the action performs side-effects that modify the underlying source of elements, unless an overriding class has specified a concurrent modification policy.
forEach in interface Iterable<E>
action - The action to be performed for each element
NullPointerException - if the specified action is null
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4