Cache::Ref::LRU(3pm)

✨ NAME ✨

okay bestie, welcome to the Cache::Ref::LRU(3pm) manual page from the User Contributed Perl Documentation collection 💖

Cache::Ref::LRU — Least recently used expiry policy. that's the whole vibe, no cap.

---

🦋 SYNOPSIS 🦋

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

---

🎀 DESCRIPTION 🎀

This is an implementation of the least recently used expiry policy. it's literally giving "least recently used" but make it expire things 💅

It provides both an array and a doubly linked list based implementation. so you get two flavors, iconic. See Cache::Ref for a discussion — iykyk.

---

👑 ATTRIBUTES 👑

• size — The size of the live entries. like, how many live entries are living their best life.
• lru_class — The class of the LRU list implementation. the main character class of the LRU list, periodt.

---

🌈 AUTHOR 🌈

Yuval Kogman. shoutout to the author, absolute legend 🫶

---

💜 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.

---

okay bye bestie! this page is from perl v5.32.0, dated 2021-01-07, and it's the Cache::Ref::LRU(3pm) manual — mwah 💋✨