Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re^3: regex to find vowels in anyorder

by BrowserUk (Pope)
on Dec 19, 2011 at 16:50 UTC ( #944277=note: print w/replies, xml ) Need Help??


in reply to Re^2: regex to find vowels in anyorder
in thread regex to find vowels in anyorder

Even excluding IO, I cannot discern any appreciable difference either. @words contains 178,000 words:

[0] Perl> $c =0; $t = time; m[(?=.*a)(?=.*e)(?=.*i)(?=.*o)(?=.*u)] and + ++$c for @words; printf "Found $c matches in %.5f seconds\n", (time( +)-$t);; Found 1905 matches in 0.14288 seconds [0] Perl> $c =0; $t = time; m[(?=.*a)(?=.*e)(?=.*i)(?=.*o)(?=.*u)] and + ++$c for @words; printf "Found $c matches in %.5f seconds\n", (time()-$t);; Found 1905 matches in 0.12593 seconds [0] Perl> $c =0; $t = time; m[(?=.*a)(?=.*e)(?=.*i)(?=.*o)(?=.*u)] and + ++$c for @words; printf "Found $c matches in %.5f seconds\n", (time()-$t);; Found 1905 matches in 0.13659 seconds [0] Perl> $c =0; $t = time; m[(?=.*a)(?=.*e)(?=.*i)(?=.*o)(?=.*u)] and + ++$c for @words; printf "Found $c matches in %.5f seconds\n", (time()-$t);; Found 1905 matches in 0.14437 seconds [0] Perl> $c =0; $t = time; m[(?=.*a)(?=.*e)(?=.*i)(?=.*o)(?=.*u)] and + ++$c for @words; printf "Found $c matches in %.5f seconds\n", (time()-$t);; Found 1905 matches in 0.13993 seconds [0] Perl> $c =0; $t = time; m[(?=.*a)(?=.*e)(?=.*i)(?=.*o)(?=.*u)] and + ++$c for @words; printf "Found $c matches in %.5f seconds\n", (time()-$t);; Found 1905 matches in 0.13856 seconds [0] Perl> $c =0; $t = time; m[^(?=.*a)(?=.*e)(?=.*i)(?=.*o)(?=.*u)] an +d ++$c for @words; printf "Found $c matches in %.5f seconds\n", (time()-$t);; Found 1905 matches in 0.13786 seconds [0] Perl> $c =0; $t = time; m[^(?=.*a)(?=.*e)(?=.*i)(?=.*o)(?=.*u)] an +d ++$c for @words; printf "Found $c matches in %.5f seconds\n", (time()-$t);; Found 1905 matches in 0.13947 seconds [0] Perl> $c =0; $t = time; m[^(?=.*a)(?=.*e)(?=.*i)(?=.*o)(?=.*u)] an +d ++$c for @words; printf "Found $c matches in %.5f seconds\n", (time()-$t);; Found 1905 matches in 0.12269 seconds [0] Perl> $c =0; $t = time; m[^(?=.*a)(?=.*e)(?=.*i)(?=.*o)(?=.*u)] an +d ++$c for @words; printf "Found $c matches in %.5f seconds\n", (time()-$t);; Found 1905 matches in 0.13944 seconds [0] Perl> $c =0; $t = time; m[(?=^.*a)(?=^.*e)(?=^.*i)(?=^.*o)(?=^.*u) +] and ++$c for @words; printf "Found $c matches in %.5f seconds\n", (time()-$t);; Found 1905 matches in 0.12400 seconds [0] Perl> $c =0; $t = time; m[(?=^.*a)(?=^.*e)(?=^.*i)(?=^.*o)(?=^.*u) +] and ++$c for @words; printf "Found $c matches in %.5f seconds\n", (time()-$t);; Found 1905 matches in 0.14011 seconds [0] Perl> $c =0; $t = time; m[(?=^.*a)(?=^.*e)(?=^.*i)(?=^.*o)(?=^.*u) +] and ++$c for @words; printf "Found $c matches in %.5f seconds\n", (time()-$t);; Found 1905 matches in 0.13754 seconds [0] Perl> $c =0; $t = time; m[(?=^.*a)(?=^.*e)(?=^.*i)(?=^.*o)(?=^.*u) +] and ++$c for @words; printf "Found $c matches in %.5f seconds\n", (time()-$t);; Found 1905 matches in 0.13191 seconds

With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.

The start of some sanity?

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (1)
As of 2021-10-27 04:11 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    My first memorable Perl project was:







    Results (91 votes). Check out past polls.

    Notices?