Viewing profile — jxndnxu

How would if have helped? You either design a DFA by hand or use a compiled from a regular language

You have answered your question yourself: your algorithm looks at each byte twice, not once It's even more obvious in the UTF case where the classic implementation first looks at 1…

My understanding of the article's use of scalable was "fixed overhead more or less regardless of the complexity of the state machine and input" not "fastest implementation availabl…

Because classic wc is not iterating over every byte once, but multiple times. It's especially obvious in the Unicode case where it first takes 1-4 bytes to get a Unicode character …