pytrilogy 0.0.2.43__py3-none-any.whl → 0.0.2.45__py3-none-any.whl

{pytrilogy-0.0.2.43.dist-info → pytrilogy-0.0.2.45.dist-info}/METADATA

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

{pytrilogy-0.0.2.43.dist-info → pytrilogy-0.0.2.45.dist-info}/RECORD

@@ -1,4 +1,4 @@
-trilogy/__init__.py,sha256=ZEWVL1pix9g4txlIjL_AeU_gXI3663YOp9C-hV2cXeM,291
+trilogy/__init__.py,sha256=UvZczB4kSHAfRSvHaEiwHBDkkIKuVLZsvZVUni5kMc8,291
 trilogy/compiler.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 trilogy/constants.py,sha256=UPymm94T2c6a55XdDaXw0aleTe1pOJ6lf6gOWLKZyKg,1430
 trilogy/engine.py,sha256=R5ubIxYyrxRExz07aZCUfrTsoXCHQ8DKFTDsobXdWdA,1102
@@ -16,7 +16,7 @@ trilogy/core/exceptions.py,sha256=1c1lQCwSw4_5CQS3q7scOkXU8GQvullJXfPHubprl90,61
 trilogy/core/functions.py,sha256=IhVpt3n6wEanKHnGu3oA2w6-hKIlxWpEyz7fHN66mpo,10720
 trilogy/core/graph_models.py,sha256=mameUTiuCajtihDw_2-W218xyJlvTusOWrEKP1yAWgk,2003
 trilogy/core/internal.py,sha256=jNGFHKENnbMiMCtAgsnLZYVSENDK4b5ALecXFZpTDzQ,1075
-trilogy/core/models.py,sha256=Fos3AY_biCCYh-Y9p-n9di8CJ9UvdxnNgiNTxYjlH-4,163631
+trilogy/core/models.py,sha256=WxmOgW0cTUgcBVu_gLPUwA9j3KWYPH5FsxKzBSJukEg,164085
 trilogy/core/optimization.py,sha256=VFSvJLNoCCOraip-PZUKeE4qrlxtXARjQUzJZiW-yRk,7325
 trilogy/core/query_processor.py,sha256=mbcZlgjChrRjDHkdmMbKe-T70UpbBkJhS09MyU5a6UY,17785
 trilogy/core/optimizations/__init__.py,sha256=bWQecbeiwiDx9LJnLsa7dkWxdbl2wcnkcTN69JyP8iI,356
@@ -34,10 +34,10 @@ trilogy/core/processing/node_generators/common.py,sha256=eslHTTPFTkmwHwKIuUsbFn5
 trilogy/core/processing/node_generators/filter_node.py,sha256=Vz9Rb67e1dfZgnliekwwLeDPVkthMbdrnrKRdz7J1ik,7654
 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/multiselect_node.py,sha256=Prn0tWu6gpxyP1tJywVoMG6YAKB8kVRRpPMYdqnl6SE,6583
 trilogy/core/processing/node_generators/node_merge_node.py,sha256=dIEv5P2MTViAES2MzqJgccYzM3HldjHrQYFwH00cqyc,14003
 trilogy/core/processing/node_generators/rowset_node.py,sha256=KtdN6t2xM8CJxobc4aQX4W8uX98U6IabeuBF_FtBLR4,4583
-trilogy/core/processing/node_generators/select_merge_node.py,sha256=UF4xra2sJ6dGg9TLJUgqtTX-UxqUaCEfAGo-uq7HlVs,12139
+trilogy/core/processing/node_generators/select_merge_node.py,sha256=zVPSYzhl-jSMobL7L1JauG03yNMkhKp0-tOVXiuC0Vo,12690
 trilogy/core/processing/node_generators/select_node.py,sha256=xTCWOoucRPBWkTccm5wepidhuZix-wd0YXWyOsy8nLs,1795
 trilogy/core/processing/node_generators/unnest_node.py,sha256=cZ26CN338CBnd6asML1OBUtNcDzmNlFpY0Vnade4yrc,2256
 trilogy/core/processing/node_generators/window_node.py,sha256=Ywb2K0T5Ym_Y4XStzIE2fuWV1fW2dp5eQ2hXVFTLsGM,3511
