A collection of Common Lisp utilities.
Common Lisp
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Failed to load latest commit information.



A Collection of generic and useful Common Lisp conveniences. If you don't like them, don't use them.


/. - A Shen-inspired Terse Lambda syntax

This macro expands to normal lambdas. The arguments work just like a normal lambda or function arguments, but they are not surrounded by an extra set of parenthesis, instead the last element is considered to be the body of the function, unless there is a "->" symbol in the list, then all the succeeding elements are treated like an implicit PROGN.

Additionally, any or even multiple arguments can be explicitely ignored by making them underscores.

Example of basic usage:

;; expands to

(/. x)
;; expands to

(/. x x)
;; expands to

(/. x y &rest rest (apply #'* x y rest))
;; expands to
  (APPLY #'* X Y REST)) 

Here are some examples with the ignored parameters:

(/. x _ (+ x 10))
;; expands to
  (+ X 10))

(/. _ x &rest _ (+ x 10))
;; expands to
    (+ X 10))

Here are some examples with the implicit PROGN using the "->".

(/. x y z ->
  (format t "debug~%")
  (* x y z))
;; expands to
  (FORMAT T "debug~%")
  (* X Y Z))

(/. -> x y z)
;; expands to

The purpose of the terse lambda syntax is mostly to have a way to define short anonymous functions a little shorter. There is no limitation on using normal argument lists other than not being able to use the special "_" and "->" symbols. The macro does nothing to the body of the function other than prepend any DECLARE IGNORE.

bnd - A terse replacement for LET* and MULTIPLE-VALUE-BIND

First, think of LET* with none of the grouping parens, instead, the first elem gets bound to the second and so on, and the last element is the "body", and just like /. above, an implicit PROGN can be signalled with the "->" symbol.

The second trick is that if the binding name is not a symbol, but a list, it gets turned into a MULTIPLE-VALUE-BIND automatically.

The last trick is that "_" parameters are explicitely ignored.

Here is an extremely simple usage:

(bnd x 10 y 20 (+ x y))
;; expands to:
(LET ((X 10))
  (LET ((Y 20))
    (+ X Y)))

Now, with "->" for implicit PROGN:

(bnd x 10 y 20 -> (format t "hello") (+ x y))
;; expands to:
(LET ((X 10))
  (LET ((Y 20))
    (+ X Y)))


(bnd x 10
     (y z) (floor 5 x)
  (+ x z))
;; expands to:
(LET ((X 10))
    (+ X Z)))

With ignored "_" parameters.

(bnd x 10
     (_ z) (floor 5 x)
  (+ x z))
;; expands to:
(LET ((X 10))
      (FLOOR 5 X)
    (+ X Z)))

Functions for simple trees

A simple tree is basically a list where the leaves are all the non-list top level values and lists are considered branches of the tree and treated the same way recursively.

This is a simple tree with 5 numbers as leaves looks like this:

'(1 2 ((3) 4 (5)))

TREE-MAPLEAF - like MAPCAR for simple trees

This function creates a new simple tree where the each leaf is the result of applying some function to the original leaf. Unlike MAPCAR, it only operates on one tree though multiple trees may be added later. I can't think of many situations where that would be useful.

(tree-mapleaf #'1+ '(1 (2) (3 (4)) 5))
;;-> (2 (3) (4 (5)) 6)

TREE-DOLEAF - like MAPC for simple trees

TREE-DOLEAF is to MAPC as TREE-MAPLEAF is to MAPCAR. In other words, this just applies the function to the leaves, and then returns the original tree.

(tree-doleaf #'print '(1 (2) (3 (4)) 5))
;; 1
;; 2
;; 3
;; 4
;; 5
;;-> (1 (2) (3 (4)) 5)

TREE-COUNT-IF - like COUNT-IF for simple trees

Doesn't support any of the keyword parameters of COUNT-IF, most of which would not make sense, except KEY, but that's superfluous as you can get the same effect by composing the key function with the predicate. The Alexandria library contains the COMPOSE function which would be useful in this instance.

(tree-count-if #'evenp '(1 (2) (3 (4)) 5))
;;-> 2

TREE-FIND-IF - like FIND-IF for simple trees

Doesn't support any of the keyword parameters of FIND-IF, for the same reasons as TREE-COUNT-IF. Does return a second value to signal if the element returned was found in the list. Search is performed depth first.

(tree-find-if #'oddp '(1 (2) (3 (4)) 5))
;;-> 1
;;-> T
(tree-find-if #'oddp '(2 (2) (4 (4)) 6))
;;-> NIL
;;-> NIL




Copyright (c) 2012 Stephen A. Goss (steveth45@gmail.com)


Licensed under the Modified BSD License.