public class BoundedLinkedQueue extends Object implements BoundedChannel
LinkedQueue
,
Modifier and Type | Field and Description |
---|---|
protected int |
capacity_
Number of elements allowed
|
protected LinkedNode |
head_
Dummy header node of list.
|
protected LinkedNode |
last_
The last node of list.
|
protected Object |
putGuard_
Helper monitor.
|
protected int |
putSidePutPermits_
One side of a split permit count.
|
protected Object |
takeGuard_
Helper monitor.
|
protected int |
takeSidePutPermits_
Number of takes since last reconcile
|
Constructor and Description |
---|
BoundedLinkedQueue()
Create a queue with the current default capacity
|
BoundedLinkedQueue(int capacity)
Create a queue with the given capacity
|
Modifier and Type | Method and Description |
---|---|
protected void |
allowTake()
Notify a waiting take if needed
|
int |
capacity()
Return the current capacity of this queue
|
protected Object |
extract()
Main mechanics for take/poll
|
protected void |
insert(Object x)
Create and insert a node.
|
boolean |
isEmpty() |
boolean |
offer(Object x,
long msecs)
Place item in channel only if it can be accepted within
msecs milliseconds.
|
Object |
peek()
Return, but do not remove object at head of Channel,
or null if it is empty.
|
Object |
poll(long msecs)
Return and remove an item from channel only if one is available within
msecs milliseconds.
|
void |
put(Object x)
Place item in the channel, possibly waiting indefinitely until
it can be accepted.
|
protected int |
reconcilePutPermits()
Move put permits from take side to put side;
return the number of put side permits that are available.
|
void |
setCapacity(int newCapacity)
Reset the capacity of this queue.
|
int |
size()
Return the number of elements in the queue.
|
Object |
take()
Return and remove an item from channel,
possibly waiting indefinitely until
such an item exists.
|
protected LinkedNode head_
protected LinkedNode last_
protected final Object putGuard_
protected final Object takeGuard_
protected int capacity_
protected int putSidePutPermits_
protected int takeSidePutPermits_
public BoundedLinkedQueue(int capacity)
IllegalArgumentException
- if capacity less or equal to zeropublic BoundedLinkedQueue()
protected final int reconcilePutPermits()
public int capacity()
capacity
in interface BoundedChannel
public int size()
public void setCapacity(int newCapacity)
IllegalArgumentException
- if capacity less or equal to zeroprotected Object extract()
public Object peek()
Channel
public Object take() throws InterruptedException
Channel
take
in interface Channel
take
in interface Takable
InterruptedException
- if the current thread has
been interrupted at a point at which interruption
is detected, in which case state of the channel is unchanged.public Object poll(long msecs) throws InterruptedException
Channel
poll
in interface Channel
poll
in interface Takable
msecs
- the number of milliseconds to wait. If less than
or equal to zero, the operation does not perform any timed waits,
but might still require
access to a synchronization lock, which can impose unbounded
delay if there is a lot of contention for the channel.InterruptedException
- if the current thread has
been interrupted at a point at which interruption
is detected, in which case state of the channel is unchanged
(i.e., equivalent to a null return).protected final void allowTake()
protected void insert(Object x)
public void put(Object x) throws InterruptedException
Channel
put
in interface Channel
put
in interface Puttable
x
- the element to be inserted. Should be non-null.InterruptedException
- if the current thread has
been interrupted at a point at which interruption
is detected, in which case the element is guaranteed not
to be inserted. Otherwise, on normal return, the element is guaranteed
to have been inserted.public boolean offer(Object x, long msecs) throws InterruptedException
Channel
offer
in interface Channel
offer
in interface Puttable
x
- the element to be inserted. Should be non-null.msecs
- the number of milliseconds to wait. If less than
or equal to zero, the method does not perform any timed waits,
but might still require
access to a synchronization lock, which can impose unbounded
delay if there is a lot of contention for the channel.InterruptedException
- if the current thread has
been interrupted at a point at which interruption
is detected, in which case the element is guaranteed not
to be inserted (i.e., is equivalent to a false return).public boolean isEmpty()
Copyright © 2002–2019. All rights reserved.