Trait InferenceModelExt 

pub trait InferenceModelExt {
    // Required methods
    fn analyse(&mut self, obstinate: bool) -> Result<bool, Error>;
    fn incorporate(
        self,
    ) -> Result<Graph<InferenceFact, Box<dyn InferenceOp>>, Error>;
    fn missing_type_shape(&self) -> Result<Vec<OutletId>, Error>;
    fn eliminate_dead_branches(
        self,
    ) -> Result<Graph<InferenceFact, Box<dyn InferenceOp>>, Error>;
    fn into_typed(self) -> Result<Graph<TypedFact, Box<dyn TypedOp>>, Error>;
    fn into_optimized(self) -> Result<Graph<TypedFact, Box<dyn TypedOp>>, Error>;
}

Required Methods

fn analyse(&mut self, obstinate: bool) -> Result<bool, Error>

Analyse all nodes of the graph.

Will stop on first error unless obstinate is true.

fn incorporate( self, ) -> Result<Graph<InferenceFact, Box<dyn InferenceOp>>, Error>

Perform early transformation before going typed.

fn missing_type_shape(&self) -> Result<Vec<OutletId>, Error>

List OutletId with incomplete type information.

Will stop on first error unless obstinate is true.

fn eliminate_dead_branches( self, ) -> Result<Graph<InferenceFact, Box<dyn InferenceOp>>, Error>

Eliminate seemingly dead branches of the graph.

This may break stateful networks.

fn into_typed(self) -> Result<Graph<TypedFact, Box<dyn TypedOp>>, Error>

Attempt full analyse and conversion to TypedModel.

fn into_optimized(self) -> Result<Graph<TypedFact, Box<dyn TypedOp>>, Error>

Attempt full analyse, decluttering and mapping to optimized operations.

This will work even if the network can not be normalized.

Implementors

impl InferenceModelExt for Graph<InferenceFact, Box<dyn InferenceOp>>