Struct CycleViolation

#[non_exhaustive]
pub struct CycleViolation {
    pub cycle: Vec<ProjectedEdge>,
    pub path: Vec<String>,
}

One closed circular path through a projected dependency graph.

The edge data remains available for evidence-rich reports, while Self::path provides the label sequence needed by human-readable formatters.

Fields (Non-exhaustive)

Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.

cycle: Vec<ProjectedEdge>

The projected dependencies in traversal order.

path: Vec<String>

The closed label path, including the starting label again at the end.

Implementations

impl CycleViolation

pub fn new(cycle: impl IntoIterator<Item = ProjectedEdge>) -> Self

Creates violation data from one projected cycle.

Trait Implementations

impl Clone for CycleViolation

fn clone(&self) -> CycleViolation

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for CycleViolation

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

Formats the value using the given formatter.

impl From<CycleViolation> for Violation

fn from(violation: CycleViolation) -> Self

Converts to this type from the input type.

impl PartialEq for CycleViolation

fn eq(&self, other: &CycleViolation) -> 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 Eq for CycleViolation

impl StructuralPartialEq for CycleViolation