linkrs-query 0.1.0

Query engine, parser, and executor for Linkrs
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107

use std::collections::HashSet;

use crate::planning::plan::factorization::{FGroupPos, FactorizationError, FactorizedSchema};
use crate::planning::plan::logical::LogicalNodeEnum;

use super::FactorizationRewriter;

impl FactorizationRewriter {
    pub(super) fn barrier_groups(schema: &FactorizedSchema) -> HashSet<FGroupPos> {
        crate::optimizer::factorization::FlattenAll::get_groups_pos_to_flatten_for_groups(
            &schema.groups_pos_in_scope(),
            schema,
        )
    }

    pub(super) fn flatten_barrier_child(
        &mut self,
        child: &mut LogicalNodeEnum,
        schema: &FactorizedSchema,
    ) -> Result<(), FactorizationError> {
        let to_flatten = Self::barrier_groups(schema);
        self.replace_node_and_flatten(child, &to_flatten, schema)
    }

    pub(super) fn flatten_barrier_single(
        &mut self,
        input: Option<&mut Box<LogicalNodeEnum>>,
        schema: &FactorizedSchema,
    ) -> Result<(), FactorizationError> {
        if let Some(child) = input {
            self.flatten_barrier_child(child, schema)?;
        }
        Ok(())
    }

    pub(super) fn flatten_barrier_binary(
        &mut self,
        left: &mut LogicalNodeEnum,
        right: &mut LogicalNodeEnum,
        left_schema: &FactorizedSchema,
        right_schema: &FactorizedSchema,
    ) -> Result<(), FactorizationError> {
        self.flatten_barrier_child(left, left_schema)?;
        self.flatten_barrier_child(right, right_schema)?;
        Ok(())
    }

    pub(super) fn append_flattens(
        &mut self,
        plan: &mut LogicalNodeEnum,
        groups: &HashSet<FGroupPos>,
    ) -> Result<(), FactorizationError> {
        if groups.is_empty() {
            return Ok(());
        }
        let mut flattens = groups.iter().copied().collect::<Vec<_>>();
        flattens.sort_unstable();
        for pos in flattens {
            *plan = LogicalNodeEnum::Flatten(
                crate::planning::plan::logical::logical_nodes::flatten::LogicalFlattenNode {
                    id: crate::planning::plan::core::node_id_generator::next_node_id(),
                    input: Some(Box::new(plan.clone())),
                    group_pos: pos,
                    output_var: None,
                    col_names: vec![],
                    column_types: vec![],
                    expected_groups: None,
                    group_columns: vec![],
                },
            );
        }
        Ok(())
    }

    pub(super) fn replace_child_and_flatten(
        &mut self,
        child: &mut Box<LogicalNodeEnum>,
        groups: &HashSet<FGroupPos>,
        schema: &mut FactorizedSchema,
    ) -> Result<(), FactorizationError> {
        if groups.is_empty() {
            return Ok(());
        }
        let mut new_child = child.clone();
        self.append_flattens(&mut new_child, groups)?;
        for pos in groups {
            schema.flatten_group(*pos)?;
        }
        *child = new_child;
        Ok(())
    }

    pub(super) fn replace_node_and_flatten(
        &mut self,
        node: &mut LogicalNodeEnum,
        groups: &HashSet<FGroupPos>,
        _schema: &FactorizedSchema,
    ) -> Result<(), FactorizationError> {
        if groups.is_empty() {
            return Ok(());
        }
        let mut new_node = node.clone();
        self.append_flattens(&mut new_node, groups)?;
        *node = new_node;
        Ok(())
    }
}