chore(DependencyGraphBuilder): Slightly improve dependency comparison

Map to a set to be able to compare two sets for equality. This now
compares the sets "bidirectionally" and also returns early if
`dependencies1` does not contain all of `dependencies2.keys`.

Signed-off-by: Sebastian Schuberth <sebastian@doubleopen.org>

Author: sschuberth

model/src/main/kotlin/utils/DependencyGraphBuilder.kt

@@ -326,9 +326,9 @@ class DependencyGraphBuilder<D>(
         val dependencies = dependencyHandler.dependenciesFor(dependency)
         if (ref.dependencies.size != dependencies.size) return false
 
-        val dependencies1 = ref.dependencies.map { dependencyIds[it.pkg] }
+        val dependencies1 = ref.dependencies.mapTo(mutableSetOf()) { dependencyIds[it.pkg] }
         val dependencies2 = dependencies.associateBy { dependencyHandler.identifierFor(it) }
-        if (!dependencies2.keys.containsAll(dependencies1)) return false
+        if (dependencies1 != dependencies2.keys) return false
 
         return ref.dependencies.all { refDep ->
             dependencies2[dependencyIds[refDep.pkg]]?.let { dependencyTreeEquals(refDep, it) } == true