Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic
 
PerlMonks  

Re: Re: Re: Implement uclast with a regex

by dada (Chaplain)
on Mar 10, 2004 at 10:01 UTC ( #335403=note: print w/replies, xml ) Need Help??


in reply to Re: Re: Implement uclast with a regex
in thread Implement uclast with a regex

no I didn't, it was just a guess :-) and in fact, it seems the double reverse solution is faster for small strings, while the substr solution wins in the long run. anyway, here you get full benchmark:
use strict; use List::Util qw(shuffle); use Benchmark qw(:all); my $string = "ACta"; print "*** ", length($string), " characters\n"; cmpthese(1_000_000, { uclast_substr => sub { uclast_substr($string) }, uclast_2reverse => sub { uclast_2reverse($string) }, }); $string = join ("", shuffle( 'A'..'Z', 'a'..'z' )); print "*** ", length($string), " characters\n"; cmpthese(1_000_000, { uclast_substr => sub { uclast_substr($string) }, uclast_2reverse => sub { uclast_2reverse($string) }, }); $string .= join ("", shuffle( 'A'..'Z', 'a'..'z' )); $string .= join ("", shuffle( 'A'..'Z', 'a'..'z' )); $string .= join ("", shuffle( 'A'..'Z', 'a'..'z' )); print "*** ", length($string), " characters\n"; cmpthese(1_000_000, { uclast_substr => sub { uclast_substr($string) }, uclast_2reverse => sub { uclast_2reverse($string) }, }); $string .= join ("", shuffle( 'A'..'Z', 'a'..'z' )); $string .= join ("", shuffle( 'A'..'Z', 'a'..'z' )); $string .= join ("", shuffle( 'A'..'Z', 'a'..'z' )); $string .= join ("", shuffle( 'A'..'Z', 'a'..'z' )); $string .= join ("", shuffle( 'A'..'Z', 'a'..'z' )); $string .= join ("", shuffle( 'A'..'Z', 'a'..'z' )); $string .= join ("", shuffle( 'A'..'Z', 'a'..'z' )); $string .= join ("", shuffle( 'A'..'Z', 'a'..'z' )); $string .= join ("", shuffle( 'A'..'Z', 'a'..'z' )); print "*** ", length($string), " characters\n"; cmpthese(1_000_000, { uclast_substr => sub { uclast_substr($string) }, uclast_2reverse => sub { uclast_2reverse($string) }, }); sub uclast_substr { my($string) = @_; $string = lc(substr($string, 0, length($string)-1)) . uc(substr($string, -1, 1)); return $string; } sub uclast_2reverse { my($string) = @_; $string = reverse ucfirst lc reverse $string; return $string; }
and here the result:
*** 4 characters
                    Rate   uclast_substr uclast_2reverse
uclast_substr   566572/s              --            -15%
uclast_2reverse 666223/s             18%              --
*** 52 characters
                    Rate   uclast_substr uclast_2reverse
uclast_substr   470588/s              --             -6%
uclast_2reverse 500000/s              6%              --
*** 208 characters
                    Rate uclast_2reverse   uclast_substr
uclast_2reverse 249938/s              --             -9%
uclast_substr   273523/s              9%              --
*** 676 characters
                    Rate uclast_2reverse   uclast_substr
uclast_2reverse 102239/s              --            -19%
uclast_substr   126231/s             23%              --
cheers,
Aldo

King of Laziness, Wizard of Impatience, Lord of Hubris

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others having an uproarious good time at the Monastery: (5)
As of 2022-01-25 15:27 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    In 2022, my preferred method to securely store passwords is:












    Results (66 votes). Check out past polls.

    Notices?