refactor: simplify remove method in LRUCache and update related tests

Author: FarhanAnjum-opti

optimizely/odp/lru_cache.py

@@ -93,9 +93,6 @@ def peek(self, key: K) -> Optional[V]:
 
     def remove(self, key: K) -> None:
         """Remove the element associated with the provided key from the cache."""
-        if self.capacity <= 0:
-            return
-
         with self.lock:
             self.map.pop(key, None)
 

tests/test_lru_cache.py

@@ -139,7 +139,6 @@ def test_remove_non_existent_key(self):
 
         self.assertEqual(cache.lookup("1"), 100)
         self.assertEqual(cache.lookup("2"), 200)
-        self.assertEqual(len(cache.map), 2)
 
     def test_remove_existing_key(self):
         cache = LRUCache(3, 1000)
@@ -151,14 +150,12 @@ def test_remove_existing_key(self):
         self.assertEqual(cache.lookup("1"), 100)
         self.assertEqual(cache.lookup("2"), 200)
         self.assertEqual(cache.lookup("3"), 300)
-        self.assertEqual(len(cache.map), 3)
 
         cache.remove("2")
 
         self.assertEqual(cache.lookup("1"), 100)
         self.assertIsNone(cache.lookup("2"))
         self.assertEqual(cache.lookup("3"), 300)
-        self.assertEqual(len(cache.map), 2)
 
     def test_remove_from_zero_sized_cache(self):
         cache = LRUCache(0, 1000)
@@ -180,7 +177,6 @@ def test_remove_and_add_back(self):
         self.assertEqual(cache.lookup("1"), 100)
         self.assertEqual(cache.lookup("2"), 201)
         self.assertEqual(cache.lookup("3"), 300)
-        self.assertEqual(len(cache.map), 3)
 
     def test_thread_safety(self):
         import threading