relationalai 0.12.9__py3-none-any.whl → 0.12.11__py3-none-any.whl

relationalai/semantics/reasoners/graph/core.py

@@ -20,7 +20,7 @@ from relationalai.semantics import (
     count, sum, avg,
 )
 from relationalai.docutils import include_in_docs
-from relationalai.semantics.internal import annotations
+from relationalai.semantics.internal import annotations, AnyEntity
 from relationalai.semantics.internal import internal as builder_internal # For primitive graph algorithms.
 from relationalai.semantics.std.math import abs, isnan, isinf, maximum, natural_log, sqrt
 from relationalai.semantics.std.integers import int64
@@ -158,7 +158,7 @@ class Graph():
             f"but is a `{type(weighted).__name__}`."
         )
         assert isinstance(model, Model), (
-            "The `model` argument must be a `builder.Model`, "
+            "The `model` argument must be a `relationalai.semantics.Model`, "
             f"but is a `{type(model).__name__}`."
         )
         self.directed = directed
@@ -355,7 +355,7 @@ class Graph():
     @cached_property
     def Node(self) -> Concept:
         """Lazily define and cache the self.Node concept."""
-        _Node = self._user_node_concept or self._model.Concept(self._NodeConceptStr)
+        _Node = self._user_node_concept or self._model.Concept(self._NodeConceptStr, extends=[AnyEntity])
         _Node.annotate(annotations.track("graphs", "Node"))
         return _Node
 
@@ -2304,14 +2304,14 @@ class Graph():
                 # neighbor_a_rel = self._neighbor_of(node_subset_from)
                 #
                 # domain_w = Relationship(f"{{node:{self._NodeConceptStr}}} is the domain of `w` in `common_neighbor(u, v, w)`")
-                # node_x, node_y = graph.Node.ref(), graph.Node.ref()
-                # where(neighbor_a_rel(node_x, node_y)).define(domain_w(node_y))
+                # where(neighbor_a_rel(node_a, node_b)).define(domain_w(node_b))
                 # neighbor_b_rel = self._neighbor_of(domain_w)
                 #
                 # node_constraint = []
                 #
-                # # need to reverse the args of `neighbor_b_rel()`, due to its domain constraint
-                # # relies on the symmetry of `neighbor`
+                # # For this case only, we reverse the args of `neighbor_b_rel()`, which
+                # # is allowed by the symmetry of `neighbor`, in order to take advantage
+                # # of domain constraint on `neighbor_b_rel()`.
                 # where(
                 #     *node_constraint,
                 #     neighbor_a_rel(node_a, neighbor_node),
@@ -2748,15 +2748,15 @@ class Graph():
         if node_subset is None:
             # No constraint - use cached count_inneighbor relationship and all nodes
             count_inneighbor_rel = self._count_inneighbor
-            node_set = self.Node
+            node_constraint = []
         else:
             # Constrained to nodes in the subset - use constrained count_inneighbor relationship
             count_inneighbor_rel = self._count_inneighbor_of(node_subset)
-            node_set = node_subset
+            node_constraint = [node_subset(self.Node)]
 
         # Apply the same indegree logic for both cases
         where(
-            node_set(self.Node),
+            *node_constraint,
             _indegree := where(count_inneighbor_rel(self.Node, Integer)).select(Integer) | 0,
         ).define(_indegree_rel(self.Node, _indegree))
 
@@ -2933,15 +2933,15 @@ class Graph():
         if node_subset is None:
             # No constraint - use cached count_outneighbor relationship and all nodes
             count_outneighbor_rel = self._count_outneighbor
-            node_set = self.Node
+            node_constraint = []
         else:
             # Constrained to nodes in the subset - use constrained count_outneighbor relationship
             count_outneighbor_rel = self._count_outneighbor_of(node_subset)
-            node_set = node_subset
+            node_constraint = [node_subset(self.Node)]
 
         # Apply the same outdegree logic for both cases
         where(
-            node_set(self.Node),
+            *node_constraint,
             _outdegree := where(count_outneighbor_rel(self.Node, Integer)).select(Integer) | 0,
         ).define(_outdegree_rel(self.Node, _outdegree))
 
@@ -3099,12 +3099,12 @@ class Graph():
             node, neighbor, weight = self.Node.ref(), self.Node.ref(), Float.ref()
 
             if node_subset is None:
-                node_constraint = node  # No constraint on nodes.
+                node_constraint = []  # No constraint on nodes.
             else:
