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
Least recently used (LRU) cache is a data structure which provides O(1) time access for any stored value based on a key, while having the ability to provide an O(1) access to the last used value as well. The size of the cache is limited, when this limit is reached, the oldest values will be evicted.
A possible implementation for this data structure can be found in this PR: #4
Depending on your choice, it could be merged, or you could discard it and use it as a basis of a possible future implementation.
The text was updated successfully, but these errors were encountered:
Least recently used (LRU) cache is a data structure which provides O(1) time access for any stored value based on a key, while having the ability to provide an O(1) access to the last used value as well. The size of the cache is limited, when this limit is reached, the oldest values will be evicted.
A possible implementation for this data structure can be found in this PR: #4
Depending on your choice, it could be merged, or you could discard it and use it as a basis of a possible future implementation.
The text was updated successfully, but these errors were encountered: