git-parsec 0.1.0

use anyhow::Result;
use serde::{Deserialize, Serialize};
use std::collections::HashMap;

use crate::git;
use crate::worktree::Workspace;

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct FileConflict {
    pub file: String,
    pub worktrees: Vec<String>, // ticket IDs that modify this file
}

/// Detect files that are modified in multiple active worktrees.
///
/// For each workspace, gets the list of changed files relative to the base branch,
/// then finds files that appear in 2+ worktrees.
pub fn detect(workspaces: &[Workspace]) -> Result<Vec<FileConflict>> {
    // Map: filename -> list of ticket IDs that touch it
    let mut file_map: HashMap<String, Vec<String>> = HashMap::new();

    for ws in workspaces {
        // Skip non-active workspaces
        if ws.status != crate::worktree::WorkspaceStatus::Active {
            continue;
        }

        // Get merge-base between workspace branch and base branch
        // Run from the workspace path
        let merge_base = match git::get_merge_base(&ws.path, &ws.base_branch, "HEAD") {
            Ok(base) => base,
            Err(_) => continue, // Skip if can't determine merge base
        };

        // Get changed files
        let changed = match git::get_changed_files(&ws.path, &merge_base, "HEAD") {
            Ok(files) => files,
            Err(_) => continue,
        };

        for file in changed {
            file_map.entry(file).or_default().push(ws.ticket.clone());
        }
    }

    // Filter to only files touched by 2+ worktrees
    let mut conflicts: Vec<FileConflict> = file_map
        .into_iter()
        .filter(|(_, tickets)| tickets.len() > 1)
        .map(|(file, worktrees)| FileConflict { file, worktrees })
        .collect();

    // Sort by number of conflicting worktrees (descending), then by filename
    conflicts.sort_by(|a, b| {
        b.worktrees
            .len()
            .cmp(&a.worktrees.len())
            .then_with(|| a.file.cmp(&b.file))
    });

    Ok(conflicts)
}