trying to make the code pass ruff auto review

Author: LukOlen

compression/ppm.py

@@ -1,13 +1,14 @@
-from __future__ import annotations
 import sys
+from __future__ import annotations
 from collections import defaultdict
 
 # Description for the ppm algorithm can be found at https://en.wikipedia.org/wiki/Prediction_by_partial_matching
 
 
 class PPMNode:
     def __init__(self) -> None:
-        # Initialize a PPMNode with a dictionary for child nodes and a count of total occurrences
+        # Initialize a PPMNode with a dictionary for child nodes 
+        # and a count of total occurrences
         self.counts: dict[str, PPMNode] = defaultdict(PPMNode)
         self.total: int = 0
 
@@ -47,7 +48,7 @@ def compress(self, data: str) -> list[float]:
             context = (context + symbol)[-self.order :]  # Keep the context within order
 
         return compressed_output
-
+    
     def encode_symbol(self, context: str, symbol: str) -> float:
         # Encode a symbol based on the current context and return its probability
         node = self.root
@@ -92,7 +93,8 @@ def decode_symbol(self, context: str, prob: float) -> str | None:
             else:
                 return None  # Return None if the context is not found
 
-        # Iterate through the children of the node to find the symbol matching the given probability
+        # Iterate through the children of the node to 
+        # find the symbol matching the given probability
         for symbol, child in node.counts.items():
             if child.total / node.total == prob:
                 return symbol  # Return the symbol if the probability matches