compiled-knowledge 4.0.0a16__cp312-cp312-win_amd64.whl → 4.0.0a18__cp312-cp312-win_amd64.whl

ck/pgm_compiler/support/join_tree.py

@@ -15,6 +15,11 @@ from ck.utils.np_extras import NDArrayFloat64
 
 @dataclass
 class JoinTree:
+    """
+    This is a recursive data structure representing a join-tree.
+    Each node in the join-tree is represented by a JoinTree object.
+    """
+
     # The PGM that this join tree is for.
     pgm: PGM
 
@@ -40,6 +45,12 @@ class JoinTree:
 
     def max_cluster_weighted_size(self, rv_log_sizes: Sequence[float]) -> float:
         """
+        Calculate the maximum cluster weighted size for this cluster and its children.
+
+        Args:
+            rv_log_sizes: is an array of random variable sizes, such that
+                for a random variable `rv`, `rv_log_sizes[rv.idx] = log2(len(rv))`.
+
         Returns:
             the maximum `log2` over self and all children, recursively.
         """
@@ -82,8 +93,8 @@ JoinTreeAlgorithm = Callable[[PGM], JoinTree]
 
 def _join_tree_algorithm(pgm_to_clusters: ClusterAlgorithm) -> JoinTreeAlgorithm:
     """
-    Helper function for creating a standard JoinTreeAlgorithm from
-    a ClusterAlgorithm.
+    Helper function for creating a standard JoinTreeAlgorithm
+    from a ClusterAlgorithm.
 
     Args:
         pgm_to_clusters: The clusters method to use.
@@ -112,14 +123,17 @@ MIN_TRADITIONAL_WEIGHTED_FILL: JoinTreeAlgorithm = _join_tree_algorithm(min_trad
 
 def clusters_to_join_tree(clusters: Clusters) -> JoinTree:
     """
-    Construct a join tree maker for the given PGM and random variable clusters.
+    Construct a join tree from the given random variable clusters.
 
     A join tree is formed by finding a minimum spanning tree over the clusters
-    where the cost between a pair of cluster is defined according to
-    `separator_cost_counts` and `costing`.
+    where the cost between a pair of clusters is the number of random variables
+    in common (using separator state space size to break ties).
 
     Args:
-        clusters: the clusters that resulted from graph clusters of the given PGM.
+        clusters: the clusters that resulted from graph clusters of a PGM.
+
+    Returns:
+        a JoinTree.
     """
     pgm: PGM = clusters.pgm
     cluster_sets: List[Set[int]] = clusters.clusters
@@ -170,6 +184,19 @@ def _make_spanning_tree_small_root(cost: NDArrayFloat64, clusters: List[Set[int]
     """
     Construct a minimum spanning tree over the clusters, where the root is the cluster with
     the smallest number of random variable.
+
+    Args:
+        cost: is an N x N matrix of costs between N clusters.
+        clusters: is a list of N clusters, each cluster is a set of random variable indices.
+
+    Returns:
+        (spanning_tree, root_index)
+
+        spanning_tree: is a spanning tree represented as a list of nodes, the list is coindexed with
+        the given cost matrix, each node is a list of children, each child being
+        represented as an index into the list of nodes.
+
+        root_index: is the index the chosen root of the spanning tree.
     """
     root_custer_index: int = 0
     root_size: int = len(clusters[root_custer_index])
@@ -185,10 +212,22 @@ def _make_spanning_tree_small_root(cost: NDArrayFloat64, clusters: List[Set[int]
 def _make_spanning_tree_arbitrary_root(cost: NDArrayFloat64) -> Tuple[List[List[int]], int]:
     """
     Construct a minimum spanning tree over the clusters, starting at an arbitrary root.
