Enum ModuleKind

pub enum ModuleKind<NodeId: Copy + PartialEq> {
    Prime,
    Series,
    Parallel,
    Node(NodeId),
}

Module kinds of nodes in a MDTree.

Each module corresponds to a set of nodes in the original graph, the leaves of the subtree rooted at that node.

The module kinds are determined by the quotient graph of a module that is obtained by taking a single node from each child module.

Variants

Prime

A prime module. Its quotient graph has only trivial modules.

Series

A series module. Its quotient graph is a complete graph.

Parallel

A parallel module. Its quotient graph is an empty graph.

Node(NodeId)

A trivial module with a single node. This is leaf node in the MDTree.

Trait Implementations

impl<NodeId: Clone + Copy + PartialEq> Clone for ModuleKind<NodeId>

fn clone(&self) -> ModuleKind<NodeId>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<NodeId: Debug + Copy + PartialEq> Debug for ModuleKind<NodeId>

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

Formats the value using the given formatter.

impl<NodeId: Hash + Copy + PartialEq> Hash for ModuleKind<NodeId>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<NodeId: Ord + Copy + PartialEq> Ord for ModuleKind<NodeId>

fn cmp(&self, other: &ModuleKind<NodeId>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<NodeId: PartialEq + Copy + PartialEq> PartialEq for ModuleKind<NodeId>

fn eq(&self, other: &ModuleKind<NodeId>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<NodeId: PartialOrd + Copy + PartialEq> PartialOrd for ModuleKind<NodeId>

fn partial_cmp(&self, other: &ModuleKind<NodeId>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<NodeId: Copy + Copy + PartialEq> Copy for ModuleKind<NodeId>

impl<NodeId: Eq + Copy + PartialEq> Eq for ModuleKind<NodeId>

impl<NodeId: Copy + PartialEq> StructuralPartialEq for ModuleKind<NodeId>