pub struct AdtId<I: Interner>(pub I::InternedAdtId);
Expand description
The id for an Abstract Data Type (i.e. structs, unions and enums).
Tuple Fields
0: I::InternedAdtId
Trait Implementations
sourceimpl<I: Ord + Interner> Ord for AdtId<I>where
I::InternedAdtId: Ord,
impl<I: Ord + Interner> Ord for AdtId<I>where
I::InternedAdtId: Ord,
1.21.0 · sourcefn max(self, other: Self) -> Self
fn max(self, other: Self) -> Self
Compares and returns the maximum of two values. Read more
1.21.0 · sourcefn min(self, other: Self) -> Self
fn min(self, other: Self) -> Self
Compares and returns the minimum of two values. Read more
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>,
Restrict a value to a certain interval. Read more
sourceimpl<I: PartialEq + Interner> PartialEq<AdtId<I>> for AdtId<I>where
I::InternedAdtId: PartialEq,
impl<I: PartialEq + Interner> PartialEq<AdtId<I>> for AdtId<I>where
I::InternedAdtId: PartialEq,
sourceimpl<I: PartialOrd + Interner> PartialOrd<AdtId<I>> for AdtId<I>where
I::InternedAdtId: PartialOrd,
impl<I: PartialOrd + Interner> PartialOrd<AdtId<I>> for AdtId<I>where
I::InternedAdtId: PartialOrd,
sourcefn partial_cmp(&self, other: &AdtId<I>) -> Option<Ordering>
fn partial_cmp(&self, other: &AdtId<I>) -> Option<Ordering>
1.0.0 · sourcefn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self
and other
) and is used by the <=
operator. Read moresourceimpl<I: Interner> TypeFoldable<I> for AdtId<I>
impl<I: Interner> TypeFoldable<I> for AdtId<I>
sourcefn try_fold_with<E>(
self,
_folder: &mut dyn FallibleTypeFolder<I, Error = E>,
_outer_binder: DebruijnIndex
) -> Result<Self, E>
fn try_fold_with<E>(
self,
_folder: &mut dyn FallibleTypeFolder<I, Error = E>,
_outer_binder: DebruijnIndex
) -> Result<Self, E>
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. Read moresourcefn fold_with(
self,
folder: &mut dyn TypeFolder<I>,
outer_binder: DebruijnIndex
) -> Self
fn fold_with(
self,
folder: &mut dyn TypeFolder<I>,
outer_binder: DebruijnIndex
) -> Self
A convenient alternative to
try_fold_with
for use with infallible
folders. Do not override this method, to ensure coherence with
try_fold_with
. Read moresourceimpl<I: Interner> TypeVisitable<I> for AdtId<I>
impl<I: Interner> TypeVisitable<I> for AdtId<I>
sourcefn visit_with<B>(
&self,
_visitor: &mut dyn TypeVisitor<I, BreakTy = B>,
_outer_binder: DebruijnIndex
) -> ControlFlow<B>
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. Read moreimpl<I: Copy + Interner> Copy for AdtId<I>where
I::InternedAdtId: Copy,
impl<I: Eq + Interner> Eq for AdtId<I>where
I::InternedAdtId: Eq,
impl<I: Interner> StructuralEq for AdtId<I>
impl<I: Interner> StructuralPartialEq for AdtId<I>
Auto Trait Implementations
impl<I> RefUnwindSafe for AdtId<I>where
<I as Interner>::InternedAdtId: RefUnwindSafe,
impl<I> Send for AdtId<I>where
<I as Interner>::InternedAdtId: Send,
impl<I> Sync for AdtId<I>where
<I as Interner>::InternedAdtId: Sync,
impl<I> Unpin for AdtId<I>where
<I as Interner>::InternedAdtId: Unpin,
impl<I> UnwindSafe for AdtId<I>where
<I as Interner>::InternedAdtId: UnwindSafe,
Blanket Implementations
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
Mutably borrows from an owned value. Read more
sourceimpl<T> Cast for T
impl<T> Cast for T
sourcefn cast<U>(self, interner: U::Interner) -> Uwhere
Self: CastTo<U>,
U: HasInterner,
fn cast<U>(self, interner: U::Interner) -> Uwhere
Self: CastTo<U>,
U: HasInterner,
Cast a value to type
U
using CastTo
.sourceimpl<T, I> Shift<I> for Twhere
T: TypeFoldable<I>,
I: Interner,
impl<T, I> Shift<I> for Twhere
T: TypeFoldable<I>,
I: Interner,
sourcefn shifted_in(self, interner: I) -> T
fn shifted_in(self, interner: I) -> T
Shifts this term in one level of binders.
sourcefn shifted_in_from(self, interner: I, source_binder: DebruijnIndex) -> T
fn shifted_in_from(self, interner: I, source_binder: DebruijnIndex) -> T
Shifts a term valid at
outer_binder
so that it is
valid at the innermost binder. See DebruijnIndex::shifted_in_from
for a detailed explanation. Read moresourcefn shifted_out_to(
self,
interner: I,
target_binder: DebruijnIndex
) -> Result<T, NoSolution>
fn shifted_out_to(
self,
interner: I,
target_binder: DebruijnIndex
) -> Result<T, NoSolution>
Shifts a term valid at the innermost binder so that it is
valid at
outer_binder
. See DebruijnIndex::shifted_out_to
for a detailed explanation. Read moresourcefn shifted_out(self, interner: I) -> Result<T, NoSolution>
fn shifted_out(self, interner: I) -> Result<T, NoSolution>
Shifts this term out one level of binders.
sourceimpl<T, I> VisitExt<I> for Twhere
I: Interner,
T: TypeVisitable<I>,
impl<T, I> VisitExt<I> for Twhere
I: Interner,
T: TypeVisitable<I>,
sourcefn has_free_vars(&self, interner: I) -> bool
fn has_free_vars(&self, interner: I) -> bool
Check whether there are free (non-bound) variables.