Enum WellKnownTrait

pub enum WellKnownTrait {
    Sized,
    Copy,
    Clone,
    Drop,
    FnOnce,
    FnMut,
    Fn,
    AsyncFnOnce,
    AsyncFnMut,
    AsyncFn,
    Unsize,
    Unpin,
    CoerceUnsized,
    DiscriminantKind,
    Coroutine,
    DispatchFromDyn,
    Tuple,
    Pointee,
    FnPtr,
    Future,
}

A list of the traits that are “well known” to chalk, which means that the chalk-solve crate has special, hard-coded impls for them.

Variants

Sized

Copy

Clone

Drop

FnOnce

The trait FnOnce<Args> - the generic argument Args is always a tuple corresponding to the arguments of a function implementing this trait. E.g. fn(u8, bool): FnOnce<(u8, bool)>

FnMut

Fn

AsyncFnOnce

AsyncFnMut

AsyncFn

Unsize

Unpin

CoerceUnsized

DiscriminantKind

Coroutine

DispatchFromDyn

Tuple

Pointee

FnPtr

Future

Trait Implementations

impl Clone for WellKnownTrait

fn clone(&self) -> WellKnownTrait

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for WellKnownTrait

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

Formats the value using the given formatter.

impl Hash for WellKnownTrait

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 Ord for WellKnownTrait

fn cmp(&self, other: &WellKnownTrait) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for WellKnownTrait

fn eq(&self, other: &WellKnownTrait) -> 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 PartialOrd for WellKnownTrait

fn partial_cmp(&self, other: &WellKnownTrait) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<I: Interner> TypeVisitable<I> for WellKnownTrait

fn visit_with<B>( &self, _visitor: &mut dyn TypeVisitor<I, BreakTy = B>, _outer_binder: DebruijnIndex, ) -> ControlFlow<B>

Apply the given visitor visitor to self; binders is the number of binders that are in scope when beginning the visitor. Typically binders starts as 0, but is adjusted when we encounter Binders<T> in the IR or other similar constructs.

impl Copy for WellKnownTrait

impl Eq for WellKnownTrait

impl StructuralPartialEq for WellKnownTrait