pytrilogy 0.0.3.33__tar.gz → 0.0.3.34__tar.gz

{pytrilogy-0.0.3.33/pytrilogy.egg-info → pytrilogy-0.0.3.34}/PKG-INFO

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

{pytrilogy-0.0.3.33 → pytrilogy-0.0.3.34/pytrilogy.egg-info}/PKG-INFO

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

{pytrilogy-0.0.3.33 → pytrilogy-0.0.3.34}/tests/test_query_processing.py

@@ -164,7 +164,9 @@ def test_query_aggregation(test_environment, test_environment_graph):
     select = SelectStatement(selection=[test_environment.concepts["total_revenue"]])
     datasource = get_query_datasources(environment=test_environment, statement=select)
 
-    assert {datasource.identifier} == {"revenue_at_local_order_id_at_abstract"}
+    assert {datasource.identifier} == {
+        "revenue_at_local_order_id_grouped_by__at_abstract"
+    }
     check = datasource
     assert len(check.input_concepts) == 2
     assert check.input_concepts[0].name == "revenue"

{pytrilogy-0.0.3.33 → pytrilogy-0.0.3.34}/trilogy/__init__.py

@@ -4,6 +4,6 @@ from trilogy.dialect.enums import Dialects
 from trilogy.executor import Executor
 from trilogy.parser import parse
 
-__version__ = "0.0.3.33"
+__version__ = "0.0.3.34"
 
 __all__ = ["parse", "Executor", "Dialects", "Environment", "CONFIG"]

{pytrilogy-0.0.3.33 → pytrilogy-0.0.3.34}/trilogy/authoring/__init__.py

