X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=src%2FGrid.hs;h=e45a0f4380946f281533f27dcc9745ac8f3e4ce9;hb=8b5168ee28e4fd1d5958eabeb00fa6ee06bbfe3b;hp=3ca66ca7ddbde546bec6080b55637306b5232e8f;hpb=7b713190502394ad4b23a14f77430ffeebd000d1;p=spline3.git

diff --git a/src/Grid.hs b/src/Grid.hs
index 3ca66ca..e45a0f4 100644
--- a/src/Grid.hs
+++ b/src/Grid.hs
@@ -29,9 +29,8 @@ empty_grid :: Grid
 empty_grid = Grid 1 [[[]]]
 
 
-
--- This is how we do a 'for' loop in Haskell.
--- No, seriously.
+-- | Returns a three-dimensional list of cubes centered on the grid
+--   points of g with the appropriate 'FunctionValues'.
 cubes :: Grid -> [[[Cube]]]
 cubes g
     | fvs == [[[]]] = [[[]]]
@@ -43,13 +42,13 @@ cubes g
     where
       fvs = function_values g
       zsize = (length fvs) - 1
-      ysize = (length $ head fvs) - 1
-      xsize = (length $ head $ head fvs) - 1
+      ysize = length (head fvs) - 1
+      xsize = length (head $ head fvs) - 1
 
 
 -- | Takes a grid and a position as an argument and returns the cube
 --   centered on that position. If there is no cube there (i.e. the
---   position is outside of the grid), it will return Nothing.
+--   position is outside of the grid), it will return 'Nothing'.
 cube_at :: Grid -> Int -> Int -> Int -> Maybe Cube
 cube_at g i j k
     | i < 0 = Nothing