Struct chalk_engine::TableIndex

pub struct TableIndex { /* fields omitted */ }

Implementations

impl TableIndex

pub fn get_and_increment(&mut self) -> Self

pub fn increment(&mut self)

pub fn iterate_range(range: Range<Self>) -> impl Iterator<Item = TableIndex>

Trait Implementations

impl Clone for TableIndex

fn clone(&self) -> TableIndex

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Copy for TableIndex

impl Debug for TableIndex

fn fmt(&self, fmt: &mut Formatter) -> Result

Formats the value using the given formatter.

impl Eq for TableIndex

impl<I: Interner, TI: TargetInterner<I>> Fold<I, TI> for TableIndex

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).

fn fold_with<'i>(
    &self,
    _folder: &mut dyn Folder<'i, I, TI>,
    _outer_binder: DebruijnIndex
) -> Fallible<Self::Result> where
    I: 'i,
    TI: '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 From<usize> for TableIndex

fn from(value: usize) -> Self

Performs the conversion.

impl Hash for TableIndex

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

Feeds this value into the given [Hasher].

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

Feeds a slice of this type into the given [Hasher].

impl Ord for TableIndex

fn cmp(&self, other: &TableIndex) -> Ordering

This method returns an [Ordering] between self and other.

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

Compares and returns the maximum of two values.

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

Compares and returns the minimum of two values.

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

🔬 This is a nightly-only experimental API. (clamp)

Restrict a value to a certain interval.

impl PartialEq<TableIndex> for TableIndex

fn eq(&self, other: &TableIndex) -> bool

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

fn ne(&self, other: &TableIndex) -> bool

This method tests for !=.

impl PartialOrd<TableIndex> for TableIndex

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

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

fn lt(&self, other: &TableIndex) -> bool

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

fn le(&self, other: &TableIndex) -> bool

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

fn gt(&self, other: &TableIndex) -> bool

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

fn ge(&self, other: &TableIndex) -> bool

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

impl StructuralEq for TableIndex

impl StructuralPartialEq for TableIndex

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

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