• news! new pattern: lambda-list pattern. Contributed by akssri
  • news! new pattern: number-related patterns, e.g. >, <, =, <= ...
  • news! Inline pattern implemented ! : @, @@ ...
  • news!(04/02/2016) Support for fare-quasiquote is now available. See test/quasiquote for the usage
  • news!(04/22/2016) Added metabang-bind like macros if-match, when-match, unless-match, let-match, let*-match, let-match1
  • news!(05/21/2016) Added support for minor implementations: CMU, ECL, CLISP, ABCL.
  • news!(05/22/2016) Implemented ARRAY, SIMPLE-ARRAY, ARRAY-ROW-MAJOR, ARRAY-ROW-MAJOR* patterns! Multi-dimentional arrays are now more handy!
  • news!(07/21/2016) Added READ, LAST, SPLIT, SPLIT* patterns! Parsing the string is more conveninent.
  • news!(07/21/2016) Added DYNAMIC pattern! Careful use of this pattern can impact the performance sensitive code.

Trivia : Trivial Pattern Matching Compiler

Trivia is a pattern matching compiler that is compatible with Optima. It shares the same testing code with Optima and acts as a drop-in replacement for 99% usage. For the basic usage, consult our wiki. Known differences between Optima and Trivia, which are bug, are described here (7/31/2016)

(defpackage :playwithit
  (:use :cl 
-       :optima))
+       :trivia))
(in-package :playwithit)

(match '(something #(0 1 2))
  ((list a (vector 0 _ b))
   (values a b)))
;; --> SOMETHING, 2

Patterns compiled with Trivia runs faster than Optima.

runtime [sec] fibonacci gomoku string-match
optima 11.5 39.8 82.5
trivia 1 9.68 37.4 1.57

Dependency & Testing

  • Level 0,1 : Alexandria only.
  • Level 2 : Additionally, lisp-namespace and closer-mop.

To run the tests with trivial optimizer, (asdf:test-system :trivia) .

In order to run the same test with :balland2006 optimizer activated, run follows:

;; $ git clone
;; $ git clone

(asdf:test-system :trivia.balland2006.enabled)

To run the benchmark:

(asdf:test-system :trivia.benchmark)

  1. trivia is using :balland2006 optimiizer

    ... and Trivia is more extensible. In fact, Trivia's defpattern is able to implement all of unmodifiable, core pattern language in Optima within itself.

    (defpattern cons (a b)
      (with-gensyms (it)
        `(guard1 (,it :type cons) (consp ,it) (car ,it) ,a (cdr ,it) ,b)))

    Detailed documentation is in github wiki.

Masataro Asai
pattern matching