chore: fix typo in the DependencyGraph implementation

dzikoysk · Jul 27, 2024 · 22dbb9b · 22dbb9b
1 parent 0d19abc
commit 22dbb9b
Showing 1 changed file with 7 additions and 7 deletions.
diff --git a/reposilite-backend/src/main/kotlin/com/reposilite/plugin/DependencyGraph.kt b/reposilite-backend/src/main/kotlin/com/reposilite/plugin/DependencyGraph.kt
@@ -40,9 +40,9 @@ fun toFlattenedDependencyGraph(declarations: Map<String, List<String>>): List<St
         val node = nodesWithNoIncomingEdges.pop()
         topologicalOrdering.add(node)
 
-        declarations[node]!!.forEach { neighbor ->
-            if (indegrees.compute(neighbor) { _, value -> (value ?: 1) - 1 } == 0) {
-                nodesWithNoIncomingEdges.push(neighbor)
+        declarations[node]!!.forEach { neighbour ->
+            if (indegrees.compute(neighbour) { _, value -> (value ?: 1) - 1 } == 0) {
+                nodesWithNoIncomingEdges.push(neighbour)
             }
         }
     }
@@ -61,10 +61,10 @@ fun toFlattenedDependencyGraph(declarations: Map<String, List<String>>): List<St
 private fun deepSearch(declarations: Map<String, List<String>>, track: Set<String>, current: String): List<String>? =
     declarations[current]!!.asSequence()
         .map { dependency ->
-            if (track.contains(dependency))
-                track.toMutableList().also { it.add(dependency) }
-            else
-                deepSearch(declarations, track.toMutableSet().also { it.add(dependency) }, dependency)
+            when {
+                track.contains(dependency) -> track.toMutableList().also { it.add(dependency) }
+                else -> deepSearch(declarations, track.toMutableSet().also { it.add(dependency) }, dependency)
+            }
         }
         .filterNotNull()
         .firstOrNull()