tag:blogger.com,1999:blog-9140180332652418576.post6537927816281130930..comments2008-12-01T19:23:33.095-07:00TECHHEADhttp://www.blogger.com/profile/18441232171642024472noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-9140180332652418576.post-19384056130859235152008-12-01T19:23:33.095-07:002008-12-01T19:23:33.095-07:00My apologies. I should have included a usage example. The function that MAP-BEUST-SEQUENCE expects is intended to respond to the next number in the sequence (eg. print it out or set to some variable). Here is an example that will count the entire base 10 sequence and output the largest number.<BR/><BR/>(defparameter *x* 0)<BR/>(map-beust-sequence<BR/>  (lambda (x) (setf *x* x))<BR/>  10000000000)<BR/>(format t &quot;~d&quot; *x*)Jonathan Hawkeshttp://www.blogger.com/profile/18441232171642024472noreply@blogger.comtag:blogger.com,1999:blog-9140180332652418576.post-24645088135908096302008-11-20T18:17:50.081-07:002008-11-20T18:17:50.081-07:00I believe there is a missing argument in the lisp example at line 11, map-beust-sequence expects a function and a max.<BR/><BR/>Also, what lisp implementation was this tested on? The recursion blows the stack on SBCL for even small values of max.rl-oidhttp://rl-oid.myopenid.com/noreply@blogger.com