Package EDU.oswego.cs.dl.util.concurrent
Class SynchronousChannel
java.lang.Object
EDU.oswego.cs.dl.util.concurrent.SynchronousChannel
- All Implemented Interfaces:
BoundedChannel
,Channel
,Puttable
,Takable
A rendezvous channel, similar to those used in CSP and Ada. Each
put must wait for a take, and vice versa. Synchronous channels
are well suited for handoff designs, in which an object running in
one thread must synch up with an object running in another thread
in order to hand it some information, event, or task.
If you only need threads to synch up without exchanging information, consider using a Barrier. If you need bidirectional exchanges, consider using a Rendezvous.
- See Also:
-
Nested Class Summary
Nested ClassesModifier and TypeClassDescriptionprotected static class
Simple FIFO queue class to hold waiting puts/takes. -
Field Summary
FieldsModifier and TypeFieldDescriptionprotected static final Object
Special marker used in queue nodes to indicate that the thread waiting for a change in the node has timed out or been interrupted.protected final SynchronousChannel.Queue
protected final SynchronousChannel.Queue
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionint
capacity()
Return the maximum number of elements that can be held.boolean
Place item in channel only if it can be accepted within msecs milliseconds.peek()
Return, but do not remove object at head of Channel, or null if it is empty.poll
(long msecs) Return and remove an item from channel only if one is available within msecs milliseconds.void
Place item in the channel, possibly waiting indefinitely until it can be accepted.take()
Return and remove an item from channel, possibly waiting indefinitely until such an item exists.
-
Field Details
-
CANCELLED
Special marker used in queue nodes to indicate that the thread waiting for a change in the node has timed out or been interrupted. -
waitingPuts
-
waitingTakes
-
-
Constructor Details
-
SynchronousChannel
public SynchronousChannel()
-
-
Method Details
-
capacity
public int capacity()Description copied from interface:BoundedChannel
Return the maximum number of elements that can be held.- Specified by:
capacity
in interfaceBoundedChannel
- Returns:
- zero -- Synchronous channels have no internal capacity.
-
peek
Description copied from interface:Channel
Return, but do not remove object at head of Channel, or null if it is empty. -
put
Description copied from interface:Channel
Place item in the channel, possibly waiting indefinitely until it can be accepted. Channels implementing the BoundedChannel subinterface are generally guaranteed to block on puts upon reaching capacity, but other implementations may or may not block.- Specified by:
put
in interfaceChannel
- Specified by:
put
in interfacePuttable
- Parameters:
x
- the element to be inserted. Should be non-null.- Throws:
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.
-
take
Description copied from interface:Channel
Return and remove an item from channel, possibly waiting indefinitely until such an item exists.- Specified by:
take
in interfaceChannel
- Specified by:
take
in interfaceTakable
- Returns:
- some item from the channel. Different implementations may guarantee various properties (such as FIFO) about that item
- Throws:
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.
-
offer
Description copied from interface:Channel
Place item in channel only if it can be accepted within msecs milliseconds. The time bound is interpreted in a coarse-grained, best-effort fashion.- Specified by:
offer
in interfaceChannel
- Specified by:
offer
in interfacePuttable
- Parameters:
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.- Returns:
- true if accepted, else false
- Throws:
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).
-
poll
Description copied from interface:Channel
Return and remove an item from channel only if one is available within msecs milliseconds. The time bound is interpreted in a coarse grained, best-effort fashion.- Specified by:
poll
in interfaceChannel
- Specified by:
poll
in interfaceTakable
- Parameters:
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.- Returns:
- some item, or null if the channel is empty.
- Throws:
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).
-