On Tue, May 27, 2014 at 05:44:37PM +0200, Agustin Martin wrote: > On Fri, May 23, 2014 at 05:38:28PM +0200, Agustin Martin wrote: > > I have been wondering for some time if there is a simpler way to handle all > > this sorting without using explicit tsort. > > > > I have been playing for some time with a proof of concept of a perl-only > > method to handle this, and tried today to put it into emacsen-common > > lib.pl. > > I am attaching current incarnation of it, both as a plain lib.pl and as a > > git diff. I have tested in my system and it seems to work well, but consider > > it highly experimental code. > > Hi, Rob > > Noticed some problems with my previous sort function, related to > auto-vivification in deep perl hashes of hashes when deep keys are tested > and parent key does not exist. > > I think this is fixed now, so I am attaching yet another version of lib.pl. > It also uses a simpler dependencies hash and properly names function > `generate_add_on_install_list' instead of `generate_add_on_install_list_new'. > Needs further testing, but apparently works.
Hi again, Rob Seems I was too optimistic, problems persist, dpkg-dev-el goes sometimes after devscripts-el, and I am now clueless about the reason. A pity, using perl sort function would have been really clean. And also my second version missed part of the code in the first one, handling of array/hash ref from `get_installed_add_on_packages' or emacs-package-install. In parallel I am thinking about a raw iterative procedure processing the hash of dependencies. I have done some tests and seems OK, but still needs some rewrite and debugging. Will write again when I have something ready for wider testing. Regards, -- Agustin -- To UNSUBSCRIBE, email to [email protected] with a subject of "unsubscribe". Trouble? Contact [email protected]
