mirror of
https://github.com/storytold/harfbuzz.git
synced 2026-11-21 06:51:01 +01:00
Contextual GSUB dependency collection revisits completed lookup states through each parent path. Complex Nastaliq lookup graphs therefore spend minutes repeatedly expanding identical subgraphs. Intern the recursion inputs and cache completed states per top-level lookup. Remove unused contextual stack bookkeeping and avoid temporary set allocation for exact intersection checks. Re-enable the Nastaliq closure-parity fixtures now that they complete quickly. Tested with the full Meson test suite (270/270 passed). Assisted-by: OpenAI Codex <codex@openai.com>