Struct cairo_lang_lowering::objects::blocks::Blocks

pub struct Blocks<T>(pub Vec<T>);

A convenient wrapper around a vector of blocks. This is used instead of id_arena, since the latter is harder to clone and modify.

Tuple Fields

0: Vec<T>

Implementations

impl<T: Default> Blocks<T>

pub fn new() -> Self

pub fn alloc(&mut self, block: T) -> BlockId

pub fn alloc_empty(&mut self) -> BlockId

Allocate a new block ID. The block itself should be populated later.

pub fn set_block(&mut self, id: BlockId, block: T)

Sets an already-allocated block.

pub fn iter(&self) -> BlocksIter<'_, T>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn root_block(&self) -> Maybe<&T>

pub fn has_root(&self) -> Maybe<()>

Trait Implementations

impl<T: Clone> Clone for Blocks<T>

fn clone(&self) -> Blocks<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for Blocks<T>

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

Formats the value using the given formatter.

impl<T: Default> Default for Blocks<T>

fn default() -> Blocks<T>

Returns the “default value” for a type.

impl<T> Index<BlockId> for Blocks<T>

type Output = T

The returned type after indexing.

fn index(&self, index: BlockId) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<T> IndexMut<BlockId> for Blocks<T>

fn index_mut(&mut self, index: BlockId) -> &mut Self::Output

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

impl<'a, T> IntoIterator for &'a Blocks<T>

type Item = (BlockId, &'a T)

The type of the elements being iterated over.

type IntoIter = BlocksIter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: PartialEq> PartialEq<Blocks<T>> for Blocks<T>

fn eq(&self, other: &Blocks<T>) -> 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<T: Eq> Eq for Blocks<T>

impl<T> StructuralEq for Blocks<T>

impl<T> StructuralPartialEq for Blocks<T>