I am looking for a similar library as ArrayBlockingQueue. Just that, I don't need the thread safe feature (For better performance purpose) offered in it, as it is using ReentrantLock in the offer(E e) method.
What I would like is
I don't find ArrayQueue in Java standard library. Or, am I missing any classes?
There is a BoundedFiFoBuffer in the Common.Collections with the following properties:
The BoundedFifoBuffer is a very efficient implementation of Buffer that is of a fixed size.
The removal order of a BoundedFifoBuffer is based on the insertion order; elements are removed in the same order in which they were added.
The iteration order is the same as the removal order.
Note that this implementation is not synchronized.
BufferOverflowException is thrown on attempt to add elements to the full buffer.
Just use ArrayList with simple check for 'fullness' on add? Or write simple wrapper around it.
Use ConcurrentLinkedQueue (see http://download.oracle.com/javase/6/docs/api/java/util/concurrent/ConcurrentLinkedQueue.html for more details)
http://commons.apache.org/collections/api-2.1.1/org/apache/commons/collections/BoundedFifoBuffer.html Should suit your needs. Be careful as it always returns true from add and instead will throw if you exceed the bounds
I would just use an ArrayBlockingQueue unless you know it won't be fast enough. If you are sending millions of objects per second, you could consider batching them to reduce overhead. If you have only hundreds of thousands per second its unlikely to matter.
