yes, all longest regex matches in linear time is possible

The post addresses a fundamental gap in regex engines: even 'linear time' engines like RE2, Go, and Rust become quadratic when finding all matches via iteration. Using the example pattern `.*a|b` against a string of b's, it demonstrates how repeated full-haystack scans produce O(n²) work, and argues that academic theory's focus on single yes/no matching has left this practical problem unaddressed.