-
Notifications
You must be signed in to change notification settings - Fork 51
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Store dependency distances on DependencyDescriptors #172
Conversation
Codecov Report
@@ Coverage Diff @@
## master #172 +/- ##
==========================================
+ Coverage 77.94% 77.98% +0.03%
==========================================
Files 53 53
Lines 3034 3039 +5
Branches 507 507
==========================================
+ Hits 2365 2370 +5
Misses 641 641
Partials 28 28
Continue to review full report at Codecov.
|
Hold off on this - I need to work out an issue. |
Okay, I worked out the kinks. The other two PRs should be reviewed before this one. |
The distance measures the smallest number of steps that each recursive dependency is from the package.
With the patch looking almost ready I was wondering about if it is a good idea to calculate the |
I'm open to other approaches. This solution should only be adding to the size of the descriptors - it shouldn't be increasing the computational complexity of the topographical ordering algorithm. I changed the algorithm to work in "layers", but it should still be doing the same amount of work. |
I looked into moving the depth logic into |
Store dependency distances on
DependencyDescriptor
sThe distance measures the smallest number of steps that each recursive dependency is from the package.
Depends on #173
Depends on #174