From: Richard Fateman
Subject: how fast can you make (member x y :test 'eq)?
Date: 
Message-ID: <VeSXl.20140$D32.8847@flpi146.ffdc.sbc.com>
A paper on code bumming for "MEMQ"
is here:  http://www.cs.berkeley.edu/~fateman/papers/lispoptim.pdf
Comments welcome.
RJF

From: Slobodan Blazeski
Subject: Re: how fast can you make (member x y :test 'eq)?
Date: 
Message-ID: <3a78fc5d-9ff1-4a45-ace9-6b35a181c346@l12g2000yqo.googlegroups.com>
On Jun 10, 7:48 pm, Richard Fateman <·······@cs.berkeley.edu> wrote:
> A paper on code bumming for "MEMQ"
> is here:  http://www.cs.berkeley.edu/~fateman/papers/lispoptim.pdf
> Comments welcome.
> RJF

Nice work though I wonder how useful it is to improve cl speed when
dog slow languages fear better then lisp by far.

bobi
From: Pascal J. Bourguignon
Subject: Re: how fast can you make (member x y :test 'eq)?
Date: 
Message-ID: <7chbyn2nj5.fsf@pbourguignon.anevia.com>
Slobodan Blazeski <·················@gmail.com> writes:

> On Jun 10, 7:48�pm, Richard Fateman <·······@cs.berkeley.edu> wrote:
>> A paper on code bumming for "MEMQ"
>> is here: �http://www.cs.berkeley.edu/~fateman/papers/lispoptim.pdf
>> Comments welcome.
>> RJF
>
> Nice work though I wonder how useful it is to improve cl speed when
> dog slow languages fear better then lisp by far.

We don't compare to dog slow languages, but to C or C++

-- 
__Pascal Bourguignon__