pytrilogy 0.3.142__cp312-cp312-win_amd64.whl

trilogy/core/processing/nodes/filter_node.py

@@ -0,0 +1,75 @@
+from typing import List
+
+from trilogy.core.enums import (
+    SourceType,
+)
+from trilogy.core.models.build import (
+    BuildComparison,
+    BuildConcept,
+    BuildConditional,
+    BuildGrain,
+    BuildParenthetical,
+)
+from trilogy.core.processing.nodes.base_node import StrategyNode
+
+
+class FilterNode(StrategyNode):
+    """Filter nodes represent a restriction operation
+    on a concept that creates a new derived concept.
+
+    They should only output a concept and it's filtered
+    version, but will have parents that provide all required
+    filtering keys as inputs.
+    """
+
+    source_type = SourceType.FILTER
+
+    def __init__(
+        self,
+        input_concepts: List[BuildConcept],
+        output_concepts: List[BuildConcept],
+        environment,
+        whole_grain: bool = False,
+        parents: List["StrategyNode"] | None = None,
+        depth: int = 0,
+        conditions: (
+            BuildConditional | BuildComparison | BuildParenthetical | None
+        ) = None,
+        preexisting_conditions: (
+            BuildConditional | BuildComparison | BuildParenthetical | None
+        ) = None,
+        partial_concepts: List[BuildConcept] | None = None,
+        force_group: bool | None = False,
+        grain: BuildGrain | None = None,
+        existence_concepts: List[BuildConcept] | None = None,
+    ):
+        super().__init__(
+            output_concepts=output_concepts,
+            environment=environment,
+            whole_grain=whole_grain,
+            parents=parents,
+            depth=depth,
+            input_concepts=input_concepts,
+            conditions=conditions,
+            preexisting_conditions=preexisting_conditions,
+            partial_concepts=partial_concepts,
+            force_group=force_group,
+            grain=grain,
+            existence_concepts=existence_concepts,
+        )
+
+    def copy(self) -> "FilterNode":
+        return FilterNode(
+            input_concepts=list(self.input_concepts),
+            output_concepts=list(self.output_concepts),
+            environment=self.environment,
+            whole_grain=self.whole_grain,
+            parents=self.parents,
+            depth=self.depth,
+            conditions=self.conditions,
+            preexisting_conditions=self.preexisting_conditions,
+            partial_concepts=list(self.partial_concepts),
+            force_group=self.force_group,
+            grain=self.grain,
+            existence_concepts=list(self.existence_concepts),
+        )

trilogy/core/processing/nodes/group_node.py

