blacksky-algorithms/rsky
the last two rows are where we lose, and it’s not close - regex uses Teddy/SIMD for literals and short alternations, and we simply don’t have that yet. the case-insensitive row is the opposite story: regex falls back to an NFA when case-insensitivity with (?i) blows up the state space, dropping to 0.03 MiB/s. yes, that 16,833x number is real - this is exactly the NFA slowdown i described in the previous post. it’s not a contrived input, just case-insensitive matching on a dictionary. O(n * m) is technically “linear in n”, but when m blows up it stops feeling linear real fast.
，这一点在新收录的资料中也有详细论述
FT Digital Edition: our digitised print edition
Последние новости
，详情可参考新收录的资料
Путин провел телефонный разговор с Трампом. О чем говорили президенты?23:48, 9 марта 2026，详情可参考新收录的资料
Мир Российская Премьер-лига|20-й тур