anshuj11 / lru_cache Goto Github PK

Cache is implemented two ways:

Set the cache size during initialization using

lru_cache = LRUCache.new()

Add to the cache

lru_cache.set({"test01" => [1,2,3,4]}) Retrieve from cache lru_cache.get("test01");

Pros: Simple implementation Cons: Inefficient lookup, deletion - O(n) where n is the size of the cache

Set the cache size during initialization using

c = Lru_cache.new()

Add to the cache

c.insert({"test01"=> [1,2,3,4]}) Retrieve from cache c.get("test01");

Pros: Constant time lookup, insertion and deletion on average - O(1) Cons: Implementation slightly complicated with a hash map pointing to a linked list If the hashing function is inefficient, it will degrade the lookup to O(n)

• Test accessing same element twice, thereby making it newer in the cache
• Test corner cases - some are done but more needed
• Write rspec tests for sanity checks