@@ -95,10 +95,7 @@ addNewCompilers oldCompilers newCompilers = Hakyll $ do
9595 provider <- hakyllResourceProvider <$> ask
9696 store <- hakyllStore <$> ask
9797
98− let -- Create a set of new compilers
99− newCompilerIdentifiers = S.fromList $ map fst newCompilers
100−
101− -- All compilers
98+ let -- All compilers
10299 compilers = oldCompilers ++ newCompilers
103100
104101 -- Get all dependencies for the compilers
@@ -128,7 +125,7 @@ addNewCompilers oldCompilers newCompilers = Hakyll $ do
128125 -- Find obsolete items. Every item that is reachable from a modified
129126 -- item is considered obsolete. From these obsolete items, we are only
130127 -- interested in ones that are in the current subgraph.
131− obsolete = S.filter (`S.member` newCompilerIdentifiers)
128+ obsolete = S.filter (`member` currentGraph)
132129 $ reachableNodes modified' $ reverse completeGraph
133130
134131 -- Solve the graph and retain only the obsolete items