Struct IdxRange 

pub struct IdxRange<T> { /* private fields */ }

A contiguous half-open run of indices, start .. end.

Children of an AST node, arguments of a call and parameters of a block are all stored as runs in one flat vector, so the parent holds eight bytes instead of a Vec.

Implementations

impl<T> IdxRange<T>

pub const EMPTY: Self

The empty range at the start of the table.

Every table has a start, so this is valid whatever the table holds and whether or not anything has been put in it yet. It is what a node holds when the thing it points at is a list that happens to have nothing in it: a declarator with no derivations, a call with no arguments, a declaration with no attributes.

pub fn new(start: Idx<T>, end: Idx<T>) -> Self

Builds a range.

Panics

Panics if end is before start.

pub fn empty_at(at: Idx<T>) -> Self

The empty range at at.

pub const fn len(self) -> usize

How many indices the range covers.

pub const fn is_empty(self) -> bool

Whether the range covers nothing.

pub fn iter(self) -> impl Iterator<Item = Idx<T>>

The indices in the range, in order.

pub const fn as_usize_range(self) -> Range<usize>

The range as a usize range, for slicing the backing vector.

Trait Implementations

impl<T> Clone for IdxRange<T>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T> Copy for IdxRange<T>

impl<T> Debug for IdxRange<T>

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

Formats the value using the given formatter.

impl<T> Eq for IdxRange<T>

impl<T> PartialEq for IdxRange<T>

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

Equality operator ==.

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

Inequality operator !=.