1 files changed, 0 insertions, 41 deletions
diff --git a/testsuite/tests/ghc-regress/dph/quickhull/QuickHullVect.hs b/testsuite/tests/ghc-regress/dph/quickhull/QuickHullVect.hs
deleted file mode 100644
index 29aaa4a823..0000000000
--- a/testsuite/tests/ghc-regress/dph/quickhull/QuickHullVect.hs
+++ /dev/null
@@ -1,41 +0,0 @@
-{-# LANGUAGE ParallelArrays #-}
-{-# OPTIONS -fvectorise #-}
-
-module QuickHullVect (quickhull) where
-
-import Types
-
-import Data.Array.Parallel
-import Data.Array.Parallel.Prelude.Double
-import qualified Data.Array.Parallel.Prelude.Int as Int
-
-import qualified Prelude as P
-
-distance :: Point -> Line -> Double
-distance (xo, yo) ((x1, y1), (x2, y2))
-  = (x1-xo) * (y2 - yo) - (y1 - yo) * (x2 - xo)
-
-hsplit :: [:Point:] -> Line -> [:Point:]
-hsplit points line@(p1, p2)
-  | lengthP packed Int.< 2 = singletonP p1 +:+ packed
-  | otherwise
-  = concatP [: hsplit packed ends | ends <- [:(p1, pm), (pm, p2):] :]
-  where
-    cross  = [: distance p line | p <- points :]
-    packed = [: p | (p,c) <- zipP points cross, c > 0.0 :]
-    pm     = points !: maxIndexP cross
-
-quickHull' :: [:Point:] -> [:Point:]
-quickHull' points
-  | lengthP points Int.== 0 = points
-  | otherwise
-  = concatP [: hsplit points ends | ends <- [: (minx, maxx), (maxx, minx) :] :]
-  where
-    xs   = [: x | (x, y) <- points :]
-    minx = points !: minIndexP xs
-    maxx = points !: maxIndexP xs
-
-quickhull :: PArray Point -> PArray Point
-{-# NOINLINE quickhull #-}
-quickhull ps = toPArrayP (quickHull' (fromPArrayP ps))
-