Java Doc for BoundedLinkedQueue.java in  » Ajax » Laszlo-4.0.10 » EDU » oswego » cs » dl » util » concurrent » Java Source Code / Java DocumentationJava Source Code and Java Documentation

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 geronimo
26. EJB Server GlassFish
27. EJB Server JBoss 4.2.1
28. EJB Server resin 3.1.5
29. ERP CRM Financial
30. ESB
31. Forum
32. GIS
33. Graphic Library
34. Groupware
35. HTML Parser
36. IDE
37. IDE Eclipse
38. IDE Netbeans
39. Installer
40. Internationalization Localization
41. Inversion of Control
42. Issue Tracking
43. J2EE
44. JBoss
45. JMS
46. JMX
47. Library
48. Mail Clients
49. Net
50. Parser
51. PDF
52. Portal
53. Profiler
54. Project Management
55. Report
56. RSS RDF
57. Rule Engine
58. Science
59. Scripting
60. Search Engine
61. Security
62. Sevlet Container
63. Source Control
64. Swing Library
65. Template Engine
66. Test Coverage
67. Testing
68. UML
69. Web Crawler
70. Web Framework
71. Web Mail
72. Web Server
73. Web Services
74. Web Services apache cxf 2.0.1
75. Web Services AXIS2
76. Wiki Engine
77. Workflow Engines
78. XML
79. XML UI
Java
Java Tutorial
Java Open Source
Jar File Download
Java Articles
Java Products
Java by API
Photoshop Tutorials
Maya Tutorials
Flash Tutorials
3ds-Max Tutorials
Illustrator Tutorials
GIMP Tutorials
C# / C Sharp
C# / CSharp Tutorial
C# / CSharp Open Source
ASP.Net
ASP.NET Tutorial
JavaScript DHTML
JavaScript Tutorial
JavaScript Reference
HTML / CSS
HTML CSS Reference
C / ANSI-C
C Tutorial
C++
C++ Tutorial
Ruby
PHP
Python
Python Tutorial
Python Open Source
SQL Server / T-SQL
SQL Server / T-SQL Tutorial
Oracle PL / SQL
Oracle PL/SQL Tutorial
PostgreSQL
SQL / MySQL
MySQL Tutorial
VB.Net
VB.Net Tutorial
Flash / Flex / ActionScript
VBA / Excel / Access / Word
XML
XML Tutorial
Microsoft Office PowerPoint 2007 Tutorial
Microsoft Office Excel 2007 Tutorial
Microsoft Office Word 2007 Tutorial
Java Source Code / Java Documentation » Ajax » Laszlo 4.0.10 » EDU.oswego.cs.dl.util.concurrent 
Source Cross Reference  Class Diagram Java Document (Java Doc) 


java.lang.Object
   EDU.oswego.cs.dl.util.concurrent.BoundedLinkedQueue

BoundedLinkedQueue
public class BoundedLinkedQueue implements BoundedChannel(Code)
A bounded variant of LinkedQueue class. This class may be preferable to BoundedBuffer because it allows a bit more concurency among puts and takes, because it does not pre-allocate fixed storage for elements, and allows capacity to be dynamically reset. On the other hand, since it allocates a node object on each put, it can be slow on systems with slow allocation and GC. Also, it may be preferable to LinkedQueue when you need to limit the capacity to prevent resource exhaustion. This protection normally does not hurt much performance-wise: When the queue is not empty or full, most puts and takes are still usually able to execute concurrently.
See Also:   LinkedQueue
See Also:   
See Also:   BoundedBuffer
See Also:   
See Also:   

[ Introduction to this package. ]



Field Summary
protected  intcapacity_
    
protected  LinkedNodehead_
     Dummy header node of list.
protected  LinkedNodelast_
     The last node of list.
final protected  ObjectputGuard_
     Helper monitor.
protected  intputSidePutPermits_
     One side of a split permit count.
final protected  ObjecttakeGuard_
     Helper monitor.
protected  inttakeSidePutPermits_
    

Constructor Summary
public  BoundedLinkedQueue(int capacity)
    
public  BoundedLinkedQueue()
    

Method Summary
final protected  voidallowTake()
    
public synchronized  intcapacity()
    
protected synchronized  Objectextract()
    
