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
|
package Cache::Ref::Util::LRU::Array;
BEGIN {
$Cache::Ref::Util::LRU::Array::AUTHORITY = 'cpan:NUFFIN';
}
BEGIN {
$Cache::Ref::Util::LRU::Array::VERSION = '0.04';
}
use Moose;
use Scalar::Util qw(refaddr);
use Hash::Util::FieldHash::Compat qw(id);
use namespace::autoclean;
has _list => (
traits => [qw(Array)],
isa => "ArrayRef",
default => sub { [] },
is => "ro",
handles => {
#size => "length",
mru => [ get => 0 ],
lru => [ get => -1 ],
remove_mru => "shift",
remove_lru => "pop",
clear => "clear",
},
);
with qw(Cache::Ref::Util::LRU::API);
# since there's no need for metadata, insert is just like hit
sub insert {
my ( $self, @elements ) = @_;
$self->hit(@elements);
return ( @elements == 1 ? $elements[0] : @elements );
}
sub _filter {
my ( $self, $l, $elements ) = @_;
return () unless @$l;
confess if grep { not defined } @$elements;
my %hash; @hash{map {id($_)} @$elements} = ();
grep { not exists $hash{id($_)} } @$l;
}
sub hit {
my ( $self, @elements ) = @_;
return unless @elements;
my $l = $self->_list;
@$l = ( @elements, $self->_filter($l, \@elements) );
return;
}
sub remove {
my ( $self, @elements ) = @_;
return unless @elements;
my $l = $self->_list;
@$l = $self->_filter($l, \@elements);
return;
}
__PACKAGE__->meta->make_immutable;
__PACKAGE__;
# ex: set sw=4 et:
__END__
=pod
=encoding utf-8
=head1 NAME
Cache::Ref::Util::LRU::Array
=head1 AUTHOR
Yuval Kogman
=head1 COPYRIGHT AND LICENSE
This software is copyright (c) 2010 by Yuval Kogman.
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
|
