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

Re^2: Unefficient Regexp 'Matching this or that'

by pelagic (Priest)
on May 19, 2010 at 09:33 UTC ( #840648=note: print w/replies, xml ) Need Help??

in reply to Re: Unefficient Regexp 'Matching this or that'
in thread Unefficient Regexp 'Matching this or that'

Here goes my test for your suggestion:
Benchmark: timing 3 iterations of 20.two_string, 30.two_string_lookahe +ad... 20.two_string: 236 wallclock secs (234.31 usr + 1.62 sys = 235.93 CPU +) @ 0.01/s (n=3) 30.two_string_lookahead: 178 wallclock secs (176.23 usr + 1.52 sys = +177.75 CPU) @ 0.02/s (n=3)
So it's better, but still not linear ...


Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://840648]
[LanX]: every path must have l left and r right edges and l and r are fixed and l+r is the height
[LanX]: simple recursive function which goes left and right till l or r are exhausted
LanX #solved
[oiskuu]: I must watch Police Academy again sometime.
[Discipulus]: thanks all
[LanX]: ?

How do I use this? | Other CB clients
Other Users?
Others having an uproarious good time at the Monastery: (7)
As of 2018-03-19 11:26 GMT
Find Nodes?
    Voting Booth?
    When I think of a mole I think of:

    Results (239 votes). Check out past polls.