workspaces/arborist/test/fixtures/sequental-peer-dep-tree-shuffling/README.md
raw| 1 | # sequential peer dep tree shuffling test |
| 2 | |
| 3 | Dependency graph: |
| 4 | |
| 5 | ``` |
| 6 | root -> a |
| 7 | root' -> (a, c) |
| 8 | a -> b@1 |
| 9 | c -> PEER b@2 |
| 10 | ``` |
| 11 | |
| 12 | Starting state: `root` depends only on `a`, resulting dep tree is: |
| 13 | |
| 14 | ``` |
| 15 | root |
| 16 | +-- a |
| 17 | +-- b@1 |
| 18 | ``` |
| 19 | |
| 20 | Then, root adds `c` dependency. Expect: |
| 21 | |
| 22 | ``` |
| 23 | root |
| 24 | +-- a |
| 25 | | +-- b@1 |
| 26 | +-- b@2 |
| 27 | +-- c |
| 28 | ``` |