wip Abstract away the list construction logic

Author: anatoliykmetyuk

compiler/src/dotty/tools/dotc/ast/tpd.scala

@@ -1371,5 +1371,18 @@ object tpd extends Trees.Instance[Type] with TypedTreeInfo {
    */
   def repeated(trees: List[Tree], tpt: Tree)(given ctx: Context): Tree =
     ctx.typeAssigner.arrayToRepeated(JavaSeqLiteral(trees, tpt))
-}
 
+  /** Create a tree representing a list containing all
+   *  the elements of the argument list. A "list of tree to
+   *  tree of list" conversion.
+   *
+   *  @param trees  the elements the list represented by
+   *                the resulting tree should contain.
+   *  @param tpe    the type of the elements of the resulting list.
+   *
+   */
+  def mkList(trees: List[Tree], tpe: Tree)(given Context): Tree =
+    ref(defn.ListModule).select(nme.apply)
+      .appliedToTypeTree(tpe)
+      .appliedToVarargs(trees, tpe)
+}

compiler/src/dotty/tools/dotc/typer/Inliner.scala

@@ -240,9 +240,7 @@ object Inliner {
     private def packErrors(errors: List[(ErrorKind, Error)])(given Context): Tree =
       val individualErrors: List[Tree] = errors.map(packError)
       val errorTpt = ref(defn.CompiletimeTesting_ErrorClass)
-      ref(defn.ListModule).select(nme.apply)
-        .appliedToTypeTree(errorTpt)
-        .appliedToVarargs(individualErrors, errorTpt)
+      mkList(individualErrors, errorTpt)
 
     /** Expand call to scala.compiletime.testing.typeChecks */
     def typeChecks(tree: Tree)(given Context): Tree =