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
|
-- | This is the module which binds it all together
--
module Hakyll.Core.Run where
import Control.Arrow ((&&&))
import Control.Monad (msum, foldM, forM, forM_)
import qualified Data.Map as M
import Hakyll.Core.Route
import Hakyll.Core.Compiler
import Hakyll.Core.ResourceProvider
import Hakyll.Core.ResourceProvider.FileResourceProvider
import Hakyll.Core.Rules
import Hakyll.Core.Target
import Hakyll.Core.Identifier
import Hakyll.Core.DirectedGraph
import Hakyll.Core.DirectedGraph.DependencySolver
import Hakyll.Core.Writable
hakyll :: Writable a => Rules a -> IO ()
hakyll rules = do
provider <- fileResourceProvider
hakyllWith rules provider
hakyllWith :: Writable a => Rules a -> ResourceProvider -> IO ()
hakyllWith rules provider = do
let -- Get the rule set
ruleSet = runRules rules provider
-- Get all identifiers and compilers
compilers = rulesCompilers ruleSet
-- Get all targets
targets = flip map compilers $ \(id', compiler) ->
let (targ, deps) = runCompiler compiler id'
in (id', targ, deps)
-- Map mapping every identifier to it's target
targetMap = M.fromList $ map (\(i, t, _) -> (i, t)) targets
-- Create a dependency graph
graph = fromList $ map (\(i, _, d) -> (i, d)) targets
-- Solve the graph, creating a target order
ordered = solveDependencies graph
-- Join the order with the targets again
orderedTargets = map (id &&& (targetMap M.!)) ordered
-- Generate all the targets in order
map' <- foldM addTarget M.empty orderedTargets
let -- Fetch the routes
route' = rulesRoute ruleSet
forM_ (M.toList map') $ \(id', result) ->
case runRoute route' id' of
Nothing -> return ()
Just r -> do
putStrLn $ "Routing " ++ show id' ++ " to " ++ r
write r result
putStrLn "DONE."
where
addTarget map' (id', targ) = do
result <- runTarget targ id' (map' M.!) provider
putStrLn $ "Generated target: " ++ show id'
return $ M.insert id' result map'
|
