import p5-Tie-Cache-LRU

This is an implementation of a least-recently used (LRU) cache
keeping the cache in RAM.

ok merdely@
This commit is contained in:
sthen 2007-09-09 23:26:17 +00:00
parent a554adf9d4
commit 5c570055ab
4 changed files with 46 additions and 0 deletions

View File

@ -0,0 +1,20 @@
# $OpenBSD: Makefile,v 1.1.1.1 2007/09/09 23:26:17 sthen Exp $
COMMENT= LRU cache in memory
MODULES= cpan
DISTNAME= Tie-Cache-LRU-0.21
CATEGORIES= devel
BUILD_DEPENDS= ::devel/p5-enum \
::devel/p5-Carp-Assert \
::devel/p5-Class-Data-Inheritable \
::devel/p5-Class-Virtual
RUN_DEPENDS= ${BUILD_DEPENDS}
# perl
PERMIT_PACKAGE_CDROM= Yes
PERMIT_PACKAGE_FTP= Yes
PERMIT_DISTFILES_CDROM= Yes
PERMIT_DISTFILES_FTP= Yes
.include <bsd.port.mk>

View File

@ -0,0 +1,5 @@
MD5 (Tie-Cache-LRU-0.21.tar.gz) = EUiQ1aPB7Pb1HXQwhsU3Lw==
RMD160 (Tie-Cache-LRU-0.21.tar.gz) = KgQx2DYwG6vDB3JgmCgDvklgubQ=
SHA1 (Tie-Cache-LRU-0.21.tar.gz) = +MAYr5WS+2uiG+PVE+vXSoinT/Q=
SHA256 (Tie-Cache-LRU-0.21.tar.gz) = Sb0a8443mUm8MYHSpFv1r4WbxakCjFM5tBbtWYkETIU=
SIZE (Tie-Cache-LRU-0.21.tar.gz) = 142338

View File

@ -0,0 +1,9 @@
This is an implementation of a least-recently used (LRU) cache
keeping the cache in RAM.
A LRU cache is similar to the kind of cache used by a web browser.
New items are placed into the top of the cache. When the cache grows
past its size limit, it throws away items off the bottom. The trick
is that whenever an item is -accessed-, it is pulled back to the
top. The end result of all this is that items which are frequently
accessed tend to stay in the cache.

View File

@ -0,0 +1,12 @@
@comment $OpenBSD: PLIST,v 1.1.1.1 2007/09/09 23:26:17 sthen Exp $
${P5SITE}/Tie/
${P5SITE}/Tie/Cache/
${P5SITE}/Tie/Cache/LRU/
${P5SITE}/Tie/Cache/LRU.pm
${P5SITE}/Tie/Cache/LRU/Array.pm
${P5SITE}/Tie/Cache/LRU/LinkedList.pm
${P5SITE}/Tie/Cache/LRU/Virtual.pm
@man man/man3p/Tie::Cache::LRU.3p
@man man/man3p/Tie::Cache::LRU::Array.3p
@man man/man3p/Tie::Cache::LRU::LinkedList.3p
@man man/man3p/Tie::Cache::LRU::Virtual.3p