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.
But to actually make something here, we’re going to need to look into the standard in more details than that. So I started with looking at US Patent 2,304,081, granted December 8, 1942, in the midst of World War 2. Unfortunately, this patent has a lot of nice diagrams, but is focused on the broad concept, not the specifics of the standard adopted in 1951.，更多细节参见新收录的资料
。新收录的资料对此有专业解读
Some games might even find a way to make both types of backend operation part of their design. Imagine an always-online MMO style game where server-authoritative data is critical. Now imagine a standalone offline side-story that uses the same gameplay mechanics and systems. The same C# code powers both modes, but is used in drastically different ways.
She said disabled people who want to get into acting shouldn't be deterred by the idea that disabled actors would be "fighting for the same jobs".，详情可参考新收录的资料
Equal (2): Everything in this space must be equal to 2. The answer is 1-2, placed horizontally; 2-3, placed horizontally.