vortex-array 0.88.0

Vortex in memory columnar data 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

// SPDX-License-Identifier: Apache-2.0
// SPDX-FileCopyrightText: Copyright the Vortex contributors

use std::marker::PhantomData;

use vortex_error::VortexResult;

use crate::expr::traversal::Node;
use crate::expr::traversal::NodeExt;
use crate::expr::traversal::NodeVisitor;
use crate::expr::traversal::TraversalOrder;

struct FnVisitor<'a, F, T: 'a>
where
    F: FnMut(&'a T) -> VortexResult<TraversalOrder>,
{
    f: F,
    _data: PhantomData<&'a T>,
}

impl<'a, T, F> NodeVisitor<'a> for FnVisitor<'a, F, T>
where
    F: FnMut(&'a T) -> VortexResult<TraversalOrder>,
    T: NodeExt,
{
    type NodeTy = T;

    fn visit_down(&mut self, node: &'a T) -> VortexResult<TraversalOrder> {
        (self.f)(node)
    }
}

/// Traverse a [`Node`]-based tree using a closure. It will do it by walking the tree from the top going down.
pub fn pre_order_visit_down<'a, T: 'a + Node>(
    tree: &'a T,
    f: impl FnMut(&'a T) -> VortexResult<TraversalOrder>,
) -> VortexResult<()> {
    let mut visitor = FnVisitor {
        f,
        _data: PhantomData,
    };

    tree.accept(&mut visitor)?;

    Ok(())
}