wyrd-for-games 0.4.0

//! Structural validation and soft/hard resource budgets for weaves.
//!
//! Definition validation (`validate_def`) enforces ids, ports, fan-in, required
//! connections, numeric path match, and acyclicity. Post-validation budget
//! checks (`validate` / `validate_report`) enforce hard limits and collect soft
//! warnings for tooling. Runtime bind re-runs budget validation with bind opts.

use core::fmt;

use std::collections::{BTreeMap, BTreeSet};
use std::prelude::v1::vec;
use std::string::String;
use std::vec::Vec;

use crate::foundation::{
    port_domain, port_slot, ports_of, KnotKind, NumericPath, PortDir, PortDomain, PortSlot, Signal,
    SignalDomain, ONE, ZERO,
};

use crate::{ValidationError, Weave, WeaveDef};

/// Hard and soft resource limits applied after structural validation.
#[derive(Clone, Debug)]
pub struct Budget {
    /// Hard cap on knot count (bind rejects above this).
    pub max_knots: u16,
    /// Hard cap on thread count.
    pub max_threads: u16,
    /// Soft knot count; exceeded yields [`BudgetWarning::SoftKnots`].
    pub soft_knots: u16,
    /// Soft thread count; exceeded yields [`BudgetWarning::SoftThreads`].
    pub soft_threads: u16,
    /// Hard cap on longest topo chain depth.
    pub max_chain_depth: u16,
    /// Soft chain depth; exceeded yields [`BudgetWarning::SoftChainDepth`].
    pub soft_chain_depth: u16,
    /// Hard cap on outbound threads from any single knot.
    pub max_fan_out: u16,
    /// Soft fan-out; exceeded yields [`BudgetWarning::SoftFanOut`].
    pub soft_fan_out: u16,
    /// Hard cap on summed `Delay` ticks along any topo path.
    pub max_delay_path_sum: u16,
}

impl Default for Budget {
    fn default() -> Self {
        Self {
            max_knots: 256,
            max_threads: 512,
            soft_knots: 64,
            soft_threads: 128,
            max_chain_depth: 16,
            soft_chain_depth: 8,
            max_fan_out: 8,
            soft_fan_out: 4,
            max_delay_path_sum: 32,
        }
    }
}

/// Soft-limit warning; graph remains valid for bind.
#[derive(Clone, Debug, PartialEq, Eq)]
#[non_exhaustive]
pub enum BudgetWarning {
    /// Knot count exceeded the soft budget but remains under the hard cap.
    SoftKnots {
        /// Observed knot count.
        count: u16,
        /// Configured soft limit from [`Budget::soft_knots`].
        soft: u16,
    },
    /// Thread count exceeded the soft budget but remains under the hard cap.
    SoftThreads {
        /// Observed thread count.
        count: u16,
        /// Configured soft limit from [`Budget::soft_threads`].
        soft: u16,
    },
    /// Longest topo chain depth exceeded the soft budget.
    SoftChainDepth {
        /// Observed chain depth at [`Self::SoftChainDepth::at_knot`].
        depth: u16,
        /// Configured soft limit from [`Budget::soft_chain_depth`].
        soft: u16,
        /// Knot id where the soft depth threshold was crossed.
        at_knot: String,
    },
    /// Outbound thread count from one knot exceeded the soft fan-out budget.
    SoftFanOut {
        /// Observed fan-out from [`Self::SoftFanOut::at_knot`].
        fan_out: u16,
        /// Configured soft limit from [`Budget::soft_fan_out`].
        soft: u16,
        /// Knot id whose outbound threads triggered the warning.
        at_knot: String,
    },
}

impl fmt::Display for BudgetWarning {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        match self {
            Self::SoftKnots { count, soft } => {
                write!(f, "soft knot budget: {count} knots (soft {soft})")
            }
            Self::SoftThreads { count, soft } => {
                write!(f, "soft thread budget: {count} threads (soft {soft})")
            }
            Self::SoftChainDepth {
                depth,
                soft,
                at_knot,
            } => write!(
                f,
                "soft chain depth: {depth} edges at knot '{at_knot}' (soft {soft})"
            ),
            Self::SoftFanOut {
                fan_out,
                soft,
                at_knot,
            } => write!(
                f,
                "soft fan-out: {fan_out} from knot '{at_knot}' (soft {soft})"
            ),
        }
    }
}

