Paul Rubin wrote: > > "nif" is even cleaner in Haskell, if I have this right: > > nif x p z n | (x < 0) = n > | (x == 0) = z > | (x > 0) = p > > All Haskell evaluation is automatically lazy, so no lambdas etc. needed.
You can use that style in CL.
(defun nif (x p z n)
(or (when (< x 0) n)
(when (= x 0) z)
(when (> x 0) p)))
Wade
--
http://mail.python.org/mailman/listinfo/python-list
