pub fn new_backward(top: F, trans: Trans, join: Join) -> Self {
        Self {
            first_fact: NodeInfo {
                before: top.clone(),
                after: top.clone(),
            },
            init_fact: NodeInfo {
                before: top.clone(),
                after: top,
            },
            trans,
            join,

            infos: HashMap::default(),

            _graph: std::marker::PhantomData,
            _node: std::marker::PhantomData,
            _sort: std::marker::PhantomData,
        }
    }
/// Create a new backwards problem with the given exit fact, top fact,
/// transformation function and join function. `top` should have the
/// property that `join(vec![f, top]) == f` for all facts `f`
Create a new backwards problem with the given exit fact, top fact,
transformation function and join function.
Create a new backwards problem with the given exit fact top fact transformation function and join function .
pub fn new_backward(top: F, trans: Trans, join: Join) -> Self {
        Self {
            first_fact: NodeInfo {
                before: top.clone(),
                after: top.clone(),
            },
            init_fact: NodeInfo {
                before: top.clone(),
                after: top,
            },
            trans,
            join,
            infos: HashMap::default(),
            _graph: std::marker::PhantomData,
            _node: std::marker::PhantomData,
            _sort: std::marker::PhantomData,
        }
    }
pub fn new_backward ( top : F , trans : Trans , join : Join ) -> Self { Self { first_fact : NodeInfo { before : top . clone ( ) , after : top . clone ( ) , } , init_fact : NodeInfo { before : top . clone ( ) , after : top , } , trans , join , infos : HashMap :: default ( ) , _graph : std :: marker :: PhantomData , _node : std :: marker :: PhantomData , _sort : std :: marker :: PhantomData , } }
Create a new backwards problem with the given exit fact, top fact,
transformation function and join function.
Create a new backwards problem with the given exit fact top fact transformation function and join function .
top
F
trans
Trans
join
Join