@@ -0,0 +1,194 @@
+from typing import List, Optional
+
+from trilogy.constants import logger
+from trilogy.core.enums import SourceType
+from trilogy.core.models.build import (
+    BuildComparison,
+    BuildConcept,
+    BuildConditional,
+    BuildDatasource,
+    BuildOrderBy,
+    BuildParenthetical,
+)
+from trilogy.core.models.build_environment import BuildEnvironment
+from trilogy.core.models.execute import QueryDatasource
+from trilogy.core.processing.nodes.base_node import (
+    StrategyNode,
+    resolve_concept_map,
+)
+from trilogy.core.processing.utility import (
+    GroupRequiredResponse,
+    find_nullable_concepts,
+    is_scalar_condition,
+)
+from trilogy.utility import unique
+
+LOGGER_PREFIX = "[CONCEPT DETAIL - GROUP NODE]"
+
+
+class GroupNode(StrategyNode):
+    source_type = SourceType.GROUP
+
+    def __init__(
+        self,
+        output_concepts: List[BuildConcept],
+        input_concepts: List[BuildConcept],
+        environment: BuildEnvironment,
+        whole_grain: bool = False,
+        parents: List["StrategyNode"] | None = None,
+        depth: int = 0,
+        partial_concepts: Optional[List[BuildConcept]] = None,
+        nullable_concepts: Optional[List[BuildConcept]] = None,
+        force_group: bool | None = None,
+        conditions: (
+            BuildConditional | BuildComparison | BuildParenthetical | None
+        ) = None,
+        preexisting_conditions: (
+            BuildConditional | BuildComparison | BuildParenthetical | None
+        ) = None,
+        existence_concepts: List[BuildConcept] | None = None,
+        hidden_concepts: set[str] | None = None,
+        ordering: BuildOrderBy | None = None,
+        required_outputs: List[BuildConcept] | None = None,
+    ):
+        super().__init__(
+            input_concepts=input_concepts,
+            output_concepts=output_concepts,
+            environment=environment,
+            whole_grain=whole_grain,
+            parents=parents,
+            depth=depth,
+            partial_concepts=partial_concepts,
+            nullable_concepts=nullable_concepts,
+            force_group=force_group,
+            conditions=conditions,
+            existence_concepts=existence_concepts,
+            preexisting_conditions=preexisting_conditions,
+            hidden_concepts=hidden_concepts,
+            ordering=ordering,
+        )
+        # the set of concepts required to preserve grain
+        # set by group by node generation with aggregates
+        self.required_outputs = required_outputs
+
+    @classmethod
+    def check_if_required(
+        cls,
+        downstream_concepts: List[BuildConcept],
+        parents: list[QueryDatasource | BuildDatasource],
+        environment: BuildEnvironment,
+        depth: int = 0,
+    ) -> GroupRequiredResponse:
+        from trilogy.core.processing.discovery_utility import check_if_group_required
+
+        return check_if_group_required(downstream_concepts, parents, environment, depth)
+
+    def _resolve(self) -> QueryDatasource:
+        parent_sources: List[QueryDatasource | BuildDatasource] = [
+            p.resolve() for p in self.parents
+        ]
+
+        grains = self.check_if_required(
+            self.output_concepts, parent_sources, self.environment, self.depth
+        )
+        target_grain = grains.target
+        comp_grain = grains.upstream
+        # dynamically select if we need to group
+        # because sometimes, we are already at required grain
+        if not grains.required and self.force_group is not True:
+            # otherwise if no group by, just treat it as a select
+            source_type = SourceType.SELECT
+        else:
+            logger.info(
+                f"{self.logging_prefix}{LOGGER_PREFIX} Group node has different grain than parents; group is required."
+                f" Upstream grains {[str(source.grain) for source in parent_sources]}"
+                f" with final grain {comp_grain} vs"
+                f" target grain {target_grain}"
+                f" delta: {comp_grain - target_grain}"
+            )
+            source_type = SourceType.GROUP
+        source_map = resolve_concept_map(
+            parent_sources,
+            targets=(
+                unique(
+                    self.output_concepts + self.conditions.concept_arguments,
+                    "address",
+                )
+                if self.conditions
+                else self.output_concepts
+            ),
+            inherited_inputs=self.input_concepts + self.existence_concepts,
+        )
+        nullable_addresses = find_nullable_concepts(
+            source_map=source_map, joins=[], datasources=parent_sources
+        )
+        nullable_concepts = [
+            x for x in self.output_concepts if x.address in nullable_addresses
+        ]
+        base = QueryDatasource(
+            input_concepts=self.input_concepts,
+            output_concepts=self.output_concepts,
+            datasources=parent_sources,
+            source_type=source_type,
+            source_map=source_map,
+            joins=[],
+            grain=target_grain,
+            partial_concepts=self.partial_concepts,
+            nullable_concepts=nullable_concepts,
+            hidden_concepts=self.hidden_concepts,
+            condition=self.conditions,
+            ordering=self.ordering,
+        )
+        # if there is a condition on a group node and it's not scalar
+        # inject an additional CTE
+        if self.conditions and not is_scalar_condition(self.conditions):
+            base.condition = None
+            base.output_concepts = unique(
+                list(base.output_concepts) + list(self.conditions.row_arguments),
+                "address",
+            )
+            # re-visible any hidden concepts
+            base.hidden_concepts = set(
+                [x for x in base.hidden_concepts if x not in base.output_concepts]
+            )
+            source_map = resolve_concept_map(
+                [base],
+                targets=self.output_concepts,
+                inherited_inputs=base.output_concepts,
+            )
+            return QueryDatasource(
+                input_concepts=base.output_concepts,
+                output_concepts=self.output_concepts,
+                datasources=[base],
+                source_type=SourceType.SELECT,
+                source_map=source_map,
+                joins=[],
+                grain=target_grain,
+                nullable_concepts=base.nullable_concepts,
+                partial_concepts=self.partial_concepts,
+                condition=self.conditions,
+                hidden_concepts=self.hidden_concepts,
+                ordering=self.ordering,
+            )
+        return base
+
+    def copy(self) -> "GroupNode":
+        return GroupNode(
+            input_concepts=list(self.input_concepts),
+            output_concepts=list(self.output_concepts),
+            environment=self.environment,
+            whole_grain=self.whole_grain,
+            parents=self.parents,
+            depth=self.depth,
+            partial_concepts=list(self.partial_concepts),
+            nullable_concepts=list(self.nullable_concepts),
+            force_group=self.force_group,
+            conditions=self.conditions,
+            preexisting_conditions=self.preexisting_conditions,
+            existence_concepts=list(self.existence_concepts),
+            hidden_concepts=set(self.hidden_concepts),
+            ordering=self.ordering,
+            required_outputs=(
+                list(self.required_outputs) if self.required_outputs else None
+            ),
+        )

