Struct chalk_solve::rust_ir::AdtDatum

pub struct AdtDatum<I: Interner> {
    pub binders: Binders<AdtDatumBound<I>>,
    pub id: AdtId<I>,
    pub flags: AdtFlags,
    pub kind: AdtKind,
}

Fields

binders: Binders<AdtDatumBound<I>>

id: AdtId<I>

flags: AdtFlags

kind: AdtKind

Trait Implementations

impl<I: Clone + Interner> Clone for AdtDatum<I>

fn clone(&self) -> AdtDatum<I>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<I: Debug + Interner> Debug for AdtDatum<I>

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

Formats the value using the given formatter.

impl<I: Eq + Interner> Eq for AdtDatum<I>

impl<I: Hash + Interner> Hash for AdtDatum<I>

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, 

Feeds a slice of this type into the given Hasher.

impl<I: PartialEq + Interner> PartialEq<AdtDatum<I>> for AdtDatum<I>

fn eq(&self, other: &AdtDatum<I>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &AdtDatum<I>) -> bool

This method tests for !=.

impl<I: Interner> StructuralEq for AdtDatum<I>

impl<I: Interner> StructuralPartialEq for AdtDatum<I>

impl<I: Interner> ToProgramClauses<I> for AdtDatum<I>

fn to_program_clauses(
    &self,
    builder: &mut ClauseBuilder<'_, I>,
    _environment: &Environment<I>
)

Given the following type definition: struct Foo<T: Eq> { }, generate:

-- Rule WellFormed-Type
forall<T> {
    WF(Foo<T>) :- WF(T: Eq).
}

-- Rule Implied-Bound-From-Type
forall<T> {
    FromEnv(T: Eq) :- FromEnv(Foo<T>).
}

forall<T> {
    IsFullyVisible(Foo<T>) :- IsFullyVisible(T).
}

If the type Foo is marked #[upstream], we also generate:

forall<T> { IsUpstream(Foo<T>). }

Otherwise, if the type Foo is not marked #[upstream], we generate:

forall<T> { IsLocal(Foo<T>). }

Given an #[upstream] type that is also fundamental:

#[upstream]
#[fundamental]
struct Box<T, U> {}

We generate the following clauses:

forall<T, U> { IsLocal(Box<T, U>) :- IsLocal(T). }
forall<T, U> { IsLocal(Box<T, U>) :- IsLocal(U). }

forall<T, U> { IsUpstream(Box<T, U>) :- IsUpstream(T), IsUpstream(U). }

// Generated for both upstream and local fundamental types
forall<T, U> { DownstreamType(Box<T, U>) :- DownstreamType(T). }
forall<T, U> { DownstreamType(Box<T, U>) :- DownstreamType(U). }

impl<I: Interner> Visit<I> for AdtDatum<I>

fn visit_with<'i, R: VisitResult>(
    &self,
    visitor: &mut dyn Visitor<'i, I, Result = R>,
    outer_binder: DebruijnIndex
) -> R where
    I: 'i, 

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.