Tie::C...:Array(3pm)

💖 NAME 💖

Tie::Cache::LRU::Array — it's Tie::Cache::LRU, bestie, but built out of arrays. Same vibe, different plumbing. ✨

(also hi, you're reading the User Contributed Perl Documentation for this one, and it's the version that ships with perl v5.36.0 — more on that at the bottom 🎀)

---

🌸 SYNOPSIS 🌸

okay so literally just:

use Tie::Cache::LRU::Array;

tie %cache, 'Tie::Cache::LRU::Array', 500;

...the rest is as Tie::Cache::LRU...

that's it. that's the whole entrance. tie your hash, hand it a max size of 500, and the rest of the behaviour is exactly as Tie::Cache::LRU does it. no notes. 💅

---

🦋 DESCRIPTION 🦋

So this is an alternative implementation of Tie::Cache::LRU, and the way it does its thing is with Perl arrays and built-in array operations instead of a linked list. 🎀

The theory behind it (and I'm quoting the vibes here, not making promises): even though the algorithm it uses is more expensive, it'll still be faster for small cache sizes — and yes, the docs literally say small <= ??, so the threshold is a mystery even to the author, we love that for us 😭 — because the actual work happens inside perl. So like: higher big O, lower constant. That's the trade. 🔥

And if nothing else? It should use less memory. ✨ lowkey a whole mood.

---

👑 AUTHOR 👑

Michael G Schwern <schwern@pobox.com> — the icon, the moment, the legend. 🫶

---

🌈 SEE ALSO 🌈

• Tie::Cache::LRU — the original, the blueprint 💜
• Tie::Cache::LRU::Virtual — the virtual one, being mysterious 🧚
• Tie::Cache — the parent situation 💖

---

fr fr, if you want the full behaviour spec, go read Tie::Cache::LRU. this page is just the array-flavoured remix. 🎧

---

and that's the whole page, bestie!! 🥳 this one's from perl v5.36.0, dated 2022-08-29, and it's the Tie::Cache::LRU::Array entry in the User Contributed Perl Documentation. periodt. 💅✨💖