[SERVER-27506] Reduce library graph complexity Created: 22/Dec/16  Updated: 07/Jun/17  Resolved: 07/Jun/17

Status: Closed
Project: Core Server
Component/s: Build
Affects Version/s: None
Fix Version/s: None

Type: Task Priority: Major - P3
Reporter: Andrew Morrow (Inactive) Assignee: DO NOT USE - Backlog - Platform Team
Resolution: Won't Fix Votes: 0
Labels: None
Remaining Estimate: Not Specified
Time Spent: Not Specified
Original Estimate: Not Specified

Issue Links:
Depends
depends on SERVER-23103 Make library dependency graph acyclic Closed
Backwards Compatibility: Fully Compatible
Participants:

 Description   

Once we have made the library graph acyclic in SERVER-23103, we can use the Dagger tool to find graph reductions via splitting and combining nodes. Ideally, we would reduce the number of non-third party libraries by an order of magnitude.



 Comments   
Comment by Andrew Morrow (Inactive) [ 07/Jun/17 ]

The platforms team won't specifically be undertaking the work to simplify the library graph. Instead, it will happen organically as teams undertake their own refactorings and tackle their technical debt.

Generated at Thu Feb 08 04:15:20 UTC 2024 using Jira 9.7.1#970001-sha1:2222b88b221c4928ef0de3161136cc90c8356a66.