Struct esl01_dag::nameset::lazy::LazySet

pub struct LazySet { /* fields omitted */ }

A set backed by a lazy iterator of names.

Methods

impl LazySet

pub fn from_iter<I>(names: I) -> Self where
    I: IntoIterator<Item = Result<VertexName>> + 'static,
    <I as IntoIterator>::IntoIter: Send + Sync, 

Trait Implementations

impl Debug for LazySet

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

Formats the value using the given formatter.

impl NameSetQuery for LazySet

fn iter(&self) -> Result<Box<dyn NameIter>>

Iterate through the set in defined order.

fn iter_rev(&self) -> Result<Box<dyn NameIter>>

Iterate through the set in the reversed order.

fn count(&self) -> Result<usize>

Number of names in this set.

fn last(&self) -> Result<Option<VertexName>>

The last name in the set.

fn contains(&self, name: &VertexName) -> Result<bool>

Test if this set contains a given name.

fn as_any(&self) -> &dyn Any

For downcasting.

fn first(&self) -> Result<Option<VertexName>>

The first name in the set.

fn is_empty(&self) -> Result<bool>

Test if this set is empty.

fn is_topo_sorted(&self) -> bool

Returns true if this set is known topologically sorted (head first, root last).

fn is_all(&self) -> bool

Returns true if this set is an "all" set.