On 01/29/2013 08:55 PM, bearophile wrote:
Robert Schadek:
I have a Deque implementation that I really like. I would like to get
some comments on it.
http://dpaste.1azy.net/4bf119e7 dpaste does not run the
What's the structure of the data it keeps?
It's a simple growable circular queue.
I'd like a deque implemented as a growable circular queue (implemented
with a dynamic array) of pointers to fixed-sized chunks, plus a
"intrusive-like" freelist that keeps some of the last removed chunks.
Bye,
bearophile
