Skip to content

fix(deps): update rust crate regex to 1.10.2

renovate requested to merge renovate/regex-1.x into main

This MR contains the following updates:

Package Type Update Change
regex dependencies minor 1.9.0 -> 1.10.2

Release Notes

rust-lang/regex (regex)

v1.10.2

Compare Source

=================== This is a new patch release that fixes a search regression where incorrect matches could be reported.

Bug fixes:

  • BUG #​1110: Revert broadening of reverse suffix literal optimization introduced in 1.10.1.

v1.10.1

Compare 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:

  • 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.

v1.10.0

Compare Source

=================== 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 the regex 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 other 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:

Performance improvements:

  • PERF #​1051: Unicode character class operations have been optimized in regex-syntax.
  • PERF #​1090: Make patterns containing lots of literal characters use less memory.

Bug fixes:

  • BUG #​1046: Fix a bug that could result in incorrect match spans when using a Unicode word boundary and searching non-ASCII strings.
  • BUG(regex-syntax) #​1047: Fix panics that can occur in Ast->Hir translation (not reachable from regex crate).
  • BUG(regex-syntax) #​1088: Remove guarantees in the API that connect the u flag with a specific HIR representation.

regex-automata breaking change release:

This release includes a regex-automata 0.4.0 breaking change release, which was necessary in order to support the new word boundary assertions. For example, the Look enum has new variants and the LookSet type now uses u32 instead of u16 to represent a bitset of look-around assertions. These are overall very minor changes, and most users of regex-automata should be able to move to 0.4 from 0.3 without any changes at all.

regex-syntax breaking change release:

This release also includes a regex-syntax 0.8.0 breaking change release, which, like regex-automata, was necessary in order to support the new word boundary assertions. This release also includes some changes to the Ast type to reduce heap usage in some cases. If you are using the Ast type directly, your code may require some minor modifications. Otherwise, users of regex-syntax 0.7 should be able to migrate to 0.8 without any code changes.

regex-lite release:

The regex-lite 0.1.1 release contains support for the new word boundary assertions. There are no breaking changes.

v1.9.6

Compare 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.

  • BUG aa4e4c71: 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.5

Compare 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_static or similar 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-automata that require passing state 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 OnceLock or lazy_static or once_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:

  • BUG #​934: Fix a performance bug where high contention on a single regex led to massive slow downs.

v1.9.4

Compare Source

================== This is a patch release that fixes a bug where RegexSet::is_match(..) could incorrectly return false (even when RegexSet::matches(..).matched_any() returns true).

Bug fixes:

  • BUG #​1070: Fix a bug where a prefilter was incorrectly configured for a RegexSet.

v1.9.3

Compare 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:

  • BUG #​1060: Fix a bug with the reverse inner literal optimization reporting incorrect match offsets.

v1.9.2

Compare 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:

  • BUG #​1059: Fix a memory usage regression when using a RegexSet.

v1.9.1

Compare 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:

  • BUG #​1027: Change the allocation strategy for the backtracker to be less aggressive.

Configuration

📅 Schedule: Branch creation - At any time (no schedule defined), Automerge - At any time (no schedule defined).

🚦 Automerge: Disabled by config. Please merge this manually once you are satisfied.

♻ Rebasing: Whenever MR becomes conflicted, or you tick the rebase/retry checkbox.

🔕 Ignore: Close this MR and you won't be reminded about this update again.

  • If you want to rebase/retry this MR, check this box

This MR has been generated by Renovate Bot.

Edited by renovate

Merge request reports