to either show a full dependency tree of a package or find the closest link bet

Happy to hear! This is an improved version by <code class="notransla

prototype: <div class="snippet-clipboard-content notranslate position-relative ove

xdeptree: List dependencies of package (or find closest link) about xtools HOT 6 OPEN

Anachron commented on August 16, 2024

xdeptree: List dependencies of package (or find closest link)

from xtools.

Comments (6)

Anachron commented on August 16, 2024

Comment:
This is to be used in combination with xbps-query --fulldeptree -Rx <pkgname>.

Now, you don't need to wonder any longer what the dependency chain is! ;-)

from xtools.

leahneukirchen commented on August 16, 2024

I think the tool is useful, not sure about the implementation however.

Perhaps the output of xbps-dgraph -f is more suitable to work on, perhaps even with gvpr(1).

from xtools.

Anachron commented on August 16, 2024

Happy to hear!

This is an improved version by feranur:

#!/bin/sh
set -eu

tmp="`mktemp -d`"
trap 'rm -rf "$tmp"' EXIT
trap 'exit 98' INT TERM HUP ALRM PIPE QUIT # ensure the EXIT trap is triggered on signals

tree="${tmp}/tree"
store="${tmp}/store"

test $# -ge 1
mkdir "${tree}" "${store}"
cd "${tree}"

handle() {
    deps=$(xbps-query -Rx "${1}")
    for d in ${deps:-} ; do
        d=$(xbps-uhelper getpkgdepname "${d}" || xbps-uhelper getpkgname "$d")
        test -n "${d:-}" || exit 99
        if ! test -e "${store}/${d}"; then
            mkdir "${d}"
            ln -s "${PWD}/${d}" "${store}/${d}"
            ( cd "${d}"; handle "${d}"; )
        else
            ln -s "${store}/${d}" "${d}"
        fi
    done
}

handle "${1}"
if test -n "${2:-}" ; then
    find . -name "${2}" -printf '%d %P\n' | sort -n | sed -E 's/^[0-9]+ //'
else
    find . -mindepth 1 -printf '%P\n' | sort
fi

from xtools.

leahneukirchen commented on August 16, 2024

prototype:

xbps-dgraph mesa -f | gvpr '
  BEGIN {
    node_t stack[int];
    int depth = 0;

    void traverse(node_t n, edge_t e) {
      stack[depth++] = n;

      if (n.label == "ncurses-libs-6.4_2") {
        int i;
        for (i = 0; i < depth; i++) {
          printf("%s", stack[i].label);
          if (i < depth-1)
            printf(" -> ");
        }
        printf("\n");
      }

      e = fstout(n);
      while (e != NULL) {
        traverse(e.head, NULL);
        if (e == NULL)
          break;
        e = nxtout(e);
      }

      depth--;
    }
  }
  BEG_G {
    traverse(node($,"31"), NULL);
  }
'

from xtools.

Anachron commented on August 16, 2024

Nice, that one is quite fast.

If you could now manage to show all dependencies in a tree I guess we can use that one instead of mine.

from xtools.

leahneukirchen commented on August 16, 2024

Here is one with one or two arguments: https://l2.re/gmGaDF

from xtools.

Recommend Projects