pub struct Canonical<T: HasInterner> {
pub value: T,
pub binders: CanonicalVarKinds<T::Interner>,
}
Expand description
Wraps a “canonicalized item”. Items are canonicalized as follows:
All unresolved existential variables are “renumbered” according to their
first appearance; the kind/universe of the variable is recorded in the
binders
field.
Fields§
§value: T
The item that is canonicalized.
binders: CanonicalVarKinds<T::Interner>
The kind/universe of the variable.
Implementations§
source§impl<T: HasInterner + Display> Canonical<T>
impl<T: HasInterner + Display> Canonical<T>
sourcepub fn display(&self, interner: T::Interner) -> CanonicalDisplay<'_, T>
pub fn display(&self, interner: T::Interner) -> CanonicalDisplay<'_, T>
Display the canonicalized item.
Trait Implementations§
source§impl<T: HasInterner> HasInterner for Canonical<T>
impl<T: HasInterner> HasInterner for Canonical<T>
§type Interner = <T as HasInterner>::Interner
type Interner = <T as HasInterner>::Interner
The interner associated with the type.
source§impl<T: PartialEq + HasInterner> PartialEq for Canonical<T>
impl<T: PartialEq + HasInterner> PartialEq for Canonical<T>
source§impl<I, T> TypeFoldable<I> for Canonical<T>
impl<I, T> TypeFoldable<I> for Canonical<T>
source§fn 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.source§fn 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
.source§impl<I, T> TypeVisitable<I> for Canonical<T>
impl<I, T> TypeVisitable<I> for Canonical<T>
source§fn 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.impl<T: Eq + HasInterner> Eq for Canonical<T>
impl<T: HasInterner> StructuralPartialEq for Canonical<T>
Auto Trait Implementations§
impl<T> Freeze for Canonical<T>
impl<T> RefUnwindSafe for Canonical<T>where
T: RefUnwindSafe,
<<T as HasInterner>::Interner as Interner>::InternedCanonicalVarKinds: RefUnwindSafe,
impl<T> Send for Canonical<T>
impl<T> Sync for Canonical<T>
impl<T> Unpin for Canonical<T>
impl<T> UnwindSafe for Canonical<T>where
T: UnwindSafe,
<<T as HasInterner>::Interner as Interner>::InternedCanonicalVarKinds: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§default unsafe fn clone_to_uninit(&self, dst: *mut T)
default unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)source§impl<T, I> Shift<I> for Twhere
T: TypeFoldable<I>,
I: Interner,
impl<T, I> Shift<I> for Twhere
T: TypeFoldable<I>,
I: Interner,
source§fn shifted_in(self, interner: I) -> T
fn shifted_in(self, interner: I) -> T
Shifts this term in one level of binders.
source§fn 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.source§fn 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.source§fn 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.
source§impl<T, I> VisitExt<I> for Twhere
I: Interner,
T: TypeVisitable<I>,
impl<T, I> VisitExt<I> for Twhere
I: Interner,
T: TypeVisitable<I>,
source§fn has_free_vars(&self, interner: I) -> bool
fn has_free_vars(&self, interner: I) -> bool
Check whether there are free (non-bound) variables.