Ensure spaces after if in Dotty tests.

Author: DarkDimius

tests/pending/pos/t4579.scala

@@ -400,7 +400,7 @@ object LispAny extends Lisp {
 
   val globalEnv = EmptyEnvironment
     .extend("=", Lambda{
-      case List(arg1, arg2) => if(arg1 == arg2) 1 else 0})
+      case List(arg1, arg2) => if (arg1 == arg2) 1 else 0})
     .extend("+", Lambda{
       case List(arg1: Int, arg2: Int) => arg1 + arg2
       case List(arg1: String, arg2: String) => arg1 + arg2})

tests/pending/pos/t5012.scala

@@ -4,7 +4,7 @@ class D {
 
 class C {
   def m: D = {
-    if("abc".length == 0) {
+    if ("abc".length == 0) {
       object p       // (program point 2)
     }
     null

tests/pending/pos/t5541.scala

@@ -36,9 +36,9 @@ class HASkipListView[ S <: Sys[ S ], A ]( private val l: HASkipList[ S, A ])( im
     val szm = sz - 1
     val keys = IndexedSeq.tabulate( sz ) { i =>
       val key     = n.key( i )
-      (key, if( isRight && i == szm ) "M" else key.toString)
+      (key, if ( isRight && i == szm ) "M" else key.toString)
     }
-    val chbo = if( n.isLeaf ) None else {
+    val chbo = if ( n.isLeaf ) None else {
       val nb = n.asBranch
       Some( IndexedSeq.tabulate( sz )( i => buildBoxMap( nb.down( i ), isRight && (i == szm) )))
     }

tests/pending/pos/tcpoly_seq.scala

@@ -125,7 +125,7 @@ trait HOSeq {
   // TODO: the var tl approach does not seem to work because subtyping isn't fully working yet
   final case class ::[+b](hd: b, private val tl: List[b]) extends List[b] {
     def head = hd
-    def tail = if(tl==null) this else tl // hack
+    def tail = if (tl==null) this else tl // hack
     override def isEmpty: Boolean = false
   }
 

tests/pending/pos/tcpoly_seq_typealias.scala

@@ -129,7 +129,7 @@ trait HOSeq {
   // TODO: the var tl approach does not seem to work because subtyping isn't fully working yet
   final case class ::[+b](hd: b, private val tl: List[b]) extends List[b] {
     def head = hd
-    def tail = if(tl==null) this else tl // hack
+    def tail = if (tl==null) this else tl // hack
     override def isEmpty: Boolean = false
   }
 

tests/pending/pos/unapplySeq.scala

@@ -1,6 +1,6 @@
 object FooSeq {
   def unapplySeq(x:Any): Option[Product2[Int,Seq[String]]] = {
-    if(x.isInstanceOf[Bar]) {
+    if (x.isInstanceOf[Bar]) {
       val y = x.asInstanceOf[Bar]
       Some(y.size, y.name)
     } else None

tests/pos/t262.scala

@@ -3,7 +3,7 @@ object O {
     def f:A;
   }
   class B extends A {
-    def f = if(1 == 2) new C else new D;
+    def f = if (1 == 2) new C else new D;
   }
   class C extends A {
     def f = this;

tests/untried/neg/lubs.scala

@@ -3,7 +3,7 @@ object test1 {
   class C extends A[C]
   class D extends A[D]
 
-  def f = if(1 == 2) new C else new D
+  def f = if (1 == 2) new C else new D
 
   val x1: A[Any] = f
   val x2: A[A[Any]] = f

tests/untried/neg/t2275a.scala

@@ -1,5 +1,5 @@
 object Test {
-  if(true) {
+  if (true) {
     <br>
   }else{
     <span>{"louenesee"}</span>

tests/untried/neg/t963b.scala

@@ -10,7 +10,7 @@ object B {
   var a : A = _
   var b : Boolean = false
   def y : A = {
-    if(b) {
+    if (b) {
       a = new A { type T = Int; var v = 1 }
       a
     } else {

tests/untried/neg/xmlcorner.scala

@@ -11,7 +11,7 @@ object pos
     def wrap(f : Int => Unit) = f(5)
 
     wrap({ v =>
-        if(v == 5) {
+        if (v == 5) {
             val n = {
                 val m = (<a>{}</a>)
                 <div>{ v }</div>

tests/untried/pos/spec-sparsearray-new.scala

@@ -4,7 +4,7 @@ import scala.collection.mutable.MapLike
 class SparseArray[@specialized(Int) T:ClassTag] extends collection.mutable.Map[Int,T] with collection.mutable.MapLike[Int,T,SparseArray[T]] {
   override def get(x: Int) = {
     val ind = findOffset(x)
-    if(ind < 0) None else Some(sys.error("ignore"))
+    if (ind < 0) None else Some(sys.error("ignore"))
   }
 
   /**

tests/untried/pos/spec-sparsearray-old.scala

@@ -3,7 +3,7 @@ import scala.collection.mutable.MapLike
 class SparseArray[@specialized(Int) T:ClassManifest] extends collection.mutable.Map[Int,T] with collection.mutable.MapLike[Int,T,SparseArray[T]] {
   override def get(x: Int) = {
     val ind = findOffset(x)
-    if(ind < 0) None else Some(sys.error("ignore"))
+    if (ind < 0) None else Some(sys.error("ignore"))
   }
 
   /**

tests/untried/pos/sudoku.scala

@@ -17,7 +17,7 @@ object SudokuSolver extends App {
   // Looping over a half-closed range of consecutive integers [l..u)
   // is factored out into a higher-order function
   def fold(f: (Int, Int) => Int, accu: Int, l: Int, u: Int): Int =
-    if(l==u) accu else fold(f, f(accu, l), l + 1, u)
+    if (l==u) accu else fold(f, f(accu, l), l + 1, u)
 
   // The search function examines each position on the board in turn,
   // trying the numbers 1..9 in each unfilled position

tests/untried/pos/t262.scala

@@ -3,7 +3,7 @@ object O {
     def f:A;
   }
   class B extends A {
-    def f = if(1 == 2) new C else new D;
+    def f = if (1 == 2) new C else new D;
   }
   class C extends A {
     def f = this;

tests/untried/pos/t3670.scala

@@ -25,15 +25,15 @@ class B {
 
 class C {
   val things = List("things")
-  if(things.size < 100) {
+  if (things.size < 100) {
     lazy val msg = "foo"
     msg
   }
 }
 
 class D {
   val things = List("things")
-  if(things.size < 100) {
+  if (things.size < 100) {
     if (things.size > 10) {
       lazy val msg = "foo"
       msg

tests/untried/pos/unapplyComplex.scala

@@ -12,14 +12,14 @@ class ComplexPolar(val _1: Double, val _2: Double) extends Complex {
 
 object ComplexRect {
   def unapply(z:Complex): Option[Complex] = {
-    if(z.isInstanceOf[ComplexRect]) Some(z) else z match {
+    if (z.isInstanceOf[ComplexRect]) Some(z) else z match {
       case ComplexPolar(mod, arg) =>
     Some(new ComplexRect(mod*math.cos(arg), mod*math.sin(arg)))
 } } }
 
 object ComplexPolar {
   def unapply(z:Complex): Option[Complex] = {
-    if(z.isInstanceOf[ComplexPolar]) Some(z) else z match {
+    if (z.isInstanceOf[ComplexPolar]) Some(z) else z match {
       case ComplexRect(re,im) =>
     Some(new ComplexPolar(math.sqrt(re*re + im*im), math.atan(re/im)))
 } } }