/// Soft budget warnings from a successful hard-limit pass.
#[derive(Clone, Debug, Default, PartialEq, Eq)]
pub struct ValidateReport {
    /// Soft-limit warnings collected during a successful hard-limit pass.
    pub warnings: Vec<BudgetWarning>,
}
impl ValidateReport {
    /// True when no soft warnings were recorded.
    pub fn ok(&self) -> bool {
        self.warnings.is_empty()
    }
}

impl fmt::Display for ValidateReport {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        if self.warnings.is_empty() {
            return f.write_str("validate ok");
        }
        for (i, warning) in self.warnings.iter().enumerate() {
            if i != 0 {
                f.write_str("; ")?;
            }
            warning.fmt(f)?;
        }
        Ok(())
    }
}

/// Hard budget check only; discards soft warnings.
pub fn validate(weave: &Weave, budget: &Budget) -> Result<(), ValidationError> {
    validate_report(weave, budget).map(|_| ())
}

/// Hard budget check plus soft-limit warnings for tooling.
pub fn validate_report(weave: &Weave, budget: &Budget) -> Result<ValidateReport, ValidationError> {
    let knots = weave.knots();
    let threads = weave.threads();
    budget_limit("knots", knots.len(), budget.max_knots as usize, None)?;
    budget_limit("threads", threads.len(), budget.max_threads as usize, None)?;

    let index: BTreeMap<&str, usize> = knots
        .iter()
        .enumerate()
        .map(|(i, knot)| (knot.id.as_str(), i))
        .collect();
    let mut adj = vec![Vec::new(); knots.len()];
    let mut indeg = vec![0u16; knots.len()];
    let mut fan_out = vec![0u16; knots.len()];
    for thread in threads {
        let from = index[thread.from.knot.as_str()];
        let to = index[thread.to.knot.as_str()];
        adj[from].push(to);
        indeg[to] = indeg[to].saturating_add(1);
        fan_out[from] = fan_out[from].saturating_add(1);
        budget_limit(
            "fan-out",
            fan_out[from] as usize,
            budget.max_fan_out as usize,
            Some(&knots[from].id),
        )?;
    }

    let mut queue: Vec<usize> = indeg
        .iter()
        .enumerate()
        .filter_map(|(i, d)| (*d == 0).then_some(i))
        .collect();
    let mut depth = vec![0u16; knots.len()];
    let mut delay_sum: Vec<u32> = knots
        .iter()
        .map(|k| u32::from(delay_ticks(&k.kind)))
        .collect();
    while let Some(node) = queue.pop() {
        budget_limit(
            "chain depth",
            depth[node] as usize,
            budget.max_chain_depth as usize,
            Some(&knots[node].id),
        )?;
        budget_limit(
            "delay path sum",
            delay_sum[node] as usize,
            budget.max_delay_path_sum as usize,
            Some(&knots[node].id),
        )?;
        for &next in &adj[node] {
            depth[next] = depth[next].max(depth[node].saturating_add(1));
            delay_sum[next] = delay_sum[next]
                .max(delay_sum[node].saturating_add(u32::from(delay_ticks(&knots[next].kind))));
            indeg[next] -= 1;
            if indeg[next] == 0 {
                queue.push(next);
            }
        }
    }

    let mut warnings = Vec::new();
    if knots.len() > budget.soft_knots as usize {
        warnings.push(BudgetWarning::SoftKnots {
            count: knots.len() as u16,
            soft: budget.soft_knots,
        });
    }
    if threads.len() > budget.soft_threads as usize {
        warnings.push(BudgetWarning::SoftThreads {
            count: threads.len() as u16,
            soft: budget.soft_threads,
        });
    }
    for (i, &count) in fan_out.iter().enumerate() {
        if count > budget.soft_fan_out {
            warnings.push(BudgetWarning::SoftFanOut {
                fan_out: count,
                soft: budget.soft_fan_out,
                at_knot: knots[i].id.clone(),
            });
        }
    }
    for (i, &count) in depth.iter().enumerate() {
        if count > budget.soft_chain_depth {
            warnings.push(BudgetWarning::SoftChainDepth {
                depth: count,
                soft: budget.soft_chain_depth,
                at_knot: knots[i].id.clone(),
            });
        }
    }
    Ok(ValidateReport { warnings })
}

