Subject: Re: [boost] [container][intrusive] Treap for Boost.Container?
From: Vadim Stadnik (vadimstdk_at_[hidden])
Date: 2013-03-18 16:01:09
On Tue, Mar 19, 2013 at 4:06 AM, Phil Endecott <
> (While I'm here.... does anyone know about a list-like container that has
> lower memory
> overhead when the data type is small, i.e. ints or chars? I was
> considering something
> using chunks like a std::list< std::vector<T> >, but insertion would
> other iterators in the same chunk, which is unacceptable. Any ideas?)
I think you can replace std::vector<T> for
Its advantage over as a singly linked list, for example, is that is
supports random access iterators. However, to solve the problem of iterator
invalidation elements are not stored contiguously in memory chunks.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk