On Tue, 24 Sep 2002, Leopold Toetsch wrote: > Sean O'Rourke wrote: > > If we expect these (especially shift) to be as frequent as push/pop, and > > we want fast indexing as well, then maybe something like the SGI STL > > implementation of a dequeue (dequeueue?) would be best: keep an array of > > (pointers to) fixed-size chunks (rather than intlist's linked-list). > > Exactly this is, what my recent patch actually did: list->chunk_list > holds pointers to chunks, an index lookup is one "div" more expensive > then in array.
It's not in #17549. Is it in an earlier patch? /s
