From Code to Community: Sponsoring The Perl and Raku Conference 2025 Learn more

BRUNOV / Cache-Ref-0.04 / lib / Cache / Ref / GCLOCK.pm 

            

              
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

              
package Cache::Ref::GCLOCK;
BEGIN {
  $Cache::Ref::GCLOCK::AUTHORITY = 'cpan:NUFFIN';
}
BEGIN {
  $Cache::Ref::GCLOCK::VERSION = '0.04';
}
# ABSTRACT: GCLOCK cache replacement algorithm
use Moose;
use namespace::autoclean;
extends qw(Cache::Ref);
with qw(Cache::Ref::CLOCK::Base);
sub _hit {
    my ( $self, $e ) = @_;
    $_->[0]++ for @$e;
}
__PACKAGE__->meta->make_immutable;
__PACKAGE__;
# ex: set sw=4 et:
__END__
=pod
=encoding utf-8
=head1 NAME
Cache::Ref::GCLOCK - GCLOCK cache replacement algorithm
=head1 SYNOPSIS
    my $c = Cache::Ref::GCLOCK->new(
        size => $n,
    );
=head1 DESCRIPTION
This algorithm is related to L<Cache::Ref::CLOCK> but instead of starting all
cache hits from C<k>, a counter is increased on every hit.
This provides behavior which models an LFU expiry policy (without taking into
account the full keyspace).
=head1 ATTRIBUTES
=over 4
=item size
The size of the live entries.
=back
=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