Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
 
PerlMonks  

Re: Faster way to do this?

by Anonymous Monk
on Nov 12, 2015 at 17:22 UTC ( [id://1147595]=note: print w/replies, xml ) Need Help??


in reply to Faster way to do this?

Well, tr appears to win if the 'M' is a common occurrence.

#! /usr/bin/perl -lw sub cnt_a { my ($count, $str) = (0, shift); ++$count while ($str =~ /(M+)/g); $count; } sub cnt_b { my ($count, $str) = (0, shift); ++$count while ($str =~ /M+/g); $count; } sub cnt_c { int (() = shift =~ /M+/g) } sub cnt_y { shift =~ y///csr =~ y/M// } use Benchmark qw(cmpthese); my @S = qw(I M O X); # my @S = map chr, 0..255; our $str = pack "(a)*", map $S[rand @S], 1..100000; print for map $_->($str), qw(CORE::length cnt_a cnt_b cnt_c cnt_y); cmpthese -3, { a => 'cnt_a($str)', b => 'cnt_b($str)', c => 'cnt_c($str)', y => 'cnt_y($str)', }

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others sharing their wisdom with the Monastery: (5)
As of 2024-04-23 18:03 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found