pub(crate) fn validate_def(def: &WeaveDef) -> Result<(), ValidationError> {
    validate_def_with_external_inputs(def, &BTreeSet::new())
}

pub(crate) fn validate_def_with_external_inputs(
    def: &WeaveDef,
    external: &BTreeSet<(String, String)>,
) -> Result<(), ValidationError> {
    if def.id.is_empty() {
        return Err(ValidationError::InvalidWeaveId {
            weave_id: def.id.clone(),
            reason: "must be non-empty",
        });
    }
    if def.knots.is_empty() {
        return Err(ValidationError::EmptyWeave {
            weave_id: def.id.clone(),
        });
    }
    if def.knots.len() > u16::MAX as usize {
        return Err(ValidationError::RepresentationOverflow {
            what: "knot",
            actual: def.knots.len(),
            limit: u16::MAX as usize,
        });
    }
    if def.threads.len() > u16::MAX as usize {
        return Err(ValidationError::RepresentationOverflow {
            what: "thread",
            actual: def.threads.len(),
            limit: u16::MAX as usize,
        });
    }
    if def.numeric != NumericPath::compiled() {
        return Err(ValidationError::NumericMismatch {
            expected: NumericPath::compiled(),
            actual: def.numeric,
        });
    }

    let mut index = BTreeMap::new();
    for (i, knot) in def.knots.iter().enumerate() {
        if knot.id.is_empty() {
            return Err(ValidationError::InvalidKnotId {
                knot_id: knot.id.clone(),
                reason: "must be non-empty",
            });
        }
        if index.insert(knot.id.as_str(), i).is_some() {
            return Err(ValidationError::DuplicateKnotId {
                knot_id: knot.id.clone(),
            });
        }
        validate_kind(knot)?;
    }
    let mut fan = BTreeSet::new();
    let mut adj = vec![Vec::new(); def.knots.len()];
    let mut indeg = vec![0u32; def.knots.len()];
    for thread in &def.threads {
        let &from =
            index
                .get(thread.from.knot.as_str())
                .ok_or_else(|| ValidationError::UnknownKnot {
                    knot_id: thread.from.knot.clone(),
                })?;
        let &to =
            index
                .get(thread.to.knot.as_str())
                .ok_or_else(|| ValidationError::UnknownKnot {
                    knot_id: thread.to.knot.clone(),
                })?;
        check_port(&def.knots[from], &thread.from.port, PortDir::Out)?;
        check_port(&def.knots[to], &thread.to.port, PortDir::In)?;
        if !fan.insert((to, thread.to.port.as_str())) {
            return Err(ValidationError::FanIn {
                knot_id: thread.to.knot.clone(),
                port: thread.to.port.clone(),
            });
        }
        adj[from].push(to);
        indeg[to] += 1;
    }
    for (i, knot) in def.knots.iter().enumerate() {
        for port in ports_of(&knot.kind) {
            if port.dir != PortDir::In || !required(&knot.kind, port.name, port.required) {
                continue;
            }
            let connected = fan.contains(&(i, port.name));
            let exported = external.contains(&(knot.id.clone(), String::from(port.name)));
            if !connected && !exported {
                return Err(ValidationError::UnconnectedRequired {
                    knot_id: knot.id.clone(),
                    port: String::from(port.name),
                });
            }
        }
    }
    let mut queue: Vec<usize> = indeg
        .iter()
        .enumerate()
        .filter_map(|(i, d)| (*d == 0).then_some(i))
        .collect();
    let mut seen = 0usize;
    while let Some(node) = queue.pop() {
        seen += 1;
        for &next in &adj[node] {
            indeg[next] -= 1;
            if indeg[next] == 0 {
                queue.push(next);
            }
        }
    }
    if seen != def.knots.len() {
        let at_knot = indeg
            .iter()
            .position(|d| *d != 0)
            .map(|i| def.knots[i].id.clone());
        return Err(ValidationError::Cycle { at_knot });
    }
    validate_domains(def, &index, external)?;
    Ok(())
}