-                node_constraint = node_subset(node)  # Nodes constrained to given subset.
+                node_constraint = [node_subset(node)]  # Nodes constrained to given subset.
 
             where(
-                node_constraint,
+                *node_constraint,
                 weighted_degree_no_loops := sum(neighbor, weight).per(node).where(
                     self._weight(node, neighbor, weight),
                     node != neighbor,
@@ -3172,7 +3172,7 @@ class Graph():
         >>> define(n1, n2, n3)
         >>> define(
         ...     Edge.new(src=n1, dst=n2, weight=1.0),
-        ...     Edge.new(src=n2, dst=n1, weight=-1.0),
+        ...     Edge.new(src=n2, dst=n1, weight=0.0),
         ...     Edge.new(src=n2, dst=n3, weight=1.0),
         ... )
         >>>
@@ -3186,7 +3186,7 @@ class Graph():
         ... ).inspect()
         ▰▰▰▰ Setup complete
             id  node_weighted_indegree
-        0   1                    -1.0
+        0   1                     0.0
         1   2                     1.0
         2   3                     1.0
         >>>
@@ -3218,9 +3218,6 @@ class Graph():
         weighted_outdegree
 
         """
-        # TODO: It looks like the weights in the example in the docstring above
-        #   are holdovers from a version of the library that did not disallow
-        #   negative weights. Need to update the example to use only non-negative weights.
         if of is None:
             return self._weighted_indegree
         else:
@@ -3251,20 +3248,15 @@ class Graph():
         # Choose the appropriate node set
         if node_subset is None:
             # No constraint - use all nodes
-            node_set = self.Node
+            node_constraint = []
         else:
             # Constrained to nodes in the subset
-            node_set = node_subset
-        # TODO: In a future cleanup pass, replace `node_set` with a `node_constraint`
-        #   that replaces the `node_set(self.Node)` in the where clause below,
-        #   and generates only `self.Node` (rather than `self.Node(self.Node)`)
-        #   in the `subset is None` case. This applies to a couple other
-        #   degree-of type relations as well.
+            node_constraint = [node_subset(self.Node)]
 
         # Apply the weighted indegree logic for both cases
         src, inweight = self.Node.ref(), Float.ref()
         where(
-            node_set(self.Node),
+            *node_constraint,
             _weighted_indegree := sum(src, inweight).per(self.Node).where(self._weight(src, self.Node, inweight)) | 0.0,
         ).define(_weighted_indegree_rel(self.Node, _weighted_indegree))
 
@@ -3324,7 +3316,7 @@ class Graph():
         >>> define(n1, n2, n3)
         >>> define(
         ...     Edge.new(src=n1, dst=n2, weight=1.0),
-        ...     Edge.new(src=n2, dst=n1, weight=-1.0),
+        ...     Edge.new(src=n2, dst=n1, weight=0.0),
         ...     Edge.new(src=n2, dst=n3, weight=1.0),
         ... )
         >>>
@@ -3339,7 +3331,7 @@ class Graph():
         ▰▰▰▰ Setup complete
             id  node_weighted_outdegree
         0   1                      1.0
-        1   2                      0.0
+        1   2                      1.0
         2   3                      0.0
         >>>
         >>> # 4. Use 'of' parameter to constrain the set of nodes to compute weighted outdegree of
@@ -3355,7 +3347,7 @@ class Graph():
         ▰▰▰▰ Setup complete
             id  node_weighted_outdegree
         0   1                      1.0
-        1   2                      0.0
+        1   2                      1.0
 
         Notes
         -----
@@ -3404,15 +3396,15 @@ class Graph():
         # Choose the appropriate node set
         if node_subset is None:
             # No constraint - use all nodes
-            node_set = self.Node
+            node_constraint = []
         else:
             # Constrained to nodes in the subset
-            node_set = node_subset
+            node_constraint = [node_subset(self.Node)]
 
         # Apply the weighted outdegree logic for both cases
         dst, outweight = self.Node.ref(), Float.ref()
         where(
-            node_set(self.Node),
+            *node_constraint,
             _weighted_outdegree := sum(dst, outweight).per(self.Node).where(self._weight(self.Node, dst, outweight)) | 0.0,
         ).define(_weighted_outdegree_rel(self.Node, _weighted_outdegree))
 
@@ -4537,12 +4529,12 @@ class Graph():
         _triangle_count_rel = self._model.Relationship(f"{{node:{self._NodeConceptStr}}} belongs to {{count:Integer}} triangles")
 
         if node_subset is None:
-            node_constraint = self.Node # No constraint on nodes.
+            node_constraint = [] # No constraint on nodes.
         else:
-            node_constraint = node_subset(self.Node)  # Nodes constrained to given subset.
+            node_constraint = [node_subset(self.Node)]  # Nodes constrained to given subset.
 
         where(
-            node_constraint,
+            *node_constraint,
             _count := self._nonzero_triangle_count_fragment(self.Node) | 0
         ).define(_triangle_count_rel(self.Node, _count))
 
@@ -4819,16 +4811,16 @@ class Graph():
         if node_subset is None:
             degree_no_self_rel = self._degree_no_self
             triangle_count_rel = self._triangle_count
-            node_constraint = node  # No constraint on nodes.
+            node_constraint = []  # No constraint on nodes.
         else:
             degree_no_self_rel = self._degree_no_self_of(node_subset)
             triangle_count_rel = self._triangle_count_of(node_subset)
-            node_constraint = node_subset(node)  # Nodes constrained to given subset.
+            node_constraint = [node_subset(node)]  # Nodes constrained to given subset.
 
         degree_no_self = Integer.ref()
         triangle_count = Integer.ref()
         where(
-            node_constraint,
+            *node_constraint,
             _lcc := where(
                 degree_no_self_rel(node, degree_no_self),
                 triangle_count_rel(node, triangle_count),
@@ -4866,12 +4858,12 @@ class Graph():
         node, neighbor = self.Node.ref(), self.Node.ref()
 
         if node_subset is None:
-            node_constraint = node  # No constraint on nodes.
+            node_constraint = []  # No constraint on nodes.
         else:
-            node_constraint = node_subset(node)  # Nodes constrained to given subset.
+            node_constraint = [node_subset(node)]  # Nodes constrained to given subset.
 
         where(
-            node_constraint,
+            *node_constraint,
             _dns := count(neighbor).per(node).where(self._no_loop_edge(node, neighbor)) | 0,
         ).define(_degree_no_self_rel(node, _dns))
 
@@ -7296,7 +7288,7 @@ class Graph():
 
         # TODO: Optimization opportunity. In some of the cases below
         #   (unweighted in particular), the node_constraint is redundant with
-        #   the constraints baked into the _count_outneigherbor_of and
+        #   the constraints baked into the _count_outneighbor_of and
         #   _outneighbor_of relationships. The join with node_constraint
         #   could be eliminated in those cases. Possibly also relevant to
         #   other domain-constrained relations.
@@ -7366,19 +7358,18 @@ class Graph():
         # Define cosine similarity logic for both weighted and unweighted cases.
         if not self.weighted:
             # Unweighted case: use count of common outneighbors.
-            count_outneighor_u, count_outneighor_v = Integer.ref(), Integer.ref()
+            count_outneighbor_u, count_outneighbor_v = Integer.ref(), Integer.ref()
             common_outneighbor_node = self.Node.ref()
-            score = Float.ref()
 
             where(
                 *node_constraints,
-                count_outneighbor_u_rel(node_u, count_outneighor_u),
-                count_outneighbor_v_rel(node_v, count_outneighor_v),
+                count_outneighbor_u_rel(node_u, count_outneighbor_u),
+                count_outneighbor_v_rel(node_v, count_outneighbor_v),
                 c_common := count(common_outneighbor_node).per(node_u, node_v).where(
                     outneighbor_u_rel(node_u, common_outneighbor_node),
                     outneighbor_v_rel(node_v, common_outneighbor_node),
                 ),
-                score := c_common / sqrt(count_outneighor_u * count_outneighor_v),
+                score := c_common / sqrt(count_outneighbor_u * count_outneighbor_v),
             ).define(
                 _cosine_similarity_rel(node_u, node_v, score)
             )
@@ -8186,13 +8177,13 @@ class Graph():
         neighbor_node = self.Node.ref()
         if node_subset is not None:
             neighbor_rel = self._neighbor_of(node_subset)
-            node_constraint = node_subset(self.Node)
+            node_constraint = [node_subset(self.Node)]
         else:
             neighbor_rel = self._neighbor
-            node_constraint = self.Node
+            node_constraint = []
 
         where(
-            node_constraint,
+            *node_constraint,
             not_(neighbor_rel(self.Node, neighbor_node))
         ).define(_isolated_node_rel(self.Node))
 

relationalai/tools/debugger.py

@@ -3,6 +3,8 @@ import re
 from nicegui import ui
 import json
 
+from relationalai.debugging import DEBUG_LOG_FILE
+
 
 last_mod_time = None
 current_json_objects = []
@@ -141,12 +143,12 @@ def poll():
     global current_json_objects
     # Check the last modification time of the file
     try:
-        mod_time = os.path.getmtime('debug.jsonl')
+        mod_time = os.path.getmtime(DEBUG_LOG_FILE)
         if last_mod_time is None or mod_time > last_mod_time:
             last_mod_time = mod_time
             # File has changed, read and parse the new content
             new_objects = []
-            with open('debug.jsonl', 'r') as file:
+            with open(DEBUG_LOG_FILE, 'r') as file:
                 for line in file:
                     try:
                         # Parse each JSON object and add it to the list

relationalai/tools/qb_debugger.py

@@ -3,6 +3,8 @@ import re
 from nicegui import ui
 import json
 
+from relationalai.debugging import DEBUG_LOG_FILE
+
 #--------------------------------------------------
 # Terminal nodes
 #--------------------------------------------------
@@ -12,7 +14,7 @@ TERMINAL_NODES = [
 ]
 
 #--------------------------------------------------
-# debug.jsonl helpers
+# Debug log helpers
 #--------------------------------------------------
 
 class SpanNode:
@@ -344,11 +346,11 @@ def poll():
     global current_json_objects
     # Check the last modification time of the file
     try:
-        mod_time = os.path.getmtime('debug.jsonl')
+        mod_time = os.path.getmtime(DEBUG_LOG_FILE)
         if last_mod_time is None or mod_time > last_mod_time:
             last_mod_time = mod_time
             # File has changed, read and parse the new content
-            with open('debug.jsonl', 'r') as file:
+            with open(DEBUG_LOG_FILE, 'r') as file:
                 content = file.read()
                 if content:
                     new_tree = parse_jsonl_to_tree(content)

{relationalai-0.12.9.dist-info → relationalai-0.12.11.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: relationalai
-Version: 0.12.9
+Version: 0.12.11
 Summary: RelationalAI Library and CLI
 Author-email: RelationalAI <support@relational.ai>
 License-File: LICENSE
@@ -11,7 +11,7 @@ Requires-Dist: colorama
 Requires-Dist: cryptography
 Requires-Dist: gravis
 Requires-Dist: inquirerpy
-Requires-Dist: lqp==0.1.18
+Requires-Dist: lqp==0.1.19
 Requires-Dist: nicegui==2.16.1
 Requires-Dist: numpy<2
 Requires-Dist: opentelemetry-api

{relationalai-0.12.9.dist-info → relationalai-0.12.11.dist-info}/RECORD

@@ -1,6 +1,6 @@
-relationalai/__init__.py,sha256=pqV4xZy0r6EFZAoW6RXOFrfeiLPxgdCBu0L35KHXOyU,7684
+relationalai/__init__.py,sha256=TxQjYI8QhbHBXvQa4ktMlBbFbgMqGd0-KrlYPvB334Q,8146
 relationalai/compiler.py,sha256=5LZY8AyqadkTLSe_xoJ3J9iXOmetz5YQn9EjJKk8XeQ,6411
-relationalai/debugging.py,sha256=dfT0gEDpL56GflVmtUrYVbYcVcZmQL26Vf_F8cI1QKY,11891
+relationalai/debugging.py,sha256=wqGly2Yji4ErdV9F_S1Bny35SiGqI3C7S-hap7B8yUs,11997
 relationalai/dependencies.py,sha256=tL113efcISkJUiDXYHmRdU_usdD7gmee-VRHA7N4EFA,16574
 relationalai/docutils.py,sha256=1gVv9mk0ytdMB2W7_NvslJefmSQtTOg8LHTCDcGCjyE,1554
 relationalai/dsl.py,sha256=UJr93X8kwnnyUY-kjPzp_jhsp2pYBUnDfu8mhNXPNII,66116
@@ -18,7 +18,7 @@ relationalai/auth/jwt_generator.py,sha256=bQY2-EhvKcidamWB4tiRO8VVl_5bH0GC9Y6ySH
 relationalai/auth/oauth_callback_server.py,sha256=vbcpz77n_WKMDZ4sac6IYyrpxScR0DHlf5VFHMwjHGg,3908
 relationalai/auth/token_handler.py,sha256=d5aueGEiK6BmzkxSab3reCdkhtjdphb0CeecyvvNaQU,19443
 relationalai/auth/util.py,sha256=oXOUwW5gaBhEV5v5A-q2ME1VnfjfRWswvRlXW4oBYpk,1116
-relationalai/clients/__init__.py,sha256=0c_oqvpVN7pccc6q8fw11zSOVK-utlRTmd1ECjgMkmU,302
+relationalai/clients/__init__.py,sha256=-LHT6vQmleYqAaNerV0OdHy56-s4nxFSmZFsQXfgnrI,318
 relationalai/clients/azure.py,sha256=6tYHxKVN2fHMIDV7J_EHZD9WntkYh2IreMRMqlq1Bhg,20634
 relationalai/clients/cache_store.py,sha256=A-qd11wcwN3TkIqvlN0_iFUU3aEjJal3T2pqFBwkkzQ,3966
 relationalai/clients/client.py,sha256=4SSunUwuFEcRFXOPYotpSLDPr0CKuwJ4335W0DesR90,35792
@@ -26,6 +26,7 @@ relationalai/clients/config.py,sha256=hERaKjc3l4kd-kf0l-NUOHrWunCn8gmFWpuE0j3ScJ
 relationalai/clients/direct_access_client.py,sha256=VGjQ7wzduxCo04BkxSZjlPAgqK-aBc32zIXcMfAzzSU,6436
 relationalai/clients/export_procedure.py.jinja,sha256=nhvVcs5hQyWExFDuROQbi1VyYzOCa_ZIRPR2KzZwDtI,10582
 relationalai/clients/hash_util.py,sha256=pZVR1FX3q4G_19p_r6wpIR2tIM8_WUlfAR7AVZJjIYM,1495
+relationalai/clients/local.py,sha256=uX1Or2WO0juDuqa6TCCvm3G2ieP6p0PtYp_jfrCMlVc,23577
 relationalai/clients/profile_polling.py,sha256=pUH7WKH4nYDD0SlQtg3wsWdj0K7qt6nZqUw8jTthCBs,2565
 relationalai/clients/result_helpers.py,sha256=wDSD02Ngx6W-YQqBIGKnpXD4Ju3pA1e9Nz6ORRI6SRI,17808
 relationalai/clients/snowflake.py,sha256=QPJrRolINDkjZb8xyuvaLJIWOEYXdeALLSNqIAAXUEY,166006
@@ -294,41 +295,43 @@ relationalai/loaders/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hS
 relationalai/loaders/csv.py,sha256=SyzLDQb46Y0QGdahxkp1_mII3NhxCkyCWNwQUielXXs,7743
 relationalai/loaders/loader.py,sha256=FExfWHYyOPv_5f17N4wEIqRRWBPGfC13XvD791Ik93Y,7180
 relationalai/loaders/types.py,sha256=w4kvPMpuRoz2ckOCakHrSvtXLetVsQHLi4V3up8hzig,619
-relationalai/semantics/__init__.py,sha256=RTWxOsS6oCMO-T8z3-rjrhjejQIvErwlLxbVDKEpulE,911
+relationalai/semantics/__init__.py,sha256=SnJCjUGj-y9e5-75jxLsiZRM_xLmhOVaZwmgxtscinI,935
 relationalai/semantics/designs/query_builder/identify_by.md,sha256=AsbusFqT6YB44-iEGfuH4GVOxf1ZjxkpFovvWPMJHuI,4877
 relationalai/semantics/devtools/__init__.py,sha256=hckMw2EtrVBiE71ABXX8bWPdI-6DV9uHqkhYG_nl8S4,85
 relationalai/semantics/devtools/benchmark_lqp.py,sha256=btySKVtUUNBuPY-l6DrkbRNlvZcNXrKUqdvo_Hqsc98,21242
 relationalai/semantics/devtools/compilation_manager.py,sha256=XBqG_nYWtK3s_J6MeCmkLqy3qm7l778zDAhH7DEO91g,11169
 relationalai/semantics/devtools/extract_lqp.py,sha256=gxI3EvPUTPAkwgnkCKAkEm2vA6QkLfoM8AXXiVz0c34,3696
-relationalai/semantics/internal/__init__.py,sha256=JXrpFaL-fdZrvKpWTEn1UoLXITOoTGnAYwmgeiglhSk,774
+relationalai/semantics/internal/__init__.py,sha256=BS0WE1GbT-HpQ5p_zMr9Fcvph562WMvMQNI9czfKNt0,798
 relationalai/semantics/internal/annotations.py,sha256=PkrRN-gHO2ksh1hDKB1VVIB39dONvLdTd8_Y0rCR3fE,367
-relationalai/semantics/internal/internal.py,sha256=hElTyxtnTfNsmX9kJZ2I5yU4yA3udFyu2xk-qq8G3T0,149986
+relationalai/semantics/internal/internal.py,sha256=U3FV4jgWRJGFPk7ZwPzOQl_YMHcwBFH6kXrxJNs5OjA,150750
 relationalai/semantics/internal/snowflake.py,sha256=8D6WYDFKtt8R-sc9o1Oxgtl6Xwehs2Txw_lKNBid7UA,13467
+relationalai/semantics/lqp/README.md,sha256=9DsEL81q5z49YteGzLPBs_HhpZS1vO--MOBlQpCkI_Q,1116
 relationalai/semantics/lqp/__init__.py,sha256=XgcQZxK-zz_LqPDVtwREhsIvjTuUIt4BZhIedCeMY-s,48
 relationalai/semantics/lqp/builtins.py,sha256=IWRYJ1J-HGEQqBn8QVOyjZvgEiq6W9tZ0nBLdHz5wjA,576
 relationalai/semantics/lqp/compiler.py,sha256=oOGlN03NVvltKN5KSDOqvb0TsAER_igUe9CnOcHAuoY,943
-relationalai/semantics/lqp/constructors.py,sha256=KWXW3OxpZE8E-OYYjrjE_uFAXRekuGHn0TNSPPQyY7g,2336
-relationalai/semantics/lqp/executor.py,sha256=7Jk2eKlGZ0H4wXInjnHKZehDVGOq09W6zY1mFALwIyE,21160
+relationalai/semantics/lqp/constructors.py,sha256=bGFUv3tLCJD8lGOSGRAPntTBOgczio96_Gn49YoHpl0,2363
+relationalai/semantics/lqp/executor.py,sha256=GuPiSJpLaMYqjZOlVEFLOUilyuLcfkQgZ62UoxMpvtM,21597
 relationalai/semantics/lqp/intrinsics.py,sha256=oKPIcW8PYgU-yPTO21iSF00RBsFKPFFP5MICe6izjKk,871
-relationalai/semantics/lqp/ir.py,sha256=DUw0ltul0AS9CRjntNlmllWTwXpxMyYg4iJ9t7NFYMA,1791
-relationalai/semantics/lqp/model2lqp.py,sha256=mtxXXOMWTMrLYyB84x0OqdmwAACfQ7au1IhiKZ2_lqY,35262
-relationalai/semantics/lqp/passes.py,sha256=WNVuGxf1jU-UYyoEW5XvnREwJ-NW4_iMECW-Gaphaq8,28531
+relationalai/semantics/lqp/ir.py,sha256=6W9mUH0W7u5eIfF1S3o33uSOfQuM3UcqEkxrxpr1X_8,1867
+relationalai/semantics/lqp/model2lqp.py,sha256=PTe2PtHioWAclu6tdkCu5iGaHJxPIe7zIG1Ew72qxDo,36957
+relationalai/semantics/lqp/passes.py,sha256=i5LrS92Wn-Aa6Hase4UXlogUEGL_tUYHNAYDr16CVw0,28540
 relationalai/semantics/lqp/pragmas.py,sha256=FzzldrJEAZ1AIcEw6D-FfaVg3CoahRYgPCFo7xHfg1g,375
 relationalai/semantics/lqp/primitives.py,sha256=9Hjow-Yp06jt0xatuUrH1dw0ErnzknIr9K0TB_AwdjU,11029
 relationalai/semantics/lqp/result_helpers.py,sha256=oYpLoTBnzsiyOVIWA2rLMHlgs7P7BoEkqthQ2aMosnk,10123
 relationalai/semantics/lqp/types.py,sha256=3TZ61ybwNV8lDyUMujZIWNFz3Fgn4uifsJb8ExfoMDg,4508
 relationalai/semantics/lqp/utils.py,sha256=iOoS-f8kyFjrgAnpK4cWDvAA-WmPgDRggSKUXm_JdTc,6317
-relationalai/semantics/lqp/validators.py,sha256=YO_ciSgEVNILWUbkxIagKpIxI4oqV0fRSTO2Ok0rPJk,1526
-relationalai/semantics/lqp/rewrite/__init__.py,sha256=3LxYHZm6-vaqs-5Co9DQ8awxk838f5huiR5OEaLc8Ww,411
+relationalai/semantics/lqp/validators.py,sha256=FlKMKclHj0L71QUtl0aqKknqksSWM-di4N9bjGDJvnY,1561
+relationalai/semantics/lqp/rewrite/__init__.py,sha256=V9ERED9qdh4VvY9Ud_M8Zn8lhVANdOGIgW03l55sGj0,492
+relationalai/semantics/lqp/rewrite/annotate_constraints.py,sha256=W0_pQYWuq7ocEWNp5rWnq7YjRuJwsEHan1gIrAiRCXU,2201
 relationalai/semantics/lqp/rewrite/cdc.py,sha256=I6DeMOZScx-3UAVoSCMn9cuOgLzwdvJVKNwsgFa6R_k,10390
 relationalai/semantics/lqp/rewrite/extract_common.py,sha256=sbihURqk4wtc1ekDWXWltq9LrO42XTLfOHl5D6nT5vw,18371
-relationalai/semantics/lqp/rewrite/extract_keys.py,sha256=dSr5SVkYmrhiR0XPY5eRAnWD66dcZYgXdilXcERv634,18682
+relationalai/semantics/lqp/rewrite/extract_keys.py,sha256=iSbwGQG9p8j-erknEwl2pZkunJEpXTlnL9ohr4KVS8M,19317
 relationalai/semantics/lqp/rewrite/function_annotations.py,sha256=9ZzLASvXh_OgQ04eup0AyoMIh2HxWHkoRETLm1-XtWs,4660
-relationalai/semantics/lqp/rewrite/functional_dependencies.py,sha256=pQo7a7oS1wsep3ObdxPPaV962RlR0iBWzBmd7lCzCvQ,11564
-relationalai/semantics/lqp/rewrite/quantify_vars.py,sha256=wYMEXzCW_D_Y_1rSLvuAAqw9KN1oIOn_vIMxELzRVb4,11568
+relationalai/semantics/lqp/rewrite/functional_dependencies.py,sha256=4oQcVQtAGDqY850B1bNszigQopf6y9Y_CaUyWx42PtM,12718
+relationalai/semantics/lqp/rewrite/quantify_vars.py,sha256=bOowgQ45zmP0HOhsTlE92WdVBCTXSkszcCYbPMeIibw,12004
 relationalai/semantics/lqp/rewrite/splinter.py,sha256=oeDjP_F2PVLVexAKFn8w7CLtO9oy-R-tS2IOmzw_Ujk,3199
 relationalai/semantics/metamodel/__init__.py,sha256=I-XqQAGycD0nKkKYvnF3G9d0QK_1LIM4xXICw8g8fBA,805
-relationalai/semantics/metamodel/builtins.py,sha256=lW8VdaSICyr8gxhFzaE-fD8wHSLBuErDOzntEC9FNL0,38407
+relationalai/semantics/metamodel/builtins.py,sha256=O26klqMH4ud5nqb2Os6ISsxaPsCj5X1eVKD5RuGUmtA,38657
 relationalai/semantics/metamodel/compiler.py,sha256=XBsAnbFwgZ_TcRry6yXGWLyw_MaO2WJDp1EnC_ubhps,4525
 relationalai/semantics/metamodel/dataflow.py,sha256=wfj1tARrR4yEAaTwUTrAcxEcz81VkUal4U_AX1esovk,3929
 relationalai/semantics/metamodel/dependency.py,sha256=iJLx-w_zqde7CtbGcXxLxZBdUKZYl7AUykezPI9ccck,33926
@@ -336,23 +339,23 @@ relationalai/semantics/metamodel/executor.py,sha256=_pm--QNvAjd-GgiMKMrpkPZ2eE0H
 relationalai/semantics/metamodel/factory.py,sha256=Vk3ASwWan08mfGehoOOwMixuU_mEbG2vNl8JLSCJ2OU,12581
 relationalai/semantics/metamodel/helpers.py,sha256=aeXWkS-iKfLqqXtlMjQZyqIIiIsG9dqP4cQA3cUmM08,15403
 relationalai/semantics/metamodel/ir.py,sha256=4Xl3oc92Q7_s33axtrZUXr-GL8VGJsKc7yaSNcO6jXY,33578
-relationalai/semantics/metamodel/types.py,sha256=m3NolF3B_fBSnkQKA9o1feEawaW7RhR-t6W9OSxSFfc,11492
+relationalai/semantics/metamodel/types.py,sha256=9ErIkHgsTcPgsoEet-meiftLs4W1MJb-G1H_1EzFfLY,11557
 relationalai/semantics/metamodel/util.py,sha256=cmSmeww34JVMqcFudwVAY820IPM2ETSELJylwJ3GRJk,16654
 relationalai/semantics/metamodel/visitor.py,sha256=DFY0DACLhxlZ0e4p0vWqbK6ZJr_GWEvH66CU_HVuoTk,35527
 relationalai/semantics/metamodel/rewrite/__init__.py,sha256=9ONWFSdMPHkWpObDMSljt8DywhpFf4Ehsq1aT3fTPt8,344
 relationalai/semantics/metamodel/rewrite/discharge_constraints.py,sha256=0v613BqCLlo4sgWuZjcLSxxakp3d34mYWbG4ldhzGno,1949
 relationalai/semantics/metamodel/rewrite/dnf_union_splitter.py,sha256=ZXX190gCKXhdB-Iyi4MGowc4FS9P0PIJTtTT0LrTr6A,7970
 relationalai/semantics/metamodel/rewrite/extract_nested_logicals.py,sha256=vQ0-7t_GORskB1ZG50KuzM4phm6YNPvehfFn3v_LbgI,3354
-relationalai/semantics/metamodel/rewrite/flatten.py,sha256=uw7pKBGdrGqGYZU9NewAjvqRuhJk7As49hA_Wcwfp2k,21918
+relationalai/semantics/metamodel/rewrite/flatten.py,sha256=SWvDA3NJqU0ZEJ3kzaXaJ6ZC9xeHuZ8Ju9S1jxU1Nyc,22189
 relationalai/semantics/metamodel/rewrite/format_outputs.py,sha256=n0IxC3RL3UMly6MWsq342EGfL2yGj3vOgVG_wg7kt-o,6225
 relationalai/semantics/metamodel/typer/__init__.py,sha256=E3ydmhWRdm-cAqWsNR24_Qd3NcwiHx8ElO2tzNysAXc,143
 relationalai/semantics/metamodel/typer/checker.py,sha256=frY0gilDO6skbDiYFiIpDUOWyt9s9jAJsRBs848DcG0,19184
-relationalai/semantics/metamodel/typer/typer.py,sha256=7kD5o08Q1bv9M5aUn9diDM5AfiuiRYi37xplqcVyLT8,62363
+relationalai/semantics/metamodel/typer/typer.py,sha256=6yyLfGXPuh71TbAvK4I9AkMI4Ap5LlHhhMuDYWzj6Dw,62774
 relationalai/semantics/reasoners/__init__.py,sha256=cLrGNKFX859EdPjk2n6MdYLvueaFtTEnfVYnBriQMfI,303
 relationalai/semantics/reasoners/experimental/__init__.py,sha256=ZWXb3Oun7m_G2c3ijKnqxbEsAzTMVa7ciBXjdi4dCNI,144
 relationalai/semantics/reasoners/graph/README.md,sha256=QgKEXTllp5PO-yK8oDfMx1PNTYF2uVoneMRKsWTY5GU,23953
 relationalai/semantics/reasoners/graph/__init__.py,sha256=jSXR6J05SQZdjxQ5Y-ovqFqGTAXCOWeQDcvpfoBYgDA,1282
-relationalai/semantics/reasoners/graph/core.py,sha256=CBerRlgcNoiur8kIJTRnLFllibK7pBFrfViY1yfRXfI,400039
+relationalai/semantics/reasoners/graph/core.py,sha256=2ZzGTWlS-IUTqVcdVx0w_GrgxIyppCvHsls1uBjFe4Q,399524
 relationalai/semantics/reasoners/graph/design/beyond_demand_transform.md,sha256=Givh0W6B6Hlow6TpmK-8adpEYd8b3O_WmdgMOQIyKs0,55749
 relationalai/semantics/reasoners/graph/tests/README.md,sha256=XbauTzt6VA_YEOcrlZwsu4WOW5UoWV8M6F57wmxe5QU,1023
 relationalai/semantics/reasoners/optimization/__init__.py,sha256=lpavly1Qa3VKvLgrbpp-tsxY9hcqHL6buxuekgKPakw,2212
@@ -408,12 +411,12 @@ relationalai/tools/cli.py,sha256=EBrPdJQsltUQGClQTYaEDVmEmm4w_UGdb8fT_DKIeOQ,770
 relationalai/tools/cli_controls.py,sha256=84K0sjfsVwqi9C8ZlpvPi6XZPhjyW-R06Pir9Ex_Xtg,70468
 relationalai/tools/cli_helpers.py,sha256=r-gJnWnb3d6yIn_ccyp3qx_Vpqh-FINCFMyPBVCA-Jg,14041
 relationalai/tools/constants.py,sha256=A8Qz0CPs2cRUs5xaZ-Y7BCyvqmI6RLvipzwLDYZ3_PU,4505
-relationalai/tools/debugger.py,sha256=yb03qO8ENHG2rBOPOF-rPKHGrJmaNy6iWXijg6T0dUI,6881
+relationalai/tools/debugger.py,sha256=iWO1tMJud3dXHIkrjdZ5Temp0MR2AwN5_QGDt-ddmcs,6934
 relationalai/tools/debugger_client.py,sha256=g9vBaeJLKVq6vW63W-KKSaPJ--g5Wuf4LcIuYRA_pk4,3729
 relationalai/tools/debugger_server.py,sha256=UXVMtbmvgp7IqN9TzVnUvPj-TVrb6GzJOJ2z15Al9YU,9880
 relationalai/tools/dev.py,sha256=ZFYbBj25Wf5iy6womAEkLF5RD6O0vZLAOUPQgPcKkS8,22931
 relationalai/tools/notes,sha256=5ufkUHNktVRvQayBVktn2rLgDBapAEKxKJxQ20tRjpA,263
-relationalai/tools/qb_debugger.py,sha256=EKGf_b8wdxxVLz_zo2PfHOPyvpTtPNwEx9ndKg-lq_w,16322
+relationalai/tools/qb_debugger.py,sha256=A9SyD1z77Ocsxm42XhUl-QspDylEtBe5K_Khxnq3Xhs,16373
 relationalai/tools/query_utils.py,sha256=SevPuWHZUjHc4A-RbyiJN0oWAVQGGo72UM3Saj29DwY,821
 relationalai/tools/snapshot_viewer.py,sha256=60DW41X4NpjxmPjf1B8mG3oIocHMLLNEbThIdJavi_o,28779
 relationalai/util/__init__.py,sha256=FcHFPzeyDcQwENQg2KA70lBsFx5TtN7xo0quy_cJDQI,208
@@ -439,8 +442,8 @@ frontend/debugger/dist/index.html,sha256=0wIQ1Pm7BclVV1wna6Mj8OmgU73B9rSEGPVX-Wo
 frontend/debugger/dist/assets/favicon-Dy0ZgA6N.png,sha256=tPXOEhOrM4tJyZVJQVBO_yFgNAlgooY38ZsjyrFstgg,620
 frontend/debugger/dist/assets/index-Cssla-O7.js,sha256=MxgIGfdKQyBWgufck1xYggQNhW5nj6BPjCF6Wleo-f0,298886
 frontend/debugger/dist/assets/index-DlHsYx1V.css,sha256=21pZtAjKCcHLFjbjfBQTF6y7QmOic-4FYaKNmwdNZVE,60141
-relationalai-0.12.9.dist-info/METADATA,sha256=r7ebl7OUAHSnHZxFdPUL8woKPut0wWKjJ6Z1wvHc6Ko,2562
-relationalai-0.12.9.dist-info/WHEEL,sha256=WLgqFyCfm_KASv4WHyYy0P3pM_m7J5L9k2skdKLirC8,87
-relationalai-0.12.9.dist-info/entry_points.txt,sha256=fo_oLFJih3PUgYuHXsk7RnCjBm9cqRNR--ab6DgI6-0,88
-relationalai-0.12.9.dist-info/licenses/LICENSE,sha256=pPyTVXFYhirkEW9VsnHIgUjT0Vg8_xsE6olrF5SIgpc,11343
-relationalai-0.12.9.dist-info/RECORD,,
+relationalai-0.12.11.dist-info/METADATA,sha256=Gaq2yLT7R1yQ5rf6a7IwR1fWRaFaZ-sMLV5cMdQmeWg,2563
+relationalai-0.12.11.dist-info/WHEEL,sha256=WLgqFyCfm_KASv4WHyYy0P3pM_m7J5L9k2skdKLirC8,87
+relationalai-0.12.11.dist-info/entry_points.txt,sha256=fo_oLFJih3PUgYuHXsk7RnCjBm9cqRNR--ab6DgI6-0,88
+relationalai-0.12.11.dist-info/licenses/LICENSE,sha256=pPyTVXFYhirkEW9VsnHIgUjT0Vg8_xsE6olrF5SIgpc,11343
+relationalai-0.12.11.dist-info/RECORD,,