Cache::Ref::CAR - CLOCK with Adaptive Replacement

       size
           The size of the live entries.

           Note  that the cache also remembers this many expired keys, and keeps some metadata about those keys,
           so for memory usage the overhead is probably around double what Cache::Ref::LRU requires.

       Yuval Kogman

       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.

       This algorithm is an implementation of http://www.almaden.ibm.com/cs/people/dmodha/clockfast.pdf.

       See also Cache::Ref::CART which is probably more appropriate for random access work loads.

       CAR balances between an MFU like policy and an MRU like policy, automatically tuning itself as the
       workload varies.

       Cache::Ref::CAR - CLOCK with Adaptive Replacement

       Hey! Theabovedocumenthadsomecodingerrors,whichareexplainedbelow:

       Around line 174:
           alternative  text  'http://www.almaden.ibm.com/cs/people/dmodha/clockfast.pdf' contains non-escaped |
           or /

perl v5.32.0                                       2021-01-07                               Cache::Ref::CAR(3pm)

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