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

//! Physical-to-logical conversion: setop node families.

use crate::planning::plan::logical::logical_node_enum::LogicalNodeEnum;

use super::{convert_plan, ConversionError};

use crate::planning::plan::core::nodes::graph_operations::graph_operations_node::{
    UnionNode, UnwindNode,
};
use crate::planning::plan::core::nodes::graph_operations::set_operations_node::{
    IntersectNode, MinusNode,
};

use crate::planning::plan::core::nodes::base::plan_node_traits::SingleInputNode;

pub(super) fn convert_union(n: &UnionNode) -> Result<LogicalNodeEnum, ConversionError> {
    {
        let left = convert_plan(n.input())?;
        let right = convert_plan(n.union_input())?;
        Ok(LogicalNodeEnum::Union(
            crate::planning::plan::logical::logical_nodes::graph_ops::LogicalUnionNode {
                id: n.id(),
                deps: vec![left, right],
                distinct: n.distinct(),
                output_var: n.output_var().map(|s| s.to_string()),
                col_names: n.col_names().to_vec(),
                column_types: vec![],
            },
        ))
    }
}

pub(super) fn convert_minus(n: &MinusNode) -> Result<LogicalNodeEnum, ConversionError> {
    {
        let left = convert_plan(n.input())?;
        let right = convert_plan(n.minus_input())?;
        Ok(LogicalNodeEnum::Minus(
            crate::planning::plan::logical::logical_nodes::graph_ops::LogicalMinusNode {
                id: n.id(),
                deps: vec![left, right],
                output_var: n.output_var().map(|s| s.to_string()),
                col_names: n.col_names().to_vec(),
                column_types: vec![],
            },
        ))
    }
}

pub(super) fn convert_intersect(n: &IntersectNode) -> Result<LogicalNodeEnum, ConversionError> {
    {
        let left = convert_plan(n.input())?;
        let right = convert_plan(n.intersect_input())?;
        Ok(LogicalNodeEnum::Intersect(
            crate::planning::plan::logical::logical_nodes::graph_ops::LogicalIntersectNode {
                id: n.id(),
                deps: vec![left, right],
                output_var: n.output_var().map(|s| s.to_string()),
                col_names: n.col_names().to_vec(),
                column_types: vec![],
            },
        ))
    }
}

pub(super) fn convert_unwind(n: &UnwindNode) -> Result<LogicalNodeEnum, ConversionError> {
    {
        let logical_input = convert_plan(n.input())?;
        Ok(LogicalNodeEnum::Unwind(
            crate::planning::plan::logical::logical_nodes::graph_ops::LogicalUnwindNode {
                id: n.id(),
                input: Some(Box::new(logical_input)),
                alias: n.alias().to_string(),
                list_expression: n.list_expression().clone(),
                output_var: n.output_var().map(|s| s.to_string()),
                col_names: n.col_names().to_vec(),
                column_types: vec![],
            },
        ))
    }
}