You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
We currently optionally depend on JGraphT to topologically sort application modules regarding their dependencies to allow iterating over the modules according to their dependency structure. We only need parts of the functionality and — at 1.3 MB size — it adds quite a bit of weight to the runtime footprint. At the same time, it's suboptimal that we have to rely on an optional library to make sure functionality depending on the dependency arrangement induced order works as expected.
We should find a more lightweight alternative or implement the ordering algorithm ourselves.
The text was updated successfully, but these errors were encountered:
We now implement the topological sorting of application modules ourselves. Properly recalculate module order after ApplicationModules recreation with shared modules. Make iterator resilient against premature invocation by falling back to the unordered modules.
Cleanup of generated type ignorance.
We currently optionally depend on JGraphT to topologically sort application modules regarding their dependencies to allow iterating over the modules according to their dependency structure. We only need parts of the functionality and — at 1.3 MB size — it adds quite a bit of weight to the runtime footprint. At the same time, it's suboptimal that we have to rely on an optional library to make sure functionality depending on the dependency arrangement induced order works as expected.
We should find a more lightweight alternative or implement the ordering algorithm ourselves.
The text was updated successfully, but these errors were encountered: