would something with a for loop and substr be faster? I dont necessarily have to unpack any bytes, do I?
That requires a call into C (substr) for every byte; where using unpack requires a single call for the entire string.
The cardinal rule for optimising Perl code, is to get perl's built-ins to do as much of the work as you can.
Using this loop:
++$seen[ ord chop $buf ] while length $buf;
in place of the unpack loop is almost but not quite as fast.
It trades 2 built-in calls per byte, against the cost of building the unpack return list on the stack, and loses by a hair.
With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
In the absence of evidence, opinion is indistinguishable from prejudice.
| 