Reformatted function definitions on one line

Author: Cubix1729

src/logicalpy/base.py

@@ -9,8 +9,8 @@ class Proposition:
     """
 
     def __init__(self, name: str):
-        if name == "":
-            raise ValueError("a proposition name cannot be ''")
+        if name.strip() == "":
+            raise ValueError("proposition name cannot be empty")
         self.name = name
 
     def __str__(self) -> str:

src/logicalpy/hilbert.py

@@ -24,9 +24,7 @@
 """
 
 
-def _make_regex_from_formula(
-    formula: Formula,
-) -> str:
+def _make_regex_from_formula(formula: Formula) -> str:
     formula_props = formula.propositions()
     formula_str = str(formula)
     formula_str = formula_str.replace("(", r"\(").replace(")", r"\)")

src/logicalpy/normal_forms.py

@@ -189,9 +189,7 @@ def _find_conjuncts(formula) -> list:
         return [Formula(formula)]
 
 
-def to_clausal_cnf(
-    formula: Formula,
-) -> list[DisjunctiveClause]:
+def to_clausal_cnf(formula: Formula) -> list[DisjunctiveClause]:
     """Converts a formula to conjunctive normal form (CNF) like `to_cnf`, but as a list of disjunctive clauses
 
     Args:
@@ -215,9 +213,7 @@ def to_clausal_cnf(
     return list_of_clauses
 
 
-def to_clausal_dnf(
-    formula: Formula,
-) -> list[ConjunctiveClause]:
+def to_clausal_dnf(formula: Formula) -> list[ConjunctiveClause]:
     """Converts a formula to disjunctive normal form (DNF) like `to_dnf`, but as a list of conjunctive clauses
 
     Args:

src/logicalpy/resolution.py

@@ -74,18 +74,14 @@ def resolve(
                 return DisjunctiveClause(*resulting_literals)
 
 
-def _is_tautology(
-    clause: DisjunctiveClause,
-) -> bool:
+def _is_tautology(clause: DisjunctiveClause) -> bool:
     for literal_1, literal_2 in combinations(clause, 2):
         if are_complementary_literals(literal_1, literal_2):
             return True
     return False
 
 
-def _remove_redundancy(
-    clause: DisjunctiveClause,
-) -> DisjunctiveClause:
+def _remove_redundancy(clause: DisjunctiveClause) -> DisjunctiveClause:
     all_literals = []
     for literal in clause:
         if literal not in all_literals:
@@ -103,11 +99,7 @@ class ResolutionProver:
 
     """
 
-    def __init__(
-        self,
-        premises: Iterable[Formula],
-        conclusion: Formula,
-    ):
+    def __init__(self, premises: Iterable[Formula], conclusion: Formula):
         """The prover's constructor
 
         Args:
@@ -150,9 +142,7 @@ def __init__(
         self._refutation_found = False
         self._terminated_without_refutation = False
 
-    def _apply_resolution(
-        self,
-    ) -> Optional[tuple[DisjunctiveClause, int, int]]:
+    def _apply_resolution(self) -> Optional[tuple[DisjunctiveClause, int, int]]:
         """Resolves two clauses if possible and changes `all_clauses` in consideration. The clauses that were resolved are removed, and the resolvent is added.
 
         Returns:

src/logicalpy/semantics.py

@@ -242,9 +242,7 @@ def are_equivalent(formula_1: Formula, formula_2: Formula) -> bool:
     return True
 
 
-def are_jointly_satisfiable(
-    *formulae: Formula,
-) -> bool:
+def are_jointly_satisfiable(*formulae: Formula) -> bool:
     """Tests whether several formulae are jointly satisfiable
 
     Args:
@@ -273,9 +271,7 @@ def are_jointly_satisfiable(
     return False
 
 
-def one_satisfying_valuation(
-    formula: Formula,
-) -> Optional[dict[str, bool]]:
+def one_satisfying_valuation(formula: Formula) -> Optional[dict[str, bool]]:
     """Returns one valuation that satisfies the formula given
 
     Args:
@@ -299,9 +295,7 @@ def one_satisfying_valuation(
     return None
 
 
-def all_satisfying_valuations(
-    formula: Formula,
-) -> list[dict[str, bool]]:
+def all_satisfying_valuations(formula: Formula) -> list[dict[str, bool]]:
     """Returns all the valuations that satisfy the formula given
 
     Args:
@@ -328,10 +322,7 @@ def all_satisfying_valuations(
     return satisfying_valuations
 
 
-def is_valid_argument(
-    premises: Iterable[Formula],
-    conclusion: Formula,
-) -> bool:
+def is_valid_argument(premises: Iterable[Formula], conclusion: Formula) -> bool:
     """Tests whether an argument is (semantically) valid, i.e. whether the premises given entail the conclusion given
 
     Args: