Merge remote-tracking branch 'staging/add-semantic-names' into add-semantic-names

# Conflicts:
#	compiler/src/dotty/tools/dotc/core/SymDenotations.scala

Author: odersky

tests/pending/neg/i1846.scala

@@ -0,0 +1,5 @@
+object Bug {
+  final val x = 42
+  val y = x
+  x match {case y.toString => 42 case y => 42}
+}

tests/pending/neg/i1905.scala

@@ -0,0 +1,21 @@
+class Arr[T](val underlying: scala.Array[T]) extends AnyVal {
+  def foo = underlying
+}
+
+abstract class SeqMonoTransforms[+A, +Repr] {
+  protected[this] def fromIterableWithSameElemType(): Repr
+  def getFIWSET: Repr = fromIterableWithSameElemType
+}
+
+class ArrOps[A](val xs: Arr[A]) extends SeqMonoTransforms[A, Arr[A]] {
+  def fromIterableWithSameElemType(): Arr[A] = xs
+}
+
+object Test {
+  def main(args: Array[String]) = {
+    val arr = new Arr(Array(1, 2, 3))
+    val t = new ArrOps(arr)
+    val t2 = t.getFIWSET
+    val x = arr.foo
+  }
+}

tests/pending/neg/i2104.scala

@@ -0,0 +1,18 @@
+case class Pair[A, B](_1: A, _2: B)
+
+trait Cons[+H, +T]
+
+object Cons {
+  def apply[H, T](h: H, t: T): Cons[H, T] = ???
+  def unapply[H, T](t: Cons[H, T]): Option[Pair[H, T]] = ???
+}
+
+object Test {
+  def main(args: Array[String]): Unit = {
+    Cons(Option(1), None) match {
+      case Cons(Some(i), None) =>
+        i: Int // error: found: Any(i), requires: Int
+        assert(i == 1)
+    }
+  }
+}

tests/pending/neg/match.scala

@@ -0,0 +1,33 @@
+object Test {
+
+  class Seq[T]
+  class List[T] extends Seq[T] { def head: T = ??? }
+
+  val ss: Seq[Int] = ???
+  ss match {
+    case ss: List[int] =>
+      val x = ss.head
+      val y: Int = x
+  }
+}
+object Test1 {
+
+  class Seq[T]
+  class List[T] extends Seq[T] { def head: T = ??? }
+
+  val ss: Seq[Int] = ???
+  ss match {
+    case ss: List[Int] =>
+      println(ss)
+  }
+}
+object Test2 {
+
+  trait A
+  trait B
+  val x: A & B = ???
+
+  (x: A) match {
+    case x: B =>
+  }
+}

tests/pending/pos/TypeIndexing.scala

@@ -0,0 +1,18 @@
+// works in neither scalac nor dotty, but maybe could be made to work?
+  trait A {
+    type T
+    val t : T
+  }
+
+  object A {
+    def unapply(arg: A): Option[arg.T] = Some(arg.t)
+  }
+
+object Test {
+  def use(a : A) = a match  {
+    case b @ A(t) ⇒
+      val s: b.T = t // type mismatch.
+                     // found t.type (with underlying type <unapply-selector>.T)
+                     // required: a.T
+  }
+}

tests/pending/pos/i1793.scala

@@ -0,0 +1,7 @@
+object Test {
+  import scala.ref.WeakReference
+  def unapply[T <: AnyRef](wr: WeakReference[T]): Option[T] = {
+    val x = wr.underlying.get
+    if (x != null) Some(x) else None
+  }
+}

tests/pending/pos/i1960.scala

@@ -0,0 +1,8 @@
+case class CC2[A, B](_1: A, _2: B)
+
+object Test {
+  def main(args: Array[String]): Unit = {
+    val CC2(_, CC2(a, _)) = CC2(0, CC2(1, 2))
+    assert(a == 1)
+  }
+}

tests/pending/pos/i2032.scala

@@ -0,0 +1,2 @@
+class foo(annotation: Any) // annotation.StaticAnnotation
+@foo(new AnyRef {}) trait A

tests/pending/pos/i2071.scala

@@ -0,0 +1,7 @@
+object Test {
+  type PF[A, B] = PartialFunction[A, B]
+
+  val f: PF[Int, String] = {
+    case i => "bar"
+  }
+}

tests/pending/pos/i2201a.scala

