18 Mar
2013
18 Mar
'13
9:41 p.m.
On Mar 18, 2013, at 2:06 PM, 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 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?