# NAME
Data::WeakMap - WeakMap that doesn't leak memory, and which you can operate on like a hash
# SYNOPSIS
use Data::WeakMap;
my $map = Data::WeakMap->new;
# or
my \%map = Data::WeakMap->new;
# Treat it just like a hash, but the keys must be perl references (of any kind)
# For more see here:
https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/WeakMap
my \%map = Data::WeakMap->new;
my $user = bless {name => 'Peter', age => 32}, 'MyWebSite::User';
$map{$user} = int rand 100;
print $map{$user}; # a number between 0 and 99
my @users = ({name => 'Peter', age => 32}, {name => 'Mary', age => 29}, ...); # 100 users
@map{@users} = @profiles; # map the users to 100 profiles
$map{$users[ $i ]} == $profiles[ $i ];
# you can do any hash operation on %map, except for 'each %map'.
my @keys = keys %map; # as usual...
my $num_keys = keys %map;
foreach my $value (values %map) { ... }
delete $map{ $users[0] };
exists $map{ $users[0] };
# etc
# Here's the 'Weak' part of WeakMaps:
my $regex = qr/123/;
%map = ($regex, 5);
scalar(keys %map); # 1
{
my $regex2 = qr/234/;
$map{$regex2} = 10;
scalar(keys %map); # 2
}
scalar(keys %map); # is now back to 1 (because WeakMap's keys, which are references, are only weak references)
# DESCRIPTION
Data::WeakMap is a Perl implementation for WeakMaps that does not leak memory
(For more see here:
https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global\_Objects/WeakMap)
# CAVEATS
Don't do this: each(%map). At least not for now (work in progress). Everything else seems to work fine.
# LICENSE
Copyright (C) Alexander Karelas.
This library is free software; you can redistribute it and/or modify
it under the same terms as Perl itself.
# AUTHOR
Alexander Karelas <
[email protected]>
