NAME

Hash::MoreUtils - Provide the stuff missing in Hash::Util

SYNOPSIS

  use Hash::MoreUtils qw(slice slice_def slice_exists slice_grep
                         hashsort
                        );

DESCRIPTION

Similar to List::MoreUtils, Hash::MoreUtils contains trivial but commonly-used functionality for hashes.

slice HASHREF, LIST

Returns a hash containing the (key, value) pair for every key in LIST.

slice_def HASHREF, LIST

As slice, but only includes keys whose values are defined.

slice_exists HASHREF, LIST

As slice but only includes keys which exist in the hashref.

slice_grep BLOCK HASHREF, LIST

As slice, with an arbitrary condition.

Unlike grep, the condition is not given aliases to elements of anything. Instead, %_ is set to the contents of the hashref, to avoid accidentally auto-vivifying when checking keys or values. Also, 'uninitialized' warnings are turned off in the enclosing scope.

hashsort

  my @array_of_pairs  = hashsort \%hash;
  my @pairs_by_length = hashsort sub { length($a) <=> length($b) }, \%hash;

Returns the (key, value) pairs of the hash, sorted by some property of the keys. By default, sorts the keys with cmp.

I'm not convinced this is useful yet. If you can think of some way it could be more so, please let me know.

AUTHOR

Hans Dieter Pearcey, <hdp@cpan.org>

BUGS

Please report any bugs or feature requests to bug-hash-moreutils@rt.cpan.org, or through the web interface at http://rt.cpan.org/NoAuth/ReportBug.html?Queue=Hash-MoreUtils. I will be notified, and then you'll automatically be notified of progress on your bug as I make changes.

ACKNOWLEDGEMENTS

COPYRIGHT & LICENSE

Copyright 2005 Hans Dieter Pearcey, all rights reserved.

This program is free software; you can redistribute it and/or modify it under the same terms as Perl itself.