pub fn solve_and_reduce<T: Clone + PartialEq + Eq + Hash>(
    start: &[T],
    goal: &[T],
    max_size: Option<usize>,
    filter: &[T],
    order_constraints: &[(T, T)],
    infer: fn(Solver<T>, story: &[T]) -> Option<T>
) -> (Vec<T>, Result<(), Error>) {
    solve_and_reduce_with_accelerator(start, goal, max_size, filter,
                                      order_constraints, infer, |_, _| ())
}
/// Solves and reduces the proof to those steps that are necessary.
Solves and reduces the proof to those steps that are necessary.
Solves and reduces the proof to those steps that are necessary .
pub fn solve_and_reduce<T: Clone + PartialEq + Eq + Hash>(
    start: &[T],
    goal: &[T],
    max_size: Option<usize>,
    filter: &[T],
    order_constraints: &[(T, T)],
    infer: fn(Solver<T>, story: &[T]) -> Option<T>
) -> (Vec<T>, Result<(), Error>) {
    solve_and_reduce_with_accelerator(start, goal, max_size, filter,
                                      order_constraints, infer, |_, _| ())
}
pub fn solve_and_reduce < T : Clone + PartialEq + Eq + Hash > ( start : & [ T ] , goal : & [ T ] , max_size : Option < usize > , filter : & [ T ] , order_constraints : & [ ( T , T ) ] , infer : fn ( Solver < T > , story : & [ T ] ) -> Option < T > ) -> ( Vec < T > , Result < ( ) , Error > ) { solve_and_reduce_with_accelerator ( start , goal , max_size , filter , order_constraints , infer , | _ , _ | ( ) ) }
Solves and reduces the proof to those steps that are necessary.
Solves and reduces the proof to those steps that are necessary .
start
&[T]
goal
&[T]
max_size
Option<usize>
filter
&[T]
order_constraints
&[(T, T)]
infer
fn(Solver<T>, story: &[T]) -> Option<T>
story
&[T]
start
&[T]
goal
&[T]
max_size
Option<usize>
filter
&[T]
order_constraints
&[(T, T)]
infer
fn(Solver<T>, story: &[T]) -> Option<T>
story
&[T]