Java Doc for BlockingQueue.java in  » 6.0-JDK-Core » Collections-Jar-Zip-Logging-regex » java » util » concurrent » Java Source Code / Java DocumentationJava Source Code and Java Documentation

Home
Java Source Code / Java Documentation
1.6.0 JDK Core
2.6.0 JDK Modules
3.6.0 JDK Modules com.sun
4.6.0 JDK Modules com.sun.java
5.6.0 JDK Modules sun
6.6.0 JDK Platform
7.Ajax
8.Apache Harmony Java SE
9.Aspect oriented
10.Authentication Authorization
11.Blogger System
12.Build
13.Byte Code
14.Cache
15.Chart
16.Chat
17.Code Analyzer
18.Collaboration
19.Content Management System
20.Database Client
21.Database DBMS
22.Database JDBC Connection Pool
23.Database ORM
24.Development
25.EJB Server
26.ERP CRM Financial
27.ESB
28.Forum
29.Game
30.GIS
31.Graphic 3D
32.Graphic Library
33.Groupware
34.HTML Parser
35.IDE
36.IDE Eclipse
37.IDE Netbeans
38.Installer
39.Internationalization Localization
40.Inversion of Control
41.Issue Tracking
42.J2EE
43.J2ME
44.JBoss
45.JMS
46.JMX
47.Library
48.Mail Clients
49.Music
50.Net
51.Parser
52.PDF
53.Portal
54.Profiler
55.Project Management
56.Report
57.RSS RDF
58.Rule Engine
59.Science
60.Scripting
61.Search Engine
62.Security
63.Sevlet Container
64.Source Control
65.Swing Library
66.Template Engine
67.Test Coverage
68.Testing
69.UML
70.Web Crawler
71.Web Framework
72.Web Mail
73.Web Server
74.Web Services
75.Web Services apache cxf 2.2.6
76.Web Services AXIS2
77.Wiki Engine
78.Workflow Engines
79.XML
80.XML UI
Java Source Code / Java Documentation » 6.0 JDK Core » Collections Jar Zip Logging regex » java.util.concurrent 
Source Cross Reference  Class Diagram Java Document (Java Doc) 


java.util.concurrent.BlockingQueue

BlockingQueue
public interface BlockingQueue extends Queue<E>(Code)
A java.util.Queue that additionally supports operations that wait for the queue to become non-empty when retrieving an element, and wait for space to become available in the queue when storing an element.

BlockingQueue methods come in four forms, with different ways of handling operations that cannot be satisfied immediately, but may be satisfied at some point in the future: one throws an exception, the second returns a special value (either null or false, depending on the operation), the third blocks the current thread indefinitely until the operation can succeed, and the fourth blocks for only a given maximum time limit before giving up. These methods are summarized in the following table:

Throws exception Special value Blocks Times out
Insert BlockingQueue.add add(e) BlockingQueue.offer offer(e) BlockingQueue.put put(e) BlockingQueue.offer(Object,long,TimeUnit) offer(e, time, unit)
Remove BlockingQueue.remove remove() BlockingQueue.poll poll() BlockingQueue.take take() BlockingQueue.poll(long,TimeUnit) poll(time, unit)
Examine BlockingQueue.element element() BlockingQueue.peek peek() not applicable not applicable

A BlockingQueue does not accept null elements. Implementations throw NullPointerException on attempts to add, put or offer a null. A null is used as a sentinel value to indicate failure of poll operations.

A BlockingQueue may be capacity bounded. At any given time it may have a remainingCapacity beyond which no additional elements can be put without blocking. A BlockingQueue without any intrinsic capacity constraints always reports a remaining capacity of Integer.MAX_VALUE.

BlockingQueue implementations are designed to be used primarily for producer-consumer queues, but additionally support the java.util.Collection interface. So, for example, it is possible to remove an arbitrary element from a queue using remove(x). However, such operations are in general not performed very efficiently, and are intended for only occasional use, such as when a queued message is cancelled.

BlockingQueue implementations are thread-safe. All queuing methods achieve their effects atomically using internal locks or other forms of concurrency control. However, the bulk Collection operations addAll, containsAll, retainAll and removeAll are not necessarily performed atomically unless specified otherwise in an implementation. So it is possible, for example, for addAll(c) to fail (throwing an exception) after adding only some of the elements in c.

A BlockingQueue does not intrinsically support any kind of "close" or "shutdown" operation to indicate that no more items will be added. The needs and usage of such features tend to be implementation-dependent. For example, a common tactic is for producers to insert special end-of-stream or poison objects, that are interpreted accordingly when taken by consumers.

