Why do people say lists come for free in Lisp?
If I run this code
(let ((acc '()))
(do ((i 1 (incf i)))
((= i 100))
(do ((j 0 (incf j)))
((= j 100))
(do ((k 0 (incf k)))
((= k 100))
(do ((l 0 (incf l)))
((= l 100))
(do ((m 10 (+ 10 m)))
((= m 500))
(let ((unfiltered (copy-list '(0 0 0 0 0))))
(setf (nth 0 unfiltered) i)
(setf (nth 1 unfiltered) j)
(setf (nth 2 unfiltered) k)
(setf (nth 3 unfiltered) l)
(setf (nth 4 unfiltered) m)
(push unfiltered acc))))))))
I get a heap exhausted error in SBCL. I'm not very familiar with how Lisp works under the hood, but I need to generate a list of very many lists. Is there a way to do that without running out of heap space?
Thanks