Tie::Cache::LRU - A Least-Recently Used cache River stage two • 8 direct dependents • 17 total dependents

NOTE There are no plans to update this module. Please consider using CHI or other caching framework. 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 br...

MSCHWERN/Tie-Cache-LRU-20150301 - 01 Mar 2015 20:26:39 GMT

Tie::Cache::LRU::Array - Tie::Cache::LRU implemented using arrays River stage two • 8 direct dependents • 17 total dependents

This is an alternative implementation of Tie::Cache::LRU using Perl arrays and built-in array operations instead of a linked list. The theory is that even though the algorithm employed is more expensive, it will still be faster for small cache sizes ...

MSCHWERN/Tie-Cache-LRU-20150301 - 01 Mar 2015 20:26:39 GMT

Tie::Cache::LRU::Expires - Extends Tie::Cache::LRU with expiring River stage zero No dependents

This is an expiring LRU cache, using Tie::Cache::LRU. Each entry in this cache expires after 'EXPIRES' seconds (default 3600). The cache is in RAM (see Tie::Cache::LRU). ENTRIES provides the maximum number of entries in the Tie::Cache::LRU cache. It ...

OESTERHOL/Tie-Cache-LRU-Expires-0.55 - 19 Jul 2012 21:47:45 GMT

Tie::Cache::LRU::Virtual - Virtual base class for Tie::Cache::LRU::* River stage two • 8 direct dependents • 17 total dependents

This is a pure virtual base class defining the public methods of Tie::Cache::LRU. It is intended that you will subclass off of it and fill in the missing/incomplete methods. You must implement the entire hash interface. TIEHASH CLEAR FETCH STORE EXIS...

MSCHWERN/Tie-Cache-LRU-20150301 - 01 Mar 2015 20:26:39 GMT

Tie::Cache::LRU::LinkedList - Tie::Cache::LRU implemented using a linked list River stage two • 8 direct dependents • 17 total dependents

This is an implementation of Tie::Cache::LRU using a linked list structure. Theoretically, this is an efficient algorithm, however it may be lose out in smaller cache sizes (where small <= ??) due to its relatively high constant....

MSCHWERN/Tie-Cache-LRU-20150301 - 01 Mar 2015 20:26:39 GMT

Tie::FileLRUCache - A lightweight but robust filesystem based persistent LRU cache River stage one • 1 direct dependent • 2 total dependents

Provides a lightweight persistent filesystem based LRU cache. It uses the 'last accessed' timestamp generated by the file system to determine the 'oldest' cache entry and discards the oldest cache entries when needed to stay under the -keep_last limi...

SNOWHARE/Tie-FileLRUCache-1.05 - 14 Sep 2005 19:57:20 GMT

Tie::Cache - LRU Cache in Memory River stage three • 10 direct dependents • 360 total dependents

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...

CHAMAS/Tie-Cache-0.21 - 19 May 2014 15:53:49 GMT

Tie::Hash::LRU - LRU hashes for Perl (XS implementation) River stage two • 4 direct dependents • 18 total dependents

This module provides XS implementation of the LRU algorithm. It merely puts hash entry in front of the queue each time this entry accessed. Tied hashes have significant overhead and cannot perform as fast as a simple subroutine call. But the benefits...

ZZZ/Tie-Hash-LRU-0.05 - 27 Nov 2011 18:46:20 GMT

Tie::Cacher - Cache a (sub)set of key/value pairs. Tie and OO interface. River stage zero No dependents

This module implements a least recently used (LRU) cache in memory through a tie and a OO interface. Any time a key/value pair is fetched or stored, an entry time is associated with it, and as the cache fills up, those members of the cache that are t...

THOSPEL/Tie-Cacher-0.09 - 07 Jun 2004 01:31:50 GMT

Tie::Hash::Cache::MRU - a simple MRU cache with a TIEHASH interface River stage zero No dependents

Create a tied hash interface that memoizes only so many entries. Expiry is obtained by keeping two cache hashes, and throwing out the old one when the new one gets more than SIZE buckets filled. this is crude but effectively avoids all the bookkeepin...

DAVIDNICO/Tie-Hash-Cache-MRU-0.02 - 10 Dec 2004 21:32:09 GMT

10 results (0.036 seconds)