2022-05-22 07:13:25 +00:00
|
|
|
// build-fail
|
2022-05-25 18:11:07 +00:00
|
|
|
// compile-flags: -Zinline-mir=no
|
2023-03-14 13:56:16 +00:00
|
|
|
// error-pattern: overflow evaluating the requirement `<std::iter::Empty<()> as Iterator>::Item == ()`
|
2022-05-22 07:13:25 +00:00
|
|
|
// error-pattern: function cannot return without recursing
|
2022-11-17 03:09:57 +00:00
|
|
|
// normalize-stderr-test: "long-type-\d+" -> "long-type-hash"
|
2022-05-22 07:13:25 +00:00
|
|
|
|
|
|
|
// Regression test for #91949.
|
|
|
|
// This hanged *forever* on 1.56, fixed by #90423.
|
|
|
|
|
|
|
|
#![recursion_limit = "256"]
|
|
|
|
|
|
|
|
struct Wrapped<T>(T);
|
|
|
|
|
|
|
|
struct IteratorOfWrapped<T, I: Iterator<Item = T>>(I);
|
|
|
|
|
|
|
|
impl<T, I: Iterator<Item = T>> Iterator for IteratorOfWrapped<T, I> {
|
|
|
|
type Item = Wrapped<T>;
|
|
|
|
fn next(&mut self) -> Option<Wrapped<T>> {
|
|
|
|
self.0.next().map(Wrapped)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn recurse<T>(elements: T) -> Vec<char>
|
|
|
|
where
|
|
|
|
T: Iterator<Item = ()>,
|
|
|
|
{
|
|
|
|
recurse(IteratorOfWrapped(elements).map(|t| t.0))
|
|
|
|
}
|
|
|
|
|
|
|
|
fn main() {
|
|
|
|
recurse(std::iter::empty());
|
|
|
|
}
|