Is it literally making every possible CaPs CoMBiNatIoN for all retrievable data? To me this sounds rather costly and would explain why case insensitivity would be slower. But this also doesn't sound like typical behavoir. I'd imagine it would instead automagically produce all lowercase data (and a lowercase match string).
Now if this is what Perl really does, why would it be slow? Just kind of curious how case insensitivity really works and why it's costly.
Thanks wise monks.
In reply to Slowness of /i by sulfericacid
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |