dph-prim-par-0.7.0.1: Data Parallel Haskell segmented arrays. (production version)

Safe HaskellNone

Data.Array.Parallel.Unlifted.Parallel.Segmented

Description

Parallel combinators for segmented unboxed arrays

Synopsis

Documentation

replicateRSUP :: Unbox a => Int -> Vector a -> Vector aSource

Segmented replication. Each element in the vector is replicated the given number of times.

replicateRSUP 2 [1, 2, 3, 4, 5] = [1, 1, 2, 2, 3, 3, 4, 4, 5, 5]

appendSUPSource

Arguments

:: Unbox a 
=> UPSegd

segment descriptor of result

-> UPSegd

left-hand segd

-> Vector a

left-hand data

-> UPSegd

right-hand segd

-> Vector a

right-hand data

-> Vector a 

Segmented append.

appendSUP_old :: Unbox a => UPSegd -> UPSegd -> Vector a -> UPSegd -> Vector a -> Vector aSource

Segmented append. -old

appendSUPVSource

Arguments

:: (Unboxes a, Unbox a) 
=> UPSegd

segment descriptor of result

-> UPVSegd

left-hand segd

-> Vectors a

left-hand data

-> UPVSegd

right-hand segd

-> Vectors a

right-hand data

-> Vector a 

foldRUP :: (Unbox a, Unbox b) => (b -> a -> b) -> b -> Int -> Vector a -> Vector bSource

Regular segmented fold.

sumRUP :: (Num e, Unbox e) => Int -> Vector e -> Vector eSource

Regular segmented sum.