search

Inner-Heaven / libzetta-rs

Stable interface for programmatic administration of ZFS from Rust
BSD 2-Clause "Simplified" License
62 stars 15 forks source link

chore(deps): bump regex from 1.9.4 to 1.10.2 #253

Open dependabot[bot] opened 1 year ago

dependabot[bot] commented 1 year ago

Bumps regex from 1.9.4 to 1.10.2.

Changelog

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:

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

... (truncated)

Commits
  • 5f1f1c8 1.10.2
  • 1a54a82 deps: bump regex-automata to 0.4.3
  • 61242b1 regex-automata-0.4.3
  • 50fe7d1 changelog: 1.10.2
  • eb950f6 automata/meta: revert broadening of reverse suffix optimization
  • e7bd19d regex-lite-0.1.5
  • 0086dec lite: fix stack overflow test
  • 4ae1472 tests: fix compilation of doctests on 32-bit architectures
  • cd79881 regex-lite-0.1.4
  • 466e42c lite: fix stack overflow in NFA compiler
  • Additional commits viewable in compare view


Dependabot compatibility score

Dependabot will resolve any conflicts with this PR as long as you don't alter it yourself. You can also trigger a rebase manually by commenting @dependabot rebase.

Dependabot commands and options
You can trigger Dependabot actions by commenting on this PR: - `@dependabot rebase` will rebase this PR - `@dependabot recreate` will recreate this PR, overwriting any edits that have been made to it - `@dependabot merge` will merge this PR after your CI passes on it - `@dependabot squash and merge` will squash and merge this PR after your CI passes on it - `@dependabot cancel merge` will cancel a previously requested merge and block automerging - `@dependabot reopen` will reopen this PR if it is closed - `@dependabot close` will close this PR and stop Dependabot recreating it. You can achieve the same result by closing it manually - `@dependabot show ignore conditions` will show all of the ignore conditions of the specified dependency - `@dependabot ignore this major version` will close this PR and stop Dependabot creating any more for this major version (unless you reopen the PR or upgrade to it yourself) - `@dependabot ignore this minor version` will close this PR and stop Dependabot creating any more for this minor version (unless you reopen the PR or upgrade to it yourself) - `@dependabot ignore this dependency` will close this PR and stop Dependabot creating any more for this dependency (unless you reopen the PR or upgrade to it yourself)