fn validate_kind(knot: &crate::KnotDef) -> Result<(), ValidationError> {
    if ports_of(&knot.kind).is_empty() {
        return Err(ValidationError::InvalidParameter {
            knot_id: knot.id.clone(),
            parameter: "arity",
            reason: "unsupported port arity",
        });
    }
    validate_kind_domains(knot)?;
    match &knot.kind {
        KnotKind::Constant { domain, value } => {
            validate_signal_parameter(knot, "value", *domain, *value)?;
        }
        KnotKind::Compare {
            domain,
            rhs_const: Some(value),
            ..
        } => validate_signal_parameter(knot, "rhs_const", *domain, *value)?,
        KnotKind::Map {
            domain,
            in_min,
            in_max,
            out_min,
            out_max,
        }
        | KnotKind::Digitize {
            domain,
            in_min,
            in_max,
            out_min,
            out_max,
            ..
        } => {
            validate_signal_parameter(knot, "in_min", *domain, *in_min)?;
            validate_signal_parameter(knot, "in_max", *domain, *in_max)?;
            validate_signal_parameter(knot, "out_min", *domain, *out_min)?;
            validate_signal_parameter(knot, "out_max", *domain, *out_max)?;
        }
        KnotKind::Threshold {
            domain, high, low, ..
        } => {
            validate_signal_parameter(knot, "high", *domain, *high)?;
            validate_signal_parameter(knot, "low", *domain, *low)?;
        }
        KnotKind::Clamp { domain, min, max } => {
            validate_signal_parameter(knot, "min", *domain, *min)?;
            validate_signal_parameter(knot, "max", *domain, *max)?;
        }
        _ => {}
    }

    let invalid = match &knot.kind {
        KnotKind::Digitize { steps: 0, .. } => Some(("steps", "must be greater than zero")),
        KnotKind::Digitize { in_min, in_max, .. } | KnotKind::Map { in_min, in_max, .. }
            if in_min > in_max =>
        {
            Some(("in_min", "must not exceed in_max"))
        }
        KnotKind::Threshold {
            high,
            low,
            use_hysteresis: true,
            ..
        } if low > high => Some(("low", "must not exceed high when hysteresis is enabled")),
        KnotKind::Clamp { min, max, .. } if min > max => Some(("min", "must not exceed max")),
        _ => None,
    };
    if let Some((parameter, reason)) = invalid {
        return Err(ValidationError::InvalidParameter {
            knot_id: knot.id.clone(),
            parameter,
            reason,
        });
    }
    Ok(())
}

fn validate_kind_domains(knot: &crate::KnotDef) -> Result<(), ValidationError> {
    let invalid = match &knot.kind {
        KnotKind::Compare { domain, op, .. } if !op.supports_domain(*domain) => Some((
            "domain",
            "comparison operator does not support the selected domain",
        )),
        KnotKind::Calc { domain, .. }
        | KnotKind::Map { domain, .. }
        | KnotKind::Abs { domain }
        | KnotKind::Neg { domain }
        | KnotKind::Digitize { domain, .. }
        | KnotKind::Threshold { domain, .. }
        | KnotKind::Random { domain, .. }
        | KnotKind::Sqrt { domain }
        | KnotKind::Clamp { domain, .. }
            if !domain.is_numeric() =>
        {
            Some(("domain", "must be Level or Count"))
        }
        KnotKind::Convert { from, to } if from == to => {
            Some(("domain", "conversion domains must differ"))
        }
        _ => None,
    };
    if let Some((parameter, reason)) = invalid {
        return Err(ValidationError::InvalidParameter {
            knot_id: knot.id.clone(),
            parameter,
            reason,
        });
    }
    Ok(())
}

