| 1 |
On Tue, 27 Dec 2005 16:48:55 +0100 Paul de Vrieze <pauldv@g.o> |
| 2 |
wrote: |
| 3 |
| Well, it shouldn't be unsolvable. Choosing can be done with the |
| 4 |
| following process: |
| 5 |
|
| 6 |
Your algorithm doesn't work for cases which can be solved by up / down |
| 7 |
cycling of a version. It also doesn't work for cases where we need the |
| 8 |
dep tree today rather than some time next year. |
| 9 |
|
| 10 |
-- |
| 11 |
Ciaran McCreesh : Gentoo Developer (I can kill you with my brain) |
| 12 |
Mail : ciaranm at gentoo.org |
| 13 |
Web : http://dev.gentoo.org/~ciaranm |
Archives