fix(deps): update rust crate regex to v1.10.6 #6
Reference in New Issue
Block a user
Delete Branch "renovate/regex-1.x-lockfile"
Deleting a branch is permanent. Although the deleted branch may continue to exist for a short time before it actually gets removed, it CANNOT be undone in most cases. Continue?
This PR contains the following updates:
1.8.4->1.10.6Release Notes
rust-lang/regex (regex)
v1.10.6Compare Source
===================
This is a new patch release with a fix for the
unstablecrate feature thatenables
std::str::Patterntrait integration.Bug fixes:
Fix the
Patterntrait implementation as a result of nightly API breakage.v1.10.5Compare Source
===================
This is a new patch release with some minor fixes.
Bug fixes:
Escape invalid UTF-8 when in the
Debugimpl ofregex::bytes::Match.v1.10.4Compare Source
===================
This is a new patch release with some minor fixes.
Fixes a bug with compiling a reverse NFA automaton in
regex-automata.Clarifies that when
Cow::Borrowedis returned from replace APIs, it isequivalent to the input.
v1.10.3Compare Source
===================
This is a new patch release that fixes the feature configuration of optional
dependencies, and fixes an unsound use of bounds check elision.
Bug fixes:
Set
default-features=falsefor thememchrandaho-corasickdependencies.Fix unsound bounds check elision.
v1.10.2Compare Source
===================
This is a new patch release that fixes a search regression where incorrect
matches could be reported.
Bug fixes:
Revert broadening of reverse suffix literal optimization introduced in 1.10.1.
v1.10.1Compare Source
===================
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:
Loosen ASCII-compatible rules such that regexes like
(?-u:☃)are now allowed.Performance improvements:
Broader the reverse suffix optimization to apply in more cases.
v1.10.0Compare Source
===================
This is a new minor release of
regexthat adds support for start and endword boundary assertions. That is,
\<and\>. The minimum supported Rustversion 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|\Aon the left,\won the right).\>or\b{end}: a Unicode end-of-word boundary (\won the left,\W|\zon the right)).
\b{start-half}: half of a Unicode start-of-word boundary (\W|\Aon theleft).
\b{end-half}: half of a Unicode end-of-word boundary (\W|\zon theright).
The
\<and\>are GNU extensions to POSIX regexes. They have been addedto the
regexcrate because they enjoy somewhat broad support in other regexengines as well (for example, vim). The
\b{start}and\b{end}assertionsare aliases for
\<and\>, respectively.The
\b{start-half}and\b{end-half}assertions are not found in anyother regex engine (although regex engines with general look-around support
can certainly express them). They were added principally to support the
implementation of word matching in grep programs, where one generally wants to
be a bit more flexible in what is considered a word boundary.
New features:
Add support for
\<and\>word boundary assertions.DFAs now have a
start_statemethod that doesn't use anInput.Performance improvements:
Unicode character class operations have been optimized in
regex-syntax.Make patterns containing lots of literal characters use less memory.
Bug fixes:
Fix a bug that could result in incorrect match spans when using a Unicode word
boundary and searching non-ASCII strings.
Fix panics that can occur in
Ast->Hirtranslation (not reachable fromregexcrate).
Remove guarantees in the API that connect the
uflag with a specific HIRrepresentation.
regex-automatabreaking change release:This release includes a
regex-automata 0.4.0breaking change release, whichwas necessary in order to support the new word boundary assertions. For
example, the
Lookenum has new variants and theLookSettype now usesu32instead of
u16to represent a bitset of look-around assertions. These areoverall very minor changes, and most users of
regex-automatashould be ableto move to
0.4from0.3without any changes at all.regex-syntaxbreaking change release:This release also includes a
regex-syntax 0.8.0breaking change release,which, like
regex-automata, was necessary in order to support the new wordboundary assertions. This release also includes some changes to the
Asttype to reduce heap usage in some cases. If you are using the
Asttypedirectly, your code may require some minor modifications. Otherwise, users of
regex-syntax 0.7should be able to migrate to0.8without any code changes.regex-literelease:The
regex-lite 0.1.1release contains support for the new word boundaryassertions. There are no breaking changes.
v1.9.6Compare Source
==================
This is a patch release that fixes a panic that can occur when the default
regex size limit is increased to a large number.
Fix a bug where computing the maximum haystack length for the bounded
backtracker could result underflow and thus provoke a panic later in a search
due to a broken invariant.
v1.9.5Compare Source
==================
This is a patch release that hopefully mostly fixes a performance bug that
occurs when sharing a regex across multiple threads.
Issue #934
explains this in more detail. It is also noted in the crate
documentation.
The bug can appear when sharing a regex across multiple threads simultaneously,
as might be the case when using a regex from a
OnceLock,lazy_staticorsimilar primitive. Usually high contention only results when using many threads
to execute searches on small haystacks.
One can avoid the contention problem entirely through one of two methods.
The first is to use lower level APIs from
regex-automatathat require passingstate explicitly, such as
meta::Regex::search_with.The second is to clone a regex and send it to other threads explicitly. This
will not use any additional memory usage compared to sharing the regex. The
only downside of this approach is that it may be less convenient, for example,
it won't work with things like
OnceLockorlazy_staticoronce_cell.With that said, as of this release, the contention performance problems have
been greatly reduced. This was achieved by changing the free-list so that it
was sharded across threads, and that ensuring each sharded mutex occupies a
single cache line to mitigate false sharing. So while contention may still
impact performance in some cases, it should be a lot better now.
Because of the changes to how the free-list works, please report any issues you
find with this release. That not only includes search time regressions but also
significant regressions in memory usage. Reporting improvements is also welcome
as well! If possible, provide a reproduction.
Bug fixes:
Fix a performance bug where high contention on a single regex led to massive
slow downs.
v1.9.4Compare Source
==================
This is a patch release that fixes a bug where
RegexSet::is_match(..)couldincorrectly return false (even when
RegexSet::matches(..).matched_any()returns true).
Bug fixes:
Fix a bug where a prefilter was incorrectly configured for a
RegexSet.v1.9.3Compare Source
==================
This is a patch release that fixes a bug where some searches could result in
incorrect match offsets being reported. It is difficult to characterize the
types of regexes susceptible to this bug. They generally involve patterns
that contain no prefix or suffix literals, but have an inner literal along with
a regex prefix that can conditionally match.
Bug fixes:
Fix a bug with the reverse inner literal optimization reporting incorrect match
offsets.
v1.9.2Compare Source
==================
This is a patch release that fixes another memory usage regression. This
particular regression occurred only when using a
RegexSet. In some cases,much more heap memory (by one or two orders of magnitude) was allocated than in
versions prior to 1.9.0.
Bug fixes:
Fix a memory usage regression when using a
RegexSet.v1.9.1Compare Source
==================
This is a patch release which fixes a memory usage regression. In the regex
1.9 release, one of the internal engines used a more aggressive allocation
strategy than what was done previously. This patch release reverts to the
prior on-demand strategy.
Bug fixes:
Change the allocation strategy for the backtracker to be less aggressive.
v1.9.0Compare Source
==================
This release marks the end of a years long rewrite of the regex crate
internals. Since this is
such a big release, please report any issues or regressions you find. We would
also love to hear about improvements as well.
In addition to many internal improvements that should hopefully result in
"my regex searches are faster," there have also been a few API additions:
Captures::extractmethod for quickly accessing the substringsthat match each capture group in a regex.
R, which enables CRLF mode. This makes.match anyUnicode scalar value except for
\rand\n, and also makes(?m:^)and(?m:$)match after and before both\rand\n, respectively, but neverbetween a
\rand\n.RegexBuilder::line_terminatorwas added to further customize the lineterminator used by
(?m:^)and(?m:$)to be any arbitrary byte.stdCargo feature is now actually optional. That is, theregexcratecan be used without the standard library.
regex 1.9may make binary size and compile times even worse, anew experimental crate called
regex-litehas been published. It prioritizesbinary size and compile times over functionality (like Unicode) and
performance. It shares no code with the
regexcrate.New features:
One can opt into CRLF mode via the
Rflag.e.g.,
(?mR:$)matches just before\r\n.Multi-pattern searches with offsets can be done with
regex-automata 0.3.stdis now an optional feature.regexmay be used with onlyalloc.RegexBuilder::line_terminatorconfigures how(?m:^)and(?m:$)behave.Anchored search APIs are now available in
regex-automata 0.3.Add new
Captures::extractmethod for easier capture group access.Add
regex-litecrate with smaller binary sizes and faster compile times.Add
TryFromimplementations for theRegextype.Performance improvements:
Added a one-pass DFA engine for faster capture group matching.
Inner literals are now used to accelerate searches, e.g.,
\w+@​\w+will scanfor
@.PERF #891:
Makes literal optimizations apply to regexes of the form
\b(foo|bar|quux)\b.(There are many more performance improvements as well, but not all of them have
specific issues devoted to them.)
Bug fixes:
Fix matching bugs related to
\Band inconsistencies across internal engines.Fix matching bug with capture groups.
Fix matching bug with word boundaries.
Fix bug where some regexes like
(re)+were not equivalent to(re)(re)*.Fix matching bug inconsistency between NFA and DFA engines.
Fix matching bug where literal extraction got confused by
$.Add documentation to replacement routines about dealing with fallibility.
Use corpus rejection in fuzz testing.
Configuration
📅 Schedule: Branch creation - At any time (no schedule defined), Automerge - At any time (no schedule defined).
🚦 Automerge: Enabled.
♻ Rebasing: Whenever PR becomes conflicted, or you tick the rebase/retry checkbox.
🔕 Ignore: Close this PR and you won't be reminded about this update again.
This PR has been generated by Renovate Bot.