Raymond Hettinger <raymond.hettin...@gmail.com> added the comment: This changes behavior so that hash() gets called twice for the key tuple, resulting in decreased performance.
In an earlier version of the lru_cache before the "with lock" was introduced, the try/except form was more atomic. It also worked well with dict subclasses that use __missing__ (which is bypassed with the LBYL style of lookup). I'll look at this more shortly -- thanks for the links to the other tracker items. ---------- priority: normal -> low _______________________________________ Python tracker <rep...@bugs.python.org> <http://bugs.python.org/issue13177> _______________________________________ _______________________________________________ Python-bugs-list mailing list Unsubscribe: http://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com
