[autofix.ci] apply automated fixes

Author: autofix-ci[bot]

core/codesig/src/mill/codesig/CodeSig.scala

@@ -5,9 +5,9 @@ import mill.codesig.JvmModel.*
 object CodeSig {
 
   private def callGraphAnalysis(
-    classFiles: Seq[os.Path],
-    upstreamClasspath: Seq[os.Path],
-    ignoreCall: (Option[MethodDef], MethodSig) => Boolean
+      classFiles: Seq[os.Path],
+      upstreamClasspath: Seq[os.Path],
+      ignoreCall: (Option[MethodDef], MethodSig) => Boolean
   )(implicit st: SymbolTable): CallGraphAnalysis = {
     val localSummary = LocalSummary.apply(classFiles.iterator.map(os.read.inputStream(_)))
 
@@ -24,9 +24,9 @@ object CodeSig {
   }
 
   def getCallGraphAnalysis(
-    classFiles: Seq[os.Path],
-    upstreamClasspath: Seq[os.Path],
-    ignoreCall: (Option[MethodDef], MethodSig) => Boolean
+      classFiles: Seq[os.Path],
+      upstreamClasspath: Seq[os.Path],
+      ignoreCall: (Option[MethodDef], MethodSig) => Boolean
   ): CallGraphAnalysis = {
     implicit val st: SymbolTable = new SymbolTable()
 
@@ -41,7 +41,7 @@ object CodeSig {
       prevTransitiveCallGraphHashesOpt: () => Option[Map[String, Int]]
   ): CallGraphAnalysis = {
     implicit val st: SymbolTable = new SymbolTable()
-    
+
     val callAnalysis = callGraphAnalysis(classFiles, upstreamClasspath, ignoreCall)
 
     logger.log(callAnalysis.localSummary)

core/codesig/src/mill/codesig/ReachabilityAnalysis.scala

@@ -74,7 +74,7 @@ class CallGraphAnalysis(
     .to(SortedMap)
 
   def calculateSpanningInvalidationTree(
-    prevTransitiveCallGraphHashesOpt: => Option[Map[String, Int]]
+      prevTransitiveCallGraphHashesOpt: => Option[Map[String, Int]]
   ): Obj = {
     prevTransitiveCallGraphHashesOpt match {
       case Some(prevTransitiveCallGraphHashes) =>
@@ -89,7 +89,7 @@ class CallGraphAnalysis(
   }
 
   def calculateInvalidatedClassNames(
-    prevTransitiveCallGraphHashesOpt: => Option[Map[String, Int]]
+      prevTransitiveCallGraphHashesOpt: => Option[Map[String, Int]]
   ): Set[String] = {
     prevTransitiveCallGraphHashesOpt match {
       case Some(prevTransitiveCallGraphHashes) =>
@@ -154,7 +154,12 @@ object CallGraphAnalysis {
       indexGraphEdges: Array[Array[Int]]
   ): ujson.Obj = {
     SpanningForest.spanningTreeToJsonTree(
-      getSpanningForest(prevTransitiveCallGraphHashes, transitiveCallGraphHashes0, indexToNodes, indexGraphEdges),
+      getSpanningForest(
+        prevTransitiveCallGraphHashes,
+        transitiveCallGraphHashes0,
+        indexToNodes,
+        indexGraphEdges
+      ),
       k => indexToNodes(k).toString
     )
   }
@@ -168,12 +173,17 @@ object CallGraphAnalysis {
       indexToNodes: Array[Node],
       indexGraphEdges: Array[Array[Int]]
   ): Set[String] = {
-    val rootNode = getSpanningForest(prevTransitiveCallGraphHashes, transitiveCallGraphHashes0, indexToNodes, indexGraphEdges)
+    val rootNode = getSpanningForest(
+      prevTransitiveCallGraphHashes,
+      transitiveCallGraphHashes0,
+      indexToNodes,
+      indexGraphEdges
+    )
 
     val jsonValueQueue = mutable.ArrayDeque[(Int, SpanningForest.Node)]()
     jsonValueQueue.appendAll(rootNode.values.toSeq)
     val builder = Set.newBuilder[String]
-    
+
     while (jsonValueQueue.nonEmpty) {
       val (nodeIndex, node) = jsonValueQueue.removeHead()
       node.values.foreach { case (childIndex, childNode) =>

core/define/src/mill/define/Task.scala

@@ -124,16 +124,18 @@ object Task extends TaskBase {
   inline def Command[T](inline t: Result[T])(implicit
       inline w: W[T],
       inline ctx: mill.define.ModuleCtx
-  ): Command[T] = ${ TaskMacros.commandImpl[T]('t)('w, 'ctx, exclusive = '{ false }, persistent = '{ false }) }
-
+  ): Command[T] =
+    ${ TaskMacros.commandImpl[T]('t)('w, 'ctx, exclusive = '{ false }, persistent = '{ false }) }
 
   /**
    * This version allow [[Command]] to be persistent
    */
   inline def Command[T](inline persistent: Boolean)(inline t: Result[T])(implicit
       inline w: W[T],
       inline ctx: mill.define.ModuleCtx
-  ): Command[T] = ${ TaskMacros.commandImpl[T]('t)('w, 'ctx, exclusive = '{ false }, persistent = '{ persistent }) }
+  ): Command[T] = ${
+    TaskMacros.commandImpl[T]('t)('w, 'ctx, exclusive = '{ false }, persistent = '{ persistent })
+  }
 
   /**
    * @param exclusive Exclusive commands run serially at the end of an evaluation,
@@ -557,7 +559,15 @@ private object TaskMacros {
     appImpl[Command, T](
       (in, ev) =>
         '{
-          new Command[T]($in, $ev, $ctx, $w, ${ taskIsPrivate() }, exclusive = $exclusive, persistent = $persistent)
+          new Command[T](
+            $in,
+            $ev,
+            $ctx,
+            $w,
+            ${ taskIsPrivate() },
+            exclusive = $exclusive,
+            persistent = $persistent
+          )
         },
       t
     )

integration/feature/test-quick/resources/app/src/MyNumber.scala

@@ -5,7 +5,7 @@ import lib.*
 final case class MyNumber(val value: Int)
 
 object MyNumber {
-  
+
   given gCombinator: Combinator[MyNumber] = new Combinator[MyNumber] {
     def combine(a: MyNumber, b: MyNumber): MyNumber = MyNumber(a.value + b.value)
   }

integration/feature/test-quick/resources/app/src/MyString.scala

@@ -5,7 +5,7 @@ import lib.*
 final case class MyString(val value: String)
 
 object MyString {
-  
+
   given gCombinator: Combinator[MyString] = new Combinator[MyString] {
     def combine(a: MyString, b: MyString): MyString = MyString(a.value + b.value)
   }

integration/feature/test-quick/resources/app/test/src/MyNumberDefaultValueTests.scala

@@ -4,7 +4,7 @@ import utest.*
 import app.MyNumber
 
 object MyNumberDefaultValueTests extends TestSuite {
-  def tests = Tests { 
+  def tests = Tests {
     test("simple") {
       val result = MyNumber.defaultValue
       assert(result == MyNumber(0))

integration/feature/test-quick/src/TestQuickTests.scala

@@ -102,7 +102,10 @@ object TestQuickTests extends UtestIntegrationTestSuite {
       // Fourth run, Combinator.scala changed sematically, should run MyNumberCombinatorTests & MyStringCombinatorTests
       modifyFile(
         workspacePath / "lib" / "src" / "Combinator.scala",
-        _.replace("def combine2(a: T, b: T, c: T): T = combine(combine(a, b), c)", "def combine2(a: T, b: T, c: T): T = combine(a, combine(b, c))")
+        _.replace(
+          "def combine2(a: T, b: T, c: T): T = combine(combine(a, b), c)",
+          "def combine2(a: T, b: T, c: T): T = combine(a, combine(b, c))"
+        )
       )
       val fourthRun = eval("app.test.testQuick")
       val fourthRunOutLines = fourthRun.out.linesIterator.toSeq

runner/meta/src/mill/runner/meta/MillBuildRootModule.scala

@@ -171,7 +171,10 @@ class MillBuildRootModule()(implicit
   }
 
   @internal
-  override protected def callGraphAnalysisIgnoreCalls(callSiteOpt: Option[MethodDef], calledSig: MethodSig): Boolean = {
+  override protected def callGraphAnalysisIgnoreCalls(
+      callSiteOpt: Option[MethodDef],
+      calledSig: MethodSig
+  ): Boolean = {
     // We can ignore all calls to methods that look like Targets when traversing
     // the call graph. We can do this because we assume `def` Targets are pure,
     // and so any changes in their behavior will be picked up by the runtime build
@@ -207,7 +210,7 @@ class MillBuildRootModule()(implicit
           isSimpleTarget(callSiteSig.desc) && calledSig.name.contains("$anonfun")
         )
       }
-    
+
     // We ignore Commands for the same reason as we ignore Targets, and also because
     // their implementations get gathered up all the via the `Discover` macro, but this
     // is primarily for use as external entrypoints and shouldn't really be counted as
@@ -225,21 +228,23 @@ class MillBuildRootModule()(implicit
       calledSig.name == "millDiscover$lzyINIT1" ||
         calledSig.name == "millDiscover" ||
         callSiteOpt.exists(_.sig.name == "millDiscover")
-    
+
     (isSimpleTarget(calledSig.desc) && !isForwarderCallsiteOrLambda) || isCommand || isMillDiscover
   }
 
   def codeSignatures: T[Map[String, Int]] = Task(persistent = true) {
     os.remove.all(Task.dest / "previous")
-    if (os.exists(Task.dest / "current")) os.move.over(Task.dest / "current", Task.dest / "previous")
+    if (os.exists(Task.dest / "current"))
+      os.move.over(Task.dest / "current", Task.dest / "previous")
 
     val debugEnabled = Task.log.debugEnabled
 
     val callAnalysis = mill.codesig.CodeSig
       .compute(
         classFiles = os.walk(compile().classes.path).filter(_.ext == "class"),
         upstreamClasspath = compileClasspath().toSeq.map(_.path),
-        ignoreCall = (callSiteOpt, calledSig) => callGraphAnalysisIgnoreCalls(callSiteOpt, calledSig),
+        ignoreCall =
+          (callSiteOpt, calledSig) => callGraphAnalysisIgnoreCalls(callSiteOpt, calledSig),
         logger = new mill.codesig.Logger(
           Task.dest / "current",
           Option.when(debugEnabled)(Task.dest / "current")
@@ -251,7 +256,7 @@ class MillBuildRootModule()(implicit
             )
           )
       )
-    
+
     callAnalysis.transitiveCallGraphHashes
   }