style: format code with Black

Author: AhmadHmedann

Sprint-2/implement_lru_cache/lru_cache.py

@@ -1,30 +1,29 @@
 class LruCache:
     class clsNode:
-        def __init__(self,value,key):
-            self.next= None
+        def __init__(self, value, key):
+            self.next = None
             self.previous = None
             self.value = value
             self.key = key
 
     def __init__(self, limit):
         if limit <= 0:
-           raise ValueError("limit must be greater than 0")
+            raise ValueError("limit must be greater than 0")
         self.head = None
         self.tail = None
-        self.limit =  limit
+        self.limit = limit
         self.cache = {}
 
     def add_to_head(self, node):
-      if node == None:
-          return
-      if self.head is None:
-        self.head = node
-        self.tail = node
-      else:
-        node.next = self.head
-        self.head.previous = node
-        self.head = node
-
+        if node == None:
+            return
+        if self.head is None:
+            self.head = node
+            self.tail = node
+        else:
+            node.next = self.head
+            self.head.previous = node
+            self.head = node
 
     def remove(self, node):
         if node == None:
@@ -45,34 +44,34 @@ def remove(self, node):
             node.next.previous = node.previous
             node.previous.next = node.next
         node.next = None
-        node.previous = None  
+        node.previous = None
 
-    def move_to_head(self,node):
+    def move_to_head(self, node):
         self.remove(node)
         self.add_to_head(node)
 
     # cache {key,node}
-    def get(self,key):
-        target = self.cache.get(key)   
+    def get(self, key):
+        target = self.cache.get(key)
         if target == None:
             return None
-        
+
         self.move_to_head(target)
         return target.value
 
-    def set(self,key,value):
+    def set(self, key, value):
         target = self.cache.get(key)
 
         if target is not None:
             target.value = value
             self.move_to_head(target)
 
         else:
-            target = self.clsNode(value,key)
+            target = self.clsNode(value, key)
             self.add_to_head(target)
             self.cache[key] = target
 
             if len(self.cache) > self.limit:
                 old_tail = self.tail
                 self.remove(old_tail)
-                del self.cache[old_tail.key]
+                del self.cache[old_tail.key]