@@ -19,12 +19,15 @@ from trilogy.core.models.author import (
     Conditional,
     FilterItem,
     Function,
+    FunctionCallWrapper,
     HavingClause,
     MagicConstants,
     Metadata,
+    MultiSelectLineage,
     OrderBy,
     OrderItem,
     Parenthetical,
+    RowsetItem,
     SubselectComparison,
     WhereClause,
     WindowItem,
@@ -103,4 +106,7 @@ __all__ = [
     "RawSQLStatement",
     "Datasource",
     "DatasourceMetadata",
+    "MultiSelectLineage",
+    "RowsetItem",
+    "FunctionCallWrapper",
 ]

{pytrilogy-0.0.3.33 → pytrilogy-0.0.3.34}/trilogy/core/models/author.py

@@ -1089,7 +1089,7 @@ class Concept(Addressable, DataTyped, ConceptArgs, Mergeable, Namespaced, BaseMo
             pseudonyms=self.pseudonyms,
         )
 
-    @property
+    @cached_property
     def sources(self) -> List["ConceptRef"]:
         if self.lineage:
             output: List[ConceptRef] = []

{pytrilogy-0.0.3.33 → pytrilogy-0.0.3.34}/trilogy/core/models/build_environment.py

@@ -31,19 +31,12 @@ class BuildEnvironmentConceptDict(dict):
     def raise_undefined(
         self, key: str, line_no: int | None = None, file: Path | str | None = None
     ) -> Never:
-
-        matches = self._find_similar_concepts(key)
-        message = f"Undefined concept: {key}."
-        if matches:
-            message += f" Suggestions: {matches}"
-
-        if line_no:
-            if file:
-                raise UndefinedConceptException(
-                    f"{file}: {line_no}: " + message, matches
-                )
-            raise UndefinedConceptException(f"line: {line_no}: " + message, matches)
-        raise UndefinedConceptException(message, matches)
+        # build environment should never check for missing values.
+        if line_no is not None:
+            message = f"Concept '{key}' not found in environment at line {line_no}."
+        else:
+            message = f"Concept '{key}' not found in environment."
+        raise UndefinedConceptException(message, [])
 
     def __getitem__(
         self, key: str, line_no: int | None = None, file: Path | None = None

{pytrilogy-0.0.3.33 → pytrilogy-0.0.3.34}/trilogy/core/models/environment.py

@@ -686,7 +686,8 @@ class Environment(BaseModel):
                 replacements[k] = target
             # we need to update keys and grains of all concepts
             else:
-                replacements[k] = v.with_merge(source, target, modifiers)
+                if source.address in v.sources or source.address in v.grain.components:
+                    replacements[k] = v.with_merge(source, target, modifiers)
         self.concepts.update(replacements)
         for k, ds in self.datasources.items():
             if source.address in ds.output_lcl:

{pytrilogy-0.0.3.33 → pytrilogy-0.0.3.34}/trilogy/core/models/execute.py

@@ -282,6 +282,7 @@ class CTE(BaseModel):
             **self.existence_source_map,
             **other.existence_source_map,
         }
+
         return self
 
     @property
@@ -764,8 +765,15 @@ class QueryDatasource(BaseModel):
     def identifier(self) -> str:
         filters = abs(hash(str(self.condition))) if self.condition else ""
         grain = "_".join([str(c).replace(".", "_") for c in self.grain.components])
+        group = ""
+        if self.source_type == SourceType.GROUP:
+            keys = [
+                x.address for x in self.output_concepts if x.purpose != Purpose.METRIC
+            ]
+            group = "_grouped_by_" + "_".join(keys)
         return (
             "_join_".join([d.identifier for d in self.datasources])
+            + group
             + (f"_at_{grain}" if grain else "_at_abstract")
             + (f"_filtered_by_{filters}" if filters else "")
         )

{pytrilogy-0.0.3.33 → pytrilogy-0.0.3.34}/trilogy/core/processing/concept_strategies_v3.py

@@ -860,7 +860,7 @@ def _search_concepts(
             and priority_concept.address not in conditions.row_arguments
         ):
             logger.info(
-                f"{depth_to_prefix(depth)}{LOGGER_PREFIX} Force including conditions to push filtering above complex condition that is not condition member or parent"
+                f"{depth_to_prefix(depth)}{LOGGER_PREFIX} Force including conditions in {priority_concept.address} to push filtering above complex condition that is not condition member or parent"
             )
             local_conditions = conditions
 
@@ -936,7 +936,23 @@ def _search_concepts(
         if complete == ValidationResult.COMPLETE and (
             not accept_partial or (accept_partial and not partial)
         ):
+            logger.info(
+                f"{depth_to_prefix(depth)}{LOGGER_PREFIX} breaking loop, complete"
+            )
             break
+        elif complete == ValidationResult.COMPLETE and accept_partial and partial:
+            if len(attempted) == len(mandatory_list):
+                logger.info(
+                    f"{depth_to_prefix(depth)}{LOGGER_PREFIX} Breaking as we have attempted all nodes"
+                )
+                break
+            logger.info(
+                f"{depth_to_prefix(depth)}{LOGGER_PREFIX} Found complete stack with partials {partial}, continuing search, attempted {attempted} all {len(mandatory_list)}"
+            )
+        else:
+            logger.info(
+                f"{depth_to_prefix(depth)}{LOGGER_PREFIX} Not complete, continuing search"
+            )
         # if we have attempted on root node, we've tried them all.
         # inject in another search with filter concepts
         if priority_concept.derivation == Derivation.ROOT:

{pytrilogy-0.0.3.33 → pytrilogy-0.0.3.34}/trilogy/core/processing/node_generators/select_merge_node.py

@@ -344,12 +344,14 @@ def create_datasource_node(
         for c in datasource.columns
         if not c.is_complete and c.concept.address in all_concepts
     ]
+
     partial_lcl = LooseBuildConceptList(concepts=partial_concepts)
     nullable_concepts = [
         c.concept
         for c in datasource.columns
         if c.is_nullable and c.concept.address in all_concepts
     ]
+
     nullable_lcl = LooseBuildConceptList(concepts=nullable_concepts)
     partial_is_full = conditions and (conditions == datasource.non_partial_for)
 

{pytrilogy-0.0.3.33 → pytrilogy-0.0.3.34}/trilogy/core/processing/utility.py

@@ -81,7 +81,7 @@ class JoinOrderOutput:
 
 
 def resolve_join_order_v2(
-    g: nx.Graph, partials: dict[str, list[str]]
+    g: nx.Graph, partials: dict[str, list[str]], nullables: dict[str, list[str]]
 ) -> list[JoinOrderOutput]:
     datasources = [x for x in g.nodes if x.startswith("ds~")]
     concepts = [x for x in g.nodes if x.startswith("c~")]
@@ -108,7 +108,7 @@ def resolve_join_order_v2(
             root = next_pivots[0]
             pivots = [x for x in pivots if x != root]
         else:
-            root = pivots.pop()
+            root = pivots.pop(0)
 
         # sort so less partials is last and eligible lefts are
         def score_key(x: str) -> tuple[int, int, str]:
@@ -119,6 +119,8 @@ def resolve_join_order_v2(
             # if it has the concept as a partial, lower weight
             if root in partials.get(x, []):
                 base -= 1
+            if root in nullables.get(x, []):
+                base -= 1
             return (base, len(x), x)
 
         # get remainig un-joined datasets
@@ -159,9 +161,11 @@ def resolve_join_order_v2(
                 )
                 right_is_partial = any(key in partials.get(right, []) for key in common)
                 # we don't care if left is nullable for join type (just keys), but if we did
-                # ex: left_is_nullable = any(key in partials.get(left_candidate, [])
+                # left_is_nullable = any(
+                #     key in nullables.get(left_candidate, []) for key in common
+                # )
                 right_is_nullable = any(
-                    key in partials.get(right, []) for key in common
+                    key in nullables.get(right, []) for key in common
                 )
                 if left_is_partial:
                     join_type = JoinType.FULL
@@ -356,6 +360,7 @@ def get_node_joins(
 ) -> List[BaseJoin]:
     graph = nx.Graph()
     partials: dict[str, list[str]] = {}
+    nullables: dict[str, list[str]] = {}
     ds_node_map: dict[str, QueryDatasource | BuildDatasource] = {}
     concept_map: dict[str, BuildConcept] = {}
     for datasource in datasources:
@@ -363,6 +368,7 @@ def get_node_joins(
         ds_node_map[ds_node] = datasource
         graph.add_node(ds_node, type=NodeType.NODE)
         partials[ds_node] = [f"c~{c.address}" for c in datasource.partial_concepts]
+        nullables[ds_node] = [f"c~{c.address}" for c in datasource.nullable_concepts]
         for concept in datasource.output_concepts:
             if concept.address in datasource.hidden_concepts:
                 continue
@@ -374,7 +380,7 @@ def get_node_joins(
                 environment=environment,
             )
 
-    joins = resolve_join_order_v2(graph, partials=partials)
+    joins = resolve_join_order_v2(graph, partials=partials, nullables=nullables)
     return [
         BaseJoin(
             left_datasource=ds_node_map[j.left] if j.left else None,

{pytrilogy-0.0.3.33 → pytrilogy-0.0.3.34}/trilogy/core/statements/author.py

@@ -384,6 +384,11 @@ class MergeStatementV2(HasUUID, BaseModel):
     modifiers: List[Modifier] = Field(default_factory=list)
 
 
+class KeyMergeStatement(HasUUID, BaseModel):
+    keys: set[str]
+    target: ConceptRef
+
+
 class ImportStatement(HasUUID, BaseModel):
     # import abc.def as bar
     # the bit after 'as', eg bar

{pytrilogy-0.0.3.33 → pytrilogy-0.0.3.34}/trilogy/parsing/parse_engine.py

@@ -116,6 +116,7 @@ from trilogy.core.statements.author import (
     CopyStatement,
     FunctionDeclaration,
     ImportStatement,
+    KeyMergeStatement,
     Limit,
     MergeStatementV2,
     MultiSelectStatement,
@@ -890,6 +891,29 @@ class ParseToObjects(Transformer):
     def over_list(self, args):
         return [x for x in args]
 
+    @v_args(meta=True)
+    def key_merge_statement(self, meta: Meta, args) -> KeyMergeStatement | None:
+        key_inputs = args[:-1]
+        target = args[-1]
+        keys = [self.environment.concepts[grain] for grain in key_inputs]
+        target_c = self.environment.concepts[target]
+        new = KeyMergeStatement(
+            keys=set([x.address for x in keys]),
+            target=target_c.reference,
+        )
+        internal = Concept(
+            name="_" + target_c.address.replace(".", "_"),
+            namespace=self.environment.namespace,
+            purpose=Purpose.PROPERTY,
+            keys=set([x.address for x in keys]),
+            datatype=target_c.datatype,
+            grain=Grain(components={x.address for x in keys}),
+        )
+        self.environment.add_concept(internal)
+        # always a full merge
+        self.environment.merge_concept(target_c, internal, [])
+        return new
+
     @v_args(meta=True)
     def merge_statement(self, meta: Meta, args) -> MergeStatementV2 | None:
         modifiers = []

{pytrilogy-0.0.3.33 → pytrilogy-0.0.3.34}/trilogy/parsing/render.py

@@ -51,6 +51,7 @@ from trilogy.core.statements.author import (
     CopyStatement,
     FunctionDeclaration,
     ImportStatement,
+    KeyMergeStatement,
     MergeStatementV2,
     MultiSelectStatement,
     PersistStatement,
@@ -525,6 +526,11 @@ class Renderer:
             return f"MERGE {self.to_string(arg.sources[0])} into {''.join([self.to_string(modifier) for modifier in arg.modifiers])}{self.to_string(arg.targets[arg.sources[0].address])};"
         return f"MERGE {arg.source_wildcard}.* into {''.join([self.to_string(modifier) for modifier in arg.modifiers])}{arg.target_wildcard}.*;"
 
+    @to_string.register
+    def _(self, arg: KeyMergeStatement):
+        keys = ", ".join(sorted(list(arg.keys)))
+        return f"MERGE PROPERTY <{keys}> from {arg.target.address};"
+
     @to_string.register
     def _(self, arg: Modifier):
         if arg == Modifier.PARTIAL:

{pytrilogy-0.0.3.33 → pytrilogy-0.0.3.34}/trilogy/parsing/trilogy.lark

@@ -10,6 +10,7 @@
     | rowset_derivation_statement
     | import_statement
     | copy_statement
+    | key_merge_statement
     | merge_statement
     | rawsql_statement
     
@@ -76,6 +77,8 @@
 
     align_clause: align_item ("AND"i align_item)*  "AND"i?
 
+    key_merge_statement: "merge"i "property"i "<" IDENTIFIER ("," IDENTIFIER )* ","? ">" "from"i IDENTIFIER 
+
     merge_statement: "merge"i  WILDCARD_IDENTIFIER "into"i SHORTHAND_MODIFIER? WILDCARD_IDENTIFIER
 
     // raw sql statement