module Data.Array.Parallel.Prelude.Base.Double (
(==), (/=), (<), (<=), (>), (>=), min, max,
eqV, neqV, ltV, leV, gtV, geV, minV, maxV,
minimumP, maximumP, minIndexP, maxIndexP,
minimumPA, maximumPA, minIndexPA, maxIndexPA,
(+), (), (*), negate, abs,
plusV, minusV, multV, negateV, absV,
sumP, productP,
sumPA, productPA,
(/), recip,
divideV, recipV,
pi, exp, sqrt, log, (**), logBase,
sin, tan, cos, asin, atan, acos,
sinh, tanh, cosh, asinh, atanh, acosh,
expV, sqrtV, logV, powV, logBaseV,
sinV, tanV, cosV, asinV, atanV, acosV,
sinhV, tanhV, coshV, asinhV, atanhV, acoshV,
fromInt,
fromIntV,
truncate, round, ceiling, floor,
truncateV, roundV, ceilingV, floorV
) where
import Data.Array.Parallel.Prelude.Base.PArr
import Data.Array.Parallel.Lifted.Combinators
import Data.Array.Parallel.Lifted.Instances
import Data.Array.Parallel.Lifted.Prim
import Data.Array.Parallel.Lifted.Closure
import Data.Array.Parallel.Lifted.PArray
import Prelude (Double, Int, Bool)
import qualified Prelude as P
import qualified GHC.PArr
infixr 8 **
infixl 7 *, /
infixl 6 +,
infix 4 ==, /=, <, <=, >, >=
eqV, neqV, leV, ltV, geV, gtV :: Double :-> Double :-> Bool
eqV = closure2 dPA_Double (P.==) (unsafe_zipWith (P.==))
neqV = closure2 dPA_Double (P./=) (unsafe_zipWith (P./=))
leV = closure2 dPA_Double (P.<=) (unsafe_zipWith (P.<=))
ltV = closure2 dPA_Double (P.<) (unsafe_zipWith (P.<))
geV = closure2 dPA_Double (P.>=) (unsafe_zipWith (P.>=))
gtV = closure2 dPA_Double (P.>) (unsafe_zipWith (P.>))
(==), (/=), (<), (<=), (>), (>=) :: Double -> Double -> Bool
(==) = (P.==)
(/=) = (P./=)
(<=) = (P.<=)
(<) = (P.<)
(>=) = (P.>=)
(>) = (P.>)
minV, maxV :: Double :-> Double :-> Double
minV = closure2 dPA_Double P.min (unsafe_zipWith P.min)
maxV = closure2 dPA_Double P.max (unsafe_zipWith P.max)
min, max :: Double -> Double -> Double
min = P.min
max = P.max
minimumPA, maximumPA :: PArray Double :-> Double
minimumPA = closure1 (unsafe_fold1 P.min) (unsafe_fold1s P.min)
maximumPA = closure1 (unsafe_fold1 P.max) (unsafe_fold1s P.max)
minimumP, maximumP :: [:Double:] -> Double
minimumP = GHC.PArr.minimumP
maximumP = GHC.PArr.maximumP
minIndexPA :: PArray Double :-> Int
minIndexPA = closure1 (unsafe_fold1Index min') (unsafe_fold1sIndex min')
where
min' (i,x) (j,y) | x P.<= y = (i,x)
| P.otherwise = (j,y)
minIndexP :: [:Double:] -> Int
minIndexP _ = 0
maxIndexPA :: PArray Double :-> Int
maxIndexPA = closure1 (unsafe_fold1Index max') (unsafe_fold1sIndex max')
where
max' (i,x) (j,y) | x P.>= y = (i,x)
| P.otherwise = (j,y)
maxIndexP :: [:Double:] -> Int
maxIndexP _ = 0
plusV, minusV, multV :: Double :-> Double :-> Double
plusV = closure2 dPA_Double (P.+) (unsafe_zipWith (P.+))
minusV = closure2 dPA_Double (P.-) (unsafe_zipWith (P.-))
multV = closure2 dPA_Double (P.*) (unsafe_zipWith (P.*))
(+), (), (*) :: Double -> Double -> Double
(+) = (P.+)
() = (P.-)
(*) = (P.*)
negateV, absV :: Double :-> Double
negateV = closure1 P.negate (unsafe_map P.negate)
absV = closure1 P.abs (unsafe_map P.abs)
negate, abs :: Double -> Double
negate = P.negate
abs = P.abs
sumPA, productPA :: PArray Double :-> Double
sumPA = closure1 (unsafe_fold (+) 0) (unsafe_folds (+) 0)
productPA = closure1 (unsafe_fold (*) 1) (unsafe_folds (*) 1)
sumP, productP :: [:Double:] -> Double
sumP = GHC.PArr.sumP
productP = GHC.PArr.productP
(/) :: Double -> Double -> Double
(/) = (P./)
divideV :: Double :-> Double :-> Double
divideV = closure2 dPA_Double (P./) (unsafe_zipWith (P./))
recip :: Double -> Double
recip = P.recip
recipV :: Double :-> Double
recipV = closure1 P.recip (unsafe_map P.recip)
pi :: Double
pi = P.pi
exp, sqrt, log, sin, tan, cos, asin, atan, acos, sinh, tanh, cosh,
asinh, atanh, acosh :: Double -> Double
exp = P.exp
sqrt = P.sqrt
log = P.log
sin = P.sin
tan = P.tan
cos = P.cos
asin = P.asin
atan = P.atan
acos = P.acos
sinh = P.sinh
tanh = P.tanh
cosh = P.cosh
asinh = P.asinh
atanh = P.atanh
acosh = P.acosh
expV, sqrtV, logV, sinV, tanV, cosV, asinV, atanV, acosV, sinhV, tanhV, coshV,
asinhV, atanhV, acoshV :: Double :-> Double
expV = closure1 P.exp (unsafe_map P.exp)
sqrtV = closure1 P.sqrt (unsafe_map P.sqrt)
logV = closure1 P.log (unsafe_map P.log)
sinV = closure1 P.sin (unsafe_map P.sin)
tanV = closure1 P.tan (unsafe_map P.tan)
cosV = closure1 P.cos (unsafe_map P.cos)
asinV = closure1 P.asin (unsafe_map P.asin)
atanV = closure1 P.atan (unsafe_map P.atan)
acosV = closure1 P.acos (unsafe_map P.acos)
sinhV = closure1 P.sinh (unsafe_map P.sinh)
tanhV = closure1 P.tanh (unsafe_map P.tanh)
coshV = closure1 P.cosh (unsafe_map P.cosh)
asinhV = closure1 P.asinh (unsafe_map P.asinh)
atanhV = closure1 P.atanh (unsafe_map P.atanh)
acoshV = closure1 P.acosh (unsafe_map P.acosh)
(**), logBase :: Double -> Double -> Double
(**) = (P.**)
logBase = P.logBase
powV, logBaseV :: Double :-> Double :-> Double
powV = closure2 dPA_Double (P.**) (unsafe_zipWith (P.**))
logBaseV = closure2 dPA_Double P.logBase (unsafe_zipWith P.logBase)
fromIntV :: Int :-> Double
fromIntV = closure1 P.fromIntegral (unsafe_map P.fromIntegral)
fromInt :: Int -> Double
fromInt = P.fromIntegral
truncateV, roundV, ceilingV, floorV :: Double :-> Int
truncateV = closure1 P.truncate (unsafe_map P.truncate)
roundV = closure1 P.round (unsafe_map P.round)
ceilingV = closure1 P.ceiling (unsafe_map P.ceiling)
floorV = closure1 P.floor (unsafe_map P.floor)
truncate, round, ceiling, floor :: Double -> Int
truncate = P.truncate
round = P.round
ceiling = P.ceiling
floor = P.floor