pre_order_visit_down

vortex_array::expr::traversal

Function pre_order_visit_down 

Source 
pub fn pre_order_visit_down<'a, T: 'a + Node>(
    tree: &'a T,
    f: impl FnMut(&'a T) -> VortexResult<TraversalOrder>,
) -> VortexResult<()>
Expand description

Traverse a Node-based tree using a closure. It will do it by walking the tree from the top going down.