chore(lint): format files

Author: BrianLusina

datascience/numeric_python/statistics/TestChecker.py

@@ -8,8 +8,8 @@ def __init__(self, n):
     @staticmethod
     def test_function(actual, expected):
         print
-        "Test for " + str(
-            actual
-        ) + " passed " if actual == expected else "Test for " + str(
-            actual
-        ) + " failed, expected " + str(expected)
+        (
+            "Test for " + str(actual) + " passed "
+            if actual == expected
+            else "Test for " + str(actual) + " failed, expected " + str(expected)
+        )

datastructures/trees/binary/test_utils.py

@@ -1,5 +1,8 @@
 import unittest
-from datastructures.trees.binary.utils import lowest_common_ancestor, lowest_common_ancestor_ptr
+from datastructures.trees.binary.utils import (
+    lowest_common_ancestor,
+    lowest_common_ancestor_ptr,
+)
 from datastructures.trees.binary.node import BinaryTreeNode
 
 

poetry.lock

@@ -6,7 +6,8 @@
 class EvaluateDivisionTestCase(unittest.TestCase):
     def test_1(self):
         """should return [6.00000,0.50000,-1.00000,1.00000,-1.00000] from equations = [["a","b"],["b","c"]],
-        values = [2.0,3.0], queries = [["a","c"],["b","a"],["a","e"],["a","a"],["x","x"]]"""
+        values = [2.0,3.0], queries = [["a","c"],["b","a"],["a","e"],["a","a"],["x","x"]]
+        """
         expected = [6.00000, 0.50000, -1.00000, 1.00000, -1.00000]
         equations = [["a", "b"], ["b", "c"]]
         values = [2.0, 3.0]
@@ -16,7 +17,8 @@ def test_1(self):
 
     def test_2(self):
         """should return [3.75000,0.40000,5.00000,0.20000] from equations = [["a","b"],["b","c"],["bc","cd"]],
-        values = [1.5,2.5,5.0], queries = [["a","c"],["c","b"],["bc","cd"],["cd","bc"]]"""
+        values = [1.5,2.5,5.0], queries = [["a","c"],["c","b"],["bc","cd"],["cd","bc"]]
+        """
         expected = [3.75000, 0.40000, 5.00000, 0.20000]
         equations = [["a", "b"], ["b", "c"], ["bc", "cd"]]
         values = [1.5, 2.5, 5.0]

puzzles/graphs/evaluate_division/test_evaluate_division.py

@@ -24,24 +24,40 @@ def hand_rank(hand):
     straight = (len(counts) == 5) and (max(ranks) - min(ranks) == 4)
     flush = len(set([s for r, s in hand])) == 1
     return (
-        9
-        if counts == (5,)
-        else 8
-        if straight and flush
-        else 7
-        if counts == (4, 1)
-        else 6
-        if counts == (3, 2)
-        else 5
-        if flush
-        else 4
-        if straight
-        else 3
-        if counts == (3, 1, 1)
-        else 2
-        if counts == (2, 2, 1)
-        else 1
-        if counts == (2, 1, 1, 1)
-        else 0,
+        (
+            9
+            if counts == (5,)
+            else (
+                8
+                if straight and flush
+                else (
+                    7
+                    if counts == (4, 1)
+                    else (
+                        6
+                        if counts == (3, 2)
+                        else (
+                            5
+                            if flush
+                            else (
+                                4
+                                if straight
+                                else (
+                                    3
+                                    if counts == (3, 1, 1)
+                                    else (
+                                        2
+                                        if counts == (2, 2, 1)
+                                        else 1
+                                        if counts == (2, 1, 1, 1)
+                                        else 0
+                                    )
+                                )
+                            )
+                        )
+                    )
+                )
+            )
+        ),
         ranks,
     )

puzzles/poker/__init__.py

@@ -1,7 +1,7 @@
 [tool.poetry]
 name = "pythonsnips"
 version = "0.1.0"
-description = ""
+description = "Algorithms, data structures and code snippets written in Python"
 authors = ["BrianLusina <[email protected]>"]
 license = "MIT"
 readme = "README.md"
@@ -12,6 +12,7 @@ parameterized = "^0.9.0"
 
 [tool.poetry.group.dev.dependencies]
 ruff = "^0.3.5"
+black = "^25.11.0"
 
 [tool.poetry.group.test.dependencies]
 pytest-benchmark = "^5.1.0"

pyproject.toml

@@ -28,9 +28,11 @@ def hexa_first_principles(hexadecimal):
         # if c in hexdigits[10: len(hexdigits) - 6] is equivalent to abcdef
         # converts each character in hexa to digit
         hex_list = [
-            ord(c) - ord("a") + 10
-            if c in hexdigits[10 : len(hexdigits) - 6]
-            else ord(c) - ord("0")
+            (
+                ord(c) - ord("a") + 10
+                if c in hexdigits[10 : len(hexdigits) - 6]
+                else ord(c) - ord("0")
+            )
             for c in hexa
         ]
 

pystrings/hexadecimal/__init__.py

@@ -15,6 +15,7 @@
 # It's ok if you do not complete all the functions, and there
 # are some additional functions to try in list2.py.
 
+
 # A. match_ends
 # Given a list of strings, return the count of the number of
 # strings where the string length is 2 or more and the first

utils/basic/list1.py

@@ -8,6 +8,7 @@
 
 # Additional basic list exercises
 
+
 # D. Given a list of numbers, return a list where
 # all adjacent == elements have been reduced to a single element,
 # so [1, 2, 2, 3] returns [1, 2, 3]. You may create a new list or

utils/basic/list2.py

@@ -15,6 +15,7 @@
 # It's ok if you do not complete all the functions, and there
 # are some additional functions to try in list2.py.
 
+
 # A. match_ends
 # Given a list of strings, return the count of the number of
 # strings where the string length is 2 or more and the first