A hybrid approach might be useful. The Queue type in DataStructures.jl uses a linked list of array blocks. This could be extended to handle indexing and insertion/deletion in the middle, and should be pretty efficient and flexible.
Cheers, Kevin On Monday, August 11, 2014, Andreas Lobinger <[email protected]> wrote: > silly me ... a circular buffer is mod adressing.... > in the case of algorithms on polygons, there might be the case of > replacing an edge with a sequence of edges, and there people think a > linked-list would be the better idea. >
