Interface ConcurrentQueue<E>
- All Known Implementing Classes:
DisruptorBlockingQueue, MPMCBlockingQueue, MPMCConcurrentQueue, MultithreadConcurrentQueue, PushPullBlockingQueue, PushPullConcurrentQueue
public interface ConcurrentQueue<E>
A very high performance blocking buffer, based on Disruptor approach to queues
Created by jcairns on 5/28/14.
-
Method Summary
Modifier and TypeMethodDescriptionintcapacity()voidclear()clear the queue of all elementsbooleanbooleanisEmpty()booleanAdd element t to the ringpeek()return the first element in the queuepoll()remove the first element from the queue and return itintreturn all elements in the queue to the provided array, up to the size of the provided array.intsize()
-
Method Details
-
offer
Add element t to the ring- Parameters:
e- - element to offer- Returns:
- boolean - true if the operation succeeded
-
poll
-
peek
-
size
int size()- Returns:
- int - the number of elements in the queue
-
capacity
int capacity()- Returns:
- int - the capacity of the queue
-
isEmpty
boolean isEmpty()- Returns:
- boolean - true if the queue is currently empty
-
contains
- Parameters:
o- - the object to test- Returns:
- boolean - true if specified object is contained in the queue
-
remove
return all elements in the queue to the provided array, up to the size of the provided array.- Parameters:
e- - The element array- Returns:
- int - the number of elements added to t
-
clear
void clear()clear the queue of all elements
-