"Hash::Util" and "Hash::Util::FieldHash" contain special functions for manipulating hashes that don't really warrant a keyword. "Hash::Util" contains a set of functions that support restricted hashes. These are described in this document. "Hash::Util...

"Hash::Util" and "Hash::Util::FieldHash" contain special functions for manipulating hashes that don't really warrant a keyword. "Hash::Util" contains a set of functions that support restricted hashes. These are described in this document. "Hash::Util...

Hash::Util::Pick is the non-destructive utilities for picking hash...

This module provides some syntactic sugar for merging simple hashes with a function....

A word on terminology: I shall use the term *field* for a scalar piece of data that a class associates with an object. Other terms that have been used for this concept are "object variable", "(object) property", "(object) attribute" and more. Especia...

A word on terminology: I shall use the term *field* for a scalar piece of data that a class associates with an object. Other terms that have been used for this concept are "object variable", "(object) property", "(object) attribute" and more. Especia...

This is a copy of Hash::Merge at version 2.00. See https://metacpan.org/pod/release/REHSACK/Hash-Merge-0.200/lib/Hash/Merge .pm Please don't use this as it may be removed at any time....

Under older perls this module provides a drop-in compatible API to Hash::Util::FieldHash using perltie. When Hash::Util::FieldHash is available it will use that instead. This way code requiring field hashes can benefit from fast, robust field hashes ...

Efficiently access hash values using pop, shift or array index. "$hash->[$idx]" works much faster, than standard "( values $hash->%* )[$idx]"....

See Hash::Util::FieldHash::Compat for the documentation....

Similar to List::MoreUtils, "Hash::MoreUtils" contains trivial but commonly-used functionality for hashes. The primary focus for the moment is providing a common API - speeding up by XS is far away at the moment....

Often in code we find lots of copy/paste code during prepare a hash or hash reference. That data we got from other structures, objects or constants. * We map hashes that not match exactly to the expected API. * Or the method names, we call, matching ...

Get the keys to a hashref sorted by their values....

Ein Objekt dieser Klasse repräsentiert einen *zugriffssicheren* Hash, d.h. einen Hash, dessen Schlüsselvorrat bei der Instantiierung festgelegt wird. Ein lesender oder schreibender Zugriff mit einem Schlüssel, der nicht zum Schlüsselvorrat gehört, is...

This module provides functional and OO interfaces which can be used to flatten, unflatten and merge nested hashrefs. Unless noted, the functions listed below are also available as methods. Options provided to the Hash::Fold constructor can be supplie...

An instance of "Hash::Type" encapsulates a collection of field names, and is used to generate tied hashes, implemented internally as arrayrefs, and sharing the common list of fields. The original motivation for this design was to spare memory, since ...

This HASH will store it's values without increase the reference count. This can be used to store objects but without interfere in the DESTROY mechanism, since the reference in this HASH won't count....