pub fn search<T, F, U>(
    start: &[T],
    pat: F,
    max_size: Option<usize>,
    filter: &[T],
    order_constraints: &[(T, T)],
    infer: fn(Solver<T>, story: &[T]) -> Option<T>
) -> (Vec<U>, Result<(), Error>)
    where T: Clone + PartialEq + Eq + Hash,
          F: Fn(&T) -> Option<U>
{
    search_with_accelerator(start, pat, max_size, filter, order_constraints, infer, &mut ())
}
/// Searches for matches by a pattern.
///
/// - `pat` specifies the map and acceptance criteria
/// - `max_size` specifies the maximum size of proof
///
/// Returns `Ok` if all rules where exausted.
/// Returns `Err` if the maximum size of proof was exceeded.
Searches for matches by a pattern.
`pat` specifies the map and acceptance criteria
`max_size` specifies the maximum size of proof

Returns `Ok` if all rules where exausted.
Returns `Err` if the maximum size of proof was exceeded.
Searches for matches by a pattern . ` pat ` specifies the map and acceptance criteria ` max_size ` specifies the maximum size of proof Returns ` Ok ` if all rules where exausted . Returns ` Err ` if the maximum size of proof was exceeded .
pub fn search<T, F, U>(
    start: &[T],
    pat: F,
    max_size: Option<usize>,
    filter: &[T],
    order_constraints: &[(T, T)],
    infer: fn(Solver<T>, story: &[T]) -> Option<T>
) -> (Vec<U>, Result<(), Error>)
    where T: Clone + PartialEq + Eq + Hash,
          F: Fn(&T) -> Option<U>
{
    search_with_accelerator(start, pat, max_size, filter, order_constraints, infer, &mut ())
}
pub fn search < T , F , U > ( start : & [ T ] , pat : F , max_size : Option < usize > , filter : & [ T ] , order_constraints : & [ ( T , T ) ] , infer : fn ( Solver < T > , story : & [ T ] ) -> Option < T > ) -> ( Vec < U > , Result < ( ) , Error > ) where T : Clone + PartialEq + Eq + Hash , F : Fn ( & T ) -> Option < U > { search_with_accelerator ( start , pat , max_size , filter , order_constraints , infer , & mut ( ) ) }
Searches for matches by a pattern.
Searches for matches by a pattern .
start
&[T]
pat
F
max_size
Option<usize>
filter
&[T]
order_constraints
&[(T, T)]
infer
fn(Solver<T>, story: &[T]) -> Option<T>
story
&[T]
start
&[T]
pat
F
max_size
Option<usize>
filter
&[T]
order_constraints
&[(T, T)]
infer
fn(Solver<T>, story: &[T]) -> Option<T>
story
&[T]