diff options
Diffstat (limited to 'test/files/pos/ticket2251.scala')
-rw-r--r-- | test/files/pos/ticket2251.scala | 23 |
1 files changed, 0 insertions, 23 deletions
diff --git a/test/files/pos/ticket2251.scala b/test/files/pos/ticket2251.scala deleted file mode 100644 index 1e8727e999..0000000000 --- a/test/files/pos/ticket2251.scala +++ /dev/null @@ -1,23 +0,0 @@ -// derived from pos/bug1001 -class A -trait B[T <: B[T]] extends A -class C extends B[C] -class D extends B[D] - -class Data { - // force computing lub of C and D (printLubs enabled:) - -/* -lub of List(D, C) at depth 2 - lub of List(D, C) at depth 1 - lub of List(D, C) at depth 0 - lub of List(D, C) is A - lub of List(D, C) is B[_1] forSome { type _1 >: D with C <: A } -lub of List(D, C) is B[_2] forSome { type _2 >: D with C{} <: B[_1] forSome { type _1 >: D with C{} <: A } } -*/ -// --> result = WRONG - - // should be: B[X] forSome {type X <: B[X]} -- can this be done automatically? for now, just detect f-bounded polymorphism and fall back to more coarse approximation - - val data: List[A] = List(new C, new D) -} |