Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical

Re: Re: Testing a string for a range of characters

by BoredByPolitics (Scribe)
on Jan 25, 2001 at 14:28 UTC ( #54232=note: print w/replies, xml ) Need Help??

in reply to Re: Testing a string for a range of characters
in thread Testing a string for a range of characters

I'm at home today, with a much slower machine (P166 64Mb, linux 2.2.18pre21, Perl 5.005_03), so I've reduced the number of iterations to a million.

These benchmarks are also with the compl routine checking the length() of the test character first, and with the regex fixed -

Benchmark: timing 1000000 iterations of compl, exist, regex, tr... compl: 17 wallclock secs (17.35 usr + 0.02 sys = 17.37 CPU) exist: 15 wallclock secs (14.02 usr + 0.01 sys = 14.03 CPU) regex: 18 wallclock secs (18.62 usr + 0.00 sys = 18.62 CPU) tr: 16 wallclock secs (16.67 usr + 0.01 sys = 16.68 CPU)

So, faster than the regex, but still not as fast as the exist() method. Thanks for the suggestion though :-)


Log In?

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

How do I use this? | Other CB clients
Other Users?
Others studying the Monastery: (2)
As of 2022-01-25 05:19 GMT
Find Nodes?
    Voting Booth?
    In 2022, my preferred method to securely store passwords is:

    Results (65 votes). Check out past polls.