Nice to hear from you!
On 5/31/07, Ian Young [EMAIL PROTECTED] wrote:
Hi all,
I'm Ian, one of the two students working on improving the regexp
engine in Vim for this year's Google Summer of Code. I haven't had a
whole lot to contribute as of yet, but now that work is underway, I'll
On Tue, 2007-05-01 at 18:16 -0500, James Longstreet wrote:
Hello,
I'm wondering if any of the Summer of Code winners are tackling the
regex performance thing suggested here: http://www.vim.org/soc/ideas.php
Bram said two students are working on this, but you are welcome to help
them (i
On Mon, 2007-04-23 at 11:34 +0200, Martin Stubenschrott wrote:
I am sorry, if this kind of messages are highly despised on this list.
But since vim-users are my main target group,
I created a new Firefox extension, which makes browsing the web feel
like browsing a vim buffer:
Nikolai,
As you might know, the reg_comp() method is called twice when compiling
a r.e; first to determine the size of the compiled expression and then
to actually compile it. I was thinking if this can be used to our
advantage, while on the first pass, we look for occurrences of special
On Thu, 2007-03-22 at 09:26 +0100, Nikolai Weibull wrote:
On 3/22/07, Asiri Rathnayake [EMAIL PROTECTED] wrote:
As you might know, the reg_comp() method is called twice when compiling
a r.e; first to determine the size of the compiled expression and then
to actually compile it. I
On Thu, 2007-03-22 at 22:21 +0100, Bram Moolenaar wrote:
Adding a third matcher won't happen soon, and is a big change. It's not
really needed to prepare for that.
The disadvantage of using a function pointer is that in the place where
it's used you only see:
This mail bounced off for some reason, I'm repeating it. Sorry if you've
already got this.
-
Hi Bram, Nikolai, All,
I think the best way to understand current implementation of regxp is to
first go through Henry Spencer's original regxp implementation ( thanks
nikolai ). It's
Hi Bram,Nikolai,
I went through the regxp code and have a few questions...
First, Why use this kind of a coding scheme and encode patterns rather
than using a state diagram ? ( Performance/Memory ? ). Secondly, is it a
requirement that the new implementation has to follow the same method ?
I
Hi Bram, Nicolai,
I'm unable to grasp the description ( attachment ) given in the regxp.c
file. For a moment they seem like NFA fragments for operators |,+,* and
so on, but then again I'm in doubt ( specially i don't understand what a
node in this context is ). A little help is greatly
On Mon, 2007-03-19 at 11:55 +0100, Nikolai Weibull wrote:
On 3/19/07, Asiri Rathnayake [EMAIL PROTECTED] wrote:
Hi Bram, Nicolai,
A 'k' would be greatly appreciated.
I'm really really sorry, won't happen again...
I'm unable to grasp the description ( attachment ) given in the regxp.c
On Sun, 2007-03-18 at 08:28 +0100, Asim Imdad wrote:
Hi,
I was think of rewriting code base of vim in java. What kind of
problems do you people think I can face? Already there is another
project known as jvi. How much faithful it is to true vim design?
AI
I have seen gedit integrated to
Bram,
I read several articles on possible NFA implementations ( took some time
to understand ). But I think implementing an NFA based approach is quite
possible ( Russ Cox has provided a sample implementation in his
article ). But I'm having a hard time understanding the existing
approach taken
On Sun, 2007-03-18 at 14:07 +0100, Nikolai Weibull wrote:
On 3/18/07, Asiri Rathnayake [EMAIL PROTECTED] wrote:
I read several articles on possible NFA implementations ( took some time
to understand ). But I think implementing an NFA based approach is quite
possible ( Russ Cox has
On Sun, 2007-03-18 at 15:07 +0100, Bram Moolenaar wrote:
Asiri Rathanayake wrote:
I read several articles on possible NFA implementations ( took some time
to understand ). But I think implementing an NFA based approach is quite
possible ( Russ Cox has provided a sample implementation in
On Sun, 2007-03-18 at 17:32 +0100, Nikolai Weibull wrote:
On 3/18/07, Asiri Rathnayake [EMAIL PROTECTED] wrote:
On Sun, 2007-03-18 at 14:07 +0100, Nikolai Weibull wrote:
Then there's the parallel one that keeps track of all the states that
we're currently in that accepts as soon
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
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
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
18 matches
Mail list logo
