bijux_cli/routing/

registry.rs

//! Routing registry, conflict handling, and introspection APIs.

use std::cmp::max;
use std::collections::{BTreeMap, BTreeSet};

use crate::contracts::{
    known_bijux_tool, known_bijux_tools, official_product_namespaces, CommandPath, Namespace,
    NamespaceMetadata,
};

/// Route target categories.
#[derive(Debug, Clone, PartialEq, Eq)]
pub enum RouteTarget {
    /// Built-in route target.
    BuiltIn,
    /// Plugin route target by namespace.
    Plugin(String),
}

/// Route resolution error categories.
#[derive(Debug, thiserror::Error, PartialEq, Eq)]
pub enum RouteError {
    /// Namespace is reserved.
    #[error("namespace is reserved: {0}")]
    Reserved(String),
    /// Namespace collides with existing route owner.
    #[error("namespace conflict: {0}")]
    Conflict(String),
    /// Route is unknown.
    #[error("unknown route: {0}")]
    Unknown(String),
    /// Ambiguous route due to multiple owners.
    #[error("ambiguous route: {0}")]
    Ambiguous(String),
}

/// Deterministic routing registry for built-ins and plugins.
#[derive(Debug, Clone)]
pub struct RouteRegistry {
    built_ins: BTreeSet<String>,
    plugin_namespaces: BTreeSet<String>,
    plugin_aliases: BTreeMap<String, String>,
    aliases: BTreeMap<String, String>,
    reserved: BTreeSet<String>,
}

impl Default for RouteRegistry {
    fn default() -> Self {
        let built_ins =
            super::model::built_in_route_paths().iter().cloned().collect::<BTreeSet<_>>();

        let aliases = super::model::alias_rewrites()
            .iter()
            .map(|(alias, canonical)| ((*alias).to_string(), (*canonical).to_string()))
            .collect::<BTreeMap<_, _>>();

        let mut reserved = BTreeSet::from([
            "apps".to_string(),
            "cli".to_string(),
            "help".to_string(),
            "version".to_string(),
            "doctor".to_string(),
            "repl".to_string(),
            "plugins".to_string(),
            "completion".to_string(),
            "inspect".to_string(),
        ]);
        reserved.extend(official_product_namespaces().iter().map(std::string::ToString::to_string));
        for tool in known_bijux_tools() {
            reserved.extend(tool.aliases.iter().map(|alias| (*alias).to_string()));
        }

        Self {
            built_ins,
            plugin_namespaces: BTreeSet::new(),
            plugin_aliases: BTreeMap::new(),
            aliases,
            reserved,
        }
    }
}

impl RouteRegistry {
    fn blocked_namespace_roots(&self) -> BTreeSet<String> {
        let mut blocked = BTreeSet::new();
        for route in &self.built_ins {
            if let Some(head) = route.split(' ').next() {
                blocked.insert(head.to_string());
            }
        }
        for alias in self.aliases.keys() {
            if let Some(head) = alias.split(' ').next() {
                blocked.insert(head.to_string());
            }
        }
        blocked
    }

    fn plugin_route_roots(&self) -> BTreeSet<String> {
        let mut routes = self.plugin_namespaces.clone();
        routes.extend(self.plugin_aliases.keys().cloned());
        routes
    }

    fn validate_plugin_root(&self, raw_namespace: &str) -> Result<String, RouteError> {
        let ns = normalize_namespace(raw_namespace);
        if self.reserved.contains(&ns) {
            return Err(RouteError::Reserved(ns));
        }

        if self.blocked_namespace_roots().contains(&ns) || self.plugin_route_roots().contains(&ns) {
            return Err(RouteError::Conflict(ns));
        }

        Ok(ns)
    }

    /// Register a plugin namespace with deterministic rejection rules.
    pub fn register_plugin_namespace(&mut self, raw_namespace: &str) -> Result<(), RouteError> {
        let ns = self.validate_plugin_root(raw_namespace)?;
        self.plugin_namespaces.insert(ns);
        Ok(())
    }

    /// Register a plugin namespace together with routed top-level aliases.
    pub fn register_plugin_namespace_with_aliases(
        &mut self,
        raw_namespace: &str,
        raw_aliases: &[String],
    ) -> Result<(), RouteError> {
        let namespace = self.validate_plugin_root(raw_namespace)?;
        let mut aliases = BTreeSet::new();
        for alias in raw_aliases {
            let normalized = self.validate_plugin_root(alias)?;
            if normalized == namespace {
                return Err(RouteError::Conflict(normalized));
            }
            if !aliases.insert(normalized.clone()) {
                return Err(RouteError::Conflict(normalized));
            }
        }

        self.plugin_namespaces.insert(namespace.clone());
        for alias in aliases {
            self.plugin_aliases.insert(alias, namespace.clone());
        }
        Ok(())
    }

    /// Resolve normalized command path to a route target.
    pub fn resolve(&self, normalized_path: &[String]) -> Result<RouteTarget, RouteError> {
        if normalized_path.is_empty() {
            return Err(RouteError::Unknown(String::new()));
        }

        let key = normalized_path.join(" ");
        let rewritten = self.aliases.get(&key).map_or(key.as_str(), String::as_str);

        if self.built_ins.contains(rewritten) {
            return Ok(RouteTarget::BuiltIn);
        }

        let root = rewritten.split(' ').next().unwrap_or_default();
        if self.plugin_namespaces.contains(root) {
            if self.built_ins.iter().any(|x| x.split(' ').next() == Some(root)) {
                return Err(RouteError::Ambiguous(root.to_string()));
            }
            return Ok(RouteTarget::Plugin(root.to_string()));
        }

        if let Some(namespace) = self.plugin_aliases.get(root) {
            return Ok(RouteTarget::Plugin(namespace.clone()));
        }

        Err(RouteError::Unknown(rewritten.to_string()))
    }

    /// Suggest nearest namespace for unknown routes.
    #[must_use]
    pub fn suggest_namespace(&self, raw: &str) -> Option<String> {
        let query = normalize_namespace(raw);
        let mut universe = BTreeSet::new();

        for route in &self.built_ins {
            if let Some(head) = route.split(' ').next() {
                universe.insert(head.to_string());
            }
        }
        for ns in &self.plugin_namespaces {
            universe.insert(ns.clone());
        }
        for alias in self.plugin_aliases.keys() {
            universe.insert(alias.clone());
        }
        for reserved in &self.reserved {
            universe.insert(reserved.clone());
        }

        universe.into_iter().max_by_key(|candidate| similarity_score(&query, candidate))
    }

    /// Build route-tree introspection payload.
    #[must_use]
    pub fn route_tree(&self) -> Vec<NamespaceMetadata> {
        let mut rows = Vec::new();

        for ns in &self.reserved {
            let owner = if let Some(tool) = known_bijux_tool(ns) {
                tool.runtime_binary()
            } else {
                "bijux-cli".to_string()
            };
            rows.push(NamespaceMetadata { name: Namespace(ns.clone()), reserved: true, owner });
        }

        for ns in &self.plugin_namespaces {
            rows.push(NamespaceMetadata {
                name: Namespace(ns.clone()),
                reserved: false,
                owner: "plugin".to_string(),
            });
        }
        for (alias, namespace) in &self.plugin_aliases {
            rows.push(NamespaceMetadata {
                name: Namespace(alias.clone()),
                reserved: false,
                owner: format!("plugin-alias:{namespace}"),
            });
        }

        rows.sort_by(|a, b| a.name.0.cmp(&b.name.0));
        rows
    }

    /// Render namespace tree lines for snapshot testing and diagnostics.
    #[must_use]
    pub fn render_command_tree(&self) -> String {
        let mut roots = BTreeSet::new();
        for route in &self.built_ins {
            if let Some(head) = route.split(' ').next() {
                roots.insert(head.to_string());
            }
        }
        for alias in self.aliases.keys() {
            if let Some(head) = alias.split(' ').next() {
                roots.insert(head.to_string());
            }
        }
        roots.insert("help".to_string());
        roots.extend(self.plugin_namespaces.iter().cloned());
        roots.extend(self.plugin_aliases.keys().cloned());

        let mut out = String::new();
        for root in roots {
            out.push_str(&root);
            out.push('\n');
        }
        out
    }