fn validate_signal_parameter(
    knot: &crate::KnotDef,
    parameter: &'static str,
    domain: SignalDomain,
    value: Signal,
) -> Result<(), ValidationError> {
    #[cfg(feature = "signal-f32")]
    if !value.is_finite() {
        return Err(invalid_signal_parameter(knot, parameter, "must be finite"));
    }

    if domain == SignalDomain::Bool && value != ZERO && value != ONE {
        return Err(invalid_signal_parameter(
            knot,
            parameter,
            "must be ZERO or ONE for Bool domain",
        ));
    }

    #[cfg(feature = "signal-f32")]
    if domain == SignalDomain::Count {
        let wide = f64::from(value);
        if wide < f64::from(i32::MIN) || wide > f64::from(i32::MAX) {
            return Err(invalid_signal_parameter(
                knot,
                parameter,
                "must fit in i32 for Count domain",
            ));
        }
        if (value as i32) as f32 != value {
            return Err(invalid_signal_parameter(
                knot,
                parameter,
                "must be a whole number for Count domain",
            ));
        }
    }

    Ok(())
}

fn invalid_signal_parameter(
    knot: &crate::KnotDef,
    parameter: &'static str,
    reason: &'static str,
) -> ValidationError {
    ValidationError::InvalidParameter {
        knot_id: knot.id.clone(),
        parameter,
        reason,
    }
}

