You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Last question regarding entry of cache with same key e.g. Set(k,v), will the key be
deleted first and then added
or
as in FIFO, pushed backwards?
if it's 1, i'll leave it as it is.
if it's 2, i would manually use Del(k) first because i want my other old entries to be Get(k) and not evicted when overpopulated.
The text was updated successfully, but these errors were encountered:
All the new entries, including entries with the existing key, are added into circular byte buffer, so it is close to 2. Del(k) won't help, since it doesn't free up space in the circular byte buffer - it just removes k => <offset in the circular buffer> mapping.
Last question regarding entry of cache with same key e.g. Set(k,v), will the key be
or
if it's 1, i'll leave it as it is.
if it's 2, i would manually use Del(k) first because i want my other old entries to be Get(k) and not evicted when overpopulated.
The text was updated successfully, but these errors were encountered: