gobby-code 1.3.3

use super::super::*;
use super::modules::prompt_component_ids_for_module;
use std::collections::{BTreeMap, BTreeSet, VecDeque};

pub(crate) fn build_architecture_doc(
    files: &[FileDoc],
    modules: &[ModuleDoc],
    graph_edges: &[CodewikiGraphEdge],
    leading_chunks: &BTreeMap<String, LeadingChunk>,
    // Deterministic workspace system model (#891). When supplied, seeds the
    // model-derived topology / runtime-flow Mermaid diagrams; `None` (e.g. the
    // AI-off / test entry points) omits the diagram section entirely. The model
    // is the sole source for diagrams — they never read the code graph.
    system_model: Option<&SystemModel>,
    generate: &mut Option<&mut TextGenerator<'_>>,
    progress: &mut CodewikiProgress,
) -> ArchitectureDoc {
    // Decomposition starts at meaningful units — the subsystem roots (a
    // workspace's individual crates), not the directory container above
    // them — so subsystems and the layered narrative describe the same level.
    let file_paths = files
        .iter()
        .map(|file| file.path.clone())
        .collect::<Vec<_>>();
    let subsystem_names = cluster::subsystem_roots(&file_paths);
    // Graph availability is informational only and never degrades the
    // architecture page; the sole content-gap degradation is a failed
    // generation, recorded below.
    let mut degraded_sources = BTreeSet::new();

    let mut subsystems = Vec::new();
    let subsystem_modules = modules
        .iter()
        .filter(|module| subsystem_names.contains(&module.module))
        .collect::<Vec<_>>();
    let subsystem_total = subsystem_modules.len();
    for (index, module) in subsystem_modules.into_iter().enumerate() {
        let file_summaries = module
            .direct_files
            .iter()
            .map(|file| prompts::ChildSummary {
                name: file.path.clone(),
                summary: file.summary.clone(),
            })
            .collect::<Vec<_>>();
        let child_summaries = module
            .child_modules
            .iter()
            .map(|module| prompts::ChildSummary {
                name: module.module.clone(),
                summary: module.summary.clone(),
            })
            .collect::<Vec<_>>();
        let fallback =
            structural_module_summary(&module.module, &module.direct_files, &module.child_modules);
        let source_spans = collect_link_spans(&module.direct_files, &module.child_modules);
        let prompt_component_ids = prompt_component_ids_for_module(files, &module.module);
        let sources = ranked_source_excerpts(
            files.iter().filter(|file| {
                file.module == module.module || module_is_ancestor(&module.module, &file.module)
            }),
            leading_chunks,
            SUBSYSTEM_SOURCE_EXCERPTS,
        );
        progress.emit(format!(
            "generating architecture doc subsystem {}/{} {}",
            index + 1,
            subsystem_total,
            module.module
        ));
        let generated = maybe_generate(
            generate,
            &prompts::architecture_prompt(
                &module.module,
                &file_summaries,
                &child_summaries,
                &prompt_component_ids,
                &sources,
            ),
            prompts::ARCHITECTURE_SYSTEM,
            PromptTier::Aggregate,
        );
        let responsibility = match generated {
            Generation::Generated(generated) => {
                let citations = citation_list(&source_spans, &generated);
                ground_text(&generated, &source_spans, Some(&citations))
            }
            fallback_generation => {
                // Only an attempted-and-failed generation is a degradation;
                // structural output is the intent when no generator runs.
                if fallback_generation.failed() {
                    degraded_sources.insert("model-unavailable".to_string());
                }
                ground_text(&fallback, &source_spans, None)
            }
        };

        subsystems.push(ArchitectureSubsystem {
            module: module.module.clone(),
            responsibility,
            child_modules: module
                .child_modules
                .iter()
                .map(|child| child.module.clone())
                .collect(),
            source_spans,
        });
    }

    let source_spans = subsystems
        .iter()
        .flat_map(|subsystem| subsystem.source_spans.iter().cloned())
        .collect::<BTreeSet<_>>()
        .into_iter()
        .collect::<Vec<_>>();

    // Layered narrative over the subsystem responsibilities and the
    // cross-subsystem dependency edges.
    let subsystem_edges = collect_subsystem_dependency_edges(&subsystem_names, files, graph_edges)
        .into_iter()
        .collect::<Vec<_>>();
    let narrative = if subsystems.is_empty() {
        None
    } else {
        progress.emit("generating architecture narrative");
        let subsystem_summaries = subsystems
            .iter()
            .map(|subsystem| prompts::ChildSummary {
                name: subsystem.module.clone(),
                summary: subsystem.responsibility.clone(),
            })
            .collect::<Vec<_>>();
        match maybe_generate(
            generate,
            &prompts::architecture_narrative_prompt(&subsystem_summaries, &subsystem_edges),
            prompts::ARCHITECTURE_NARRATIVE_SYSTEM,
            PromptTier::Aggregate,
        ) {
            Generation::Generated(generated) => {
                let citations = citation_list(&source_spans, &generated);
                Some(ground_text(&generated, &source_spans, Some(&citations)))
            }
            Generation::Failed => {
                degraded_sources.insert("model-unavailable".to_string());
                None
            }
            Generation::Skipped => None,
        }
    };

    // Model-seeded architectural diagrams (#891). Rendered deterministically
    // from the workspace SystemModel and pre-validated by the renderer's
    // valid-Mermaid gate; a sparse model or an invalid block yields `None`,
    // which is normal and never touches `degraded_sources`.
    let diagrams = system_model.and_then(render_architecture_diagrams);

    // Deterministic service matrix from the same model: the at-a-glance
    // required/degraded picture an evaluator needs. Same non-degrading contract
    // as the diagrams — a model with no services yields `None`.
    let service_matrix = system_model.and_then(render_service_matrix);

    ArchitectureDoc {
        source_spans,
        subsystems,
        narrative,
        diagrams,
        service_matrix,
        degraded_sources: degraded_sources.into_iter().collect(),
    }
}

