/usr/share/perl5/Data/Perl/Role/Collection/Hash.pm is in libdata-perl-perl 0.002009-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 | package Data::Perl::Role::Collection::Hash;
$Data::Perl::Role::Collection::Hash::VERSION = '0.002009';
# ABSTRACT: Wrapping class for Perl's built in hash structure.
use strictures 1;
use Role::Tiny;
use Scalar::Util qw/blessed/;
use Module::Runtime qw/use_package_optimistically/;
sub new { my $cl = shift; bless({ @_ }, $cl) }
sub _array_class { 'Data::Perl::Collection::Array' }
sub get {
my $self = shift;
if (@_ > 1) {
my @res = @{$self}{@_};
blessed($self) ? use_package_optimistically($self->_array_class)->new(@res) : @res;
}
else {
$self->{$_[0]};
}
}
sub set {
my $self = shift;
my @keys_idx = grep { ! ($_ % 2) } 0..$#_;
my @values_idx = grep { $_ % 2 } 0..$#_;
@{$self}{@_[@keys_idx]} = @_[@values_idx];
my @res = @{$self}{@_[@keys_idx]};
blessed($self) ? use_package_optimistically($self->_array_class)->new(@res) : @res;
}
sub delete {
my $self = shift;
my @res = CORE::delete @{$self}{@_};
blessed($self) ? use_package_optimistically($self->_array_class)->new(@res) : @res;
}
sub keys {
my ($self) = @_;
my @res = keys %{$self};
blessed($self) ? use_package_optimistically($self->_array_class)->new(@res) : @res;
}
sub exists { CORE::exists $_[0]->{$_[1]} }
sub defined { CORE::defined $_[0]->{$_[1]} }
sub values {
my ($self) = @_;
my @res = CORE::values %{$_[0]};
blessed($self) ? use_package_optimistically($self->_array_class)->new(@res) : @res;
}
sub kv {
my ($self) = @_;
my @res = CORE::map { [ $_, $self->{$_} ] } CORE::keys %{$self};
blessed($self) ? use_package_optimistically($self->_array_class)->new(@res) : @res;
}
{
no warnings 'once';
sub all {
my ($self) = @_;
my @res = CORE::map { $_, $self->{$_} } CORE::keys %{$self};
@res;
}
*elements = *all;
}
sub clear { %{$_[0]} = () }
sub count { CORE::scalar CORE::keys %{$_[0]} }
sub is_empty { CORE::scalar CORE::keys %{$_[0]} ? 0 : 1 }
sub accessor {
if (@_ == 2) {
$_[0]->{$_[1]};
}
elsif (@_ > 2) {
$_[0]->{$_[1]} = $_[2];
}
}
sub shallow_clone { blessed($_[0]) ? bless({%{$_[0]}}, ref $_[0]) : {%{$_[0]}} }
1;
=pod
=encoding UTF-8
=head1 NAME
Data::Perl::Role::Collection::Hash - Wrapping class for Perl's built in hash structure.
=head1 VERSION
version 0.002009
=head1 SYNOPSIS
use Data::Perl qw/hash/;
my $hash = hash(a => 1, b => 2);
$hash->values; # (1, 2)
$hash->set('foo', 'bar'); # (a => 1, b => 2, foo => 'bar')
=head1 DESCRIPTION
This class provides a wrapper and methods for interacting with a hash.
All methods that return a list do so via a Data::Perl::Collection::Array
object.
=head1 PROVIDED METHODS
=over 4
=item B<new($key, $value, ...)>
Given an optional list of keys/values, constructs a new Data::Perl::Collection::Hash
object initialized with keys/values and returns it.
=item B<get($key, $key2, $key3...)>
Returns a list of values in the hash for the given keys.
This method requires at least one argument.
=item B<set($key =E<gt> $value, $key2 =E<gt> $value2...)>
Sets the elements in the hash to the given values. It returns the new values
set for each key, in the same order as the keys passed to the method.
This method requires at least two arguments, and expects an even number of
arguments.
=item B<delete($key, $key2, $key3...)>
Removes the elements with the given keys.
Returns a list of values in the hash for the deleted keys.
=item B<keys>
Returns the list of keys in the hash.
This method does not accept any arguments.
=item B<exists($key)>
Returns true if the given key is present in the hash.
This method requires a single argument.
=item B<defined($key)>
Returns true if the value of a given key is defined.
This method requires a single argument.
=item B<values>
Returns the list of values in the hash.
This method does not accept any arguments.
=item B<kv>
Returns the key/value pairs in the hash as an array of array references.
for my $pair ( $object->option_pairs ) {
print "$pair->[0] = $pair->[1]\n";
}
This method does not accept any arguments.
=item B<elements/all>
Returns the key/value pairs in the hash as a flattened list..
This method does not accept any arguments.
=item B<clear>
Resets the hash to an empty value, like C<%hash = ()>.
This method does not accept any arguments.
=item B<count>
Returns the number of elements in the hash. Also useful for not empty:
C<< has_options => 'count' >>.
This method does not accept any arguments.
=item B<is_empty>
If the hash is populated, returns false. Otherwise, returns true.
This method does not accept any arguments.
=item B<accessor($key)>
=item B<accessor($key, $value)>
If passed one argument, returns the value of the specified key. If passed two
arguments, sets the value of the specified key.
When called as a setter, this method returns the value that was set.
=item B<shallow_clone>
This method returns a shallow clone of the hash reference. The return value
is a reference to a new hash with the same keys and values. It is I<shallow>
because any values that were references in the original will be the I<same>
references in the clone.
=item B<_array_class>
The name of the class which returned lists are instances of; i.e.
C<< Data::Perl::Collection::Array >>.
Subclasses of this class can override this method.
=back
Note that C<each> is deliberately omitted, due to its stateful interaction
with the hash iterator. C<keys> or C<kv> are much safer.
=head1 SEE ALSO
=over 4
=item * L<Data::Perl>
=item * L<MooX::HandlesVia>
=back
=head1 AUTHOR
Matthew Phillips <mattp@cpan.org>
=head1 COPYRIGHT AND LICENSE
This software is copyright (c) 2014 by Matthew Phillips <mattp@cpan.org>.
This is free software; you can redistribute it and/or modify it under
the same terms as the Perl 5 programming language system itself.
=cut
__END__
==pod
|