Struct rustc_trait_selection::solve::delegate::SolverDelegate
source · #[repr(transparent)]pub struct SolverDelegate<'tcx>(InferCtxt<'tcx>);
Tuple Fields§
§0: InferCtxt<'tcx>
Methods from Deref<Target = InferCtxt<'tcx>>§
pub fn at<'a>( &'a self, cause: &'a ObligationCause<'tcx>, param_env: ParamEnv<'tcx>, ) -> At<'a, 'tcx>
sourcepub fn fork(&self) -> InferCtxt<'tcx>
pub fn fork(&self) -> InferCtxt<'tcx>
Forks the inference context, creating a new inference context with the same inference variables in the same state. This can be used to “branch off” many tests from the same common state.
sourcepub fn fork_with_intercrate(&self, intercrate: bool) -> InferCtxt<'tcx>
pub fn fork_with_intercrate(&self, intercrate: bool) -> InferCtxt<'tcx>
Forks the inference context, creating a new inference context with the same inference variables in the same state, except possibly changing the intercrate mode. This can be used to “branch off” many tests from the same common state. Used in negative coherence.
sourcepub fn canonicalize_query<V>(
&self,
value: ParamEnvAnd<'tcx, V>,
query_state: &mut OriginalQueryValues<'tcx>,
) -> Canonical<TyCtxt<'tcx>, ParamEnvAnd<'tcx, V>>where
V: TypeFoldable<TyCtxt<'tcx>>,
pub fn canonicalize_query<V>(
&self,
value: ParamEnvAnd<'tcx, V>,
query_state: &mut OriginalQueryValues<'tcx>,
) -> Canonical<TyCtxt<'tcx>, ParamEnvAnd<'tcx, V>>where
V: TypeFoldable<TyCtxt<'tcx>>,
Canonicalizes a query value V
. When we canonicalize a query,
we not only canonicalize unbound inference variables, but we
also replace all free regions whatsoever. So for example a
query like T: Trait<'static>
would be canonicalized to
T: Trait<'?0>
with a mapping M that maps '?0
to 'static
.
To get a good understanding of what is happening here, check out the chapter in the rustc dev guide.
sourcepub fn canonicalize_response<V>(&self, value: V) -> Canonical<TyCtxt<'tcx>, V>where
V: TypeFoldable<TyCtxt<'tcx>>,
pub fn canonicalize_response<V>(&self, value: V) -> Canonical<TyCtxt<'tcx>, V>where
V: TypeFoldable<TyCtxt<'tcx>>,
Canonicalizes a query response V
. When we canonicalize a
query response, we only canonicalize unbound inference
variables, and we leave other free regions alone. So,
continuing with the example from canonicalize_query
, if
there was an input query T: Trait<'static>
, it would have
been canonicalized to
T: Trait<'?0>
with a mapping M that maps '?0
to 'static
. But if we found that there
exists only one possible impl of Trait
, and it looks like
impl<T> Trait<'static> for T { .. }
then we would prepare a query result R that (among other
things) includes a mapping to '?0 := 'static
. When
canonicalizing this query result R, we would leave this
reference to 'static
alone.
To get a good understanding of what is happening here, check out the chapter in the rustc dev guide.
pub fn canonicalize_user_type_annotation<V>(
&self,
value: V,
) -> Canonical<TyCtxt<'tcx>, V>where
V: TypeFoldable<TyCtxt<'tcx>>,
sourcepub fn make_canonicalized_query_response<T>(
&self,
inference_vars: CanonicalVarValues<TyCtxt<'tcx>>,
answer: T,
fulfill_cx: &mut (dyn TraitEngine<'tcx, ScrubbedTraitError<'tcx>> + 'tcx),
) -> Result<&'tcx Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, T>>, NoSolution>where
T: Debug + TypeFoldable<TyCtxt<'tcx>>,
Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, T>>: ArenaAllocatable<'tcx>,
pub fn make_canonicalized_query_response<T>(
&self,
inference_vars: CanonicalVarValues<TyCtxt<'tcx>>,
answer: T,
fulfill_cx: &mut (dyn TraitEngine<'tcx, ScrubbedTraitError<'tcx>> + 'tcx),
) -> Result<&'tcx Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, T>>, NoSolution>where
T: Debug + TypeFoldable<TyCtxt<'tcx>>,
Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, T>>: ArenaAllocatable<'tcx>,
This method is meant to be invoked as the final step of a canonical query implementation. It is given:
- the instantiated variables
inference_vars
created from the query key - the result
answer
of the query - a fulfillment context
fulfill_cx
that may contain various obligations which have yet to be proven.
Given this, the function will process the obligations pending
in fulfill_cx
:
- If all the obligations can be proven successfully, it will
package up any resulting region obligations (extracted from
infcx
) along with the fully resolved valueanswer
into a query result (which is then itself canonicalized). - If some obligations can be neither proven nor disproven, then the same thing happens, but the resulting query is marked as ambiguous.
- Finally, if any of the obligations result in a hard error,
then
Err(NoSolution)
is returned.
sourcepub fn make_query_response_ignoring_pending_obligations<T>(
&self,
inference_vars: CanonicalVarValues<TyCtxt<'tcx>>,
answer: T,
) -> Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, T>>
pub fn make_query_response_ignoring_pending_obligations<T>( &self, inference_vars: CanonicalVarValues<TyCtxt<'tcx>>, answer: T, ) -> Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, T>>
A version of make_canonicalized_query_response
that does
not pack in obligations, for contexts that want to drop
pending obligations instead of treating them as an ambiguity (e.g.
typeck “probing” contexts).
If you DO want to keep track of pending obligations (which include all region obligations, so this includes all cases that care about regions) with this function, you have to do it yourself, by e.g., having them be a part of the answer.
sourcepub fn clone_opaque_types_for_query_response(
&self,
) -> Vec<(OpaqueTypeKey<TyCtxt<'tcx>>, Ty<'tcx>)>
pub fn clone_opaque_types_for_query_response( &self, ) -> Vec<(OpaqueTypeKey<TyCtxt<'tcx>>, Ty<'tcx>)>
Used by the new solver as that one takes the opaque types at the end of a probe to deal with multiple candidates without having to recompute them.
sourcepub fn instantiate_query_response_and_region_obligations<R>(
&self,
cause: &ObligationCause<'tcx>,
param_env: ParamEnv<'tcx>,
original_values: &OriginalQueryValues<'tcx>,
query_response: &Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, R>>,
) -> Result<InferOk<'tcx, R>, TypeError<TyCtxt<'tcx>>>
pub fn instantiate_query_response_and_region_obligations<R>( &self, cause: &ObligationCause<'tcx>, param_env: ParamEnv<'tcx>, original_values: &OriginalQueryValues<'tcx>, query_response: &Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, R>>, ) -> Result<InferOk<'tcx, R>, TypeError<TyCtxt<'tcx>>>
Given the (canonicalized) result to a canonical query, instantiates the result so it can be used, plugging in the values from the canonical query. (Note that the result may have been ambiguous; you should check the certainty level of the query before applying this function.)
To get a good understanding of what is happening here, check out the chapter in the rustc dev guide.
sourcepub fn instantiate_nll_query_response_and_region_obligations<R>(
&self,
cause: &ObligationCause<'tcx>,
param_env: ParamEnv<'tcx>,
original_values: &OriginalQueryValues<'tcx>,
query_response: &Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, R>>,
output_query_region_constraints: &mut QueryRegionConstraints<'tcx>,
) -> Result<InferOk<'tcx, R>, TypeError<TyCtxt<'tcx>>>
pub fn instantiate_nll_query_response_and_region_obligations<R>( &self, cause: &ObligationCause<'tcx>, param_env: ParamEnv<'tcx>, original_values: &OriginalQueryValues<'tcx>, query_response: &Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, R>>, output_query_region_constraints: &mut QueryRegionConstraints<'tcx>, ) -> Result<InferOk<'tcx, R>, TypeError<TyCtxt<'tcx>>>
An alternative to
instantiate_query_response_and_region_obligations
that is more
efficient for NLL. NLL is a bit more advanced in the
“transition to chalk” than the rest of the compiler. During
the NLL type check, all of the “processing” of types and
things happens in queries – the NLL checker itself is only
interested in the region obligations ('a: 'b
or T: 'b
)
that come out of these queries, which it wants to convert into
MIR-based constraints and solve. Therefore, it is most
convenient for the NLL Type Checker to directly consume
the QueryOutlivesConstraint
values that arise from doing a
query. This is contrast to other parts of the compiler, which
would prefer for those QueryOutlivesConstraint
to be converted
into the older infcx-style constraints (e.g., calls to
sub_regions
or register_region_obligation
).
Therefore, instantiate_nll_query_response_and_region_obligations
performs the same
basic operations as instantiate_query_response_and_region_obligations
but
it returns its result differently:
- It creates an instantiation
S
that maps from the original query variables to the values computed in the query result. If any errors arise, they are propagated back as anErr
result. - In the case of a successful instantiation, we will append
QueryOutlivesConstraint
values onto theoutput_query_region_constraints
vector for the solver to use (if an error arises, some values may also be pushed, but they should be ignored). - It can happen (though it rarely does currently) that equating types and things will give rise to subobligations that must be processed. In this case, those subobligations are propagated back in the return value.
- Finally, the query result (of type
R
) is propagated back, after applying the instantiationS
.
pub fn query_outlives_constraint_to_obligation( &self, _: (OutlivesPredicate<TyCtxt<'tcx>, GenericArg<'tcx>>, ConstraintCategory<'tcx>), cause: ObligationCause<'tcx>, param_env: ParamEnv<'tcx>, ) -> Obligation<'tcx, Predicate<'tcx>>
sourcepub fn instantiate_canonical<T>(
&self,
span: Span,
canonical: &Canonical<TyCtxt<'tcx>, T>,
) -> (T, CanonicalVarValues<TyCtxt<'tcx>>)where
T: TypeFoldable<TyCtxt<'tcx>>,
pub fn instantiate_canonical<T>(
&self,
span: Span,
canonical: &Canonical<TyCtxt<'tcx>, T>,
) -> (T, CanonicalVarValues<TyCtxt<'tcx>>)where
T: TypeFoldable<TyCtxt<'tcx>>,
Creates an instantiation S for the canonical value with fresh inference variables and placeholders then applies it to the canonical value. Returns both the instantiated result and the instantiation S.
This can be invoked as part of constructing an
inference context at the start of a query (see
InferCtxtBuilder::build_with_canonical
). It basically
brings the canonical value “into scope” within your new infcx.
At the end of processing, the instantiation S (once canonicalized) then represents the values that you computed for each of the canonical inputs to your query.
sourcepub fn instantiate_canonical_var(
&self,
span: Span,
cv_info: CanonicalVarInfo<TyCtxt<'tcx>>,
universe_map: impl Fn(UniverseIndex) -> UniverseIndex,
) -> GenericArg<'tcx>
pub fn instantiate_canonical_var( &self, span: Span, cv_info: CanonicalVarInfo<TyCtxt<'tcx>>, universe_map: impl Fn(UniverseIndex) -> UniverseIndex, ) -> GenericArg<'tcx>
Given the “info” about a canonical variable, creates a fresh variable for it. If this is an existentially quantified variable, then you’ll get a new inference variable; if it is a universally quantified variable, you get a placeholder.
FIXME(-Znext-solver): This is public because it’s used by the new trait solver which has a different canonicalization routine. We should somehow deduplicate all of this.
sourcepub fn replace_opaque_types_with_inference_vars<T>(
&self,
value: T,
body_id: LocalDefId,
span: Span,
param_env: ParamEnv<'tcx>,
) -> InferOk<'tcx, T>where
T: TypeFoldable<TyCtxt<'tcx>>,
pub fn replace_opaque_types_with_inference_vars<T>(
&self,
value: T,
body_id: LocalDefId,
span: Span,
param_env: ParamEnv<'tcx>,
) -> InferOk<'tcx, T>where
T: TypeFoldable<TyCtxt<'tcx>>,
This is a backwards compatibility hack to prevent breaking changes from lazy TAIT around RPIT handling.
pub fn handle_opaque_type( &self, a: Ty<'tcx>, b: Ty<'tcx>, span: Span, param_env: ParamEnv<'tcx>, ) -> Result<Vec<Goal<TyCtxt<'tcx>, Predicate<'tcx>>>, TypeError<TyCtxt<'tcx>>>
sourcepub fn register_member_constraints(
&self,
opaque_type_key: OpaqueTypeKey<TyCtxt<'tcx>>,
concrete_ty: Ty<'tcx>,
span: Span,
)
pub fn register_member_constraints( &self, opaque_type_key: OpaqueTypeKey<TyCtxt<'tcx>>, concrete_ty: Ty<'tcx>, span: Span, )
Given the map opaque_types
containing the opaque
impl Trait
types whose underlying, hidden types are being
inferred, this method adds constraints to the regions
appearing in those underlying hidden types to ensure that they
at least do not refer to random scopes within the current
function. These constraints are not (quite) sufficient to
guarantee that the regions are actually legal values; that
final condition is imposed after region inference is done.
§The Problem
Let’s work through an example to explain how it works. Assume the current function is as follows:
fn foo<'a, 'b>(..) -> (impl Bar<'a>, impl Bar<'b>)
Here, we have two impl Trait
types whose values are being
inferred (the impl Bar<'a>
and the impl Bar<'b>
). Conceptually, this is sugar for a setup where we
define underlying opaque types (Foo1
, Foo2
) and then, in
the return type of foo
, we reference those definitions:
type Foo1<'x> = impl Bar<'x>;
type Foo2<'x> = impl Bar<'x>;
fn foo<'a, 'b>(..) -> (Foo1<'a>, Foo2<'b>) { .. }
// ^^^^ ^^
// | |
// | args
// def_id
As indicating in the comments above, each of those references
is (in the compiler) basically generic parameters (args
)
applied to the type of a suitable def_id
(which identifies
Foo1
or Foo2
).
Now, at this point in compilation, what we have done is to
replace each of the references (Foo1<'a>
, Foo2<'b>
) with
fresh inference variables C1 and C2. We wish to use the values
of these variables to infer the underlying types of Foo1
and
Foo2
. That is, this gives rise to higher-order (pattern) unification
constraints like:
for<'a> (Foo1<'a> = C1)
for<'b> (Foo1<'b> = C2)
For these equation to be satisfiable, the types C1
and C2
can only refer to a limited set of regions. For example, C1
can only refer to 'static
and 'a
, and C2
can only refer
to 'static
and 'b
. The job of this function is to impose that
constraint.
Up to this point, C1 and C2 are basically just random type
inference variables, and hence they may contain arbitrary
regions. In fact, it is fairly likely that they do! Consider
this possible definition of foo
:
fn foo<'a, 'b>(x: &'a i32, y: &'b i32) -> (impl Bar<'a>, impl Bar<'b>) {
(&*x, &*y)
}
Here, the values for the concrete types of the two impl traits will include inference variables:
&'0 i32
&'1 i32
Ordinarily, the subtyping rules would ensure that these are
sufficiently large. But since impl Bar<'a>
isn’t a specific
type per se, we don’t get such constraints by default. This
is where this function comes into play. It adds extra
constraints to ensure that all the regions which appear in the
inferred type are regions that could validly appear.
This is actually a bit of a tricky constraint in general. We
want to say that each variable (e.g., '0
) can only take on
values that were supplied as arguments to the opaque type
(e.g., 'a
for Foo1<'a>
) or 'static
, which is always in
scope. We don’t have a constraint quite of this kind in the current
region checker.
§The Solution
We generally prefer to make <=
constraints, since they
integrate best into the region solver. To do that, we find the
“minimum” of all the arguments that appear in the args: that
is, some region which is less than all the others. In the case
of Foo1<'a>
, that would be 'a
(it’s the only choice, after
all). Then we apply that as a least bound to the variables
(e.g., 'a <= '0
).
In some cases, there is no minimum. Consider this example:
fn baz<'a, 'b>() -> impl Trait<'a, 'b> { ... }
Here we would report a more complex “in constraint”, like 'r in ['a, 'b, 'static]
(where 'r
is some region appearing in
the hidden type).
§Constrain regions, not the hidden concrete type
Note that generating constraints on each region Rc
is not
the same as generating an outlives constraint on Tc
itself.
For example, if we had a function like this:
fn foo<'a, T>(x: &'a u32, y: T) -> impl Foo<'a> {
(x, y)
}
// Equivalent to:
type FooReturn<'a, T> = impl Foo<'a>;
fn foo<'a, T>(x: &'a u32, y: T) -> FooReturn<'a, T> {
(x, y)
}
then the hidden type Tc
would be (&'0 u32, T)
(where '0
is an inference variable). If we generated a constraint that
Tc: 'a
, then this would incorrectly require that T: 'a
–
but this is not necessary, because the opaque type we
create will be allowed to reference T
. So we only generate a
constraint that '0: 'a
.
Insert a hidden type into the opaque type storage, making sure it hasn’t previously been defined. This does not emit any constraints and it’s the responsibility of the caller to make sure that the item bounds of the opaque are checked.
Insert a hidden type into the opaque type storage, equating it with any previous entries if necessary.
This does not add the item bounds of the opaque as nested obligations. That is only necessary when normalizing the opaque itself, not when getting the opaque type constraints from somewhere else.
sourcepub fn register_region_obligation(&self, obligation: RegionObligation<'tcx>)
pub fn register_region_obligation(&self, obligation: RegionObligation<'tcx>)
Registers that the given region obligation must be resolved
from within the scope of body_id
. These regions are enqueued
and later processed by regionck, when full type information is
available (see region_obligations
field for more
information).
pub fn register_region_obligation_with_cause( &self, sup_type: Ty<'tcx>, sub_region: Region<'tcx>, cause: &ObligationCause<'tcx>, )
sourcepub fn take_registered_region_obligations(&self) -> Vec<RegionObligation<'tcx>>
pub fn take_registered_region_obligations(&self) -> Vec<RegionObligation<'tcx>>
Trait queries just want to pass back type obligations “as is”
sourcepub fn process_registered_region_obligations(
&self,
outlives_env: &OutlivesEnvironment<'tcx>,
deeply_normalize_ty: impl FnMut(Binder<TyCtxt<'tcx>, OutlivesPredicate<TyCtxt<'tcx>, Ty<'tcx>>>, SubregionOrigin<'tcx>) -> Result<Binder<TyCtxt<'tcx>, OutlivesPredicate<TyCtxt<'tcx>, Ty<'tcx>>>, NoSolution>,
) -> Result<(), (Binder<TyCtxt<'tcx>, OutlivesPredicate<TyCtxt<'tcx>, Ty<'tcx>>>, SubregionOrigin<'tcx>)>
pub fn process_registered_region_obligations( &self, outlives_env: &OutlivesEnvironment<'tcx>, deeply_normalize_ty: impl FnMut(Binder<TyCtxt<'tcx>, OutlivesPredicate<TyCtxt<'tcx>, Ty<'tcx>>>, SubregionOrigin<'tcx>) -> Result<Binder<TyCtxt<'tcx>, OutlivesPredicate<TyCtxt<'tcx>, Ty<'tcx>>>, NoSolution>, ) -> Result<(), (Binder<TyCtxt<'tcx>, OutlivesPredicate<TyCtxt<'tcx>, Ty<'tcx>>>, SubregionOrigin<'tcx>)>
Process the region obligations that must be proven (during
regionck
) for the given body_id
, given information about
the region bounds in scope and so forth.
See the region_obligations
field of InferCtxt
for some
comments about how this function fits into the overall expected
flow of the inferencer. The key point is that it is
invoked after all type-inference variables have been bound –
right before lexical region resolution.
sourcepub fn resolve_regions_with_normalize(
&self,
outlives_env: &OutlivesEnvironment<'tcx>,
deeply_normalize_ty: impl Fn(Binder<TyCtxt<'tcx>, OutlivesPredicate<TyCtxt<'tcx>, Ty<'tcx>>>, SubregionOrigin<'tcx>) -> Result<Binder<TyCtxt<'tcx>, OutlivesPredicate<TyCtxt<'tcx>, Ty<'tcx>>>, NoSolution>,
) -> Vec<RegionResolutionError<'tcx>>
pub fn resolve_regions_with_normalize( &self, outlives_env: &OutlivesEnvironment<'tcx>, deeply_normalize_ty: impl Fn(Binder<TyCtxt<'tcx>, OutlivesPredicate<TyCtxt<'tcx>, Ty<'tcx>>>, SubregionOrigin<'tcx>) -> Result<Binder<TyCtxt<'tcx>, OutlivesPredicate<TyCtxt<'tcx>, Ty<'tcx>>>, NoSolution>, ) -> Vec<RegionResolutionError<'tcx>>
Process the region constraints and return any errors that
result. After this, no more unification operations should be
done – or the compiler will panic – but it is legal to use
resolve_vars_if_possible
as well as fully_resolve
.
If you are in a crate that has access to rustc_trait_selection
,
then it’s probably better to use resolve_regions
,
which knows how to normalize registered region obligations.
sourcepub fn take_and_reset_region_constraints(&self) -> RegionConstraintData<'tcx>
pub fn take_and_reset_region_constraints(&self) -> RegionConstraintData<'tcx>
Obtains (and clears) the current set of region constraints. The inference context is still usable: further unifications will simply add new constraints.
This method is not meant to be used with normal lexical region resolution. Rather, it is used in the NLL mode as a kind of interim hack: basically we run normal type-check and generate region constraints as normal, but then we take them and translate them into the form that the NLL solver understands. See the NLL module for mode details.
sourcepub fn with_region_constraints<R>(
&self,
op: impl FnOnce(&RegionConstraintData<'tcx>) -> R,
) -> R
pub fn with_region_constraints<R>( &self, op: impl FnOnce(&RegionConstraintData<'tcx>) -> R, ) -> R
Gives temporary access to the region constraint data.
sourcepub fn projection_ty_to_infer(
&self,
param_env: ParamEnv<'tcx>,
projection_ty: AliasTy<TyCtxt<'tcx>>,
cause: ObligationCause<'tcx>,
recursion_depth: usize,
obligations: &mut Vec<Obligation<'tcx, Predicate<'tcx>>>,
) -> Ty<'tcx>
pub fn projection_ty_to_infer( &self, param_env: ParamEnv<'tcx>, projection_ty: AliasTy<TyCtxt<'tcx>>, cause: ObligationCause<'tcx>, recursion_depth: usize, obligations: &mut Vec<Obligation<'tcx, Predicate<'tcx>>>, ) -> Ty<'tcx>
Instead of normalizing an associated type projection, this function generates an inference variable and registers an obligation that this inference variable must be the result of the given projection. This allows us to proceed with projections while they cannot be resolved yet due to missing information or simply due to the lack of access to the trait resolution machinery.
pub fn super_combine_tys<R>(
&self,
relation: &mut R,
a: Ty<'tcx>,
b: Ty<'tcx>,
) -> Result<Ty<'tcx>, TypeError<TyCtxt<'tcx>>>where
R: PredicateEmittingRelation<InferCtxt<'tcx>>,
pub fn super_combine_consts<R>(
&self,
relation: &mut R,
a: Const<'tcx>,
b: Const<'tcx>,
) -> Result<Const<'tcx>, TypeError<TyCtxt<'tcx>>>where
R: PredicateEmittingRelation<InferCtxt<'tcx>>,
sourcepub fn instantiate_ty_var<R>(
&self,
relation: &mut R,
target_is_expected: bool,
target_vid: TyVid,
instantiation_variance: Variance,
source_ty: Ty<'tcx>,
) -> Result<(), TypeError<TyCtxt<'tcx>>>where
R: PredicateEmittingRelation<InferCtxt<'tcx>>,
pub fn instantiate_ty_var<R>(
&self,
relation: &mut R,
target_is_expected: bool,
target_vid: TyVid,
instantiation_variance: Variance,
source_ty: Ty<'tcx>,
) -> Result<(), TypeError<TyCtxt<'tcx>>>where
R: PredicateEmittingRelation<InferCtxt<'tcx>>,
The idea is that we should ensure that the type variable target_vid
is equal to, a subtype of, or a supertype of source_ty
.
For this, we will instantiate target_vid
with a generalized version
of source_ty
. Generalization introduces other inference variables wherever
subtyping could occur. This also does the occurs checks, detecting whether
instantiating target_vid
would result in a cyclic type. We eagerly error
in this case.
This is not expected to be used anywhere except for an implementation of
TypeRelation
. Do not use this, and instead please use At::eq
, for all
other usecases (i.e. setting the value of a type var).
sourcepub fn enter_forall_and_leak_universe<T>(
&self,
binder: Binder<TyCtxt<'tcx>, T>,
) -> T
pub fn enter_forall_and_leak_universe<T>( &self, binder: Binder<TyCtxt<'tcx>, T>, ) -> T
Replaces all bound variables (lifetimes, types, and constants) bound by
binder
with placeholder variables in a new universe. This means that the
new placeholders can only be named by inference variables created after
this method has been called.
This is the first step of checking subtyping when higher-ranked things are involved. For more details visit the relevant sections of the rustc dev guide.
fn enter_forall
should be preferred over this method.
sourcepub fn enter_forall<T, U>(
&self,
forall: Binder<TyCtxt<'tcx>, T>,
f: impl FnOnce(T) -> U,
) -> U
pub fn enter_forall<T, U>( &self, forall: Binder<TyCtxt<'tcx>, T>, f: impl FnOnce(T) -> U, ) -> U
Replaces all bound variables (lifetimes, types, and constants) bound by
binder
with placeholder variables in a new universe and then calls the
closure f
with the instantiated value. The new placeholders can only be
named by inference variables created inside of the closure f
or afterwards.
This is the first step of checking subtyping when higher-ranked things are involved. For more details visit the relevant sections of the rustc dev guide.
This method should be preferred over fn enter_forall_and_leak_universe
.
sourcepub fn leak_check(
&self,
outer_universe: UniverseIndex,
only_consider_snapshot: Option<&CombinedSnapshot<'tcx>>,
) -> Result<(), TypeError<TyCtxt<'tcx>>>
pub fn leak_check( &self, outer_universe: UniverseIndex, only_consider_snapshot: Option<&CombinedSnapshot<'tcx>>, ) -> Result<(), TypeError<TyCtxt<'tcx>>>
See RegionConstraintCollector::leak_check. We only check placeholder
leaking into outer_universe
, i.e. placeholders which cannot be named by that
universe.
sourcepub fn fudge_inference_if_ok<T, E, F>(&self, f: F) -> Result<T, E>
pub fn fudge_inference_if_ok<T, E, F>(&self, f: F) -> Result<T, E>
This rather funky routine is used while processing expected
types. What happens here is that we want to propagate a
coercion through the return type of a fn to its
argument. Consider the type of Option::Some
, which is
basically for<T> fn(T) -> Option<T>
. So if we have an
expression Some(&[1, 2, 3])
, and that has the expected type
Option<&[u32]>
, we would like to type check &[1, 2, 3]
with the expectation of &[u32]
. This will cause us to coerce
from &[u32; 3]
to &[u32]
and make the users life more
pleasant.
The way we do this is using fudge_inference_if_ok
. What the
routine actually does is to start a snapshot and execute the
closure f
. In our example above, what this closure will do
is to unify the expectation (Option<&[u32]>
) with the actual
return type (Option<?T>
, where ?T
represents the variable
instantiated for T
). This will cause ?T
to be unified
with &?a [u32]
, where ?a
is a fresh lifetime variable. The
input type (?T
) is then returned by f()
.
At this point, fudge_inference_if_ok
will normalize all type
variables, converting ?T
to &?a [u32]
and end the
snapshot. The problem is that we can’t just return this type
out, because it references the region variable ?a
, and that
region variable was popped when we popped the snapshot.
So what we do is to keep a list (region_vars
, in the code below)
of region variables created during the snapshot (here, ?a
). We
fold the return value and replace any such regions with a new
region variable (e.g., ?b
) and return the result (&?b [u32]
).
This can then be used as the expectation for the fn argument.
The important point here is that, for soundness purposes, the
regions in question are not particularly important. We will
use the expected types to guide coercions, but we will still
type-check the resulting types from those coercions against
the actual types (?T
, Option<?T>
) – and remember that
after the snapshot is popped, the variable ?T
is no longer
unified.
pub fn in_snapshot(&self) -> bool
pub fn num_open_snapshots(&self) -> usize
sourcepub fn commit_if_ok<T, E, F>(&self, f: F) -> Result<T, E>
pub fn commit_if_ok<T, E, F>(&self, f: F) -> Result<T, E>
Execute f
and commit the bindings if closure f
returns Ok(_)
.
sourcepub fn probe<R, F>(&self, f: F) -> Rwhere
F: FnOnce(&CombinedSnapshot<'tcx>) -> R,
pub fn probe<R, F>(&self, f: F) -> Rwhere
F: FnOnce(&CombinedSnapshot<'tcx>) -> R,
Execute f
then unroll any bindings it creates.
sourcepub fn region_constraints_added_in_snapshot(
&self,
snapshot: &CombinedSnapshot<'tcx>,
) -> bool
pub fn region_constraints_added_in_snapshot( &self, snapshot: &CombinedSnapshot<'tcx>, ) -> bool
Scan the constraints produced since snapshot
and check whether
we added any region constraints.
pub fn opaque_types_added_in_snapshot( &self, snapshot: &CombinedSnapshot<'tcx>, ) -> bool
pub fn dcx(&self) -> DiagCtxtHandle<'_>
pub fn defining_opaque_types(&self) -> &'tcx RawList<(), LocalDefId>
pub fn next_trait_solver(&self) -> bool
pub fn freshen<T>(&self, t: T) -> Twhere
T: TypeFoldable<TyCtxt<'tcx>>,
sourcepub fn type_var_origin(&self, vid: TyVid) -> TypeVariableOrigin
pub fn type_var_origin(&self, vid: TyVid) -> TypeVariableOrigin
Returns the origin of the type variable identified by vid
.
No attempt is made to resolve vid
to its root variable.
sourcepub fn const_var_origin(&self, vid: ConstVid) -> Option<ConstVariableOrigin>
pub fn const_var_origin(&self, vid: ConstVid) -> Option<ConstVariableOrigin>
Returns the origin of the const variable identified by vid
pub fn freshener<'b>(&'b self) -> TypeFreshener<'b, 'tcx>
pub fn unresolved_variables(&self) -> Vec<Ty<'tcx>>
pub fn unsolved_effects(&self) -> Vec<Const<'tcx>>
pub fn sub_regions( &self, origin: SubregionOrigin<'tcx>, a: Region<'tcx>, b: Region<'tcx>, )
sourcepub fn member_constraint(
&self,
key: OpaqueTypeKey<TyCtxt<'tcx>>,
definition_span: Span,
hidden_ty: Ty<'tcx>,
region: Region<'tcx>,
in_regions: &Arc<Vec<Region<'tcx>>>,
)
pub fn member_constraint( &self, key: OpaqueTypeKey<TyCtxt<'tcx>>, definition_span: Span, hidden_ty: Ty<'tcx>, region: Region<'tcx>, in_regions: &Arc<Vec<Region<'tcx>>>, )
Require that the region r
be equal to one of the regions in
the set regions
.
sourcepub fn coerce_predicate(
&self,
cause: &ObligationCause<'tcx>,
param_env: ParamEnv<'tcx>,
predicate: Binder<TyCtxt<'tcx>, CoercePredicate<TyCtxt<'tcx>>>,
) -> Result<Result<InferOk<'tcx, ()>, TypeError<TyCtxt<'tcx>>>, (TyVid, TyVid)>
pub fn coerce_predicate( &self, cause: &ObligationCause<'tcx>, param_env: ParamEnv<'tcx>, predicate: Binder<TyCtxt<'tcx>, CoercePredicate<TyCtxt<'tcx>>>, ) -> Result<Result<InferOk<'tcx, ()>, TypeError<TyCtxt<'tcx>>>, (TyVid, TyVid)>
Processes a Coerce
predicate from the fulfillment context.
This is NOT the preferred way to handle coercion, which is to
invoke FnCtxt::coerce
or a similar method (see coercion.rs
).
This method here is actually a fallback that winds up being
invoked when FnCtxt::coerce
encounters unresolved type variables
and records a coercion predicate. Presently, this method is equivalent
to subtype_predicate
– that is, “coercing” a
to b
winds up
actually requiring a <: b
. This is of course a valid coercion,
but it’s not as flexible as FnCtxt::coerce
would be.
(We may refactor this in the future, but there are a number of
practical obstacles. Among other things, FnCtxt::coerce
presently
records adjustments that are required on the HIR in order to perform
the coercion, and we don’t currently have a way to manage that.)
pub fn subtype_predicate( &self, cause: &ObligationCause<'tcx>, param_env: ParamEnv<'tcx>, predicate: Binder<TyCtxt<'tcx>, SubtypePredicate<TyCtxt<'tcx>>>, ) -> Result<Result<InferOk<'tcx, ()>, TypeError<TyCtxt<'tcx>>>, (TyVid, TyVid)>
pub fn region_outlives_predicate( &self, cause: &ObligationCause<'tcx>, predicate: Binder<TyCtxt<'tcx>, OutlivesPredicate<TyCtxt<'tcx>, Region<'tcx>>>, )
sourcepub fn num_ty_vars(&self) -> usize
pub fn num_ty_vars(&self) -> usize
Number of type variables created so far.
pub fn next_ty_var(&self, span: Span) -> Ty<'tcx>
pub fn next_ty_var_with_origin(&self, origin: TypeVariableOrigin) -> Ty<'tcx>
pub fn next_ty_var_id_in_universe( &self, span: Span, universe: UniverseIndex, ) -> TyVid
pub fn next_ty_var_in_universe( &self, span: Span, universe: UniverseIndex, ) -> Ty<'tcx>
pub fn next_const_var(&self, span: Span) -> Const<'tcx>
pub fn next_const_var_with_origin( &self, origin: ConstVariableOrigin, ) -> Const<'tcx>
pub fn next_const_var_in_universe( &self, span: Span, universe: UniverseIndex, ) -> Const<'tcx>
pub fn next_const_var_id(&self, origin: ConstVariableOrigin) -> ConstVid
pub fn next_int_var(&self) -> Ty<'tcx>
pub fn next_float_var(&self) -> Ty<'tcx>
sourcepub fn next_region_var(&self, origin: RegionVariableOrigin) -> Region<'tcx>
pub fn next_region_var(&self, origin: RegionVariableOrigin) -> Region<'tcx>
Creates a fresh region variable with the next available index. The variable will be created in the maximum universe created thus far, allowing it to name any region created thus far.
sourcepub fn next_region_var_in_universe(
&self,
origin: RegionVariableOrigin,
universe: UniverseIndex,
) -> Region<'tcx>
pub fn next_region_var_in_universe( &self, origin: RegionVariableOrigin, universe: UniverseIndex, ) -> Region<'tcx>
Creates a fresh region variable with the next available index
in the given universe; typically, you can use
next_region_var
and just use the maximal universe.
sourcepub fn universe_of_region(&self, r: Region<'tcx>) -> UniverseIndex
pub fn universe_of_region(&self, r: Region<'tcx>) -> UniverseIndex
Return the universe that the region r
was created in. For
most regions (e.g., 'static
, named regions from the user,
etc) this is the root universe U0. For inference variables or
placeholders, however, it will return the universe which they
are associated.
sourcepub fn num_region_vars(&self) -> usize
pub fn num_region_vars(&self) -> usize
Number of region variables created so far.
sourcepub fn next_nll_region_var(
&self,
origin: NllRegionVariableOrigin,
) -> Region<'tcx>
pub fn next_nll_region_var( &self, origin: NllRegionVariableOrigin, ) -> Region<'tcx>
Just a convenient wrapper of next_region_var
for using during NLL.
sourcepub fn next_nll_region_var_in_universe(
&self,
origin: NllRegionVariableOrigin,
universe: UniverseIndex,
) -> Region<'tcx>
pub fn next_nll_region_var_in_universe( &self, origin: NllRegionVariableOrigin, universe: UniverseIndex, ) -> Region<'tcx>
Just a convenient wrapper of next_region_var
for using during NLL.
pub fn var_for_def( &self, span: Span, param: &GenericParamDef, ) -> GenericArg<'tcx>
pub fn var_for_effect(&self, param: &GenericParamDef) -> GenericArg<'tcx>
sourcepub fn fresh_args_for_item(
&self,
span: Span,
def_id: DefId,
) -> &'tcx RawList<(), GenericArg<'tcx>>
pub fn fresh_args_for_item( &self, span: Span, def_id: DefId, ) -> &'tcx RawList<(), GenericArg<'tcx>>
Given a set of generics defined on a type or impl, returns the generic parameters mapping each type/region parameter to a fresh inference variable.
sourcepub fn tainted_by_errors(&self) -> Option<ErrorGuaranteed>
pub fn tainted_by_errors(&self) -> Option<ErrorGuaranteed>
Returns true
if errors have been reported since this infcx was
created. This is sometimes used as a heuristic to skip
reporting errors that often occur as a result of earlier
errors, but where it’s hard to be 100% sure (e.g., unresolved
inference variables, regionck errors).
sourcepub fn set_tainted_by_errors(&self, e: ErrorGuaranteed)
pub fn set_tainted_by_errors(&self, e: ErrorGuaranteed)
Set the “tainted by errors” flag to true. We call this when we observe an error from a prior pass.
pub fn region_var_origin(&self, vid: RegionVid) -> RegionVariableOrigin
sourcepub fn get_region_var_origins(&self) -> IndexVec<RegionVid, RegionVariableInfo>
pub fn get_region_var_origins(&self) -> IndexVec<RegionVid, RegionVariableInfo>
Clone the list of variable regions. This is used only during NLL processing to put the set of region variables into the NLL region context.
pub fn take_opaque_types( &self, ) -> IndexMap<OpaqueTypeKey<TyCtxt<'tcx>>, OpaqueTypeDecl<'tcx>, BuildHasherDefault<FxHasher>>
pub fn clone_opaque_types( &self, ) -> IndexMap<OpaqueTypeKey<TyCtxt<'tcx>>, OpaqueTypeDecl<'tcx>, BuildHasherDefault<FxHasher>>
pub fn can_define_opaque_ty(&self, id: impl Into<DefId>) -> bool
pub fn ty_to_string(&self, t: Ty<'tcx>) -> String
sourcepub fn probe_ty_var(&self, vid: TyVid) -> Result<Ty<'tcx>, UniverseIndex>
pub fn probe_ty_var(&self, vid: TyVid) -> Result<Ty<'tcx>, UniverseIndex>
If TyVar(vid)
resolves to a type, return that type. Else, return the
universe index of TyVar(vid)
.
pub fn shallow_resolve(&self, ty: Ty<'tcx>) -> Ty<'tcx>
pub fn shallow_resolve_const(&self, ct: Const<'tcx>) -> Const<'tcx>
pub fn root_var(&self, var: TyVid) -> TyVid
pub fn root_const_var(&self, var: ConstVid) -> ConstVid
pub fn root_effect_var(&self, var: EffectVid) -> EffectVid
sourcepub fn opportunistic_resolve_int_var(&self, vid: IntVid) -> Ty<'tcx>
pub fn opportunistic_resolve_int_var(&self, vid: IntVid) -> Ty<'tcx>
Resolves an int var to a rigid int type, if it was constrained to one, or else the root int var in the unification table.
sourcepub fn opportunistic_resolve_float_var(&self, vid: FloatVid) -> Ty<'tcx>
pub fn opportunistic_resolve_float_var(&self, vid: FloatVid) -> Ty<'tcx>
Resolves a float var to a rigid int type, if it was constrained to one, or else the root float var in the unification table.
sourcepub fn resolve_vars_if_possible<T>(&self, value: T) -> Twhere
T: TypeFoldable<TyCtxt<'tcx>>,
pub fn resolve_vars_if_possible<T>(&self, value: T) -> Twhere
T: TypeFoldable<TyCtxt<'tcx>>,
Where possible, replaces type/const variables in
value
with their final value. Note that region variables
are unaffected. If a type/const variable has not been unified, it
is left as is. This is an idempotent operation that does
not affect inference state in any way and so you can do it
at will.
pub fn resolve_numeric_literals_with_default<T>(&self, value: T) -> Twhere
T: TypeFoldable<TyCtxt<'tcx>>,
pub fn probe_const_var( &self, vid: ConstVid, ) -> Result<Const<'tcx>, UniverseIndex>
pub fn probe_effect_var(&self, vid: EffectVid) -> Option<Const<'tcx>>
sourcepub fn fully_resolve<T>(&self, value: T) -> Result<T, FixupError>where
T: TypeFoldable<TyCtxt<'tcx>>,
pub fn fully_resolve<T>(&self, value: T) -> Result<T, FixupError>where
T: TypeFoldable<TyCtxt<'tcx>>,
Attempts to resolve all type/region/const variables in
value
. Region inference must have been run already (e.g.,
by calling resolve_regions_and_report_errors
). If some
variable was never unified, an Err
results.
This method is idempotent, but it not typically not invoked except during the writeback phase.
pub fn instantiate_binder_with_fresh_vars<T>( &self, span: Span, lbrct: BoundRegionConversionTime, value: Binder<TyCtxt<'tcx>, T>, ) -> T
sourcepub fn verify_generic_bound(
&self,
origin: SubregionOrigin<'tcx>,
kind: GenericKind<'tcx>,
a: Region<'tcx>,
bound: VerifyBound<'tcx>,
)
pub fn verify_generic_bound( &self, origin: SubregionOrigin<'tcx>, kind: GenericKind<'tcx>, a: Region<'tcx>, bound: VerifyBound<'tcx>, )
sourcepub fn closure_kind(&self, closure_ty: Ty<'tcx>) -> Option<ClosureKind>
pub fn closure_kind(&self, closure_ty: Ty<'tcx>) -> Option<ClosureKind>
Obtains the latest type of the given closure; this may be a
closure in the current function, in which case its
ClosureKind
may not yet be known.
pub fn universe(&self) -> UniverseIndex
sourcepub fn create_next_universe(&self) -> UniverseIndex
pub fn create_next_universe(&self) -> UniverseIndex
Creates and return a fresh universe that extends all previous
universes. Updates self.universe
to that new universe.
pub fn try_const_eval_resolve( &self, param_env: ParamEnv<'tcx>, unevaluated: UnevaluatedConst<TyCtxt<'tcx>>, span: Span, ) -> Result<Const<'tcx>, ErrorHandled>
sourcepub fn const_eval_resolve(
&self,
param_env: ParamEnv<'tcx>,
unevaluated: UnevaluatedConst<TyCtxt<'tcx>>,
span: Span,
) -> Result<Result<ValTree<'tcx>, Ty<'tcx>>, ErrorHandled>
pub fn const_eval_resolve( &self, param_env: ParamEnv<'tcx>, unevaluated: UnevaluatedConst<TyCtxt<'tcx>>, span: Span, ) -> Result<Result<ValTree<'tcx>, Ty<'tcx>>, ErrorHandled>
Resolves and evaluates a constant.
The constant can be located on a trait like <A as B>::C
, in which case the given
generic parameters and environment are used to resolve the constant. Alternatively if the
constant has generic parameters in scope the instantiations are used to evaluate the value of
the constant. For example in fn foo<T>() { let _ = [0; bar::<T>()]; }
the repeat count
constant bar::<T>()
requires a instantiation for T
, if the instantiation for T
is still
too generic for the constant to be evaluated then Err(ErrorHandled::TooGeneric)
is
returned.
This handles inferences variables within both param_env
and args
by
performing the operation on their respective canonical forms.
sourcepub fn is_ty_infer_var_definitely_unchanged<'a>(
&'a self,
) -> impl Fn(TyOrConstInferVar) + Captures<'tcx> + 'a
pub fn is_ty_infer_var_definitely_unchanged<'a>( &'a self, ) -> impl Fn(TyOrConstInferVar) + Captures<'tcx> + 'a
The returned function is used in a fast path. If it returns true
the variable is
unchanged, false
indicates that the status is unknown.
sourcepub fn ty_or_const_infer_var_changed(
&self,
infer_var: TyOrConstInferVar,
) -> bool
pub fn ty_or_const_infer_var_changed( &self, infer_var: TyOrConstInferVar, ) -> bool
ty_or_const_infer_var_changed
is equivalent to one of these two:
shallow_resolve(ty) != ty
(wherety.kind = ty::Infer(_)
)shallow_resolve(ct) != ct
(wherect.kind = ty::ConstKind::Infer(_)
)
However, ty_or_const_infer_var_changed
is more efficient. It’s always
inlined, despite being large, because it has only two call sites that
are extremely hot (both in traits::fulfill
’s checking of stalled_on
inference variables), and it handles both Ty
and ty::Const
without
having to resort to storing full GenericArg
s in stalled_on
.
sourcepub fn attach_obligation_inspector(
&self,
inspector: fn(_: &InferCtxt<'tcx>, _: &Obligation<'tcx, Predicate<'tcx>>, _: Result<Certainty, NoSolution>),
)
pub fn attach_obligation_inspector( &self, inspector: fn(_: &InferCtxt<'tcx>, _: &Obligation<'tcx, Predicate<'tcx>>, _: Result<Certainty, NoSolution>), )
Attach a callback to be invoked on each root obligation evaluated in the new trait solver.
sourcepub fn find_block_span(&self, block: &'tcx Block<'tcx>) -> Span
pub fn find_block_span(&self, block: &'tcx Block<'tcx>) -> Span
Given a hir::Block
, get the span of its last expression or
statement, peeling off any inner blocks.
sourcepub fn find_block_span_from_hir_id(&self, hir_id: HirId) -> Span
pub fn find_block_span_from_hir_id(&self, hir_id: HirId) -> Span
Given a hir::HirId
for a block, get the span of its last expression
or statement, peeling off any inner blocks.
Trait Implementations§
source§impl<'tcx> Deref for SolverDelegate<'tcx>
impl<'tcx> Deref for SolverDelegate<'tcx>
source§impl<'a, 'tcx> From<&'a InferCtxt<'tcx>> for &'a SolverDelegate<'tcx>
impl<'a, 'tcx> From<&'a InferCtxt<'tcx>> for &'a SolverDelegate<'tcx>
source§impl<'tcx> SolverDelegate for SolverDelegate<'tcx>
impl<'tcx> SolverDelegate for SolverDelegate<'tcx>
type Interner = TyCtxt<'tcx>
type Span = Span
fn cx(&self) -> TyCtxt<'tcx>
fn build_with_canonical<V>(
interner: TyCtxt<'tcx>,
solver_mode: SolverMode,
canonical: &Canonical<'tcx, V>,
) -> (Self, V, CanonicalVarValues<'tcx>)where
V: TypeFoldable<TyCtxt<'tcx>>,
fn fresh_var_for_kind_with_span( &self, arg: GenericArg<'tcx>, span: Span, ) -> GenericArg<'tcx>
fn leak_check( &self, max_input_universe: UniverseIndex, ) -> Result<(), NoSolution>
fn try_const_eval_resolve( &self, param_env: ParamEnv<'tcx>, unevaluated: UnevaluatedConst<'tcx>, ) -> Option<Const<'tcx>>
fn well_formed_goals( &self, param_env: ParamEnv<'tcx>, arg: GenericArg<'tcx>, ) -> Option<Vec<Goal<'tcx, Predicate<'tcx>>>>
fn clone_opaque_types_for_query_response( &self, ) -> Vec<(OpaqueTypeKey<'tcx>, Ty<'tcx>)>
fn make_deduplicated_outlives_constraints( &self, ) -> Vec<OutlivesPredicate<'tcx, GenericArg<'tcx>>>
fn instantiate_canonical<V>(
&self,
canonical: Canonical<'tcx, V>,
values: CanonicalVarValues<'tcx>,
) -> Vwhere
V: TypeFoldable<TyCtxt<'tcx>>,
fn instantiate_canonical_var_with_infer( &self, cv_info: CanonicalVarInfo<'tcx>, universe_map: impl Fn(UniverseIndex) -> UniverseIndex, ) -> GenericArg<'tcx>
fn reset_opaque_types(&self)
fn fetch_eligible_assoc_item( &self, param_env: ParamEnv<'tcx>, goal_trait_ref: TraitRef<'tcx>, trait_assoc_def_id: DefId, impl_def_id: DefId, ) -> Result<Option<DefId>, NoSolution>
fn is_transmutable( &self, param_env: ParamEnv<'tcx>, dst: Ty<'tcx>, src: Ty<'tcx>, assume: Const<'tcx>, ) -> Result<Certainty, NoSolution>
Auto Trait Implementations§
impl<'tcx> DynSend for SolverDelegate<'tcx>
impl<'tcx> !DynSync for SolverDelegate<'tcx>
impl<'tcx> !Freeze for SolverDelegate<'tcx>
impl<'tcx> !RefUnwindSafe for SolverDelegate<'tcx>
impl<'tcx> !Send for SolverDelegate<'tcx>
impl<'tcx> !Sync for SolverDelegate<'tcx>
impl<'tcx> Unpin for SolverDelegate<'tcx>
impl<'tcx> !UnwindSafe for SolverDelegate<'tcx>
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
source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
source§impl<T> Filterable for T
impl<T> Filterable for T
source§fn filterable(
self,
filter_name: &'static str,
) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§impl<P> IntoQueryParam<P> for P
impl<P> IntoQueryParam<P> for P
fn into_query_param(self) -> P
source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
source§impl<T> Pointable for T
impl<T> Pointable for T
source§impl<D, I> SolverDelegateEvalExt for Dwhere
D: SolverDelegate<Interner = I>,
I: Interner,
impl<D, I> SolverDelegateEvalExt for Dwhere
D: SolverDelegate<Interner = I>,
I: Interner,
source§fn evaluate_root_goal(
&self,
goal: Goal<I, <I as Interner>::Predicate>,
generate_proof_tree: GenerateProofTree,
) -> (Result<(bool, Certainty), NoSolution>, Option<GoalEvaluation<I>>)
fn evaluate_root_goal( &self, goal: Goal<I, <I as Interner>::Predicate>, generate_proof_tree: GenerateProofTree, ) -> (Result<(bool, Certainty), NoSolution>, Option<GoalEvaluation<I>>)
Evaluates a goal from outside of the trait solver.
Using this while inside of the solver is wrong as it uses a new search graph which would break cycle detection.
fn evaluate_root_goal_raw( &self, goal: Goal<I, <I as Interner>::Predicate>, generate_proof_tree: GenerateProofTree, ) -> (Result<(NestedNormalizationGoals<I>, bool, Certainty), NoSolution>, Option<GoalEvaluation<I>>)
source§impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
source§impl<I, T> UpcastFrom<I, T> for T
impl<I, T> UpcastFrom<I, T> for T
fn upcast_from(from: T, _tcx: I) -> T
source§impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
default fn from_cycle_error( tcx: Tcx, cycle_error: &CycleError, _guar: ErrorGuaranteed, ) -> T
source§impl<T> WithSubscriber for T
impl<T> WithSubscriber for T
source§fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
source§fn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
impl<'a, T> Captures<'a> for Twhere
T: ?Sized,
impl<T> ErasedDestructor for Twhere
T: 'static,
Layout§
Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...)
attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.
Size: 752 bytes