polars-plan 0.54.1

Lazy query engine for the Polars DataFrame library
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

use std::ops::{Deref, DerefMut};

use polars_utils::arena::{Arena, Node};

use crate::plans::IR;
use crate::traversal::tree_traversal::GetNodeInputs;

pub struct IRTraversalStorage<'a> {
    pub arena: &'a mut Arena<IR>,
    pub skip_subtree: fn(&IR) -> bool,
}

impl IRTraversalStorage<'_> {
    pub fn skip_subtree(&self, ir: &IR) -> bool {
        (self.skip_subtree)(ir)
    }
}

impl GetNodeInputs<Node> for IRTraversalStorage<'_> {
    fn get_node_inputs(&self, key: Node, push_fn: &mut dyn FnMut(Node)) {
        if !self.skip_subtree(self.get(key)) {
            self.arena.get_node_inputs(key, push_fn)
        }
    }
}

impl<'a> Deref for IRTraversalStorage<'a> {
    type Target = Arena<IR>;

    fn deref(&self) -> &Self::Target {
        self.arena
    }
}

impl<'a> DerefMut for IRTraversalStorage<'a> {
    fn deref_mut(&mut self) -> &mut Self::Target {
        self.arena
    }
}