use super::map::{ImportMap, SourceRule};
use crate::workspace::owners::{PathMatch, matcher};
use ignore::WalkBuilder;
use std::collections::BTreeSet;
use std::path::Path;
#[derive(Debug, Clone)]
pub struct Unit {
pub rule: usize,
pub source: String,
pub main: String,
pub chapters: Vec<String>,
pub attachments: Vec<String>,
}
const MAIN_NAMES: &[&str] = &["index.md", "README.md", "readme.md", "00-index.md", "_index.md"];
fn all_files(root: &Path) -> Vec<String> {
WalkBuilder::new(root)
.hidden(false)
.require_git(false)
.filter_entry(|e| e.file_name() != ".git")
.build()
.flatten()
.filter(|e| e.file_type().is_some_and(|t| t.is_file()))
.filter_map(|e| e.path().strip_prefix(root).ok().map(|p| p.to_string_lossy().replace('\\', "/")))
.collect()
}
fn bundle(files: &[String], dir: &str) -> Option<(String, Vec<String>, Vec<String>)> {
let prefix = format!("{dir}/");
let inside: Vec<&String> = files.iter().filter(|f| f.starts_with(&prefix)).collect();
let main = MAIN_NAMES
.iter()
.map(|n| format!("{dir}/{n}"))
.find(|m| inside.contains(&m))
.or_else(|| inside.iter().filter(|f| f.ends_with(".md")).min().map(|s| s.to_string()))?;
let chapters = inside.iter().filter(|f| f.ends_with(".md") && **f != &main).map(|s| s.to_string()).collect();
let attachments = inside.iter().filter(|f| !f.ends_with(".md")).map(|s| s.to_string()).collect();
Some((main, chapters, attachments))
}
pub fn expand(root: &Path, map: &ImportMap) -> Vec<Unit> {
let files = all_files(root);
let mut claimed: BTreeSet<String> = BTreeSet::new();
let mut out = vec![];
for (ri, rule) in map.sources.iter().enumerate() {
out.extend(expand_rule(&files, ri, rule, &mut claimed));
}
out
}
fn expand_rule(files: &[String], ri: usize, rule: &SourceRule, claimed: &mut BTreeSet<String>) -> Vec<Unit> {
let dir_mode = rule.glob.ends_with('/');
let Some(m) = matcher(rule.glob.trim_end_matches('/')) else { return vec![] };
let exclude: Vec<PathMatch> = rule.exclude.iter().filter_map(|e| matcher(e)).collect();
let skip = |p: &str, claimed: &BTreeSet<String>| exclude.iter().any(|e| e.is_match(p)) || claimed.contains(p);
let mut out = vec![];
if dir_mode {
let mut dirs: BTreeSet<String> = BTreeSet::new();
for f in files {
let mut parts: Vec<&str> = f.split('/').collect();
parts.pop();
for n in 1..=parts.len() {
let d = parts[..n].join("/");
if m.is_match(&d) {
dirs.insert(d);
}
}
}
for d in dirs {
if skip(&d, claimed) {
continue;
}
if let Some((main, chapters, attachments)) = bundle(files, &d) {
for f in files.iter().filter(|f| f.starts_with(&format!("{d}/"))) {
claimed.insert(f.clone());
}
claimed.insert(d.clone());
out.push(Unit { rule: ri, source: d, main, chapters, attachments });
}
}
return out;
}
for f in files {
if !m.is_match(f) || skip(f, claimed) {
continue;
}
claimed.insert(f.clone());
let (mut chapters, mut attachments) = (vec![], vec![]);
if rule.sibling_dir {
let dir = f.trim_end_matches(".md");
for g in files.iter().filter(|g| g.starts_with(&format!("{dir}/"))) {
claimed.insert(g.clone());
if g.ends_with(".md") { chapters.push(g.clone()) } else { attachments.push(g.clone()) }
}
}
out.push(Unit { rule: ri, source: f.clone(), main: f.clone(), chapters, attachments });
}
out
}