chore(deps): update rust crate regex to 1.10.0 #297
Merged
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This PR contains the following updates:
1.9.5
->1.10.0
Release Notes
rust-lang/regex (regex)
v1.10.0
Compare Source
===================
This is a new minor release of
regex
that 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|\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 theleft).
\b{end-half}
: half of a Unicode end-of-word boundary (\W|\z
on theright).
The
\<
and\>
are GNU extensions to POSIX regexes. They have been addedto the
regex
crate 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_state
method 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->Hir
translation (not reachable fromregex
crate).
Remove guarantees in the API that connect the
u
flag with a specific HIRrepresentation.
regex-automata
breaking change release:This release includes a
regex-automata 0.4.0
breaking change release, whichwas necessary in order to support the new word boundary assertions. For
example, the
Look
enum has new variants and theLookSet
type now usesu32
instead of
u16
to represent a bitset of look-around assertions. These areoverall very minor changes, and most users of
regex-automata
should be ableto move to
0.4
from0.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 wordboundary assertions. This release also includes some changes to the
Ast
type to reduce heap usage in some cases. If you are using the
Ast
typedirectly, your code may require some minor modifications. Otherwise, users of
regex-syntax 0.7
should be able to migrate to0.8
without any code changes.regex-lite
release:The
regex-lite 0.1.1
release contains support for the new word boundaryassertions. 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.
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.
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 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 Mend Renovate. View repository job log here.