Update lru_cache.py

Author: lighting9999

other/lru_cache.py

@@ -2,7 +2,6 @@
 
 from collections.abc import Callable
 
-
 class DoubleLinkedListNode[T, U]:
     """
     Double Linked List Node built specifically for LRU Cache
@@ -218,12 +217,12 @@ def __repr__(self) -> str:
         Return the details for the cache instance
         [hits, misses, capacity, current_size]
         """
-
         return (
             f"CacheInfo(hits={self.hits}, misses={self.miss}, "
             f"capacity={self.capacity}, current size={self.num_keys})"
         )
-            def __contains__(self, key: T) -> bool:
+
+    def __contains__(self, key: T) -> bool:
         """
         >>> cache = LRUCache(1)
 
@@ -235,9 +234,7 @@ def __contains__(self, key: T) -> bool:
         >>> 1 in cache
         True
         """
-
         return key in self.cache
-
     def get(self, key: T) -> U | None:
         """
         Returns the value for the input key and updates the Double Linked List.
@@ -262,7 +259,6 @@ def put(self, key: T, value: U) -> None:
         """
         Sets the value for the input key and updates the Double Linked List
         """
-
         if key not in self.cache:
             if self.num_keys >= self.capacity:
                 # delete first node (oldest) when over capacity
@@ -281,7 +277,6 @@ def put(self, key: T, value: U) -> None:
             self.cache[key] = DoubleLinkedListNode(key, value)
             self.list.add(self.cache[key])
             self.num_keys += 1
-
         else:
             # bump node to the end of the list, update value
             node = self.list.remove(self.cache[key])
@@ -314,7 +309,6 @@ def cache_decorator_wrapper(*args: T) -> U:
                     result = func(*args)
                     decorator_function_to_instance_map[func].put(args[0], result)
                 return result
-
             def cache_info() -> LRUCache[T, U]:
                 return decorator_function_to_instance_map[func]