Usage example, based on a typical producer-consumer scenario. Note that a BlockingQueue can safely be used with multiple producers and multiple consumers.

 class Producer implements Runnable {
 private final BlockingQueue queue;
 Producer(BlockingQueue q) { queue = q; }
 public void run() {
 try {
 while (true) { queue.put(produce()); }
 } catch (InterruptedException ex) { ... handle ...}
 }
 Object produce() { ... }
 }
 class Consumer implements Runnable {
 private final BlockingQueue queue;
 Consumer(BlockingQueue q) { queue = q; }
 public void run() {
 try {
 while (true) { consume(queue.take()); }
 } catch (InterruptedException ex) { ... handle ...}
 }
 void consume(Object x) { ... }
 }
 class Setup {
 void main() {
 BlockingQueue q = new SomeQueueImplementation();
 Producer p = new Producer(q);
 Consumer c1 = new Consumer(q);
 Consumer c2 = new Consumer(q);
 new Thread(p).start();
 new Thread(c1).start();
 new Thread(c2).start();
 }
 }
 

Memory consistency effects: As with other concurrent collections, actions in a thread prior to placing an object into a BlockingQueue happen-before actions subsequent to the access or removal of that element from the BlockingQueue in another thread.

This interface is a member of the Java Collections Framework.
since:
   1.5
author:
   Doug Lea<
Parameters:
  E - > the type of elements held in this collection





Method Summary
 booleanadd(E e)
     Inserts the specified element into this queue if it is possible to do so immediately without violating capacity restrictions, returning true upon success and throwing an IllegalStateException if no space is currently available.
public  booleancontains(Object o)
     Returns true if this queue contains the specified element.
 intdrainTo(Collection<? super E> c)
     Removes all available elements from this queue and adds them to the given collection.
 intdrainTo(Collection<? super E> c, int maxElements)
     Removes at most the given number of available elements from this queue and adds them to the given collection.
 booleanoffer(E e)
     Inserts the specified element into this queue if it is possible to do so immediately without violating capacity restrictions, returning true upon success and false if no space is currently available.
 booleanoffer(E e, long timeout, TimeUnit unit)
     Inserts the specified element into this queue, waiting up to the specified wait time if necessary for space to become available.
 Epoll(long timeout, TimeUnit unit)
     Retrieves and removes the head of this queue, waiting up to the specified wait time if necessary for an element to become available.
 voidput(E e)
     Inserts the specified element into this queue, waiting if necessary for space to become available.
 intremainingCapacity()
     Returns the number of additional elements that this queue can ideally (in the absence of memory or resource constraints) accept without blocking, or Integer.MAX_VALUE if there is no intrinsic limit.
 booleanremove(Object o)
     Removes a single instance of the specified element from this queue, if it is present.
 Etake()
     Retrieves and removes the head of this queue, waiting if necessary until an element becomes available.



Method Detail
add
boolean add(E e)(Code)
Inserts the specified element into this queue if it is possible to do so immediately without violating capacity restrictions, returning true upon success and throwing an IllegalStateException if no space is currently available. When using a capacity-restricted queue, it is generally preferable to use BlockingQueue.offer(Object) offer .
Parameters:
  e - the element to add true (as specified by Collection.add)
throws:
  IllegalStateException - if the element cannot be added at thistime due to capacity restrictions
throws:
  ClassCastException - if the class of the specified elementprevents it from being added to this queue
throws:
  NullPointerException - if the specified element is null
throws:
  IllegalArgumentException - if some property of the specifiedelement prevents it from being added to this queue



contains
public boolean contains(Object o)(Code)
Returns true if this queue contains the specified element. More formally, returns true if and only if this queue contains at least one element e such that o.equals(e).
Parameters:
  o - object to be checked for containment in this queue true if this queue contains the specified element
throws:
  ClassCastException - if the class of the specified elementis incompatible with this queue (optional)
throws:
  NullPointerException - if the specified element is null (optional)



drainTo
int drainTo(Collection<? super E> c)(Code)
Removes all available elements from this queue and adds them to the given collection. This operation may be more efficient than repeatedly polling this queue. A failure encountered while attempting to add elements to collection c may result in elements being in neither, either or both collections when the associated exception is thrown. Attempts to drain a queue to itself result in IllegalArgumentException. Further, the behavior of this operation is undefined if the specified collection is modified while the operation is in progress.
Parameters:
  c - the collection to transfer elements into the number of elements transferred
