Struct chalk_ir::AdtId

pub struct AdtId<I: Interner>(pub I::InternedAdtId);

The id for an Abstract Data Type (i.e. structs, unions and enums).

Trait Implementations

impl<I: Clone + Interner> Clone for AdtId<I> where
    I::InternedAdtId: Clone, 

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<I: Copy + Interner> Copy for AdtId<I> where
    I::InternedAdtId: Copy, 

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

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

Formats the value using the given formatter.

impl<I: Eq + Interner> Eq for AdtId<I> where
    I::InternedAdtId: Eq, 

impl<I: Interner> Fold<I> for AdtId<I>

type Result = AdtId<I>

The type of value that will be produced once folding is done. Typically this is Self, unless Self contains borrowed values, in which case owned values are produced (for example, one can fold over a &T value where T: Fold, in which case you get back a T, not a &T).

fn fold_with<'i>(
    self,
    _folder: &mut dyn Folder<'i, I>,
    _outer_binder: DebruijnIndex
) -> Fallible<Self::Result> where
    I: 'i, 

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

impl<I: Hash + Interner> Hash for AdtId<I> where
    I::InternedAdtId: Hash, 

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

Feeds this value into the given Hasher.

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

Feeds a slice of this type into the given Hasher.

impl<I: Ord + Interner> Ord for AdtId<I> where
    I::InternedAdtId: Ord, 

fn cmp(&self, other: &AdtId<I>) -> Ordering

This method returns an Ordering between self and other.

#[must_use]pub fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

#[must_use]pub fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

#[must_use]pub fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval.

impl<I: PartialEq + Interner> PartialEq<AdtId<I>> for AdtId<I> where
    I::InternedAdtId: PartialEq, 

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

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

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

This method tests for !=.

impl<I: PartialOrd + Interner> PartialOrd<AdtId<I>> for AdtId<I> where
    I::InternedAdtId: PartialOrd, 

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

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

#[must_use]pub fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator.

#[must_use]pub fn le(&self, other: &Rhs) -> bool

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

#[must_use]pub fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator.

#[must_use]pub fn ge(&self, other: &Rhs) -> bool

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

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

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

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

fn visit_with<'i, B>(
    &self,
    _visitor: &mut dyn Visitor<'i, I, BreakTy = B>,
    _outer_binder: DebruijnIndex
) -> ControlFlow<B> 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.

impl<I: Interner> Zip<I> for AdtId<I>

fn zip_with<'i, Z: Zipper<'i, I>>(
    _zipper: &mut Z,
    _variance: Variance,
    a: &Self,
    b: &Self
) -> Fallible<()> where
    I: 'i, 

Uses the zipper to walk through two values, ensuring that they match.