NAME

Cache::Ref::LIFO

SYNOPSIS

    my $c = Cache::Ref::LIFO->new( size => $n );

    $c->set( foo => 42 );

    $c->get("foo");

DESCRIPTION

This is a very naive cache algorithm, it saves cache sets until the cache is full, at which point all additional saves which aren't a value update are discarded immediately.

For very predictable workflows this is potentially a good fit, provided the MFU is used early on.

The advantages is that the code is very simple as a result.

NAME

Cache::Ref::LIFO - Saves entries until full, discarding subsequent sets.

AUTHOR

  Yuval Kogman

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.