Tie::Cache - LRU Cache in Memory River stage three • 11 direct dependents • 416 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::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

Cache::FastMmap::Tie - Using Cache::FastMmap as hash River stage zero No dependents

Tie for Cache::FastMmap. Read `perldoc perltie`...

SUZUKI/Cache-FastMmap-Tie-0.03 - 28 Jan 2008 09:31:48 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

Cache::Memcached::Tie - Use Cache::Memcached::Fast like a hash. River stage zero No dependents

Memcached works like big dictionary... So why we can't use it as Perl hash?...

GUGU/Cache-Memcached-Tie-0.09 - 06 Dec 2010 20:41:20 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::Autoupdater - Cache that automatically updated River stage zero No dependents

Sometimes I need show in web rarely changes data. You may save it in memory, but you never don't know how long script will be work. For example, fcgi scripts may work few days or weeks, but counters of database tables or site settings may changed mor...

ANTONFIN/Tie-Cache-Autoupdater-0.21 - 10 Jul 2011 21:34:46 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::File - Access the lines of a disk file via a Perl array River stage three • 30 direct dependents • 142 total dependents

"Tie::File" represents a regular text file as a Perl array. Each element in the array corresponds to a record in the file. The first line of the file is element 0 of the array; the second line is element 1, and so on. The file is *not* loaded into me...

TODDR/Tie-File-1.00 - 14 Apr 2014 03:27:53 GMT

Tie::CacheHash - Maintains sorted lists of top entries River stage zero No dependents

Of course you can get the "top 100" entries of any perl hash: @top_keys = (sort my_sort_func keys %my_hash)[0..99]; But if your hash has more than a few thousand entries, that sort operation may take several seconds. And if you have tens of thousands...

JAMCC/Tie-CacheHash-0.50 - 10 Mar 2000 22:52:46 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::CacheRedisDB - Tie a hash to a Cache::RedisDB River stage zero No dependents

Tie::CacheRedisDB is to simplify using key-value storage by presenting a familiar interface while using a Redis backing store. Arguments to the tie should be presented in a single hash reference. can_miss The number of updates allowed between persist...

INSPIRE/Tie-CacheRedisDB-1.0.1 - 29 Jul 2016 20:44:43 GMT

Tie::Table - Maps relational tables into hashes River stage zero No dependents

This class is designed for mapping a table into a perl hash, which has keys (these are the primary keys of the table), and the values are the rows, represented by a hash. Basic Usage You can create Tie::Table objects for tables. You must specify a pa...

DLUX/Tie-Table-1.1.2 - 23 Oct 2001 22:57:40 GMT

TableMap - Maps relational tables into hashes River stage zero No dependents

This class is designed for mapping a table into a perl hash, which has keys (these are the primary keys of the table), and the values are the rows, represented by a hash. Basic Usage You can create TableMap objects for tables. You must specify a para...

DLUX/TableMap-1.0 - 19 Oct 2000 21:50:20 GMT

Tie::Hash::MultiKeyCache - aged cache or fifo River stage zero No dependents

This module provides a setable fixed size CACHE implemented as a hash with multiple keys per value. In normal use as new values are added to the CACHE and the CACHE size is exceeded, the least used items will drop from the CACHE. Particular items may...

MIKER/Tie-Hash-MultiKeyCache-0.02 - 27 Mar 2014 23:51:10 GMT

Tie::CHI - Tied hash to persistent CHI cache River stage zero No dependents

Tie::CHI implements a tied hash connected to a CHI cache. It can be used with any of CHI's backends (File, Memcached, DBI, etc.) Usage is one of the following: tie %cache, 'Tie::CHI', $hash_of_chi_options; tie %cache, 'Tie::CHI', $existing_chi_cache;...

JSWARTZ/Tie-CHI-0.02 - 07 Nov 2011 04:32:46 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::Func River stage one • 1 direct dependent • 1 total dependent

JONASBN/Tie-Tools-1.10 - 26 Sep 2014 06:30:45 GMT

41 results (0.03 seconds)