"be consistent" | |
PerlMonks |
Re^3: Count byte/character occurrence (1/4)by BrowserUk (Patriarch) |
on Apr 04, 2016 at 21:05 UTC ( [id://1159557]=note: print w/replies, xml ) | Need Help?? |
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: 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.
"Science is about questioning the status quo. Questioning authority". I knew I was on the right track :)
In the absence of evidence, opinion is indistinguishable from prejudice.
In Section
Seekers of Perl Wisdom
|
|