generics: &Generics,
arg: &Type,
cx: &DocContext<'_>,
+ recurse: i32,
) -> FxHashSet<Type> {
let arg_s = arg.to_string();
let mut res = FxHashSet::default();
+ if recurse >= 10 { // FIXME: remove this whole recurse thing when the recursion bug is fixed
+ return res;
+ }
if arg.is_full_generic() {
if let Some(where_pred) = generics.where_predicates.iter().find(|g| {
match g {
continue
}
if let Some(ty) = x.get_type(cx) {
- let adds = get_real_types(generics, &ty, cx);
+ let adds = get_real_types(generics, &ty, cx, recurse + 1);
if !adds.is_empty() {
res.extend(adds);
} else if !ty.is_full_generic() {
}) {
for bound in bound.get_bounds().unwrap_or_else(|| &[]) {
if let Some(ty) = bound.get_trait_type() {
- let adds = get_real_types(generics, &ty, cx);
+ let adds = get_real_types(generics, &ty, cx, recurse + 1);
if !adds.is_empty() {
res.extend(adds);
} else if !ty.is_full_generic() {
if let Some(gens) = arg.generics() {
for gen in gens.iter() {
if gen.is_full_generic() {
- let adds = get_real_types(generics, gen, cx);
+ let adds = get_real_types(generics, gen, cx, recurse + 1);
if !adds.is_empty() {
res.extend(adds);
}
if arg.type_.is_self_type() {
continue;
}
- let args = get_real_types(generics, &arg.type_, cx);
+ let args = get_real_types(generics, &arg.type_, cx, 0);
if !args.is_empty() {
all_types.extend(args);
} else {
let ret_types = match decl.output {
FunctionRetTy::Return(ref return_type) => {
- let mut ret = get_real_types(generics, &return_type, cx);
+ let mut ret = get_real_types(generics, &return_type, cx, 0);
if ret.is_empty() {
ret.insert(return_type.clone());
}