Struct esl01_dag::nameset::union::UnionSet

pub struct UnionSet { /* fields omitted */ }

Union of 2 sets.

The order is preserved. The first set is iterated first, then the second set is iterated, with duplicated names skipped.

Methods

impl UnionSet

pub fn new(lhs: NameSet, rhs: NameSet) -> Self

Trait Implementations

impl Debug for UnionSet

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

Formats the value using the given formatter.

impl NameSetQuery for UnionSet

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 is_empty(&self) -> Result<bool>

Test if this set is empty.

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 last(&self) -> Result<Option<VertexName>>

The last name in the set.

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.