@@ -3,18 +3,16 @@ module Test.Main where
33import Prelude
44
55import Control.Comonad.Cofree (head, (:<))
6−import Control.Monad.Eff (Eff)
7−import Control.Monad.Aff.Console (log)
86import Data.List (List(Nil), (:))
97import Data.Maybe (Maybe(..), fromJust)
10−import Data.Tree (Tree, mkTree, scanTree, showTree)
8+import Data.Tree (Tree, mkTree, scanTree)
119import Data.Tree.Zipper (down, findDownWhere, findFromRoot, findUp, flattenLocDepthFirst, fromTree, insertAfter, modifyValue, next, toTree, value)
12−import Debug.Trace (spy)
10+import Effect (Effect)
1311import Partial.Unsafe (unsafePartial)
1412import Test.Spec (describe, it)
1513import Test.Spec.Assertions (shouldEqual)
1614import Test.Spec.Reporter (consoleReporter)
17−import Test.Spec.Runner (RunnerEffects, run)
15+import Test.Spec.Runner (run)
1816
1917sampleTree :: Tree Int
2018sampleTree =
@@ -30,7 +28,7 @@ sampleTree =
3028 )
3129 : Nil
3230
33−main :: forall e. Eff (RunnerEffects e) Unit
31+main :: Effect Unit
3432main = run [consoleReporter] do
3533 describe "Tree" do
3634
@@ -259,8 +257,8 @@ main = run [consoleReporter] do
259257
260258 it "Should flatten the Tree into a list of locations following a depth first pattern" do
261259 let flat = map value $ flattenLocDepthFirst $ fromTree sampleTree
262− -- log $ showTree sampleTree
263− -- log $ show flat
260+ --log $ showTree sampleTree
261+ --log $ show flat
264262 shouldEqual flat (1 : 2 : 3 : 4 : 5 : 6 : 7 : 8 : Nil)
265263
266264