/// Source excerpts per subsystem stay below the module-brief budget because
/// the architecture page rolls every subsystem into one document.
const SUBSYSTEM_SOURCE_EXCERPTS: usize = 2;

pub(super) fn module_dependency_edges(
    graph_edges: &[CodewikiGraphEdge],
    component_modules: &BTreeMap<String, String>,
    module_names: &BTreeSet<String>,
) -> BTreeSet<(String, String)> {
    graph_edges
        .iter()
        .filter(|edge| edge.kind == CodewikiGraphEdgeKind::Import)
        .filter_map(|edge| {
            let source = component_modules.get(&edge.source_component_id)?;
            let target = component_modules.get(&edge.target_component_id)?;
            (source != target && module_names.contains(source) && module_names.contains(target))
                .then(|| (source.clone(), target.clone()))
        })
        .collect()
}

/// Assigns deterministic topological ranks for module dependency ordering.
pub(super) fn dependency_topology(
    module_names: &BTreeSet<String>,
    module_edges: &BTreeSet<(String, String)>,
) -> BTreeMap<String, usize> {
    let mut dependency_count = module_names
        .iter()
        .map(|module| (module.clone(), 0usize))
        .collect::<BTreeMap<_, _>>();
    let mut dependents = module_names
        .iter()
        .map(|module| (module.clone(), BTreeSet::<String>::new()))
        .collect::<BTreeMap<_, _>>();

    for (source, target) in module_edges {
        if let Some(count) = dependency_count.get_mut(source) {
            *count += 1;
        }
        dependents
            .entry(target.clone())
            .or_default()
            .insert(source.clone());
    }

    let mut ready = dependency_count
        .iter()
        .filter_map(|(module, count)| (*count == 0).then_some(module.clone()))
        .collect::<VecDeque<_>>();
    let mut rank = BTreeMap::new();
    while let Some(module) = ready.pop_front() {
        if rank.contains_key(&module) {
            continue;
        }
        rank.insert(module.clone(), rank.len());
        for dependent in dependents.get(&module).into_iter().flatten() {
            let Some(count) = dependency_count.get_mut(dependent) else {
                continue;
            };
            *count = count.saturating_sub(1);
            if *count == 0 {
                ready.push_back(dependent.clone());
            }
        }
    }

    for module in module_names {
        if !rank.contains_key(module) {
            rank.insert(module.clone(), rank.len());
        }
    }
    rank
}