pub struct Lifetime<I: Interner> {
pub(crate) interned: I::InternedLifetime,
}
Expand description
A Rust lifetime.
Fields§
§interned: I::InternedLifetime
Implementations§
source§impl<I: Interner> Lifetime<I>
impl<I: Interner> Lifetime<I>
sourcepub fn new(interner: I, data: impl CastTo<LifetimeData<I>>) -> Self
pub fn new(interner: I, data: impl CastTo<LifetimeData<I>>) -> Self
Create a lifetime from lifetime data (or something that can be cast to lifetime data).
sourcepub fn interned(&self) -> &I::InternedLifetime
pub fn interned(&self) -> &I::InternedLifetime
Gets the interned value.
sourcepub fn data(&self, interner: I) -> &LifetimeData<I>
pub fn data(&self, interner: I) -> &LifetimeData<I>
Gets the lifetime data.
sourcepub fn bound_var(&self, interner: I) -> Option<BoundVar>
pub fn bound_var(&self, interner: I) -> Option<BoundVar>
If this is a Lifetime::BoundVar(d)
, returns Some(d)
else None
.
sourcepub fn inference_var(&self, interner: I) -> Option<InferenceVar>
pub fn inference_var(&self, interner: I) -> Option<InferenceVar>
If this is a Lifetime::InferenceVar(d)
, returns Some(d)
else None
.
sourcepub fn needs_shift(&self, interner: I) -> bool
pub fn needs_shift(&self, interner: I) -> bool
True if this lifetime is a “bound” lifetime, and hence needs to be shifted across binders. Meant for debug assertions.
sourcepub(crate) fn compute_flags(&self, interner: I) -> TypeFlags
pub(crate) fn compute_flags(&self, interner: I) -> TypeFlags
compute type flags for Lifetime
Trait Implementations§
source§impl<I: Interner> CastTo<GenericArg<I>> for Lifetime<I>
impl<I: Interner> CastTo<GenericArg<I>> for Lifetime<I>
source§fn cast_to(self, interner: I) -> GenericArg<I>
fn cast_to(self, interner: I) -> GenericArg<I>
Cast a value to type
T
.source§impl<I: Interner> HasInterner for Lifetime<I>
impl<I: Interner> HasInterner for Lifetime<I>
source§impl<I: Ord + Interner> Ord for Lifetime<I>where
I::InternedLifetime: Ord,
impl<I: Ord + Interner> Ord for Lifetime<I>where
I::InternedLifetime: Ord,
1.21.0 · source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the maximum of two values. Read more
source§impl<I: PartialEq + Interner> PartialEq for Lifetime<I>where
I::InternedLifetime: PartialEq,
impl<I: PartialEq + Interner> PartialEq for Lifetime<I>where
I::InternedLifetime: PartialEq,
source§impl<I: PartialOrd + Interner> PartialOrd for Lifetime<I>where
I::InternedLifetime: PartialOrd,
impl<I: PartialOrd + Interner> PartialOrd for Lifetime<I>where
I::InternedLifetime: PartialOrd,
1.0.0 · source§fn 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 moresource§impl<I: Interner> TypeFoldable<I> for Lifetime<I>
impl<I: Interner> TypeFoldable<I> for Lifetime<I>
“Folding” a lifetime invokes the fold_lifetime
method on the folder; this
usually (in turn) invokes super_fold_lifetime
to fold the individual
parts.
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> TypeSuperFoldable<I> for Lifetime<I>where
I: Interner,
impl<I> TypeSuperFoldable<I> for Lifetime<I>where
I: Interner,
source§fn try_super_fold_with<E>(
self,
folder: &mut dyn FallibleTypeFolder<I, Error = E>,
outer_binder: DebruijnIndex,
) -> Result<Lifetime<I>, E>
fn try_super_fold_with<E>( self, folder: &mut dyn FallibleTypeFolder<I, Error = E>, outer_binder: DebruijnIndex, ) -> Result<Lifetime<I>, E>
Recursively folds the value.
source§fn super_fold_with(
self,
folder: &mut dyn TypeFolder<I>,
outer_binder: DebruijnIndex,
) -> Self
fn super_fold_with( self, folder: &mut dyn TypeFolder<I>, outer_binder: DebruijnIndex, ) -> Self
A convenient alternative to
try_super_fold_with
for use with
infallible folders. Do not override this method, to ensure coherence
with try_super_fold_with
.source§impl<I: Interner> TypeSuperVisitable<I> for Lifetime<I>
impl<I: Interner> TypeSuperVisitable<I> for Lifetime<I>
source§fn super_visit_with<B>(
&self,
visitor: &mut dyn TypeVisitor<I, BreakTy = B>,
outer_binder: DebruijnIndex,
) -> ControlFlow<B>
fn super_visit_with<B>( &self, visitor: &mut dyn TypeVisitor<I, BreakTy = B>, outer_binder: DebruijnIndex, ) -> ControlFlow<B>
Recursively visits the type contents.
source§impl<I: Interner> TypeVisitable<I> for Lifetime<I>
impl<I: Interner> TypeVisitable<I> for Lifetime<I>
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<I: Copy + Interner> Copy for Lifetime<I>where
I::InternedLifetime: Copy,
impl<I: Eq + Interner> Eq for Lifetime<I>where
I::InternedLifetime: Eq,
impl<I: Interner> StructuralPartialEq for Lifetime<I>
Auto Trait Implementations§
impl<I> Freeze for Lifetime<I>
impl<I> RefUnwindSafe for Lifetime<I>
impl<I> Send for Lifetime<I>
impl<I> Sync for Lifetime<I>
impl<I> Unpin for Lifetime<I>
impl<I> UnwindSafe for Lifetime<I>
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: Copy,
impl<T> CloneToUninit for Twhere
T: Copy,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)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> CouldMatch<T> for T
impl<T, I> CouldMatch<T> for T
source§fn could_match(
&self,
interner: I,
db: &dyn UnificationDatabase<I>,
other: &T,
) -> bool
fn could_match( &self, interner: I, db: &dyn UnificationDatabase<I>, other: &T, ) -> bool
Checks whether
self
and other
could possibly match.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.