Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change
 
PerlMonks  

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

by BoredByPolitics (Scribe)
on Jan 24, 2001 at 20:49 UTC ( #54030=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

Hmm, good suggestion, but these are the results I get -

Benchmark: timing 10000000 iterations of comp, exist, regex, regexo... comp: 53 wallclock secs (53.96 usr + 0.00 sys = 53.96 CPU) exist: 49 wallclock secs (49.23 usr + 0.00 sys = 49.23 CPU) regex: 78 wallclock secs (77.40 usr + 0.00 sys = 77.40 CPU) regexo: 78 wallclock secs (77.12 usr + 0.00 sys = 77.12 CPU)

As you can see regexo isn't showing much difference. Could this be because I'm using /^[A..Z]$/o instead of your suggested /^[A-Z]$/o, or are they functionally equivalent?

Pete

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (3)
As of 2022-01-25 04:02 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    In 2022, my preferred method to securely store passwords is:












    Results (65 votes). Check out past polls.

    Notices?