git.iko.soy/rowtype-yoga/purescript-native
on fa89354 help sign in
76 lines 2.5 kB history raw
1-----------------------------------------------------------------------------
2--
3-- Module : Language.PureScript.ModuleDependencies
4-- Copyright : (c) Phil Freeman 2013
5-- License : MIT
6--
7-- Maintainer : Phil Freeman <paf31@cantab.net>
8-- Stability : experimental
9-- Portability :
10--
11-- | Provides the ability to sort modules based on module dependencies
12--
13-----------------------------------------------------------------------------
15module Language.PureScript.ModuleDependencies (
16 sortModules,
17 ModuleGraph
18) where
20import Data.Graph
21import Data.List (nub)
22import Data.Maybe (mapMaybe)
24import Language.PureScript.AST
25import Language.PureScript.Names
26import Language.PureScript.Types
28-- |
29-- A list of modules with their dependencies
30--
31type ModuleGraph = [(ModuleName, [ModuleName])]
33-- |
34-- Sort a collection of modules based on module dependencies.
35--
36-- Reports an error if the module graph contains a cycle.
37--
38sortModules :: [Module] -> Either String ([Module], ModuleGraph)
39sortModules ms = do
40 let verts = map (\m@(Module _ ds _) -> (m, getModuleName m, nub (concatMap usedModules ds))) ms
41 ms' <- mapM toModule $ stronglyConnComp verts
42 let moduleGraph = map (\(_, mn, deps) -> (mn, deps)) verts
43 return (ms', moduleGraph)
45-- |
46-- Calculate a list of used modules based on explicit imports and qualified names
47--
48usedModules :: Declaration -> [ModuleName]
49usedModules = let (f, _, _, _, _) = everythingOnValues (++) forDecls forValues (const []) (const []) (const []) in nub . f
50 where
51 forDecls :: Declaration -> [ModuleName]
52 forDecls (ImportDeclaration mn _ _) = [mn]
53 forDecls _ = []
55 forValues :: Expr -> [ModuleName]
56 forValues (Var (Qualified (Just mn) _)) = [mn]
57 forValues (BinaryNoParens (Qualified (Just mn) _) _ _) = [mn]
58 forValues (Constructor (Qualified (Just mn) _)) = [mn]
59 forValues (TypedValue _ _ ty) = forTypes ty
60 forValues _ = []
62 forTypes :: Type -> [ModuleName]
63 forTypes (TypeConstructor (Qualified (Just mn) _)) = [mn]
64 forTypes (ConstrainedType cs _) = mapMaybe (\(Qualified mn _, _) -> mn) cs
65 forTypes _ = []
67getModuleName :: Module -> ModuleName
68getModuleName (Module mn _ _) = mn
70-- |
71-- Convert a strongly connected component of the module graph to a module
72--
73toModule :: SCC Module -> Either String Module
74toModule (AcyclicSCC m) = return m
75toModule (CyclicSCC [m]) = return m
76toModule (CyclicSCC ms) = Left $ "Cycle in module dependencies: " ++ show (map getModuleName ms)