use std::cmp::Ordering;
i ran some comparisons on state representation width - 16-bit state IDs fit noticeably better into CPU cache than wider ones, and if you’re hitting 64K+ states you’re probably better off splitting into two simpler patterns anyway. one design decision i’m happy with is that when the engine hits a limit - state capacity, lookahead context distance - it returns an error instead of silently falling back to a slower algorithm. as the benchmarks above show, “falling back” can mean a 1000x+ slowdown, and i’d rather you know about it than discover it in production. RE# will either give you fast matching or tell you it can’t.，推荐阅读新收录的资料获取更多信息
另外OpenClaw本身也需要相当好性能的电脑才能运行的比较流畅，低配电脑就别想了。。关于这个话题，新收录的资料提供了深入分析
Find the full break down on My Obsidian Note-Taking Workflow.。新收录的资料对此有专业解读