¡@
c++ Programming Glossary: value_tA std::map that keep track of the order of insertion? http://stackoverflow.com/questions/1098175/a-stdmap-that-keep-track-of-the-order-of-insertion In your case it could look like the following struct value_t string s int i struct string_tag typedef multi_index_container.. s int i struct string_tag typedef multi_index_container value_t indexed_by random_access this index represents insertion order..
Reorder vector using a vector of indices http://stackoverflow.com/questions/838384/reorder-vector-using-a-vector-of-indices v typedef typename iterator_traits value_iterator value_type value_t typedef typename iterator_traits order_iterator value_type.. typedef typename iterator_traits value_iterator value_type value_t typedef typename iterator_traits order_iterator value_type index_t.. value_t typedef typename iterator_traits order_iterator value_type index_t typedef typename iterator_traits order_iterator difference_type..
|