use std::collections::BTreeSet;
const FIRST: usize = 120;
const LAST: usize = 253;
pub fn declared(src: &str) -> Vec<String> {
first_sightings(src, &["\\newcounter", "\\newtheorem"])
}
fn names_after(src: &str, command: &str) -> Vec<String> {
let mut out = Vec::new();
let mut rest = src;
while let Some(at) = rest.find(command) {
let after = &rest[at + command.len()..];
rest = after;
if after.starts_with(|c: char| c.is_ascii_alphabetic()) {
continue;
}
let after = after.trim_start_matches(['*', ' ', '\t', '\n']);
let Some(body) = after.strip_prefix('{') else {
continue;
};
let Some(end) = body.find('}') else { continue };
let name = body[..end].trim();
if !name.is_empty() && name.chars().all(|c| c.is_ascii_alphanumeric() || c == '@') {
out.push(name.to_string());
}
}
out
}
pub fn mentioned(src: &str) -> Vec<String> {
const COMMANDS: [&str; 13] = [
"\\newcounter",
"\\newtheorem",
"\\setcounter",
"\\addtocounter",
"\\stepcounter",
"\\refstepcounter",
"\\value",
"\\arabic",
"\\roman",
"\\Roman",
"\\alph",
"\\Alph",
"\\fnsymbol",
];
first_sightings(src, &COMMANDS)
}
fn first_sightings(src: &str, commands: &[&str]) -> Vec<String> {
let found =
crate::parallel::map_ordered(commands, src.len(), |command| names_after(src, command));
let mut seen = BTreeSet::new();
let mut out = Vec::new();
for name in found.into_iter().flatten() {
if seen.insert(name.clone()) {
out.push(name);
}
}
out
}
fn kernel_counters() -> Vec<String> {
let mut out = Vec::new();
let mut rest = super::PRELUDE;
while let Some(at) = rest.find("\\@ctrreg{") {
let after = &rest[at + "\\@ctrreg{".len()..];
rest = after;
let Some(end) = after.find('}') else { continue };
out.push(after[..end].to_string());
}
out
}
pub fn allocations(src: &str) -> String {
let declared = declared(src);
let mut out = String::new();
for (index, name) in declared.iter().enumerate() {
let register = FIRST + index;
if register > LAST {
out.push_str(&format!(
"% {name}: no register left (TeX has {LAST}); it will fail loudly when stepped.\n"
));
continue;
}
out.push_str(&format!("\\@ctrreg{{{name}}}{{{register}}}\n"));
}
let known: BTreeSet<String> = kernel_counters().into_iter().chain(declared).collect();
for name in mentioned(src) {
if known.contains(&name) {
continue;
}
out.push_str(&format!(
"\\@namedef{{ctr@{name}}}#1#2{{}}\
\\expandafter\\let\\csname cl@{name}\\endcsname\\@empty\n"
));
}
if out.is_empty() {
return out;
}
format!("% This document's counters -- see src/latex/counters.rs.\n{out}")
}
#[cfg(test)]
mod tests {
#[test]
fn declared_counters_are_found_in_both_spellings() {
let src = r"\newcounter{step}\newtheorem{lemma}{Lemma}\newcounter {gap}[step]";
assert_eq!(super::declared(src), ["step", "gap", "lemma"]);
}
#[test]
fn a_longer_command_is_not_this_one() {
assert!(super::declared(r"\newcounterish{x}").is_empty());
}
#[test]
fn allocations_start_past_the_kernel_block() {
let out = super::allocations(r"\newcounter{step}");
assert_eq!(out.lines().last().unwrap(), r"\@ctrreg{step}{120}");
}
#[test]
fn a_counter_named_but_never_declared_is_given_a_write_that_does_nothing() {
let out = super::allocations(r"\setcounter{a}{1}");
assert!(out.contains(r"\@namedef{ctr@a}#1#2{}"), "{out}");
assert!(!super::allocations(r"\setcounter{page}{1}").contains("ctr@page"));
}
}