On Tue, 21 Aug 2007 16:25:12 -0400, Jeff Johnson wrote: > > On Aug 21, 2007, at 4:02 PM, Dan Stromberg - Datallegro wrote: > >> >> One simple fix is to have "knots" and "bows". Each loop of a bow is a >> topological sort; each knot is an inflection point that cordons off >> one >> tsort from another. >> >> So the OS would go into bow 0, and most of the time, all the other >> RPM's >> would go into bow 1. Or you could use them bows like BASIC line >> numbers - >> starting with the OS in bow 1000, allowing room for things to come in >> front and behind. >> >> Then as you compute your tsorts, you just catenate them together in >> bow >> order to get your ordered list of rpm's to install. >> > > This works for ordering, not for dependency closure. It seems to me like it should work fine. What am I missing? Granted, you could have dependencies that contradict your bow constraints... But then you could have an rpm option that says to ignore dependencies between bows. _______________________________________________ Rpm-list mailing list Rpm-list@xxxxxxxxxx https://www.redhat.com/mailman/listinfo/rpm-list
