Search results for "dist:Tie-Cache-LRU tie::cache::lru"
Tie::Cache::LRU - A Least-Recently Used cache
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 UTC
Tie::Cache::LRU::Array - Tie::Cache::LRU implemented using arrays
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 UTC
Tie::Cache::LRU::Virtual - Virtual base class for Tie::Cache::LRU::*
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 UTC
Tie::Cache::LRU::LinkedList - Tie::Cache::LRU implemented using a linked list
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 UTC