6 ms·
now i remember why I went with the old linked list implementation. with the std::list, everytime I refreshed a node... i did a copy. basically to the tune of
by mohaps 10y ago
now i remember why I went with the old linked list implementation.
with the std::list, everytime I refreshed a node... i did a copy.
basically to the tune of list.push_back(*iter) where as I wanted to keep it as a simple unlink and relink of the node
copy of the comment: https://news.ycombinator.com/item?id=12391069 https://news.ycombinator.com/item?id=12391069
- en4bz 10y agoTo swap nodes in the list you need to use splice like this: keys_.splice(keys_.begin(), keys_, iter->second); Where iter is from the cache lookup.