Struct chalk_engine::TimeStamp [−][src]
pub struct TimeStamp { /* fields omitted */ }
Expand description
The “time stamp” is a simple clock that gets incremented each time we encounter a positive answer in processing a particular strand. This is used as an optimization to help us figure out when we may have changed inference variables.
Trait Implementations
impl<I: Interner> Fold<I> for TimeStamp
[src]
impl<I: Interner> Fold<I> for TimeStamp
[src]type Result = Self
type Result = Self
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
). Read more
fn fold_with<'i>(
self,
_folder: &mut dyn Folder<'i, I>,
_outer_binder: DebruijnIndex
) -> Fallible<Self::Result> where
I: 'i,
[src]
fn fold_with<'i>(
self,
_folder: &mut dyn Folder<'i, I>,
_outer_binder: DebruijnIndex
) -> Fallible<Self::Result> where
I: 'i,
[src]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 more
impl Ord for TimeStamp
[src]
impl Ord for TimeStamp
[src]impl PartialOrd<TimeStamp> for TimeStamp
[src]
impl PartialOrd<TimeStamp> for TimeStamp
[src]fn partial_cmp(&self, other: &TimeStamp) -> Option<Ordering>
[src]
fn partial_cmp(&self, other: &TimeStamp) -> Option<Ordering>
[src]This method returns an ordering between self
and other
values if one exists. Read more
#[must_use]fn lt(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]fn lt(&self, other: &Rhs) -> bool
1.0.0[src]This method tests less than (for self
and other
) and is used by the <
operator. Read more
#[must_use]fn le(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]fn le(&self, other: &Rhs) -> bool
1.0.0[src]This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
impl<I: Interner> Visit<I> for TimeStamp
[src]
impl<I: Interner> Visit<I> for TimeStamp
[src]fn visit_with<'i, B>(
&self,
_visitor: &mut dyn Visitor<'i, I, BreakTy = B>,
_outer_binder: DebruijnIndex
) -> ControlFlow<B> where
I: 'i,
[src]
fn visit_with<'i, B>(
&self,
_visitor: &mut dyn Visitor<'i, I, BreakTy = B>,
_outer_binder: DebruijnIndex
) -> ControlFlow<B> where
I: 'i,
[src]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 more
impl Copy for TimeStamp
[src]
impl Eq for TimeStamp
[src]
impl StructuralEq for TimeStamp
[src]
impl StructuralPartialEq for TimeStamp
[src]
Auto Trait Implementations
impl RefUnwindSafe for TimeStamp
impl Send for TimeStamp
impl Sync for TimeStamp
impl Unpin for TimeStamp
impl UnwindSafe for TimeStamp
Blanket Implementations
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]pub fn borrow_mut(&mut self) -> &mut T
[src]
pub fn borrow_mut(&mut self) -> &mut T
[src]Mutably borrows from an owned value. Read more
impl<T> Cast for T
[src]
impl<T> Cast for T
[src]fn cast<U>(self, interner: &<U as HasInterner>::Interner) -> U where
Self: CastTo<U>,
U: HasInterner,
[src]
fn cast<U>(self, interner: &<U as HasInterner>::Interner) -> U where
Self: CastTo<U>,
U: HasInterner,
[src]Cast a value to type U
using CastTo
.
impl<Q, K> Equivalent<K> for Q where
K: Borrow<Q> + ?Sized,
Q: Eq + ?Sized,
[src]
impl<Q, K> Equivalent<K> for Q where
K: Borrow<Q> + ?Sized,
Q: Eq + ?Sized,
[src]pub fn equivalent(&self, key: &K) -> bool
[src]
pub fn equivalent(&self, key: &K) -> bool
[src]Compare self to key
and return true
if they are equal.
impl<T> Instrument for T
[src]
impl<T> Instrument for T
[src]fn instrument(self, span: Span) -> Instrumented<Self>
[src]
fn instrument(self, span: Span) -> Instrumented<Self>
[src]Instruments this type with the provided Span
, returning an
Instrumented
wrapper. Read more
fn in_current_span(self) -> Instrumented<Self>
[src]
fn in_current_span(self) -> Instrumented<Self>
[src]impl<T, I> Shift<I> for T where
I: Interner,
T: Fold<I>,
[src]
impl<T, I> Shift<I> for T where
I: Interner,
T: Fold<I>,
[src]pub fn shifted_in(self, interner: &I) -> <T as Fold<I>>::Result
[src]
pub fn shifted_in(self, interner: &I) -> <T as Fold<I>>::Result
[src]Shifts this term in one level of binders.
pub fn shifted_in_from(
self,
interner: &I,
source_binder: DebruijnIndex
) -> <T as Fold<I>>::Result
[src]
pub fn shifted_in_from(
self,
interner: &I,
source_binder: DebruijnIndex
) -> <T as Fold<I>>::Result
[src]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 more
pub fn shifted_out_to(
self,
interner: &I,
target_binder: DebruijnIndex
) -> Result<<T as Fold<I>>::Result, NoSolution>
[src]
pub fn shifted_out_to(
self,
interner: &I,
target_binder: DebruijnIndex
) -> Result<<T as Fold<I>>::Result, NoSolution>
[src]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 more
pub fn shifted_out(
self,
interner: &I
) -> Result<<T as Fold<I>>::Result, NoSolution>
[src]
pub fn shifted_out(
self,
interner: &I
) -> Result<<T as Fold<I>>::Result, NoSolution>
[src]Shifts this term out one level of binders.
impl<T> ToOwned for T where
T: Clone,
[src]
impl<T> ToOwned for T where
T: Clone,
[src]type Owned = T
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn to_owned(&self) -> T
[src]Creates owned data from borrowed data, usually by cloning. Read more
pub fn clone_into(&self, target: &mut T)
[src]
pub fn clone_into(&self, target: &mut T)
[src]🔬 This is a nightly-only experimental API. (toowned_clone_into
)
recently added
Uses borrowed data to replace owned data, usually by cloning. Read more
impl<T, I> VisitExt<I> for T where
I: Interner,
T: Visit<I>,
[src]
impl<T, I> VisitExt<I> for T where
I: Interner,
T: Visit<I>,
[src]fn has_free_vars(&self, interner: &I) -> bool
[src]
fn has_free_vars(&self, interner: &I) -> bool
[src]Check whether there are free (non-bound) variables.
impl<N> NodeTrait for N where
N: Copy + Ord + Hash,
[src]
N: Copy + Ord + Hash,