popular collection of scripts for all

• Categories
• Tags

Functional.pm Hits: 5 ***** 0.0 CGI::Minimal Hits: 11 ***** 0.0 Class:NamedParms Hits: 8 ***** 0.0 Class::ParmList Hits: 11 ***** 0.0 Functional.pm is a Perl CGI::Minimal provides a Class:NamedParms provides key Class::ParmList is a general module which adds features lightweight alternative to name checking for named named parameter list parser. which make Perl slightly the CGI.pm module shipped accessor parameters. This It handles default values, more functional-like by with Perl. It is allows the use of a generic required vs allowed adding more functional-like approximately 1/6th the size 'get/set' type parameterized distinctions, optional name functions to Perl, such as of CGI.pm but provides accessor while automatically lexical checking, multiple foldl and foldr, as well as largely compatible access to catching accidental retrieval, and error the use of infinite lists. form decoding and a small mis-spellings and usage of reporting. It also works   number of other tasks uninitialized parameters. well as a complement to   essential to writing CGI This catches a large class Class::NamedParms.   scripts in Perl. Designed of programming errors     for people who are without requiring a new     comfortable working closely accessor for every object     with the HTTP protocal and parameter.     writing HTML directly.       Supports file uploading as       just another transparently       decoded form field.     Date: Sep, 20 1999 Date: Sep, 16 1999 Date: Sep, 16 1999 Date: Sep, 16 1999

Search::InvertedIndex Hits: 9 ***** 0.0 Tie::DB_File::SplitHash Hits: 10 ***** 0.0 Tie::FileLRUCache Hits: 10 ***** 0.0 Tie::ListKeyedHash Hits: 10 ***** 0.0 Search::InvertedIndex is A Tie::DB_File::SplitHash is Tie::FileLRUCache provides a This is an experimental Perl general purpose inverted designed for support of file persistent filesystem based module that allows you to indexing system suitable for size limitted OSes. It LRU cache. It uses the 'last use lists as the keys for medium scale searching. By transparently splits a accessed' timestamp multi-level hashes. mapping 'keys' to 'indexes' DB_File database into as generated by the file system Excellent for parse tree it provides ultra-fast look many distinct files as to determine the 'oldest' generation and other similar ups of all 'indexes' desired. It also distributes cache entry and discards the tasks where you need to containing specific 'keys'. hash entries between the oldest cache entries when create very deep trees or This produces highly files using a randomization needed to stay under the the tree depth is not known scalable behavior where algorithm. It has the effect -keep_last limit. If you in advance. A real thousands, or even millions of allowing DB_File hashes store thing very fast (such performance win on very deep of records can be searched to grow to the full size of that many entries receive trees over 'walking the extremely quickly. the partition. Requires the _same_ time stamp), it tree' starting from the root   'Digest::SHA1' and 'DB_File' is essentially a coin toss node.   to be installed. which entry within a single       timestamped second gets       purged from the cache to       make room for new ones.   Date: Sep, 16 1999 Date: Sep, 16 1999 Date: Sep, 16 1999 Date: Sep, 16 1999