Re: Google Summer of Code 2007 : Improve regexp performance

2007-03-16 Thread Nicolas Weber
Hi, A multithreaded matcher might be useful to vim but do we have a need for fuzzy matching ? vim doesn't use threads at the moment, and Bram seems to be reluctant to include threads for various reasons. Bye, Nico

Re: Google Summer of Code 2007 : Improve regexp performance

2007-03-16 Thread Nikolai Weibull
On 3/16/07, Asiri Rathnayake [EMAIL PROTECTED] wrote: On Fri, 2007-03-16 at 10:44 +0100, Nicolas Weber wrote: A multithreaded matcher might be useful to vim but do we have a need for fuzzy matching ? vim doesn't use threads at the moment, and Bram seems to be reluctant to include

Re: Google Summer of Code 2007 : Improve regexp performance

2007-03-16 Thread Asiri Rathnayake
On Fri, 2007-03-16 at 12:03 +0100, Nikolai Weibull wrote: On 3/16/07, Asiri Rathnayake [EMAIL PROTECTED] wrote: On Fri, 2007-03-16 at 10:44 +0100, Nicolas Weber wrote: A multithreaded matcher might be useful to vim but do we have a need for fuzzy matching ? vim doesn't use

Re: Google Summer of Code 2007 : Improve regexp performance

2007-03-16 Thread Bram Moolenaar
Nikolai Weibull wrote: On 3/15/07, Asiri Rathnayake [EMAIL PROTECTED] wrote: Hi all, I went through the above idea presented for google summer of code 2007 and found it interesting. In my opinion, incorporating Thompson NFA into regexp from the ground up is pretty cool. I also went

Re: Google Summer of Code 2007 : Improve regexp performance

2007-03-16 Thread Nikolai Weibull
On 3/16/07, Bram Moolenaar [EMAIL PROTECTED] wrote: Nikolai Weibull wrote: I actually wrote a simplification of his library, removing the approximate matching stuff, as part of my master's, which is well documented. I still haven't had time to put up the PDF, though. Interesting.

Re: Google Summer of Code 2007 : Improve regexp performance

2007-03-16 Thread Asiri Rathnayake
On Fri, 2007-03-16 at 14:08 +0100, Martin Stubenschrott wrote: On Thu, Mar 15, 2007 at 11:28:45PM +0530, Asiri Rathnayake wrote: Hi all, I went through the above idea presented for google summer of code 2007 and found it interesting. In my opinion, incorporating Thompson NFA into

Google Summer of Code 2007 : Improve regexp performance

2007-03-15 Thread Asiri Rathnayake
Hi all, I went through the above idea presented for google summer of code 2007 and found it interesting. In my opinion, incorporating Thompson NFA into regexp from the ground up is pretty cool. I also went through the alternate TRE (http://laurikari.net/tre/index.html) but couldn't verify whether

Re: Google Summer of Code 2007 : Improve regexp performance

2007-03-15 Thread Bram Moolenaar
Asiri Rathnayake wrote: I went through the above idea presented for google summer of code 2007 and found it interesting. In my opinion, incorporating Thompson NFA into regexp from the ground up is pretty cool. I also went through the alternate TRE (http://laurikari.net/tre/index.html) but

Re: Google Summer of Code 2007 : Improve regexp performance

2007-03-15 Thread Nikolai Weibull
On 3/15/07, Asiri Rathnayake [EMAIL PROTECTED] wrote: Hi all, I went through the above idea presented for google summer of code 2007 and found it interesting. In my opinion, incorporating Thompson NFA into regexp from the ground up is pretty cool. I also went through the alternate TRE

Re: Google Summer of Code 2007 : Improve regexp performance

2007-03-15 Thread Mikolaj Machowski
Dnia piątek 16 marzec 2007, Asiri Rathnayake napisał: A multithreaded matcher might be useful to vim but do we have a need for fuzzy matching ? For main regexp engine I think not. But it could be useful for command line completions (think zsh). m.