How to implement immutable ring buffer?

[drug via Digitalmars-d-learn]

On 27.05.2015 11:10, Daniel Kozák via Digitalmars-d-learn wrote:
>
> On Wed, 27 May 2015 09:20:52 +0000
> drug via Digitalmars-d-learn <digitalmars-d-learn at puremagic.com> wrote:
>
>> Could somebody share his thoughts on the subject?
>> Would it be efficient? Is it possible to avoid memory copying to
>> provide immutability? To avoid cache missing ring buffer should be
>> like array, not list, so it's possible that the whole buffer should
>> be moved. Is it neccessary to be real immutable, may be some form of
>> fake immutabitiy is enough?
>> I'd like to try immutability in my app, and ring buffer is what I
>> don't know how to use in the realm of immutability.
>>
>> Thanks
>
> Maybe http://dlang.org/phobos/std_typecons.html#.Rebindable could help
> you.
>
I guess it won't be efficient, because it would be ring buffer of (in 
some form) pointers. It's suitable if elements of the buffer are 
processed independently each other. In other case cache misses are 
provided, I think.