mirror of
https://github.com/rust-lang/rust.git
synced 2024-10-30 22:12:15 +00:00
Reword "Required because of the requirements on the impl of ..."
This commit is contained in:
parent
8064a49508
commit
84a199369b
@ -2537,9 +2537,9 @@ impl<'a, 'tcx> InferCtxtExt<'tcx> for InferCtxt<'a, 'tcx> {
|
||||
parent_trait_pred.remap_constness_diag(param_env);
|
||||
let parent_def_id = parent_trait_pred.def_id();
|
||||
let msg = format!(
|
||||
"required because of the requirements on the impl of `{}` for `{}`",
|
||||
parent_trait_pred.print_modifiers_and_trait_path(),
|
||||
parent_trait_pred.skip_binder().self_ty()
|
||||
"required for `{}` to implement `{}`",
|
||||
parent_trait_pred.skip_binder().self_ty(),
|
||||
parent_trait_pred.print_modifiers_and_trait_path()
|
||||
);
|
||||
let mut is_auto_trait = false;
|
||||
match self.tcx.hir().get_if_local(data.impl_def_id) {
|
||||
@ -2608,9 +2608,9 @@ impl<'a, 'tcx> InferCtxtExt<'tcx> for InferCtxt<'a, 'tcx> {
|
||||
pluralize!(count)
|
||||
));
|
||||
err.note(&format!(
|
||||
"required because of the requirements on the impl of `{}` for `{}`",
|
||||
parent_trait_pred.print_modifiers_and_trait_path(),
|
||||
parent_trait_pred.skip_binder().self_ty()
|
||||
"required for `{}` to implement `{}`",
|
||||
parent_trait_pred.skip_binder().self_ty(),
|
||||
parent_trait_pred.print_modifiers_and_trait_path()
|
||||
));
|
||||
}
|
||||
// #74711: avoid a stack overflow
|
||||
|
@ -39,7 +39,7 @@ error[E0277]: the trait bound `T: Clone` is not satisfied
|
||||
LL | type Bar: Clone = Vec<T>;
|
||||
| ^^^^^^ the trait `Clone` is not implemented for `T`
|
||||
|
|
||||
= note: required because of the requirements on the impl of `Clone` for `Vec<T>`
|
||||
= note: required for `Vec<T>` to implement `Clone`
|
||||
note: required by a bound in `Foo::Bar`
|
||||
--> $DIR/defaults-suitability.rs:28:15
|
||||
|
|
||||
@ -83,7 +83,7 @@ error[E0277]: the trait bound `<Self as Foo2<T>>::Baz: Clone` is not satisfied
|
||||
LL | type Bar: Clone = Vec<Self::Baz>;
|
||||
| ^^^^^^^^^^^^^^ the trait `Clone` is not implemented for `<Self as Foo2<T>>::Baz`
|
||||
|
|
||||
= note: required because of the requirements on the impl of `Clone` for `Vec<<Self as Foo2<T>>::Baz>`
|
||||
= note: required for `Vec<<Self as Foo2<T>>::Baz>` to implement `Clone`
|
||||
note: required by a bound in `Foo2::Bar`
|
||||
--> $DIR/defaults-suitability.rs:65:15
|
||||
|
|
||||
@ -100,7 +100,7 @@ error[E0277]: the trait bound `<Self as Foo25<T>>::Baz: Clone` is not satisfied
|
||||
LL | type Bar: Clone = Vec<Self::Baz>;
|
||||
| ^^^^^^^^^^^^^^ the trait `Clone` is not implemented for `<Self as Foo25<T>>::Baz`
|
||||
|
|
||||
= note: required because of the requirements on the impl of `Clone` for `Vec<<Self as Foo25<T>>::Baz>`
|
||||
= note: required for `Vec<<Self as Foo25<T>>::Baz>` to implement `Clone`
|
||||
note: required by a bound in `Foo25::Bar`
|
||||
--> $DIR/defaults-suitability.rs:74:15
|
||||
|
|
||||
|
@ -5,13 +5,13 @@ LL | impl X<'_> for u32
|
||||
| ^^^^^^^^^^^^^^^^^^
|
||||
|
|
||||
= help: consider increasing the recursion limit by adding a `#![recursion_limit = "256"]` attribute to your crate (`hr_associated_type_bound_2`)
|
||||
note: required because of the requirements on the impl of `for<'b> X<'b>` for `u32`
|
||||
note: required for `u32` to implement `for<'b> X<'b>`
|
||||
--> $DIR/hr-associated-type-bound-2.rs:11:6
|
||||
|
|
||||
LL | impl X<'_> for u32
|
||||
| ^^^^^ ^^^
|
||||
= note: 128 redundant requirements hidden
|
||||
= note: required because of the requirements on the impl of `for<'b> X<'b>` for `u32`
|
||||
= note: required for `u32` to implement `for<'b> X<'b>`
|
||||
|
||||
error: aborting due to previous error
|
||||
|
||||
|
@ -4,13 +4,13 @@ error[E0275]: overflow evaluating the requirement `<(T,) as Grault>::A == _`
|
||||
LL | impl<T: Grault> Grault for (T,)
|
||||
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
|
||||
|
|
||||
note: required because of the requirements on the impl of `Grault` for `(T,)`
|
||||
note: required for `(T,)` to implement `Grault`
|
||||
--> $DIR/impl-wf-cycle-1.rs:15:17
|
||||
|
|
||||
LL | impl<T: Grault> Grault for (T,)
|
||||
| ^^^^^^ ^^^^
|
||||
= note: 1 redundant requirement hidden
|
||||
= note: required because of the requirements on the impl of `Grault` for `(T,)`
|
||||
= note: required for `(T,)` to implement `Grault`
|
||||
|
||||
error: aborting due to previous error
|
||||
|
||||
|
@ -4,7 +4,7 @@ error[E0275]: overflow evaluating the requirement `<(T,) as Grault>::A == _`
|
||||
LL | impl<T: Grault> Grault for (T,)
|
||||
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
|
||||
|
|
||||
note: required because of the requirements on the impl of `Grault` for `(T,)`
|
||||
note: required for `(T,)` to implement `Grault`
|
||||
--> $DIR/impl-wf-cycle-2.rs:7:17
|
||||
|
|
||||
LL | impl<T: Grault> Grault for (T,)
|
||||
|
@ -9,7 +9,7 @@ note: expected this to be `&()`
|
||||
|
|
||||
LL | type Element = ();
|
||||
| ^^
|
||||
note: required because of the requirements on the impl of `Visit` for `()`
|
||||
note: required for `()` to implement `Visit`
|
||||
--> $DIR/issue-44153.rs:13:10
|
||||
|
|
||||
LL | impl<'a> Visit for () where
|
||||
|
@ -18,7 +18,7 @@ LL | let closure = |config: &mut <S as MPU>::MpuConfig| writer.my_write(
|
||||
| ^^^^^^^ the trait `MyDisplay` is not implemented for `T`
|
||||
|
|
||||
= help: the trait `MyDisplay` is implemented for `&'a mut T`
|
||||
note: required because of the requirements on the impl of `MyDisplay` for `&mut T`
|
||||
note: required for `&mut T` to implement `MyDisplay`
|
||||
--> $DIR/issue-65774-1.rs:5:24
|
||||
|
|
||||
LL | impl<'a, T: MyDisplay> MyDisplay for &'a mut T { }
|
||||
|
@ -77,7 +77,7 @@ LL | <str as Foo<u8>>::bar;
|
||||
| ^^^^^^^^^^^^^^^^^^^^^ doesn't have a size known at compile-time
|
||||
|
|
||||
= help: the trait `Sized` is not implemented for `str`
|
||||
note: required because of the requirements on the impl of `Foo<'_, '_, u8>` for `str`
|
||||
note: required for `str` to implement `Foo<'_, '_, u8>`
|
||||
--> $DIR/substs-ppaux.rs:11:17
|
||||
|
|
||||
LL | impl<'a,'b,T,S> Foo<'a, 'b, S> for T {}
|
||||
|
@ -77,7 +77,7 @@ LL | <str as Foo<u8>>::bar;
|
||||
| ^^^^^^^^^^^^^^^^^^^^^ doesn't have a size known at compile-time
|
||||
|
|
||||
= help: the trait `Sized` is not implemented for `str`
|
||||
note: required because of the requirements on the impl of `Foo<'_#0r, '_#1r, u8>` for `str`
|
||||
note: required for `str` to implement `Foo<'_#0r, '_#1r, u8>`
|
||||
--> $DIR/substs-ppaux.rs:11:17
|
||||
|
|
||||
LL | impl<'a,'b,T,S> Foo<'a, 'b, S> for T {}
|
||||
|
@ -41,7 +41,7 @@ LL | require_send(send_fut);
|
||||
| ^^^^^^^^^^^^ `RefCell<i32>` cannot be shared between threads safely
|
||||
|
|
||||
= help: the trait `Sync` is not implemented for `RefCell<i32>`
|
||||
= note: required because of the requirements on the impl of `Send` for `Arc<RefCell<i32>>`
|
||||
= note: required for `Arc<RefCell<i32>>` to implement `Send`
|
||||
note: required because it's used within this `async fn` body
|
||||
--> $DIR/issue-68112.rs:47:31
|
||||
|
|
||||
|
@ -26,7 +26,7 @@ LL | [1; ().await];
|
||||
|
|
||||
= help: the trait `Future` is not implemented for `()`
|
||||
= note: () must be a future or must implement `IntoFuture` to be awaited
|
||||
= note: required because of the requirements on the impl of `IntoFuture` for `()`
|
||||
= note: required for `()` to implement `IntoFuture`
|
||||
help: remove the `.await`
|
||||
|
|
||||
LL - [1; ().await];
|
||||
|
@ -5,7 +5,7 @@ LL | fn foo(tx: std::sync::mpsc::Sender<i32>) -> impl Future + Send {
|
||||
| ^^^^^^^^^^^^^^^^^^ `Sender<i32>` cannot be shared between threads safely
|
||||
|
|
||||
= help: the trait `Sync` is not implemented for `Sender<i32>`
|
||||
= note: required because of the requirements on the impl of `Send` for `&Sender<i32>`
|
||||
= note: required for `&Sender<i32>` to implement `Send`
|
||||
note: required because it's used within this closure
|
||||
--> $DIR/issue-70935-complex-spans.rs:16:13
|
||||
|
|
||||
|
@ -32,7 +32,7 @@ LL | (|_| 2333).await;
|
||||
|
|
||||
= help: the trait `Future` is not implemented for `[closure@$DIR/issue-62009-1.rs:12:6: 12:9]`
|
||||
= note: [closure@$DIR/issue-62009-1.rs:12:6: 12:9] must be a future or must implement `IntoFuture` to be awaited
|
||||
= note: required because of the requirements on the impl of `IntoFuture` for `[closure@$DIR/issue-62009-1.rs:12:6: 12:9]`
|
||||
= note: required for `[closure@$DIR/issue-62009-1.rs:12:6: 12:9]` to implement `IntoFuture`
|
||||
help: remove the `.await`
|
||||
|
|
||||
LL - (|_| 2333).await;
|
||||
|
@ -8,7 +8,7 @@ LL | boo().await;
|
||||
|
|
||||
= help: the trait `Future` is not implemented for `()`
|
||||
= note: () must be a future or must implement `IntoFuture` to be awaited
|
||||
= note: required because of the requirements on the impl of `IntoFuture` for `()`
|
||||
= note: required for `()` to implement `IntoFuture`
|
||||
help: remove the `.await`
|
||||
|
|
||||
LL - boo().await;
|
||||
|
@ -5,7 +5,7 @@ LL | is_defaulted::<&'static u32>();
|
||||
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the trait `Signed` is not implemented for `u32`
|
||||
|
|
||||
= help: the trait `Signed` is implemented for `i32`
|
||||
note: required because of the requirements on the impl of `Defaulted` for `&'static u32`
|
||||
note: required for `&'static u32` to implement `Defaulted`
|
||||
--> $DIR/typeck-default-trait-impl-precedence.rs:10:19
|
||||
|
|
||||
LL | impl<'a,T:Signed> Defaulted for &'a T { }
|
||||
|
@ -5,7 +5,7 @@ LL | b + 3
|
||||
| ^ the trait `Scalar` is not implemented for `{integer}`
|
||||
|
|
||||
= help: the trait `Scalar` is implemented for `f64`
|
||||
note: required because of the requirements on the impl of `Add<{integer}>` for `Bob`
|
||||
note: required for `Bob` to implement `Add<{integer}>`
|
||||
--> $DIR/issue-22645.rs:8:19
|
||||
|
|
||||
LL | impl<RHS: Scalar> Add <RHS> for Bob {
|
||||
|
@ -5,7 +5,7 @@ LL | let t = thread::spawn(|| {
|
||||
| ^^^^^^^^^^^^^ `std::sync::mpsc::Receiver<()>` cannot be shared between threads safely
|
||||
|
|
||||
= help: the trait `Sync` is not implemented for `std::sync::mpsc::Receiver<()>`
|
||||
= note: required because of the requirements on the impl of `Send` for `&std::sync::mpsc::Receiver<()>`
|
||||
= note: required for `&std::sync::mpsc::Receiver<()>` to implement `Send`
|
||||
note: required because it's used within this closure
|
||||
--> $DIR/closure-move-sync.rs:6:27
|
||||
|
|
||||
@ -24,7 +24,7 @@ LL | thread::spawn(|| tx.send(()).unwrap());
|
||||
| ^^^^^^^^^^^^^ `Sender<()>` cannot be shared between threads safely
|
||||
|
|
||||
= help: the trait `Sync` is not implemented for `Sender<()>`
|
||||
= note: required because of the requirements on the impl of `Send` for `&Sender<()>`
|
||||
= note: required for `&Sender<()>` to implement `Send`
|
||||
note: required because it's used within this closure
|
||||
--> $DIR/closure-move-sync.rs:18:19
|
||||
|
|
||||
|
@ -1,13 +1,13 @@
|
||||
error[E0275]: overflow evaluating the requirement `T: Trait<_>`
|
||||
|
|
||||
= help: consider increasing the recursion limit by adding a `#![recursion_limit = "256"]` attribute to your crate (`issue_100191_2`)
|
||||
note: required because of the requirements on the impl of `Trait<_>` for `T`
|
||||
note: required for `T` to implement `Trait<_>`
|
||||
--> $DIR/issue-100191-2.rs:8:20
|
||||
|
|
||||
LL | default impl<T, U> Trait<T> for U {}
|
||||
| ^^^^^^^^ ^
|
||||
= note: 128 redundant requirements hidden
|
||||
= note: required because of the requirements on the impl of `Trait<_>` for `T`
|
||||
= note: required for `T` to implement `Trait<_>`
|
||||
|
||||
error: aborting due to previous error
|
||||
|
||||
|
@ -5,7 +5,7 @@ LL | assert_impl::<HasCastInTraitImpl<{ N + 1 }, { N as u128 }>>();
|
||||
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
|
||||
|
|
||||
= help: try adding a `where` bound using this expression: `where [(); { O as u128 }]:`
|
||||
note: required because of the requirements on the impl of `Trait` for `HasCastInTraitImpl<{ N + 1 }, { N as u128 }>`
|
||||
note: required for `HasCastInTraitImpl<{ N + 1 }, { N as u128 }>` to implement `Trait`
|
||||
--> $DIR/abstract-const-as-cast-3.rs:8:22
|
||||
|
|
||||
LL | impl<const O: usize> Trait for HasCastInTraitImpl<O, { O as u128 }> {}
|
||||
@ -32,7 +32,7 @@ LL | assert_impl::<HasCastInTraitImpl<{ N + 1 }, { N as _ }>>();
|
||||
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
|
||||
|
|
||||
= help: try adding a `where` bound using this expression: `where [(); { O as u128 }]:`
|
||||
note: required because of the requirements on the impl of `Trait` for `HasCastInTraitImpl<{ N + 1 }, { N as _ }>`
|
||||
note: required for `HasCastInTraitImpl<{ N + 1 }, { N as _ }>` to implement `Trait`
|
||||
--> $DIR/abstract-const-as-cast-3.rs:8:22
|
||||
|
|
||||
LL | impl<const O: usize> Trait for HasCastInTraitImpl<O, { O as u128 }> {}
|
||||
@ -77,7 +77,7 @@ LL | assert_impl::<HasCastInTraitImpl<{ N + 1 }, { N as u128 }>>();
|
||||
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
|
||||
|
|
||||
= help: try adding a `where` bound using this expression: `where [(); { O as u128 }]:`
|
||||
note: required because of the requirements on the impl of `Trait` for `HasCastInTraitImpl<{ N + 1 }, { N as u128 }>`
|
||||
note: required for `HasCastInTraitImpl<{ N + 1 }, { N as u128 }>` to implement `Trait`
|
||||
--> $DIR/abstract-const-as-cast-3.rs:8:22
|
||||
|
|
||||
LL | impl<const O: usize> Trait for HasCastInTraitImpl<O, { O as u128 }> {}
|
||||
@ -104,7 +104,7 @@ LL | assert_impl::<HasCastInTraitImpl<{ N + 1 }, { N as _ }>>();
|
||||
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
|
||||
|
|
||||
= help: try adding a `where` bound using this expression: `where [(); { O as u128 }]:`
|
||||
note: required because of the requirements on the impl of `Trait` for `HasCastInTraitImpl<{ N + 1 }, { N as _ }>`
|
||||
note: required for `HasCastInTraitImpl<{ N + 1 }, { N as _ }>` to implement `Trait`
|
||||
--> $DIR/abstract-const-as-cast-3.rs:8:22
|
||||
|
|
||||
LL | impl<const O: usize> Trait for HasCastInTraitImpl<O, { O as u128 }> {}
|
||||
|
@ -7,12 +7,12 @@ LL | writes_to_specific_path(&cap);
|
||||
| required by a bound introduced by this call
|
||||
|
|
||||
= help: the trait `Delegates<U>` is implemented for `T`
|
||||
note: required because of the requirements on the impl of `Contains<(), true>` for `&C`
|
||||
note: required for `&C` to implement `Contains<(), true>`
|
||||
--> $DIR/issue-85848.rs:21:12
|
||||
|
|
||||
LL | impl<T, U> Contains<T, { contains::<T, U>() }> for U where T: _Contains<U> {}
|
||||
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ ^
|
||||
note: required because of the requirements on the impl of `Delegates<()>` for `&C`
|
||||
note: required for `&C` to implement `Delegates<()>`
|
||||
--> $DIR/issue-85848.rs:12:12
|
||||
|
|
||||
LL | impl<T, U> Delegates<U> for T where T: Contains<U, true> {}
|
||||
@ -32,12 +32,12 @@ LL | writes_to_specific_path(&cap);
|
||||
| required by a bound introduced by this call
|
||||
|
|
||||
= help: try adding a `where` bound using this expression: `where [(); { contains::<T, U>() }]:`
|
||||
note: required because of the requirements on the impl of `Contains<(), true>` for `&C`
|
||||
note: required for `&C` to implement `Contains<(), true>`
|
||||
--> $DIR/issue-85848.rs:21:12
|
||||
|
|
||||
LL | impl<T, U> Contains<T, { contains::<T, U>() }> for U where T: _Contains<U> {}
|
||||
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ ^
|
||||
note: required because of the requirements on the impl of `Delegates<()>` for `&C`
|
||||
note: required for `&C` to implement `Delegates<()>`
|
||||
--> $DIR/issue-85848.rs:12:12
|
||||
|
|
||||
LL | impl<T, U> Delegates<U> for T where T: Contains<U, true> {}
|
||||
|
@ -4,7 +4,7 @@ error[E0277]: the trait bound `Bar: Copy` is not satisfied
|
||||
LL | let _: [Option<Bar>; 2] = [no_copy(); 2];
|
||||
| ^^^^^^^^^ the trait `Copy` is not implemented for `Bar`
|
||||
|
|
||||
= note: required because of the requirements on the impl of `Copy` for `Option<Bar>`
|
||||
= note: required for `Option<Bar>` to implement `Copy`
|
||||
= note: the `Copy` trait is required because this value will be copied for each element of the array
|
||||
= help: consider creating a new `const` item and initializing it with the result of the function call to be used in the repeat position, like `const VAL: Type = const_fn();` and `let x = [VAL; 42];`
|
||||
= help: create an inline `const` block, see RFC #2920 <https://github.com/rust-lang/rfcs/pull/2920> for more information
|
||||
|
@ -4,7 +4,7 @@ error[E0277]: the trait bound `Bar: Copy` is not satisfied
|
||||
LL | let arr: [Option<Bar>; 2] = [x; 2];
|
||||
| ^ the trait `Copy` is not implemented for `Bar`
|
||||
|
|
||||
= note: required because of the requirements on the impl of `Copy` for `Option<Bar>`
|
||||
= note: required for `Option<Bar>` to implement `Copy`
|
||||
= note: the `Copy` trait is required because this value will be copied for each element of the array
|
||||
help: consider annotating `Bar` with `#[derive(Copy)]`
|
||||
|
|
||||
@ -17,7 +17,7 @@ error[E0277]: the trait bound `Bar: Copy` is not satisfied
|
||||
LL | let arr: [Option<Bar>; 2] = [x; 2];
|
||||
| ^ the trait `Copy` is not implemented for `Bar`
|
||||
|
|
||||
= note: required because of the requirements on the impl of `Copy` for `Option<Bar>`
|
||||
= note: required for `Option<Bar>` to implement `Copy`
|
||||
= note: the `Copy` trait is required because this value will be copied for each element of the array
|
||||
help: consider annotating `Bar` with `#[derive(Copy)]`
|
||||
|
|
||||
|
@ -4,7 +4,7 @@ error[E0277]: the trait bound `Bar: Copy` is not satisfied
|
||||
LL | let arr: [Option<Bar>; 2] = [x; 2];
|
||||
| ^ the trait `Copy` is not implemented for `Bar`
|
||||
|
|
||||
= note: required because of the requirements on the impl of `Copy` for `Option<Bar>`
|
||||
= note: required for `Option<Bar>` to implement `Copy`
|
||||
= note: the `Copy` trait is required because this value will be copied for each element of the array
|
||||
help: consider annotating `Bar` with `#[derive(Copy)]`
|
||||
|
|
||||
@ -17,7 +17,7 @@ error[E0277]: the trait bound `Bar: Copy` is not satisfied
|
||||
LL | let arr: [Option<Bar>; 2] = [x; 2];
|
||||
| ^ the trait `Copy` is not implemented for `Bar`
|
||||
|
|
||||
= note: required because of the requirements on the impl of `Copy` for `Option<Bar>`
|
||||
= note: required for `Option<Bar>` to implement `Copy`
|
||||
= note: the `Copy` trait is required because this value will be copied for each element of the array
|
||||
help: consider annotating `Bar` with `#[derive(Copy)]`
|
||||
|
|
||||
|
@ -4,7 +4,7 @@ error[E0277]: the trait bound `String: Copy` is not satisfied
|
||||
LL | [Foo(String::new()); 4];
|
||||
| ^^^^^^^^^^^^^^^^^^ the trait `Copy` is not implemented for `String`
|
||||
|
|
||||
note: required because of the requirements on the impl of `Copy` for `Foo<String>`
|
||||
note: required for `Foo<String>` to implement `Copy`
|
||||
--> $DIR/trait-error.rs:1:10
|
||||
|
|
||||
LL | #[derive(Copy, Clone)]
|
||||
|
@ -6,7 +6,7 @@ LL | is_copy(B { a: 1, b: C });
|
||||
| |
|
||||
| required by a bound introduced by this call
|
||||
|
|
||||
note: required because of the requirements on the impl of `Copy` for `B<C>`
|
||||
note: required for `B<C>` to implement `Copy`
|
||||
--> $DIR/deriving-copyclone.rs:9:10
|
||||
|
|
||||
LL | #[derive(Copy, Clone)]
|
||||
@ -30,7 +30,7 @@ LL | is_clone(B { a: 1, b: C });
|
||||
| |
|
||||
| required by a bound introduced by this call
|
||||
|
|
||||
note: required because of the requirements on the impl of `Clone` for `B<C>`
|
||||
note: required for `B<C>` to implement `Clone`
|
||||
--> $DIR/deriving-copyclone.rs:9:16
|
||||
|
|
||||
LL | #[derive(Copy, Clone)]
|
||||
@ -54,7 +54,7 @@ LL | is_copy(B { a: 1, b: D });
|
||||
| |
|
||||
| required by a bound introduced by this call
|
||||
|
|
||||
note: required because of the requirements on the impl of `Copy` for `B<D>`
|
||||
note: required for `B<D>` to implement `Copy`
|
||||
--> $DIR/deriving-copyclone.rs:9:10
|
||||
|
|
||||
LL | #[derive(Copy, Clone)]
|
||||
|
@ -5,13 +5,13 @@ LL | impl<T> Foo for T where Bar<T>: Foo {}
|
||||
| ^^^
|
||||
|
|
||||
= help: consider increasing the recursion limit by adding a `#![recursion_limit = "256"]` attribute to your crate (`E0275`)
|
||||
note: required because of the requirements on the impl of `Foo` for `Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<T>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>`
|
||||
note: required for `Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<Bar<T>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>` to implement `Foo`
|
||||
--> $DIR/E0275.rs:5:9
|
||||
|
|
||||
LL | impl<T> Foo for T where Bar<T>: Foo {}
|
||||
| ^^^ ^
|
||||
= note: 127 redundant requirements hidden
|
||||
= note: required because of the requirements on the impl of `Foo` for `Bar<T>`
|
||||
= note: required for `Bar<T>` to implement `Foo`
|
||||
|
||||
error: aborting due to previous error
|
||||
|
||||
|
@ -14,7 +14,7 @@ LL | format!("{:X}", "3");
|
||||
NonZeroI8
|
||||
NonZeroIsize
|
||||
and 21 others
|
||||
= note: required because of the requirements on the impl of `UpperHex` for `&str`
|
||||
= note: required for `&str` to implement `UpperHex`
|
||||
note: required by a bound in `ArgumentV1::<'a>::new_upper_hex`
|
||||
--> $SRC_DIR/core/src/fmt/mod.rs:LL:COL
|
||||
|
|
||||
|
@ -8,7 +8,7 @@ LL | send(format_args!("{:?}", c));
|
||||
= note: required because it appears within the type `&core::fmt::Opaque`
|
||||
= note: required because it appears within the type `ArgumentV1<'_>`
|
||||
= note: required because it appears within the type `[ArgumentV1<'_>]`
|
||||
= note: required because of the requirements on the impl of `Send` for `&[ArgumentV1<'_>]`
|
||||
= note: required for `&[ArgumentV1<'_>]` to implement `Send`
|
||||
= note: required because it appears within the type `Arguments<'_>`
|
||||
note: required by a bound in `send`
|
||||
--> $DIR/send-sync.rs:1:12
|
||||
|
@ -5,7 +5,7 @@ fn main() {
|
||||
//~^ ERROR `&str` is not an iterator
|
||||
//~| NOTE `&str` is not an iterator
|
||||
//~| HELP the trait `Iterator` is not implemented for `&str`
|
||||
//~| NOTE required because of the requirements on the impl of `IntoIterator` for `&str`
|
||||
//~| NOTE required for `&str` to implement `IntoIterator`
|
||||
//~| NOTE in this expansion of desugaring of `for` loop
|
||||
//~| NOTE in this expansion of desugaring of `for` loop
|
||||
//~| NOTE in this expansion of desugaring of `for` loop
|
||||
|
@ -5,7 +5,7 @@ LL | for c in "asdf" {
|
||||
| ^^^^^^ `&str` is not an iterator; try calling `.chars()` or `.bytes()`
|
||||
|
|
||||
= help: the trait `Iterator` is not implemented for `&str`
|
||||
= note: required because of the requirements on the impl of `IntoIterator` for `&str`
|
||||
= note: required for `&str` to implement `IntoIterator`
|
||||
|
||||
error: aborting due to previous error
|
||||
|
||||
|
@ -5,7 +5,7 @@ LL | for x in bogus {
|
||||
| ^^^^^ `MyStruct` is not an iterator
|
||||
|
|
||||
= help: the trait `Iterator` is not implemented for `MyStruct`
|
||||
= note: required because of the requirements on the impl of `IntoIterator` for `MyStruct`
|
||||
= note: required for `MyStruct` to implement `IntoIterator`
|
||||
|
||||
error: aborting due to previous error
|
||||
|
||||
|
@ -63,7 +63,7 @@ fn test2() {
|
||||
require_send(send_gen);
|
||||
//~^ ERROR `RefCell<i32>` cannot be shared between threads safely
|
||||
//~| NOTE `RefCell<i32>` cannot be shared between threads safely
|
||||
//~| NOTE requirements on the impl
|
||||
//~| NOTE required for
|
||||
//~| NOTE captures the following types
|
||||
}
|
||||
|
||||
|
@ -29,7 +29,7 @@ LL | require_send(send_gen);
|
||||
| ^^^^^^^^^^^^ `RefCell<i32>` cannot be shared between threads safely
|
||||
|
|
||||
= help: the trait `Sync` is not implemented for `RefCell<i32>`
|
||||
= note: required because of the requirements on the impl of `Send` for `Arc<RefCell<i32>>`
|
||||
= note: required for `Arc<RefCell<i32>>` to implement `Send`
|
||||
note: required because it's used within this generator
|
||||
--> $DIR/issue-68112.rs:48:5
|
||||
|
|
||||
|
@ -5,7 +5,7 @@ LL | assert_send(|| {
|
||||
| ^^^^^^^^^^^ `Cell<i32>` cannot be shared between threads safely
|
||||
|
|
||||
= help: the trait `Sync` is not implemented for `Cell<i32>`
|
||||
= note: required because of the requirements on the impl of `Send` for `&Cell<i32>`
|
||||
= note: required for `&Cell<i32>` to implement `Send`
|
||||
note: required because it's used within this generator
|
||||
--> $DIR/not-send-sync.rs:16:17
|
||||
|
|
||||
|
@ -27,7 +27,7 @@ LL | require_send(send_gen);
|
||||
| ^^^^^^^^^^^^ `RefCell<i32>` cannot be shared between threads safely
|
||||
|
|
||||
= help: the trait `Sync` is not implemented for `RefCell<i32>`
|
||||
= note: required because of the requirements on the impl of `Send` for `Arc<RefCell<i32>>`
|
||||
= note: required for `Arc<RefCell<i32>>` to implement `Send`
|
||||
note: required because it's used within this generator
|
||||
--> $DIR/generator-print-verbose-1.rs:42:5
|
||||
|
|
||||
|
@ -5,7 +5,7 @@ LL | assert_send(|| {
|
||||
| ^^^^^^^^^^^ `Cell<i32>` cannot be shared between threads safely
|
||||
|
|
||||
= help: the trait `Sync` is not implemented for `Cell<i32>`
|
||||
= note: required because of the requirements on the impl of `Send` for `&'_#4r Cell<i32>`
|
||||
= note: required for `&'_#4r Cell<i32>` to implement `Send`
|
||||
note: required because it's used within this generator
|
||||
--> $DIR/generator-print-verbose-2.rs:19:17
|
||||
|
|
||||
|
@ -12,7 +12,7 @@ LL | yield || for i in 0 { }
|
||||
|
|
||||
= help: the trait `Iterator` is not implemented for `{integer}`
|
||||
= note: if you want to iterate between `start` until a value `end`, use the exclusive range syntax `start..end` or the inclusive range syntax `start..=end`
|
||||
= note: required because of the requirements on the impl of `IntoIterator` for `{integer}`
|
||||
= note: required for `{integer}` to implement `IntoIterator`
|
||||
|
||||
error: aborting due to 2 previous errors
|
||||
|
||||
|
@ -42,7 +42,7 @@ error[E0277]: the trait bound `T: Copy` is not satisfied
|
||||
LL | type C = String where Self: Copy;
|
||||
| ^^^^ the trait `Copy` is not implemented for `T`
|
||||
|
|
||||
note: required because of the requirements on the impl of `Copy` for `Fooy<T>`
|
||||
note: required for `Fooy<T>` to implement `Copy`
|
||||
--> $DIR/impl_bounds.rs:11:10
|
||||
|
|
||||
LL | #[derive(Copy, Clone)]
|
||||
@ -67,7 +67,7 @@ error[E0277]: the trait bound `T: Copy` is not satisfied
|
||||
LL | fn d() where Self: Copy {}
|
||||
| ^^^^ the trait `Copy` is not implemented for `T`
|
||||
|
|
||||
note: required because of the requirements on the impl of `Copy` for `Fooy<T>`
|
||||
note: required for `Fooy<T>` to implement `Copy`
|
||||
--> $DIR/impl_bounds.rs:11:10
|
||||
|
|
||||
LL | #[derive(Copy, Clone)]
|
||||
|
@ -16,7 +16,7 @@ error[E0277]: the trait bound `T: Clone` is not satisfied
|
||||
LL | type Copy<T>: Copy = Box<T>;
|
||||
| ^^^^^^ the trait `Clone` is not implemented for `T`
|
||||
|
|
||||
= note: required because of the requirements on the impl of `Clone` for `Box<T>`
|
||||
= note: required for `Box<T>` to implement `Clone`
|
||||
note: required by a bound in `UnsafeCopy::Copy`
|
||||
--> $DIR/issue-74824.rs:7:19
|
||||
|
|
||||
|
@ -43,7 +43,7 @@ LL | pub trait SuperTrait {
|
||||
LL | type SubType<'a>: SubTrait where Self: 'a;
|
||||
| ^^^^^^^ ...because it contains the generic associated type `SubType`
|
||||
= help: consider moving `SubType` to another trait
|
||||
= note: required because of the requirements on the impl of `CoerceUnsized<Box<dyn SuperTrait<SubType = SubStruct<'_>>>>` for `Box<SuperStruct>`
|
||||
= note: required for `Box<SuperStruct>` to implement `CoerceUnsized<Box<dyn SuperTrait<SubType = SubStruct<'_>>>>`
|
||||
= note: required by cast to type `Box<dyn SuperTrait<SubType = SubStruct<'_>>>`
|
||||
|
||||
error: aborting due to 3 previous errors
|
||||
|
@ -43,7 +43,7 @@ LL | trait MapLike<K, V> {
|
||||
LL | type VRefCont<'a>: RefCont<'a, V> where Self: 'a;
|
||||
| ^^^^^^^^ ...because it contains the generic associated type `VRefCont`
|
||||
= help: consider moving `VRefCont` to another trait
|
||||
= note: required because of the requirements on the impl of `CoerceUnsized<Box<dyn MapLike<u8, u8, VRefCont = (dyn RefCont<'_, u8> + 'static)>>>` for `Box<BTreeMap<u8, u8>>`
|
||||
= note: required for `Box<BTreeMap<u8, u8>>` to implement `CoerceUnsized<Box<dyn MapLike<u8, u8, VRefCont = (dyn RefCont<'_, u8> + 'static)>>>`
|
||||
= note: required by cast to type `Box<dyn MapLike<u8, u8, VRefCont = (dyn RefCont<'_, u8> + 'static)>>`
|
||||
|
||||
error: aborting due to 3 previous errors
|
||||
|
@ -44,7 +44,7 @@ LL | | },
|
||||
LL | | },
|
||||
| |_________^ expected struct `Unit3`, found struct `Unit4`
|
||||
|
|
||||
note: required because of the requirements on the impl of `for<'r> T0<'r, (&'r u8,)>` for `L<[closure@$DIR/issue-62203-hrtb-ice.rs:42:16: 42:19]>`
|
||||
note: required for `L<[closure@$DIR/issue-62203-hrtb-ice.rs:42:16: 42:19]>` to implement `for<'r> T0<'r, (&'r u8,)>`
|
||||
--> $DIR/issue-62203-hrtb-ice.rs:17:16
|
||||
|
|
||||
LL | impl<'a, A, T> T0<'a, A> for L<T>
|
||||
|
@ -4,7 +4,7 @@ error[E0277]: the trait bound `for<'a> &'a (): BufferMut` is not satisfied
|
||||
LL | C: StackContext,
|
||||
| ^^^^^^^^^^^^ the trait `for<'a> BufferMut` is not implemented for `&'a ()`
|
||||
|
|
||||
note: required because of the requirements on the impl of `for<'a> BufferUdpStateContext<&'a ()>` for `Ctx<()>`
|
||||
note: required for `Ctx<()>` to implement `for<'a> BufferUdpStateContext<&'a ()>`
|
||||
--> $DIR/issue-89118.rs:5:23
|
||||
|
|
||||
LL | impl<B: BufferMut, C> BufferUdpStateContext<B> for C {}
|
||||
@ -24,7 +24,7 @@ error[E0277]: the trait bound `for<'a> &'a (): BufferMut` is not satisfied
|
||||
LL | impl<C> EthernetWorker<C> {}
|
||||
| ^^^^^^^^^^^^^^^^^ the trait `for<'a> BufferMut` is not implemented for `&'a ()`
|
||||
|
|
||||
note: required because of the requirements on the impl of `for<'a> BufferUdpStateContext<&'a ()>` for `Ctx<()>`
|
||||
note: required for `Ctx<()>` to implement `for<'a> BufferUdpStateContext<&'a ()>`
|
||||
--> $DIR/issue-89118.rs:5:23
|
||||
|
|
||||
LL | impl<B: BufferMut, C> BufferUdpStateContext<B> for C {}
|
||||
@ -44,7 +44,7 @@ error[E0277]: the trait bound `for<'a> &'a (): BufferMut` is not satisfied
|
||||
LL | type Handler = Ctx<C::Dispatcher>;
|
||||
| ^^^^^^^^^^^^^^^^^^ the trait `for<'a> BufferMut` is not implemented for `&'a ()`
|
||||
|
|
||||
note: required because of the requirements on the impl of `for<'a> BufferUdpStateContext<&'a ()>` for `Ctx<()>`
|
||||
note: required for `Ctx<()>` to implement `for<'a> BufferUdpStateContext<&'a ()>`
|
||||
--> $DIR/issue-89118.rs:5:23
|
||||
|
|
||||
LL | impl<B: BufferMut, C> BufferUdpStateContext<B> for C {}
|
||||
|
@ -5,7 +5,7 @@ LL | || 42
|
||||
| ^^^^^ the trait `Duh` is not implemented for `Sendable`
|
||||
|
|
||||
= help: the trait `Duh` is implemented for `i32`
|
||||
note: required because of the requirements on the impl of `Trait` for `[closure@$DIR/nested-return-type2-tait2.rs:27:5: 27:7]`
|
||||
note: required for `[closure@$DIR/nested-return-type2-tait2.rs:27:5: 27:7]` to implement `Trait`
|
||||
--> $DIR/nested-return-type2-tait2.rs:14:31
|
||||
|
|
||||
LL | impl<R: Duh, F: FnMut() -> R> Trait for F {
|
||||
|
@ -5,7 +5,7 @@ LL | || 42
|
||||
| ^^^^^ the trait `Duh` is not implemented for `impl Send`
|
||||
|
|
||||
= help: the trait `Duh` is implemented for `i32`
|
||||
note: required because of the requirements on the impl of `Trait` for `[closure@$DIR/nested-return-type2-tait3.rs:26:5: 26:7]`
|
||||
note: required for `[closure@$DIR/nested-return-type2-tait3.rs:26:5: 26:7]` to implement `Trait`
|
||||
--> $DIR/nested-return-type2-tait3.rs:14:31
|
||||
|
|
||||
LL | impl<R: Duh, F: FnMut() -> R> Trait for F {
|
||||
|
@ -53,7 +53,7 @@ LL | fn bad_in_ret_position(x: impl Into<u32>) -> impl Into<impl Debug> { x }
|
||||
| ^^^^^^^^^^^^^^^^^^^^^ the trait `From<impl Into<u32>>` is not implemented for `impl Debug`
|
||||
|
|
||||
= help: the trait `Into<U>` is implemented for `T`
|
||||
= note: required because of the requirements on the impl of `Into<impl Debug>` for `impl Into<u32>`
|
||||
= note: required for `impl Into<u32>` to implement `Into<impl Debug>`
|
||||
|
||||
error[E0277]: the trait bound `impl Debug: From<impl Into<u32>>` is not satisfied
|
||||
--> $DIR/nested_impl_trait.rs:18:34
|
||||
@ -62,7 +62,7 @@ LL | fn bad(x: impl Into<u32>) -> impl Into<impl Debug> { x }
|
||||
| ^^^^^^^^^^^^^^^^^^^^^ the trait `From<impl Into<u32>>` is not implemented for `impl Debug`
|
||||
|
|
||||
= help: the trait `Into<U>` is implemented for `T`
|
||||
= note: required because of the requirements on the impl of `Into<impl Debug>` for `impl Into<u32>`
|
||||
= note: required for `impl Into<u32>` to implement `Into<impl Debug>`
|
||||
|
||||
error: aborting due to 8 previous errors
|
||||
|
||||
|
@ -9,7 +9,7 @@ note: expected this to be `u8`
|
||||
|
|
||||
LL | type Assoc = u8;
|
||||
| ^^
|
||||
note: required because of the requirements on the impl of `Test` for `()`
|
||||
note: required for `()` to implement `Test`
|
||||
--> $DIR/projection-mismatch-in-impl-where-clause.rs:11:9
|
||||
|
|
||||
LL | impl<T> Test for T where T: Super<Assoc = ()> {}
|
||||
|
@ -6,7 +6,7 @@ LL | x[0i32];
|
||||
|
|
||||
= help: the trait `SliceIndex<[{integer}]>` is not implemented for `i32`
|
||||
= help: the trait `SliceIndex<[T]>` is implemented for `usize`
|
||||
= note: required because of the requirements on the impl of `Index<i32>` for `Vec<{integer}>`
|
||||
= note: required for `Vec<{integer}>` to implement `Index<i32>`
|
||||
|
||||
error: aborting due to previous error
|
||||
|
||||
|
@ -6,7 +6,7 @@ LL | [0][0u8];
|
||||
|
|
||||
= help: the trait `SliceIndex<[{integer}]>` is not implemented for `u8`
|
||||
= help: the trait `SliceIndex<[T]>` is implemented for `usize`
|
||||
= note: required because of the requirements on the impl of `Index<u8>` for `[{integer}]`
|
||||
= note: required for `[{integer}]` to implement `Index<u8>`
|
||||
|
||||
error[E0308]: mismatched types
|
||||
--> $DIR/indexing-requires-a-uint.rs:12:18
|
||||
|
@ -6,7 +6,7 @@ LL | v[3u8];
|
||||
|
|
||||
= help: the trait `SliceIndex<[isize]>` is not implemented for `u8`
|
||||
= help: the trait `SliceIndex<[T]>` is implemented for `usize`
|
||||
= note: required because of the requirements on the impl of `Index<u8>` for `Vec<isize>`
|
||||
= note: required for `Vec<isize>` to implement `Index<u8>`
|
||||
|
||||
error[E0277]: the type `[isize]` cannot be indexed by `i8`
|
||||
--> $DIR/integral-indexing.rs:7:7
|
||||
@ -16,7 +16,7 @@ LL | v[3i8];
|
||||
|
|
||||
= help: the trait `SliceIndex<[isize]>` is not implemented for `i8`
|
||||
= help: the trait `SliceIndex<[T]>` is implemented for `usize`
|
||||
= note: required because of the requirements on the impl of `Index<i8>` for `Vec<isize>`
|
||||
= note: required for `Vec<isize>` to implement `Index<i8>`
|
||||
|
||||
error[E0277]: the type `[isize]` cannot be indexed by `u32`
|
||||
--> $DIR/integral-indexing.rs:8:7
|
||||
@ -26,7 +26,7 @@ LL | v[3u32];
|
||||
|
|
||||
= help: the trait `SliceIndex<[isize]>` is not implemented for `u32`
|
||||
= help: the trait `SliceIndex<[T]>` is implemented for `usize`
|
||||
= note: required because of the requirements on the impl of `Index<u32>` for `Vec<isize>`
|
||||
= note: required for `Vec<isize>` to implement `Index<u32>`
|
||||
|
||||
error[E0277]: the type `[isize]` cannot be indexed by `i32`
|
||||
--> $DIR/integral-indexing.rs:9:7
|
||||
@ -36,7 +36,7 @@ LL | v[3i32];
|
||||
|
|
||||
= help: the trait `SliceIndex<[isize]>` is not implemented for `i32`
|
||||
= help: the trait `SliceIndex<[T]>` is implemented for `usize`
|
||||
= note: required because of the requirements on the impl of `Index<i32>` for `Vec<isize>`
|
||||
= note: required for `Vec<isize>` to implement `Index<i32>`
|
||||
|
||||
error[E0277]: the type `[u8]` cannot be indexed by `u8`
|
||||
--> $DIR/integral-indexing.rs:12:18
|
||||
@ -46,7 +46,7 @@ LL | s.as_bytes()[3u8];
|
||||
|
|
||||
= help: the trait `SliceIndex<[u8]>` is not implemented for `u8`
|
||||
= help: the trait `SliceIndex<[T]>` is implemented for `usize`
|
||||
= note: required because of the requirements on the impl of `Index<u8>` for `[u8]`
|
||||
= note: required for `[u8]` to implement `Index<u8>`
|
||||
|
||||
error[E0277]: the type `[u8]` cannot be indexed by `i8`
|
||||
--> $DIR/integral-indexing.rs:13:18
|
||||
@ -56,7 +56,7 @@ LL | s.as_bytes()[3i8];
|
||||
|
|
||||
= help: the trait `SliceIndex<[u8]>` is not implemented for `i8`
|
||||
= help: the trait `SliceIndex<[T]>` is implemented for `usize`
|
||||
= note: required because of the requirements on the impl of `Index<i8>` for `[u8]`
|
||||
= note: required for `[u8]` to implement `Index<i8>`
|
||||
|
||||
error[E0277]: the type `[u8]` cannot be indexed by `u32`
|
||||
--> $DIR/integral-indexing.rs:14:18
|
||||
@ -66,7 +66,7 @@ LL | s.as_bytes()[3u32];
|
||||
|
|
||||
= help: the trait `SliceIndex<[u8]>` is not implemented for `u32`
|
||||
= help: the trait `SliceIndex<[T]>` is implemented for `usize`
|
||||
= note: required because of the requirements on the impl of `Index<u32>` for `[u8]`
|
||||
= note: required for `[u8]` to implement `Index<u32>`
|
||||
|
||||
error[E0277]: the type `[u8]` cannot be indexed by `i32`
|
||||
--> $DIR/integral-indexing.rs:15:18
|
||||
@ -76,7 +76,7 @@ LL | s.as_bytes()[3i32];
|
||||
|
|
||||
= help: the trait `SliceIndex<[u8]>` is not implemented for `i32`
|
||||
= help: the trait `SliceIndex<[T]>` is implemented for `usize`
|
||||
= note: required because of the requirements on the impl of `Index<i32>` for `[u8]`
|
||||
= note: required for `[u8]` to implement `Index<i32>`
|
||||
|
||||
error: aborting due to 8 previous errors
|
||||
|
||||
|
@ -6,7 +6,7 @@ LL | catch_unwind(|| { x.set(23); });
|
||||
|
|
||||
= help: within `Cell<i32>`, the trait `RefUnwindSafe` is not implemented for `UnsafeCell<i32>`
|
||||
= note: required because it appears within the type `Cell<i32>`
|
||||
= note: required because of the requirements on the impl of `UnwindSafe` for `&Cell<i32>`
|
||||
= note: required for `&Cell<i32>` to implement `UnwindSafe`
|
||||
note: required because it's used within this closure
|
||||
--> $DIR/interior-mutability.rs:5:18
|
||||
|
|
||||
|
@ -14,13 +14,13 @@ LL | impl<T> Foo for T where NoData<T>: Foo {
|
||||
| ^^^
|
||||
|
|
||||
= help: consider increasing the recursion limit by adding a `#![recursion_limit = "256"]` attribute to your crate (`issue_20413`)
|
||||
note: required because of the requirements on the impl of `Foo` for `NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<T>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>`
|
||||
note: required for `NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<NoData<T>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>` to implement `Foo`
|
||||
--> $DIR/issue-20413.rs:8:9
|
||||
|
|
||||
LL | impl<T> Foo for T where NoData<T>: Foo {
|
||||
| ^^^ ^
|
||||
= note: 127 redundant requirements hidden
|
||||
= note: required because of the requirements on the impl of `Foo` for `NoData<T>`
|
||||
= note: required for `NoData<T>` to implement `Foo`
|
||||
|
||||
error[E0275]: overflow evaluating the requirement `EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<T>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>: Baz`
|
||||
--> $DIR/issue-20413.rs:27:42
|
||||
@ -29,18 +29,18 @@ LL | impl<T> Bar for T where EvenLessData<T>: Baz {
|
||||
| ^^^
|
||||
|
|
||||
= help: consider increasing the recursion limit by adding a `#![recursion_limit = "256"]` attribute to your crate (`issue_20413`)
|
||||
note: required because of the requirements on the impl of `Bar` for `AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<T>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>`
|
||||
note: required for `AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<T>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>` to implement `Bar`
|
||||
--> $DIR/issue-20413.rs:27:9
|
||||
|
|
||||
LL | impl<T> Bar for T where EvenLessData<T>: Baz {
|
||||
| ^^^ ^
|
||||
note: required because of the requirements on the impl of `Baz` for `EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<T>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>`
|
||||
note: required for `EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<T>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>` to implement `Baz`
|
||||
--> $DIR/issue-20413.rs:34:9
|
||||
|
|
||||
LL | impl<T> Baz for T where AlmostNoData<T>: Bar {
|
||||
| ^^^ ^
|
||||
= note: 126 redundant requirements hidden
|
||||
= note: required because of the requirements on the impl of `Baz` for `EvenLessData<T>`
|
||||
= note: required for `EvenLessData<T>` to implement `Baz`
|
||||
|
||||
error[E0275]: overflow evaluating the requirement `AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<T>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>: Bar`
|
||||
--> $DIR/issue-20413.rs:34:42
|
||||
@ -49,18 +49,18 @@ LL | impl<T> Baz for T where AlmostNoData<T>: Bar {
|
||||
| ^^^
|
||||
|
|
||||
= help: consider increasing the recursion limit by adding a `#![recursion_limit = "256"]` attribute to your crate (`issue_20413`)
|
||||
note: required because of the requirements on the impl of `Baz` for `EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<T>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>`
|
||||
note: required for `EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<T>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>` to implement `Baz`
|
||||
--> $DIR/issue-20413.rs:34:9
|
||||
|
|
||||
LL | impl<T> Baz for T where AlmostNoData<T>: Bar {
|
||||
| ^^^ ^
|
||||
note: required because of the requirements on the impl of `Bar` for `AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<T>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>`
|
||||
note: required for `AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<EvenLessData<AlmostNoData<T>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>` to implement `Bar`
|
||||
--> $DIR/issue-20413.rs:27:9
|
||||
|
|
||||
LL | impl<T> Bar for T where EvenLessData<T>: Baz {
|
||||
| ^^^ ^
|
||||
= note: 126 redundant requirements hidden
|
||||
= note: required because of the requirements on the impl of `Bar` for `AlmostNoData<T>`
|
||||
= note: required for `AlmostNoData<T>` to implement `Bar`
|
||||
|
||||
error: aborting due to 4 previous errors
|
||||
|
||||
|
@ -5,7 +5,7 @@ LL | for item in *things { *item = 0 }
|
||||
| ^^^^^^^ expected an implementor of trait `IntoIterator`
|
||||
|
|
||||
= note: the trait bound `dyn Iterator<Item = &'a mut u8>: IntoIterator` is not satisfied
|
||||
= note: required because of the requirements on the impl of `IntoIterator` for `dyn Iterator<Item = &'a mut u8>`
|
||||
= note: required for `dyn Iterator<Item = &'a mut u8>` to implement `IntoIterator`
|
||||
help: consider mutably borrowing here
|
||||
|
|
||||
LL | for item in &mut *things { *item = 0 }
|
||||
|
@ -6,7 +6,7 @@ LL | foo::<HashMap<Rc<()>, Rc<()>>>();
|
||||
|
|
||||
= help: within `(Rc<()>, Rc<()>)`, the trait `Send` is not implemented for `Rc<()>`
|
||||
= note: required because it appears within the type `(Rc<()>, Rc<()>)`
|
||||
= note: required because of the requirements on the impl of `Send` for `hashbrown::raw::RawTable<(Rc<()>, Rc<()>)>`
|
||||
= note: required for `hashbrown::raw::RawTable<(Rc<()>, Rc<()>)>` to implement `Send`
|
||||
= note: required because it appears within the type `hashbrown::map::HashMap<Rc<()>, Rc<()>, RandomState>`
|
||||
= note: required because it appears within the type `HashMap<Rc<()>, Rc<()>>`
|
||||
note: required by a bound in `foo`
|
||||
|
@ -5,7 +5,7 @@ LL | let _: Box<dyn for<'b> Wrap<'b>> = Box::new(Wrapper(process));
|
||||
| ^^^^^^^^^^^^^^^^^^^^^^^^^^ `<P as Process<'_>>::Item` is not an iterator
|
||||
|
|
||||
= help: the trait `Iterator` is not implemented for `<P as Process<'_>>::Item`
|
||||
note: required because of the requirements on the impl of `for<'b> Wrap<'b>` for `Wrapper<P>`
|
||||
note: required for `Wrapper<P>` to implement `for<'b> Wrap<'b>`
|
||||
--> $DIR/issue-22872.rs:7:13
|
||||
|
|
||||
LL | impl<'b, P> Wrap<'b> for Wrapper<P>
|
||||
|
@ -5,7 +5,7 @@ LL | type Next = <GetNext<T::Next> as Next>::Next;
|
||||
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
|
||||
|
|
||||
= help: consider increasing the recursion limit by adding a `#![recursion_limit = "256"]` attribute to your crate (`issue_23122_2`)
|
||||
note: required because of the requirements on the impl of `Next` for `GetNext<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<T as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next>`
|
||||
note: required for `GetNext<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<T as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next as Next>::Next>` to implement `Next`
|
||||
--> $DIR/issue-23122-2.rs:9:15
|
||||
|
|
||||
LL | impl<T: Next> Next for GetNext<T> {
|
||||
|
@ -10,7 +10,7 @@ LL | Err(5)?;
|
||||
= help: the following other types implement trait `FromResidual<R>`:
|
||||
<Result<T, F> as FromResidual<Result<Infallible, E>>>
|
||||
<Result<T, F> as FromResidual<Yeet<E>>>
|
||||
= note: required because of the requirements on the impl of `FromResidual<Result<Infallible, {integer}>>` for `Result<i32, ()>`
|
||||
= note: required for `Result<i32, ()>` to implement `FromResidual<Result<Infallible, {integer}>>`
|
||||
|
||||
error: aborting due to previous error
|
||||
|
||||
|
@ -20,8 +20,8 @@ LL | for _ in HashMap::new().iter().cloned() {}
|
||||
|
|
||||
= note: expected tuple `(&_, &_)`
|
||||
found reference `&_`
|
||||
= note: required because of the requirements on the impl of `Iterator` for `Cloned<std::collections::hash_map::Iter<'_, _, _>>`
|
||||
= note: required because of the requirements on the impl of `IntoIterator` for `Cloned<std::collections::hash_map::Iter<'_, _, _>>`
|
||||
= note: required for `Cloned<std::collections::hash_map::Iter<'_, _, _>>` to implement `Iterator`
|
||||
= note: required for `Cloned<std::collections::hash_map::Iter<'_, _, _>>` to implement `IntoIterator`
|
||||
|
||||
error[E0271]: expected `std::collections::hash_map::Iter<'_, _, _>` to be an iterator that yields `&_`, but it yields `(&_, &_)`
|
||||
--> $DIR/issue-33941.rs:6:14
|
||||
@ -31,7 +31,7 @@ LL | for _ in HashMap::new().iter().cloned() {}
|
||||
|
|
||||
= note: expected tuple `(&_, &_)`
|
||||
found reference `&_`
|
||||
= note: required because of the requirements on the impl of `Iterator` for `Cloned<std::collections::hash_map::Iter<'_, _, _>>`
|
||||
= note: required for `Cloned<std::collections::hash_map::Iter<'_, _, _>>` to implement `Iterator`
|
||||
|
||||
error: aborting due to 3 previous errors
|
||||
|
||||
|
@ -4,7 +4,7 @@ error[E0277]: the trait bound `<Col as Expression>::SqlType: NotNull` is not sat
|
||||
LL | #[derive(Debug, Copy, Clone)]
|
||||
| ^^^^ the trait `NotNull` is not implemented for `<Col as Expression>::SqlType`
|
||||
|
|
||||
note: required because of the requirements on the impl of `IntoNullable` for `<Col as Expression>::SqlType`
|
||||
note: required for `<Col as Expression>::SqlType` to implement `IntoNullable`
|
||||
--> $DIR/issue-38821.rs:9:18
|
||||
|
|
||||
LL | impl<T: NotNull> IntoNullable for T {
|
||||
|
@ -9,7 +9,7 @@ note: expected this to be `()`
|
||||
|
|
||||
LL | type Element = &'a ();
|
||||
| ^^^^^^
|
||||
note: required because of the requirements on the impl of `Visit` for `()`
|
||||
note: required for `()` to implement `Visit`
|
||||
--> $DIR/issue-39970.rs:13:6
|
||||
|
|
||||
LL | impl Visit for () where
|
||||
|
@ -12,7 +12,7 @@ note: required because it appears within the type `Bar`
|
||||
|
|
||||
LL | enum Bar {
|
||||
| ^^^
|
||||
= note: required because of the requirements on the impl of `Send` for `Arc<Bar>`
|
||||
= note: required for `Arc<Bar>` to implement `Send`
|
||||
note: required because it appears within the type `Foo`
|
||||
--> $DIR/issue-40827.rs:4:8
|
||||
|
|
||||
@ -38,7 +38,7 @@ note: required because it appears within the type `Bar`
|
||||
|
|
||||
LL | enum Bar {
|
||||
| ^^^
|
||||
= note: required because of the requirements on the impl of `Send` for `Arc<Bar>`
|
||||
= note: required for `Arc<Bar>` to implement `Send`
|
||||
note: required because it appears within the type `Foo`
|
||||
--> $DIR/issue-40827.rs:4:8
|
||||
|
|
||||
|
@ -6,7 +6,7 @@ LL | let _ = Pin::new(Apple) == Rc::pin(Apple);
|
||||
|
|
||||
= note: expected struct `Apple`
|
||||
found struct `Rc<Apple>`
|
||||
= note: required because of the requirements on the impl of `PartialEq<Pin<Rc<Apple>>>` for `Pin<Apple>`
|
||||
= note: required for `Pin<Apple>` to implement `PartialEq<Pin<Rc<Apple>>>`
|
||||
|
||||
error: aborting due to previous error
|
||||
|
||||
|
@ -5,7 +5,7 @@ LL | static boxed: Box<RefCell<isize>> = Box::new(RefCell::new(0));
|
||||
| ^^^^^^^^^^^^^^^^^^^ `RefCell<isize>` cannot be shared between threads safely
|
||||
|
|
||||
= help: the trait `Sync` is not implemented for `RefCell<isize>`
|
||||
= note: required because of the requirements on the impl of `Sync` for `Unique<RefCell<isize>>`
|
||||
= note: required for `Unique<RefCell<isize>>` to implement `Sync`
|
||||
= note: required because it appears within the type `Box<RefCell<isize>>`
|
||||
= note: shared static variables must have a type that implements `Sync`
|
||||
|
||||
|
@ -6,7 +6,7 @@ LL | for _ in 42 {}
|
||||
|
|
||||
= help: the trait `Iterator` is not implemented for `{integer}`
|
||||
= note: if you want to iterate between `start` until a value `end`, use the exclusive range syntax `start..end` or the inclusive range syntax `start..=end`
|
||||
= note: required because of the requirements on the impl of `IntoIterator` for `{integer}`
|
||||
= note: required for `{integer}` to implement `IntoIterator`
|
||||
|
||||
error[E0277]: `u8` is not an iterator
|
||||
--> $DIR/integral.rs:4:14
|
||||
@ -16,7 +16,7 @@ LL | for _ in 42 as u8 {}
|
||||
|
|
||||
= help: the trait `Iterator` is not implemented for `u8`
|
||||
= note: if you want to iterate between `start` until a value `end`, use the exclusive range syntax `start..end` or the inclusive range syntax `start..=end`
|
||||
= note: required because of the requirements on the impl of `IntoIterator` for `u8`
|
||||
= note: required for `u8` to implement `IntoIterator`
|
||||
|
||||
error[E0277]: `i8` is not an iterator
|
||||
--> $DIR/integral.rs:6:14
|
||||
@ -26,7 +26,7 @@ LL | for _ in 42 as i8 {}
|
||||
|
|
||||
= help: the trait `Iterator` is not implemented for `i8`
|
||||
= note: if you want to iterate between `start` until a value `end`, use the exclusive range syntax `start..end` or the inclusive range syntax `start..=end`
|
||||
= note: required because of the requirements on the impl of `IntoIterator` for `i8`
|
||||
= note: required for `i8` to implement `IntoIterator`
|
||||
|
||||
error[E0277]: `u16` is not an iterator
|
||||
--> $DIR/integral.rs:8:14
|
||||
@ -36,7 +36,7 @@ LL | for _ in 42 as u16 {}
|
||||
|
|
||||
= help: the trait `Iterator` is not implemented for `u16`
|
||||
= note: if you want to iterate between `start` until a value `end`, use the exclusive range syntax `start..end` or the inclusive range syntax `start..=end`
|
||||
= note: required because of the requirements on the impl of `IntoIterator` for `u16`
|
||||
= note: required for `u16` to implement `IntoIterator`
|
||||
|
||||
error[E0277]: `i16` is not an iterator
|
||||
--> $DIR/integral.rs:10:14
|
||||
@ -46,7 +46,7 @@ LL | for _ in 42 as i16 {}
|
||||
|
|
||||
= help: the trait `Iterator` is not implemented for `i16`
|
||||
= note: if you want to iterate between `start` until a value `end`, use the exclusive range syntax `start..end` or the inclusive range syntax `start..=end`
|
||||
= note: required because of the requirements on the impl of `IntoIterator` for `i16`
|
||||
= note: required for `i16` to implement `IntoIterator`
|
||||
|
||||
error[E0277]: `u32` is not an iterator
|
||||
--> $DIR/integral.rs:12:14
|
||||
@ -56,7 +56,7 @@ LL | for _ in 42 as u32 {}
|
||||
|
|
||||
= help: the trait `Iterator` is not implemented for `u32`
|
||||
= note: if you want to iterate between `start` until a value `end`, use the exclusive range syntax `start..end` or the inclusive range syntax `start..=end`
|
||||
= note: required because of the requirements on the impl of `IntoIterator` for `u32`
|
||||
= note: required for `u32` to implement `IntoIterator`
|
||||
|
||||
error[E0277]: `i32` is not an iterator
|
||||
--> $DIR/integral.rs:14:14
|
||||
@ -66,7 +66,7 @@ LL | for _ in 42 as i32 {}
|
||||
|
|
||||
= help: the trait `Iterator` is not implemented for `i32`
|
||||
= note: if you want to iterate between `start` until a value `end`, use the exclusive range syntax `start..end` or the inclusive range syntax `start..=end`
|
||||
= note: required because of the requirements on the impl of `IntoIterator` for `i32`
|
||||
= note: required for `i32` to implement `IntoIterator`
|
||||
|
||||
error[E0277]: `u64` is not an iterator
|
||||
--> $DIR/integral.rs:16:14
|
||||
@ -76,7 +76,7 @@ LL | for _ in 42 as u64 {}
|
||||
|
|
||||
= help: the trait `Iterator` is not implemented for `u64`
|
||||
= note: if you want to iterate between `start` until a value `end`, use the exclusive range syntax `start..end` or the inclusive range syntax `start..=end`
|
||||
= note: required because of the requirements on the impl of `IntoIterator` for `u64`
|
||||
= note: required for `u64` to implement `IntoIterator`
|
||||
|
||||
error[E0277]: `i64` is not an iterator
|
||||
--> $DIR/integral.rs:18:14
|
||||
@ -86,7 +86,7 @@ LL | for _ in 42 as i64 {}
|
||||
|
|
||||
= help: the trait `Iterator` is not implemented for `i64`
|
||||
= note: if you want to iterate between `start` until a value `end`, use the exclusive range syntax `start..end` or the inclusive range syntax `start..=end`
|
||||
= note: required because of the requirements on the impl of `IntoIterator` for `i64`
|
||||
= note: required for `i64` to implement `IntoIterator`
|
||||
|
||||
error[E0277]: `usize` is not an iterator
|
||||
--> $DIR/integral.rs:20:14
|
||||
@ -96,7 +96,7 @@ LL | for _ in 42 as usize {}
|
||||
|
|
||||
= help: the trait `Iterator` is not implemented for `usize`
|
||||
= note: if you want to iterate between `start` until a value `end`, use the exclusive range syntax `start..end` or the inclusive range syntax `start..=end`
|
||||
= note: required because of the requirements on the impl of `IntoIterator` for `usize`
|
||||
= note: required for `usize` to implement `IntoIterator`
|
||||
|
||||
error[E0277]: `isize` is not an iterator
|
||||
--> $DIR/integral.rs:22:14
|
||||
@ -106,7 +106,7 @@ LL | for _ in 42 as isize {}
|
||||
|
|
||||
= help: the trait `Iterator` is not implemented for `isize`
|
||||
= note: if you want to iterate between `start` until a value `end`, use the exclusive range syntax `start..end` or the inclusive range syntax `start..=end`
|
||||
= note: required because of the requirements on the impl of `IntoIterator` for `isize`
|
||||
= note: required for `isize` to implement `IntoIterator`
|
||||
|
||||
error[E0277]: `{float}` is not an iterator
|
||||
--> $DIR/integral.rs:24:14
|
||||
@ -115,7 +115,7 @@ LL | for _ in 42.0 {}
|
||||
| ^^^^ `{float}` is not an iterator
|
||||
|
|
||||
= help: the trait `Iterator` is not implemented for `{float}`
|
||||
= note: required because of the requirements on the impl of `IntoIterator` for `{float}`
|
||||
= note: required for `{float}` to implement `IntoIterator`
|
||||
|
||||
error: aborting due to 12 previous errors
|
||||
|
||||
|
@ -15,7 +15,7 @@ LL | for _ in false {}
|
||||
| ^^^^^ `bool` is not an iterator
|
||||
|
|
||||
= help: the trait `Iterator` is not implemented for `bool`
|
||||
= note: required because of the requirements on the impl of `IntoIterator` for `bool`
|
||||
= note: required for `bool` to implement `IntoIterator`
|
||||
|
||||
error[E0277]: `()` is not an iterator
|
||||
--> $DIR/issue-28098.rs:8:28
|
||||
@ -54,7 +54,7 @@ LL | for _ in false {}
|
||||
| ^^^^^ `bool` is not an iterator
|
||||
|
|
||||
= help: the trait `Iterator` is not implemented for `bool`
|
||||
= note: required because of the requirements on the impl of `IntoIterator` for `bool`
|
||||
= note: required for `bool` to implement `IntoIterator`
|
||||
|
||||
error: aborting due to 6 previous errors
|
||||
|
||||
|
@ -6,7 +6,7 @@ LL | for _ in ..10 {}
|
||||
|
|
||||
= help: the trait `Iterator` is not implemented for `RangeTo<{integer}>`
|
||||
= note: `..end` is a `RangeTo`, which cannot be iterated on; you might have meant to have a bounded `Range`: `0..end`
|
||||
= note: required because of the requirements on the impl of `IntoIterator` for `RangeTo<{integer}>`
|
||||
= note: required for `RangeTo<{integer}>` to implement `IntoIterator`
|
||||
|
||||
error[E0277]: `RangeToInclusive<{integer}>` is not an iterator
|
||||
--> $DIR/ranges.rs:4:14
|
||||
@ -16,7 +16,7 @@ LL | for _ in ..=10 {}
|
||||
|
|
||||
= help: the trait `Iterator` is not implemented for `RangeToInclusive<{integer}>`
|
||||
= note: `..=end` is a `RangeToInclusive`, which cannot be iterated on; you might have meant to have a bounded `RangeInclusive`: `0..=end`
|
||||
= note: required because of the requirements on the impl of `IntoIterator` for `RangeToInclusive<{integer}>`
|
||||
= note: required for `RangeToInclusive<{integer}>` to implement `IntoIterator`
|
||||
|
||||
error: aborting due to 2 previous errors
|
||||
|
||||
|
@ -5,7 +5,7 @@ LL | for _ in "".to_owned() {}
|
||||
| ^^^^^^^^^^^^^ `String` is not an iterator; try calling `.chars()` or `.bytes()`
|
||||
|
|
||||
= help: the trait `Iterator` is not implemented for `String`
|
||||
= note: required because of the requirements on the impl of `IntoIterator` for `String`
|
||||
= note: required for `String` to implement `IntoIterator`
|
||||
|
||||
error[E0277]: `&str` is not an iterator
|
||||
--> $DIR/string.rs:4:14
|
||||
@ -14,7 +14,7 @@ LL | for _ in "" {}
|
||||
| ^^ `&str` is not an iterator; try calling `.chars()` or `.bytes()`
|
||||
|
|
||||
= help: the trait `Iterator` is not implemented for `&str`
|
||||
= note: required because of the requirements on the impl of `IntoIterator` for `&str`
|
||||
= note: required for `&str` to implement `IntoIterator`
|
||||
|
||||
error: aborting due to 2 previous errors
|
||||
|
||||
|
@ -6,7 +6,7 @@ LL | take_param(&x);
|
||||
| |
|
||||
| required by a bound introduced by this call
|
||||
|
|
||||
note: required because of the requirements on the impl of `Foo` for `Box<{integer}>`
|
||||
note: required for `Box<{integer}>` to implement `Foo`
|
||||
--> $DIR/kindck-impl-type-params-2.rs:6:14
|
||||
|
|
||||
LL | impl<T:Copy> Foo for T {
|
||||
|
@ -4,7 +4,7 @@ error[E0277]: `T` cannot be sent between threads safely
|
||||
LL | let a = &t as &dyn Gettable<T>;
|
||||
| ^^ `T` cannot be sent between threads safely
|
||||
|
|
||||
note: required because of the requirements on the impl of `Gettable<T>` for `S<T>`
|
||||
note: required for `S<T>` to implement `Gettable<T>`
|
||||
--> $DIR/kindck-impl-type-params.rs:12:32
|
||||
|
|
||||
LL | impl<T: Send + Copy + 'static> Gettable<T> for S<T> {}
|
||||
@ -21,7 +21,7 @@ error[E0277]: the trait bound `T: Copy` is not satisfied
|
||||
LL | let a = &t as &dyn Gettable<T>;
|
||||
| ^^ the trait `Copy` is not implemented for `T`
|
||||
|
|
||||
note: required because of the requirements on the impl of `Gettable<T>` for `S<T>`
|
||||
note: required for `S<T>` to implement `Gettable<T>`
|
||||
--> $DIR/kindck-impl-type-params.rs:12:32
|
||||
|
|
||||
LL | impl<T: Send + Copy + 'static> Gettable<T> for S<T> {}
|
||||
@ -38,7 +38,7 @@ error[E0277]: `T` cannot be sent between threads safely
|
||||
LL | let a: &dyn Gettable<T> = &t;
|
||||
| ^^ `T` cannot be sent between threads safely
|
||||
|
|
||||
note: required because of the requirements on the impl of `Gettable<T>` for `S<T>`
|
||||
note: required for `S<T>` to implement `Gettable<T>`
|
||||
--> $DIR/kindck-impl-type-params.rs:12:32
|
||||
|
|
||||
LL | impl<T: Send + Copy + 'static> Gettable<T> for S<T> {}
|
||||
@ -55,7 +55,7 @@ error[E0277]: the trait bound `T: Copy` is not satisfied
|
||||
LL | let a: &dyn Gettable<T> = &t;
|
||||
| ^^ the trait `Copy` is not implemented for `T`
|
||||
|
|
||||
note: required because of the requirements on the impl of `Gettable<T>` for `S<T>`
|
||||
note: required for `S<T>` to implement `Gettable<T>`
|
||||
--> $DIR/kindck-impl-type-params.rs:12:32
|
||||
|
|
||||
LL | impl<T: Send + Copy + 'static> Gettable<T> for S<T> {}
|
||||
@ -73,7 +73,7 @@ LL | let a = t as Box<dyn Gettable<String>>;
|
||||
| ^ the trait `Copy` is not implemented for `String`
|
||||
|
|
||||
= help: the trait `Gettable<T>` is implemented for `S<T>`
|
||||
note: required because of the requirements on the impl of `Gettable<String>` for `S<String>`
|
||||
note: required for `S<String>` to implement `Gettable<String>`
|
||||
--> $DIR/kindck-impl-type-params.rs:12:32
|
||||
|
|
||||
LL | impl<T: Send + Copy + 'static> Gettable<T> for S<T> {}
|
||||
@ -87,7 +87,7 @@ LL | let a: Box<dyn Gettable<Foo>> = t;
|
||||
| ^ the trait `Copy` is not implemented for `Foo`
|
||||
|
|
||||
= help: the trait `Gettable<T>` is implemented for `S<T>`
|
||||
note: required because of the requirements on the impl of `Gettable<Foo>` for `S<Foo>`
|
||||
note: required for `S<Foo>` to implement `Gettable<Foo>`
|
||||
--> $DIR/kindck-impl-type-params.rs:12:32
|
||||
|
|
||||
LL | impl<T: Send + Copy + 'static> Gettable<T> for S<T> {}
|
||||
|
@ -6,7 +6,7 @@ LL | take_param(&x);
|
||||
| |
|
||||
| required by a bound introduced by this call
|
||||
|
|
||||
note: required because of the requirements on the impl of `Foo` for `Box<{integer}>`
|
||||
note: required for `Box<{integer}>` to implement `Foo`
|
||||
--> $DIR/kindck-inherited-copy-bound.rs:14:14
|
||||
|
|
||||
LL | impl<T:Copy> Foo for T {
|
||||
@ -44,7 +44,7 @@ LL | trait Foo : Copy {
|
||||
| --- ^^^^ ...because it requires `Self: Sized`
|
||||
| |
|
||||
| this trait cannot be made into an object...
|
||||
= note: required because of the requirements on the impl of `CoerceUnsized<&dyn Foo>` for `&Box<{integer}>`
|
||||
= note: required for `&Box<{integer}>` to implement `CoerceUnsized<&dyn Foo>`
|
||||
= note: required by cast to type `&dyn Foo`
|
||||
|
||||
error: aborting due to 3 previous errors
|
||||
|
@ -6,7 +6,7 @@ LL | take_param(&x);
|
||||
| |
|
||||
| required by a bound introduced by this call
|
||||
|
|
||||
note: required because of the requirements on the impl of `Foo` for `Box<{integer}>`
|
||||
note: required for `Box<{integer}>` to implement `Foo`
|
||||
--> $DIR/kindck-inherited-copy-bound.rs:14:14
|
||||
|
|
||||
LL | impl<T:Copy> Foo for T {
|
||||
@ -30,7 +30,7 @@ LL | trait Foo : Copy {
|
||||
| --- ^^^^ ...because it requires `Self: Sized`
|
||||
| |
|
||||
| this trait cannot be made into an object...
|
||||
= note: required because of the requirements on the impl of `CoerceUnsized<&dyn Foo>` for `&Box<i32>`
|
||||
= note: required for `&Box<i32>` to implement `CoerceUnsized<&dyn Foo>`
|
||||
= note: required by cast to type `&dyn Foo`
|
||||
|
||||
error: aborting due to 2 previous errors
|
||||
|
@ -5,7 +5,7 @@ LL | assert_send::<&'static (dyn Dummy + 'static)>();
|
||||
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ `(dyn Dummy + 'static)` cannot be shared between threads safely
|
||||
|
|
||||
= help: the trait `Sync` is not implemented for `(dyn Dummy + 'static)`
|
||||
= note: required because of the requirements on the impl of `Send` for `&'static (dyn Dummy + 'static)`
|
||||
= note: required for `&'static (dyn Dummy + 'static)` to implement `Send`
|
||||
note: required by a bound in `assert_send`
|
||||
--> $DIR/kindck-send-object.rs:5:18
|
||||
|
|
||||
@ -19,7 +19,7 @@ LL | assert_send::<Box<dyn Dummy>>();
|
||||
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ `dyn Dummy` cannot be sent between threads safely
|
||||
|
|
||||
= help: the trait `Send` is not implemented for `dyn Dummy`
|
||||
= note: required because of the requirements on the impl of `Send` for `Unique<dyn Dummy>`
|
||||
= note: required for `Unique<dyn Dummy>` to implement `Send`
|
||||
= note: required because it appears within the type `Box<dyn Dummy>`
|
||||
note: required by a bound in `assert_send`
|
||||
--> $DIR/kindck-send-object.rs:5:18
|
||||
|
@ -5,7 +5,7 @@ LL | assert_send::<&'a dyn Dummy>();
|
||||
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ `(dyn Dummy + 'a)` cannot be shared between threads safely
|
||||
|
|
||||
= help: the trait `Sync` is not implemented for `(dyn Dummy + 'a)`
|
||||
= note: required because of the requirements on the impl of `Send` for `&'a (dyn Dummy + 'a)`
|
||||
= note: required for `&'a (dyn Dummy + 'a)` to implement `Send`
|
||||
note: required by a bound in `assert_send`
|
||||
--> $DIR/kindck-send-object1.rs:5:18
|
||||
|
|
||||
@ -19,7 +19,7 @@ LL | assert_send::<Box<dyn Dummy + 'a>>();
|
||||
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ `(dyn Dummy + 'a)` cannot be sent between threads safely
|
||||
|
|
||||
= help: the trait `Send` is not implemented for `(dyn Dummy + 'a)`
|
||||
= note: required because of the requirements on the impl of `Send` for `Unique<(dyn Dummy + 'a)>`
|
||||
= note: required for `Unique<(dyn Dummy + 'a)>` to implement `Send`
|
||||
= note: required because it appears within the type `Box<(dyn Dummy + 'a)>`
|
||||
note: required by a bound in `assert_send`
|
||||
--> $DIR/kindck-send-object1.rs:5:18
|
||||
|
@ -5,7 +5,7 @@ LL | assert_send::<&'static dyn Dummy>();
|
||||
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ `(dyn Dummy + 'static)` cannot be shared between threads safely
|
||||
|
|
||||
= help: the trait `Sync` is not implemented for `(dyn Dummy + 'static)`
|
||||
= note: required because of the requirements on the impl of `Send` for `&'static (dyn Dummy + 'static)`
|
||||
= note: required for `&'static (dyn Dummy + 'static)` to implement `Send`
|
||||
note: required by a bound in `assert_send`
|
||||
--> $DIR/kindck-send-object2.rs:3:18
|
||||
|
|
||||
@ -19,7 +19,7 @@ LL | assert_send::<Box<dyn Dummy>>();
|
||||
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ `dyn Dummy` cannot be sent between threads safely
|
||||
|
|
||||
= help: the trait `Send` is not implemented for `dyn Dummy`
|
||||
= note: required because of the requirements on the impl of `Send` for `Unique<dyn Dummy>`
|
||||
= note: required for `Unique<dyn Dummy>` to implement `Send`
|
||||
= note: required because it appears within the type `Box<dyn Dummy>`
|
||||
note: required by a bound in `assert_send`
|
||||
--> $DIR/kindck-send-object2.rs:3:18
|
||||
|
@ -5,7 +5,7 @@ LL | assert_send::<Box<*mut u8>>();
|
||||
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^ `*mut u8` cannot be sent between threads safely
|
||||
|
|
||||
= help: the trait `Send` is not implemented for `*mut u8`
|
||||
= note: required because of the requirements on the impl of `Send` for `Unique<*mut u8>`
|
||||
= note: required for `Unique<*mut u8>` to implement `Send`
|
||||
= note: required because it appears within the type `Box<*mut u8>`
|
||||
note: required by a bound in `assert_send`
|
||||
--> $DIR/kindck-send-owned.rs:3:18
|
||||
|
@ -7,7 +7,7 @@ LL | test_sync(guard);
|
||||
| required by a bound introduced by this call
|
||||
|
|
||||
= help: the trait `Sync` is not implemented for `Cell<i32>`
|
||||
= note: required because of the requirements on the impl of `Sync` for `MutexGuard<'_, Cell<i32>>`
|
||||
= note: required for `MutexGuard<'_, Cell<i32>>` to implement `Sync`
|
||||
note: required by a bound in `test_sync`
|
||||
--> $DIR/mutexguard-sync.rs:5:17
|
||||
|
|
||||
|
@ -6,7 +6,7 @@ LL | assert::<Rc<RefCell<i32>>>();
|
||||
|
|
||||
= help: within `RefCell<i32>`, the trait `RefUnwindSafe` is not implemented for `UnsafeCell<i32>`
|
||||
= note: required because it appears within the type `RefCell<i32>`
|
||||
= note: required because of the requirements on the impl of `UnwindSafe` for `Rc<RefCell<i32>>`
|
||||
= note: required for `Rc<RefCell<i32>>` to implement `UnwindSafe`
|
||||
note: required by a bound in `assert`
|
||||
--> $DIR/not-panic-safe-2.rs:7:14
|
||||
|
|
||||
@ -22,7 +22,7 @@ LL | assert::<Rc<RefCell<i32>>>();
|
||||
= help: within `RefCell<i32>`, the trait `RefUnwindSafe` is not implemented for `UnsafeCell<isize>`
|
||||
= note: required because it appears within the type `Cell<isize>`
|
||||
= note: required because it appears within the type `RefCell<i32>`
|
||||
= note: required because of the requirements on the impl of `UnwindSafe` for `Rc<RefCell<i32>>`
|
||||
= note: required for `Rc<RefCell<i32>>` to implement `UnwindSafe`
|
||||
note: required by a bound in `assert`
|
||||
--> $DIR/not-panic-safe-2.rs:7:14
|
||||
|
|
||||
|
@ -6,7 +6,7 @@ LL | assert::<Arc<RefCell<i32>>>();
|
||||
|
|
||||
= help: within `RefCell<i32>`, the trait `RefUnwindSafe` is not implemented for `UnsafeCell<i32>`
|
||||
= note: required because it appears within the type `RefCell<i32>`
|
||||
= note: required because of the requirements on the impl of `UnwindSafe` for `Arc<RefCell<i32>>`
|
||||
= note: required for `Arc<RefCell<i32>>` to implement `UnwindSafe`
|
||||
note: required by a bound in `assert`
|
||||
--> $DIR/not-panic-safe-3.rs:7:14
|
||||
|
|
||||
@ -22,7 +22,7 @@ LL | assert::<Arc<RefCell<i32>>>();
|
||||
= help: within `RefCell<i32>`, the trait `RefUnwindSafe` is not implemented for `UnsafeCell<isize>`
|
||||
= note: required because it appears within the type `Cell<isize>`
|
||||
= note: required because it appears within the type `RefCell<i32>`
|
||||
= note: required because of the requirements on the impl of `UnwindSafe` for `Arc<RefCell<i32>>`
|
||||
= note: required for `Arc<RefCell<i32>>` to implement `UnwindSafe`
|
||||
note: required by a bound in `assert`
|
||||
--> $DIR/not-panic-safe-3.rs:7:14
|
||||
|
|
||||
|
@ -6,7 +6,7 @@ LL | assert::<&RefCell<i32>>();
|
||||
|
|
||||
= help: within `RefCell<i32>`, the trait `RefUnwindSafe` is not implemented for `UnsafeCell<i32>`
|
||||
= note: required because it appears within the type `RefCell<i32>`
|
||||
= note: required because of the requirements on the impl of `UnwindSafe` for `&RefCell<i32>`
|
||||
= note: required for `&RefCell<i32>` to implement `UnwindSafe`
|
||||
note: required by a bound in `assert`
|
||||
--> $DIR/not-panic-safe-4.rs:6:14
|
||||
|
|
||||
@ -22,7 +22,7 @@ LL | assert::<&RefCell<i32>>();
|
||||
= help: within `RefCell<i32>`, the trait `RefUnwindSafe` is not implemented for `UnsafeCell<isize>`
|
||||
= note: required because it appears within the type `Cell<isize>`
|
||||
= note: required because it appears within the type `RefCell<i32>`
|
||||
= note: required because of the requirements on the impl of `UnwindSafe` for `&RefCell<i32>`
|
||||
= note: required for `&RefCell<i32>` to implement `UnwindSafe`
|
||||
note: required by a bound in `assert`
|
||||
--> $DIR/not-panic-safe-4.rs:6:14
|
||||
|
|
||||
|
@ -5,7 +5,7 @@ LL | assert::<*const UnsafeCell<i32>>();
|
||||
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ `UnsafeCell<i32>` may contain interior mutability and a reference may not be safely transferrable across a catch_unwind boundary
|
||||
|
|
||||
= help: the trait `RefUnwindSafe` is not implemented for `UnsafeCell<i32>`
|
||||
= note: required because of the requirements on the impl of `UnwindSafe` for `*const UnsafeCell<i32>`
|
||||
= note: required for `*const UnsafeCell<i32>` to implement `UnwindSafe`
|
||||
note: required by a bound in `assert`
|
||||
--> $DIR/not-panic-safe-5.rs:6:14
|
||||
|
|
||||
|
@ -6,7 +6,7 @@ LL | assert::<*mut RefCell<i32>>();
|
||||
|
|
||||
= help: within `RefCell<i32>`, the trait `RefUnwindSafe` is not implemented for `UnsafeCell<i32>`
|
||||
= note: required because it appears within the type `RefCell<i32>`
|
||||
= note: required because of the requirements on the impl of `UnwindSafe` for `*mut RefCell<i32>`
|
||||
= note: required for `*mut RefCell<i32>` to implement `UnwindSafe`
|
||||
note: required by a bound in `assert`
|
||||
--> $DIR/not-panic-safe-6.rs:6:14
|
||||
|
|
||||
@ -22,7 +22,7 @@ LL | assert::<*mut RefCell<i32>>();
|
||||
= help: within `RefCell<i32>`, the trait `RefUnwindSafe` is not implemented for `UnsafeCell<isize>`
|
||||
= note: required because it appears within the type `Cell<isize>`
|
||||
= note: required because it appears within the type `RefCell<i32>`
|
||||
= note: required because of the requirements on the impl of `UnwindSafe` for `*mut RefCell<i32>`
|
||||
= note: required for `*mut RefCell<i32>` to implement `UnwindSafe`
|
||||
note: required by a bound in `assert`
|
||||
--> $DIR/not-panic-safe-6.rs:6:14
|
||||
|
|
||||
|
@ -29,7 +29,7 @@ LL | fn foo<T>(&self, val: T);
|
||||
LL | trait Bar: Foo { }
|
||||
| --- this trait cannot be made into an object...
|
||||
= help: consider moving `foo` to another trait
|
||||
= note: required because of the requirements on the impl of `CoerceUnsized<&mut dyn Bar>` for `&mut Thing`
|
||||
= note: required for `&mut Thing` to implement `CoerceUnsized<&mut dyn Bar>`
|
||||
= note: required by cast to type `&mut dyn Bar`
|
||||
|
||||
error: aborting due to 2 previous errors
|
||||
|
@ -12,7 +12,7 @@ LL | trait Bar {
|
||||
LL | const X: usize;
|
||||
| ^ ...because it contains this associated `const`
|
||||
= help: consider moving `X` to another trait
|
||||
= note: required because of the requirements on the impl of `CoerceUnsized<&dyn Bar>` for `&T`
|
||||
= note: required for `&T` to implement `CoerceUnsized<&dyn Bar>`
|
||||
= note: required by cast to type `&dyn Bar`
|
||||
|
||||
error: aborting due to previous error
|
||||
|
@ -12,7 +12,7 @@ LL | trait Bar {
|
||||
LL | fn bar<T>(&self, t: T);
|
||||
| ^^^ ...because method `bar` has generic type parameters
|
||||
= help: consider moving `bar` to another trait
|
||||
= note: required because of the requirements on the impl of `CoerceUnsized<&dyn Bar>` for `&T`
|
||||
= note: required for `&T` to implement `CoerceUnsized<&dyn Bar>`
|
||||
= note: required by cast to type `&dyn Bar`
|
||||
|
||||
error[E0038]: the trait `Bar` cannot be made into an object
|
||||
@ -29,7 +29,7 @@ LL | trait Bar {
|
||||
LL | fn bar<T>(&self, t: T);
|
||||
| ^^^ ...because method `bar` has generic type parameters
|
||||
= help: consider moving `bar` to another trait
|
||||
= note: required because of the requirements on the impl of `CoerceUnsized<&dyn Bar>` for `&T`
|
||||
= note: required for `&T` to implement `CoerceUnsized<&dyn Bar>`
|
||||
= note: required by cast to type `&dyn Bar`
|
||||
|
||||
error: aborting due to 2 previous errors
|
||||
|
@ -12,7 +12,7 @@ LL | trait Bar {
|
||||
LL | fn bar(&self, x: &Self);
|
||||
| ^^^^^ ...because method `bar` references the `Self` type in this parameter
|
||||
= help: consider moving `bar` to another trait
|
||||
= note: required because of the requirements on the impl of `CoerceUnsized<&dyn Bar>` for `&T`
|
||||
= note: required for `&T` to implement `CoerceUnsized<&dyn Bar>`
|
||||
= note: required by cast to type `&dyn Bar`
|
||||
|
||||
error[E0038]: the trait `Baz` cannot be made into an object
|
||||
@ -29,7 +29,7 @@ LL | trait Baz {
|
||||
LL | fn baz(&self) -> Self;
|
||||
| ^^^^ ...because method `baz` references the `Self` type in its return type
|
||||
= help: consider moving `baz` to another trait
|
||||
= note: required because of the requirements on the impl of `CoerceUnsized<&dyn Baz>` for `&T`
|
||||
= note: required for `&T` to implement `CoerceUnsized<&dyn Baz>`
|
||||
= note: required by cast to type `&dyn Baz`
|
||||
|
||||
error: aborting due to 2 previous errors
|
||||
|
@ -11,7 +11,7 @@ LL | trait Foo {
|
||||
| --- this trait cannot be made into an object...
|
||||
LL | fn foo() {}
|
||||
| ^^^ ...because associated function `foo` has no `self` parameter
|
||||
= note: required because of the requirements on the impl of `CoerceUnsized<Box<dyn Foo>>` for `Box<Bar>`
|
||||
= note: required for `Box<Bar>` to implement `CoerceUnsized<Box<dyn Foo>>`
|
||||
= note: required by cast to type `Box<dyn Foo>`
|
||||
help: consider turning `foo` into a method by giving it a `&self` argument
|
||||
|
|
||||
|
@ -11,7 +11,7 @@ LL | trait Bar
|
||||
| --- this trait cannot be made into an object...
|
||||
LL | where Self : Sized
|
||||
| ^^^^^ ...because it requires `Self: Sized`
|
||||
= note: required because of the requirements on the impl of `CoerceUnsized<&dyn Bar>` for `&T`
|
||||
= note: required for `&T` to implement `CoerceUnsized<&dyn Bar>`
|
||||
= note: required by cast to type `&dyn Bar`
|
||||
|
||||
error: aborting due to previous error
|
||||
|
@ -11,7 +11,7 @@ LL | trait Bar : Sized {
|
||||
| --- ^^^^^ ...because it requires `Self: Sized`
|
||||
| |
|
||||
| this trait cannot be made into an object...
|
||||
= note: required because of the requirements on the impl of `CoerceUnsized<&dyn Bar>` for `&T`
|
||||
= note: required for `&T` to implement `CoerceUnsized<&dyn Bar>`
|
||||
= note: required by cast to type `&dyn Bar`
|
||||
|
||||
error: aborting due to previous error
|
||||
|
@ -6,7 +6,7 @@ LL | x[1i32];
|
||||
|
|
||||
= help: the trait `SliceIndex<[i32]>` is not implemented for `i32`
|
||||
= help: the trait `SliceIndex<[T]>` is implemented for `usize`
|
||||
= note: required because of the requirements on the impl of `Index<i32>` for `[i32]`
|
||||
= note: required for `[i32]` to implement `Index<i32>`
|
||||
|
||||
error[E0277]: the type `[i32]` cannot be indexed by `RangeTo<i32>`
|
||||
--> $DIR/slice-index.rs:9:7
|
||||
@ -18,7 +18,7 @@ LL | x[..1i32];
|
||||
= help: the following other types implement trait `SliceIndex<T>`:
|
||||
<RangeTo<usize> as SliceIndex<[T]>>
|
||||
<RangeTo<usize> as SliceIndex<str>>
|
||||
= note: required because of the requirements on the impl of `Index<RangeTo<i32>>` for `[i32]`
|
||||
= note: required for `[i32]` to implement `Index<RangeTo<i32>>`
|
||||
|
||||
error: aborting due to 2 previous errors
|
||||
|
||||
|
@ -24,7 +24,7 @@ LL | | }.hi() {
|
||||
| |__________^ `bool` is not an iterator
|
||||
|
|
||||
= help: the trait `Iterator` is not implemented for `bool`
|
||||
= note: required because of the requirements on the impl of `IntoIterator` for `bool`
|
||||
= note: required for `bool` to implement `IntoIterator`
|
||||
|
||||
error: aborting due to 2 previous errors
|
||||
|
||||
|
@ -6,7 +6,7 @@ LL | is_zen(x)
|
||||
| |
|
||||
| required by a bound introduced by this call
|
||||
|
|
||||
note: required because of the requirements on the impl of `Zen` for `&T`
|
||||
note: required for `&T` to implement `Zen`
|
||||
--> $DIR/phantom-auto-trait.rs:10:24
|
||||
|
|
||||
LL | unsafe impl<'a, T: 'a> Zen for &'a T where T: Sync {}
|
||||
@ -35,7 +35,7 @@ LL | is_zen(x)
|
||||
| |
|
||||
| required by a bound introduced by this call
|
||||
|
|
||||
note: required because of the requirements on the impl of `Zen` for `&T`
|
||||
note: required for `&T` to implement `Zen`
|
||||
--> $DIR/phantom-auto-trait.rs:10:24
|
||||
|
|
||||
LL | unsafe impl<'a, T: 'a> Zen for &'a T where T: Sync {}
|
||||
|
@ -20,8 +20,8 @@ LL | for i in false..true {}
|
||||
isize
|
||||
u128
|
||||
and 5 others
|
||||
= note: required because of the requirements on the impl of `Iterator` for `std::ops::Range<bool>`
|
||||
= note: required because of the requirements on the impl of `IntoIterator` for `std::ops::Range<bool>`
|
||||
= note: required for `std::ops::Range<bool>` to implement `Iterator`
|
||||
= note: required for `std::ops::Range<bool>` to implement `IntoIterator`
|
||||
|
||||
error[E0277]: the size for values of type `[{integer}]` cannot be known at compilation time
|
||||
--> $DIR/range-1.rs:14:17
|
||||
|
@ -12,7 +12,7 @@ LL | func(&mut iter.map(|x| x + 1))
|
||||
error[E0275]: overflow evaluating the requirement `Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut std::ops::Range<u8>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>: Iterator`
|
||||
|
|
||||
= help: consider increasing the recursion limit by adding a `#![recursion_limit = "256"]` attribute to your crate (`issue_83150`)
|
||||
= note: required because of the requirements on the impl of `Iterator` for `&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut std::ops::Range<u8>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>`
|
||||
= note: required for `&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut Map<&mut std::ops::Range<u8>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>, [closure@$DIR/issue-83150.rs:11:24: 11:27]>` to implement `Iterator`
|
||||
|
||||
error: aborting due to previous error; 1 warning emitted
|
||||
|
||||
|
@ -9,7 +9,7 @@ LL | | }
|
||||
| |_^ `main` can only return types that implement `Termination`
|
||||
|
|
||||
= help: the trait `Termination` is not implemented for `f32`
|
||||
= note: required because of the requirements on the impl of `Termination` for `Result<f32, ParseFloatError>`
|
||||
= note: required for `Result<f32, ParseFloatError>` to implement `Termination`
|
||||
note: required by a bound in `assert_test_result`
|
||||
--> $SRC_DIR/test/src/lib.rs:LL:COL
|
||||
|
|
||||
|
@ -54,13 +54,13 @@ LL | const _: () = check($exp);
|
||||
LL | ConstDropImplWithBounds::<NonTrivialDrop>(PhantomData),
|
||||
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ expected an implementor of trait `~const Destruct`
|
||||
|
|
||||
note: required because of the requirements on the impl of `~const Destruct` for `ConstDropImplWithBounds<NonTrivialDrop>`
|
||||
note: required for `ConstDropImplWithBounds<NonTrivialDrop>` to implement `~const Destruct`
|
||||
--> $DIR/const-drop-fail.rs:28:25
|
||||
|
|
||||
LL | impl<T: ~const A> const Drop for ConstDropImplWithBounds<T> {
|
||||
| ^^^^ ^^^^^^^^^^^^^^^^^^^^^^^^^^
|
||||
= note: 1 redundant requirement hidden
|
||||
= note: required because of the requirements on the impl of `~const Destruct` for `ConstDropImplWithBounds<NonTrivialDrop>`
|
||||
= note: required for `ConstDropImplWithBounds<NonTrivialDrop>` to implement `~const Destruct`
|
||||
note: required by a bound in `check`
|
||||
--> $DIR/const-drop-fail.rs:34:19
|
||||
|
|
||||
|
@ -54,13 +54,13 @@ LL | const _: () = check($exp);
|
||||
LL | ConstDropImplWithBounds::<NonTrivialDrop>(PhantomData),
|
||||
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ expected an implementor of trait `~const Destruct`
|
||||
|
|
||||
note: required because of the requirements on the impl of `~const Destruct` for `ConstDropImplWithBounds<NonTrivialDrop>`
|
||||
note: required for `ConstDropImplWithBounds<NonTrivialDrop>` to implement `~const Destruct`
|
||||
--> $DIR/const-drop-fail.rs:28:25
|
||||
|
|
||||
LL | impl<T: ~const A> const Drop for ConstDropImplWithBounds<T> {
|
||||
| ^^^^ ^^^^^^^^^^^^^^^^^^^^^^^^^^
|
||||
= note: 1 redundant requirement hidden
|
||||
= note: required because of the requirements on the impl of `~const Destruct` for `ConstDropImplWithBounds<NonTrivialDrop>`
|
||||
= note: required for `ConstDropImplWithBounds<NonTrivialDrop>` to implement `~const Destruct`
|
||||
note: required by a bound in `check`
|
||||
--> $DIR/const-drop-fail.rs:34:19
|
||||
|
|
||||
|
@ -31,7 +31,7 @@ LL | trait Foo {
|
||||
| --- this trait cannot be made into an object...
|
||||
LL | fn foo(self: &Rc<Self>) -> usize;
|
||||
| ^^^^^^^^^ ...because method `foo`'s `self` parameter cannot be dispatched on
|
||||
= note: required because of the requirements on the impl of `CoerceUnsized<Rc<dyn Foo>>` for `Rc<usize>`
|
||||
= note: required for `Rc<usize>` to implement `CoerceUnsized<Rc<dyn Foo>>`
|
||||
= note: required by cast to type `Rc<dyn Foo>`
|
||||
|
||||
error: aborting due to 2 previous errors
|
||||
|
@ -14,7 +14,7 @@ LL | trait Foo {
|
||||
| --- this trait cannot be made into an object...
|
||||
LL | fn foo(self: &Rc<Self>) -> usize;
|
||||
| ^^^^^^^^^ ...because method `foo`'s `self` parameter cannot be dispatched on
|
||||
= note: required because of the requirements on the impl of `CoerceUnsized<Rc<dyn Foo>>` for `Rc<usize>`
|
||||
= note: required for `Rc<usize>` to implement `CoerceUnsized<Rc<dyn Foo>>`
|
||||
= note: required by cast to type `Rc<dyn Foo>`
|
||||
|
||||
error: aborting due to previous error
|
||||
|
@ -14,7 +14,7 @@ error[E0277]: can't compare `T` with `T`
|
||||
LL | default type U<'a> = &'a T;
|
||||
| ^^^^^ no implementation for `T == T`
|
||||
|
|
||||
= note: required because of the requirements on the impl of `PartialEq` for `&'a T`
|
||||
= note: required for `&'a T` to implement `PartialEq`
|
||||
note: required by a bound in `X::U`
|
||||
--> $DIR/default-generic-associated-type-bound.rs:8:17
|
||||
|
|
||||
|
@ -10,7 +10,7 @@ LL | #![feature(specialization)]
|
||||
|
||||
error[E0275]: overflow evaluating the requirement `i32: Check`
|
||||
|
|
||||
note: required because of the requirements on the impl of `Iterate` for `i32`
|
||||
note: required for `i32` to implement `Iterate`
|
||||
--> $DIR/issue-38091-2.rs:11:13
|
||||
|
|
||||
LL | impl<'a, T> Iterate<'a> for T
|
||||
|
Some files were not shown because too many files have changed in this diff Show More
Loading…
Reference in New Issue
Block a user