@@ -95,10 +95,7 @@ addNewCompilers oldCompilers newCompilers = Hakyll $ do
95 provider <- hakyllResourceProvider <$> ask
95 provider <- hakyllResourceProvider <$> ask
96 store <- hakyllStore <$> ask
96 store <- hakyllStore <$> ask
98− let -- Create a set of new compilers
99− newCompilerIdentifiers = S.fromList $ map fst newCompilers
101− -- All compilers
98+ let -- All compilers
102 compilers = oldCompilers ++ newCompilers
99 compilers = oldCompilers ++ newCompilers
104 -- Get all dependencies for the compilers
101 -- Get all dependencies for the compilers
@@ -128,7 +125,7 @@ addNewCompilers oldCompilers newCompilers = Hakyll $ do
128 -- Find obsolete items. Every item that is reachable from a modified
125 -- Find obsolete items. Every item that is reachable from a modified
129 -- item is considered obsolete. From these obsolete items, we are only
126 -- item is considered obsolete. From these obsolete items, we are only
130 -- interested in ones that are in the current subgraph.
127 -- interested in ones that are in the current subgraph.
131− obsolete = S.filter (`S.member` newCompilerIdentifiers)
128+ obsolete = S.filter (`member` currentGraph)
132 $ reachableNodes modified' $ reverse completeGraph
129 $ reachableNodes modified' $ reverse completeGraph
134 -- Solve the graph and retain only the obsolete items
131 -- Solve the graph and retain only the obsolete items