1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
|
{-# LANGUAGE LambdaCase #-}
{-# LANGUAGE TupleSections #-}
-- | Simple directed graphs, for dependency checking
module Dirgraph where
import CheckMap (MapResult (mapresultDepends))
import Control.Monad (forM_, unless)
import Data.Functor ((<&>))
import Data.Map.Strict (Map, mapMaybeWithKey, mapWithKey,
traverseMaybeWithKey, traverseWithKey)
import qualified Data.Map.Strict as M
import Data.Maybe (fromMaybe)
import Data.Set (Set, (\\))
import qualified Data.Set as S
import Paths (normalise)
import qualified System.FilePath as FP
import System.FilePath.Posix (takeDirectory, (</>))
import Text.Dot (Dot, (.->.))
import qualified Text.Dot as D
import Types (Dep (LocalMap))
import Witherable (mapMaybe)
-- | a simple directed graph
type Graph a = Map a (Set a)
nodes :: Graph a -> Set a
nodes = M.keysSet
-- | simple directed graph of exits
resultToGraph :: Map FilePath MapResult -> Graph FilePath
resultToGraph = mapWithKey (\p r -> S.fromList
. mapMaybe (onlyLocalMaps (takeDirectory p))
. mapresultDepends $ r)
where onlyLocalMaps prefix = \case
LocalMap path -> Just (FP.normalise (prefix </> normalise "" path))
_ -> Nothing
-- | invert edges of a directed graph
invertGraph :: (Eq a, Ord a) => Graph a -> Graph a
invertGraph graph = mapWithKey collectFroms graph
where collectFroms to _ = S.fromList . M.elems . mapMaybeWithKey (select to) $ graph
select to from elems = if to `elem` elems then Just from else Nothing
-- | all nodes reachable from some entrypoint
reachableFrom :: Ord a => a -> Graph a -> Set a
reachableFrom entrypoint graph = recursive mempty (S.singleton entrypoint)
where recursive seen current
| null current = seen
| otherwise = recursive (S.union seen current) (next \\ seen)
where next = S.unions
. S.fromList -- for some reason set is not filterable?
. mapMaybe (`M.lookup` graph)
. S.toList
$ current
unreachableFrom :: Ord a => a -> Graph a -> Set a
unreachableFrom entrypoint graph =
nodes graph \\ reachableFrom entrypoint graph
takeSubGraph :: (Eq a, Ord a) => Int -> a -> Graph a -> Graph a
takeSubGraph i start graph
| i <= 0 = mempty
| i == 1 =
M.singleton start reachable
`M.union` M.fromList ((,mempty) <$> S.toList reachable)
| otherwise =
M.singleton start reachable
`M.union` (M.unionsWith S.union
. S.map (flip (takeSubGraph (i-1)) graph)
$ reachable)
where reachable = fromMaybe mempty (M.lookup start graph)
graphToDot :: Graph FilePath -> Dot ()
graphToDot graph = do
main <- D.node [("label","main.json")]
nodes' <- traverseMaybeWithKey
(\name edges -> if name /= "main.json"
then D.node [("label",name)] <&> (, edges) <&> Just
else pure Nothing
)
graph
let reachable = fromMaybe mempty (M.lookup "main.json" graph)
let nodes = M.insert "main.json" (main,reachable) nodes'
forM_ nodes $ \(node, edges) ->
forM_ edges $ \key ->
case M.lookup key nodes of
Just (other,_) -> node .->. other
_ -> pure ()
|
