Struct snarkvm_algorithms::r1cs::OptionalVec

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

Implementations

impl<T> OptionalVec<T>

pub fn with_capacity(cap: usize) -> Self

Creates a new OptionalVec with the given underlying capacity.

pub fn insert(&mut self, elem: T) -> usize

Inserts a new value either into the first existing hole or extending the vector of values, i.e. pushing it to its end.

pub fn next_idx(&self) -> usize

Returns the index of the next value inserted into the OptionalVec.

pub fn remove(&mut self, idx: usize) -> T

Removes a value at the specified index; assumes that the index points to an existing value that is a Some(T) (i.e. not a hole).

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

Iterates over all the Some(T) values in the list.

pub fn len(&self) -> usize

Returns the number of Some(T) values.

pub fn is_empty(&self) -> bool

Returns true if there are no Some(T) values

Trait Implementations

impl<T> Default for OptionalVec<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T> Index<usize> for OptionalVec<T>

type Output = T

The returned type after indexing.

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

Performs the indexing (container[index]) operation.

impl<T> IndexMut<usize> for OptionalVec<T>

fn index_mut(&mut self, idx: usize) -> &mut Self::Output

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