Re: Another little bug in pkg-order
Hi,
No, I did not see far enough to give a public access to the
results internals -- Your double for loops are currently the nly way
to do this. I can make it a public function, though. (gotta think up
a good name).
I think we can use the flags on installed packages to solve
the ABC problem we have. If a package is marked to be removed, and is
conflict-and-replaced by another package, all other packages that
conflict with it should be installed after the replacement package
(in other words, an implicit temporary depedency exists). So, any
conflict and replace statement in the candidates list should trigger
a notation of the installed list. Whew.
I've been working on the depth first transversal of the graph
for sorting, but your algorithm is quite interesting. I think I'll
try it out and see about speed. Thanks.
manoj
--
Seen on the wall in a New York subway station: "There are no integers
n > 2 and x, y, z > 0, such that x^n + y^n = z^n I have found a truly
wonderful proof of this. Unfortunately, my train is coming.
Manoj Srivastava <srivasta@acm.org> <http://www.datasync.com/%7Esrivasta/>
Key C7261095 fingerprint = CB D9 F4 12 68 07 E4 05 CC 2D 27 12 1D F5 E8 6E
Reply to: