|Number of watchers on Github||102|
|Number of open issues||20|
|Average time to close an issue||about 2 months|
|Average time to merge a PR||6 days|
|Open pull requests||6+|
|Closed pull requests||7+|
|Last commit||over 1 year ago|
|Repo Created||over 7 years ago|
|Repo Last Updated||over 1 year ago|
|Organization / Author||ocaml|
|Do you use ocaml-re? Leave a review!|
|View open issues (20)|
|View ocaml-re activity|
|View on github|
|Fresh, new opensource launches 🚀🚀🚀|
Trendy new open source projects in your inbox! View examples
This library has been written by Jerome Vouillon (Jerome.Vouillon@pps.univ-paris-diderot.fr). It can be downloaded from https://github.com/ocaml/ocaml-re
Bug reports, suggestions and contributions are welcome.
The following styles of regular expressions are supported:
It is also possible to build regular expressions by combining simpler
regular expressions (module
The most notable missing features are back-references and look-ahead/look-behind assertions.
There is also a subset of the PCRE interface available in the
Re.pcre library. This makes it easier to port code from that
library to Re without any changes beyond replacing the
findlib package with
The matches are performed by lazily building a DFA (deterministic finite automaton) from the regular expression. As a consequence, matching takes linear time in the length of the matched string.
The compilation of patterns is slower than with libraries using back-tracking, such as PCRE. But, once a large enough part of the DFA is built, matching is extremely fast.
Of course, for some combinations of regular expression and string, the part of the DFA that needs to be build is so large that this point is never reached, and matching will be slow. This is not expected to happen often in practice, and actually a lot of expressions that behaves badly with a backtracking implementation are very efficient with this implementation.
The library is at the moment entirely written in OCaml. As a consequence, regular expression matching is much slower when the library is compiled to bytecode than when it is compiled to native code.
Here are some timing results (Pentium III 500Mhz):
as, except for the last character which is a
b, searching for the pattern
aa?b(repeated 100 times):
 this page is no longer up but is available via the Internet Archive http://web.archive.org/web/20010429190941/http://www.bagley.org/~doug/shootout/bench/regexmatch/