[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: request for a new function, say, `sequence'
From: |
Richard Stallman |
Subject: |
Re: request for a new function, say, `sequence' |
Date: |
Thu, 03 Apr 2003 17:52:18 -0500 |
How about the following implementation:
(defun number-sequence (from &optional to)
"Return a sequence of numbers from FROM to TO (both inclusive) as a
list.
The Nth element of the list is (+ FROM N) where N counts from zero.
If TO is nil, it defaults to FROM.
If TO is less than FROM, the value is nil."
(unless to
(setq to from))
(let ((seq nil))
(while (>= to from)
(push to seq)
(setq to (1- to)))
seq))
That is much cleaner. However, to do the right thing with floats,
it should count up from FROM and then call nreverse.
- Re: request for a new function, say, `sequence', Kenichi Handa, 2003/04/02
- Re: request for a new function, say, `sequence', Miles Bader, 2003/04/02
- Re: request for a new function, say, `sequence',
Richard Stallman <=
- Re: request for a new function, say, `sequence', Thien-Thi Nguyen, 2003/04/03
- Re: request for a new function, say, `sequence', Vinicius Jose Latorre, 2003/04/03
- Re: request for a new function, say, `sequence', Richard Stallman, 2003/04/05
- Re: request for a new function, say, `sequence', Vinicius Jose Latorre, 2003/04/04
- Re: request for a new function, say, `sequence', Richard Stallman, 2003/04/05
- Re: request for a new function, say, `sequence', Kenichi Handa, 2003/04/08
Re: request for a new function, say, `sequence', Richard Stallman, 2003/04/04