8e64585139
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. So, the cache only "remembers" the last written entries, up to the size of the cache. This can be especially useful if you access great amounts of data, but only access a minority of the data a majority of the time. ok simon@
15 lines
288 B
Makefile
15 lines
288 B
Makefile
# $OpenBSD: Makefile,v 1.1.1.1 2007/09/25 22:11:54 merdely Exp $
|
|
COMMENT= LRU cache in memory
|
|
|
|
MODULES= cpan
|
|
DISTNAME= Tie-Cache-0.17
|
|
CATEGORIES= devel
|
|
|
|
# perl
|
|
PERMIT_PACKAGE_CDROM= Yes
|
|
PERMIT_PACKAGE_FTP= Yes
|
|
PERMIT_DISTFILES_CDROM= Yes
|
|
PERMIT_DISTFILES_FTP= Yes
|
|
|
|
.include <bsd.port.mk>
|