    /// Render built-in route paths for introspection.
    #[must_use]
    pub fn built_in_paths(&self) -> Vec<CommandPath> {
        self.built_ins
            .iter()
            .map(|raw| CommandPath {
                segments: raw.split(' ').map(|segment| Namespace(segment.to_string())).collect(),
            })
            .collect()
    }

    /// Render alias route rewrites for diagnostics introspection.
    #[must_use]
    pub fn alias_rewrites(&self) -> Vec<(CommandPath, CommandPath)> {
        self.aliases.iter().map(|(alias, canonical)| (to_path(alias), to_path(canonical))).collect()
    }

    /// Render plugin alias rewrites for diagnostics introspection.
    #[must_use]
    pub fn plugin_alias_rewrites(&self) -> Vec<(CommandPath, CommandPath)> {
        self.plugin_aliases
            .iter()
            .map(|(alias, namespace)| (to_path(alias), to_path(namespace)))
            .collect()
    }
}

fn similarity_score(left: &str, right: &str) -> usize {
    let prefix = common_prefix_len(left, right);
    // Bias toward shared prefix and low edit distance while keeping deterministic ordering.
    let distance = levenshtein_distance(left, right);
    let normalized = max(left.chars().count(), right.chars().count());
    (prefix * 1000) + normalized.saturating_sub(distance)
}

fn common_prefix_len(left: &str, right: &str) -> usize {
    left.chars().zip(right.chars()).take_while(|(a, b)| a == b).count()
}

fn levenshtein_distance(left: &str, right: &str) -> usize {
    let l: Vec<char> = left.chars().collect();
    let r: Vec<char> = right.chars().collect();
    if l.is_empty() {
        return r.len();
    }
    if r.is_empty() {
        return l.len();
    }

    let mut prev: Vec<usize> = (0..=r.len()).collect();
    let mut curr = vec![0; r.len() + 1];

    for (i, lc) in l.iter().enumerate() {
        curr[0] = i + 1;
        for (j, rc) in r.iter().enumerate() {
            let cost = usize::from(lc != rc);
            curr[j + 1] = (prev[j + 1] + 1).min(curr[j] + 1).min(prev[j] + cost);
        }
        prev.clone_from(&curr);
    }
    prev[r.len()]
}

fn normalize_namespace(input: &str) -> String {
    Namespace::normalize(input)
}

fn to_path(raw: &str) -> CommandPath {
    CommandPath { segments: raw.split(' ').map(|segment| Namespace(segment.to_string())).collect() }
}

#[cfg(test)]
mod tests {
    use super::{RouteRegistry, RouteTarget};

    #[test]
    fn registered_plugin_aliases_resolve_to_their_namespace() {
        let mut registry = RouteRegistry::default();
        registry
            .register_plugin_namespace_with_aliases(
                "alpha",
                &[String::from("alpha-short"), String::from("alpha-tools")],
            )
            .expect("plugin aliases should register");

        let alias_route = registry
            .resolve(&["alpha-short".to_string(), "run".to_string()])
            .expect("plugin alias should resolve");
        assert_eq!(alias_route, RouteTarget::Plugin("alpha".to_string()));
        assert!(registry
            .route_tree()
            .iter()
            .any(|row| row.name.0 == "alpha-short" && row.owner == "plugin-alias:alpha"));
    }

    #[test]
    fn suggestions_include_registered_plugin_aliases() {
        let mut registry = RouteRegistry::default();
        registry
            .register_plugin_namespace_with_aliases("alpha", &[String::from("alpha-short")])
            .expect("plugin alias should register");
        assert_eq!(registry.suggest_namespace("alph-short").as_deref(), Some("alpha-short"));
    }
}