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

use crate::catalog::{TableCatalog, TableName};
use crate::expression::simplify::ConstantBinary;
use crate::expression::ScalarExpression;
use crate::planner::LogicalPlan;
use crate::storage::Bounds;
use crate::types::index::IndexMetaRef;
use itertools::Itertools;

use super::Operator;

#[derive(Debug, PartialEq, Eq, Clone, Hash)]
pub struct ScanOperator {
    pub index_metas: Vec<IndexMetaRef>,

    pub table_name: TableName,
    pub columns: Vec<ScalarExpression>,
    // Support push down limit.
    pub limit: Bounds,

    // IndexScan only
    // Support push down predicate.
    // If pre_where is simple predicate, for example:  a > 1 then can calculate directly when read data.
    pub index_by: Option<(IndexMetaRef, Vec<ConstantBinary>)>,
}
impl ScanOperator {
    pub fn build(table_name: TableName, table_catalog: &TableCatalog) -> LogicalPlan {
        // Fill all Columns in TableCatalog by default
        let columns = table_catalog
            .all_columns()
            .into_iter()
            .map(ScalarExpression::ColumnRef)
            .collect_vec();

        LogicalPlan {
            operator: Operator::Scan(ScanOperator {
                index_metas: table_catalog.indexes.clone(),
                table_name,
                columns,

                limit: (None, None),
                index_by: None,
            }),
            childrens: vec![],
        }
    }
}