don't use 'it'.

Author: autonomousapps

src/main/kotlin/com/autonomousapps/internal/Bundles.kt

@@ -7,8 +7,8 @@ import com.autonomousapps.graph.Graphs.children
 import com.autonomousapps.graph.Graphs.reachableNodes
 import com.autonomousapps.model.*
 import com.autonomousapps.model.Coordinates.Companion.copy
-import com.autonomousapps.model.internal.declaration.Bucket
 import com.autonomousapps.model.internal.DependencyGraphView
+import com.autonomousapps.model.internal.declaration.Bucket
 import com.autonomousapps.model.internal.intermediates.Usage
 
 /**
@@ -89,54 +89,53 @@ internal class Bundles private constructor(private val dependencyUsages: Map<Coo
       bundleRules.primaries.forEach { (name, primaryId) ->
         val regexes = bundleRules.rules[name]!!
         dependencyGraph.values.forEach { view ->
-          val projectNode = view.graph.nodes().find { it.identifier == projectPath }!!
+          val projectNode = view.graph.nodes().find { node -> node.identifier == projectPath }!!
           view.graph.reachableNodes(projectNode)
             .find { child -> child.matches(primaryId) }
             ?.let { primaryNode ->
               val subordinateNodes = view.graph.reachableNodes(primaryNode)
-              subordinateNodes.filter { subordinateNode ->
-                regexes.any { subordinateNode.matches(it) }
-              }.forEach { subordinateNode ->
-                bundles.setPrimary(primaryNode, subordinateNode)
-              }
+              subordinateNodes
+                .filter { subordinateNode ->
+                  regexes.any { regex -> subordinateNode.matches(regex) }
+                }
+                .forEach { subordinateNode -> bundles.setPrimary(primaryNode, subordinateNode) }
             }
         }
       }
 
       // Handle bundles that don't have a primary entry point
       dependencyGraph.values.forEach { view ->
         // Find the node that represents the current project, which always exists in the graph
-        val projectNode = view.graph.nodes().find { it.identifier == projectPath }!!
+        val projectNode = view.graph.nodes().find { node -> node.identifier == projectPath }!!
         view.graph.children(projectNode).forEach { parentNode ->
           val rules = bundleRules.matchingBundles(parentNode)
 
           // handle user-supplied bundles
           if (rules.isNotEmpty()) {
             val reachableNodes = view.graph.reachableNodes(parentNode)
-            rules.values.forEach { regexes ->
-              reachableNodes.filter { childNode ->
-                regexes.any { childNode.matches(it) }
-              }.forEach { childNode ->
-                bundles[parentNode] = childNode
+            rules.values
+              .forEach { regexes ->
+                reachableNodes
+                  .filter { childNode -> regexes.any { regex -> childNode.matches(regex) } }
+                  .forEach { childNode -> bundles[parentNode] = childNode }
               }
-            }
           }
 
           // handle dynamic ktx bundles
           if (ignoreKtx) {
             if (parentNode.identifier.endsWith("-ktx")) {
               val baseId = parentNode.identifier.substringBeforeLast("-ktx")
-              view.graph.children(parentNode).find { child ->
-                child.matches(baseId)
-              }?.let { bundles[parentNode] = it }
+              view.graph.children(parentNode)
+                .find { child -> child.matches(baseId) }
+                ?.let { child -> bundles[parentNode] = child }
             }
           }
 
           fun implicitKmpBundleFor(target: String) {
             val candidate = "${parentNode.identifier}-${target}"
             view.graph.children(parentNode)
-              .find { it.matches(candidate) }
-              ?.let { bundles[parentNode] = it }
+              .find { child -> child.matches(candidate) }
+              ?.let { child -> bundles[parentNode] = child }
           }
 
           // Implicit KMP bundles for JVM and Android (inverse form compared to ktx)
@@ -152,7 +151,7 @@ internal class Bundles private constructor(private val dependencyUsages: Map<Coo
               val kmpIdentifier = candidate.identifier.substringBeforeLast(suffix)
               val kmp = candidate.copy(
                 kmpIdentifier,
-                GradleVariantIdentification(setOf(kmpIdentifier), candidate.gradleVariantIdentification.attributes)
+                GradleVariantIdentification(setOf(kmpIdentifier), candidate.gradleVariantIdentification.attributes),
               )
               if (view.graph.hasEdgeConnecting(kmp, candidate)) {
                 kmp to candidate