12-09-2013, 03:42 AM
If you're using any kind of STL container, then you're doing dynamic allocation. Lists and deques are the worst - they allocate from heap on each item added; vector only reallocates when it runs out of space and it allocates some extra items in advance, so usually it performs better. Even better is to use its reserve() function to grab enough items on the first allocation.
However, these are techniques for micro-optimization once you determine that the bottleneck really is in the containers. If you feel that the thing is too slow, use a profiler first to see what's going on.
However, these are techniques for micro-optimization once you determine that the bottleneck really is in the containers. If you feel that the thing is too slow, use a profiler first to see what's going on.