Struct esl01_dag::nameset::NameSet

pub struct NameSet(_);

A NameSet contains an immutable list of names.

It provides order-preserving iteration and set operations, and is cheaply clonable.

Methods

impl NameSet

pub fn from_static_names(names: impl IntoIterator<Item = VertexName>) -> NameSet

Creates from a (short) list of known names.

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

Creates from a (lazy) iterator of names.

pub fn difference(&self, other: &NameSet) -> NameSet

Calculates the subset that is only in self, not in other.

pub fn intersection(&self, other: &NameSet) -> NameSet

Calculates the intersection of two sets.

pub fn union(&self, other: &NameSet) -> NameSet

Calculates the union of two sets.

pub fn mark_sorted(&self) -> NameSet

Mark the set as "topologically sorted". Useful to mark a [LazySet] as sorted to avoid actual sorting (and keep the set lazy).

Trait Implementations

impl Clone for NameSet

fn clone(&self) -> NameSet

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for NameSet

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

Formats the value using the given formatter.

impl Deref for NameSet

type Target = dyn NameSetQuery

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<'a> From<(LegacyCodeNeedIdAccess, SpanSet, &'a NameDag)> for NameSet

fn from(value: (LegacyCodeNeedIdAccess, SpanSet, &'a NameDag)) -> NameSet

Performs the conversion.