Clojure JIRA

[MATCH-72] complexity analysis

Tue, 18 Jun 2013 22:22:13 -0500

For smaller matches avoid backtracking actually greatly improves performance at the potential cost of code size. Perhaps we can devise a heuristic such that we employ the the best option available? Would need some serious hammock time.

[MATCH-65] cata matching

Sat, 15 Jun 2013 22:37:36 -0500

Dan Friedman's pattern matcher has a nice feature called cata-matching - allowing recursive matching from the match itself. Useful when writing compilers.

[MATCH-64] Improve match compile times

Sat, 15 Jun 2013 22:16:01 -0500

Improve match compile times

[MATCH-9] use case for dispatching on literals

Mon, 10 Oct 2011 22:45:51 -0500

Would speed up literal matching considerably.

[MATCH-8] Implement (p|q)ba heuristics

Sun, 4 Sep 2011 10:00:57 -0500

We should implement the rest of Maranget's suggested heuristics.

p - needed prefix
q - constructor prefix
b - branching factor
a - constructor arity

[MATCH-2] Matching Diagnostics

Sun, 16 Jun 2013 13:57:24 -0500

Communicate to the user precisely what failed to match. Conversation here: http://groups.google.com/group/clojure/browse_thread/thread/675456fba1712214. We adopt the behavior of condp since that is closer to what match does and will do (predicate dispatch)