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
108
109
110
111
112
113
114
115

//! Logical operation nodes: Project, Filter, Sort, Limit, TopN, Sample, Dedup, Aggregate, Window.

use crate::define_logical_plan_node_with_deps;
use crate::planning::plan::core::nodes::graph_operations::window_node::WindowFunctionSpec;
use crate::planning::plan::core::nodes::operation::sort_node::SortItem;
use linkrs_core::types::expr::contextual::ContextualExpression;
use linkrs_core::types::operators::AggregateFunction;
use linkrs_core::Expression;
use linkrs_core::YieldColumn;

define_logical_plan_node_with_deps! {
    pub struct LogicalProjectNode {
        columns: Vec<YieldColumn>,
        subqueries: Vec<crate::planning::statements::clauses::exists_planner::PlannedSubquery>,
        has_folded_expressions: bool,
    }
    enum: Project
    input: SingleInputNode
}

impl LogicalProjectNode {
    /// Attach expression-level subqueries to this logical projection.
    pub fn with_subqueries(
        mut self,
        subqueries: Vec<crate::planning::statements::clauses::exists_planner::PlannedSubquery>,
    ) -> Self {
        self.subqueries = subqueries;
        self
    }

    /// Expression-level subqueries compiled for this projection.
    pub fn subqueries(
        &self,
    ) -> &[crate::planning::statements::clauses::exists_planner::PlannedSubquery] {
        &self.subqueries
    }
}

define_logical_plan_node_with_deps! {
    pub struct LogicalFilterNode {
        condition: ContextualExpression,
    }
    enum: Filter
    input: SingleInputNode
}

define_logical_plan_node_with_deps! {
    pub struct LogicalSortNode {
        sort_items: Vec<SortItem>,
        limit: Option<i64>,
    }
    enum: Sort
    input: SingleInputNode
}

define_logical_plan_node_with_deps! {
    pub struct LogicalLimitNode {
        offset: i64,
        count: i64,
    }
    enum: Limit
    input: SingleInputNode
}

define_logical_plan_node_with_deps! {
    pub struct LogicalTopNNode {
        sort_items: Vec<SortItem>,
        limit: i64,
    }
    enum: TopN
    input: SingleInputNode
}

define_logical_plan_node_with_deps! {
    pub struct LogicalSampleNode {
        count: i64,
    }
    enum: Sample
    input: SingleInputNode
}

define_logical_plan_node_with_deps! {
    pub struct LogicalDedupNode {}
    enum: Dedup
    input: SingleInputNode
}

define_logical_plan_node_with_deps! {
    pub struct LogicalAggregateNode {
        group_key_exprs: Vec<ContextualExpression>,
        aggregation_functions: Vec<AggregateFunction>,
        aggregation_args: Vec<Vec<Expression>>,
        aggregation_distinct: Vec<bool>,
        aggregation_filters: Vec<Option<Expression>>,
        grouping_sets: Vec<Vec<String>>,
    }
    enum: Aggregate
    input: SingleInputNode
}

define_logical_plan_node_with_deps! {
    pub struct LogicalWindowNode {
        window_functions: Vec<WindowFunctionSpec>,
    }
    enum: Window
    input: SingleInputNode
}

define_logical_plan_node_with_deps! {
    pub struct LogicalSkipNode {
        offset: i64,
    }
    enum: Skip
    input: SingleInputNode
}