MCPcopy Create free account
hub / github.com/apache/datafusion / visit

Method visit

datafusion/common/src/tree_node.rs:128–136  ·  view source on GitHub ↗
(
        &'n self,
        visitor: &mut V,
    )

Source from the content-addressed store, hash-verified

126 /// ```
127 #[cfg_attr(feature = "recursive_protection", recursive::recursive)]
128 fn visit<'n, V: TreeNodeVisitor<'n, Node = Self>>(
129 &'n self,
130 visitor: &mut V,
131 ) -> Result<TreeNodeRecursion> {
132 visitor
133 .f_down(self)?
134 .visit_children(|| self.apply_children(|c| c.visit(visitor)))?
135 .visit_parent(|| visitor.f_up(self))
136 }
137
138 /// Rewrite the tree node with a [`TreeNodeRewriter`], performing a
139 /// depth-first walk of the node and its children.

Callers 2

test_large_treeFunction · 0.45

Implementers 3

tree_node.rsdatafusion/expr/src/tree_node.rs
tree_node.rsdatafusion/expr/src/logical_plan/tree_
tree_node.rsdatafusion/common/src/tree_node.rs

Calls 5

visit_parentMethod · 0.80
visit_childrenMethod · 0.80
f_downMethod · 0.45
apply_childrenMethod · 0.45
f_upMethod · 0.45

Tested by 2

test_large_treeFunction · 0.36