@@ -0,0 +1,8 @@
+class Foo[T]
+
+class Fix[F[_]](unfix: F[Fix[F]])
+object DocTree {
+  type Const[T] = Foo[Int]
+  type FixConst = Fix[Const]
+  def docTree(s: Const[FixConst]): FixConst = new Fix(s)
+}

tests/pending/pos/i2201b.scala

@@ -0,0 +1,14 @@
+trait X
+trait Y
+
+object Test {
+  type One[A <: X, B <: Y]
+
+  type Two[TA <: Y, TB <: X] = One[TB, TA]
+
+  def foo[M[_ <: Y, _ <: X]](x: M[_ <: Y, _ <: X]) = x
+
+  val a: Two[Y, X] = ???
+
+  foo(a)
+}

tests/pending/pos/i2201c.scala

@@ -0,0 +1,11 @@
+object Test {
+  implicit val theAnswer: Int = 42
+
+  type Swap[A, B] = (B, A)
+
+  def foo[M[_, _], T, S](x: M[T, S])(implicit ev: T) = ev
+
+  val a: Swap[Int, String] = ("hi", 1)
+
+  foo(a)
+}

tests/pending/pos/match.scala

@@ -0,0 +1,7 @@
+object Test {
+
+  val ss: Seq[Int] = ???
+  ss match {
+    case ss: List[Int] => ???
+  }
+}

tests/pending/pos/namedTypeParams.scala

@@ -0,0 +1,9 @@
+object Test {
+
+  def f[X, Y](x: X, y: Y): Int = ???
+
+  f[Int, String](1, "")
+  f[X = Int, Y = String](1, "")
+  f[X = Int](1, "")
+  f[Y = String](1, "")
+}

tests/pending/pos/t9844.scala

@@ -0,0 +1,2 @@
+trait X[T <: X[T]] { self: T => }
+object Y extends X[Y.type]

tests/pending/run/i2072.scala

@@ -0,0 +1,21 @@
+trait T { lazy val x: String = "foo" }
+trait U { def x: Any }
+abstract class AC extends T with U // { def x: Any }
+
+abstract class B { def x: Any }
+class C extends B { def x: String = "abc" }
+
+package p2 {
+trait T1 { def f: Any }
+trait T2 extends T1 { def f: Number = ??? }
+trait T3 extends T1 { override def f: Integer = ??? }
+class C extends T2 with T3
+}
+
+package p3 {
+
+  trait A { def f: Any }
+  trait B extends A { def f: String }
+  class C extends B { def f = "abc" }
+
+}

tests/pending/run/nestedEq.scala

@@ -0,0 +1,43 @@
+    class Outer {
+
+      case class Inner()
+      case class Inner2()
+
+      val inner: Inner = new Inner
+      val inner2 = new Inner2
+
+      def checkInstance(o: Outer) =
+        o.inner.isInstanceOf[this.Inner]
+
+      def checkPattern1(i: Any) =
+        i match {
+          case _: Inner => true
+          case _ => false
+        }
+
+      def checkPattern2(i: Any) =
+        i match {
+          case Inner() => true
+          case _ => false
+        }
+
+      def checkEquals(o: Outer) =
+        o.inner == inner
+
+    }
+
+    object Test {
+
+      def main(args: Array[String]) = {
+        val o1 = new Outer
+        val o2 = new Outer
+        println(o1.inner.hashCode)
+        println(o2.inner.hashCode)
+        println(o2.inner2.hashCode)
+        assert(o1.checkInstance(o2))
+        assert(!o1.checkPattern1(o2.inner))
+        assert(!o1.checkPattern2(o2.inner))
+        assert(!o1.checkEquals(o2))
+      }
+
+    }

tests/pos/i2081.scala

@@ -0,0 +1,11 @@
+trait Foo {
+  // This should not generate a $init method.
+  // Currently this needs to be verified by manual inspection of the bytecode.
+  def meth(x: Int): Int
+}
+trait Bar extends Foo
+trait Bam
+
+class C extends Foo with Bar {
+  def meth(x: Int) = x
+}

tests/pos/i2152.scala

@@ -0,0 +1,7 @@
+class Contra[-D](task: AnyRef)
+object Test {
+  def narrow(task: AnyRef): Contra[task.type] = new Contra(task)
+  def ident[Before](elems: Contra[Before]): Contra[Before] = elems
+  val foo = null
+  ident(narrow(foo))
+}