InMemoryCache

README.md

@@ -12,6 +12,7 @@ Various Low Level Object-Oriented System Design problems are discussed in this s
 10. Chat application
 11. Notification system
 12. Leetcode / Hackerrank like online judge
+13. InMemoryCache with LRU eviction policy.
 
 
 # Planned (In no particular order)

src/com/lld/inmemorycache/MainApplication.java

@@ -0,0 +1,29 @@
+package com.lld.inmemorycache;
+
+import com.lld.inmemorycache.model.IEvictionPolicy;
+import com.lld.inmemorycache.model.impl.Cache;
+import com.lld.inmemorycache.model.impl.InMemoryStorage;
+import com.lld.inmemorycache.model.impl.LRUEvictionPolicy;
+
+import java.util.Objects;
+
+public class MainApplication {
+
+    public static void main(String[] args)
+    {
+        InMemoryStorage inMemoryStorage = new InMemoryStorage();
+        IEvictionPolicy lruEvictionPolicy = new LRUEvictionPolicy();
+        Cache cache = new Cache(inMemoryStorage, lruEvictionPolicy, 2);
+
+        // Test 1
+        cache.put("c", "1");
+        cache.put("a", "1");
+        cache.put("a", "2");
+        assert Objects.equals(cache.get("a"), "2");
+
+        cache.put("b", "3");
+        cache.put("b", "4");
+        assert Objects.equals(cache.get("b"), "4");
+
+    }
+}

src/com/lld/inmemorycache/README.md

@@ -0,0 +1,5 @@
+Design a Cache with LRU cache eviction policy.
+
+1. Cache should support get(), put methods.
+2. For simplicity, all keys and values are string.
+3. Make it extendable to support multiple other eviction policies in the future.

src/com/lld/inmemorycache/model/AbstractCache.java

@@ -0,0 +1,11 @@
+package com.lld.inmemorycache.model;
+
+public abstract class AbstractCache {
+    public IStorage storage;
+    public IEvictionPolicy evictionPolicy;
+    public int capacity;
+    public abstract boolean put(String key, String value);
+    public abstract String get(String key);
+    public abstract boolean remove(String key);
+
+}

src/com/lld/inmemorycache/model/DoublyLinkedList.java

@@ -0,0 +1,77 @@
+package com.lld.inmemorycache.model;
+
+public class DoublyLinkedList {
+    private Node head;
+    private Node tail;
+    private int count;
+    public DoublyLinkedList()
+    {
+        head = null;
+        tail = null;
+        count = 0;
+    }
+
+    public Node last()
+    {
+        return tail;
+    }
+
+    public Node addFront(String data)
+    {
+        Node temp = new Node(data, head, null);
+        if(head != null)
+        {
+            head.prev = temp;
+        }
+        // We have a new head.
+        head = temp;
+
+        if(tail == null)
+        {
+            tail = temp;
+        }
+        count++;
+        return head;
+    }
+
+    public void delete(Node item)
+    {
+        if(item == null)
+            return;
+        if(head == null)
+            return;
+        // deleting the top.
+        if(item == head)
+        {
+            // update the head.
+            head = head.next;
+            if(head != null)
+                head.prev = null;
+            else {
+                // if head is null, then tail is null as well.
+                tail = null;
+            }
+        }
+        else if(item == tail)
+        {
+            // go back.
+            tail = tail.prev;
+            tail.next = null;
+        }
+        else {
+            // some mid node we need to delete.
+            Node next = item.next;
+            Node prev = item.prev;
+            prev.next = next;
+            next.prev = prev;
+        }
+        count--;
+        item.next = null;
+        item.prev = null;
+    }
+
+    public int count()
+    {
+        return count;
+    }
+}

src/com/lld/inmemorycache/model/IEvictionPolicy.java

@@ -0,0 +1,9 @@
+package com.lld.inmemorycache.model;
+
+public interface IEvictionPolicy {
+    // Update statistics for the key which was accessed.
+    public void keyAccessed(String key);
+    // Update statistics for the key which was evicted.
+    public void keyEvicted(String key);
+    public String getKeyToEvict();
+}

src/com/lld/inmemorycache/model/IStorage.java

@@ -0,0 +1,8 @@
+package com.lld.inmemorycache.model;
+
+public interface IStorage {
+    public boolean put(String key, String value);
+    public String get(String key);
+    public boolean remove(String key);
+    public int count();
+}

src/com/lld/inmemorycache/model/Node.java

@@ -0,0 +1,14 @@
+package com.lld.inmemorycache.model;
+
+public class Node {
+    public String data;
+    public Node next;
+    public Node prev;
+
+    public Node(String data, Node next, Node prev)
+    {
+        this.data = data;
+        this.next = next;
+        this.prev = prev;
+    }
+}

src/com/lld/inmemorycache/model/impl/Cache.java

