Tie::Cache::LRU::Array3pm
Tie::cache::lru implemented using arrays
Usage
use Tie::Cache::LRU::Array;tie %cache, 'Tie::Cache::LRU::Array', 500;...the rest is as Tie::Cache::LRU...
Overview
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 (where small <= ??) because the work is done inside perl (ie. higer big O, lower constant). If nothing else, it should use less memory.
Releases
Unchanged in 2 releases since Debian 12 (Bookworm).