|1.5 release||18.29 KB||Oct 26, 2009||3.2.0||360||Download|
|1.1 release||17.79 KB||Jul 8, 2009||3.1.0||229||Download|
|1.0 Stable release||17.72 KB||Jun 11, 2009||3.1.0||263||Download|
|Beta 1 beta||17.66 KB||May 14, 2009||3.1.0||164||Download|
|r15 alpha||18.26 KB||Oct 28, 2010||4.0.1||15||Download|
|r14 alpha||18.20 KB||Jul 11, 2010||3.2.0||11||Download|
|r12 alpha||18.33 KB||Aug 8, 2009||3.2.0||11||Download|
|r10 alpha||17.75 KB||Jul 7, 2009||3.1.0||13||Download|
|r9 alpha||17.66 KB||Jul 7, 2009||3.1.0||9||Download|
|r8 alpha||17.56 KB||Jul 7, 2009||3.1.0||9||Download|
|r6 alpha||17.66 KB||May 16, 2009||3.1.0||12||Download|
|r4 alpha||17.62 KB||May 14, 2009||3.1.0||11||Download|
|r3 alpha||4.50 KB||May 14, 2009||3.1.0||13||Download|
|r2 alpha||4.46 KB||May 14, 2009||3.1.0||13||Download|
LibRingCache is an implementation of a cache that selectively lets the garbage collector collect old items but keeps the newest.
See documentation for usage information.
Why would you want to use this?
Currently you might just have a simple cache table with a _mode = "kv" metatable, but that isn't the best way because when the garbage collector runs, it will collect all entries no matter how old (or recent) they are. This cache implementation will ensure that you will keep your N most recent items in the cache.
Generally spoken, LibRingCache is useful to you if you want to keep X recent items, but still have to access them by an associative value (as opposed to just an incrementing number)
Because a cache that is always empty is useless.