import Test.Tasty ( TestTree, testGroup )
import Test.Tasty.HUnit ( Assertion, assertEqual, testCase )
import Test.Tasty.QuickCheck (
- Arbitrary(..),
+ Arbitrary( arbitrary ),
Gen,
Property,
(==>),
tetrahedron )
import Examples ( trilinear, trilinear9x9x9, zeros )
import FunctionValues ( make_values, value_at )
-import Point ( Point(..) )
+import Point ( Point(Point) )
import ScaleFactor ( ScaleFactor )
import Tetrahedron (
Tetrahedron( v0, v1, v2, v3 ),
-- values of the function at the grid points, which are distance h=1
-- from one another in each direction (x,y,z).
--
-data Grid = Grid { function_values :: Values3D }
- deriving (Show)
+newtype Grid = Grid { function_values :: Values3D }
+ deriving (Show)
instance Arbitrary Grid where
where
fvs = function_values g
fvs' = make_values fvs i j k
- tet_vol = 1/24
+ tet_vol = (1/24) :: Double
-- The first cube along any axis covers (-1/2, 1/2). The second
| otherwise = (ceiling (coord + offset)) - 1
where
(xsize, ysize, zsize) = dims (function_values g)
- offset = 1/2
+ offset = (1/2) :: Double
-- | Takes a 'Grid', and returns a 'Cube' containing the given 'Point'.
f p
where
g = Grid v3d
- offset = 1/2
+ offset = (1/2) :: Double
m' = (fromIntegral m) / (fromIntegral sfx) - offset
n' = (fromIntegral n) / (fromIntegral sfy) - offset
o' = (fromIntegral o) / (fromIntegral sfz) - offset
where
(xsize, ysize, zsize) = dims v3d
transExtent = zoom_shape scale_factor
- f = zoom_lookup v3d scale_factor
+ f = zoom_lookup v3d scale_factor :: (DIM3 -> Double) -> DIM3 -> Double
-- | Check all coefficients of tetrahedron0 belonging to the cube
c0 <- cs,
t <- tetrahedra c0,
let p = polynomial t,
- let i' = fromIntegral i,
- let j' = fromIntegral j,
- let k' = fromIntegral k]
+ let i' = fromIntegral i :: Double,
+ let j' = fromIntegral j :: Double,
+ let k' = fromIntegral k :: Double]
where
g = Grid trilinear
cs = [ cube_at g ci cj ck | ci <- [0..2], cj <- [0..2], ck <- [0..2] ]
| i <- [0..2],
j <- [0..2],
k <- [0..2],
- let i' = fromIntegral i,
- let j' = fromIntegral j,
- let k' = fromIntegral k,
+ let i' = fromIntegral i :: Double,
+ let j' = fromIntegral j :: Double,
+ let k' = fromIntegral k :: Double,
c0 <- cs,
t0 <- tetrahedra c0,
let p = polynomial t0 ]
k <- [0..8],
t <- tetrahedra c0,
let p = polynomial t,
- let i' = (fromIntegral i) * 0.5,
- let j' = (fromIntegral j) * 0.5,
- let k' = (fromIntegral k) * 0.5]
+ let i' = (fromIntegral i) * 0.5 :: Double,
+ let j' = (fromIntegral j) * 0.5 :: Double,
+ let k' = (fromIntegral k) * 0.5 :: Double]
where
g = Grid trilinear
c0 = cube_at g 1 1 1
prop_cube_indices_never_go_out_of_bounds :: Grid -> Gen Bool
prop_cube_indices_never_go_out_of_bounds g =
do
- let coordmin = negate (1/2)
+ let coordmin = negate (1/2) :: Double
let (xsize, ysize, zsize) = dims $ function_values g
- let xmax = (fromIntegral xsize) - (1/2)
- let ymax = (fromIntegral ysize) - (1/2)
- let zmax = (fromIntegral zsize) - (1/2)
+ let xmax = (fromIntegral xsize) - (1/2) :: Double
+ let ymax = (fromIntegral ysize) - (1/2) :: Double
+ let zmax = (fromIntegral zsize) - (1/2) :: Double
x <- choose (coordmin, xmax)
y <- choose (coordmin, ymax)