I suspect that using a circular buffer <http://en.wikipedia.org/wiki/Circular_buffer> might be a more efficient implementation. You can even grow it on demand to handle arbitrary capacity. The way Julia's 1-d arrays are implemented, this will give you an efficient and flexible implementation.
On Mon, Aug 11, 2014 at 4:29 AM, Andreas Lobinger <[email protected]> wrote: > Hello colleagues, > > i'm not really into this CS term, so i might ask something stupid... > > What would you recommend to use for a circular list, a doubly-linked-list? > > Wishing a happy day, > Andreas > > > > >
