pub fn check(fs: &[(fn() -> (Vec<Expr>, Vec<Expr>), bool)]) {
    for (i, &(f, ok)) in fs.iter().enumerate() {
        let (start, goal) = f();
        let order_constraints = vec![];

        // Use `solve` because it's faster than reduction.
        let (_, status) = solve(
            &start,
            &goal,
            None,
            &[],
            &order_constraints,
            infer,
        );
        if status.is_ok() != ok {
            panic!("Failed check `{}`", i);
        }
    }
}
/// Checks a list of tests.
Checks a list of tests.
Checks a list of tests .
pub fn check(fs: &[(fn() -> (Vec<Expr>, Vec<Expr>), bool)]) {
    for (i, &(f, ok)) in fs.iter().enumerate() {
        let (start, goal) = f();
        let order_constraints = vec![];
        // Use `solve` because it's faster than reduction.
        let (_, status) = solve(
            &start,
            &goal,
            None,
            &[],
            &order_constraints,
            infer,
        );
        if status.is_ok() != ok {
            panic!("Failed check `{}`", i);
        }
    }
}
pub fn check ( fs : & [ ( fn ( ) -> ( Vec < Expr > , Vec < Expr > ) , bool ) ] ) { for ( i , & ( f , ok ) ) in fs . iter ( ) . enumerate ( ) { let ( start , goal ) = f ( ) ; let order_constraints = vec ! [ ] ; // Use `solve` because it's faster than reduction. let ( _ , status ) = solve ( & start , & goal , None , & [ ] , & order_constraints , infer , ) ; if status . is_ok ( ) != ok { panic ! ( " " i ) ; } } }
Checks a list of tests.
Checks a list of tests .
fs
&[(fn() -> (Vec<Expr>, Vec<Expr>), bool)]
fs
&[(fn() -> (Vec<Expr>, Vec<Expr>), bool)]