Struct chalk_engine::TableIndex

pub struct TableIndex {
    pub(crate) value: usize,
}

Fields

value: usize

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 Debug for TableIndex

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

Formats the value using the given formatter.

impl From<usize> for TableIndex

fn from(value: usize) -> Self

Converts to this type from the input type.

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, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<I: Interner> Index<TableIndex> for Tables<I>

type Output = Table<I>

The returned type after indexing.

fn index(&self, index: TableIndex) -> &Table<I>

Performs the indexing (container[index]) operation.

impl<I: Interner> IndexMut<TableIndex> for Tables<I>

fn index_mut(&mut self, index: TableIndex) -> &mut Table<I>

Performs the mutable indexing (container[index]) operation.

impl Ord for TableIndex

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

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized + PartialOrd,

Restrict a value to a certain interval.

impl PartialEq 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: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd 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: &Rhs) -> bool

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

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

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

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

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

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

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

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

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.

fn fold_with( self, folder: &mut dyn TypeFolder<I, Error = Infallible>, 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.

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

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 Copy for TableIndex

impl Eq for TableIndex

impl StructuralPartialEq for TableIndex