speed-up by sorting by hash

Author: Theomat

grape/automaton/tree_automaton.py

@@ -40,8 +40,8 @@ def __init__(
         ],
         finals: Set[U],
     ) -> None:
-        self.finals = {s for s in sorted(finals)}
-        self.rules = {k: rules[k] for k in sorted(rules, key=str)}
+        self.finals = {s for s in sorted(finals, key=hash)}
+        self.rules = {k: rules[k] for k in sorted(rules, key=hash)}
         self.reversed_rules: Dict[
             U,
             List[