@@ -0,0 +1,56 @@
+package com.lld.inmemorycache.model.impl;
+
+import com.lld.inmemorycache.model.AbstractCache;
+import com.lld.inmemorycache.model.IEvictionPolicy;
+import com.lld.inmemorycache.model.IStorage;
+
+public class Cache extends AbstractCache {
+
+    public Cache(IStorage storage, IEvictionPolicy evictionPolicy, int capacity)
+    {
+        this.storage = storage;
+        this.evictionPolicy = evictionPolicy;
+        this.capacity = capacity;
+    }
+    @Override
+    public boolean put(String key, String value) {
+        if(key == null || value == null)
+            return false;
+        if(storage.count() >= capacity)
+        {
+            // we need to evict keys because the capacity is full.
+            String keyToEvict = evictionPolicy.getKeyToEvict();
+            boolean status = storage.remove(keyToEvict);
+            if(status)
+            {
+                // eviction complete.
+                evictionPolicy.keyEvicted(keyToEvict);
+            }
+            else {
+                // eviction failed.
+                // Multiple options here:
+                // 1. throw exception: not a good option perf wise to throw exceptions.
+                // 2. ignore the add and expect user to retry
+                // 3. execute random eviction policy.
+                // Implementing Option 2.
+                return false;
+            }
+        }
+
+        // space present
+        storage.put(key, value);
+        evictionPolicy.keyAccessed(key);
+        return true;
+    }
+
+    // Returns null if Key is not found.
+    @Override
+    public String get(String key) {
+        return storage.get(key);
+    }
+
+    @Override
+    public boolean remove(String key) {
+        return storage.remove(key);
+    }
+}

src/com/lld/inmemorycache/model/impl/InMemoryStorage.java

@@ -0,0 +1,66 @@
+package com.lld.inmemorycache.model.impl;
+
+import com.lld.inmemorycache.model.IStorage;
+
+import java.util.concurrent.ConcurrentHashMap;
+import java.util.concurrent.locks.ReentrantLock;
+
+public class InMemoryStorage implements IStorage {
+    private ConcurrentHashMap<String, String> _storage;
+    private static ReentrantLock lock;
+
+    public InMemoryStorage() {
+        _storage = new ConcurrentHashMap<>();
+        // fairness: first come, first served.
+        lock = new ReentrantLock(true);
+    }
+
+    @Override
+    public boolean put(String key, String value) {
+        lock.lock();
+        try {
+            // access _storage. do not allow an exception here.
+            _storage.put(key, value);
+        }
+        catch (Exception ex)
+        {
+            return false;
+        }
+        finally {
+            lock.unlock();
+        }
+        return true;
+    }
+
+    @Override
+    public String get(String key) {
+        if(_storage.containsKey(key))
+        {
+            return _storage.get(key);
+        }
+        return null;
+    }
+
+    @Override
+    public boolean remove(String key) {
+        lock.lock();
+        try {
+            // access _storage. do not allow an exception here.
+            _storage.remove(key);
+        }
+        catch (Exception ex)
+        {
+            return false;
+        }
+        finally {
+            lock.unlock();
+        }
+        return true;
+    }
+
+    @Override
+    public int count()
+    {
+        return _storage.size();
+    }
+}

src/com/lld/inmemorycache/model/impl/LRUEvictionPolicy.java

@@ -0,0 +1,70 @@
+package com.lld.inmemorycache.model.impl;
+
+import com.lld.inmemorycache.model.DoublyLinkedList;
+import com.lld.inmemorycache.model.IEvictionPolicy;
+import com.lld.inmemorycache.model.Node;
+
+import java.util.HashMap;
+import java.util.LinkedHashMap;
+import java.util.concurrent.locks.ReentrantLock;
+
+public class LRUEvictionPolicy implements IEvictionPolicy {
+    private DoublyLinkedList keys;
+    private HashMap<String, Node> mapper;
+
+    private ReentrantLock lock;
+
+    public LRUEvictionPolicy() {
+        keys = new DoublyLinkedList();
+        mapper = new LinkedHashMap<>();
+        lock = new ReentrantLock(true);
+    }
+
+    @Override
+    public void keyAccessed(String key) {
+        lock.lock();
+        try {
+            // key is already present.
+            if (mapper.containsKey(key)) {
+                // access the node and move it to the front.
+                Node keyNode = mapper.get(key);
+                // delete the node.
+                keys.delete(keyNode);
+                // add to front.
+                keys.addFront(key);
+            } else {
+                // first time encountering this key.
+                Node front = keys.addFront(key);
+                mapper.put(key, front);
+            }
+
+        } catch (Exception ex) {
+            // do something here.
+        } finally {
+            lock.unlock();
+        }
+    }
+
+    @Override
+    public void keyEvicted(String key) {
+        lock.lock();
+        try {
+            if (mapper.containsKey(key)) {
+                Node keyNode = mapper.get(key);
+                keys.delete(keyNode);
+                mapper.remove(key);
+            }
+        } catch (Exception ex) {
+            // do something here.
+
+        } finally {
+            lock.unlock();
+        }
+    }
+
+    @Override
+    public String getKeyToEvict() {
+        if (keys.count() > 0) return keys.last().data;
+        return null;
+    }
+}