jessenoller.com

Python Cook­book : LRU cache decorator

Looks inter­est­ing — from the description:

One-line dec­o­ra­tor call adds caching to func­tions with hash­able argu­ments and no key­word argu­ments. When the max­i­mum size is reached, the least recently used entry is dis­carded — appro­pri­ate for long-running processes which can­not allow caches to grow with­out bound. Includes built-in per­for­mance instrumentation.

(Via overview by lin­uxer (on programming.reddit.com).)

Python Cook­book : LRU cache decorator Looks inter­est­ing — from the description: One-line dec­o­ra­tor call adds caching to func­tions with hash­able argu­ments and no key­word argu­ments. When the max­i­mum size...