Struct CSERewriter 

struct CSERewriter<'a, 'n, N, C>
where
    N: NormalizeEq,
    C: CSEController<Node = N>,
{
    node_stats: &'a HashMap<Identifier<'n, N>, NodeEvaluation>,
    id_array: &'a Vec<(usize, Option<Identifier<'n, N>>)>,
    common_nodes: &'a mut IndexMap<Identifier<'n, N>, (N, String)>,
    down_index: usize,
    controller: &'a mut C,
}

Rewrite a TreeNode tree by replacing detected common subtrees with the corresponding temporary TreeNode, that column contains the evaluate result of replaced TreeNode tree.

Fields

node_stats: &'a HashMap<Identifier<'n, N>, NodeEvaluation>

statistics of TreeNodes

id_array: &'a Vec<(usize, Option<Identifier<'n, N>>)>

cache to speed up second traversal

common_nodes: &'a mut IndexMap<Identifier<'n, N>, (N, String)>

common TreeNodes, that are replaced during the second traversal, are collected to this map

down_index: usize

controller: &'a mut C

Trait Implementations

impl<N, C> TreeNodeRewriter for CSERewriter<'_, '_, N, C>

where N: TreeNode + NormalizeEq, C: CSEController<Node = N>,

type Node = N

The node type which is rewritable.

fn f_down(&mut self, node: Self::Node) -> Result<Transformed<Self::Node>>

Invoked while traversing down the tree before any children are rewritten. Default implementation returns the node as is and continues recursion.

fn f_up(&mut self, node: Self::Node) -> Result<Transformed<Self::Node>>

Invoked while traversing up the tree after all children have been rewritten. Default implementation returns the node as is and continues recursion.