[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: 01/01: scripts: refresh: Allow searching recursively.
From: |
Ludovic Courtès |
Subject: |
Re: 01/01: scripts: refresh: Allow searching recursively. |
Date: |
Tue, 08 Jan 2019 17:27:38 +0100 |
User-agent: |
Gnus/5.13 (Gnus v5.13) Emacs/26.1 (gnu/linux) |
Hi,
address@hidden skribis:
> Furthermore we could create words to describe packages with many/few
> dependencies:
>
> Package X is a heavy root with 120 upward links.
>
> We could define a scale and make our commands output it consistently:
>
> - light root <=50 upward links
> - medium root >50<=100 upward links
> - heavy root >100<=500 upward links
> - very heavy root >500<=1000 upward links
> - extremely heavy root >1000 upward links
>
> (The numbers above are just an example)
Yes, I’ve been wanting something like this, but IIRC the current (guix
graph) implementation turned out to be inefficient to compute
upward/downward rank for a large number of nodes.
Ludo’.