An low latency, lock free, primitive bounded blocking queue backed by an int[].
This class mimics the interface of {@linkplain java.util.concurrent.BlockingQueue BlockingQueue},
however works with primitive ints rather than objects, so is unable to actually implement the
BlockingQueue.
This class takes advantage of the Unsafe.putOrderedObject, which allows us to create non-blocking code with
guaranteed writes.
These writes will not be re-orderd by instruction ...
| License | Apache 2.0 |
|---|---|
| Categories | Collections |
| Tags | concurrentqueuestructuresdatacollections |
| HomePage | http://www.boundedbuffer.co.uk 🔍 Inspect URL |
| Ranking | #802220 in MvnRepository (See Top Artifacts) #86 in Collections |
Related Books
| Java Generics and Collections: Fundamentals and Recommended Practices (2025) by Naftalin, Maurice, Wadler, Philip | |
| Mastering Java Collections: From Basics to Expert Proficiency (2024) by Smith, William | |
| Data Structures and the Java Collections Framework (2011) by Collins, William J. | |
| Java Generics and Collections: Speed Up the Java Development Process (2006) by Naftalin, ., Wadler, Philip |