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


In reply to Re: Re: Re: Implement uclast with a regex by dada
in thread Implement uclast with a regex by Anonymous Monk

Title:
Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post, it's "PerlMonks-approved HTML":



  • Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
  • Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
  • Read Where should I post X? if you're not absolutely sure you're posting in the right place.
  • Please read these before you post! —
  • Posts may use any of the Perl Monks Approved HTML tags:
    a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
  • You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
            For:     Use:
    & &amp;
    < &lt;
    > &gt;
    [ &#91;
    ] &#93;
  • Link using PerlMonks shortcuts! What shortcuts can I use for linking?
  • See Writeup Formatting Tips and other pages linked from there for more info.