Need a web developer?
The creator of SymbolHound is available for contract work for select clients. Send an email to email@example.com
to see if we might want to work together.
LISP Displaying binary tree level by level LISP Displaying binary tree level by level I have a list that looks like (A (B (C D)) (E (F))) which
(funcall #'add 1 2) or (funcall #'(lambda (x y) (+ x y)) 10 2) apply(lambda x,y : x+y, [1,2]) What do you think? Are there more differences between Lisp's
Common lisp idiom - is there a better way? Common lisp idiom - is there a better way? I find myself doing this sort of thing all the time. I've been
lisp: consolidate a list-of-lists into a single list? lisp: consolidate a list-of-lists into a single list? Still working on lisp recipes and idioms.
How do I splice into a list outside of a macro in Common Lisp? How do I splice into a list outside of a macro in Common Lisp? Say I have a function
considerations in Lisp. In principle, it will not get much better, unless you use format , but you can use the CL-WHO library, which lets you write HTML in Lisp:
minimum (list) (car (sort list #'<))) ;;finds maximum in a list (defun maximum (list) (car (sort list #'>))) ;;calculates the range of a list (defun range
(l + m + ... + z) by first expanding into pairs and then summing the products: (defun mul-sums (aa bb) (reduce #'+ (apply #'append (map 'list #'(lambda
dates and times in emacs lisp dates and times in emacs lisp I understand emacs lisp is great for handling dates and times, but does it have a
Merging Two Matrixes... in LISP Merging Two Matrixes... in LISP (defun merge-matrix (matrix-1 matrix-2) (if (not (or (eql (matrix-rows matrix-1)