149 results (0.925 seconds)
Tie::Cache - LRU Cache in Memory 1 ++

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 - Search in distribution

Tie::Cache::LRU - A Least-Recently Used cache 1 ++

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

MSCHWERN/Tie-Cache-LRU-20110205   (1 review) - 05 Feb 2011 04:02:24 GMT - Search in distribution

Tie::Hash::Cache::MRU - a simple MRU cache with a TIEHASH interface ++

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 - Search in distribution

Cache::FastMmap::Tie - Using Cache::FastMmap as hash ++

Tie for Cache::FastMmap. Read `perldoc perltie` AUTHOR Yuji Suzuki <yuji.suzuki.perl@gmail.com> LICENSE This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself. SEE ALSO Cache::FastMmap ...

SUZUKI/Cache-FastMmap-Tie-0.03 - 28 Jan 2008 09:31:48 GMT - Search in distribution

Cache::Memcached::Tie - Use Cache::Memcached::Fast like a hash. ++

Memcached works like big dictionary... So why we can't use it as Perl hash? AUTHOR Andrii Kostenko <andrey@kostenko.name> COPYRIGHT AND LICENSE This library is free software; you can redistribute it and/or modify it under the same terms as Perl itsel...

GUGU/Cache-Memcached-Tie-0.09 - 06 Dec 2010 20:41:20 GMT - Search in distribution

Tie::Cache::Autoupdater - Cache that automatically updated ++

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 - Search in distribution

Tie::Cache::LRU::Expires - Extends Tie::Cache::LRU with expiring ++

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 - Search in distribution

Tie::File - Access the lines of a disk file via a Perl array 9 ++

"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 - Search in distribution

Tie::Table - Maps relational tables into hashes ++

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 - Search in distribution

TableMap - Maps relational tables into hashes ++

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 - Search in distribution

Tie::CacheHash - Maintains sorted lists of top entries ++

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 - Search in distribution

Tie::FileLRUCache - A lightweight but robust filesystem based persistent LRU cache ++

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 - Search in distribution

Tie::Hash::MultiKeyCache - aged cache or fifo ++

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 - Search in distribution

Tie::Cacher - Cache a (sub)set of key/value pairs. Tie and OO interface. ++

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 - Search in distribution

Tie::Collection - A trivial implementaion of Tie::Cache by using a tied handle of a hash for storage. ++

Tie::Collection implements a trivial implementation of Tie::Cache by Joshua Chamas, that gets a tied hash handle to store the data. Assumption was that most common use will be disk storage, therfore the storage hash will probably be tied. Tie::Collec...

JONASBN/Tie-Tools-1.06 - 29 Oct 2007 21:31:08 GMT - Search in distribution

Tie::Collection - A trivial implementaion of Tie::Cache by using a tied handle of a hash for storage. ++

Tie::Collection implements a trivial implementation of Tie::Cache by Joshua Chamas, that gets a tied hash handle to store the data. Assumption was that most common use will be disk storage, therfore the storage hash will probably be tied. Tie::Collec...

SCHOP/htpl-3.14 - 28 Feb 2002 09:42:59 GMT - Search in distribution

TX - a simple template system based on Text::Template::Library ++

"Text::Template::Base" and "Text::Template::Library" are good at processing single templates. They lack the ability to manage sets of template files. This module adds that functionality in a (what I think) user friendly manner. The most important fun...

OPI/TX-0.09 - 14 Jun 2010 16:05:06 GMT - Search in distribution

CHI - Unified cache handling interface 31 ++

CHI provides a unified caching API, designed to assist a developer in persisting data for a specified period of time. The CHI interface is implemented by driver classes that support fetching, storing and clearing of data. Driver classes exist or will...

HAARG/CHI-0.58   (5 reviews) - 21 Jul 2013 14:23:23 GMT - Search in distribution

Tie::CHI - Tied hash to persistent CHI cache 1 ++

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 - Search in distribution

Cache - the Cache interface ++

The Cache modules are designed to assist a developer in persisting data for a specified period of time. Often these modules are used in web applications to store data locally to save repeated and redundant expensive calls to remote machines or databa...

SHLOMIF/Cache-2.10 - 13 May 2014 11:26:04 GMT - Search in distribution




Hosting generously
sponsored by Bytemark