protected  voidinsert(Object x)
     Create and insert a node.
public  booleanisEmpty()
    
public  booleanoffer(Object x, long msecs)
    
public  Objectpeek()
    
public  Objectpoll(long msecs)
    
public  voidput(Object x)
    
final protected  intreconcilePutPermits()
     Move put permits from take side to put side; return the number of put side permits that are available.
public  voidsetCapacity(int newCapacity)
     Reset the capacity of this queue.
public synchronized  intsize()
     Return the number of elements in the queue. This is only a snapshot value, that may be in the midst of changing.
public  Objecttake()
    

Field Detail
capacity_
protected int capacity_(Code)
Number of elements allowed *



head_
protected LinkedNode head_(Code)
Dummy header node of list. The first actual node, if it exists, is always at head_.next. After each take, the old first node becomes the head.



last_
protected LinkedNode last_(Code)
The last node of list. Put() appends to list, so modifies last_



putGuard_
final protected Object putGuard_(Code)
Helper monitor. Ensures that only one put at a time executes.



putSidePutPermits_
protected int putSidePutPermits_(Code)
One side of a split permit count. The counts represent permits to do a put. (The queue is full when zero). Invariant: putSidePutPermits_ + takeSidePutPermits_ = capacity_ - length. (The length is never separately recorded, so this cannot be checked explicitly.) To minimize contention between puts and takes, the put side uses up all of its permits before transfering them from the take side. The take side just increments the count upon each take. Thus, most puts and take can run independently of each other unless the queue is empty or full. Initial value is queue capacity.



takeGuard_
final protected Object takeGuard_(Code)
Helper monitor. Protects and provides wait queue for takes



takeSidePutPermits_
protected int takeSidePutPermits_(Code)
Number of takes since last reconcile *




Constructor Detail
BoundedLinkedQueue
public BoundedLinkedQueue(int capacity)(Code)
Create a queue with the given capacity
exception:
  IllegalArgumentException - if capacity less or equal to zero



BoundedLinkedQueue
public BoundedLinkedQueue()(Code)
Create a queue with the current default capacity




Method Detail
allowTake
final protected void allowTake()(Code)
Notify a waiting take if needed *



capacity
public synchronized int capacity()(Code)
Return the current capacity of this queue *



extract
protected synchronized Object extract()(Code)
Main mechanics for take/poll *



insert
protected void insert(Object x)(Code)
Create and insert a node. Call only under synch on putGuard_



isEmpty
public boolean isEmpty()(Code)



offer
public boolean offer(Object x, long msecs) throws InterruptedException(Code)



peek
public Object peek()(Code)



poll
public Object poll(long msecs) throws InterruptedException(Code)



put
public void put(Object x) throws InterruptedException(Code)



reconcilePutPermits
final protected int reconcilePutPermits()(Code)
Move put permits from take side to put side; return the number of put side permits that are available. Call only under synch on puGuard_ AND this.



setCapacity
public void setCapacity(int newCapacity)(Code)
Reset the capacity of this queue. If the new capacity is less than the old capacity, existing elements are NOT removed, but incoming puts will not proceed until the number of elements is less than the new capacity.
exception:
  IllegalArgumentException - if capacity less or equal to zero



size
public synchronized int size()(Code)
Return the number of elements in the queue. This is only a snapshot value, that may be in the midst of changing. The returned value will be unreliable in the presence of active puts and takes, and should only be used as a heuristic estimate, for example for resource monitoring purposes.



take
public Object take() throws InterruptedException(Code)



Methods inherited from java.lang.Object
native protected Object clone() throws CloneNotSupportedException(Code)(Java Doc)
public boolean equals(Object obj)(Code)(Java Doc)
protected void finalize() throws Throwable(Code)(Java Doc)
final native public Class getClass()(Code)(Java Doc)
native public int hashCode()(Code)(Java Doc)
final native public void notify()(Code)(Java Doc)
final native public void notifyAll()(Code)(Java Doc)
public String toString()(Code)(Java Doc)
final native public void wait(long timeout) throws InterruptedException(Code)(Java Doc)
final public void wait(long timeout, int nanos) throws InterruptedException(Code)(Java Doc)
final public void wait() throws InterruptedException(Code)(Java Doc)

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