@@ -75,9 +75,9 @@ trilogy/parsing/render.py,sha256=-qqpXQg4yHcv284Vosjnsc_vrPveH6oaYbeCd3ZSvs0,156
 trilogy/parsing/trilogy.lark,sha256=B6NM3-rBHtYB_WSEti0DiS8Z-I8YH3kZU47xNzQvBx4,12389
 trilogy/scripts/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 trilogy/scripts/trilogy.py,sha256=PHxvv6f2ODv0esyyhWxlARgra8dVhqQhYl0lTrSyVNo,3729
-pytrilogy-0.0.2.43.dist-info/LICENSE.md,sha256=5ZRvtTyCCFwz1THxDTjAu3Lidds9WjPvvzgVwPSYNDo,1042
-pytrilogy-0.0.2.43.dist-info/METADATA,sha256=Lx7C3ItHKIzLZwQ_nwBHpJrnYWyG3PR305v4SXcGzBs,8426
-pytrilogy-0.0.2.43.dist-info/WHEEL,sha256=PZUExdf71Ui_so67QXpySuHtCi3-J3wvF4ORK6k_S8U,91
-pytrilogy-0.0.2.43.dist-info/entry_points.txt,sha256=0petKryjvvtEfTlbZC1AuMFumH_WQ9v8A19LvoS6G6c,54
-pytrilogy-0.0.2.43.dist-info/top_level.txt,sha256=cAy__NW_eMAa_yT9UnUNlZLFfxcg6eimUAZ184cdNiE,8
-pytrilogy-0.0.2.43.dist-info/RECORD,,
+pytrilogy-0.0.2.45.dist-info/LICENSE.md,sha256=5ZRvtTyCCFwz1THxDTjAu3Lidds9WjPvvzgVwPSYNDo,1042
+pytrilogy-0.0.2.45.dist-info/METADATA,sha256=3yU7J0Qxk2FqzC6WKBP-AL8JOp_loHi_x6_gZwlF-DM,8426
+pytrilogy-0.0.2.45.dist-info/WHEEL,sha256=PZUExdf71Ui_so67QXpySuHtCi3-J3wvF4ORK6k_S8U,91
+pytrilogy-0.0.2.45.dist-info/entry_points.txt,sha256=0petKryjvvtEfTlbZC1AuMFumH_WQ9v8A19LvoS6G6c,54
+pytrilogy-0.0.2.45.dist-info/top_level.txt,sha256=cAy__NW_eMAa_yT9UnUNlZLFfxcg6eimUAZ184cdNiE,8
+pytrilogy-0.0.2.45.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.43"
+__version__ = "0.0.2.45"
 
 __all__ = ["parse", "Executor", "Dialects", "Environment", "CONFIG"]

trilogy/core/models.py

@@ -2307,9 +2307,11 @@ class UnnestJoin(BaseModel):
     rendering_required: bool = True
 
     def __hash__(self):
-        return (
-            self.alias + "".join([str(s.address) for s in self.concepts])
-        ).__hash__()
+        return self.safe_identifier.__hash__()
+
+    @property
+    def safe_identifier(self) -> str:
+        return self.alias + "".join([str(s.address) for s in self.concepts])
 
 
 class InstantiatedUnnestJoin(BaseModel):
@@ -2544,7 +2546,7 @@ class QueryDatasource(BaseModel):
                 return True
         return False
 
-    def __add__(self, other):
+    def __add__(self, other) -> "QueryDatasource":
         # these are syntax errors to avoid being caught by current
         if not isinstance(other, QueryDatasource):
             raise SyntaxError("Can only merge two query datasources")
@@ -2570,7 +2572,7 @@ class QueryDatasource(BaseModel):
             f" {other.name} with {[c.address for c in other.output_concepts]} concepts"
         )
 
-        merged_datasources = {}
+        merged_datasources: dict[str, Union[Datasource, "QueryDatasource"]] = {}
 
         for ds in [*self.datasources, *other.datasources]:
             if ds.safe_identifier in merged_datasources:
@@ -2580,20 +2582,29 @@ class QueryDatasource(BaseModel):
             else:
                 merged_datasources[ds.safe_identifier] = ds
 
-        final_source_map = defaultdict(set)
+        final_source_map: defaultdict[
+            str, Set[Union[Datasource, "QueryDatasource", "UnnestJoin"]]
+        ] = defaultdict(set)
+
+        # add our sources
         for key in self.source_map:
             final_source_map[key] = self.source_map[key].union(
                 other.source_map.get(key, set())
             )
