Modules§
- build 🔒Building proof trees incrementally during trait solving.
Structs§
- When evaluating a goal we also store the original values for the
CanonicalVarValues
of the canonicalized goal. We use this to map any CanonicalState from the localInferCtxt
of the solver query to theInferCtxt
of the caller. - A self-contained computation during trait solving. This either corresponds to a
EvalCtxt::probe(_X)
call or the root evaluation of a goal. - Some
data
together with information about how they relate to the input of the canonical query.
Enums§
- What kind of probe we’re in. In case the probe represents a candidate, or the final result of the current goal - via ProbeKind::Root - we also store the QueryResult.