summaryrefslogtreecommitdiff
path: root/.dockerignore
diff options
context:
space:
mode:
authorHarmen Stoppels <harmenstoppels@gmail.com>2022-11-22 03:33:35 +0100
committerGitHub <noreply@github.com>2022-11-21 18:33:35 -0800
commit44c22a54c97b5f7c3569ff0b4b394825cbfd7a13 (patch)
tree5de4d418fcf8ffa732cc290d10a2ae791d49cc05 /.dockerignore
parentf97f37550ae371e59c0f0098540f1d21cb9097cb (diff)
downloadspack-44c22a54c97b5f7c3569ff0b4b394825cbfd7a13.tar.gz
spack-44c22a54c97b5f7c3569ff0b4b394825cbfd7a13.tar.bz2
spack-44c22a54c97b5f7c3569ff0b4b394825cbfd7a13.tar.xz
spack-44c22a54c97b5f7c3569ff0b4b394825cbfd7a13.zip
Spec traversal: add option for topological ordering (#33817)
Spec traversals can now specify a topological ordering. A topologically- ordered traversal with input specs X1, X2... will * include all of X1, X2... and their children * be ordered such that a given node is guaranteed to appear before any of its children in the traversal Other notes: * Input specs can be children of other input specs (this is useful if a user specifies a set of specs to uninstall: some of those specs might be children of others) * `direction="parents"` will produce a reversed topological order (children always come before parents). * `cover="edges"` will generate a list of edges L such that (a) input edges will always appear before output edges and (b) if you create a list with the destination of each edge in L the result is topologically ordered
Diffstat (limited to '.dockerignore')
0 files changed, 0 insertions, 0 deletions