diff options
| author |   Michał Górny <mgorny@gentoo.org> | 2017-06-27 20:07:21 +0000 |
|---|---|---|
| committer | Michał Górny <mgorny@gentoo.org> | 2017-06-27 20:07:21 +0000 |
| commit | d67d0627ba2822be71e4276924d7afc77f09af6f (patch) | |
| tree | 4a2cb1146009f75fbc23d5bb62e692ce895b368c | |
| parent | /* QA checks to verify REQUIRED_USE solutions */ move transformation algo back (diff) | |
| download | glep-d67d0627ba2822be71e4276924d7afc77f09af6f.tar.gz glep-d67d0627ba2822be71e4276924d7afc77f09af6f.tar.bz2 glep-d67d0627ba2822be71e4276924d7afc77f09af6f.zip | |
/* Concept for transforming REQUIRED_USE into implications */ include node numbers in path list
| -rw-r--r-- | GLEP:73.mw | 10 |
1 files changed, 5 insertions, 5 deletions
@@ -152,11 +152,11 @@ Nodes and edges are numbered to explain the ordering. Furthermore, the final (ef [[File:ReqUseExampleGraph.svg|framed|Example graph for REQUIRED_USE]] Traversing this graph produces the following paths, in order: -# '''a''' -# b → c → '''d''' -# b → c → '''e''' -# b → d → '''f''' -# b → '''g''' +# '''a<sub>(1)</sub>''' +# b<sub>(2)</sub> → c<sub>(3)</sub> → '''d<sub>(4)</sub>''' +# b<sub>(2)</sub> → c<sub>(3)</sub> → '''e<sub>(5)</sub>''' +# b<sub>(2)</sub> → d<sub>(4)</sub> → '''f<sub>(6)</sub>''' +# b<sub>(2)</sub> → '''g<sub>(7)</sub>''' Those paths are equivalent to the following USE-conditional group constructs: # <code>a</code> |