Method transform_up

datafusion/common/src/tree_node.rs:255–269

Recursively rewrite the node using `f` in a bottom-up (post-order) fashion. `f` is applied to the node's children first, and then to the node itself. # See Also [`Self::transform_down`] top-down (pre-order) traversal. [Self::transform_down_up] for a combined traversal with closures [`Self::rewrite`] for a combined traversal with a visitor

(
        self,
        mut f: F,
    )

    /// * [Self::transform_down_up] for a combined traversal with closures
    /// * [`Self::rewrite`] for a combined traversal with a visitor
    fn transform_up<F: FnMut(Self) -> Result<Transformed<Self>>>(
        self,
        mut f: F,
    ) -> Result<Transformed<Self>> {
        #[cfg_attr(feature = "recursive_protection", recursive::recursive)]
        fn transform_up_impl<N: TreeNode, F: FnMut(N) -> Result<Transformed<N>>>(
            node: N,
            f: &mut F,
        ) -> Result<Transformed<N>> {
            node.map_children(|c| transform_up_impl(c, f))?
                .transform_parent(f)
        }

        transform_up_impl(self, &mut f)
    }

    /// Transforms the node using `f_down` while traversing the tree top-down
    /// (pre-order), and using `f_up` while traversing the tree bottom-up