Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

Re^3: Weighted frequency of characters in an array of strings

by Anonymous Monk
on Jun 08, 2016 at 09:02 UTC ( [id://1165134]=note: print w/replies, xml ) Need Help??


in reply to Re^2: Weighted frequency of characters in an array of strings
in thread Weighted frequency of characters in an array of strings

substr and chop do only one thing, which means they're much faster than regex engine

Also while...=~/(.)/g; is fastest written as  for  split '',...;,

For a sea of benchmarks/topic/"explanations" about these tricks see Re: How to make this substitutions without splitting the strings? (compute not reckon)

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://1165134]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others about the Monastery: (2)
As of 2024-04-26 04:21 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found