Struct chalk_recursive::RecursiveSolver
source · pub struct RecursiveSolver<I: Interner> {
ctx: Box<RecursiveContext<UCanonicalGoal<I>, Fallible<Solution<I>>>>,
}
Fields§
§ctx: Box<RecursiveContext<UCanonicalGoal<I>, Fallible<Solution<I>>>>
Implementations§
source§impl<I: Interner> RecursiveSolver<I>
impl<I: Interner> RecursiveSolver<I>
Trait Implementations§
source§impl<I: Interner> Debug for RecursiveSolver<I>
impl<I: Interner> Debug for RecursiveSolver<I>
source§impl<I: Interner> Solver<I> for RecursiveSolver<I>
impl<I: Interner> Solver<I> for RecursiveSolver<I>
source§fn solve(
&mut self,
program: &dyn RustIrDatabase<I>,
goal: &UCanonical<InEnvironment<Goal<I>>>,
) -> Option<Solution<I>>
fn solve( &mut self, program: &dyn RustIrDatabase<I>, goal: &UCanonical<InEnvironment<Goal<I>>>, ) -> Option<Solution<I>>
Attempts to solve the given goal, which must be in canonical
form. Returns a unique solution (if one exists). This will do
only as much work towards
goal
as it has to (and that work
is cached for future attempts). Read moresource§fn solve_limited(
&mut self,
program: &dyn RustIrDatabase<I>,
goal: &UCanonical<InEnvironment<Goal<I>>>,
should_continue: &dyn Fn() -> bool,
) -> Option<Solution<I>>
fn solve_limited( &mut self, program: &dyn RustIrDatabase<I>, goal: &UCanonical<InEnvironment<Goal<I>>>, should_continue: &dyn Fn() -> bool, ) -> Option<Solution<I>>
Attempts to solve the given goal, which must be in canonical
form. Returns a unique solution (if one exists). This will do
only as much work towards
goal
as it has to (and that work
is cached for future attempts). In addition, the solving of the
goal can be limited by returning false
from should_continue
. Read moresource§fn solve_multiple(
&mut self,
_program: &dyn RustIrDatabase<I>,
_goal: &UCanonical<InEnvironment<Goal<I>>>,
_f: &mut dyn FnMut(SubstitutionResult<Canonical<ConstrainedSubst<I>>>, bool) -> bool,
) -> bool
fn solve_multiple( &mut self, _program: &dyn RustIrDatabase<I>, _goal: &UCanonical<InEnvironment<Goal<I>>>, _f: &mut dyn FnMut(SubstitutionResult<Canonical<ConstrainedSubst<I>>>, bool) -> bool, ) -> bool
Attempts to solve the given goal, which must be in canonical
form. Provides multiple solutions to function
f
. This will do
only as much work towards goal
as it has to (and that work
is cached for future attempts). Read more§fn has_unique_solution(
&mut self,
program: &dyn RustIrDatabase<I>,
goal: &UCanonical<InEnvironment<Goal<I>>>,
) -> bool
fn has_unique_solution( &mut self, program: &dyn RustIrDatabase<I>, goal: &UCanonical<InEnvironment<Goal<I>>>, ) -> bool
A convenience method for when one doesn’t need the actual solution,
only whether or not one exists.
Auto Trait Implementations§
impl<I> Freeze for RecursiveSolver<I>
impl<I> RefUnwindSafe for RecursiveSolver<I>where
<I as Interner>::InternedCanonicalVarKinds: RefUnwindSafe,
<I as Interner>::InternedGoal: RefUnwindSafe,
<I as Interner>::InternedProgramClauses: RefUnwindSafe,
<I as Interner>::InternedSubstitution: RefUnwindSafe,
<I as Interner>::InternedConstraints: RefUnwindSafe,
impl<I> Send for RecursiveSolver<I>
impl<I> Sync for RecursiveSolver<I>
impl<I> Unpin for RecursiveSolver<I>
impl<I> UnwindSafe for RecursiveSolver<I>where
<I as Interner>::InternedCanonicalVarKinds: UnwindSafe,
<I as Interner>::InternedGoal: UnwindSafe,
<I as Interner>::InternedProgramClauses: UnwindSafe,
<I as Interner>::InternedSubstitution: UnwindSafe,
<I as Interner>::InternedConstraints: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more