std::forward_list::reverse std::forward_list::sort std::forward_list::splice_after std::forward_list::swap std::forward_list::unique std::get(std::array) std::hash std::list std::list::assign std::list::back std::list::begin std::list::cbegin std::list::cend std::list::clear...
reverse.pushbacki std::node*>nodes; while temp spin(First {; nodes._back(oldFirst);exchangei->, temp); // lockall thenode *temp = spinDummy; exchange(oldFirst>next,i Order store;temp oldFirst temp;
= mmp.end(); ++it) std::cout<< it->first <<":"<< it->second << std::endl; //Do something with iterator //Backward iterator for loop: it would loop through last element to first element //it will be a std::map< int, int >::reverse_iterator for (auto it = mmp.rbegin()...