Enum ClauseKind 

pub enum ClauseKind<I: Interner> {
    Trait(TraitPredicate<I>),
    RegionOutlives(OutlivesPredicate<I, I::Region>),
    TypeOutlives(OutlivesPredicate<I, I::Ty>),
    Projection(ProjectionPredicate<I>),
    ConstArgHasType(I::Const, I::Ty),
    WellFormed(I::Term),
    ConstEvaluatable(I::Const),
    HostEffect(HostEffectPredicate<I>),
    UnstableFeature(I::Symbol),
}

A clause is something that can appear in where bounds or be inferred by implied bounds.

Variants

Trait(TraitPredicate<I>)

Corresponds to where Foo: Bar<A, B, C>. Foo here would be the Self type of the trait reference and A, B, and C would be the type parameters.

RegionOutlives(OutlivesPredicate<I, I::Region>)

where 'a: 'r

TypeOutlives(OutlivesPredicate<I, I::Ty>)

where T: 'r

Projection(ProjectionPredicate<I>)

where <T as TraitRef>::Name == X, approximately. See the ProjectionPredicate struct for details.

ConstArgHasType(I::Const, I::Ty)

Ensures that a const generic argument to a parameter const N: u8 is of type u8.

WellFormed(I::Term)

No syntax: T well-formed.

ConstEvaluatable(I::Const)

Constant initializer must evaluate successfully.

HostEffect(HostEffectPredicate<I>)

Enforces the constness of the predicate we’re calling. Like a projection goal from a where clause, it’s always going to be paired with a corresponding trait clause; this just enforces the constness of that implementation.

UnstableFeature(I::Symbol)

Support marking impl as unstable.

Trait Implementations

impl<I> Clone for ClauseKind<I>

where I: Interner,

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<I: Interner> Debug for ClauseKind<I>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<I: Interner, __D: Decoder> Decodable<__D> for ClauseKind<I>

where TraitPredicate<I>: Decodable<__D>, OutlivesPredicate<I, I::Region>: Decodable<__D>, OutlivesPredicate<I, I::Ty>: Decodable<__D>, ProjectionPredicate<I>: Decodable<__D>, I::Const: Decodable<__D>, I::Ty: Decodable<__D>, I::Term: Decodable<__D>, HostEffectPredicate<I>: Decodable<__D>, I::Symbol: Decodable<__D>,

fn decode(__decoder: &mut __D) -> Self

impl<I: Interner, __E: Encoder> Encodable<__E> for ClauseKind<I>

where TraitPredicate<I>: Encodable<__E>, OutlivesPredicate<I, I::Region>: Encodable<__E>, OutlivesPredicate<I, I::Ty>: Encodable<__E>, ProjectionPredicate<I>: Encodable<__E>, I::Const: Encodable<__E>, I::Ty: Encodable<__E>, I::Term: Encodable<__E>, HostEffectPredicate<I>: Encodable<__E>, I::Symbol: Encodable<__E>,

fn encode(&self, __encoder: &mut __E)

impl<I> Hash for ClauseKind<I>

where I: Interner,

fn hash<__H: Hasher>(&self, __state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<I: Interner, __CTX> HashStable<__CTX> for ClauseKind<I>

where TraitPredicate<I>: HashStable<__CTX>, OutlivesPredicate<I, I::Region>: HashStable<__CTX>, OutlivesPredicate<I, I::Ty>: HashStable<__CTX>, ProjectionPredicate<I>: HashStable<__CTX>, I::Const: HashStable<__CTX>, I::Ty: HashStable<__CTX>, I::Term: HashStable<__CTX>, HostEffectPredicate<I>: HashStable<__CTX>, I::Symbol: HashStable<__CTX>,

fn hash_stable(&self, __hcx: &mut __CTX, __hasher: &mut StableHasher)

impl<I> PartialEq for ClauseKind<I>

where I: Interner,

fn eq(&self, __other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<I> TypeFoldable<I> for ClauseKind<I>

where I: Interner, TraitPredicate<I>: TypeFoldable<I>, OutlivesPredicate<I, I::Region>: TypeFoldable<I>, OutlivesPredicate<I, I::Ty>: TypeFoldable<I>, ProjectionPredicate<I>: TypeFoldable<I>, I::Const: TypeFoldable<I>, I::Ty: TypeFoldable<I>, I::Term: TypeFoldable<I>, HostEffectPredicate<I>: TypeFoldable<I>,

fn try_fold_with<__F: FallibleTypeFolder<I>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<__F: TypeFolder<I>>(self, __folder: &mut __F) -> Self

The entry point for folding. To fold a value t with a folder f call: t.fold_with(f).

impl<I> TypeVisitable<I> for ClauseKind<I>

where I: Interner, TraitPredicate<I>: TypeVisitable<I>, OutlivesPredicate<I, I::Region>: TypeVisitable<I>, OutlivesPredicate<I, I::Ty>: TypeVisitable<I>, ProjectionPredicate<I>: TypeVisitable<I>, I::Const: TypeVisitable<I>, I::Ty: TypeVisitable<I>, I::Term: TypeVisitable<I>, HostEffectPredicate<I>: TypeVisitable<I>,

fn visit_with<__V: TypeVisitor<I>>(&self, __visitor: &mut __V) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<I> Copy for ClauseKind<I>

where I: Interner,

impl<I: Interner> Eq for ClauseKind<I>

Layout

Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.