Cache::Ref::CART(3pm)

✨ NAME ✨

Cache::Ref::CART — it's CAR, bestie, but with temporal filtering 💅

(also: this is a User Contributed Perl Documentation page, iykyk)

---

🌸 SYNOPSIS 🌸

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

that's it. that's the whole vibe. go off 💖

---

🦋 DESCRIPTION 🦋

okay so, this algorithm is an extension to Cache::Ref::CAR — like, CAR but with a lil glow-up ✨ The glow-up in question? temporal filtering on the upgrading from MRU to MFU pool. 👑

Which means… (and this is the important part, don't skip it bestie) — two subsequent accesses to the same key do not automatically make it viable for long term caching. Nope. Not enough. 🙅‍♀️

To actually get upgraded to MFU status, a key must be expired but known in the history. That's the bar. that's the entry requirement. it's giving exclusive club energy 🎀

And fr fr? This is probably the most general purpose caching algorithm. like, if you don't know which one to pick, it's this one. periodt. 💜

---

💅 ATTRIBUTES 💅

• size — the size of the live entries.

🫶 heads up bestie: the cache also remembers this many expired keys, and keeps some metadata about those keys too. So for memory usage, the overhead is probably around double what Cache::Ref::LRU requires. plan accordingly, it's giving hungry 😭

---

👑 AUTHOR 👑

Yuval Kogman — the icon, the legend, the moment ⭐

---

🌈 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. so like, go forth and remix, just keep it free 💖

---

okay that's the whole page, ily, go cache something responsibly 🎀

perl v5.32.0 — 2021-01-07 ✨ that's the version and the date, bestie, stamped and slayed 💅🦋