Struct TransitiveRelationBuilder

pub struct TransitiveRelationBuilder<T> {
    elements: FxIndexSet<T>,
    edges: FxHashSet<Edge>,
}

Fields

elements: FxIndexSet<T>

edges: FxHashSet<Edge>

Implementations

impl<T: Eq + Hash + Copy> TransitiveRelationBuilder<T>

pub fn is_empty(&self) -> bool

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

fn index(&self, a: T) -> Option<Index>

fn add_index(&mut self, a: T) -> Index

pub fn maybe_map<F, U>(&self, f: F) -> Option<TransitiveRelationBuilder<U>>

where F: FnMut(T) -> Option<U>, U: Clone + Debug + Eq + Hash + Copy,

Applies the (partial) function to each edge and returns a new relation builder. If f returns None for any end-point, returns None.

pub fn add(&mut self, a: T, b: T)

Indicate that a < b (where < is this relation)

pub fn freeze(self) -> TransitiveRelation<T>

Compute the transitive closure derived from the edges, and converted to the final result. After this, all elements will be immutable to maintain the correctness of the result.

Trait Implementations

impl<T: Clone> Clone for TransitiveRelationBuilder<T>

fn clone(&self) -> TransitiveRelationBuilder<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for TransitiveRelationBuilder<T>

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

Formats the value using the given formatter.

impl<T: Eq + Hash> Default for TransitiveRelationBuilder<T>

fn default() -> Self

Returns the “default value” for a type.

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 88 bytes