public class CircularBlockingQueue<E> extends Object implements BlockingQueue<E>
| Constructor and Description |
|---|
CircularBlockingQueue(int queueSize) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(E e) |
boolean |
addAll(Collection<? extends E> arg0) |
void |
clear() |
boolean |
contains(Object o) |
boolean |
containsAll(Collection<?> arg0) |
int |
drainTo(Collection<? super E> c) |
int |
drainTo(Collection<? super E> c,
int maxElements) |
E |
element() |
long |
getDroppedCount()
Returns the number of elements that were dropped from the queue because the
queue was full when a new element was offered.
|
boolean |
isEmpty() |
Iterator<E> |
iterator() |
boolean |
offer(E e)
This method differs from
BlockingQueue.offer(Object) in that it
will remove the oldest queued element (the element at the front of the
queue) in order to make room for any new elements if the queue is full. |
boolean |
offer(E e,
long timeout,
TimeUnit unit) |
E |
peek() |
E |
poll() |
E |
poll(long timeout,
TimeUnit unit) |
void |
put(E e) |
int |
remainingCapacity() |
E |
remove() |
boolean |
remove(Object o) |
boolean |
removeAll(Collection<?> arg0) |
boolean |
retainAll(Collection<?> arg0) |
int |
size() |
E |
take() |
Object[] |
toArray() |
<T> T[] |
toArray(T[] arg0) |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitequals, hashCode, parallelStream, removeIf, spliterator, streampublic boolean offer(E e)
BlockingQueue.offer(Object) in that it
will remove the oldest queued element (the element at the front of the
queue) in order to make room for any new elements if the queue is full.public E poll(long timeout, TimeUnit unit) throws InterruptedException
poll in interface BlockingQueue<E>InterruptedExceptionpublic E take() throws InterruptedException
take in interface BlockingQueue<E>InterruptedExceptionpublic boolean isEmpty()
isEmpty in interface Collection<E>public int size()
size in interface Collection<E>public long getDroppedCount()
public int drainTo(Collection<? super E> c)
drainTo in interface BlockingQueue<E>public boolean addAll(Collection<? extends E> arg0)
addAll in interface Collection<E>public void clear()
clear in interface Collection<E>public boolean containsAll(Collection<?> arg0)
containsAll in interface Collection<E>public boolean removeAll(Collection<?> arg0)
removeAll in interface Collection<E>public boolean retainAll(Collection<?> arg0)
retainAll in interface Collection<E>public Object[] toArray()
toArray in interface Collection<E>public <T> T[] toArray(T[] arg0)
toArray in interface Collection<E>public boolean add(E e)
add in interface Collection<E>add in interface BlockingQueue<E>add in interface Queue<E>public boolean contains(Object o)
contains in interface Collection<E>contains in interface BlockingQueue<E>public int drainTo(Collection<? super E> c, int maxElements)
drainTo in interface BlockingQueue<E>public boolean offer(E e, long timeout, TimeUnit unit) throws InterruptedException
offer in interface BlockingQueue<E>InterruptedExceptionpublic void put(E e) throws InterruptedException
put in interface BlockingQueue<E>InterruptedExceptionpublic int remainingCapacity()
remainingCapacity in interface BlockingQueue<E>public boolean remove(Object o)
remove in interface Collection<E>remove in interface BlockingQueue<E>Copyright © 2008–2021 The Apache Software Foundation. All rights reserved.