Wolfgang Jeltsch pushed to branch wip/jeltsch/module-graph-reuse-in-downsweep at Glasgow Haskell Compiler / GHC
Commits:
-
852e5d7e
by Wolfgang Jeltsch at 2026-05-27T18:17:46+03:00
1 changed file:
Changes:
| ... | ... | @@ -90,6 +90,7 @@ main = do |
| 90 | 90 | liftIO $ outputModuleNamesInGraph moduleGraph1
|
| 91 | 91 | |
| 92 | 92 | -- Turn 2: From scratch, using 'X' as root
|
| 93 | + -- NOTE: 'A' is not included, because it is not reachable.
|
|
| 93 | 94 | moduleGraph2 <- performDownsweepTurn Nothing "X"
|
| 94 | 95 | liftIO $ outputModuleNamesInGraph moduleGraph2
|
| 95 | 96 | |
| ... | ... | @@ -99,5 +100,6 @@ main = do |
| 99 | 100 | ["A", "B", "C", "D"]
|
| 100 | 101 | |
| 101 | 102 | -- Turn 3: Based on the result of turn 1, using 'X' as root
|
| 103 | + -- NOTE: 'A' is included, because the result of turn 1 contains it.
|
|
| 102 | 104 | moduleGraph3 <- performDownsweepTurn (Just moduleGraph1) "X"
|
| 103 | 105 | liftIO $ outputModuleNamesInGraph moduleGraph3 |