Me again :-/ Still working on those KF5 frameworks, which come in different tiers that correspond to the level of inter-frameworks dependencies: tier 2 frameworks can depend on tier 1 frameworks (which don't depend on other KF5 stuff), tier 3 frameworks can depend on tier 2s and/or tier 1s, and so up to tier 4 (currently). Checking the dependency tree via rdeps can become non-trivial quickly for the higher level tiers because of dependencies on non-KF5 ports that aren't very relevant during those checks.
Adding a depth limit to the rdeps algorithm should reduce the size and complexity of the dependency graph; how hard would it be to implement that? BTW, Adding a pattern filter would probably useful too, but much more complex if the graph isn't already generated completely before being printed (= you'd want to print out the full path leading to the dependency on a matching port - otherwise a simple pipe to grep would suffice). R. _______________________________________________ macports-dev mailing list [email protected] https://lists.macosforge.org/mailman/listinfo/macports-dev
