[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: Speeding up “guix pull”: splitting modules

From: Gábor Boskovits
Subject: Re: Speeding up “guix pull”: splitting modules
Date: Tue, 7 Jan 2020 21:14:18 +0100


zimoun <address@hidden> ezt írta (időpont: 2020. jan. 7., K, 19:38):
> Hi Ricardo,
> On Sun, 5 Jan 2020 at 21:38, Ricardo Wurmus <address@hidden> wrote:
> > Gábor once suggested an iterative approach of identifying the most
> > important nodes in the package graph that should be moved to their own
> > modules, so that we would end up with a package graph that looks less
> > like a hair ball.  I think it would useful to get a better view on the
> > relationships between modules.
> I am not sure to correctly understand. What does it mean "the most
> important nodes in the package graph"?
> Does "important node" mean a package which appears as inputs in a lot
> of other packages?

I was suggesting the following idea:
The underlying package graph is actually a DAG, so by splitting modules it is
possible to achieve a state where the module graph also becomes a DAG.
The exact heuristic or algorithm of splitting was not defined.

One idea which is quite cloes to my heart is to make a one package per module
rewrite, with possibly some grouping modules for convenience on top, but that
was determined not to be feasible performacewise at the time.

> Cheers,
> simon

Best regards,
OpenPGP Key Fingerprint: 7988:3B9F:7D6A:4DBF:3719:0367:2506:A96C:CF63:0B21

reply via email to

[Prev in Thread] Current Thread [Next in Thread]