query: C++11 faster std::vector iteration
positive_passages.docid: 149760
positive_passages.text: Is the ranged based for loop beneficial to performance?
negative_passages.docid: 133394
negative_passages.text: A std::map that keep track of the order of insertion?
negative_passages.docid: 68736
negative_passages.text: How do I erase an element from std::vector by index?
negative_passages.docid: 58268
negative_passages.text: Erasing elements in stl::vector by using indexes
negative_passages.docid: 100743
negative_passages.text: small string optimization for vector?
negative_passages.docid: 134793
negative_passages.text: Erasing from a std::vector while doing a for each?
negative_passages.docid: 143465
negative_passages.text: Is there a dereference_iterator in the STL?
negative_passages.docid: 84111
negative_passages.text: Does C++11 std::function limit the number of arguments a function pointer can have?
negative_passages.docid: 81159
negative_passages.text: How do you iterate backwards through an STL list?
negative_passages.docid: 6603
negative_passages.text: "Indexing" a vector
negative_passages.docid: 138701
negative_passages.text: Compiler hang when initializing large std::arrays
negative_passages.docid: 49319
negative_passages.text: Converting std::string to std::vector
negative_passages.docid: 87525
negative_passages.text: Cost of using std::map with std::string keys vs int keys?
negative_passages.docid: 92820
negative_passages.text: std::vector of an array
negative_passages.docid: 114383
negative_passages.text: how to cast thrust::device_vector to raw pointer
negative_passages.docid: 29491
negative_passages.text: Garbage Collection in C++11
negative_passages.docid: 46139
negative_passages.text: Which, if any, C++ compilers do tail-recursion optimization?