+
+    Args:
+        cost: is an N x N matrix of costs between N clusters.
+
+    Returns:
+        (spanning_tree, root_index)
+
+        spanning_tree: is a spanning tree represented as a list of nodes, the list is coindexed with
+        the given cost matrix, each node is a list of children, each child being
+        represented as an index into the list of nodes.
+
+        root_index: is the index the chosen root of the spanning tree.
     """
-    root_custer_index: int = 0
-    children: List[List[int]] = _make_spanning_tree_at_root(cost, root_custer_index)
-    return children, root_custer_index
+    root_index: int = 0
+    spanning_tree: List[List[int]] = _make_spanning_tree_at_root(cost, root_index)
+    return spanning_tree, root_index
 
 
 def _make_spanning_tree_at_root(
@@ -202,6 +241,12 @@ def _make_spanning_tree_at_root(
         cost: and nxn matrix where n is the number of clusters and cost[i, j]
             gives the cost between clusters i and j.
         root_custer_index: a nominated root cluster to be the root of the tree.
+
+    Returns:
+        a spanning tree represented as a list of nodes, the list is coindexed with
+        the given cost matrix, each node is a list of children, each child being
+        represented as an index into the list of nodes. The root node is the
+        index `root_custer_index` as passed to this function.
     """
     number_of_clusters: int = cost.shape[0]
 
@@ -257,7 +302,19 @@ def _form_join_tree_r(
         cluster_factors: List[List[Factor]],
 ) -> JoinTree:
     """
-    Recursively build the join tree data structure.
+    Recursively build a JoinTree from the spanning tree `children`.
+    This function merely pull the corresponding component from the
+    arguments to make a JoinTree object, doing this recursively
+    for the children.
+
+    Args:
+        pgm: the source PGM for the join tree.
+        cluster_index: index for the node we are processing (current root). This
+            indexes into `children`, `clusters`, and `cluster_factors`.
+        parent_cluster: set of random variable indices in the parent cluster.
+        children: list of spanning tree nodes, as per `_make_spanning_tree_at_root` result.
+        clusters: list of clusters, each cluster is a set of random variable indices.
+        cluster_factors: assignment of factors to clusters.
     """
     cluster: Set[int] = clusters[cluster_index]
     factors: List[Factor] = cluster_factors[cluster_index]

ck/pgm_compiler/support/named_compiler_maker.py

@@ -12,6 +12,7 @@ def get_compiler(module: ModuleType, **kwargs) -> Tuple[PGMCompiler]:
 
     Args:
         module: module containing `compile_pgm` function.
+        kwargs: are additional keyword arguments to `compile_pgm`.
 
     Returns:
         a singleton tuple containing PGMCompiler function.
@@ -24,10 +25,19 @@ def get_compiler(module: ModuleType, **kwargs) -> Tuple[PGMCompiler]:
     return compiler,
 
 
-def get_compiler_algorithm(module, algorithm: str, **kwargs) -> Tuple[PGMCompiler]:
+def get_compiler_algorithm(module: ModuleType, algorithm: str, **kwargs) -> Tuple[PGMCompiler]:
     """
     Helper function to create a named PGM compiler, with a named algorithm argument.
+
+    Args:
+        module: module containing `compile_pgm` function.
+        algorithm: name of the algorithm, to pass as keyword argument to `compile_pgm`.
+            The algorithm should be declared in the module.
+        kwargs: are additional keyword arguments to `compile_pgm`.
+
+    Returns:
+        a singleton tuple containing PGMCompiler function.
     """
-    return get_compiler(module, algorithm=getattr(module, algorithm, **kwargs))
+    return get_compiler(module, algorithm=getattr(module, algorithm), **kwargs)
 
 

ck/pgm_compiler/variable_elimination.py

