GitHub - hmshuv/LRU_Cache_project: A linked list + hashtable of pointers to the linked list nodes is the usual way to implement LRU caches. This gives O(1) operations (assuming a decent hash).

hmshuv / LRU_Cache_project Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

A linked list + hashtable of pointers to the linked list nodes is the usual way to implement LRU caches. This gives O(1) operations (assuming a decent hash).

0 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 1 Commit
cache.cpp		cache.cpp

About

A linked list + hashtable of pointers to the linked list nodes is the usual way to implement LRU caches. This gives O(1) operations (assuming a decent hash).

Activity

0 stars

1 watching

0 forks

Report repository