will be accepted is limited, thus write a good
application!
For more information about the Google Summer of Code program, you can
visit this page: http://code.google.com/soc/
Students should plan to submit their applications by March 24, 2007.
--
ARTHUR:I command you as King of the
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,
On 3/16/07, Nikolai Weibull <[EMAIL PROTECTED]> wrote:
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
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.
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
> > rege
On Friday 16 March 2007 01:54, A.J.Mechelynck wrote:
> Josh wrote:
>> any ideas about why support was dropped for kvim.
>
> My guess is: no one at kde wanted to go on doing it.
> Maybe they ran into too
> many snags and didn't think it was worth it.
The KVim development team found some unsurmo
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
> regexp from the ground up is pretty cool. I also w
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 ?
>
> >
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
On Fri, 2007-03-16 at 10:44 +0100, Nicolas Weber wrote:
> 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.
I too agre
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
On 3/16/07, Mikolaj Machowski <[EMAIL PROTECTED]> wrote:
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 completio
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.
hnayake 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
On Thu, 2007-03-15 at 23:35 +0100, Nikolai Weibull wrote:
nikolai,
> 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
Josh wrote:
any ideas about why support was dropped for kvim.
My guess is: no one at kde wanted to go on doing it. Maybe they ran into too
many snags and didn't think it was worth it.
Also if debugger
support can be added to vim then i wouldn't be as interested in
porting it to kde.
I thi
Josh wrote:
I am interested in creating a kde or other window manager interface
for vim, adding debugger support or fixing bugs for google summer of
code. Are there any details that I need to know before I submit my
applications?
It may be obvious, but obvious things have a way of getting
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
Dnia czwartek 15 marzec 2007, Josh napisał:
> I am interested in creating a kde or other window manager interface
> for vim,
While I'd like to see kvim resurrection with complete KDE integration
it is pointless at the moment: KDE3 is near its end, KDE4 isn't ready
yet for serious coding.
Howeve
Josh wrote:
> I am interested in creating a kde or other window manager interface
> for vim, adding debugger support or fixing bugs for google summer of
> code. Are there any details that I need to know before I submit my
> applications?
Read the FAQ and the page on "
I am interested in creating a kde or other window manager interface
for vim, adding debugger support or fixing bugs for google summer of
code. Are there any details that I need to know before I submit my
applications?
--
Josh
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/tr
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
wh
ok, thanks still trying to figure out what i will be doing this summer.
--
Josh
Josh wrote:
> will the vim project be doing google summer of code? if they are, who
> should i email about products?
I sumitted an application. Now waiting for approval.
--
"My particular problem is with registry entries, which seem to just accumulate
like plastic
will the vim project be doing google summer of code? if they are, who
should i email about products?
--
Josh
26 matches
Mail list logo
