Dear maintainer:
During a rebuild of all packages in unstable, this package failed to build.
Below you will find the last part of the build log (probably the most
relevant part, but not necessarily). If required, the full build log
is available here:
https://people.debian.org/~sanvila/build-logs/202610/
About the archive rebuild: The build was made on virtual machines from AWS,
using sbuild and a reduced chroot with only build-essential packages.
If you cannot reproduce the bug please contact me privately, as I
am willing to provide ssh access to a virtual machine where the bug is
fully reproducible.
If this is really a bug in one of the build-depends, please use
reassign and add an affects on src:rust-num-prime, so that this is still
visible in the BTS web page for this package.
Thanks.
--------------------------------------------------------------------------------
[...]
--> src/nt_funcs.rs:566:20
|
566 | pub fn is_prime<T: PrimalityBase>(target: &T, config: Option<PrimalityTestConfig>) -> Primality
| ^^^^^^^^^^^^^ required by this bound in `is_prime`
error[E0277]: the trait bound `for<'r, 'r> &'r num_bigint::BigUint: num_modular::ModularUnaryOps<&'r num_bigint::BigUint>` is not satisfied
--> src/rand.rs:282:35
|
282 | assert!(is_safe_prime(&p).probably());
| ------------- ^^ the trait `for<'r, 'r> num_modular::ModularUnaryOps<&'r num_bigint::BigUint>` is not implemented for `&'r num_bigint::BigUint`
| |
| required by a bound introduced by this call
|
= help: the following other types implement trait `num_modular::ModularUnaryOps<Modulus>`:
`&Mint<T, R>` implements `num_modular::ModularUnaryOps<&Mint<T, R>>`
`&num_bigint::biguint::BigUint` implements `num_modular::ModularUnaryOps<&num_bigint::biguint::BigUint>`
`&u128` implements `num_modular::ModularUnaryOps<&u128>`
`&u16` implements `num_modular::ModularUnaryOps<&u16>`
`&u32` implements `num_modular::ModularUnaryOps<&u32>`
`&u64` implements `num_modular::ModularUnaryOps<&u64>`
`&u8` implements `num_modular::ModularUnaryOps<&u8>`
`&usize` implements `num_modular::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 num_bigint::BigUint` to implement `for<'r> PrimalityRefBase<num_bigint::BigUint>`
--> 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 `nt_funcs::is_safe_prime`
--> src/nt_funcs.rs:1009:20
|
1007 | pub fn is_safe_prime<T: PrimalityBase>(target: &T) -> Primality
| ------------- required by a bound in this function
1008 | where
1009 | for<'r> &'r T: PrimalityRefBase<T>,
| ^^^^^^^^^^^^^^^^^^^ required by this bound in `is_safe_prime`
error[E0277]: the trait bound `&BigUint: ModularCoreOps<&BigUint, &BigUint>` is not satisfied
--> src/rand.rs:282:35
|
282 | assert!(is_safe_prime(&p).probably());
| ------------- ^^ unsatisfied trait bound
| |
| required by a bound introduced by this call
|
= help: the trait `for<'r, 'r> num_modular::ModularCoreOps<&'r num_bigint::BigUint, &'r num_bigint::BigUint>` is not implemented for `&'r num_bigint::BigUint`
= help: the following other types implement trait `num_modular::ModularCoreOps<Rhs, Modulus>`:
`&Mint<T, R>` implements `num_modular::ModularCoreOps<&'b Mint<T, R>, &'b Mint<T, R>>`
`&num_bigint::biguint::BigUint` implements `num_modular::ModularCoreOps<&num_bigint::biguint::BigUint, &num_bigint::biguint::BigUint>`
`&num_bigint::biguint::BigUint` implements `num_modular::ModularCoreOps<num_bigint::biguint::BigUint, &num_bigint::biguint::BigUint>`
`&u128` implements `num_modular::ModularCoreOps<&u128, &u128>`
`&u128` implements `num_modular::ModularCoreOps<u128, &u128>`
`&u16` implements `num_modular::ModularCoreOps<&u16, &u16>`
`&u16` implements `num_modular::ModularCoreOps<u16, &u16>`
`&u32` implements `num_modular::ModularCoreOps<&u32, &u32>`
and 22 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 num_bigint::BigUint` to implement `for<'r> PrimalityRefBase<num_bigint::BigUint>`
--> src/primality.rs:381:15
|
381 | impl<T, Base> PrimalityRefBase<Base> for T where
| ^^^^^^^^^^^^^^^^^^^^^^ ^
...
385 | + for<'r> ModularCoreOps<&'r Base, &'r Base, Output = Base>
| --------------------------------------------------------- unsatisfied trait bound introduced here
note: required by a bound in `nt_funcs::is_safe_prime`
--> src/nt_funcs.rs:1009:20
|
1007 | pub fn is_safe_prime<T: PrimalityBase>(target: &T) -> Primality
| ------------- required by a bound in this function
1008 | where
1009 | for<'r> &'r T: PrimalityRefBase<T>,
| ^^^^^^^^^^^^^^^^^^^ required by this bound in `is_safe_prime`
= note: the full name for the type has been written to '/<<PKGBUILDDIR>>/target/x86_64-unknown-linux-gnu/debug/deps/num_prime-e6abd335b43719b8.long-type-7837229316896088173.txt'
= note: consider using `--verbose` to print the full type name to the console
error[E0277]: the trait bound `num_bigint::BigUint: PrimalityBase` is not satisfied
--> src/rand.rs:282:35
|
282 | assert!(is_safe_prime(&p).probably());
| ------------- ^^ unsatisfied trait bound
| |
| required by a bound introduced by this call
|
= help: the trait `for<'r> num_modular::ModularCoreOps<&'r num_bigint::BigUint, &'r num_bigint::BigUint>` is not implemented for `num_bigint::BigUint`
= help: the following other types implement trait `num_modular::ModularCoreOps<Rhs, Modulus>`:
`&Mint<T, R>` implements `num_modular::ModularCoreOps<&'b Mint<T, R>, &'b Mint<T, R>>`
`&num_bigint::biguint::BigUint` implements `num_modular::ModularCoreOps<&num_bigint::biguint::BigUint, &num_bigint::biguint::BigUint>`
`&num_bigint::biguint::BigUint` implements `num_modular::ModularCoreOps<num_bigint::biguint::BigUint, &num_bigint::biguint::BigUint>`
`&u128` implements `num_modular::ModularCoreOps<&u128, &u128>`
`&u128` implements `num_modular::ModularCoreOps<u128, &u128>`
`&u16` implements `num_modular::ModularCoreOps<&u16, &u16>`
`&u16` implements `num_modular::ModularCoreOps<u16, &u16>`
`&u32` implements `num_modular::ModularCoreOps<&u32, &u32>`
and 22 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 `num_bigint::BigUint` to implement `for<'r> ModularOps<&'r num_bigint::BigUint, &'r num_bigint::BigUint>`
= note: required for `num_bigint::BigUint` to implement `ModularRefOps`
note: required for `num_bigint::BigUint` to implement `PrimalityBase`
--> src/primality.rs:368:7
|
367 | + ModularRefOps,
| ------------- unsatisfied trait bound introduced here
368 | > PrimalityBase for T
| ^^^^^^^^^^^^^ ^
note: required by a bound in `nt_funcs::is_safe_prime`
--> src/nt_funcs.rs:1007:25
|
1007 | pub fn is_safe_prime<T: PrimalityBase>(target: &T) -> Primality
| ^^^^^^^^^^^^^ required by this bound in `is_safe_prime`
error[E0277]: the trait bound `num_bigint::BigUint: PrimalityBase` is not satisfied
--> src/rand.rs:282:35
|
282 | assert!(is_safe_prime(&p).probably());
| ------------- ^^ the trait `for<'r> num_modular::ModularUnaryOps<&'r num_bigint::BigUint>` is not implemented for `num_bigint::BigUint`
| |
| required by a bound introduced by this call
|
= help: the following other types implement trait `num_modular::ModularUnaryOps<Modulus>`:
`&Mint<T, R>` implements `num_modular::ModularUnaryOps<&Mint<T, R>>`
`&num_bigint::biguint::BigUint` implements `num_modular::ModularUnaryOps<&num_bigint::biguint::BigUint>`
`&u128` implements `num_modular::ModularUnaryOps<&u128>`
`&u16` implements `num_modular::ModularUnaryOps<&u16>`
`&u32` implements `num_modular::ModularUnaryOps<&u32>`
`&u64` implements `num_modular::ModularUnaryOps<&u64>`
`&u8` implements `num_modular::ModularUnaryOps<&u8>`
`&usize` implements `num_modular::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 `num_bigint::BigUint` to implement `for<'r> ModularOps<&'r num_bigint::BigUint, &'r num_bigint::BigUint>`
= note: required for `num_bigint::BigUint` to implement `ModularRefOps`
note: required for `num_bigint::BigUint` to implement `PrimalityBase`
--> src/primality.rs:368:7
|
367 | + ModularRefOps,
| ------------- unsatisfied trait bound introduced here
368 | > PrimalityBase for T
| ^^^^^^^^^^^^^ ^
note: required by a bound in `nt_funcs::is_safe_prime`
--> src/nt_funcs.rs:1007:25
|
1007 | pub fn is_safe_prime<T: PrimalityBase>(target: &T) -> Primality
| ^^^^^^^^^^^^^ required by this bound in `is_safe_prime`
error[E0277]: the trait bound `num_bigint::BigUint: PrimalityBase` is not satisfied
--> src/rand.rs:282:35
|
282 | assert!(is_safe_prime(&p).probably());
| ------------- ^^ the trait `for<'r> num_modular::ModularPow<&'r num_bigint::BigUint, &'r num_bigint::BigUint>` is not implemented for `num_bigint::BigUint`
| |
| required by a bound introduced by this call
|
= help: the following other types implement trait `num_modular::ModularPow<Exp, Modulus>`:
`&num_bigint::biguint::BigUint` implements `num_modular::ModularPow<&num_bigint::biguint::BigUint, &num_bigint::biguint::BigUint>`
`&num_bigint::biguint::BigUint` implements `num_modular::ModularPow<num_bigint::biguint::BigUint, &num_bigint::biguint::BigUint>`
`&u128` implements `num_modular::ModularPow<&u128, &u128>`
`&u128` implements `num_modular::ModularPow<u128, &u128>`
`&u16` implements `num_modular::ModularPow<&u16, &u16>`
`&u16` implements `num_modular::ModularPow<u16, &u16>`
`&u32` implements `num_modular::ModularPow<&u32, &u32>`
`&u32` implements `num_modular::ModularPow<u32, &u32>`
and 21 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 `num_bigint::BigUint` to implement `for<'r> ModularOps<&'r num_bigint::BigUint, &'r num_bigint::BigUint>`
= note: required for `num_bigint::BigUint` to implement `ModularRefOps`
note: required for `num_bigint::BigUint` to implement `PrimalityBase`
--> src/primality.rs:368:7
|
367 | + ModularRefOps,
| ------------- unsatisfied trait bound introduced here
368 | > PrimalityBase for T
| ^^^^^^^^^^^^^ ^
note: required by a bound in `nt_funcs::is_safe_prime`
--> src/nt_funcs.rs:1007:25
|
1007 | pub fn is_safe_prime<T: PrimalityBase>(target: &T) -> Primality
| ^^^^^^^^^^^^^ required by this bound in `is_safe_prime`
error[E0277]: the trait bound `num_bigint::BigUint: PrimalityBase` is not satisfied
--> src/rand.rs:282:35
|
282 | assert!(is_safe_prime(&p).probably());
| ------------- ^^ the trait `for<'r> num_modular::ModularSymbols<&'r num_bigint::BigUint>` is not implemented for `num_bigint::BigUint`
| |
| required by a bound introduced by this call
|
= help: the following other types implement trait `num_modular::ModularSymbols<Modulus>`:
`Mint<T, R>` implements `num_modular::ModularSymbols<&Mint<T, R>>`
`i128` implements `num_modular::ModularSymbols<&i128>`
`i16` implements `num_modular::ModularSymbols<&i16>`
`i32` implements `num_modular::ModularSymbols<&i32>`
`i64` implements `num_modular::ModularSymbols<&i64>`
`i8` implements `num_modular::ModularSymbols<&i8>`
`isize` implements `num_modular::ModularSymbols<&isize>`
`num_bigint::bigint::BigInt` implements `num_modular::ModularSymbols<&num_bigint::bigint::BigInt>`
and 7 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 `num_bigint::BigUint` to implement `for<'r> ModularOps<&'r num_bigint::BigUint, &'r num_bigint::BigUint>`
= note: required for `num_bigint::BigUint` to implement `ModularRefOps`
note: required for `num_bigint::BigUint` to implement `PrimalityBase`
--> src/primality.rs:368:7
|
367 | + ModularRefOps,
| ------------- unsatisfied trait bound introduced here
368 | > PrimalityBase for T
| ^^^^^^^^^^^^^ ^
note: required by a bound in `nt_funcs::is_safe_prime`
--> src/nt_funcs.rs:1007:25
|
1007 | pub fn is_safe_prime<T: PrimalityBase>(target: &T) -> Primality
| ^^^^^^^^^^^^^ required by this bound in `is_safe_prime`
error: could not compile `num-prime` (lib test) due to 90 previous errors
Caused by:
process didn't exit successfully: `CARGO=/usr/bin/cargo CARGO_CRATE_NAME=num_prime CARGO_MANIFEST_DIR=/<<PKGBUILDDIR>> CARGO_MANIFEST_PATH=/<<PKGBUILDDIR>>/Cargo.toml CARGO_PKG_AUTHORS='' CARGO_PKG_DESCRIPTION='Generic and optimized primality test, factorization and various number theoretic functions with arbitrary precision based on `num`.
' CARGO_PKG_HOMEPAGE='' CARGO_PKG_LICENSE=Apache-2.0 CARGO [too-long-redacted] argo/registry` (exit status: 1)
dh_auto_test: error: /usr/share/cargo/bin/cargo test --all returned exit code 101
make[1]: *** [debian/rules:6: override_dh_auto_test] Error 25
make[1]: Leaving directory '/<<PKGBUILDDIR>>'
make: *** [debian/rules:3: binary] Error 2
dpkg-buildpackage: error: debian/rules binary subprocess failed with exit status 2
--------------------------------------------------------------------------------