Struct RelationshipValidator 

pub struct RelationshipValidator;

Relationship validator

Implementations

impl RelationshipValidator

pub fn new() -> Self

Create a new relationship validator

Example

use data_modelling_core::validation::relationships::RelationshipValidator;

let validator = RelationshipValidator::new();

pub fn check_circular_dependency( &self, relationships: &[Relationship], source_table_id: Uuid, target_table_id: Uuid, ) -> Result<(bool, Option<Vec<Uuid>>), RelationshipValidationError>

Check for circular dependencies using graph cycle detection

Uses petgraph to detect cycles in the relationship graph. If adding the new relationship would create a cycle, returns the cycle path.

Arguments

• relationships - Existing relationships in the model
• source_table_id - Source table ID of the new relationship
• target_table_id - Target table ID of the new relationship

Returns

A tuple of (has_cycle: bool, cycle_path: Option<Vec>). If a cycle is detected, the cycle path contains the table IDs forming the cycle.

Example

use data_modelling_core::validation::relationships::RelationshipValidator;
use data_modelling_core::models::Relationship;

let validator = RelationshipValidator::new();
let table_a = uuid::Uuid::new_v4();
let table_b = uuid::Uuid::new_v4();
let table_c = uuid::Uuid::new_v4();

// Create a cycle: A -> B -> C -> A
let rels = vec![
    Relationship::new(table_a, table_b),
    Relationship::new(table_b, table_c),
];

let (has_cycle, _) = validator.check_circular_dependency(&rels, table_c, table_a).unwrap();
assert!(has_cycle);

pub fn validate_no_self_reference( &self, source_table_id: Uuid, target_table_id: Uuid, ) -> Result<(), SelfReference>

Validate that source and target tables are different

Trait Implementations

impl Default for RelationshipValidator

fn default() -> RelationshipValidator

Returns the “default value” for a type.