pub struct PathSummary { /* private fields */ }Expand description
Canonical, unionable constructional summary for one fixed automaton.
Nullable automata retain both endpoints of every supplied graph edge so their zero-hop identity has the correct graph domain. Non-nullable automata retain only endpoints of edges matching at least one transition: every positive-length path lies entirely in that support. The retained arcs are direct product arcs, never a transitive closure.
Implementations§
Source§impl PathSummary
impl PathSummary
Sourcepub fn from_edges(
automaton: Automaton,
edges: impl IntoIterator<Item = GraphEdge>,
) -> Self
pub fn from_edges( automaton: Automaton, edges: impl IntoIterator<Item = GraphEdge>, ) -> Self
Lowers a SET of graph edges into canonical direct product arcs.
Sourcepub fn from_tribles<'a>(
automaton: Automaton,
tribles: impl IntoIterator<Item = &'a Trible>,
) -> Self
pub fn from_tribles<'a>( automaton: Automaton, tribles: impl IntoIterator<Item = &'a Trible>, ) -> Self
Lowers tribles directly into a summary.
Sourcepub fn vertices(&self) -> &[RawInline] ⓘ
pub fn vertices(&self) -> &[RawInline] ⓘ
Sorted graph-term domain required by this fixed automaton.
Sourcepub fn direct_arc_count(&self) -> usize
pub fn direct_arc_count(&self) -> usize
Number of canonical direct product arcs.
Sourcepub fn merge(&self, other: &Self) -> Result<Self, PathError>
pub fn merge(&self, other: &Self) -> Result<Self, PathError>
Canonical set union of two summaries.
Sourcepub fn merge_all<'a>(
summaries: impl IntoIterator<Item = &'a Self>,
) -> Result<Self, PathError>
pub fn merge_all<'a>( summaries: impl IntoIterator<Item = &'a Self>, ) -> Result<Self, PathError>
Canonical set union of any nonempty collection of summaries.
Trait Implementations§
Source§impl Clone for PathSummary
impl Clone for PathSummary
Source§impl Debug for PathSummary
impl Debug for PathSummary
impl Eq for PathSummary
Source§impl PartialEq for PathSummary
impl PartialEq for PathSummary
impl StructuralPartialEq for PathSummary
Auto Trait Implementations§
impl Freeze for PathSummary
impl RefUnwindSafe for PathSummary
impl Send for PathSummary
impl Sync for PathSummary
impl Unpin for PathSummary
impl UnsafeUnpin for PathSummary
impl UnwindSafe for PathSummary
Blanket Implementations§
impl<T> ArchiveOwner for T
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<S, T> IntoEncoded<S> for Twhere
S: Encodes<T>,
impl<S, T> IntoEncoded<S> for Twhere
S: Encodes<T>,
Source§fn into_encoded(self) -> <T as IntoEncoded<S>>::Output
fn into_encoded(self) -> <T as IntoEncoded<S>>::Output
Run the conversion.