X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=src%2FMain.hs;h=4467d174b94fa4d31d7273c47d9ef7afcdc5aa90;hb=68b7d1002448a896236050caceb4f38463b996f4;hp=8376ce954ff9f840d2b88f11b65a2393a283cd5f;hpb=89b8b6e94fcc944a1f4611811265f3c6217af850;p=spline3.git

diff --git a/src/Main.hs b/src/Main.hs
index 8376ce9..4467d17 100644
--- a/src/Main.hs
+++ b/src/Main.hs
@@ -54,51 +54,37 @@ find_point_value p = poly p
       g0 = make_grid 1 trilinear
       the_cubes = flatten (cubes g0)
       good_cubes = filter ((flip contains_point) p) the_cubes
-      target_cube = good_cubes !! 0
+      target_cube = head good_cubes
       good_tets = filter ((flip contains_point) p) (tetrahedrons target_cube)
-      target_tetrahedron = good_tets !! 0
+      target_tetrahedron = head good_tets
       poly = polynomial target_tetrahedron
 
 main :: IO ()
 main = do
-  putStrLn $ show $ find_point_value (0,0,0)
-  putStrLn $ show $ find_point_value (1,0,0)
-  putStrLn $ show $ find_point_value (2,0,0)
-  putStrLn $ show $ find_point_value (0,1,0)
-  putStrLn $ show $ find_point_value (1,1,0)
-  putStrLn $ show $ find_point_value (2,1,0)
-  putStrLn $ show $ find_point_value (0,2,0)
-  putStrLn $ show $ find_point_value (1,2,0)
-  putStrLn $ show $ find_point_value (2,2,0)
-  putStrLn $ show $ find_point_value (0,0,1)
-  putStrLn $ show $ find_point_value (1,0,1)
-  putStrLn $ show $ find_point_value (2,0,1)
-  putStrLn $ show $ find_point_value (0,1,1)
-  putStrLn $ show $ find_point_value (1,1,1)
-  putStrLn $ show $ find_point_value (2,1,1)
-  putStrLn $ show $ find_point_value (0,2,1)
-  putStrLn $ show $ find_point_value (1,2,1)
-  putStrLn $ show $ find_point_value (2,2,1)
-  putStrLn $ show $ find_point_value (0,0,2)
-  putStrLn $ show $ find_point_value (1,0,2)
-  putStrLn $ show $ find_point_value (2,0,2)
-  putStrLn $ show $ find_point_value (0,1,2)
-  putStrLn $ show $ find_point_value (1,1,2)
-  putStrLn $ show $ find_point_value (2,1,2)
-  putStrLn $ show $ find_point_value (0,2,2)
-  putStrLn $ show $ find_point_value (1,2,2)
-  putStrLn $ show $ find_point_value (2,2,2)
-  -- let g0 = make_grid 1 trilinear
-  -- let the_cubes = flatten (cubes g0)
-  -- putStrLn $ show $ the_cubes
-  -- let p = (2, 0, 0)
-  -- let target_cubes = filter ((flip contains_point) p) the_cubes
-  -- putStrLn $ show $ target_cubes
-  -- let target_cube = (take 1 target_cubes) !! 0
-  -- putStrLn $ show $ target_cube
-  -- let target_tetrahedra = filter ((flip contains_point) p) (tetrahedrons target_cube)
-  -- let target_tetrahedron = (take 1 target_tetrahedra) !! 0
-  -- putStrLn $ show $ target_tetrahedron
-  -- let poly = polynomial target_tetrahedron
-  -- putStrLn $ show $ poly
-  -- putStrLn $ show $ poly p
+  print $ find_point_value (0,0,0)
+  print $ find_point_value (1,0,0)
+  print $ find_point_value (2,0,0)
+  print $ find_point_value (0,1,0)
+  print $ find_point_value (1,1,0)
+  print $ find_point_value (2,1,0)
+  print $ find_point_value (0,2,0)
+  print $ find_point_value (1,2,0)
+  print $ find_point_value (2,2,0)
+  print $ find_point_value (0,0,1)
+  print $ find_point_value (1,0,1)
+  print $ find_point_value (2,0,1)
+  print $ find_point_value (0,1,1)
+  print $ find_point_value (1,1,1)
+  print $ find_point_value (2,1,1)
+  print $ find_point_value (0,2,1)
+  print $ find_point_value (1,2,1)
+  print $ find_point_value (2,2,1)
+  print $ find_point_value (0,0,2)
+  print $ find_point_value (1,0,2)
+  print $ find_point_value (2,0,2)
+  print $ find_point_value (0,1,2)
+  print $ find_point_value (1,1,2)
+  print $ find_point_value (2,1,2)
+  print $ find_point_value (0,2,2)
+  print $ find_point_value (1,2,2)
+  print $ find_point_value (2,2,2)