cache.ram behaves a little different from other caching systems (with redis
or memcache you find the "usual" cache algorithm).
Cache.ram currently behaves storing indefinitely your object, and retrieves
(or updates) the key based on time_expire (that's why it's recommended to
use a finite set of
Hi Niphlod
thank you for your clear explanation. Do you know why cache.ram behave this
way (as it is different to standard cache behaviour).
many thanks
Dave
--
as I said, for historical reasons. There are (as always) pros and cons with
every implementation. Here I think prevailed the "doesn't matter if cache
gets large" over "I must check for every call if there are keys ready to be
removed" (can be tricky to implement something like that with costant
Thanks Niphlod
--
4 matches
Mail list logo
