Updated: Note that this is available as a clojars module.
Clojure code density seems to be pretty good. There are a fair number of convenient shortforms in the language; for example, associative datatypes all act as a function — so given a hash map you can reference it with (my-hashmap :key). The base language itself is probably about as expressive as Python (or a bit better), but you have the added advantage of being able to use macros as needed to really get the code density up.
Nonetheless, I really wanted something like Ocaml’s / Haskell’s pattern matching; it makes some code wonderfully concise.
Accordingly, I hacked something up, based on Clojure’s built-in destructuring. Some examples:
Literal values match against the same value, while _ matches against any non-nil value (and nil matches against any nil one). Additionally, :when clauses can be used for conditional checks.; simple recursive evaluator (defn arithmetic [lst] (match lst v :when (number? v) v [ _ "error" _] "error" [ _ _ "error"] "error" [ "add" a b ] (+ (arithmetic a) (arithmetic b)) [ "sub" a b ] (- (arithmetic a) (arithmetic b)) [ "mul" a b ] (* (arithmetic a) (arithmetic b)) [ "div" a b ] (/ (arithmetic a) (arithmetic b)) [ "squared" a ] (arithmetic ["mul" (arithmetic a) (arithmetic a)]) _ "error" ))
Both collections and single values can be used:;; return signum fr a number (defn signum [x] (match x 0 0 n :when (< n 0) -1 _ 1))
The pattern matching is stricter than the typical destructure; whereas [ a b ] will destructure against a list of any number of elements, [ a b ] will pattern match only against a list of two elements.(match x  "empty" [_] "one element" [a a] "two identical elements" [_ _] "two elements" _ "three or more")
If the same variable occurs in multiple locations in the parameter list, it will be checked for equality. The & tail form can be used to specify the rest of the list.;; count identical elements in the same location in two lists: (defn count= [ lst1 lst2 ] (loop [ a lst1 b lst2 count 0 ] (match [a b] [[e & at] [e & bt]] (recur at bt (inc count)) [[_ & at] [_ & bt]] (recur at bt count) _ count)))
Note that this is slightly more flexible than Haskell / ML, in that a variable of the same name can be multiple places in the pattern.
You can use the defnp macro to define a function that is pattern matched; it defines a function that takes one argument and has an implicit match statement. For example, the signum function can be written:(defnp signum 0 0 n :when (< n 0) -1 _ 1)
(Thanks to Tom Faulhaber for suggesting this)
The Clojure destructuring will cause an exception if you try to destructure a collection type with a value.(let [[a b] 10] a) java.lang.UnsupportedOperationException: nth not supported on this type: Integer (NO_SOURCE_FILE:0)
… so be sure to check such cases early in your match statement, if they are possible.
The pattern matcher uses the built-in Clojure destructuring as the main mechanism, but adorns it so that the pattern can be verified. For example, the code:(match x [a a] "two identical" )
turns into essentially the following:(let [ [ a g0001 & g0002 ] x ] (if (and (not (nil? a)) (= g0001 a) (nil? g0002)) "two identical" nil))
That is, the destructuring is done, but then the two variables are checked to make sure that they are equal, and the list is checked to make sure it is only two elements long.
Comments are moderated whenever I remember that I have a blog.