Dug up this historic example from glibc of why optimizing compilers are a necessary mitigation against hideous code: https://sourceware.org/git/?p=glibc.git;a=blob;f=string/strstr.c;hb=0ecb606cb6cf65de1d9fc8a919bceb4be476c602 …
-
-
What they all seem to have in common is utilizing an order relation on the alphabet/charset/code units.
-
This makes it difficult (likely impossible) to adapt them to matching fnmatch/glob/wildcard type search patterns, even without *.
End of conversation
New conversation -
-
-
Great link! Thanks. What is musl implementing?
-
Two-way, which modern glibc also uses. glibc refrains from turning on the shift-table optimization for <32-char searches tho...
-
...so (last I checked) musl is considerably faster for needles close to but under 32 bytes.
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.