�@�����y�[�W�ł́A���������فE���p�ق̋Ɩ����A�W���i�Ȃǂ́u���W�E�ۊǁv�u���畁�y�v�u���������v�u�W���v��4�����A���l�ڕW�����߂��͓̂W�����Ƃ̂݁B�����͊ق̉^�c���S�̖̂�3���ɉ߂����A���̑��ɂ��Ă͉^�c�����t���Ȃǁu���������ƍ��̗\�Z���[�u�v�����Ɛ������Ă����B
too many for an Excel file sure but
。heLLoword翻译是该领域的重要参考
For more information you can review our Terms of Service
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.