Hash::Util - A selection of general-utility hash subroutines River stage five • 10313 direct dependents • 30438 total dependents

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

XSAWYERX/perl-5.30.0 - 22 May 2019 09:35:50 GMT

Hash::Util - A selection of general-utility hash subroutines River stage five • 10313 direct dependents • 30438 total dependents

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

SHAY/perl-5.30.1 - 10 Nov 2019 14:14:00 GMT

Hash::Util::Pick - The non-destructive utilities for picking hash River stage one • 1 direct dependent • 1 total dependent

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

PINE/Hash-Util-Pick-0.13 - 27 May 2019 13:32:23 GMT

Hash::Util::FieldHash - Support for Inside-Out Classes River stage five • 10313 direct dependents • 30438 total dependents

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

SHAY/perl-5.30.1 - 10 Nov 2019 14:14:00 GMT

Hash::Util::FieldHash - Support for Inside-Out Classes River stage five • 10313 direct dependents • 30438 total dependents

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

XSAWYERX/perl-5.30.0 - 22 May 2019 09:35:50 GMT

RapidApp::Util::Hash::Merge - Merges arbitrarily deep hashes into a single hash River stage one • 4 direct dependents • 4 total dependents

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

VANSTYN/RapidApp-1.3201 - 25 Nov 2019 09:22:15 GMT

Pcore::Util::Hash::LRU River stage two • 12 direct dependents • 12 total dependents

ZDM/Pcore-v0.107.0 - 06 Dec 2019 10:45:25 GMT

Hash::Util::FieldHash::Compat - Use Hash::Util::FieldHash or ties, depending on availability River stage three • 16 direct dependents • 303 total dependents

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

ETHER/Hash-Util-FieldHash-Compat-0.11 - 13 Jun 2016 21:59:38 GMT

Pcore::Util::Hash::Multivalue River stage two • 12 direct dependents • 12 total dependents

ZDM/Pcore-v0.107.0 - 06 Dec 2019 10:45:25 GMT

lib/Pcore/Util/Hash.pm River stage two • 12 direct dependents • 12 total dependents

ZDM/Pcore-v0.107.0 - 06 Dec 2019 10:45:25 GMT

Pcore::Util::Hash::HashArray - efficiently access hash values using pop, shift or array index. River stage two • 12 direct dependents • 12 total dependents

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

ZDM/Pcore-v0.107.0 - 06 Dec 2019 10:45:25 GMT

Hash::Util::FieldHash::Compat::Heavy - Emulate Hash::Util::FieldHash using Tie::RefHash etc River stage three • 16 direct dependents • 303 total dependents

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

ETHER/Hash-Util-FieldHash-Compat-0.11 - 13 Jun 2016 21:59:38 GMT

Hash::MoreUtils - Provide the stuff missing in Hash::Util River stage three • 11 direct dependents • 218 total dependents

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

REHSACK/Hash-MoreUtils-0.06 - 08 Jun 2018 13:35:03 GMT

Hash::Map - Manipulate hashes map like River stage zero No dependents

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

STEFFENW/Hash-Map-0.016 - 26 Jun 2016 16:39:22 GMT

Quiq::Hash - Zugriffssicherer Hash mit automatisch generierten Attributmethoden River stage zero No dependents

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

FSEITZ/Quiq-1.166 - 29 Nov 2019 14:25:54 GMT

Sort::Hash - get the keys to a hashref sorted by their values. River stage one • 1 direct dependent • 1 total dependent

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

BRAINBUZ/Sort-Hash-2.05 - 28 Jul 2014 16:44:56 GMT

Hash::Fold - flatten and unflatten nested hashrefs River stage zero No dependents

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

CHOCOLATE/Hash-Fold-v1.0.0 - 11 Mar 2019 18:44:20 GMT

Hash::Type - restricted, ordered hashes as arrays tied to a "type" (shared list of keys) River stage one • 1 direct dependent • 2 total dependents

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

DAMI/Hash-Type-2.00 - 06 May 2016 20:06:20 GMT

Hash::NoRef - A HASH that store values without increase the reference count (weak references). River stage one • 1 direct dependent • 4 total dependents

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

GMPASSOS/Hash-NoRef-0.03 - 10 May 2004 01:55:45 GMT

Hash::Abbrev - Text::Abbrev with aliases River stage zero No dependents

ASG/Hash-Abbrev-0.01 - 21 May 2011 20:29:42 GMT

31 results (0.036 seconds)