LispForum

AlexPaes wrote:The problem with 'implausibleusername' functions is the order of the forms, since the functions return the last evaluated form the functions will return the value of (incf i), you can either wrap a PROG1 form around these, like:

That'll teach me not to use '(1 1 1) as a test case.

So (let ((i -1)) (mapcar #'(lambda (x) (+ x i) (incf i) ) l ))) should be (let ((i 0)) (mapcar #'(lambda (x) (+ x i) (incf i) ) l ))) Alternatives are: (mapcar (let ((i 0)) (lambda (x) (+ x i) (incf i) )) l )) or (mapcar #'+ list (loop for k in list for i from 0 collect i)) I don't think either of t...

Again I'm not sure if this counts as good, but it's both novel and short. The macros generate code typed according to given exemplars. In conjuncture with type inference like SBCL, these constraints will propegate through the function. Disclaimer: I originally posted this on C.L.L. in response to so...

Hello, My nick is Methusala and I am a recovering Javaholic. I would like to be able to turn a function into a list at the repl, so I can experiment with meta programming in the REPL. I know how to use a list like a function: CL-USER> (setf g '(+ 2 2)) (+ 2 2) CL-USER> g (+ 2 2) CL-USER> (eval g) 4...

I was thinking of it like this: plain lisp macros do this: code :arrow: code Graphical programming does this: graphics :arrow: code Graphical macros do this: graphics :arrow: graphics P.S. Those arrows don't blend in very well, do they :). I'm not sure what the need for graphics macros would be. Ma...

Ok, I made a stab at this to kick start the competition. It's a bit horrific, it weighs in at 200ish lines of code + some small commented out tests. I started writing, and never backed up to edit unless the code didn't work. So the algorithm is sub-optimal, it should be rewritten for a better order ...