LispForum

Maybe a macro: (defmacro with-tests (vars &body body) `(let ,vars (flet ((get-all-test-results () (list ,@(mapcar #'first vars)))) ,@body))) (defun test-conditions (state) (with-tests ((test-1 (list "Test 1 Name" (lambda (state) <<<run tests on state return a value>>>))) (test-2 (list ...

There is a special evaluation for lambda (see the Notes in its specification ). For instance: ((lambda (x) (+ x 3)) 5) is the same as (funcall #'(lambda (x) (+ x 3)) 5) or (let ((x 5)) (+ x 3)) Your code is equivalent to (defparameter *test-symbol* (let ((x (lambda (y) (format t "y: ~a~&&qu...

There is no portable way of doing that. The only way to do that would be using a macro with an &env argument and inspecting it to know what symbols are in scope. However, "environments" differ from implementation to implementation. Of course, you can try to do that using tools provided...

I thought so, but I wasn't sure

I'm curious, are you implementing AKS primality test?

To suppress the output is very easy, just call: (time (progn (prime-list 0 200000) nil)) Let me present another criticism to your code. I don't know what your objective is, but, if you are trying to implement prime-list efficiently, you are not doing a good job because your algorithm is highly innef...

Mario 64 was made in Lisp as well.

There are some neat frameworks for web applications. My favorite is weblocks, though I haven't used it much.

Ramarren wrote:EDIT: Of course, map-product doesn't exactly do what you want, since it doesn't short-curcuit when it finds the first counter-example. You can do something like this (minimally tested):

Your solution looks cool But he can use return-from to force map-product to exit.

This is possible with alexandria's map-product. I don't think it is possible with standard Common Lisp only.

Hello and wellcome