Enum Cycle 

pub enum Cycle {
    Artefact,
    Mutual,
}

Why a dependency edge could not be honoured.

Variants

Artefact

The class graph is acyclic here. The cycle exists only because groups contract classes: one group both defines and consumes, against the same other group, so no reading order can satisfy both.

Mutual

The class graph is cyclic too. The mutual dependency is in the change.

Trait Implementations

impl Clone for Cycle

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Cycle

impl Debug for Cycle

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Cycle

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for Cycle

impl PartialEq for Cycle

fn eq(&self, other: &Self) -> bool

Equality operator ==.

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

Inequality operator !=.

impl Serialize for Cycle

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for Cycle