pytrilogy 0.0.2.18__py3-none-any.whl → 0.0.2.19__py3-none-any.whl

{pytrilogy-0.0.2.18.dist-info → pytrilogy-0.0.2.19.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: pytrilogy
-Version: 0.0.2.18
+Version: 0.0.2.19
 Summary: Declarative, typed query language that compiles to SQL.
 Home-page: 
 Author: 

{pytrilogy-0.0.2.18.dist-info → pytrilogy-0.0.2.19.dist-info}/RECORD

@@ -1,4 +1,4 @@
-trilogy/__init__.py,sha256=NVclSieaZqXKRfCCzUhXoqSrNUdoiMn3ytKw0jCWj7A,291
+trilogy/__init__.py,sha256=3gRtKqbvnX1RJDJWia2dlhjAU87WHpfzoZZM3KSaFaw,291
 trilogy/compiler.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 trilogy/constants.py,sha256=pZkOneh_65f9Ua6NICu1bHAFAbmQxmiXRXS7tsmCWbQ,1235
 trilogy/engine.py,sha256=R5ubIxYyrxRExz07aZCUfrTsoXCHQ8DKFTDsobXdWdA,1102
@@ -27,17 +27,17 @@ trilogy/core/optimizations/predicate_pushdown.py,sha256=1l9WnFOSv79e341typG3tTdk
 trilogy/core/processing/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 trilogy/core/processing/concept_strategies_v3.py,sha256=DO9gybVLku8GEkO3uNPaCeqhalnufsjYYbvDs-gkwNc,35295
 trilogy/core/processing/graph_utils.py,sha256=aq-kqk4Iado2HywDxWEejWc-7PGO6Oa-ZQLAM6XWPHw,1199
-trilogy/core/processing/utility.py,sha256=plpaAmssWjcxPee8_J4hleazTzQIBL6mBLJ33FKfwOM,19421
+trilogy/core/processing/utility.py,sha256=v06sqXpnuYct_MMZXxEaiP0WwkeblWpO81QG1Ns3yGc,19420
 trilogy/core/processing/node_generators/__init__.py,sha256=-mzYkRsaRNa_dfTckYkKVFSR8h8a3ihEiPJDU_tAmDo,672
 trilogy/core/processing/node_generators/basic_node.py,sha256=WQNgJ1MwrMS_BQ-b3XwGGB6eToDykelAVj_fesJuqe0,2069
 trilogy/core/processing/node_generators/common.py,sha256=LwDgPlhWeuw0t07f3kX9IE5LXBdZhXfh-aY0XGk50ak,8946
 trilogy/core/processing/node_generators/filter_node.py,sha256=Vz9Rb67e1dfZgnliekwwLeDPVkthMbdrnrKRdz7J1ik,7654
-trilogy/core/processing/node_generators/group_node.py,sha256=Dn9vEY-WPFHNN-LtXfgWiHIXspzHDKfkKL5a2KE2gD0,4252
+trilogy/core/processing/node_generators/group_node.py,sha256=r54IVEhXW-tzod6uEHIQObrxgQt6aNySk5emWkWyqCU,4938
 trilogy/core/processing/node_generators/group_to_node.py,sha256=R9i_wHipxjXJyfYEwfeTw2EPpuanXVA327XyfcP2tBg,2537
 trilogy/core/processing/node_generators/multiselect_node.py,sha256=_KO9lqzHQoy4VAviO0ttQlmK0tjaqrJj4SJPhmoIYm8,6229
-trilogy/core/processing/node_generators/node_merge_node.py,sha256=yRDfY8muZN7G2vsdYXF2X1iqbQ2zDUNGlxvSIyKVoWU,13512
+trilogy/core/processing/node_generators/node_merge_node.py,sha256=4aoSkynWYcKAxeN4fU5jnCdxausa5rNgFokoVhPXI80,13511
 trilogy/core/processing/node_generators/rowset_node.py,sha256=gU_ybfYXO9tZqHjUSABIioVpb8AWtITpegj3IGSf2GI,4587
-trilogy/core/processing/node_generators/select_merge_node.py,sha256=ipSxw1Oqk-hVVGhPhZlvRbptC0Vpwh52hZ7z8oOj2yk,10065
+trilogy/core/processing/node_generators/select_merge_node.py,sha256=MKjlXqFBSin6cTnS6n5lEcNBJsMvSefDIXOwYNVbM0s,10371
 trilogy/core/processing/node_generators/select_node.py,sha256=vUg3gXHGvagdbniIAE7DdqJcQ0V1VAfHtTrw3edYPso,1734
 trilogy/core/processing/node_generators/unnest_node.py,sha256=cZ26CN338CBnd6asML1OBUtNcDzmNlFpY0Vnade4yrc,2256
 trilogy/core/processing/node_generators/window_node.py,sha256=jy3FF8uN0VA7yyrBeR40B9CAqR_5qBP4PiS6Gr-f-7w,2590
@@ -75,9 +75,9 @@ trilogy/parsing/render.py,sha256=8yxerPAi4AhlhPBlAfbYbOM3F9rz6HzpWVEWPtK2VEg,123
 trilogy/parsing/trilogy.lark,sha256=0JAvQBACFNL-X61I0tB_0QPZgsguZgerfHBv903oKh0,11623
 trilogy/scripts/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 trilogy/scripts/trilogy.py,sha256=PHxvv6f2ODv0esyyhWxlARgra8dVhqQhYl0lTrSyVNo,3729
-pytrilogy-0.0.2.18.dist-info/LICENSE.md,sha256=5ZRvtTyCCFwz1THxDTjAu3Lidds9WjPvvzgVwPSYNDo,1042
-pytrilogy-0.0.2.18.dist-info/METADATA,sha256=erqF5E59Qz6Xr2ZKiBKejkmQUFMGpDxK9NerqOoT6K0,8132
-pytrilogy-0.0.2.18.dist-info/WHEEL,sha256=GV9aMThwP_4oNCtvEC2ec3qUYutgWeAzklro_0m4WJQ,91
-pytrilogy-0.0.2.18.dist-info/entry_points.txt,sha256=0petKryjvvtEfTlbZC1AuMFumH_WQ9v8A19LvoS6G6c,54
-pytrilogy-0.0.2.18.dist-info/top_level.txt,sha256=cAy__NW_eMAa_yT9UnUNlZLFfxcg6eimUAZ184cdNiE,8
-pytrilogy-0.0.2.18.dist-info/RECORD,,
+pytrilogy-0.0.2.19.dist-info/LICENSE.md,sha256=5ZRvtTyCCFwz1THxDTjAu3Lidds9WjPvvzgVwPSYNDo,1042
+pytrilogy-0.0.2.19.dist-info/METADATA,sha256=BgEvyZ13aahBi8bULS0lT9Rx5ixjpZ99ZbHeC8mg5Mw,8132
+pytrilogy-0.0.2.19.dist-info/WHEEL,sha256=GV9aMThwP_4oNCtvEC2ec3qUYutgWeAzklro_0m4WJQ,91
+pytrilogy-0.0.2.19.dist-info/entry_points.txt,sha256=0petKryjvvtEfTlbZC1AuMFumH_WQ9v8A19LvoS6G6c,54
+pytrilogy-0.0.2.19.dist-info/top_level.txt,sha256=cAy__NW_eMAa_yT9UnUNlZLFfxcg6eimUAZ184cdNiE,8
+pytrilogy-0.0.2.19.dist-info/RECORD,,

trilogy/__init__.py

@@ -4,6 +4,6 @@ from trilogy.executor import Executor
 from trilogy.parser import parse
 from trilogy.constants import CONFIG
 
-__version__ = "0.0.2.18"
+__version__ = "0.0.2.19"
 
 __all__ = ["parse", "Executor", "Dialects", "Environment", "CONFIG"]

trilogy/core/processing/node_generators/group_node.py

@@ -5,6 +5,7 @@ from trilogy.core.models import (
     WhereClause,
     Function,
     AggregateWrapper,
+    Grain,
 )
 from trilogy.utility import unique
 from trilogy.core.processing.nodes import GroupNode, StrategyNode, History
@@ -50,9 +51,9 @@ def gen_group_node(
         parent_concepts += grain_components
         output_concepts += grain_components
         for possible_agg in local_optional:
+            if not isinstance(possible_agg.lineage, (AggregateWrapper, Function)):
+                continue
             if possible_agg.grain and possible_agg.grain == concept.grain:
-                if not isinstance(possible_agg.lineage, (AggregateWrapper, Function)):
-                    continue
                 agg_parents: List[Concept] = resolve_function_parent_concepts(
                     possible_agg
                 )
@@ -60,7 +61,16 @@ def gen_group_node(
                     set([x.address for x in parent_concepts])
                 ):
                     output_concepts.append(possible_agg)
-
+                    logger.info(
+                        f"{padding(depth)}{LOGGER_PREFIX} found equivalent group by optional concept {possible_agg.address} for {concept.address}"
+                    )
+                elif Grain(components=agg_parents) == Grain(components=parent_concepts):
+                    extra = [x for x in agg_parents if x.address not in parent_concepts]
+                    parent_concepts += extra
+                    output_concepts.append(possible_agg)
+                    logger.info(
+                        f"{padding(depth)}{LOGGER_PREFIX} found equivalent group by optional concept {possible_agg.address} for {concept.address}"
+                    )
     if parent_concepts:
         logger.info(
             f"{padding(depth)}{LOGGER_PREFIX} fetching group node parents {LooseConceptList(concepts=parent_concepts)}"

trilogy/core/processing/node_generators/node_merge_node.py

@@ -148,7 +148,6 @@ def detect_ambiguity_and_raise(
             common = common.intersection(ja)
         if all(set(ja).issubset(y) for y in reduced_concept_sets):
             final_candidates.append(ja)
-
     if not final_candidates:
         filtered_paths = [x.difference(common) for x in reduced_concept_sets]
         raise AmbiguousRelationshipResolutionException(

trilogy/core/processing/node_generators/select_merge_node.py

@@ -21,7 +21,6 @@ from trilogy.constants import logger
 from trilogy.core.processing.utility import padding
 from trilogy.core.enums import PurposeLineage
 
-
 LOGGER_PREFIX = "[GEN_ROOT_MERGE_NODE]"
 
 
@@ -52,18 +51,19 @@ def get_graph_grain_length(g: nx.DiGraph) -> dict[str, int]:
 def create_pruned_concept_graph(
     g: nx.DiGraph, all_concepts: List[Concept], accept_partial: bool = False
 ) -> nx.DiGraph:
+    orig_g = g
     g = g.copy()
     target_addresses = set([c.address for c in all_concepts])
-    concepts: dict[str, Concept] = nx.get_node_attributes(g, "concept")
-    datasources: dict[str, Datasource] = nx.get_node_attributes(g, "datasource")
+    concepts: dict[str, Concept] = nx.get_node_attributes(orig_g, "concept")
+    datasources: dict[str, Datasource] = nx.get_node_attributes(orig_g, "datasource")
     relevant_concepts_pre = {
         n: x.address
         for n in g.nodes()
         # filter out synonyms
         if (x := concepts.get(n, None)) and x.address in target_addresses
     }
-    relevant_concepts = list(relevant_concepts_pre.keys())
-    relevent_datasets = []
+    relevant_concepts: list[str] = list(relevant_concepts_pre.keys())
+    relevent_datasets: list[str] = []
     if not accept_partial:
         partial = {}
         for node in g.nodes:
@@ -95,15 +95,22 @@ def create_pruned_concept_graph(
         ]
         if actual_neighbors:
             relevent_datasets.append(n)
-    for n in g.nodes():
-        if n.startswith("c~") and n not in relevant_concepts:
-            neighbor_count = 0
-            for x in nx.all_neighbors(g, n):
-                if x in relevent_datasets:
-                    neighbor_count += 1
-            if neighbor_count > 1:
-                relevant_concepts.append(concepts.get(n))
 
+    # for injecting extra join concepts that are shared between datasets
+    # use the original graph, pre-partial pruning
+    for n in orig_g.nodes:
+        # readd ignoring grain
+        # we want to join inclusive of all concepts
+        roots: dict[str, set[str]] = {}
+        if n.startswith("c~") and n not in relevant_concepts:
+            root = n.split("@")[0]
+            neighbors = roots.get(root, set())
+            for neighbor in nx.all_neighbors(orig_g, n):
+                if neighbor in relevent_datasets:
+                    neighbors.add(neighbor)
+            if len(neighbors) > 1:
+                relevant_concepts.append(n)
+            roots[root] = set()
     g.remove_nodes_from(
         [
             n
@@ -111,6 +118,18 @@ def create_pruned_concept_graph(
             if n not in relevent_datasets and n not in relevant_concepts
         ]
     )
+
+    subgraphs = list(nx.connected_components(g.to_undirected()))
+    if not subgraphs:
+        return None
+    if subgraphs and len(subgraphs) != 1:
+        return None
+    # add back any relevant edges that might have been partially filtered
+    relevant = set(relevant_concepts + relevent_datasets)
+    for edge in orig_g.edges():
+        if edge[0] in relevant and edge[1] in relevant:
+            g.add_edge(edge[0], edge[1])
+
     return g
 
 
@@ -243,19 +262,15 @@ def gen_select_merge_node(
         )
     for attempt in [False, True]:
         pruned_concept_graph = create_pruned_concept_graph(g, non_constant, attempt)
-        subgraphs = list(nx.connected_components(pruned_concept_graph.to_undirected()))
-
-        if subgraphs and len(subgraphs) == 1:
+        if pruned_concept_graph:
             logger.info(
                 f"{padding(depth)}{LOGGER_PREFIX} found covering graph w/ partial flag {attempt}"
             )
             break
-    if len(subgraphs) > 1:
-        # from trilogy.hooks.graph_hook import GraphHook
-        # GraphHook().query_graph_built(pruned_concept_graph.to_undirected(), highlight_nodes=[concept_to_node(c.with_default_grain()) for c in all_concepts if "__preql_internal" not in c.address])
-        # raise SyntaxError(f'Too many subgraphs found for {[c.address for c in all_concepts]}: got {subgraphs}')
+
+    if not pruned_concept_graph:
         logger.info(
-            f"{padding(depth)}{LOGGER_PREFIX} Too many subgraphs found for {[c.address for c in non_constant]}: got {subgraphs}'"
+            f"{padding(depth)}{LOGGER_PREFIX} no covering graph found {attempt}"
         )
         return None
 

trilogy/core/processing/utility.py

@@ -199,7 +199,6 @@ def get_node_joins(
     identifier_map: dict[str, Datasource | QueryDatasource] = {
         x.identifier: x for x in datasources
     }
-
     grain_pseudonyms: set[str] = set()
     for g in grain:
         env_lookup = environment.concepts[g.address]