toasty 0.5.0

An async ORM for Rust supporting SQL and NoSQL databases
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

use indexmap::IndexSet;
use toasty_core::{
    driver::operation::QueryPkLimit,
    schema::db::{ColumnId, IndexId, TableId},
    stmt,
};

use crate::engine::{
    exec,
    mir::{self, LogicalPlan},
};

/// Queries records using a primary key filter.
///
/// Used with NoSQL drivers to query a table's primary key index with optional
/// additional row filtering.
#[derive(Debug)]
pub(crate) struct QueryPk {
    /// Optional node providing input arguments for the filter.
    pub(crate) input: Option<mir::NodeId>,

    /// The table to query.
    pub(crate) table: TableId,

    /// Optional index to query. None = primary key, Some(id) = secondary index
    pub(crate) index: Option<IndexId>,

    /// The columns to include in the returned records.
    pub(crate) columns: IndexSet<stmt::ExprReference>,

    /// Filter expression for the primary key index.
    pub(crate) pk_filter: stmt::Expr,

    /// Additional filter applied to matching rows.
    pub(crate) row_filter: Option<stmt::Expr>,

    /// The return type.
    pub(crate) ty: stmt::Type,

    /// Limit and pagination bounds for this query. `None` means unbounded.
    pub(crate) limit: Option<QueryPkLimit>,

    /// Sort key ordering direction.
    pub(crate) order: Option<stmt::Direction>,
}

impl QueryPk {
    pub(crate) fn to_exec(
        &self,
        logical_plan: &LogicalPlan,
        node: &mir::Node,
        var_table: &mut exec::VarDecls,
    ) -> exec::QueryPk {
        let input = self
            .input
            .map(|node_id| logical_plan[node_id].var.get().unwrap());
        let output = var_table.register_var(node.ty().clone());
        node.var.set(Some(output));

        let columns = self
            .columns
            .iter()
            .map(|expr_reference| {
                let stmt::ExprReference::Column(expr_column) = expr_reference else {
                    todo!()
                };
                debug_assert_eq!(expr_column.nesting, 0);
                debug_assert_eq!(expr_column.table, 0);

                ColumnId {
                    table: self.table,
                    index: expr_column.column,
                }
            })
            .collect();

        exec::QueryPk {
            input,
            output: exec::Output {
                var: output,
                num_uses: node.num_uses.get(),
            },
            table: self.table,
            index: self.index,
            columns,
            pk_filter: self.pk_filter.clone(),
            row_filter: self.row_filter.clone(),
            limit: self.limit.clone(),
            order: self.order,
        }
    }
}

impl From<QueryPk> for mir::Node {
    fn from(value: QueryPk) -> Self {
        mir::Operation::QueryPk(value).into()
    }
}