| 1 |
On Wed, 12 Aug 2015 21:22:48 +0200 |
| 2 |
Alexis Ballier <aballier@g.o> wrote: |
| 3 |
> On Wed, 12 Aug 2015 19:25:37 +0100 |
| 4 |
> Ciaran McCreesh <ciaran.mccreesh@××××××××××.com> wrote: |
| 5 |
> > On Wed, 12 Aug 2015 20:19:08 +0200 |
| 6 |
> > Alexis Ballier <aballier@g.o> wrote: |
| 7 |
> > > pkg_pretend still needs to be executed to guess what useflags are |
| 8 |
> > > enabled or not, which information is needed before dependency |
| 9 |
> > > calculation |
| 10 |
> > |
| 11 |
> > You'd probably be implementing this in a "SAT modulo theories" kind |
| 12 |
> > of way: find a solution, do the pkg_pretend checks, and if it fails |
| 13 |
> > spit a nogood back into the resolver. |
| 14 |
> > |
| 15 |
> > But this entire discussion is pointless, since Portage doesn't and |
| 16 |
> > won't auto-resolve this stuff. |
| 17 |
> |
| 18 |
> considering its speed (at least for portage) and the complexity of the |
| 19 |
> thing, running the dep solver N times, where N is probably unbounded |
| 20 |
> doesn't seem benefical at all |
| 21 |
> |
| 22 |
> esp. since a modified REQUIRED_USE can achieve the same |
| 23 |
|
| 24 |
But you'd be running it N times to fix a REQUIRED_USE problem anyway. |
| 25 |
|
| 26 |
-- |
| 27 |
Ciaran McCreesh |
Archives