Page 5 of 456 results found for lisp #'
nil's are dropped (string (delete-if #'null (map 'list #'unpack (rfs str)))) ;; symbol -> list of values (symbol (unpack (rfs (symbol-name str)))) ;; list
http://stackoverflow.com/question...ode-simpler-clearer-and-more-lispy
Lisp: http://www.gigamonkeys.com/book/variables.html When coming to Common Lisp from more procedural languages, many tend to overuse `setf` for
http://stackoverflow.com/question...-do-value-assignment-issue-in-lisp
Coercing numbers to lists in common lisp Coercing numbers to lists in common lisp I'd like to turn integers into lists. For example, 2245 => (2 2 4
http://stackoverflow.com/question...ng-numbers-to-lists-in-common-lisp
almost any kind of application in almost any programming language, especially in such a powerful one as Lisp (be it Scheme or Common Lisp). But is it
http://stackoverflow.com/question...do-serious-web-development-in-lisp
What is wrong with the following Common Lisp macro using gensym? What is wrong with the following Common Lisp macro using gensym? Learning Common
http://stackoverflow.com/question...ing-common-lisp-macro-using-gensym
lisp lambda function lisp lambda function (repeat-transformation #'(lambda (x) (* 2 x)) 4 1) This is a LISP lambda function , i don't understand what
http://stackoverflow.com/questions/5628536/lisp-lambda-function
bit confusing. Tags: lisp package symbols cl PS: Common Lisp's `gethash` has no dash. Also, if all keys are symbols, there is no need for the `:test
http://stackoverflow.com/question...p-symbols-without-package-bindings
(MULTIPLE-VALUE-BIND (#:NEW1058) 23 (FUNCALL #'(SETF GET-VALUE) #:NEW1058))) T In Common Lisp, that is a place . A place is a form for which a setf expander is defined.
http://stackoverflow.com/question...-or-receive-arguments-by-reference
each time. Maybe my whole implementation is wrong. Thanks for looking! (defun ascending (L) (sort L #'<) ) (defun descending (L) (sort L #'>) ) (defun
http://stackoverflow.com/question.../lisp-checking-if-a-list-is-sorted
LISP - Breadth First Search LISP - Breadth First Search I have an implementation of BFS I got elsewhere and modified slightly, but I am having
http://stackoverflow.com/questions/5614568/lisp-breadth-first-search