Gentoo has one of the most complex package dependency graphs out there (probably the most complex of any distro), and it *really* takes a while to resolve when you have 2600 packages installed and haven't updated in 3 months. I wonder if it could be mapped to a SAT solver...
-
-
In any case using an ASP solver instead of a SAT solver might be a good idea. Similar algorithms, but ASP natively handles some constraints that are almost impossible to efficiently represent as CNF. E.g. Excluding circular dependencies unless at least one of them is required.
-
(I don't have much experience with ASP or solving pkg dependencies, but I've ran into such kind of constraints, and handling them with a SAT solver at all without generating huge formulas requires at least some kind of non-trivial incremental usage.)
End of conversation
New conversation -
-
-
you can translate USE flags to fake packages (which is what opam ecosystem effectively does) though
-
oh god and then use flag constraints as conflicts... yeah, I guess that works? not so sure about subslots though... that's not a package set constraint, it's a rebuild constraint.... though maybe that can be treated as a separate postprocessing problem?
- Show replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.