2 -- | Wrappers for the various solvers.
7 import qualified Vector

as SV

8 import qualified Vectorised

as SPA

10 import qualified Data

.Vector

as V

11 import qualified Data

.Vector

.Unboxed

as VU

13 import qualified Data

.Array.Parallel

as P

14 import qualified Data

.Array.Parallel

.PArray

as P

16 type Solver

= Int -> Double -> VU

.Vector

(Double,Double)
18 solvers

:: [(String, Solver

)]
20 = [ ("vectorised", solver_spa

)
21 , ("vector", SV

.solveV

)
24 -- | Nested Data Parallelism + Barnes-Hut algorithm.
28 pts

' = SPA

.solvePA depth time

29 in VU

.fromList

$ P

.toList pts

'