Enum TreeNodeRecursion

pub enum TreeNodeRecursion {
    Continue,
    Jump,
    Stop,
}

Controls how TreeNode recursions should proceed.

Variants

Continue

Continue recursion with the next node.

Jump

In top-down traversals, skip recursing into children but continue with the next node, which actually means pruning of the subtree.

In bottom-up traversals, bypass calling bottom-up closures till the next leaf node.

In combined traversals, if it is the f_down (pre-order) phase, execution “jumps” to the next f_up (post-order) phase by shortcutting its children. If it is the f_up (post-order) phase, execution “jumps” to the next f_down (pre-order) phase by shortcutting its parent nodes until the first parent node having unvisited children path.

Stop

Stop recursion.

Implementations

impl TreeNodeRecursion

pub fn visit_children<F>( self, f: F, ) -> Result<TreeNodeRecursion, DataFusionError>

where F: FnOnce() -> Result<TreeNodeRecursion, DataFusionError>,

Continues visiting nodes with f depending on the current TreeNodeRecursion value and the fact that f is visiting the current node’s children.

pub fn visit_sibling<F>( self, f: F, ) -> Result<TreeNodeRecursion, DataFusionError>

where F: FnOnce() -> Result<TreeNodeRecursion, DataFusionError>,

Continues visiting nodes with f depending on the current TreeNodeRecursion value and the fact that f is visiting the current node’s sibling.

pub fn visit_parent<F>(self, f: F) -> Result<TreeNodeRecursion, DataFusionError>

where F: FnOnce() -> Result<TreeNodeRecursion, DataFusionError>,

Continues visiting nodes with f depending on the current TreeNodeRecursion value and the fact that f is visiting the current node’s parent.

Trait Implementations

impl Clone for TreeNodeRecursion

fn clone(&self) -> TreeNodeRecursion

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for TreeNodeRecursion

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl PartialEq for TreeNodeRecursion

fn eq(&self, other: &TreeNodeRecursion) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for TreeNodeRecursion

impl StructuralPartialEq for TreeNodeRecursion