Struct CSE 

pub struct CSE<N, C: CSEController<Node = N>> {
    random_state: RandomState,
    phantom_data: PhantomData<N>,
    controller: C,
}

The main entry point of Common Subexpression Elimination.

CSE requires a CSEController, that defines how common subtrees of a particular TreeNode tree can be eliminated. The elimination process can be started with the CSE::extract_common_nodes() method.

Fields

random_state: RandomState

phantom_data: PhantomData<N>

controller: C

Implementations

impl<N, C> CSE<N, C>

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

pub fn new(controller: C) -> Self

fn node_to_id_array<'n>( &mut self, node: &'n N, node_stats: &mut HashMap<Identifier<'n, N>, NodeEvaluation>, id_array: &mut Vec<(usize, Option<Identifier<'n, N>>)>, ) -> Result<bool>

Add an identifier to id_array for every TreeNode in this tree.

fn to_arrays<'n>( &mut self, nodes: &'n [N], node_stats: &mut HashMap<Identifier<'n, N>, NodeEvaluation>, ) -> Result<(bool, Vec<Vec<(usize, Option<Identifier<'n, N>>)>>)>

Returns the identifier list for each element in nodes and a flag to indicate if rewrite phase of CSE make sense.

Returns and array with 1 element for each input node in nodes

Each element is itself the result of CSE::node_to_id_array for that node (e.g. the identifiers for each node in the tree)

fn replace_common_node<'n>( &mut self, node: N, id_array: &Vec<(usize, Option<Identifier<'n, N>>)>, node_stats: &HashMap<Identifier<'n, N>, NodeEvaluation>, common_nodes: &mut IndexMap<Identifier<'n, N>, (N, String)>, ) -> Result<N>

Replace common subtrees in node with the corresponding temporary TreeNode, updating common_nodes with any replaced TreeNode

fn rewrite_nodes_list<'n>( &mut self, nodes_list: Vec<Vec<N>>, arrays_list: &[Vec<Vec<(usize, Option<Identifier<'n, N>>)>>], node_stats: &HashMap<Identifier<'n, N>, NodeEvaluation>, common_nodes: &mut IndexMap<Identifier<'n, N>, (N, String)>, ) -> Result<Vec<Vec<N>>>

Replace common subtrees in nodes_list with the corresponding temporary TreeNode, updating common_nodes with any replaced TreeNode.

pub fn extract_common_nodes( &mut self, nodes_list: Vec<Vec<N>>, ) -> Result<FoundCommonNodes<N>>

Extracts common TreeNodes and rewrites nodes_list.

Returns FoundCommonNodes recording the result of the extraction.