pub struct ObligationCause<'tcx> {
pub span: Span,
pub body_id: LocalDefId,
code: InternedObligationCauseCode<'tcx>,
}
Expand description
The reason why we incurred this obligation; used for error reporting.
Non-misc ObligationCauseCode
s are stored on the heap. This gives the
best trade-off between keeping the type small (which makes copies cheaper)
while not doing too many heap allocations.
We do not want to intern this as there are a lot of obligation causes which only live for a short period of time.
Fields§
§span: Span
§body_id: LocalDefId
The ID of the fn body that triggered this obligation. This is
used for region obligations to determine the precise
environment in which the region obligation should be evaluated
(in particular, closures can add new assumptions). See the
field region_obligations
of the FulfillmentContext
for more
information.
code: InternedObligationCauseCode<'tcx>
Implementations§
Source§impl<'tcx> ObligationCause<'tcx>
impl<'tcx> ObligationCause<'tcx>
pub fn new( span: Span, body_id: LocalDefId, code: ObligationCauseCode<'tcx>, ) -> ObligationCause<'tcx>
pub fn misc(span: Span, body_id: LocalDefId) -> ObligationCause<'tcx>
pub fn dummy() -> ObligationCause<'tcx>
pub fn dummy_with_span(span: Span) -> ObligationCause<'tcx>
pub fn code(&self) -> &ObligationCauseCode<'tcx>
pub fn map_code( &mut self, f: impl FnOnce(InternedObligationCauseCode<'tcx>) -> ObligationCauseCode<'tcx>, )
Sourcepub fn derived_cause(
self,
parent_trait_pred: Binder<TyCtxt<'tcx>, TraitPredicate<TyCtxt<'tcx>>>,
variant: impl FnOnce(DerivedCause<'tcx>) -> ObligationCauseCode<'tcx>,
) -> ObligationCause<'tcx>
pub fn derived_cause( self, parent_trait_pred: Binder<TyCtxt<'tcx>, TraitPredicate<TyCtxt<'tcx>>>, variant: impl FnOnce(DerivedCause<'tcx>) -> ObligationCauseCode<'tcx>, ) -> ObligationCause<'tcx>
Creates a cause for obligations that are derived from
obligation
by a recursive search (e.g., for a builtin
bound, or eventually a auto trait Foo
). If obligation
is itself a derived obligation, this is just a clone, but
otherwise we create a “derived obligation” cause so as to
keep track of the original root obligation for error
reporting.
pub fn to_constraint_category(&self) -> ConstraintCategory<'tcx>
Trait Implementations§
Source§impl<'tcx> Clone for ObligationCause<'tcx>
impl<'tcx> Clone for ObligationCause<'tcx>
Source§fn clone(&self) -> ObligationCause<'tcx>
fn clone(&self) -> ObligationCause<'tcx>
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moreSource§impl<'tcx> Debug for ObligationCause<'tcx>
impl<'tcx> Debug for ObligationCause<'tcx>
Source§impl<'tcx, __D> Decodable<__D> for ObligationCause<'tcx>
impl<'tcx, __D> Decodable<__D> for ObligationCause<'tcx>
fn decode(__decoder: &mut __D) -> ObligationCause<'tcx>
Source§impl<'tcx, __E> Encodable<__E> for ObligationCause<'tcx>
impl<'tcx, __E> Encodable<__E> for ObligationCause<'tcx>
Source§impl Hash for ObligationCause<'_>
impl Hash for ObligationCause<'_>
Source§impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for ObligationCause<'tcx>
impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for ObligationCause<'tcx>
fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher<SipHasher128>, )
Source§impl<'tcx> PartialEq for ObligationCause<'tcx>
impl<'tcx> PartialEq for ObligationCause<'tcx>
Source§impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for ObligationCause<'tcx>
impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for ObligationCause<'tcx>
Source§fn try_fold_with<__F>(
self,
__folder: &mut __F,
) -> Result<ObligationCause<'tcx>, <__F as FallibleTypeFolder<TyCtxt<'tcx>>>::Error>where
__F: FallibleTypeFolder<TyCtxt<'tcx>>,
fn try_fold_with<__F>(
self,
__folder: &mut __F,
) -> Result<ObligationCause<'tcx>, <__F as FallibleTypeFolder<TyCtxt<'tcx>>>::Error>where
__F: FallibleTypeFolder<TyCtxt<'tcx>>,
Source§fn fold_with<F>(self, folder: &mut F) -> Selfwhere
F: TypeFolder<I>,
fn fold_with<F>(self, folder: &mut F) -> Selfwhere
F: TypeFolder<I>,
try_fold_with
for use with infallible
folders. Do not override this method, to ensure coherence with
try_fold_with
.Source§impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for ObligationCause<'tcx>
impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for ObligationCause<'tcx>
Source§fn visit_with<__V>(
&self,
__visitor: &mut __V,
) -> <__V as TypeVisitor<TyCtxt<'tcx>>>::Resultwhere
__V: TypeVisitor<TyCtxt<'tcx>>,
fn visit_with<__V>(
&self,
__visitor: &mut __V,
) -> <__V as TypeVisitor<TyCtxt<'tcx>>>::Resultwhere
__V: TypeVisitor<TyCtxt<'tcx>>,
impl<'tcx> Eq for ObligationCause<'tcx>
impl<'tcx> StructuralPartialEq for ObligationCause<'tcx>
Auto Trait Implementations§
impl<'tcx> DynSend for ObligationCause<'tcx>
impl<'tcx> DynSync for ObligationCause<'tcx>
impl<'tcx> Freeze for ObligationCause<'tcx>
impl<'tcx> !RefUnwindSafe for ObligationCause<'tcx>
impl<'tcx> Send for ObligationCause<'tcx>
impl<'tcx> Sync for ObligationCause<'tcx>
impl<'tcx> Unpin for ObligationCause<'tcx>
impl<'tcx> !UnwindSafe for ObligationCause<'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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
clone_to_uninit
)Source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
Source§impl<Tcx, T> DepNodeParams<Tcx> for T
impl<Tcx, T> DepNodeParams<Tcx> for T
default fn fingerprint_style() -> FingerprintStyle
Source§default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_debug_str(&self, _: Tcx) -> String
Source§default fn recover(_: Tcx, _: &DepNode) -> Option<T>
default fn recover(_: Tcx, _: &DepNode) -> Option<T>
DepNode
,
something which is needed when forcing DepNode
s during red-green
evaluation. The query system will only call this method if
fingerprint_style()
is not FingerprintStyle::Opaque
.
It is always valid to return None
here, in which case incremental
compilation will treat the query as having changed instead of forcing it.Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.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<'tcx, T> IsSuggestable<'tcx> for T
impl<'tcx, T> IsSuggestable<'tcx> for T
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<I, T> TypeVisitableExt<I> for Twhere
I: Interner,
T: TypeVisitable<I>,
impl<I, T> TypeVisitableExt<I> for Twhere
I: Interner,
T: TypeVisitable<I>,
fn has_type_flags(&self, flags: TypeFlags) -> bool
Source§fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
true
if self
has any late-bound regions that are either
bound by binder
or bound by some binder outside of binder
.
If binder
is ty::INNERMOST
, this indicates whether
there are any late-bound regions that appear free.fn error_reported(&self) -> Result<(), <I as Interner>::ErrorGuaranteed>
Source§fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
true
if this type has any regions that escape binder
(and
hence are not bound by it).Source§fn has_escaping_bound_vars(&self) -> bool
fn has_escaping_bound_vars(&self) -> bool
true
if this type has regions that are not a part of the type.
For example, for<'a> fn(&'a i32)
return false
, while fn(&'a i32)
would return true
. The latter can occur when traversing through the
former. Read morefn has_aliases(&self) -> bool
fn has_opaque_types(&self) -> bool
fn has_coroutines(&self) -> bool
fn references_error(&self) -> bool
fn has_non_region_param(&self) -> bool
fn has_infer_regions(&self) -> bool
fn has_infer_types(&self) -> bool
fn has_non_region_infer(&self) -> bool
fn has_infer(&self) -> bool
fn has_placeholders(&self) -> bool
fn has_non_region_placeholders(&self) -> bool
fn has_param(&self) -> bool
Source§fn has_free_regions(&self) -> bool
fn has_free_regions(&self) -> bool
fn has_erased_regions(&self) -> bool
Source§fn has_erasable_regions(&self) -> bool
fn has_erasable_regions(&self) -> bool
Source§fn is_global(&self) -> bool
fn is_global(&self) -> bool
Source§fn has_bound_regions(&self) -> bool
fn has_bound_regions(&self) -> bool
Source§fn has_non_region_bound_vars(&self) -> bool
fn has_non_region_bound_vars(&self) -> bool
Source§fn has_bound_vars(&self) -> bool
fn has_bound_vars(&self) -> bool
Source§fn still_further_specializable(&self) -> bool
fn still_further_specializable(&self) -> bool
impl
specialization.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,
impl<T> MaybeSendSync for T
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: 24 bytes