This tiny module exports a single function, "list", which dereferences the arrayref or hashref passed to it as an argument. "list $argument" is basically a synonym for "@{$argument}", but is less awkward when $argument is a longer expression part of ...

Allows Jaap to do twisted things. http://zoidberg.sf.net/...

Ref::Util introduces several functions to help identify references in a smarter (and usually faster) way. In short: # conventional approach # with Ref::Util ref( $foo ) eq 'ARRAY' is_plain_arrayref( $foo ) use Scalar::Util qw( reftype ); reftype( $fo...

This module provides the new keywords "qwa" and "qwh". qwa "qwa" is a quoting operator like q or qq. It works like "qw" in that it parses its contents as a list of whitespace separated words, but instead of turning them into a list, it turns them int...

Ref::Store provides an efficient and worry-free way to index objects by arbitrary data - possibly other objects, simple scalars, or whatever. It relies on magic and such to ensure that objects you put in the lookup table are not maintained there unle...

Unlike CHI which attempts to address the problem of caching things persistently, this module implements in memory caching, designed primarily for shared references in memory. This collection of classes implements a number of semi related algorithms....

This module exports keywords that provide an explicit syntax for creation of arrayrefs and hashrefs in contexts where the ordinary perl syntax leads to a punctuation overdose....

This module changes the behavior of the builtin function ref(). If ref() is called on an object that has requested an overloaded ref, the object's "->ref" method will be called and its return value used instead....

Class::Ref provides an OO wrapping layer around Hash and Array references. Part of the magic is that it does this deeply and across array/hash boundaries....

Ref::Util::XS is the XS implementation of Ref::Util, which provides several functions to help identify references in a more convenient way than the usual approach of examining the return value of "ref". You should use Ref::Util::XS by installing Ref:...

This module provides a pure-Perl implementation of the functions in Ref::Util. Ref::Util:PP will be used automatically if Ref::Util is installed on a system with no C compiler, but you can force its usage by setting either $Ref::Util::IMPLEMENTATION ...

This algorithm is an implementation of http://www.almaden.ibm.com/cs/people/dmodha/clockfast.pdf. See also Cache::Ref::CART which is probably more appropriate for random access work loads. CAR balances between an MFU like policy and an MRU like polic...

This is an implementation of the least recently used expiry policy. It provides both an array and a doubly linked list based implementation. See Cache::Ref for a discussion....

Heap::Elem::Ref is used to wrap object reference values into an element that can be managed on a heap. Each referenced object must have a method *cmp* which can compare itself with any of the other objects that have references on the same heap. These...

This is a very naive cache algorithm, it saves cache sets until the cache is full, at which point all additional saves which aren't a value update are discarded immediately. For very predictable workflows this is potentially a good fit, provided the ...

This algorithm is an extension to Cache::Ref::CAR that has temporal filtering on the upgrading from MRU to MFU pool. This means that two subsequent accesses to the same key do not automatically make it viable for long term caching, to get upgraded to...

These are used by Test2::Tools to inspect, render, or manipulate references....

A storage object for a general bibliographic reference (a citation). See its place in the class hierarchy in http://www.ebi.ac.uk/~senger/openbqs/images/bibobjects_perl.gif Attributes The following attributes are specific to this class, and they are ...