throws:
  UnsupportedOperationException - if addition of elementsis not supported by the specified collection
throws:
  ClassCastException - if the class of an element of this queueprevents it from being added to the specified collection
throws:
  NullPointerException - if the specified collection is null
throws:
  IllegalArgumentException - if the specified collection is thisqueue, or some property of an element of this queue preventsit from being added to the specified collection



drainTo
int drainTo(Collection<? super E> c, int maxElements)(Code)
Removes at most the given number of available elements from this queue and adds them to the given collection. A failure encountered while attempting to add elements to collection c may result in elements being in neither, either or both collections when the associated exception is thrown. Attempts to drain a queue to itself result in IllegalArgumentException. Further, the behavior of this operation is undefined if the specified collection is modified while the operation is in progress.
Parameters:
  c - the collection to transfer elements into
Parameters:
  maxElements - the maximum number of elements to transfer the number of elements transferred
throws:
  UnsupportedOperationException - if addition of elementsis not supported by the specified collection
throws:
  ClassCastException - if the class of an element of this queueprevents it from being added to the specified collection
throws:
  NullPointerException - if the specified collection is null
throws:
  IllegalArgumentException - if the specified collection is thisqueue, or some property of an element of this queue preventsit from being added to the specified collection



offer
boolean offer(E e)(Code)
Inserts the specified element into this queue if it is possible to do so immediately without violating capacity restrictions, returning true upon success and false if no space is currently available. When using a capacity-restricted queue, this method is generally preferable to BlockingQueue.add , which can fail to insert an element only by throwing an exception.
Parameters:
  e - the element to add true if the element was added to this queue, elsefalse
throws:
  ClassCastException - if the class of the specified elementprevents it from being added to this queue
throws:
  NullPointerException - if the specified element is null
throws:
  IllegalArgumentException - if some property of the specifiedelement prevents it from being added to this queue



offer
boolean offer(E e, long timeout, TimeUnit unit) throws InterruptedException(Code)
Inserts the specified element into this queue, waiting up to the specified wait time if necessary for space to become available.
Parameters:
  e - the element to add
Parameters:
  timeout - how long to wait before giving up, in units ofunit
Parameters:
  unit - a TimeUnit determining how to interpret thetimeout parameter true if successful, or false ifthe specified waiting time elapses before space is available
throws:
  InterruptedException - if interrupted while waiting
throws:
  ClassCastException - if the class of the specified elementprevents it from being added to this queue
throws:
  NullPointerException - if the specified element is null
throws:
  IllegalArgumentException - if some property of the specifiedelement prevents it from being added to this queue



poll
E poll(long timeout, TimeUnit unit) throws InterruptedException(Code)
Retrieves and removes the head of this queue, waiting up to the specified wait time if necessary for an element to become available.
Parameters:
  timeout - how long to wait before giving up, in units ofunit
Parameters:
  unit - a TimeUnit determining how to interpret thetimeout parameter the head of this queue, or null if thespecified waiting time elapses before an element is available
throws:
  InterruptedException - if interrupted while waiting



put
void put(E e) throws InterruptedException(Code)
Inserts the specified element into this queue, waiting if necessary for space to become available.
Parameters:
  e - the element to add
throws:
  InterruptedException - if interrupted while waiting
throws:
  ClassCastException - if the class of the specified elementprevents it from being added to this queue
throws:
  NullPointerException - if the specified element is null
throws:
  IllegalArgumentException - if some property of the specifiedelement prevents it from being added to this queue



remainingCapacity
int remainingCapacity()(Code)
Returns the number of additional elements that this queue can ideally (in the absence of memory or resource constraints) accept without blocking, or Integer.MAX_VALUE if there is no intrinsic limit.

Note that you cannot always tell if an attempt to insert an element will succeed by inspecting remainingCapacity because it may be the case that another thread is about to insert or remove an element. the remaining capacity




remove
boolean remove(Object o)(Code)
Removes a single instance of the specified element from this queue, if it is present. More formally, removes an element e such that o.equals(e), if this queue contains one or more such elements. Returns true if this queue contained the specified element (or equivalently, if this queue changed as a result of the call).
Parameters:
  o - element to be removed from this queue, if present true if this queue changed as a result of the call
throws:
  ClassCastException - if the class of the specified elementis incompatible with this queue (optional)
throws:
  NullPointerException - if the specified element is null (optional)



take
E take() throws InterruptedException(Code)
Retrieves and removes the head of this queue, waiting if necessary until an element becomes available. the head of this queue
throws:
  InterruptedException - if interrupted while waiting



www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.