re2r: RE2 Regular Expression

RE2 <> is a primarily deterministic finite automaton based regular expression engine from Google that is very fast at matching large amounts of text.

Version: 0.2.0
Depends: R (≥ 3.3)
Imports: Rcpp (≥ 0.12.2), stringi, RcppParallel, htmlwidgets (≥ 0.6)
LinkingTo: Rcpp, RcppParallel
Suggests: knitr (≥ 1.12.3), testthat, rmarkdown (≥ 0.9.5), microbenchmark, ggplot2, directlabels
Published: 2017-09-04
Author: Qin Wenfeng [aut, cre], Toby Dylan Hocking [ctb] (benchmarks), Marek Gagolewski [ctb] (stringi benchmarks and test cases), RE2 developers [ctb] (RE2 library), Google Inc. [ctb, cph] (RE2 library), Lucent Technologies [ctb, cph] (RE2 library), Rob Pike [ctb] (RE2 library), Ken Thompson [ctb] (RE2 library), Julian Seward [ctb, cph] (valgrind.h), Andrzej Krzemienski [ctb] (optional.hpp), Jeffrey Avallone [ctb] (regexper library)
re2r author details
Maintainer: Qin Wenfeng <mail at>
License: BSD_3_clause + file LICENSE
Copyright: see file COPYRIGHTS
NeedsCompilation: yes
SystemRequirements: GNU make
CRAN checks: re2r results


Reference manual: re2r.pdf
Vignettes: Introduction to RE2
RE2 Syntax
Package source: re2r_0.2.0.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
OS X El Capitan binaries: r-release: re2r_0.2.0.tgz
OS X Mavericks binaries: r-oldrel: re2r_0.2.0.tgz


Please use the canonical form to link to this page.