Is there non-concurrent (other than ArrayBlockingQueue) standard implementation of cyclic queue?

Question

Is there a standard fast Java queue/circular-buffer structure like ArrayBlockingQueue, backed by an array, but without any concurrency synchronisation overhead?

BTW Disruptor is significantly faster than the built in ring buffers if you need higher performance or flexibility. — Peter Lawrey, Oct 27 '13 at 20:09
@PeterLawrey +1 but question in this case is about very small proof-of-concept in image manipulation (store last X pixels while iterating) and I just wanted to save some time on cyclic array implementation — Piotr Müller, Oct 27 '13 at 21:29

score 4 · Accepted Answer · answered Oct 27 '13 at 20:05

4

Yes, there is, and it's called ArrayDeque

answered Oct 27 '13 at 20:05

siledh

3,268
2
16
29

Is it thread-safe? But the docs say _They are not thread-safe_. – siledh Oct 27 '13 at 20:09
+1 Sorry, my mistake. It is not thread safe and isn't slowed down by this. – Peter Lawrey Oct 27 '13 at 20:12

score 0 · Answer 2 · edited May 23 '17 at 12:23

0

If you need fixed-size queue / ring-buffer without synchronization it seems you would need to write it yourself.
You could also use some alternative options such as apache commons CircularFifoBuffer.
Please see more details here.

edited May 23 '17 at 12:23

Community

1
1

answered Oct 27 '13 at 20:40

kiruwka

9,250
4
30
41

Is there non-concurrent (other than ArrayBlockingQueue) standard implementation of cyclic queue?

2 Answers2