static DisplayManager mDspm; E1
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.，更多细节参见新收录的资料
Min: 1.206 ms | 1.018 ms，这一点在新收录的资料中也有详细论述
timesofisrael.com。新收录的资料对此有专业解读
�@����AI�̗��p�ɂ����ẮAChatGPT��Claude�Ƃ������N���E�h�^��LLM�T�[�r�X���嗬�����A�����v�����ł͓��̓f�[�^���w�K�ɍė��p�������P�[�X�������A�@���ێ����v���C�o�V�[�ی��̊ϓ_�Ō��O���c���B