|
|
Boost : |
Subject: Re: [boost] [container][intrusive] Treap for Boost.Container?
From: Ian Emmons (iemmons_at_[hidden])
Date: 2013-03-18 17:41:15
On Mar 18, 2013, at 2:06 PM, Phil Endecott <spam_from_boost_dev_at_[hidden]> wrote:
> (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 invalidate other iterators in the same chunk, which is unacceptable. Any ideas?)
Isn't that how a deque is typically implemented, i.e., as a list of chunks?
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk