Improve performance for transitive dependency checks #1381
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
TransitiveDependencyCondition
internally callscontains()
recursively on the collection of all objects to be tested. If this collection is a large list and there are enough recursive calls togetDirectDependencyTargetsOutsideOfAnalyzedClasses()
this results in a heavy performance impact. On a reasonable large project a single test using that condition may take minutes to complete.Here is a 30 seconds FlameGraph taken while an transitive check was running for > 2 minutes:
Based on the samples, the CPU hangs in this filter lamdba for > 86% of the time:
So, converting the given list to a Set with much better
contains()
performance fixes this issue.