[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Author: pre-commit-ci[bot]

scripts/evaluator.py

@@ -28,6 +28,7 @@
 
 import re
 
+
 def evaluate(expr: str):
     """
     Evaluate an arithmetic/bitwise expression string and return result.
@@ -50,7 +51,7 @@ def evaluate(expr: str):
     """
 
     # --- Tokenization ---
-    tokens = re.findall(r'\d+\.\d+|\d+|\*\*|<<|>>|[&|^+\-*/()]', expr.replace(" ", ""))
+    tokens = re.findall(r"\d+\.\d+|\d+|\*\*|<<|>>|[&|^+\-*/()]", expr.replace(" ", ""))
 
     # --- Handle unary minus (e.g., -5 + 3) and minus in starting ---
     if tokens and tokens[0] == "-":
@@ -63,23 +64,23 @@ def solve_power(z):
         while "**" in z:
             i = z.index("**")
             z[i - 1] = float(z[i - 1]) ** float(z[i + 1])
-            z[i:i + 2] = [None, None]
+            z[i : i + 2] = [None, None]
             z = clean(z)
         return z
 
     def solve_div(z):
         while "/" in z:
             i = z.index("/")
             z[i - 1] = float(z[i - 1]) / float(z[i + 1])
-            z[i:i + 2] = [None, None]
+            z[i : i + 2] = [None, None]
             z = clean(z)
         return z
 
     def solve_mul(z):
         while "*" in z:
             i = z.index("*")
             z[i - 1] = float(z[i - 1]) * float(z[i + 1])
-            z[i:i + 2] = [None, None]
+            z[i : i + 2] = [None, None]
             z = clean(z)
         return z
 
@@ -94,64 +95,74 @@ def solve_add(z):
         while "+" in z:
             i = z.index("+")
             z[i - 1] = float(z[i - 1]) + float(z[i + 1])
-            z[i:i + 2] = [None, None]
+            z[i : i + 2] = [None, None]
             z = clean(z)
         return z
 
     def solve_lshift(z):
         while "<<" in z:
             i = z.index("<<")
             z[i - 1] = int(float(z[i - 1])) << int(float(z[i + 1]))
-            z[i:i + 2] = [None, None]
+            z[i : i + 2] = [None, None]
             z = clean(z)
         return z
 
     def solve_rshift(z):
         while ">>" in z:
             i = z.index(">>")
             z[i - 1] = int(float(z[i - 1])) >> int(float(z[i + 1]))
-            z[i:i + 2] = [None, None]
+            z[i : i + 2] = [None, None]
             z = clean(z)
         return z
 
     def solve_and(z):
         while "&" in z:
             i = z.index("&")
             z[i - 1] = int(float(z[i - 1])) & int(float(z[i + 1]))
-            z[i:i + 2] = [None, None]
+            z[i : i + 2] = [None, None]
             z = clean(z)
         return z
 
     def solve_xor(z):
         while "^" in z:
             i = z.index("^")
             z[i - 1] = int(float(z[i - 1])) ^ int(float(z[i + 1]))
-            z[i:i + 2] = [None, None]
+            z[i : i + 2] = [None, None]
             z = clean(z)
         return z
 
     def solve_or(z):
         while "|" in z:
             i = z.index("|")
             z[i - 1] = int(float(z[i - 1])) | int(float(z[i + 1]))
-            z[i:i + 2] = [None, None]
+            z[i : i + 2] = [None, None]
             z = clean(z)
         return z
 
     def solve_parentheses(z):
         while "(" in z:
             close = z.index(")")
             open_ = max(i for i, v in enumerate(z[:close]) if v == "(")
-            inner = z[open_ + 1:close]
+            inner = z[open_ + 1 : close]
             result = evaluate(" ".join(map(str, inner)))
-            z = z[:open_] + [str(result)] + z[close + 1:]
+            z = z[:open_] + [str(result)] + z[close + 1 :]
         return z
 
     tokens = solve_parentheses(tokens)
 
     # Precedence order
-    for func in [solve_power, solve_div, solve_mul, solve_minus, solve_add,
-                 solve_lshift, solve_rshift, solve_and, solve_xor, solve_or]:
+    for func in [
+        solve_power,
+        solve_div,
+        solve_mul,
+        solve_minus,
+        solve_add,
+        solve_lshift,
+        solve_rshift,
+        solve_and,
+        solve_xor,
+        solve_or,
+    ]:
         tokens = func(tokens)
 
     result = tokens[0]
@@ -168,8 +179,9 @@ def solve_parentheses(z):
         return int(f) if f.is_integer() else f
     except ValueError:
         raise ValueError("Invalid expression or unsupported syntax.")
-    
+
 
 if __name__ == "__main__":
     import doctest
+
     doctest.testmod(verbose=True)