Re:Show HN: A header only C++11 LRU Cache template class, wi...
by en4bz on Tuesday August 30, 2016 @10:39AM
(#12390557)
You could have used std::list iterators instead of raw pointers to a node in the map to implement that.
[ Parent
| on HN ]
Re:Show HN: A header only C++11 LRU Cache template class, wi...
by mohaps on Tuesday August 30, 2016 @11:37AM
(#12391092)
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
Re:Show HN: A header only C++11 LRU Cache template class, wi...
by en4bz on Tuesday August 30, 2016 @11:45AM
(#12391161)
To 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.
Re:Show HN: A header only C++11 LRU Cache template class, wi...
by mohaps on Tuesday August 30, 2016 @10:40AM
(#12390564)
yeah, saw the gist posted by quinnftw. that actually is a better way to do what I'm doing. Will update that along with the
cache.remove(const Key& k, F deleteCallback) method.
Thanks for the feedback