LispForum

If you don't care about order, you don't need nreverse at the end.

You could hardcode the sports to avoid having to do any file I/O retrieving them. You also wouldn't have to do any cleaning on them. If you have a string constant that is only used in one place, its probably better to just put it in the code body rather than a parameter. Those two changes will make...

I don't know what to tell you, it works on my machine (SBCL 1.0.32) when I run the following: (defun foo (f) (if (evenp f) (list f) f)) (loop for f in '(1 2 3 4) as fc = (and (>= f 2) (foo f)) when (consp fc) collect fc) ;; gives ==> ((2) (4)) You could try replacing the word 'when' with 'if', what ...

A couple of ways (loop for f in g as fc = (and (>= f tr) (foo f)) when (consp fc) collect fc) (let ((results nil)) (dolist (f g (nreverse results)) (when (>= f tr) (let ((fc (foo f))) (when (consp fc) (push fc results))))) (defun process (f) (when (> f tr) (let ((fc (foo f))) (and (consp fc) (list f...

Looks right to me, heres a slight simplification.
If you want the result that foobar is generating (and foobar returns NIL if no result)...

Your points are clearer, it sounds like you want to apply a heuristic throughout the search --- is this by any chance a MIN/MAX algorithm for a game? Given your requirements, I would recommend against backtracking the way I've already layed out. The way I've explained it keeps everything on the stac...

Backtracking in C (or C++) is significantly harder than it would be in Lisp, so even if you know C++ writing requirements in it might influences your thoughts. I'm not entirely sure what you mean by valuations. I'm going to restate what I think your asking and you can tell me if I've missed the mark...

Heres a real simple implementation. Given A in the range of 0 32, B in the range of 0 64, and C in the range of 0 128, it collects every combination of these 3 values that solves =128. Currently =128 is set to (= 128 (+ (* a b) c)), but could be changed. (defmacro awhen (clause &rest body) `(let...

How you produce an executable really depends on which Lisp implementation you are using. In a few weeks I'll probably be writing a lisp application to mangle some CSV files. I'm looking into Armed Bear common lisp for this task, because I have a hunch it'll let me distribute standalone executables t...

I/O has been sucked into operating systems for some time now, so you have to go through it. For example, on Linux ASM programs can use READ and WRITE (interrupts 3 & 4) to perform some basic IO. To do char by character input I think they must use the IOCTL system call to set the IO mode. Because...