Replace old wildcard syntax

Author: xuwei-k

library/src/scala/Array.scala

@@ -190,7 +190,7 @@ object Array {
   def apply[T: ClassTag](xs: T*): Array[T] = {
     val len = xs.length
     xs match {
-      case wa: immutable.ArraySeq[_] if wa.unsafeArray.getClass.getComponentType == classTag[T].runtimeClass =>
+      case wa: immutable.ArraySeq[?] if wa.unsafeArray.getClass.getComponentType == classTag[T].runtimeClass =>
         // We get here in test/files/run/sd760a.scala, `Array[T](t)` for
         // a specialized type parameter `T`. While we still pay for two
         // copies of the array it is better than before when we also boxed

library/src/scala/NamedTuple.scala

@@ -223,8 +223,8 @@ object NamedTupleDecomposition:
 
   /** The names of a named tuple, represented as a tuple of literal string values. */
   type Names[X <: AnyNamedTuple] <: Tuple = X match
-    case NamedTuple[n, _] => n
+    case NamedTuple[n, ?] => n
 
   /** The value types of a named tuple represented as a regular tuple. */
   type DropNames[NT <: AnyNamedTuple] <: Tuple = NT match
-    case NamedTuple[_, x] => x
+    case NamedTuple[?, x] => x

library/src/scala/collection/ArrayOps.scala

@@ -994,10 +994,10 @@ final class ArrayOps[A](private val xs: Array[A]) extends AnyVal {
     var i = 0
     while(i < len) {
       xs(i) match {
-        case it: IterableOnce[_] =>
+        case it: IterableOnce[?] =>
           val k = it.knownSize
           if(k > 0) size += k
-        case a: Array[_] => size += a.length
+        case a: Array[?] => size += a.length
         case _ =>
       }
       i += 1

library/src/scala/collection/IndexedSeq.scala

@@ -104,7 +104,7 @@ transparent trait IndexedSeqOps[+A, +CC[_], +C] extends Any with SeqOps[A, CC, C
     if (!isEmpty) apply(0)
     else throw new NoSuchElementException(s"head of empty ${
       self match {
-        case self: IndexedSeq[_] => self.collectionClassName
+        case self: IndexedSeq[?] => self.collectionClassName
         case _ => toString
       }
     }")
@@ -115,7 +115,7 @@ transparent trait IndexedSeqOps[+A, +CC[_], +C] extends Any with SeqOps[A, CC, C
     if (!isEmpty) apply(length - 1)
     else throw new NoSuchElementException(s"last of empty ${
       self match {
-        case self: IndexedSeq[_] => self.collectionClassName
+        case self: IndexedSeq[?] => self.collectionClassName
         case _ => toString
       }
     }")

library/src/scala/collection/Iterable.scala

@@ -1022,7 +1022,7 @@ trait MapFactoryDefaults[K, +V,
   override protected def newSpecificBuilder: mutable.Builder[(K, V @uncheckedVariance), CC[K, V @uncheckedVariance]] = mapFactory.newBuilder[K, V]
   override def empty: CC[K, V @uncheckedVariance] = (this: AnyRef) match {
     // Implemented here instead of in TreeSeqMap since overriding empty in TreeSeqMap is not forwards compatible (should be moved)
-    case self: immutable.TreeSeqMap[_, _] => immutable.TreeSeqMap.empty(self.orderedBy).asInstanceOf[CC[K, V]]
+    case self: immutable.TreeSeqMap[?, ?] => immutable.TreeSeqMap.empty(self.orderedBy).asInstanceOf[CC[K, V]]
     case _ => mapFactory.empty
   }
 

library/src/scala/collection/LinearSeq.scala

@@ -104,7 +104,7 @@ transparent trait LinearSeqOps[+A, +CC[X] <: LinearSeq[X], +C <: LinearSeq[A] &
 
     if (thatKnownSize >= 0) this lengthCompare thatKnownSize
     else that match {
-      case that: LinearSeq[_] =>
+      case that: LinearSeq[?] =>
         var thisSeq = this
         var thatSeq = that
         while (thisSeq.nonEmpty && thatSeq.nonEmpty) {

library/src/scala/collection/Map.scala

@@ -66,7 +66,7 @@ trait Map[K, +V]
    */
   override def equals(o: Any): Boolean =
     (this eq o.asInstanceOf[AnyRef]) || (o match {
-      case map: Map[K @unchecked, _] if map.canEqual(this) =>
+      case map: Map[K @unchecked, ?] if map.canEqual(this) =>
         (this.size == map.size) && {
           try this.forall(kv => map.getOrElse(kv._1, Map.DefaultSentinelFn()) == kv._2)
           catch { case _: ClassCastException => false } // PR #9565 / scala/bug#12228

library/src/scala/collection/Seq.scala

@@ -1073,7 +1073,7 @@ object SeqOps {
     }
     // Now we know we actually need KMP search, so do it
     else S match {
-      case xs: scala.collection.IndexedSeq[_] =>
+      case xs: scala.collection.IndexedSeq[?] =>
         // We can index into S directly; it should be adequately fast
         val Wopt = kmpOptimizeWord(W, n0, n1, forward)
         val T = kmpJumpTable(Wopt, n1-n0)

library/src/scala/collection/SortedMap.scala

@@ -33,7 +33,7 @@ trait SortedMap[K, +V]
 
   override def equals(that: Any): Boolean = that match {
     case _ if this eq that.asInstanceOf[AnyRef] => true
-    case sm: SortedMap[K @unchecked, _] if sm.ordering == this.ordering =>
+    case sm: SortedMap[K @unchecked, ?] if sm.ordering == this.ordering =>
       (sm canEqual this) &&
         (this.size == sm.size) && {
         val i1 = this.iterator

library/src/scala/collection/concurrent/TrieMap.scala

@@ -55,10 +55,10 @@ private[collection] final class INode[K, V](bn: MainNode[K, V] | Null, g: Gen, e
     prev match {
       case null =>
         m
-      case fn: FailedNode[_, _] => // try to commit to previous value
+      case fn: FailedNode[?, ?] => // try to commit to previous value
         if (CAS(m, fn.prev)) fn.prev
         else GCAS_Complete(/*READ*/mainnode, ct)
-      case vn: MainNode[_, _] =>
+      case vn: MainNode[?, ?] =>
         // Assume that you've read the root from the generation G.
         // Assume that the snapshot algorithm is correct.
         // ==> you can only reach nodes in generations <= G.
@@ -284,7 +284,7 @@ private[collection] final class INode[K, V](bn: MainNode[K, V] | Null, g: Gen, e
             case basicNode => throw new MatchError(basicNode)
           }
         }
-      case tn: TNode[_, _] => // 3) non-live node
+      case tn: TNode[?, ?] => // 3) non-live node
         def cleanReadOnly(tn: TNode[K, V]) = if (ct.nonReadOnly) {
           clean(parent.nn, ct, lev - 5)
           RESTART
@@ -412,9 +412,9 @@ private[collection] final class INode[K, V](bn: MainNode[K, V] | Null, g: Gen, e
   /* this is a quiescent method! */
   def string(lev: Int): String = "%sINode -> %s".format("  " * lev, mainnode match {
     case null => "<null>"
-    case tn: TNode[_, _] => "TNode(%s, %s, %d, !)".format(tn.k, tn.v, tn.hc)
-    case cn: CNode[_, _] => cn.string(lev)
-    case ln: LNode[_, _] => ln.string(lev)
+    case tn: TNode[?, ?] => "TNode(%s, %s, %d, !)".format(tn.k, tn.v, tn.hc)
+    case cn: CNode[?, ?] => cn.string(lev)
+    case ln: LNode[?, ?] => ln.string(lev)
     case x => "<elem: %s>".format(x)
   })
 
@@ -549,7 +549,7 @@ private[collection] final class CNode[K, V](val bitmap: Int, val array: Array[Ba
     while (i < array.length) {
       val pos = (i + offset) % array.length
       array(pos) match {
-        case sn: SNode[_, _]     => sz += 1
+        case sn: SNode[?, ?]     => sz += 1
         case in: INode[K, V] @uc => sz += in.cachedSize(ct)
         case basicNode           => throw new MatchError(basicNode)
       }
@@ -604,7 +604,7 @@ private[collection] final class CNode[K, V](val bitmap: Int, val array: Array[Ba
   }
 
   private def resurrect(inode: INode[K, V], inodemain: AnyRef): BasicNode = inodemain match {
-    case tn: TNode[_, _] => tn.copyUntombed
+    case tn: TNode[?, ?] => tn.copyUntombed
     case _ => inode
   }