Struct CyclePath 

pub struct CyclePath {
    pub nodes: Vec<String>,
}

A path representing a circular dependency in the schema.

Contains the sequence of type names that form the cycle.

Fields

nodes: Vec<String>

Type names in the cycle, in dependency order. For a cycle A → B → C → A, this would be ["A", "B", "C"].

Implementations

impl CyclePath

pub const fn new(nodes: Vec<String>) -> Self

Create a new cycle path from a list of nodes.

pub fn path_string(&self) -> String

Format the cycle as a readable path string.

Example

use fraiseql_core::schema::CyclePath;

let cycle = CyclePath::new(vec!["A".to_string(), "B".to_string(), "C".to_string()]);
assert_eq!(cycle.path_string(), "A → B → C → A");

pub const fn is_self_reference(&self) -> bool

Check if this is a self-referencing cycle (single node).

pub const fn len(&self) -> usize

Get the length of the cycle (number of types involved).

pub const fn is_empty(&self) -> bool

Check if the cycle is empty (should never happen in practice).

Trait Implementations

impl Clone for CyclePath

fn clone(&self) -> CyclePath

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CyclePath

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

Formats the value using the given formatter.

impl PartialEq for CyclePath

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

impl StructuralPartialEq for CyclePath