Question

Could someone suggest good CircularBuffer implementation? I need both “not thread-safe” and “thread-safe” versions. I expect following operations:

• ability to provide size of the buffer when creating
• adding elements
• iterating elements
• removing elements while iterating
• probably removing elements

I expect implementation to be highly optimized in terms of speed and used memory, average and worst times etc.

I expect “not thread-safe” implementation to be extremely fast. I expect “thread-safe” implementation to be fast, probably using “lock-free code” for synchronization and it’s ok to have some restrictions if this is required for speed.

If buffer is too small to store new (added) element it’s ok to silenty override existent element or raise exception.

Should I use disruptor.net?

Adding link to a good example Disruptor.NET example

Answer 1

Not thread safe:

System.Collections.Generic.Queue

Thread safe:

System.Collections.Concurrent.ConcurrentQueue

or

System.Collections.Concurrent.BlockingCollection (which uses a concurrent queue by default internally)

Although technically you really shouldn’t use the term “thread safe”. It’s simply too ambiguous. The first is not designed to be used concurrently by multiple threads, the rest are.