Let me try decompile/understand what's going on here,
One obvious improvement is using /o, right?
The other is unwinding foreach loop into linear list of matches, what is the gain in that? We avoid walking the array, but I never thought that operation is that costly?
Is this what's going on or am I missing something?
In reply to Re^3: Matching against list of patterns
by Eyck
in thread Matching against list of patterns
by Eyck
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |