Re: Relative performance of comparable regular expressions

2009-01-13 Thread Chris Rebert
etters. Cheers, Chris -- Follow the path of the Iguana... http://rebertia.com > > -Original Message- > From: John Machin [ > ] > Sent: Tuesday, January 13, 2009 11:15 > To: [email protected] > Subject: Re: Relative performance of comparable regular expressio

RE: Relative performance of comparable regular expressions

2009-01-13 Thread Barak, Ron
[email protected] Subject: Re: Relative performance of comparable regular expressions On Jan 13, 7:24 pm, "Barak, Ron" wrote: > Hi, > > I have a question about relative performance of comparable regular > expressions. > > I have large log files that start with thr

Re: Relative performance of comparable regular expressions

2009-01-13 Thread Steve Holden
John Machin wrote: > On Jan 13, 7:24 pm, "Barak, Ron" wrote: >> Hi, >> >> I have a question about relative performance of comparable regular >> expressions. >> >> I have large log files that start with three letters month names >> (

Re: Relative performance of comparable regular expressions

2009-01-13 Thread John Machin
On Jan 13, 7:24 pm, "Barak, Ron" wrote: > Hi, > > I have a question about relative performance of comparable regular > expressions. > > I have large log files that start with three letters month names > (non-unicode). > > Which would give better performan

Relative performance of comparable regular expressions

2009-01-13 Thread Barak, Ron
Hi, I have a question about relative performance of comparable regular expressions. I have large log files that start with three letters month names (non-unicode). Which would give better performance, matching with "^[a-zA-Z]{3}", or with "^\S{3}" ? Also, which is better