summaryrefslogtreecommitdiff
path: root/tests/Hakyll/Core/DependencyAnalyzer
diff options
context:
space:
mode:
authorJasper Van der Jeugt <m@jaspervdj.be>2012-11-20 11:36:45 +0100
committerJasper Van der Jeugt <m@jaspervdj.be>2012-11-20 11:36:45 +0100
commitbfa10560f87b1843f9302a70f6c9333fc2731e88 (patch)
treeebba1270dad7f601c5188c455e3d642130f0ac83 /tests/Hakyll/Core/DependencyAnalyzer
parentb1f70c339e031c1f6abf04ff63566f2cb9757a07 (diff)
downloadhakyll-bfa10560f87b1843f9302a70f6c9333fc2731e88.tar.gz
Re-enable some tests
Diffstat (limited to 'tests/Hakyll/Core/DependencyAnalyzer')
-rw-r--r--tests/Hakyll/Core/DependencyAnalyzer/Tests.hs70
1 files changed, 0 insertions, 70 deletions
diff --git a/tests/Hakyll/Core/DependencyAnalyzer/Tests.hs b/tests/Hakyll/Core/DependencyAnalyzer/Tests.hs
deleted file mode 100644
index 891fa98..0000000
--- a/tests/Hakyll/Core/DependencyAnalyzer/Tests.hs
+++ /dev/null
@@ -1,70 +0,0 @@
-module Hakyll.Core.DependencyAnalyzer.Tests where
-
-import Control.Arrow (second)
-import qualified Data.Set as S
-import Data.Monoid (mempty)
-
-import Test.Framework
-import Test.Framework.Providers.HUnit
-import Test.HUnit hiding (Test)
-
-import Hakyll.Core.DirectedGraph
-import Hakyll.Core.DependencyAnalyzer
-
-tests :: [Test]
-tests =
- [ testCase "step [1]" step1
- , testCase "step [2]" step2
- ]
-
-step1 :: Assertion
-step1 = Just (S.fromList [1, 2, 5, 6, 7, 8, 9]) @?=
- stepAll (makeDependencyAnalyzer graph isOutOfDate prev)
- where
- node = curry $ second S.fromList
-
- graph = fromList
- [ node (8 :: Int) [2, 4, 6]
- , node 2 [4, 3]
- , node 4 [3]
- , node 6 [4]
- , node 3 []
- , node 9 [5]
- , node 5 [7]
- , node 1 [7]
- , node 7 []
- ]
-
- prev = fromList
- [ node 8 [2, 4, 6]
- , node 2 [4, 3]
- , node 4 [3]
- , node 6 [4]
- , node 3 []
- , node 9 [5]
- , node 5 [7]
- , node 1 [7]
- , node 7 [8]
- ]
-
- isOutOfDate = (`elem` [5, 2, 6])
-
-step2 :: Assertion
-step2 = Nothing @?= stepAll (makeDependencyAnalyzer graph isOutOfDate mempty)
- where
- node = curry $ second S.fromList
-
- -- Cycle: 4 -> 7 -> 5 -> 9 -> 4
- graph = fromList
- [ node (1 :: Int) [6]
- , node 2 [3]
- , node 3 []
- , node 4 [1, 7, 8]
- , node 5 [9]
- , node 6 [3]
- , node 7 [5]
- , node 8 [2]
- , node 9 [4]
- ]
-
- isOutOfDate = const True