Java泛型推理过于宽泛



我有 2 个类:

class M {
    public <R, A, T extends A> A walk(BiFunction<Widget, Integer, Stream<R>> walker, BiFunction<A, Stream<R>, T> accF, A acc, int level) {
        return accF.apply(acc, walker.apply(this, level));
    }
}

class N extends M {
    public Stream<M> getChildren() {return Stream.of(new M()...);}
    @Override
    public <RR, A, T extends A> T walk(BiFunction<Widget, Integer, Stream<RR>> walker, BiFunction<A, Stream<RR>, T> accF, A acc, int level) {
        return accF.apply(accF.apply(acc, walker.apply(this, level)), getChildren().map(o -> o.walk(walker, accF, acc, level + 1)));
    }
}

但是,编译器在o.walk(walker, accF, acc, level + 1)inference variable T has incompatible bounds: equality constraints: T upper bounds: A, Object, RR

为什么会这样,我该如何解决这个问题?

这是一些非常复杂的代码,我没有时间真正考虑它,但由于getChildren()返回任何M并且N#walk使用自己的泛型定义,编译器知道例如 A可以是不同的类型,对孩子和walk有不同的界限。

您可以尝试将通用定义放在类级别,例如

class M <R, A, T extends A> { 
  public  A walk(...) { ... }
}
class N <RR, A, T extends A> extends M< RR, A, T> { 
  public Stream<M<RR, A, T>> getChildren() {...}
  public  A walk(...) { ... }
}

最新更新