Enum rustc_middle::mir::terminator::ConstraintCategory
source · [−]pub enum ConstraintCategory<'tcx> {
Show 18 variants
Return(ReturnConstraint),
Yield,
UseAsConst,
UseAsStatic,
TypeAnnotation,
Cast,
ClosureBounds,
CallArgument(Option<Ty<'tcx>>),
CopyBound,
SizedBound,
Assignment,
Usage,
OpaqueType,
ClosureUpvar(Field),
Predicate(Span),
Boring,
BoringNoLocation,
Internal,
}
Expand description
Outlives-constraints can be categorized to determine whether and why they are interesting (for error reporting). Order of variants indicates sort order of the category, thereby influencing diagnostic output.
See also rustc_const_eval::borrow_check::constraints
.
Variants
Return(ReturnConstraint)
Yield
UseAsConst
UseAsStatic
TypeAnnotation
Cast
ClosureBounds
A constraint that came from checking the body of a closure.
We try to get the category that the closure used when reporting this.
CallArgument(Option<Ty<'tcx>>)
Contains the function type if available.
CopyBound
SizedBound
Assignment
Usage
A constraint that came from a usage of a variable (e.g. in an ADT expression
like Foo { field: my_val }
)
OpaqueType
ClosureUpvar(Field)
Predicate(Span)
A constraint from a user-written predicate
with the provided span, written on the item
with the given DefId
Boring
A “boring” constraint (caused by the given location) is one that the user probably doesn’t want to see described in diagnostics, because it is kind of an artifact of the type system setup.
BoringNoLocation
Internal
A constraint that doesn’t correspond to anything the user sees.
Trait Implementations
sourceimpl<'tcx> Clone for ConstraintCategory<'tcx>
impl<'tcx> Clone for ConstraintCategory<'tcx>
sourcefn clone(&self) -> ConstraintCategory<'tcx>
fn clone(&self) -> ConstraintCategory<'tcx>
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresourceimpl<'tcx> Debug for ConstraintCategory<'tcx>
impl<'tcx> Debug for ConstraintCategory<'tcx>
sourceimpl<'tcx, __D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<__D> for ConstraintCategory<'tcx>
impl<'tcx, __D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<__D> for ConstraintCategory<'tcx>
sourceimpl<'tcx, __E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<__E> for ConstraintCategory<'tcx>
impl<'tcx, __E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<__E> for ConstraintCategory<'tcx>
sourceimpl<'tcx> Hash for ConstraintCategory<'tcx>
impl<'tcx> Hash for ConstraintCategory<'tcx>
sourceimpl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for ConstraintCategory<'tcx>
impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for ConstraintCategory<'tcx>
fn hash_stable(
&self,
__hcx: &mut StableHashingContext<'__ctx>,
__hasher: &mut StableHasher
)
sourceimpl<'tcx> Ord for ConstraintCategory<'tcx>
impl<'tcx> Ord for ConstraintCategory<'tcx>
sourcefn cmp(&self, other: &ConstraintCategory<'tcx>) -> Ordering
fn cmp(&self, other: &ConstraintCategory<'tcx>) -> Ordering
1.21.0 · sourcefn max(self, other: Self) -> Self
fn max(self, other: Self) -> Self
1.21.0 · sourcefn min(self, other: Self) -> Self
fn min(self, other: Self) -> Self
1.50.0 · sourcefn clamp(self, min: Self, max: Self) -> Selfwhere
Self: PartialOrd<Self>,
fn clamp(self, min: Self, max: Self) -> Selfwhere
Self: PartialOrd<Self>,
sourceimpl<'tcx> PartialEq<ConstraintCategory<'tcx>> for ConstraintCategory<'tcx>
impl<'tcx> PartialEq<ConstraintCategory<'tcx>> for ConstraintCategory<'tcx>
sourcefn eq(&self, other: &ConstraintCategory<'tcx>) -> bool
fn eq(&self, other: &ConstraintCategory<'tcx>) -> bool
sourceimpl<'tcx> PartialOrd<ConstraintCategory<'tcx>> for ConstraintCategory<'tcx>
impl<'tcx> PartialOrd<ConstraintCategory<'tcx>> for ConstraintCategory<'tcx>
sourcefn partial_cmp(&self, other: &ConstraintCategory<'tcx>) -> Option<Ordering>
fn partial_cmp(&self, other: &ConstraintCategory<'tcx>) -> Option<Ordering>
1.0.0 · sourcefn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
self
and other
) and is used by the <=
operator. Read moreimpl<'tcx> Copy for ConstraintCategory<'tcx>
impl<'tcx> Eq for ConstraintCategory<'tcx>
impl<'tcx> StructuralEq for ConstraintCategory<'tcx>
impl<'tcx> StructuralPartialEq for ConstraintCategory<'tcx>
Auto Trait Implementations
impl<'tcx> !RefUnwindSafe for ConstraintCategory<'tcx>
impl<'tcx> !Send for ConstraintCategory<'tcx>
impl<'tcx> !Sync for ConstraintCategory<'tcx>
impl<'tcx> Unpin for ConstraintCategory<'tcx>
impl<'tcx> !UnwindSafe for ConstraintCategory<'tcx>
Blanket Implementations
sourceimpl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
fn allocate_on(self, arena: &'a Arena<'tcx>) -> &'a mut T
fn allocate_from_iter(
arena: &'a Arena<'tcx>,
iter: impl IntoIterator<Item = T>
) -> &'a mut [T]ⓘNotable traits for &[u8]impl Read for &[u8]impl Write for &mut [u8]
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
sourceimpl<Ctxt, T> DepNodeParams<Ctxt> for Twhere
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
impl<Ctxt, T> DepNodeParams<Ctxt> for Twhere
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
default fn fingerprint_style() -> FingerprintStyle
sourcedefault fn to_fingerprint(&self, tcx: Ctxt) -> Fingerprint
default fn to_fingerprint(&self, tcx: Ctxt) -> Fingerprint
default fn to_debug_str(&self, Ctxt) -> String
sourcedefault fn recover(Ctxt, &DepNode<<Ctxt as DepContext>::DepKind>) -> Option<T>
default fn recover(Ctxt, &DepNode<<Ctxt as DepContext>::DepKind>) -> 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. Read moresourceimpl<T, R> InternIteratorElement<T, R> for T
impl<T, R> InternIteratorElement<T, R> for T
type Output = R
fn intern_with<I, F>(iter: I, f: F) -> <T as InternIteratorElement<T, R>>::Outputwhere
I: Iterator<Item = T>,
F: FnOnce(&[T]) -> R,
sourceimpl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
sourceimpl<CTX, T> Value<CTX> for Twhere
CTX: DepContext,
impl<CTX, T> Value<CTX> for Twhere
CTX: DepContext,
default fn from_cycle_error(tcx: CTX) -> T
impl<'a, T> Captures<'a> for Twhere
T: ?Sized,
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: 16 bytes
Size for each variant:
Return
: 4 bytesYield
: 0 bytesUseAsConst
: 0 bytesUseAsStatic
: 0 bytesTypeAnnotation
: 0 bytesCast
: 0 bytesClosureBounds
: 0 bytesCallArgument
: 12 bytesCopyBound
: 0 bytesSizedBound
: 0 bytesAssignment
: 0 bytesUsage
: 0 bytesOpaqueType
: 0 bytesClosureUpvar
: 4 bytesPredicate
: 8 bytesBoring
: 0 bytesBoringNoLocation
: 0 bytesInternal
: 0 bytes