X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=src%2FFunctionValues.hs;h=74e212386a77b535b42c290b5f52180f63ca207a;hb=2af8560d6b29fa9acd861f67473096e026529da3;hp=9d5232334bc5ad805f449faa3d51249644689b4e;hpb=2f1d864660ff740773ea2c36ab79a837000f6452;p=spline3.git

diff --git a/src/FunctionValues.hs b/src/FunctionValues.hs
index 9d52323..74e2123 100644
--- a/src/FunctionValues.hs
+++ b/src/FunctionValues.hs
@@ -135,6 +135,7 @@ empty_values :: FunctionValues
 empty_values =
     FunctionValues 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
 
+
 -- | The eval function is where the magic happens for the
 --   FunctionValues type. Given a 'Cardinal' direction and a
 --   'FunctionValues' object, eval will return the value of the
@@ -175,6 +176,7 @@ eval f (Difference x y) = (eval f x) - (eval f y)
 eval f (Product x y) = (eval f x) * (eval f y)
 eval f (Quotient x y) = (eval f x) / (eval f y)
 
+
 -- | Takes a three-dimensional list of 'Double' and a set of 3D
 --   coordinates (i,j,k), and returns the value at (i,j,k) in the
 --   supplied list. If there is no such value, we calculate one
@@ -195,51 +197,58 @@ eval f (Quotient x y) = (eval f x) / (eval f y)
 --   1.0
 --
 --   >>> value_at Examples.trilinear 1 3 0
---   4.0
+--   5.0
 --
 value_at :: Values3D -> Int -> Int -> Int -> Double
 value_at v3d i j k
   -- Put the most common case first!
-  | (i >= 0) && (j >= 0) && (k >= 0) =
+  | (valid_i i) && (valid_j j) && (valid_k k) =
       idx v3d i j k
 
-  -- The next three are from the first line in (7.3).
-  | (i == -1) && (j >= 0) && (k >= 0) =
-      2*(value_at v3d 0 j k) - (value_at v3d 1 j k)
-
-  | (i >= 0) && (j == -1) && (k >= 0) =
-      2*(value_at v3d i 0 k) - (value_at v3d i 1 k)
-
-  | (i >= 0) && (j >= 0) && (k == -1) =
-      2*(value_at v3d i j 0) - (value_at v3d i j 1)
-
-  -- The next two are from the second line in (7.3).
-  | (i == -1) && (j == -1) && (k >= 0) =
-      2*(value_at v3d i 0 k) - (value_at v3d i 1 k)
-
-  | (i == -1) && (j == ysize) && (k >= 0) =
-      2*(value_at v3d i (ysize - 1) k) - (value_at v3d i (ysize - 2) k)
-
-  -- The next two are from the third line in (7.3).
-  | (i == -1) && (j >= 0) && (k == -1) =
-      2*(value_at v3d i j 0) - (value_at v3d i j 1)
-
-  | (i == -1) && (j >= 0) && (k == zsize) =
-      2*(value_at v3d i j (zsize - 1)) - (value_at v3d i j (zsize - 2))
-
-  -- Repeat the above (j and k) cases for i >= 0.
-  | (i >= 0) && (j == -1) && (k == -1) =
-      2*(value_at v3d i j 0) - (value_at v3d i j 1)
-
-  | (i == xsize) && (j == -1) && (k >= 0) =
-      2*(value_at v3d (xsize - 1) j k) - (value_at v3d (xsize - 2) j k)
-
-  -- These two cases I made up.
-  | (i == -1) && (j == -1) && (k == -1) =
-      2*(value_at v3d i j 0) - (value_at v3d i j 1)
-
-  | (i == xsize) && (j == ysize) && (k == zsize) =
-      2*(value_at v3d i j (zsize - 1)) - (value_at v3d i j (zsize - 2))
+  -- The next three are from the first line in (7.3). Analogous cases
+  -- have been added where the indices are one-too-big. These are the
+  -- "one index is bad" cases.
+  | not (valid_i i) =
+      if (dim_i == 1)
+      then
+        -- We're one-dimensional in our first coordinate, so just
+        -- return the data point that we do have. If we try to use
+        -- the formula from remark 7.3, we go into an infinite loop.
+        value_at v3d 0 j k
+      else
+        if (i == -1)
+        then
+          2*(value_at v3d 0 j k) - (value_at v3d 1 j k)
+        else
+          2*(value_at v3d (i-1) j k) - (value_at v3d (i-2) j k)
+
+  | not (valid_j j) =
+      if (dim_j == 1)
+      then
+        -- We're one-dimensional in our second coordinate, so just
+        -- return the data point that we do have. If we try to use
+        -- the formula from remark 7.3, we go into an infinite loop.
+        value_at v3d i 0 k
+      else
+        if (j == -1)
+        then
+          2*(value_at v3d i 0 k) - (value_at v3d i 1 k)
+        else
+          2*(value_at v3d i (j-1) k) - (value_at v3d i (j-2) k)
+
+  | not (valid_k k) =
+      if (dim_k == 1)
+      then
+        -- We're one-dimensional in our third coordinate, so just
+        -- return the data point that we do have. If we try to use
+        -- the formula from remark 7.3, we go into an infinite loop.
+        value_at v3d i j 0
+      else
+        if (k == -1)
+        then
+          2*(value_at v3d i j 0) - (value_at v3d i j 1)
+        else
+          2*(value_at v3d i j (k-1)) - (value_at v3d i j (k-2))
 
   | otherwise =
       let istr = show i
@@ -249,7 +258,17 @@ value_at v3d i j k
       in
         error $ "value_at called outside of domain: " ++ coordstr
   where
-    (xsize, ysize, zsize) = dims v3d
+    (dim_i, dim_j, dim_k) = dims v3d
+
+    valid_i :: Int -> Bool
+    valid_i i' = (i' >= 0) && (i' < dim_i)
+
+    valid_j :: Int -> Bool
+    valid_j j' = (j' >= 0) && (j' < dim_j)
+
+    valid_k :: Int -> Bool
+    valid_k k' = (k' >= 0) && (k' < dim_k)
+
 
 
 -- | Given a three-dimensional list of 'Double' and a set of 3D