Question

Hi I need an stl container which can be indexed like a vector but does not move old elements in the memory like a vector would do with resize or reserve (Unless I call reserve once at the beginning with a capacity enough for all elements, which is not good for me). (Note I do address binding to the elements so I expect the address of these elements to never change). So I’ve found this deque. Do you think it is good for this purpose? Important: I need only pushback but I need to grow the container on demand in small chunks.

Answer 1

std::deque “never invalidates pointers or references to the rest of the elements” when adding or removing elements at its back or front, so yes, when you only push_back the elements stay in place.