Raymond Hettinger added the comment: Have you seen something like this done for other implementations of LRU caches?
To me, the idea seems to be at odds with the idea of retaining only the last n calls in memory -- suggesting that a refreshing an outdated entry is cheaper than retiring it to disk and retrieving it later (as you might do with a shelf or database). ---------- assignee: -> rhettinger _______________________________________ Python tracker <rep...@bugs.python.org> <http://bugs.python.org/issue17528> _______________________________________ _______________________________________________ Python-bugs-list mailing list Unsubscribe: https://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com
