trivial

Author: conal

test/TreeTest.hs

@@ -316,7 +316,7 @@ fft_r2_dit' Zero = id
 fft_r2_dit' (Succ n) = RT.toB . P.inP (uncurry (+) &&& uncurry (-)) . P.secondP (liftA2 (*) (phasor n)) . fmap (fft_r2_dit' n) . RT.bottomSplit
 
 -- main = go "fft_r2_dit" (fft_r2_dit :: RTree N1 (Complex Int) -> RTree N1 (Complex Int))
--- main = go "fft_r2_dit" (fft_r2_dit :: RTree N2 (Complex Double) -> RTree N2 (Complex Double))
+main = go "fft_r2_dit" (fft_r2_dit :: RTree N2 (Complex Double) -> RTree N2 (Complex Double))
 -- main = go "fft_r2_dit" (fft_r2_dit :: RTree N1 (Complex PrettyDouble) -> RTree N1 (Complex PrettyDouble))
 -- main = go "fft_r2_dit" (fft_r2_dit :: RTree N2 (Complex Int) -> RTree N2 (Complex Int))
 -- main = goSep "fft_r2_dit" 1 (fft_r2_dit :: RTree N1 (Complex Int) -> RTree N1 (Complex Int))
@@ -422,7 +422,7 @@ fft_r2_dit' (Succ n) = RT.toB . P.inP (uncurry (+) &&& uncurry (-)) . P.secondP
 
 -- main = go "dot-22" ((\ ((a,b),(c,d)) -> a*c + b*d) :: ((Int,Int),(Int,Int)) -> Int)
 
--- main = go "tdot-2" (dot :: RTree N2 (Int,Int) -> Int)
+-- main = go "tdot-4" (dot :: RTree N4 (Int,Int) -> Int)
 
 -- main = go "tpdot-4" (dot'' :: RTree N4 (Pair Int) -> Int)
 
@@ -431,7 +431,7 @@ fft_r2_dit' (Succ n) = RT.toB . P.inP (uncurry (+) &&& uncurry (-)) . P.secondP
 
 -- main = go "prod1" (prod :: RTree N1 (Int,Int) -> RTree N1 Int)
 
--- main = go "dot3" (dot :: RTree N3 (Int,Int) -> Int)
+-- main = go "dot5" (dot :: RTree N5 (Int,Int) -> Int)
 
 -- main = go "squares2" (squares :: Unop (RTree N2 Int))
 
@@ -516,9 +516,7 @@ fft_r2_dit' (Succ n) = RT.toB . P.inP (uncurry (+) &&& uncurry (-)) . P.secondP
 
 -- main = go "lsums-v5" (lsums :: Vec N5 Int -> (Vec N5 Int, Int))
 
-main = go "lsums-rt2" (lsums :: RTree N2 Int -> (RTree N2 Int, Int))
-
--- main = go "foo" (0 :: Int)
+-- main = go "lsums-rt2" (lsums :: RTree N2 Int -> (RTree N2 Int, Int))
 
 -- main = go "lsums-lt2" (lsums :: LTree N2 Int -> (LTree N2 Int, Int))