Sourced from regex's changelog.
1.10.2 (2023-10-16)
This is a new patch release that fixes a search regression where incorrect matches could be reported.
Bug fixes:
- [BUG #1110](rust-lang/regex#1110): Revert broadening of reverse suffix literal optimization introduced in 1.10.1.
1.10.1 (2023-10-14)
This is a new patch release with a minor increase in the number of valid patterns and a broadening of some literal optimizations.
New features:
- FEATURE 04f5d7be: Loosen ASCII-compatible rules such that regexes like
(?-u:☃)
are now allowed.Performance improvements:
- PERF 8a8d599f: Broader the reverse suffix optimization to apply in more cases.
1.10.0 (2023-10-09)
This is a new minor release of
regex
that adds support for start and end word boundary assertions. That is,\<
and\>
. The minimum supported Rust version has also been raised to 1.65, which was released about one year ago.The new word boundary assertions are:
\<
or\b{start}
: a Unicode start-of-word boundary (\W|\A
on the left,\w
on the right).\>
or\b{end}
: a Unicode end-of-word boundary (\w
on the left,\W|\z
on the right)).\b{start-half}
: half of a Unicode start-of-word boundary (\W|\A
on the left).\b{end-half}
: half of a Unicode end-of-word boundary (\W|\z
on the right).The
\<
and\>
are GNU extensions to POSIX regexes. They have been added to theregex
crate because they enjoy somewhat broad support in other regex engines as well (for example, vim). The\b{start}
and\b{end}
assertions are aliases for\<
and\>
, respectively.The
\b{start-half}
and\b{end-half}
assertions are not found in any
... (truncated)
5f1f1c8
1.10.21a54a82
deps: bump regex-automata to 0.4.361242b1
regex-automata-0.4.350fe7d1
changelog: 1.10.2eb950f6
automata/meta: revert broadening of reverse suffix optimizatione7bd19d
regex-lite-0.1.50086dec
lite: fix stack overflow test4ae1472
tests: fix compilation of doctests on 32-bit architecturescd79881
regex-lite-0.1.4466e42c
lite: fix stack overflow in NFA compiler