Ambrose and I have been working on a high performance pattern matching library for Clojure. There's much left to do but it's already in a place where it's fun to play around with and we think some of you might even find it useful even in this early form.
Some highlights: * Literal patterns * Seq patterns with rest support * Map patterns, can constrain keys with only * Bindings can be introduced anywhere a wildcard might appear * No type constraints on columns * Lazy pattern matching semantics a la Haskell This library implements Maranget's fascinating description for compiling pattern matching into good decision trees. Suffice to say, this library is pretty darn fast. We look forward to hearing your feedback. For code, more documentation, and where we are heading you can look here: https://github.com/swannodette/match David -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en