+        # add their sources
         for key in other.source_map:
             if key not in final_source_map:
                 final_source_map[key] = other.source_map[key]
+
+        # if a ds was merged (to combine columns), we need to update the source map
+        # to use the merged item
         for k, v in final_source_map.items():
             final_source_map[k] = set(
-                merged_datasources[x.safe_identifier] for x in list(v)
+                merged_datasources.get(x.safe_identifier, x) for x in list(v)
             )
         self_hidden = self.hidden_concepts or []
         other_hidden = other.hidden_concepts or []
+        # hidden is the minimum overlapping set
         hidden = [x for x in self_hidden if x.address in other_hidden]
         qds = QueryDatasource(
             input_concepts=unique(
@@ -2606,11 +2617,10 @@ class QueryDatasource(BaseModel):
             datasources=list(merged_datasources.values()),
             grain=self.grain,
             joins=unique(self.joins + other.joins, "unique_id"),
-            # joins = self.joins,
             condition=(
                 self.condition + other.condition
-                if (self.condition or other.condition)
-                else None
+                if self.condition and other.condition
+                else self.condition or other.condition
             ),
             source_type=self.source_type,
             partial_concepts=unique(

trilogy/core/processing/node_generators/multiselect_node.py

@@ -3,6 +3,7 @@ from trilogy.core.models import (
     Environment,
     MultiSelectStatement,
     WhereClause,
+    Conditional,
 )
 from trilogy.core.processing.nodes import MergeNode, NodeJoin, History
 from trilogy.core.processing.nodes.base_node import concept_list_to_grain, StrategyNode
@@ -14,7 +15,7 @@ from trilogy.core.processing.utility import padding
 from trilogy.core.processing.utility import concept_to_relevant_joins
 from collections import defaultdict
 from itertools import combinations
-from trilogy.core.enums import Purpose
+from trilogy.core.enums import Purpose, BooleanOperator
 from trilogy.core.processing.node_generators.common import resolve_join_order
 
 LOGGER_PREFIX = "[GEN_MULTISELECT_NODE]"
@@ -76,14 +77,22 @@ def gen_multiselect_node(
             g=g,
             depth=depth + 1,
             history=history,
+            conditions=select.where_clause,
         )
         if not snode:
             logger.info(
                 f"{padding(depth)}{LOGGER_PREFIX} Cannot generate multiselect node for {concept}"
             )
             return None
-        if select.where_clause:
-            snode.conditions = select.where_clause.conditional
+        if select.having_clause:
+            if snode.conditions:
+                snode.conditions = Conditional(
+                    left=snode.conditions,
+                    right=select.having_clause.conditional,
+                    operator=BooleanOperator.AND,
+                )
+            else:
+                snode.conditions = select.having_clause.conditional
         merge_concepts = []
         for x in [*snode.output_concepts]:
             merge = lineage.get_merge_concept(x)

trilogy/core/processing/node_generators/select_merge_node.py

@@ -20,6 +20,9 @@ from trilogy.core.graph_models import concept_to_node
 from trilogy.constants import logger
 from trilogy.core.processing.utility import padding
 from trilogy.core.enums import PurposeLineage
+from trilogy.core.processing.nodes.base_node import (
+    concept_list_to_grain,
+)
 
 LOGGER_PREFIX = "[GEN_ROOT_MERGE_NODE]"
 
@@ -353,7 +356,7 @@ def gen_select_merge_node(
         ]
     ):
         preexisting_conditions = conditions.conditional
-    return MergeNode(
+    base = MergeNode(
         output_concepts=all_concepts,
         input_concepts=non_constant,
         environment=environment,
@@ -362,3 +365,16 @@ def gen_select_merge_node(
         parents=parents,
         preexisting_conditions=preexisting_conditions,
     )
+    target_grain = concept_list_to_grain(all_concepts, [])
+    if not base.resolve().grain.issubset(target_grain):
+        return GroupNode(
+            output_concepts=all_concepts,
+            input_concepts=all_concepts,
+            environment=environment,
+            g=g,
+            parents=[base],
+            depth=depth,
+            preexisting_conditions=preexisting_conditions,
+            partial_concepts=base.partial_concepts,
+        )
+    return base