The Hidden Cost of Regex Recompilation in Loops

While regex matching is fast in Go's RE2 engine, compiling a new pattern for every loop iteration is expensive. This article reveals that the 90x performance gap between hand-written scanning and dynamic regex isn't about the matching algorithm, but compilation overhead in hot loops. The broader insight: profile before optimizing, because premature assumptions can mask genuine bottlenecks.