trilogy/core/processing/nodes/merge_node.py

@@ -0,0 +1,420 @@
+from typing import List, Optional, Tuple
+
+from trilogy.constants import logger
+from trilogy.core.enums import (
+    JoinType,
+    SourceType,
+)
+from trilogy.core.models.build import (
+    BuildComparison,
+    BuildConcept,
+    BuildConditional,
+    BuildDatasource,
+    BuildGrain,
+    BuildOrderBy,
+    BuildParenthetical,
+)
+from trilogy.core.models.build_environment import BuildEnvironment
+from trilogy.core.models.execute import BaseJoin, QueryDatasource, UnnestJoin
+from trilogy.core.processing.nodes.base_node import (
+    NodeJoin,
+    StrategyNode,
+    resolve_concept_map,
+)
+from trilogy.core.processing.utility import find_nullable_concepts, get_node_joins
+from trilogy.utility import unique
+
+LOGGER_PREFIX = "[CONCEPT DETAIL - MERGE NODE]"
+
+
+def deduplicate_nodes(
+    merged: dict[str, QueryDatasource | BuildDatasource],
+    logging_prefix: str,
+    environment: BuildEnvironment,
+) -> tuple[bool, dict[str, QueryDatasource | BuildDatasource], set[str]]:
+    duplicates = False
+    removed: set[str] = set()
+    set_map: dict[str, set[str]] = {}
+    for k, v in merged.items():
+        unique_outputs = [
+            # the concept may be a in a different environment for a rowset.
+            (environment.concepts.get(x.address) or x).address
+            for x in v.output_concepts
+            if x not in v.partial_concepts
+        ]
+        set_map[k] = set(unique_outputs)
+    for k1, v1 in set_map.items():
+        found = False
+        for k2, v2 in set_map.items():
+            if k1 == k2:
+                continue
+            if (
+                v1.issubset(v2)
+                and merged[k1].grain.issubset(merged[k2].grain)
+                and not merged[k2].partial_concepts
+                and not merged[k1].partial_concepts
+                and not merged[k2].condition
+                and not merged[k1].condition
+            ):
+                og = merged[k1]
+                subset_to = merged[k2]
+                logger.info(
+                    f"{logging_prefix}{LOGGER_PREFIX} extraneous parent node that is subset of another parent node {og.grain.issubset(subset_to.grain)} {og.grain.components} {subset_to.grain.components}"
+                )
+                merged = {k: v for k, v in merged.items() if k != k1}
+                removed.add(k1)
+                duplicates = True
+                found = True
+                break
+        if found:
+            break
+
+    return duplicates, merged, removed
+
+
+def deduplicate_nodes_and_joins(
+    joins: List[NodeJoin] | None,
+    merged: dict[str, QueryDatasource | BuildDatasource],
+    logging_prefix: str,
+    environment: BuildEnvironment,
+) -> Tuple[List[NodeJoin] | None, dict[str, QueryDatasource | BuildDatasource]]:
+    # it's possible that we have more sources than we need
+    duplicates = True
+    while duplicates:
+        duplicates = False
+        duplicates, merged, removed = deduplicate_nodes(
+            merged, logging_prefix, environment=environment
+        )
+        # filter out any removed joins
+        if joins is not None:
+            joins = [
+                j
+                for j in joins
+                if j.left_node.resolve().identifier not in removed
+                and j.right_node.resolve().identifier not in removed
+            ]
+    return joins, merged
+
+
+class MergeNode(StrategyNode):
+    source_type = SourceType.MERGE
+
+    def __init__(
+        self,
+        input_concepts: List[BuildConcept],
+        output_concepts: List[BuildConcept],
+        environment,
+        whole_grain: bool = False,
+        parents: List["StrategyNode"] | None = None,
+        node_joins: List[NodeJoin] | None = None,
+        join_concepts: Optional[List] = None,
+        force_join_type: Optional[JoinType] = None,
+        partial_concepts: Optional[List[BuildConcept]] = None,
+        nullable_concepts: Optional[List[BuildConcept]] = None,
+        force_group: bool | None = None,
+        depth: int = 0,
+        grain: BuildGrain | None = None,
+        conditions: (
+            BuildConditional | BuildComparison | BuildParenthetical | None
+        ) = None,
+        preexisting_conditions: (
+            BuildConditional | BuildComparison | BuildParenthetical | None
+        ) = None,
+        hidden_concepts: set[str] | None = None,
+        virtual_output_concepts: List[BuildConcept] | None = None,
+        existence_concepts: List[BuildConcept] | None = None,
+        ordering: BuildOrderBy | None = None,
+    ):
+        super().__init__(
+            input_concepts=input_concepts,
+            output_concepts=output_concepts,
+            environment=environment,
+            whole_grain=whole_grain,
+            parents=parents,
+            depth=depth,
+            partial_concepts=partial_concepts,
+            nullable_concepts=nullable_concepts,
+            force_group=force_group,
+            grain=grain,
+            conditions=conditions,
+            preexisting_conditions=preexisting_conditions,
+            hidden_concepts=hidden_concepts,
+            virtual_output_concepts=virtual_output_concepts,
+            existence_concepts=existence_concepts,
+            ordering=ordering,
+        )
+        self.join_concepts = join_concepts
+        self.force_join_type = force_join_type
+        self.node_joins: List[NodeJoin] | None = node_joins
+
+        final_joins: List[NodeJoin] = []
+        if self.node_joins is not None:
+            for join in self.node_joins:
+                if join.left_node.resolve().name == join.right_node.resolve().name:
+                    continue
+                final_joins.append(join)
+            self.node_joins = final_joins
+
+    def translate_node_joins(self, node_joins: List[NodeJoin]) -> List[BaseJoin]:
+        joins = []
+        for join in node_joins:
+            left = join.left_node.resolve()
+            right = join.right_node.resolve()
+            if left.identifier == right.identifier:
+                raise SyntaxError(f"Cannot join node {left.identifier} to itself")
+            joins.append(
+                BaseJoin(
+                    left_datasource=left,
+                    right_datasource=right,
+                    join_type=join.join_type,
+                    concepts=join.concepts,
+                    concept_pairs=join.concept_pairs,
+                    modifiers=join.modifiers,
+                )
+            )
+        return joins
+
+    def create_full_joins(self, dataset_list: List[QueryDatasource | BuildDatasource]):
+        joins = []
+        seen = set()
+        for left_value in dataset_list:
+            for right_value in dataset_list:
+                if left_value.identifier == right_value.identifier:
+                    continue
+                if left_value.identifier in seen and right_value.identifier in seen:
+                    continue
+                joins.append(
+                    BaseJoin(
+                        left_datasource=left_value,
+                        right_datasource=right_value,
+                        join_type=JoinType.FULL,
+                        concepts=[],
+                    )
+                )
+                seen.add(left_value.identifier)
+                seen.add(right_value.identifier)
+        return joins
+
+    def generate_joins(
+        self,
+        final_datasets,
+        final_joins: List[NodeJoin] | None,
+        pregrain: BuildGrain,
+        grain: BuildGrain,
+        environment: BuildEnvironment,
+    ) -> List[BaseJoin | UnnestJoin]:
+        # only finally, join between them for unique values
+        dataset_list: List[QueryDatasource | BuildDatasource] = sorted(
+            final_datasets, key=lambda x: -len(x.grain.components)
+        )
+
+        logger.info(
+            f"{self.logging_prefix}{LOGGER_PREFIX} Merge node has {len(dataset_list)} parents, starting merge"
+        )
+        if final_joins is None:
+            if not pregrain.components:
+                logger.info(
+                    f"{self.logging_prefix}{LOGGER_PREFIX} no grain components, doing full join"
+                )
+                joins = self.create_full_joins(dataset_list)
+            else:
+                logger.info(
+                    f"{self.logging_prefix}{LOGGER_PREFIX} inferring node joins to target grain {str(grain)}"
+                )
+                joins = get_node_joins(dataset_list, environment=environment)
+        elif final_joins:
+            logger.info(
+                f"{self.logging_prefix}{LOGGER_PREFIX} translating provided node joins {len(final_joins)}"
+            )
+            joins = self.translate_node_joins(final_joins)
+        else:
+            logger.info(
+                f"{self.logging_prefix}{LOGGER_PREFIX} Final joins is not null {final_joins} but is empty, skipping join generation"
+            )
+            return []
+        return joins
+
+    def _resolve(self) -> QueryDatasource:
+        parent_sources: List[QueryDatasource | BuildDatasource] = [
+            p.resolve() for p in self.parents
+        ]
+        merged: dict[str, QueryDatasource | BuildDatasource] = {}
+        final_joins: List[NodeJoin] | None = self.node_joins
+        for source in parent_sources:
+            if source.identifier in merged:
+                logger.info(
+                    f"{self.logging_prefix}{LOGGER_PREFIX} merging parent node with {source.identifier} into existing"
+                )
+                merged[source.identifier] = merged[source.identifier] + source
+            else:
+                merged[source.identifier] = source
+
+        # it's possible that we have more sources than we need
+        final_joins, merged = deduplicate_nodes_and_joins(
+            final_joins, merged, self.logging_prefix, self.environment
+        )
+        # early exit if we can just return the parent
+        final_datasets: List[QueryDatasource | BuildDatasource] = list(merged.values())
+
+        existence_final = [
+            x
+            for x in final_datasets
+            if all([y in self.existence_concepts for y in x.output_concepts])
+        ]
+        if len(merged.keys()) == 1:
+            final: QueryDatasource | BuildDatasource = list(merged.values())[0]
+            if (
+                set([c.address for c in final.output_concepts])
+                == set([c.address for c in self.output_concepts])
+                and not self.conditions
+                and isinstance(final, QueryDatasource)
+            ):
+                logger.info(
+                    f"{self.logging_prefix}{LOGGER_PREFIX} Merge node has only one parent with the same"
+                    " outputs as this merge node, dropping merge node "
+                )
+                # push up any conditions we need
+                final.ordering = self.ordering
+                return final
+
+        # if we have multiple candidates, see if one is good enough
+        for dataset in final_datasets:
+            output_set = set(
+                [
+                    c.address
+                    for c in dataset.output_concepts
+                    if c.address not in [x.address for x in dataset.partial_concepts]
+                ]
+            )
+            if (
+                all([c.address in output_set for c in self.all_concepts])
+                and not self.conditions
+                and isinstance(dataset, QueryDatasource)
+            ):
+                logger.info(
+                    f"{self.logging_prefix}{LOGGER_PREFIX} Merge node not required as parent node {dataset.source_type}"
+                    f" has all required output properties with partial {[c.address for c in dataset.partial_concepts]}"
+                    f" and self has no conditions ({self.conditions})"
+                )
+                dataset.ordering = self.ordering
+                return dataset
+
+        pregrain = BuildGrain()
+
+        for source in final_datasets:
+            if all(
+                [x.address in self.existence_concepts for x in source.output_concepts]
+            ):
+                logger.info(
+                    f"{self.logging_prefix}{LOGGER_PREFIX} skipping existence only source with {source.output_concepts} from grain accumulation"
+                )
+                continue
+            logger.info(
+                f"{self.logging_prefix}{LOGGER_PREFIX} adding source grain {source.grain} from source {source.identifier} to pregrain"
+            )
+            pregrain += source.grain
+            logger.info(
+                f"{self.logging_prefix}{LOGGER_PREFIX} pregrain is now {pregrain}"
+            )
+
+        pregrain = BuildGrain.from_concepts(
+            pregrain.components, environment=self.environment
+        )
+
+        grain = self.grain if self.grain else pregrain
+        logger.info(
+            f"{self.logging_prefix}{LOGGER_PREFIX} has pre grain {pregrain} and final merge node grain {grain}"
+        )
+        join_candidates = [x for x in final_datasets if x not in existence_final]
+        if len(join_candidates) > 1:
+            joins: List[BaseJoin | UnnestJoin] = self.generate_joins(
+                join_candidates, final_joins, pregrain, grain, self.environment
+            )
+        else:
+            joins = []
+
+        logger.info(
+            f"{self.logging_prefix}{LOGGER_PREFIX} Final join count for CTE parent count {len(join_candidates)} is {len(joins)}"
+        )
+        full_join_concepts = []
+        for join in joins:
+            if isinstance(join, BaseJoin) and join.join_type == JoinType.FULL:
+                full_join_concepts += join.input_concepts
+
+        if self.force_group is True:
+
+            force_group = True
+        elif self.whole_grain:
+            force_group = False
+        elif self.force_group is False:
+            force_group = False
+        elif not any(
+            [d.grain.issubset(grain) for d in final_datasets]
+        ) and not pregrain.issubset(grain):
+            logger.info(
+                f"{self.logging_prefix}{LOGGER_PREFIX} no parents include full grain {grain} and pregrain {pregrain} does not match, assume must group to grain. Have {[str(d.grain) for d in final_datasets]}"
+            )
+            force_group = True
+        else:
+            force_group = None
+
+        qd_joins: List[BaseJoin | UnnestJoin] = [*joins]
+
+        source_map = resolve_concept_map(
+            final_datasets,
+            targets=self.output_concepts,
+            inherited_inputs=self.input_concepts + self.existence_concepts,
+            full_joins=full_join_concepts,
+        )
+        nullable_concepts = find_nullable_concepts(
+            source_map=source_map, joins=joins, datasources=final_datasets
+        )
+        if force_group:
+
+            grain = BuildGrain.from_concepts(
+                self.output_concepts, environment=self.environment
+            )
+            logger.info(
+                f"{self.logging_prefix}{LOGGER_PREFIX} forcing group by to achieve grain {grain}"
+            )
+        qds = QueryDatasource(
+            input_concepts=unique(self.input_concepts, "address"),
+            output_concepts=unique(self.output_concepts, "address"),
+            datasources=final_datasets,
+            source_type=self.source_type,
+            source_map=source_map,
+            joins=qd_joins,
+            grain=grain,
+            nullable_concepts=[
+                x for x in self.output_concepts if x.address in nullable_concepts
+            ],
+            partial_concepts=self.partial_concepts,
+            force_group=force_group,
+            condition=self.conditions,
+            hidden_concepts=self.hidden_concepts,
+            ordering=self.ordering,
+        )
+        return qds
+
+    def copy(self) -> "MergeNode":
+        return MergeNode(
+            input_concepts=list(self.input_concepts),
+            output_concepts=list(self.output_concepts),
+            environment=self.environment,
+            whole_grain=self.whole_grain,
+            parents=self.parents,
+            depth=self.depth,
+            partial_concepts=list(self.partial_concepts),
+            force_group=self.force_group,
+            grain=self.grain,
+            conditions=self.conditions,
+            preexisting_conditions=self.preexisting_conditions,
+            nullable_concepts=list(self.nullable_concepts),
+            hidden_concepts=set(self.hidden_concepts),
+            virtual_output_concepts=list(self.virtual_output_concepts),
+            node_joins=list(self.node_joins) if self.node_joins else None,
+            join_concepts=list(self.join_concepts) if self.join_concepts else None,
+            force_join_type=self.force_join_type,
+            existence_concepts=list(self.existence_concepts),
+            ordering=self.ordering,
+        )