ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/jsr166/jsr166/src/jsr166y/TransferQueue.java
Revision: 1.6
Committed: Mon Jul 27 00:01:47 2009 UTC (14 years, 9 months ago) by jsr166
Branch: MAIN
Changes since 1.5: +11 -9 lines
Log Message:
@link-ify

File Contents

# User Rev Content
1 dl 1.1 /*
2     * Written by Doug Lea with assistance from members of JCP JSR-166
3     * Expert Group and released to the public domain, as explained at
4     * http://creativecommons.org/licenses/publicdomain
5     */
6    
7     package jsr166y;
8     import java.util.concurrent.*;
9    
10     /**
11     * A {@link BlockingQueue} in which producers may wait for consumers
12 jsr166 1.4 * to receive elements. A {@code TransferQueue} may be useful for
13 dl 1.1 * example in message passing applications in which producers
14 jsr166 1.6 * sometimes (using method {@link #transfer}) await receipt of
15     * elements by consumers invoking {@code take} or {@code poll}, while
16     * at other times enqueue elements (via method {@code put}) without
17     * waiting for receipt. {@linkplain
18     * #tryTransfer(Object) Non-blocking} and {@linkplain
19     * #tryTransfer(Object,long,TimeUnit) time-out} versions of {@code
20     * tryTransfer} are also available. A {@code TransferQueue} may also
21     * be queried, via {@link #hasWaitingConsumer}, whether there are any
22     * threads waiting for items, which is a converse analogy to a {@code
23     * peek} operation.
24 dl 1.1 *
25 jsr166 1.6 * <p>Like other blocking queues, a {@code TransferQueue} may be
26 jsr166 1.4 * capacity bounded. If so, an attempted {@code transfer} operation
27 dl 1.1 * may initially block waiting for available space, and/or
28     * subsequently block waiting for reception by a consumer. Note that
29     * in a queue with zero capacity, such as {@link SynchronousQueue},
30 jsr166 1.4 * {@code put} and {@code transfer} are effectively synonymous.
31 dl 1.1 *
32     * <p>This interface is a member of the
33     * <a href="{@docRoot}/../technotes/guides/collections/index.html">
34     * Java Collections Framework</a>.
35     *
36     * @since 1.7
37     * @author Doug Lea
38     * @param <E> the type of elements held in this collection
39     */
40     public interface TransferQueue<E> extends BlockingQueue<E> {
41     /**
42     * Transfers the specified element if there exists a consumer
43 jsr166 1.4 * already waiting to receive it, otherwise returning {@code false}
44 dl 1.1 * without enqueuing the element.
45     *
46     * @param e the element to transfer
47 jsr166 1.4 * @return {@code true} if the element was transferred, else
48     * {@code false}
49 dl 1.1 * @throws ClassCastException if the class of the specified element
50     * prevents it from being added to this queue
51     * @throws NullPointerException if the specified element is null
52     * @throws IllegalArgumentException if some property of the specified
53     * element prevents it from being added to this queue
54     */
55     boolean tryTransfer(E e);
56    
57     /**
58     * Inserts the specified element into this queue, waiting if
59     * necessary for space to become available and the element to be
60 jsr166 1.4 * dequeued by a consumer invoking {@code take} or {@code poll}.
61 dl 1.1 *
62     * @param e the element to transfer
63     * @throws InterruptedException if interrupted while waiting,
64 jsr166 1.5 * in which case the element is not enqueued
65 dl 1.1 * @throws ClassCastException if the class of the specified element
66     * prevents it from being added to this queue
67     * @throws NullPointerException if the specified element is null
68     * @throws IllegalArgumentException if some property of the specified
69     * element prevents it from being added to this queue
70     */
71     void transfer(E e) throws InterruptedException;
72    
73     /**
74     * Inserts the specified element into this queue, waiting up to
75     * the specified wait time if necessary for space to become
76     * available and the element to be dequeued by a consumer invoking
77 jsr166 1.4 * {@code take} or {@code poll}.
78 dl 1.1 *
79     * @param e the element to transfer
80     * @param timeout how long to wait before giving up, in units of
81 jsr166 1.4 * {@code unit}
82     * @param unit a {@code TimeUnit} determining how to interpret the
83     * {@code timeout} parameter
84     * @return {@code true} if successful, or {@code false} if
85 dl 1.1 * the specified waiting time elapses before completion,
86 jsr166 1.5 * in which case the element is not enqueued
87 dl 1.1 * @throws InterruptedException if interrupted while waiting,
88 jsr166 1.5 * in which case the element is not enqueued
89 dl 1.1 * @throws ClassCastException if the class of the specified element
90     * prevents it from being added to this queue
91     * @throws NullPointerException if the specified element is null
92     * @throws IllegalArgumentException if some property of the specified
93     * element prevents it from being added to this queue
94     */
95 jsr166 1.3 boolean tryTransfer(E e, long timeout, TimeUnit unit)
96 dl 1.1 throws InterruptedException;
97    
98     /**
99 jsr166 1.4 * Returns {@code true} if there is at least one consumer waiting
100     * to dequeue an element via {@code take} or {@code poll}.
101     * The return value represents a momentary state of affairs.
102     *
103     * @return {@code true} if there is at least one waiting consumer
104 dl 1.1 */
105     boolean hasWaitingConsumer();
106    
107     /**
108     * Returns an estimate of the number of consumers waiting to
109 jsr166 1.4 * dequeue elements via {@code take} or {@code poll}. The return
110 dl 1.2 * value is an approximation of a momentary state of affairs, that
111     * may be inaccurate if consumers have completed or given up
112     * waiting. The value may be useful for monitoring and heuristics,
113     * but not for synchronization control. Implementations of this
114     * method are likely to be noticeably slower than those for
115 jsr166 1.4 * {@link #hasWaitingConsumer}.
116     *
117 dl 1.1 * @return the number of consumers waiting to dequeue elements
118     */
119     int getWaitingConsumerCount();
120     }