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

πŸ“¦
this version Β· 2 versions
, in ubuntu noble, ubuntu resolute, ubuntu stonking

πŸ’– Tie::Cache::LRU::LinkedList πŸ’–

okay so bestie β€” this is a page from the User Contributed Perl Documentation, and it's about Tie::Cache::LRU::LinkedList, which is literally just Tie::Cache::LRU but built different. πŸ¦‹


✨ NAME ✨

Tie::Cache::LRU::LinkedList β€” Tie::Cache::LRU implemented using a linked list. That's the whole vibe. πŸŽ€


✨ SYNOPSIS ✨

  use Tie::Cache::LRU::LinkedList;

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

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

not me just tying a hash and letting it cook πŸ’… β€” you tie that %cache, you hand it the class and 500, and then the rest is as Tie::Cache::LRU. Periodt. πŸ’–


✨ DESCRIPTION ✨

This one is an implementation of Tie::Cache::LRU that uses a linked list structure. πŸ¦‹

Theoretically, that's an efficient algorithm β€” like, the theory girlies are slaying. However β€” and this is the tea β€” it may be lose out in smaller cache sizes (where small <= ??) due to its relatively high constant. 😭

fr fr: small cache sizes are not this one's moment, because of that relatively high constant. No cap.

✨ AUTHOR ✨

Michael G Schwern <schwern@pobox.com> β€” the icon, the moment, the main character. πŸ‘‘


✨ SEE ALSO ✨

  • Tie::Cache::LRU
  • Tie::Cache::LRU::LinkedList
  • Tie::Cache::LRU::Virtual
  • Tie::Cache

and that's the whole page bestie 🫢 β€” this one came from perl v5.36.0, dated 2022-08-29, and it's filed under the Tie::C...kedList(3pm) section of the manual, so iykyk πŸ’…βœ¨πŸŒΈ

πŸ“¦ where this page comes from