Home
This project provides bindings for RE2: fast, safe alternative to backtracking regular expression engines written by Russ Cox. To learn more about RE2, start with an overview Regular Expression Matching in the Wild. More resources can be found at his Implementing Regular Expressions page.
RE2's regular expression language is almost a superset of what is provided by RegExp
(see Syntax), but it lacks two features: backreferences and lookahead assertions. See below for more details.
RE2 object emulates standard RegExp making it a practical drop-in replacement in most cases.
RE2 is extended to provide String-based regular expression methods as well. To help to convert
RegExp objects to RE2 its constructor can take RegExp directly honoring all properties.
It can work with node.js buffers directly reducing overhead on recoding and copying characters, and making processing/parsing long files fast.
This project attempts to identify a user's platform and download a precompiled binary. Only if it fails, it will build a binary from scratch using local build tools.
See Precompiled versions.