| Safe Haskell | None |
|---|
Data.Array.Parallel.Unlifted.Parallel.Sums
Description
Sum-like parallel combinators for unlifted arrays
- andUP :: Vector Bool -> Bool
- orUP :: Vector Bool -> Bool
- allUP :: Unbox e => (e -> Bool) -> Vector e -> Bool
- anyUP :: Unbox e => (e -> Bool) -> Vector e -> Bool
- sumUP :: (Unbox a, DT a, Num a) => Vector a -> a
- productUP :: (DT e, Num e, Unbox e) => Vector e -> e
- maximumUP :: (DT e, Ord e, Unbox e) => Vector e -> e
- maximumByUP :: (DT e, Unbox e) => (e -> e -> Ordering) -> Vector e -> e
- maximumIndexByUP :: (DT e, Unbox e) => (e -> e -> Ordering) -> Vector e -> Int
Documentation
allUP :: Unbox e => (e -> Bool) -> Vector e -> BoolSource
Check whether all the elements in a array meet the given predicate.
anyUP :: Unbox e => (e -> Bool) -> Vector e -> BoolSource
Check whether any of the elements in a array meet the given predicate.
productUP :: (DT e, Num e, Unbox e) => Vector e -> eSource
Compute the product of all the elements of an array.
maximumUP :: (DT e, Ord e, Unbox e) => Vector e -> eSource
Determine the maximum element in an array.