It's a value judgement. I thought you valued a routine that works on arbitrary input. You value speed. Evidently, creating the array in my routine is an expensive proposition.
I don't have time right now, but try recasting my algorithm to use index or substr. If you're really pressed for speed, a short XS routine should do the trick.
• another intruder with the mooring in the heart of the Perl
In reply to Re^5: bit pattern to bit position mapping
by grinder
in thread bit pattern to bit position mapping
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |