public class ReorderingBlockingQueue<E> extends Object
must be called with an object and a timestamp. Timestamps must be a contiguous interval of the
natural numbers starting at zero, and objects will be returned in timestamp order. Failure to
comply with the contract (i.e., missing timestamps) will cause the queue to block forever.
put(Object, long) might block if there is not enough space to keep track of the
object (i.e., if its timestamp is too far in time w.r.t. the timestamp that would be
returned next by the queue).
take() might block if the object with the next
timestamp has not been
put(Object, long) yet.
The implementation is based on a circular, fixed-size buffer, so all methods of this class complete in constant time.
|Constructor and Description|
|Modifier and Type||Method and Description|
Returns whether this queue is empty.
Inserts an element with given timestamp, waiting for space to become available if the timestamp of the element minus the current timestamp of the queue exceeds the queue capacity.
Returns the number of elements in this queue.
Returns the element with the next timestamp, waiting until it is available.
public ReorderingBlockingQueue(int capacity)
ReorderingBlockingQueuewith the given fixed capacity.
capacity- the capacity of this queue (will be rounded to the next power of two).
public void put(E e, long timeStamp) throws InterruptedException
public E take() throws InterruptedException
Note that because of the reordering semantics, an invocation of this method on a nonempty queue might block nonetheless.
public int size()
public boolean isEmpty()