This crate provides routines for searching strings for matches of a regular expression (aka “regex”). The regex syntax supported by this crate is similar to other regex engines, but it lacks several features that are not known how to implement efficiently. This includes, but is not limited to, look-around and backreferences. In exchange, all regex searches in this crate have worst case `O(m * n)` time complexity, where `m` is proportional to the size of the regex and `n` is proportional t...| docs.rs
Unicode Technical Standard #35| www.unicode.org
Unicode® Technical Standard #46| unicode.org
Unicode® Technical Standard #39| www.unicode.org
perlunicode| perldoc.perl.org
Unicode® Technical Standard #18| www.unicode.org
Unicode® Technical Standard #10| unicode.org
Unicode Technical Standard #35| www.unicode.org
This crate provides routines for searching strings for matches of a regular expression (aka “regex”). The regex syntax supported by this crate is similar to other regex engines, but it lacks several features that are not known how to implement efficiently. This includes, but is not limited to, look-around and backreferences. In exchange, all regex searches in this crate have worst case `O(m * n)` time complexity, where `m` is proportional to the size of the regex and `n` is proportional t...| docs.rs
Unicode Character Encoding Stability Policies| www.unicode.org
Unicode® Technical Standard #18| unicode.org
Unicode Technical Standard #35| www.unicode.org