[−][src]Trait rustc_trait_selection::infer::InferCtxtBuilderExt
Required methods
pub fn enter_canonical_trait_query<K, R>(
&mut self,
canonical_key: &Canonical<'tcx, K>,
operation: impl FnOnce(&InferCtxt<'_, 'tcx>, &mut dyn TraitEngine<'tcx>, K) -> Fallible<R>
) -> Fallible<CanonicalizedQueryResponse<'tcx, R>> where
K: TypeFoldable<'tcx>,
R: Debug + TypeFoldable<'tcx>,
Canonical<'tcx, QueryResponse<'tcx, R>>: ArenaAllocatable<'tcx>, [src]
&mut self,
canonical_key: &Canonical<'tcx, K>,
operation: impl FnOnce(&InferCtxt<'_, 'tcx>, &mut dyn TraitEngine<'tcx>, K) -> Fallible<R>
) -> Fallible<CanonicalizedQueryResponse<'tcx, R>> where
K: TypeFoldable<'tcx>,
R: Debug + TypeFoldable<'tcx>,
Canonical<'tcx, QueryResponse<'tcx, R>>: ArenaAllocatable<'tcx>,
Implementors
impl<'tcx> InferCtxtBuilderExt<'tcx> for InferCtxtBuilder<'tcx>[src]
pub fn enter_canonical_trait_query<K, R>(
&mut self,
canonical_key: &Canonical<'tcx, K>,
operation: impl FnOnce(&InferCtxt<'_, 'tcx>, &mut dyn TraitEngine<'tcx>, K) -> Fallible<R>
) -> Fallible<CanonicalizedQueryResponse<'tcx, R>> where
K: TypeFoldable<'tcx>,
R: Debug + TypeFoldable<'tcx>,
Canonical<'tcx, QueryResponse<'tcx, R>>: ArenaAllocatable<'tcx>, [src]
&mut self,
canonical_key: &Canonical<'tcx, K>,
operation: impl FnOnce(&InferCtxt<'_, 'tcx>, &mut dyn TraitEngine<'tcx>, K) -> Fallible<R>
) -> Fallible<CanonicalizedQueryResponse<'tcx, R>> where
K: TypeFoldable<'tcx>,
R: Debug + TypeFoldable<'tcx>,
Canonical<'tcx, QueryResponse<'tcx, R>>: ArenaAllocatable<'tcx>,
The "main method" for a canonicalized trait query. Given the
canonical key canonical_key, this method will create a new
inference context, instantiate the key, and run your operation
op. The operation should yield up a result (of type R) as
well as a set of trait obligations that must be fully
satisfied. These obligations will be processed and the
canonical result created.
Returns NoSolution in the event of any error.
(It might be mildly nicer to implement this on TyCtxt, and
not InferCtxtBuilder, but that is a bit tricky right now.
In part because we would need a for<'tcx> sort of
bound for the closure and in part because it is convenient to
have 'tcx be free on this function so that we can talk about
K: TypeFoldable<'tcx>.)