make everyone happier

comb_spec_searcher/comb_spec_searcher.py

@@ -595,7 +595,12 @@ def _expand_classes_for(
                 comb_class = self.classdb.get_class(label)
                 last_label = label
             if self.expand_verified or not self.ruledb.is_verified(label):
-                self._expand(comb_class, label, strategies, inferral)  # type: ignore
+                self._expand(
+                    comb_class,  # pylint: disable=possibly-used-before-assignment
+                    label,
+                    strategies,
+                    inferral,
+                )
             if time.time() - expansion_start > expansion_time:
                 break
             if status_update is not None and time.time() - status_start > status_update:

comb_spec_searcher/tree_searcher.py

@@ -1,6 +1,7 @@
 """
 Finds and returns a combinatorial specification, that we call a proof tree.
 """
+
 import time
 from collections import defaultdict, deque
 from copy import deepcopy
@@ -205,7 +206,7 @@ def _bfs_helper(root_label: int, seen: FrozenSet[int]):
                 *[_bfs_helper(child_label, next_seen) for child_label in rule]
             ):
                 root_node = Node(root_label)
-                root_node.children = children
+                root_node.children = list(children)
                 yield root_node
 
     sorted_rules_dict = {

example.py

@@ -35,6 +35,7 @@
 >>> specification.count_objects_of_size(n=15)
 9798
 """
+
 from itertools import product
 from typing import Iterable, Iterator, Optional, Tuple, Union
 
@@ -148,7 +149,7 @@ def is_atom(self) -> bool:
     def minimum_size_of_object(self) -> int:
         return len(self.prefix)
 
-    def objects_of_size(self, size):
+    def objects_of_size(self, size) -> Iterator[Word]:
         """Yield the words of given size that start with prefix and avoid the
         patterns. If just_prefix, then only yield that word."""