simulation-alg 0.1.6__tar.gz → 0.1.7__tar.gz

{simulation_alg-0.1.6 → simulation_alg-0.1.7}/Cargo.lock

@@ -543,7 +543,7 @@ dependencies = [
 
 [[package]]
 name = "simulation"
-version = "0.1.6"
+version = "0.1.7"
 dependencies = [
  "graph-base",
  "graph-simulation",

{simulation_alg-0.1.6 → simulation_alg-0.1.7}/Cargo.toml

@@ -1,6 +1,6 @@
 [package]
 name = "simulation"
-version = "0.1.6"
+version = "0.1.7"
 edition = "2021"
 license = "MIT"
 description = "A Python package for simulation algorithms"

{simulation_alg-0.1.6 → simulation_alg-0.1.7}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: simulation-alg
-Version: 0.1.6
+Version: 0.1.7
 Classifier: Programming Language :: Rust
 Classifier: Programming Language :: Python :: Implementation :: CPython
 Classifier: Programming Language :: Python :: Implementation :: PyPy

{simulation_alg-0.1.6 → simulation_alg-0.1.7}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "maturin"
 
 [project]
 name = "simulation-alg"
-version = "0.1.6"
+version = "0.1.7"
 requires-python = ">=3.10"
 classifiers = [
     "Programming Language :: Rust",

{simulation_alg-0.1.6 → simulation_alg-0.1.7}/simulation.pyi

@@ -57,10 +57,17 @@ class DMatch:
     def __init__(self) -> None: ...
     @staticmethod
     def from_dict(d_match_by_sc_id: dict[tuple[int, int], set[tuple[int, int]]]) -> 'DMatch': ...
+    """
+    Register the d-match by sematic cluster's id, from `add_sematic_cluster_pair`.
+    For a sematic cluster pair by `id`, we set map[(id, id)] = R as the relation, where (u_id, v_id) in R, are node's id.
+    """
 
 class Delta:
     def __init__(self) -> None: ...
     def add_sematic_cluster_pair(self, u: Node, v: Node, cluster_u: list[Hyperedge], cluster_v: list[Hyperedge]) -> int: ...
+    """
+    Add a sematic of (u, v), register a id of the pair that, (cluster_u, id) and (cluster_v, id) 
+    """
 
 class Hypergraph:
     """
@@ -72,7 +79,10 @@ class Hypergraph:
     
     def add_hyperedge(self, hyperedge: Hyperedge): ...
     
-    def set_type_same_fn(self, type_same_fn: Callable[[str, str], bool]): ... # L(v) = L(u)
+    def set_type_same_fn(self, type_same_fn: Callable[[int, int], bool]): ... # L(v) = L(u)
+    """
+    Set a function as the Denial Comment, where inputs the id of the nodes, and return if is conflict.
+    """
     
     def set_l_predicate_fn(self, l_predicate_fn: Callable[[Hyperedge, Hyperedge], bool]): ... # L_P(e1, e2)
     

{simulation_alg-0.1.6 → simulation_alg-0.1.7}/tests/test_hyper_simulation.py

@@ -20,11 +20,11 @@ def l_match_fn(hyperedge1: Hyperedge, hyperedge2: Hyperedge) -> dict[int, set[in
                 mapping[id1] = {id2}
     return mapping
 
-def label_same_fn(desc1: str, desc2: str) -> bool:
+def label_same_fn(id1: int, id2: int) -> bool:
     """
     Check if two nodes are the same based on their descriptions.
     """
-    return desc1 == desc2 
+    return id1 == id2 
 
 if __name__ == "__main__":
     # Create a hypergraph