Antoine Pitrou added the comment: Le 06/08/2014 21:19, Raymond Hettinger a écrit : > > I don't think so at all. The LRU cache we have now is plenty > efficient for its intended use cases (caching I/O bound functions and expensive functions). If is only unsuitable for functions that are already blazingly fast.
This is an unrealistic simplification. Many functions can be either expensive or blazingly fast, depending on their input (typical examples are re.compile(), math.factorial()...). But the decision of applying the lru_cache decorator is a compile-time binary decision: it cannot encode the varying properties of the function depending on its inputs. ---------- _______________________________________ Python tracker <rep...@bugs.python.org> <http://bugs.python.org/issue14373> _______________________________________ _______________________________________________ Python-bugs-list mailing list Unsubscribe: https://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com
