Destructuring extension of LET*.
Optimized Pattern Matching Library
A bag-of-tools utilities library used to aid in implementing the bese.it toolkit
CARTESIAN-PRODUCT-SWITCH is a macro for choosing the appropriate form to execute according to the combined results of multiple tests. This is a straightforward and efficient alternative to the convoluted ad-hoc conditionals one might otherwise resort to.
extended ML-style pattern matching librarycl-match is now unmaintained. We recommend optima instead for pattern-matching.As far as I can tell, this library is dead. Links to the author's home page from the project page are busted, and the mailing list is morbid. The library was written using the author's idiosyncratic standard lisp library, so it will be difficult for an outsider to maintain. Suggest staying away.
documentationAn important bug fix (against 0.1.8) that prevented matching of arrays of length 1 is available at http://github.com/tonyg/cl-match.
Multiple values are supported.
Multiple occurances of the same variable name are implicitly tested for (EQL) equality.
Alternative patterns can have their own individual guards.
New patterns can be defined by the user.
cl-pattern is a very fast ML-like pattern matching library for Common Lisp.cl-pattern has been superseded by optima. Please use optima instead.Homepage: https://github.com/arielnetworks/cl-patternLicense: LLGPL
The CL-UNIFICATION system.
The system contains the definitions for the 'unification' machinery.
Streaming pattern matching for XML
Nondeterministic programming and constraint propagation.
NON-optimized pattern matcher compatible with OPTIMA, with extensible optimizer interface and clean codebase
Provides implementations of the standard sub-string search (string
matching) algorithms: brute-force, Boyer-Moore, Rabin-Karp, etc.