datafusion_iceberg 0.10.0

Datafusion integration for Iceberg table format
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
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145

use core::fmt;
use std::{collections::BTreeMap, fmt::Debug, sync::Arc};

use datafusion::common::DFSchemaRef;
use datafusion_expr::{Expr, Extension, LogicalPlan, UserDefinedLogicalNodeCore};

#[derive(PartialEq, Eq, Hash, PartialOrd)]
pub struct PosDeltaNode {
    pub input: Arc<LogicalPlan>,
    pub aliases: BTreeMap<String, String>,
}

impl Debug for PosDeltaNode {
    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
        self.fmt_for_explain(f)
    }
}

impl UserDefinedLogicalNodeCore for PosDeltaNode {
    fn name(&self) -> &str {
        "PosDelta"
    }

    fn inputs(&self) -> Vec<&LogicalPlan> {
        vec![&self.input]
    }

    fn schema(&self) -> &DFSchemaRef {
        self.input.schema()
    }

    fn expressions(&self) -> Vec<Expr> {
        vec![]
    }

    fn fmt_for_explain(&self, f: &mut fmt::Formatter) -> fmt::Result {
        write!(f, "PosDelta")
    }

    fn with_exprs_and_inputs(
        &self,
        exprs: Vec<Expr>,
        inputs: Vec<LogicalPlan>,
    ) -> datafusion::error::Result<Self> {
        assert_eq!(inputs.len(), 1, "input size inconsistent");
        assert_eq!(exprs.len(), 0, "expression size inconsistent");
        Ok(Self {
            input: Arc::new(inputs[0].clone()),
            aliases: BTreeMap::new(),
        })
    }
}

impl PosDeltaNode {
    pub fn new(plan: Arc<LogicalPlan>) -> Self {
        Self {
            input: plan,
            aliases: BTreeMap::new(),
        }
    }

    pub fn new_with_aliases(plan: Arc<LogicalPlan>, aliases: BTreeMap<String, String>) -> Self {
        Self {
            input: plan,
            aliases,
        }
    }
}

impl From<PosDeltaNode> for LogicalPlan {
    fn from(value: PosDeltaNode) -> Self {
        LogicalPlan::Extension(Extension {
            node: Arc::new(value),
        })
    }
}

#[derive(PartialEq, Eq, Hash, PartialOrd)]
pub struct NegDeltaNode {
    pub input: Arc<LogicalPlan>,
    pub aliases: BTreeMap<String, String>,
}

impl Debug for NegDeltaNode {
    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
        self.fmt_for_explain(f)
    }
}

impl UserDefinedLogicalNodeCore for NegDeltaNode {
    fn name(&self) -> &str {
        "NegDelta"
    }

    fn inputs(&self) -> Vec<&LogicalPlan> {
        vec![&self.input]
    }

    fn schema(&self) -> &DFSchemaRef {
        self.input.schema()
    }

    fn expressions(&self) -> Vec<Expr> {
        vec![]
    }

    fn fmt_for_explain(&self, f: &mut fmt::Formatter) -> fmt::Result {
        write!(f, "NegDelta")
    }

    fn with_exprs_and_inputs(
        &self,
        _exprs: Vec<Expr>,
        inputs: Vec<LogicalPlan>,
    ) -> datafusion::error::Result<Self> {
        Ok(Self {
            input: Arc::new(inputs[0].clone()),
            aliases: BTreeMap::new(),
        })
    }
}

impl NegDeltaNode {
    pub fn new(plan: Arc<LogicalPlan>) -> Self {
        Self {
            input: plan,
            aliases: BTreeMap::new(),
        }
    }

    pub fn new_with_aliases(plan: Arc<LogicalPlan>, aliases: BTreeMap<String, String>) -> Self {
        Self {
            input: plan,
            aliases,
        }
    }
}

impl From<NegDeltaNode> for LogicalPlan {
    fn from(value: NegDeltaNode) -> Self {
        LogicalPlan::Extension(Extension {
            node: Arc::new(value),
        })
    }
}