Re: Inexplicably slow regex

This is an archived low-energy page for bots and other anonmyous visitors. Please sign up if you are a human and want to interact.

I don't have an answer to your question but could you show your benchmarks for those regular expressions?

Comment on Re: Inexplicably slow regex

Replies are listed 'Best First'.
Re^2: Inexplicably slow regex by hgolden (Pilgrim) on Sep 12, 2006 at 14:26 UTC
I'd also be interested in seeing the benchmarks. I can add one thing: the last Regex isn't the same as the others because the `[^\n]` character class is (accidently) a negated character class. Rearranging it to `[\n^]` should fix that. Hays	[reply] [d/l] [select]
Re^3: Inexplicably slow regex by Anonymous Monk on Sep 12, 2006 at 14:52 UTC
Nothing accidental about the negation of that character class. I'm using it with a negative look-behind assertion. It's supposed to mean: "If it's not true that the preceding character is not a linebreak". So it's either a linebreak or there's nothing there at all (beginning of string). Processing a file approximately 0.5MB in size, using gettimeofday for timing, I get First version: 0.7 seconds Second version: 0.003 seconds Third version: 0.03 seconds My actual regexes are slightly more complicated than the examples given so I see little speed difference between #2 and #3.	[reply]
Re^4: Inexplicably slow regex by Anonymous Monk on Sep 12, 2006 at 16:55 UTC
You may wish to show your actual regex, as that's the likely source of the issue.	[reply]
Re^5: Inexplicably slow regex by Anonymous Monk on Sep 12, 2006 at 18:37 UTC

• hippo

• erzuuli

‥ Anonymous Monks are no longer allowed to use Super Search, due to an excessive use of this resource by robots.


Come for the quick hacks, stay for the epiphanies.
	PerlMonks