@@ -51,6 +51,8 @@ def compile_pgm(
 
     elimination_order: Sequence[int] = algorithm(pgm).eliminated
 
+    # Eliminate rvs from the factor tables according to the
+    # elimination order.
     cur_tables: List[CircuitTable] = list(factor_tables.tables)
     for rv_idx in elimination_order:
         next_tables: List[CircuitTable] = []

ck/utils/iter_extras.py

@@ -2,7 +2,7 @@
 A module with extra iteration functions.
 """
 from functools import reduce as _reduce
-from itertools import combinations, chain
+from itertools import combinations, chain, islice
 from operator import mul as _mul
 from typing import Iterable, Tuple, Sequence, TypeVar
 
@@ -154,3 +154,10 @@ def first(items: Iterable[_T]) -> _T:
     Return the first element of the iterable.
     """
     return next(iter(items))
+
+
+def take(iterable: Iterable[_T], n: int) -> Iterable[_T]:
+    """
+    Take the first n elements of the iterable.
+    """
+    return islice(iterable, n)

ck_demos/pgm_compiler/demo_compiler_dump.py

@@ -9,6 +9,16 @@ from ck.pgm_compiler.support.join_tree import JoinTree, clusters_to_join_tree
 
 
 def main() -> None:
+    """
+    This demo shows the full compilation chain for factor elimination.
+
+    Process:
+        Rain example -> PGM
+        min_degree -> Clusters
+        clusters_to_join_tree -> JoinTree
+        join_tree_to_circuit -> PGMCircuit
+        default circuit compiler -> WMCProgram
+    """
     pgm: PGM = example.Rain()
 
     print(f'PGM {pgm.name!r}')

ck_demos/pgm_compiler/time_fe_compiler.py

@@ -0,0 +1,93 @@
+from ck import example
+from ck.circuit import CircuitNode, Circuit
+from ck.circuit_compiler import DEFAULT_CIRCUIT_COMPILER
+from ck.pgm import PGM
+from ck.pgm_circuit import PGMCircuit
+from ck.pgm_compiler.factor_elimination import DEFAULT_PRODUCT_SEARCH_LIMIT, _circuit_tables_from_join_tree
+from ck.pgm_compiler.support.circuit_table import CircuitTable
+from ck.pgm_compiler.support.clusters import min_degree, Clusters
+from ck.pgm_compiler.support.factor_tables import FactorTables, make_factor_tables
+from ck.pgm_compiler.support.join_tree import JoinTree, clusters_to_join_tree
+from ck.program import ProgramBuffer, RawProgram
+from ck_demos.utils.stop_watch import timer
+
+
+def main() -> None:
+    """
+    Time components of the compilation chain for factor elimination.
+
+    Process:
+        example -> PGM
+        min_degree -> Clusters
+        clusters_to_join_tree -> JoinTree
+        join_tree_to_circuit -> PGMCircuit
+        default circuit compiler -> RawProgram
+        execute program
+    """
+    with timer('make PGM') as make_pgm_time:
+        pgm: PGM = example.Mildew()
+
+    with timer('make clusters') as make_clusters_time:
+        clusters: Clusters = min_degree(pgm)
+
+    with timer('make join tree') as make_join_tree_time:
+        join_tree: JoinTree = clusters_to_join_tree(clusters)
+
+    with timer('make factor tables') as make_factor_tables_time:
+        factor_tables: FactorTables = make_factor_tables(
+            pgm=pgm,
+            const_parameters=True,
+            multiply_indicators=True,
+            pre_prune_factor_tables=False,
+        )
+
+    with timer('make circuit tables') as make_circuit_tables_time:
+        top_table: CircuitTable = _circuit_tables_from_join_tree(
+            factor_tables,
+            join_tree,
+            DEFAULT_PRODUCT_SEARCH_LIMIT,
+        )
+    top: CircuitNode = top_table.top()
+    circuit: Circuit = top.circuit
+
+    orig_size = circuit.number_of_op_nodes
+    with timer('remove unreachable nodes') as remove_unreachable_time:
+        circuit.remove_unreachable_op_nodes(top)
+    print(f'    saving  {orig_size - circuit.number_of_op_nodes:10,}')
+    print(f'    leaving {circuit.number_of_op_nodes:10,}')
+
+    with timer('make PGMCircuit') as make_pgm_time:
+        pgm_circuit = PGMCircuit(
+            rvs=tuple(pgm.rvs),
+            conditions=(),
+            circuit_top=top,
+            number_of_indicators=factor_tables.number_of_indicators,
+            number_of_parameters=factor_tables.number_of_parameters,
+            slot_map=factor_tables.slot_map,
+            parameter_values=factor_tables.parameter_values,
+        )
+
+    with timer('make program') as make_program_time:
+        program: RawProgram = DEFAULT_CIRCUIT_COMPILER(pgm_circuit.circuit_top)
+
+    program_buffer = ProgramBuffer(program)
+    with timer('execute program') as execute_program_time:
+        program_buffer.compute()
+
+    print()
+    print(f'make PGM            {make_pgm_time.seconds():5.2f}')
+    print(f'make clusters       {make_clusters_time.seconds():5.2f}')
+    print(f'make join_tree      {make_join_tree_time.seconds():5.2f}')
+    print(f'make factor tables  {make_factor_tables_time.seconds():5.2f}')
+    print(f'make circuit tables {make_circuit_tables_time.seconds():5.2f}')
+    print(f'remove unreachables {remove_unreachable_time.seconds():5.2f}')
+    print(f'make PGM circuit    {make_pgm_time.seconds():5.2f}')
+    print(f'make program        {make_program_time.seconds():5.2f}')
+    print(f'execute program     {execute_program_time.seconds():5.2f}')
+
+    print()
+    print('Done.')
+
+
+if __name__ == '__main__':
+    main()

ck_demos/utils/compare.py

@@ -1,3 +1,4 @@
+import gc
 from typing import Sequence
 
 from ck.circuit_compiler import NamedCircuitCompiler
@@ -88,6 +89,7 @@ def compare(
                         print(f'{"":{col_cct_ops}}', end=sep)
                         print(f'{"":{col_pgm_compile_time}}', end=sep)
                     else:
+                        gc.collect()
                         time.start()
                         pgm_cct: PGMCircuit = pgm_compiler(pgm)
                         time.stop()
@@ -97,6 +99,7 @@ def compare(
                         prev_pgm = pgm
                         prev_pgm_compiler = pgm_compiler
 
+                    gc.collect()
                     time.start()
                     # `pgm_cct` will always be set but the IDE can't work that out.
                     # noinspection PyUnboundLocalVariable
@@ -104,11 +107,12 @@ def compare(
                     time.stop()
                     print(f'{time.seconds():{col_cct_compile_time}{comma}.3f}', end=sep)
 
+                    gc.collect()
                     time.start()
                     for _ in range(1000):
                         wmc.compute()
                     time.stop()
-                    print(f'{time.seconds() * 1000:{col_execute_time}{comma}.3f}', end=sep)
+                    print(f'{time.seconds() * 1000:{col_execute_time}{comma}.3f}', end='')
                 except Exception as err:
                     print(repr(err), end='')
                 print()

{compiled_knowledge-4.0.0a16.dist-info → compiled_knowledge-4.0.0a18.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: compiled-knowledge
-Version: 4.0.0a16
+Version: 4.0.0a18
 Summary: A Python package for compiling and querying discrete probabilistic graphical models.
 Author-email: Barry Drake <barry@compiledknowledge.org>
 License-Expression: MIT

{compiled_knowledge-4.0.0a16.dist-info → compiled_knowledge-4.0.0a18.dist-info}/RECORD

@@ -1,22 +1,20 @@
 ck/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 ck/pgm.py,sha256=rbqgP-clfSvgpzUXxVjk_6SdM9neHmpChku6qpyeidk,120700
-ck/circuit/__init__.py,sha256=tozFNNVzsgQDwFrtGzrgcFS4XTszhgyFmbMGfV5pimc,212
-ck/circuit/circuit.c,sha256=_DN78mWLcGdXOKoZv6Eq-m50KLpOP0SY_GjFrhLJoj0,1773051
-ck/circuit/circuit.cp312-win_amd64.pyd,sha256=T0hYyLn7cjYZ54ki85-HaKltQZcuO6oSWBtx3DNe4iI,252416
-ck/circuit/circuit.pyx,sha256=Y35CZMalySX8_uhNH6wIaZzS6ACn3rh3L99bog1lQx8,28060
-ck/circuit/circuit_node.pyx,sha256=8RuEC1ngYxnsGryzQ1lOEPc4ewTxvKwc56sOxWLB9zs,4103
-ck/circuit/circuit_py.py,sha256=_k8H1yZsfp2vERkX_CIo8VxxOf1ICw2zL8i2ckoaSlE,28127
+ck/circuit/__init__.py,sha256=7ZSBPV6HGKTJ9a_jSAgUbPNOZVHGaeR-e0H1-6cA0HY,621
+ck/circuit/_circuit_cy.cp312-win_amd64.pyd,sha256=9AhhezX-NSuOC0fItKegFsoE3trossTXenTyMzW4d_U,252928
+ck/circuit/_circuit_cy.pxd,sha256=hWdx4rcPS2iwHr6NBTjB38LAJZiLktTXhcoVqmGpwkk,1098
+ck/circuit/_circuit_cy.pyx,sha256=F9ut2mI92pIvBVAaetJqFpxbsBx--mNvHqVCTQ6Ad7k,27622
+ck/circuit/_circuit_py.py,sha256=vN8lg01RyjA_YUphjx1dr0Uj4ql4seczRcoCaH7ylAw,28341
 ck/circuit/tmp_const.py,sha256=dG9FuGfoAG5qjYG1rNwekqKiea_KmVfxHMTOgCPbBiQ,2372
 ck/circuit_compiler/__init__.py,sha256=T0Igyp5jPgnIXv4oRcIYhmsOdcNOb3L4Za6dK6eYk7g,132
 ck/circuit_compiler/circuit_compiler.py,sha256=8BLB8DUnPbpl5PXZsIopydPbItytdn2rzRfM2U1EC84,1018
 ck/circuit_compiler/interpret_compiler.py,sha256=Vlu4VnZ_VWGoBb4yx6wuJOlhJ2nGVhkzQpIyJ8xyjbI,7350
 ck/circuit_compiler/llvm_compiler.py,sha256=ejeNPkO5Og2FyjjyA5JAexxUl1f8IJ6mwU5Ng5EafAA,14009
 ck/circuit_compiler/llvm_vm_compiler.py,sha256=I46_XV5FrClDKO06zIjn8T3ME5XQ9RYJ_1aAE8e_YzM,21873
-ck/circuit_compiler/named_circuit_compilers.py,sha256=gKhRvYLflSCkk6CBI-CBQ2UwR-bhEhMxLvnefPm8288,2282
+ck/circuit_compiler/named_circuit_compilers.py,sha256=snlD3JnhAZC-atKpf5GD0v4CGdvj2_ZhCZ3O-tsxzxc,2284
 ck/circuit_compiler/cython_vm_compiler/__init__.py,sha256=pEAwTleuZgdYhTAQMea2f9YsFK54eoNbZSbrWkW8aeE,49
-ck/circuit_compiler/cython_vm_compiler/_compiler.c,sha256=xpYybtj-aRcMJV1oKkB-p0kciZVW3gLRd0OJBfDg3sc,757006
-ck/circuit_compiler/cython_vm_compiler/_compiler.cp312-win_amd64.pyd,sha256=XSQU7oikafjfsOaiBfI70kS2cLn69kn2CJjKgs2i5cw,92160
-ck/circuit_compiler/cython_vm_compiler/_compiler.pyx,sha256=hHuNo99TbodNpWgQwQ8qzW1cTwGXZj5SW0tKAo9u6cw,7718
+ck/circuit_compiler/cython_vm_compiler/_compiler.cp312-win_amd64.pyd,sha256=KXGhDoWnKSTxyi66ojn2FDlYL5ZqkR8bwQhsA4aLYog,82432
+ck/circuit_compiler/cython_vm_compiler/_compiler.pyx,sha256=L90JvxOXJq1eXy11ykWaFNcWU_p0pyfDVm9A4LKBjr8,8583
 ck/circuit_compiler/cython_vm_compiler/cython_vm_compiler.py,sha256=yUkBNr5HnoVXyWjJdXHp8lyAXFiIDYapvMvHtzKuhI8,3140
 ck/circuit_compiler/support/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 ck/circuit_compiler/support/circuit_analyser.py,sha256=jM0QW2flucvpc6fqcT8mL00ZA0rPTUhaE-yFfFQMXgE,2722
@@ -74,23 +72,25 @@ ck/pgm_circuit/wmc_program.py,sha256=WtABU74FOCCJuKRCoDL4CyZ4CJXFmt9RSxiNNHsOhRY
 ck/pgm_circuit/support/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 ck/pgm_circuit/support/compile_circuit.py,sha256=RuYzDCRpfXZcY96sSW8v7x6ev9ScQ4IZkVqMdJUoMp8,3484
 ck/pgm_compiler/__init__.py,sha256=XCK1AWBBB9UYi6kbFnxMFzBL9a25EWfHnz_yn3ZKYuM,112
-ck/pgm_compiler/factor_elimination.py,sha256=Eu7wJWYjRK4aTEsJP4P_femktbqqZkWN3aI-nqHyNzU,13247
+ck/pgm_compiler/factor_elimination.py,sha256=6iMh_NdOQh4D5cuo8q1y7yUuj3glnM9I0OJ9vlJAGqU,13807
 ck/pgm_compiler/named_pgm_compilers.py,sha256=kYMomYlsW7xbL0hzTWQb41EckkugaCfuYHUJqbEWBBs,3421
 ck/pgm_compiler/pgm_compiler.py,sha256=F44PtlwqMG0FS6KzOYKZuyZT6olWAVtBH-QXZPzz4O8,616
 ck/pgm_compiler/recursive_conditioning.py,sha256=U0NdIns8yLQtYR_MOf1w__CChpOMDlgRCL2nFRhtnzU,7936
-ck/pgm_compiler/variable_elimination.py,sha256=YNBurWTz8_BoaZgRZFj-T9gRVGek7ZutGkvjegyLkCM,3460
+ck/pgm_compiler/variable_elimination.py,sha256=irAZ5b0vRGL_WGq7UrfQpMXhYBZO5YI2U_jf1-YV92Q,3547
 ck/pgm_compiler/ace/__init__.py,sha256=BkZXAF32Pk8QU7jhkuKvHqtsFasPjf8gxiZbyrGDDbQ,82
 ck/pgm_compiler/ace/ace.py,sha256=iyDacqArXW1cVP6tBabxRmmLWIHabuPkCoq2tWBm2ww,10397
 ck/pgm_compiler/support/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-ck/pgm_compiler/support/clusters.py,sha256=96Up5XUgERh-t6KzSIOF2gtP5T4Ul83JK_aPtIR72Ic,20821
-ck/pgm_compiler/support/factor_tables.py,sha256=N7BNBBA-BX6RN-eiDwENtMLczW3JAkV-qW0i0k8OZEM,15558
-ck/pgm_compiler/support/join_tree.py,sha256=tRHev655cwRsOSyLK9HYwfX8EEkubmlg1fw748Kztb4,10418
-ck/pgm_compiler/support/named_compiler_maker.py,sha256=tQ79JOI8MknAziUiFhFGV9n4y6PPKrnbq3-quMmnrwY,974
-ck/pgm_compiler/support/circuit_table/__init__.py,sha256=eWMP5ywgd51RJexKkhcpKJb_8iEluL0C4_hyOpzlAvQ,167
-ck/pgm_compiler/support/circuit_table/circuit_table.c,sha256=aO3bq3V-FwbmJDzWVYwigOFeQUC6gFz-nAq091XQp2E,702527
-ck/pgm_compiler/support/circuit_table/circuit_table.cp312-win_amd64.pyd,sha256=D8n3mBrIXbSPyFVOWJUwKb7F3h1O1SXmdGq7igfQFpA,94720
-ck/pgm_compiler/support/circuit_table/circuit_table.pyx,sha256=jhzstay-3EUgu0CIbWKd0eNDNToX1tmm9IQxk0ZgpYM,11904
-ck/pgm_compiler/support/circuit_table/circuit_table_py.py,sha256=1WFCxgBFu4oaYRCdk_1uXeufFQu6PqMOsYIQ_SkXDS4,10156
+ck/pgm_compiler/support/clusters.py,sha256=7jsZfPqv29vZNxmtiHBCBo3mEfvLQ_ejYh69M_d-nmo,21381
+ck/pgm_compiler/support/factor_tables.py,sha256=tV9qE2zC8iwEQxTuXE6qiE6lmMpz4-Vc80_w5woo1tk,15556
+ck/pgm_compiler/support/join_tree.py,sha256=OGAuZVHzT0i4e6TJ03dOM7e3gbpuW9AyjZKvSBvKvJA,12894
+ck/pgm_compiler/support/named_compiler_maker.py,sha256=g2MLnlkWXkISHL6dh23EY53SptTo7-itfuZogSpMdB8,1420
+ck/pgm_compiler/support/circuit_table/__init__.py,sha256=Ct1i7jP4sZI_G4IU75pubf4tLyMrB8u47ZbTC8_zBqU,576
+ck/pgm_compiler/support/circuit_table/_circuit_table_cy.cp312-win_amd64.pyd,sha256=-vH_LNfBmGcD2fJEaNaARI7zO2bIfiWJNfrbHYrYVTE,93696
+ck/pgm_compiler/support/circuit_table/_circuit_table_cy.pyx,sha256=rVO1yxjZmZ6yv5s0zKq4Ji9WYrDuYTZsRG_zeF1_1xE,12015
+ck/pgm_compiler/support/circuit_table/_circuit_table_cy_cpp_verion.pyx,sha256=C6jQPXmZgLCFf799o1MoRnEr7ihlMYdSf_c4r1TPDEM,20614
+ck/pgm_compiler/support/circuit_table/_circuit_table_cy_minimal_version.pyx,sha256=n7qdSQwnpyQ_0g9esXGtFB3STI7N3uWLzEVhCjNXb_U,11417
+ck/pgm_compiler/support/circuit_table/_circuit_table_cy_v4.0.0a17.pyx,sha256=JLC4_nsRPb8xC3alHE0G9Ojie9K4oUULVPrulkQnhds,11886
+ck/pgm_compiler/support/circuit_table/_circuit_table_py.py,sha256=h6xPYGBSy6XHQBFLPD2D1-V7Kiw9utY68nWrcGRMEg4,11287
 ck/probability/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 ck/probability/empirical_probability_space.py,sha256=HoLxmigzlWFWQlcZQwDOYk-mjgf6RW1IPE-l0t8vMPw,1950
 ck/probability/pgm_probability_space.py,sha256=vK-drx145PWW2aYB8HttQcvhvqPfxVl72bPcFO8jw8M,1034
@@ -110,7 +110,7 @@ ck/sampling/wmc_gibbs_sampler.py,sha256=GMKVW2AVtsWtP6vxE3Y2dy-dKr7GoO_vLEA9eC30
 ck/sampling/wmc_metropolis_sampler.py,sha256=PRv7wtPZz7BcwN8iArsykVwqgY77v5km7rXcawFAUPQ,6470
 ck/sampling/wmc_rejection_sampler.py,sha256=cd0VONZf-oa491RRKfwT2LakQs0o_slgPCes8AOvSNc,4897
 ck/utils/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-ck/utils/iter_extras.py,sha256=DDml5Jprmun2RovJxkwXx1uJkWacYhZEnX1ARSX2TB4,4310
+ck/utils/iter_extras.py,sha256=QNd3mJxPsKN0Wg12K_Iuefto5A2Vv9leuMvymAdt4uo,4479
 ck/utils/local_config.py,sha256=-oTKvKCpm29JeHEhV1_qLC5fMS523unDzXr0VYE3M0U,9535
 ck/utils/map_list.py,sha256=T2OpjI7eDgC4geCtW_FsEr6ryiePOnKZwfDahB63zfA,3847
 ck/utils/map_set.py,sha256=BLu9BO3FCtzZlZ9MfP9STtIdQ4Me8-QKdwB7o15y7f8,3809
@@ -135,7 +135,7 @@ ck_demos/pgm/demo_pgm_string_rendering.py,sha256=JTf_M6pPwl9RtOLlpJFQIgNgGuHnsdd
 ck_demos/pgm/show_examples.py,sha256=KxK37hKqWD9w9k9RoMCdJgkBIMePf8udQbqaFs-s91c,461
 ck_demos/pgm_compiler/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 ck_demos/pgm_compiler/compare_pgm_compilers.py,sha256=pG0OQBl2wjdCIUU0RM70j8TfCjYUxRU0i13OWpfXUHc,1611
-ck_demos/pgm_compiler/demo_compiler_dump.py,sha256=OlLJi1wwdFQxave5lpceyVx0-ihHEn2-d-0XFFTjowY,1370
+ck_demos/pgm_compiler/demo_compiler_dump.py,sha256=Jz51szVxaa21cGzibWZ1rzON3U_fdUana87CdCfSoVE,1672
 ck_demos/pgm_compiler/demo_factor_elimination.py,sha256=KDzYwNZJ9HTcPoNxg6lxFoaXJ26QW-nnBI-0Ux_yWoM,1320
 ck_demos/pgm_compiler/demo_join_tree.py,sha256=E7ZqFrRuAmnSRmBTDqNGxD-KFlHOtd_jIju8UJssUfM,574
 ck_demos/pgm_compiler/demo_marginals_program.py,sha256=44-ZkA8KyWPXWBnbnRGQin6cP_hWY50OfQpy7LckWNo,1863
@@ -144,6 +144,7 @@ ck_demos/pgm_compiler/demo_pgm_compiler.py,sha256=LaBVSD5bXAVvEelQiT_PxA4U9AC76g
 ck_demos/pgm_compiler/demo_recursive_conditioning.py,sha256=kVZ4nQ_vlDM94a3ebjyX9sG4gAvsHdKzlVqUJ4dlxNc,862
 ck_demos/pgm_compiler/demo_variable_elimination.py,sha256=9zDPxTYr6pnxNDBGa989Ffr3tvQdKXioG2A6JPzKw4Y,858
 ck_demos/pgm_compiler/demo_wmc_program.py,sha256=SPyok8RqXY2q6NsQc6e2OW_WtyOw10etPfocRdGF1ng,818
+ck_demos/pgm_compiler/time_fe_compiler.py,sha256=F6huBVmJ3jDdDDXOGt1BVTt5zmGGK127HnnV-RK2zbE,3700
 ck_demos/pgm_inference/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 ck_demos/pgm_inference/demo_inferencing_basic.py,sha256=qrai48Kn7fbpGb_RF5olUsavqzjyZ0JOpk3DvovS18I,5774
 ck_demos/pgm_inference/demo_inferencing_mpe_cancer.py,sha256=HJ3QHUqe090HEbhXHLCtkwDBdcIxec9zbZYDuaWZMW8,1599
@@ -162,12 +163,12 @@ ck_demos/sampling/demo_marginal_direct_sampler.py,sha256=RhNunuIUnYI_GXp9m8wzadM
 ck_demos/sampling/demo_uniform_sampler.py,sha256=Z6tX_OYKGLc_w3-kEPK4KEZlJo7F5HOq_tUVppB_VQE,962
 ck_demos/sampling/demo_wmc_direct_sampler.py,sha256=c7maxTmZyIijaVdFs2h_KQbK30LvI-oCm2BXSUXVoD8,1113
 ck_demos/utils/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-ck_demos/utils/compare.py,sha256=MwigxgMqeV7slrzdIJYVJ340QBCCXOeUzUKOJkkd98w,4972
+ck_demos/utils/compare.py,sha256=Bwjpflevl4nusfA0zp96rInaVKFGuhC5Xv7HzA1Fobk,5088
 ck_demos/utils/convert_network.py,sha256=TSKj8q7L7J5rhrvwjaDkdYZ0Sg8vV5FRL_vCanX1CQw,1363
 ck_demos/utils/sample_model.py,sha256=in-Nlv-iuNIu6y9fDuMyo7nzgimBuTAnCWcpnVqvqDQ,8839
 ck_demos/utils/stop_watch.py,sha256=VzXHRWx0V8vPSD-bLgLlEYkCkR2FA0-KmM_pfKx-Pxo,13205
-compiled_knowledge-4.0.0a16.dist-info/licenses/LICENSE.txt,sha256=uMYx7tmroEKNASizbCOwPveMQsD5UErLDC1_SANmNn8,1089
-compiled_knowledge-4.0.0a16.dist-info/METADATA,sha256=5y-1ZXcu9vGc2PE6lccfgtWTwjOstq_vY0Uk6OT9AQc,1838
-compiled_knowledge-4.0.0a16.dist-info/WHEEL,sha256=b7PoVIxzH_MOHKjftqMzQiGKfdHRlRFepVBVPg0y3vc,101
-compiled_knowledge-4.0.0a16.dist-info/top_level.txt,sha256=Cf8DAfd2vcnLiA7HlxoduOzV0Q-8surE3kzX8P9qdks,12
-compiled_knowledge-4.0.0a16.dist-info/RECORD,,
+compiled_knowledge-4.0.0a18.dist-info/licenses/LICENSE.txt,sha256=uMYx7tmroEKNASizbCOwPveMQsD5UErLDC1_SANmNn8,1089
+compiled_knowledge-4.0.0a18.dist-info/METADATA,sha256=ZjA0RqiyN9UdM20v0vQ_qb7Ru6dr8ZO7Bis-dX7rIM0,1838
+compiled_knowledge-4.0.0a18.dist-info/WHEEL,sha256=8UP9x9puWI0P1V_d7K2oMTBqfeLNm21CTzZ_Ptr0NXU,101
+compiled_knowledge-4.0.0a18.dist-info/top_level.txt,sha256=Cf8DAfd2vcnLiA7HlxoduOzV0Q-8surE3kzX8P9qdks,12
+compiled_knowledge-4.0.0a18.dist-info/RECORD,,

{compiled_knowledge-4.0.0a16.dist-info → compiled_knowledge-4.0.0a18.dist-info}/WHEEL

@@ -1,5 +1,5 @@
 Wheel-Version: 1.0
-Generator: setuptools (80.7.1)
+Generator: setuptools (80.9.0)
 Root-Is-Purelib: false
 Tag: cp312-cp312-win_amd64