// Union-find domain inference: Variable ports on one knot must unify, and each
// thread unions its source and sink. Compare knots with rhs_const relax the
// required rhs port before this pass runs.
fn validate_domains(
    def: &WeaveDef,
    index: &BTreeMap<&str, usize>,
    external: &BTreeSet<(String, String)>,
) -> Result<(), ValidationError> {
    let mut inference = DomainInference::default();
    let mut nodes: BTreeMap<(usize, PortSlot), usize> = BTreeMap::new();
    let mut variables: BTreeMap<(usize, u8), (usize, &'static str)> = BTreeMap::new();
    let mut active = BTreeSet::new();

    for (knot_index, knot) in def.knots.iter().enumerate() {
        for port in ports_of(&knot.kind) {
            let constraint = require_port_domain(knot, port.slot)?;
            let domain = match constraint {
                PortDomain::Fixed(domain) => Some(domain),
                PortDomain::Variable(_) | PortDomain::Any => None,
            };
            let node = inference.make_set(domain);
            nodes.insert((knot_index, port.slot), node);

            if let PortDomain::Variable(variable) = constraint {
                active.insert(node);
                if let Some(&(first, first_port)) = variables.get(&(knot_index, variable)) {
                    let ports = (first_port, port.name);
                    validate_variable_domains(&mut inference, first, node, knot, ports)?;
                } else {
                    variables.insert((knot_index, variable), (node, port.name));
                }
            }
        }
    }

    for thread in &def.threads {
        let from_index = index[thread.from.knot.as_str()];
        let to_index = index[thread.to.knot.as_str()];
        let from_slot = port_slot(&def.knots[from_index].kind, &thread.from.port)
            .expect("ports were checked before domain validation");
        let to_slot = port_slot(&def.knots[to_index].kind, &thread.to.port)
            .expect("ports were checked before domain validation");
        let from_node = nodes[&(from_index, from_slot)];
        let to_node = nodes[&(to_index, to_slot)];
        active.insert(from_node);
        active.insert(to_node);
        if let Some((from_domain, to_domain)) = inference.union(from_node, to_node) {
            return Err(ValidationError::SignalDomainMismatch {
                from_knot: thread.from.knot.clone(),
                from_port: thread.from.port.clone(),
                from_domain,
                to_knot: thread.to.knot.clone(),
                to_port: thread.to.port.clone(),
                to_domain,
            });
        }
    }

    let mut external_nodes = Vec::new();
    for (knot_id, port_name) in external {
        let knot_index = index[knot_id.as_str()];
        let slot = port_slot(&def.knots[knot_index].kind, port_name)
            .expect("pattern exports were checked before domain validation");
        let node = nodes[&(knot_index, slot)];
        active.insert(node);
        external_nodes.push(node);
    }
    let deferred: BTreeSet<usize> = external_nodes
        .into_iter()
        .map(|node| inference.find(node))
        .collect();

    for (knot_index, knot) in def.knots.iter().enumerate() {
        for port in ports_of(&knot.kind) {
            let node = nodes[&(knot_index, port.slot)];
            if !active.contains(&node) {
                continue;
            }
            validate_resolved_domain(&mut inference, node, &deferred, &knot.id, port.name)?;
        }
    }

    Ok(())
}

fn require_port_domain(
    knot: &crate::KnotDef,
    slot: PortSlot,
) -> Result<PortDomain, ValidationError> {
    port_domain(&knot.kind, slot).ok_or_else(|| ValidationError::InvalidParameter {
        knot_id: knot.id.clone(),
        parameter: "domain",
        reason: "port has no domain constraint",
    })
}

fn validate_variable_domains(
    inference: &mut DomainInference,
    first: usize,
    node: usize,
    knot: &crate::KnotDef,
    ports: (&str, &str),
) -> Result<(), ValidationError> {
    if let Some((from_domain, to_domain)) = inference.union(first, node) {
        return Err(ValidationError::SignalDomainMismatch {
            from_knot: knot.id.clone(),
            from_port: String::from(ports.0),
            from_domain,
            to_knot: knot.id.clone(),
            to_port: String::from(ports.1),
            to_domain,
        });
    }
    Ok(())
}

fn validate_resolved_domain(
    inference: &mut DomainInference,
    node: usize,
    deferred: &BTreeSet<usize>,
    knot_id: &str,
    port: &str,
) -> Result<(), ValidationError> {
    let root = inference.find(node);
    if inference.nodes[root].domain.is_none() && !deferred.contains(&root) {
        return Err(ValidationError::UnresolvedSignalDomain {
            knot_id: String::from(knot_id),
            port: String::from(port),
        });
    }
    Ok(())
}

#[derive(Copy, Clone)]
struct DomainNode {
    parent: usize,
    rank: u8,
    domain: Option<SignalDomain>,
}

#[derive(Default)]
struct DomainInference {
    nodes: Vec<DomainNode>,
}

impl DomainInference {
    fn make_set(&mut self, domain: Option<SignalDomain>) -> usize {
        let index = self.nodes.len();
        self.nodes.push(DomainNode {
            parent: index,
            rank: 0,
            domain,
        });
        index
    }

    fn find(&mut self, node: usize) -> usize {
        let parent = self.nodes[node].parent;
        if parent != node {
            let root = self.find(parent);
            self.nodes[node].parent = root;
        }
        self.nodes[node].parent
    }

    fn union(&mut self, left: usize, right: usize) -> Option<(SignalDomain, SignalDomain)> {
        let mut left_root = self.find(left);
        let mut right_root = self.find(right);
        if left_root == right_root {
            return None;
        }

        let left_domain = self.nodes[left_root].domain;
        let right_domain = self.nodes[right_root].domain;
        if let (Some(left_domain), Some(right_domain)) = (left_domain, right_domain) {
            if left_domain != right_domain {
                return Some((left_domain, right_domain));
            }
        }

        if self.nodes[left_root].rank < self.nodes[right_root].rank {
            core::mem::swap(&mut left_root, &mut right_root);
        }
        self.nodes[right_root].parent = left_root;
        self.nodes[left_root].domain = left_domain.or(right_domain);
        if self.nodes[left_root].rank == self.nodes[right_root].rank {
            self.nodes[left_root].rank = self.nodes[left_root].rank.saturating_add(1);
        }
        None
    }
}

fn check_port(knot: &crate::KnotDef, name: &str, expected: PortDir) -> Result<(), ValidationError> {
    let ports = ports_of(&knot.kind);
    let info =
        ports
            .iter()
            .find(|p| p.name == name)
            .ok_or_else(|| ValidationError::UnknownPort {
                knot_id: knot.id.clone(),
                port: String::from(name),
                expected: ports.iter().map(|p| String::from(p.name)).collect(),
            })?;
    if info.dir != expected {
        return Err(ValidationError::WrongPortDirection {
            knot_id: knot.id.clone(),
            port: String::from(name),
            expected,
            actual: info.dir,
        });
    }
    Ok(())
}

fn required(kind: &KnotKind, port: &str, catalog: bool) -> bool {
    match kind {
        KnotKind::Compare { rhs_const, .. } if port == "rhs" => rhs_const.is_none(),
        KnotKind::Random {
            require_gate: true, ..
        } if port == "gate" => true,
        _ => catalog,
    }
}

fn budget_limit(
    metric: &'static str,
    actual: usize,
    limit: usize,
    knot: Option<&str>,
) -> Result<(), ValidationError> {
    if actual > limit {
        return Err(ValidationError::BudgetExceeded {
            metric,
            actual: actual as u32,
            limit: limit as u32,
            at_knot: knot.map(String::from),
        });
    }
    Ok(())
}

fn delay_ticks(kind: &KnotKind) -> u16 {
    match kind {
        KnotKind::Delay { ticks } => *ticks,
        _ => 0,
    }
}

#[cfg(test)]
mod tests {
    use std::collections::BTreeSet;

    use super::{
        require_port_domain, validate_resolved_domain, validate_variable_domains, DomainInference,
    };
    use crate::{KnotDef, KnotKind, PortSlot, SignalDomain, ValidationError};

    fn select_knot() -> KnotDef {
        KnotDef {
            id: "select".into(),
            kind: KnotKind::select(),
        }
    }

    #[test]
    fn domain_inference_reports_internal_conflicts_and_unresolved_components() {
        let mut inference = DomainInference::default();
        let level = inference.make_set(Some(SignalDomain::Level));
        let boolean = inference.make_set(Some(SignalDomain::Bool));
        let select = select_knot();
        assert!(matches!(
            validate_variable_domains(
                &mut inference,
                level,
                boolean,
                &select,
                ("a", "b"),
            ),
            Err(ValidationError::SignalDomainMismatch {
                from_knot,
                from_port,
                to_knot,
                to_port,
                ..
            }) if from_knot == "select" && from_port == "a" && to_knot == "select" && to_port == "b"
        ));

        let unknown = inference.make_set(None);
        assert!(matches!(
            validate_resolved_domain(&mut inference, unknown, &BTreeSet::new(), "delay", "out"),
            Err(ValidationError::UnresolvedSignalDomain { knot_id, port })
                if knot_id == "delay" && port == "out"
        ));
        let deferred = BTreeSet::from([unknown]);
        assert!(
            validate_resolved_domain(&mut inference, unknown, &deferred, "delay", "out").is_ok()
        );
    }

    #[test]
    fn domain_inference_accepts_unified_nodes() {
        let mut inference = DomainInference::default();
        let first = inference.make_set(None);
        let second = inference.make_set(None);
        let select = select_knot();
        assert!(
            validate_variable_domains(&mut inference, first, second, &select, ("a", "b")).is_ok()
        );
        assert!(inference.union(first, second).is_none());
    }

    #[test]
    fn missing_catalog_domain_is_a_structured_validation_error() {
        assert!(matches!(
            require_port_domain(&select_knot(), PortSlot::new(u8::MAX)),
            Err(ValidationError::InvalidParameter {
                knot_id,
                parameter: "domain",
                reason: "port has no domain constraint",
            }) if knot_id == "select"
        ));
    }
}