use std::collections::BTreeSet;
pub fn numbered_header(names: &[String]) -> Vec<(String, Option<String>)> {
let mut taken: BTreeSet<String> = names.iter().map(|name| name.to_lowercase()).collect();
let mut seen: BTreeSet<String> = BTreeSet::new();
let mut read: Vec<(String, Option<String>)> = Vec::new();
for name in names {
if seen.insert(name.to_lowercase()) {
read.push((name.clone(), None));
continue;
}
let numbered = next_free(name, &taken);
taken.insert(numbered.to_lowercase());
read.push((numbered, Some(name.clone())));
}
read
}
fn next_free(name: &str, taken: &BTreeSet<String>) -> String {
(1..)
.map(|number| format!("{name}_{number}"))
.find(|candidate| !taken.contains(&candidate.to_lowercase()))
.unwrap_or_default()
}