[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: string vs list processing
|
From: |
Michael Livshin |
|
Subject: |
Re: string vs list processing |
|
Date: |
16 Apr 2001 18:18:26 +0300 |
|
User-agent: |
Gnus/5.0807 (Gnus v5.8.7) XEmacs/21.1 (Crater Lake) |
address@hidden (Harvey J. Stein) writes:
> > ??? string-ref is of constant complexity, whereas list-ref is of
> > linear complexity.
>
> I was talking about (string-ref ... 0) vs (list-ref ... 0).
oy.
sorry!
--
... it's just that in C++ and the like, you don't trust _anybody_,
and in CLOS you basically trust everybody. the practical result
is that thieves and bums use C++ and nice people use CLOS.
-- Erik Naggum
Re: string vs list processing, Masao Uebayashi, 2001/04/16
- Re: string vs list processing, Sascha Ziemann, 2001/04/16
- Re: string vs list processing, Masao Uebayashi, 2001/04/16
- Re: string vs list processing, Michael Livshin, 2001/04/16
- Re: string vs list processing, Bill Gribble, 2001/04/16
- Re: string vs list processing, Michael Livshin, 2001/04/16
- SRFI-13 again [was: Re: string vs list processing], Martin Grabmueller, 2001/04/17
- Re: SRFI-13 again [was: Re: string vs list processing], Dirk Herrmann, 2001/04/19
- Re: SRFI-13 again [was: Re: string vs list processing], Martin Grabmueller, 2001/04/19
- Re: SRFI-13 again [was: Re: string vs list processing], Marius Vollmer, 2001/04/20