[renovate]

This PR contains the following updates:

Package	Type	Update	Change
num-prime	workspace.dependencies	minor	0.6.0 → 0.7.0

---

Release Notes

uutils/num-prime (num-prime)

v0.7.0

Compare Source

What's Changed

• chore: dual-license under MIT OR Apache-2.0 by @​xtqqczze in #​125
• build: remove rust-version from private crates by @​xtqqczze in #​129
• build: update package edition to 2021 by @​xtqqczze in #​124
• factor: seed Pollard's rho deterministically by @​sylvestre in #​121
• fixup! factor: move the rho generator into a splitmix64 module by @​xtqqczze in #​138
• chore(deps): update rust crates by @​xtqqczze in #​128
• perf: drop the Montgomery-form comparison from Pollard's rho by @​cmpute in #​137
• ci: add minimal permissions to workflows by @​xtqqczze in #​142

# Dependencies

• chore(deps): update rust crate either to v1.19.0 by @​renovate[bot] in #​140
• build!: upgrade Rust crate num-modular to v0.6.5 by @​xtqqczze in #​127

New Contributors

• @​cmpute made their first contribution in #​137

Full Changelog: uutils/num-prime@v0.6.1...v0.7.0

---

Configuration

📅 Schedule: (UTC)

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

---

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

---

This PR was generated by Mend Renovate. View the repository job log.

[codspeed]

Merging this PR will improve performance by 52.07%

⚠️ 32 benchmarks spent significant time in system calls

System calls cannot be consistently instrumented, so they are not included in the measure, which understates the real cost. Please switch to the Walltime instrument to accurately measure system calls.

Measurement and system calls

• complex_relative_date
• du_deep_tree[(100, 3)]
• du_wide_tree[(5000, 500)]
• single_date_now
• dd_copy_64k_blocks
• dd_copy_8k_blocks
• du_summarize_balanced_tree[(5, 4, 10)]
• dd_copy_partial
• dd_copy_1m_blocks
• dd_copy_separate_blocks
• …and 22 more

⚠️ Different runtime environments detected

Some benchmarks with significant performance changes were compared across different runtime environments,
which may affect the accuracy of the results.

Open the report in CodSpeed to investigate

⚡ 5 improved benchmarks
✅ 44 untouched benchmarks
⏩ 406 skipped benchmarks¹

Performance Changes

	Benchmark	BASE	HEAD	Efficiency
⚡	file_tz_abbreviations	35.4 ms	18.8 ms	+87.73%
⚡	file_custom_format	30 ms	17.3 ms	+73.37%
⚡	file_iso_dates	31.5 ms	19 ms	+66.19%
⚡	file_localized_names	41.9 ms	29.4 ms	+42.75%
⚡ ⚠️	complex_relative_date	292.4 µs	277.7 µs	+5.31%

Tip

Curious why performance improved? Comment @codspeedbot explain why performance improved on this PR, or directly use the CodSpeed MCP with your agent.

---

_{Comparing renovate/num-prime-0.x (d23d393) with main (99e8fbe)²}

Footnotes

1. 406 benchmarks were skipped, so the baseline results were used instead. If they were deleted from the codebase, click here and archive them to remove them from the performance reports. ↩

2. No successful run was found on main (edea82f) during the generation of this report, so 99e8fbe was used instead as the comparison base. There might be some changes unrelated to this pull request in this report. ↩

[xtqqczze]

num-modular v0.6.6 had a breaking change (cmpute/num-modular#16):

  error[E0277]: the trait bound `for<'r, 'r> &'r BigUint: ModularUnaryOps<&'r BigUint>` is not satisfied
     --> /home/tester/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/num-prime-0.7.0/src/rand.rs:190:25
      |
  190 |             if is_prime(&t, config).probably() {
      |                -------- ^^ the trait `for<'r, 'r> ModularUnaryOps<&'r BigUint>` is not implemented for `&'r BigUint`
      |                |
      |                required by a bound introduced by this call
      |
      = help: the following other types implement trait `ModularUnaryOps<Modulus>`:
                `&Mint<T, R>` implements `ModularUnaryOps<&Mint<T, R>>`
                `&num_bigint::biguint::BigUint` implements `ModularUnaryOps<&num_bigint::biguint::BigUint>`
                `&u128` implements `ModularUnaryOps<&u128>`
                `&u16` implements `ModularUnaryOps<&u16>`
                `&u32` implements `ModularUnaryOps<&u32>`
                `&u64` implements `ModularUnaryOps<&u64>`
                `&u8` implements `ModularUnaryOps<&u8>`
                `&usize` implements `ModularUnaryOps<&usize>`
              and 8 others
      = note: there are multiple different versions of crate `num_bigint` in the dependency graph
      = help: you can use `cargo tree` to explore your dependency tree
  note: required for `&'r BigUint` to implement `for<'r> PrimalityRefBase<BigUint>`
     --> /home/tester/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/num-prime-0.7.0/src/primality.rs:381:15
      |
  381 | impl<T, Base> PrimalityRefBase<Base> for T where
      |               ^^^^^^^^^^^^^^^^^^^^^^     ^
  ...
  384 |         + for<'r> ModularUnaryOps<&'r Base, Output = Base>
      |           ------------------------------------------------ unsatisfied trait bound introduced here
  note: required by a bound in `is_prime`
     --> /home/tester/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/num-prime-0.7.0/src/nt_funcs.rs:607:20
      |
  605 | pub fn is_prime<T: PrimalityBase>(target: &T, config: Option<PrimalityTestConfig>) -> Primality
      |        -------- required by a bound in this function
  606 | where
  607 |     for<'r> &'r T: PrimalityRefBase<T>,
      |                    ^^^^^^^^^^^^^^^^^^^ required by this bound in `is_prime`

[xtqqczze]

@sylvestre num-modular v0.6.6 was yanked, needs to be rebased