crates.io / num-integer / 0.1.47
num-integer 0.1.47
- Source
- https://github.com/rust-num/num-integer
- Artifact scanned
num-integer-0.1.47.crate- Compared with
num-integer-0.1.46.crate(1 signals introduced since)- Files
- 10 scanned, 7 skipped (binary, oversized, or unrecognised)
- Signals
- 0 critical · 0 warn · 7 info
- Scan time
- 0.2 s
- LLM review
- LLM review by claude-haiku-5-5 (Anthropic): nothing at warn or critical to review.
- Disclude version
- 4.3.0
- Scanned (UTC)
- 2026-10-24 08:00
Signals
Ordered by severity, then signals introduced in this release. Hidden characters are shown as ⟨U+…⟩.
-
// Algorithm SqrtRem(n = a₃b³ + a₂b² + a₁b + a₀) // Input: 0 ≤ aᵢ < b with a₃ ≥ b/4 // Output: (s,r) such that s² ≤ n = s² + r < (s+1)² debug_assert!; -
/// /// This is solving for `r` in `rⁿ = x`, rounding toward zero. /// If `x` is positive, the result will satisfy `rⁿ ≤ x < (r+1)ⁿ`. /// If `x` is negative and `n` is odd, then `(r-1)ⁿ < x ≤ rⁿ`. -
/// This is solving for `r` in `rⁿ = x`, rounding toward zero. /// If `x` is positive, the result will satisfy `rⁿ ≤ x < (r+1)ⁿ`. /// If `x` is negative and `n` is odd, then `(r-1)ⁿ < x ≤ rⁿ`. /// -
/// If `x` is positive, the result will satisfy `rⁿ ≤ x < (r+1)ⁿ`. /// If `x` is negative and `n` is odd, then `(r-1)ⁿ < x ≤ rⁿ`. /// /// # Panics -
// 128-bit `checked_mul` also involves division, but we can't always // compute `hiⁿ` without risking overflow. Try to avoid it though... if hi.next_power_of_two.trailing_zeros * n >= -
/// /// If `x` is positive, check `rⁿ ≤ x < (r+1)ⁿ`. /// If `x` is negative, check `(r-1)ⁿ < x ≤ rⁿ`. -
/// If `x` is positive, check `rⁿ ≤ x < (r+1)ⁿ`. /// If `x` is negative, check `(r-1)ⁿ < x ≤ rⁿ`.
Reproduce This Scan
Run disclude locally to verify. These commands scan the published file; the "new in this release" marks come from comparing it with the previous release's file, which they don't repeat. Add --format sarif for SARIF output. Add --llm (with an API key in the environment) to include the LLM review.
|
&&