algorhino-anemone 0.1.5__tar.gz → 0.1.7__tar.gz

{algorhino_anemone-0.1.5/src/algorhino_anemone.egg-info → algorhino_anemone-0.1.7}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: algorhino-anemone
-Version: 0.1.5
+Version: 0.1.7
 Summary: anemone searches trees
 Author-email: Victor Gabillon <victorgabillon@gmail.com>
 License-Expression: GPL-3.0-only
@@ -12,7 +12,7 @@ Classifier: Operating System :: OS Independent
 Requires-Python: >=3.13
 Description-Content-Type: text/markdown
 License-File: LICENSE
-Requires-Dist: valanga>=0.1.6
+Requires-Dist: valanga>=0.1.7
 Requires-Dist: atomheart>=0.1.2
 Requires-Dist: rich
 Requires-Dist: sortedcollections>=2.1.0

{algorhino_anemone-0.1.5 → algorhino_anemone-0.1.7}/pyproject.toml

@@ -5,7 +5,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "algorhino-anemone"
-version = "0.1.5"
+version = "0.1.7"
 description = "anemone searches trees"
 keywords = ["tree", "search"]
 classifiers = [
@@ -14,7 +14,7 @@ classifiers = [
 ]
 requires-python = ">=3.13"
 dependencies = [
-    "valanga>=0.1.6",
+    "valanga>=0.1.7",
     "atomheart>=0.1.2",
     "rich",
     "sortedcollections>=2.1.0",
@@ -265,7 +265,7 @@ description = "ruff + pylint (fast, no package build/install)"
 package = "skip"
 deps = [
   # runtime deps needed for pylint imports (match [project].dependencies)
-  "valanga>=0.1.6",
+  "valanga>=0.1.7",
   "atomheart>=0.1.2",
   "rich",
   "sortedcollections>=2.1.0",
@@ -290,7 +290,7 @@ description = "mypy + pyright (fast, no package build/install)"
 package = "skip"
 deps = [
   # runtime deps for import resolution
-  "valanga>=0.1.6",
+  "valanga>=0.1.7",
   "atomheart>=0.1.2",
   "rich",
   "sortedcollections>=2.1.0",

{algorhino_anemone-0.1.5 → algorhino_anemone-0.1.7/src/algorhino_anemone.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: algorhino-anemone
-Version: 0.1.5
+Version: 0.1.7
 Summary: anemone searches trees
 Author-email: Victor Gabillon <victorgabillon@gmail.com>
 License-Expression: GPL-3.0-only
@@ -12,7 +12,7 @@ Classifier: Operating System :: OS Independent
 Requires-Python: >=3.13
 Description-Content-Type: text/markdown
 License-File: LICENSE
-Requires-Dist: valanga>=0.1.6
+Requires-Dist: valanga>=0.1.7
 Requires-Dist: atomheart>=0.1.2
 Requires-Dist: rich
 Requires-Dist: sortedcollections>=2.1.0

{algorhino_anemone-0.1.5 → algorhino_anemone-0.1.7}/src/algorhino_anemone.egg-info/requires.txt

@@ -1,4 +1,4 @@
-valanga>=0.1.6
+valanga>=0.1.7
 atomheart>=0.1.2
 rich
 sortedcollections>=2.1.0

{algorhino_anemone-0.1.5 → algorhino_anemone-0.1.7}/src/anemone/factory.py

@@ -7,7 +7,12 @@ from queue import Queue
 from random import Random
 from typing import Literal, Type
 
-from valanga import RepresentationFactory, TurnState
+from valanga import (
+    ContentRepresentation,
+    RepresentationFactory,
+    StateModifications,
+    TurnState,
+)
 from valanga.evaluator_types import EvaluatorInput
 
 from anemone import node_factory
@@ -57,7 +62,10 @@ def create_tree_and_value_branch_selector[StateT: TurnState](
     args: TreeAndValuePlayerArgs,
     random_generator: Random,
     master_state_evaluator: MasterStateEvaluator,
-    state_representation_factory: RepresentationFactory[StateT, EvaluatorInput] | None,
+    state_representation_factory: RepresentationFactory[
+        StateT, StateModifications, ContentRepresentation[StateT, EvaluatorInput]
+    ]
+    | None,
     queue_progress_player: Queue[IsDataclass] | None,
 ) -> TreeAndValueBranchSelector[StateT]:
     """Convenience constructor using the default minmax tree evaluation.
@@ -86,7 +94,10 @@ def create_tree_and_value_branch_selector_with_tree_eval_factory[StateT: TurnSta
     args: TreeAndValuePlayerArgs,
     random_generator: Random,
     master_state_evaluator: MasterStateEvaluator,
-    state_representation_factory: RepresentationFactory[StateT, EvaluatorInput] | None,
+    state_representation_factory: RepresentationFactory[
+        StateT, StateModifications, ContentRepresentation[StateT, EvaluatorInput]
+    ]
+    | None,
     node_tree_evaluation_factory: NodeTreeEvaluationFactory[StateT],
     queue_progress_player: Queue[IsDataclass] | None,
 ) -> TreeAndValueBranchSelector[StateT]:

{algorhino_anemone-0.1.5 → algorhino_anemone-0.1.7}/src/anemone/node_factory/algorithm_node_factory.py

@@ -38,7 +38,12 @@ class AlgorithmNodeFactory[StateT: State = State]:
     """
 
     tree_node_factory: TreeNodeFactory[AlgorithmNode[StateT], StateT]
-    state_representation_factory: RepresentationFactory[StateT, EvaluatorInput] | None
+    state_representation_factory: (
+        RepresentationFactory[
+            StateT, StateModifications, ContentRepresentation[StateT, EvaluatorInput]
+        ]
+        | None
+    )
     node_tree_evaluation_factory: NodeTreeEvaluationFactory[StateT]
     exploration_index_data_create: node_indices.ExplorationIndexDataFactory[
         AlgorithmNode[StateT], StateT