Following on from a previous question relating to heap usage restrictions, I\'m looking for a good standard C++ class for dealing with big arrays of data in a way that is bo
Have you tried using an std::deque? Unlike a std::vector, which uses one huge heap allocation, deque usually allocates in small chunks, but still provides amortised constant time indexing via operator[].