XPost: comp.lang.scheme

Frank Buss wrote:

(defun split-backward (number &optional (base 10))
(loop while (< 0 number) collect
(multiple-value-bind (quotient remainder) (floor number base)
(setf number quotient)
remainder)))

LOOP is ok, but I wonder if there is a more elegant contruct like REDUCE
for the opposite concept for building a list. Building the list should not need more program code characters than reducing the list.

Testing:

* (split-backward 1984)

(4 8 9 1)


Gauche Scheme

(use srfi-1) ; unfold

(unfold zero? (cut mod <> 10) (cut quotient <> 10) 1984)
===>
(4 8 9 1)

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)