20596f610e
Based on PR#41614 by Uwe Klaus. This module implements a least recently used (LRU) cache in memory through a tie interface. Any time data is stored in the tied hash, that key/value pair has an entry time associated with it, and as the cache fills up, those members of the cache that are the oldest are removed to make room for new entries.
5 lines
251 B
Text
5 lines
251 B
Text
$NetBSD: distinfo,v 1.1.1.1 2010/03/15 09:05:11 obache Exp $
|
|
|
|
SHA1 (Tie-Cache-0.17.tar.gz) = 48a89321eec6f8c53d361693c03e54b5f4a687c7
|
|
RMD160 (Tie-Cache-0.17.tar.gz) = 7e3fd1fe9a00c4fe1627c3768d08b476c1deaf93
|
|
Size (Tie-Cache-0.17.tar.gz) = 11627 bytes
|