On Tue, Jan 31, 2012 at 5:59 AM, Baptiste Daroussin <b...@freebsd.org>wrote:
> On Tue, Jan 31, 2012 at 11:52:05AM +0100, Michel Talon wrote: > > >having a real sat solver for the dependency tree. Currently we have a > > >really simple and minimalistic solver which works well but if we can to > go > > >to an even finer package management we would need a real solver. > > > > Please may you expand on what you really mean here? I was under the > impression > > that the only problem was to provide a total order on ports compatible > to the > > partial order fixed by dependency, and this is very easy. There is for > example one > > routine to do that in portupgrade. Or do you have something more > sophisticated in mind? > > > > I mean something more sophisticated, the simple thing having things in the > right > order is hopefuly already done in pkgng :) > > I mean more something that is able to go further like resolving some > conflicts > by changing the ordering automatically, like offerting the ability to > depends on > provides e.g. depends on http_server instead of depending on > apache/lighttpd/nginx/thehttpyouprefer or begin able to depends on > feature. An > even more. > > What we have now is really enough to be able to go into a full binary > world (and > it does really work nicely) but having a real complex sat solver, can help > us go > forward and imagine an even better package tool. > > regards, > Bapt > sat solver : http://en.wikipedia.org/wiki/ZYpp#SAT_solver_integration http://en.wikipedia.org/wiki/Boolean_satisfiability_problem http://en.wikipedia.org/wiki/Computational_complexity_theory Thank you very much . Mehmet Erol Sanliturk _______________________________________________ freebsd-questions@freebsd.org mailing list http://lists.freebsd.org/mailman/listinfo/freebsd-questions To unsubscribe, send any mail to "freebsd-questions-unsubscr...@freebsd.org"
