dph-prim-par-0.3: Parallel Primitives for Data-Parallel Haskell.ContentsIndex
Search:
!:
+:+
>:
andD
andUP
Array
atomicUpdateD
balanced
bpermute
bpermuteD
bpermuteSD'
bpermuteSUP'
bpermuteUP
combine
concat
Dist
Distribution
dropUP
DT
Elt
empty
enumFromStepLenUP
enumFromThenToSUP
enumFromThenToUP
enumFromTo
enumFromToEach
enumFromToUP
eqD
filterSUP
filterUP
fold
fold1
fold1_s
foldD
foldSUP
foldUP
fold_s
forkGang
fromD
fromList
fstD
fsts
Gang
gangSize
indexed
indexedSUP
indexedUP
indexed_s
indices_s
joinD
joinLengthD
joinSD
jsTest
length
lengthD
lengths_s
length_s
map
mapD
mapSUP
mapUP
neqD
orD
pack
packCUP
packUP
permuteD
randomRs
randoms
repeat
replicate
replicateEach
replicateEachUnbalancedUP
replicateSUP
replicateUP
SArray
scalarD
scan
scanD
scanUP
Segd
seqGang
sequentialGang
sndD
splitD
splitJoinD
splitJoinSD
splitLenD
splitLengthD
splitSD
sum
sumD
sumSUP
sumUP
sum_s
theGang
toD
toList
toSegd
unbalanced
unzip
unzip3
unzipD
updateUP
zip
zip3
zipD
zipWith
zipWith3
zipWithD
zipWithSUP
zipWithUP
^+:+^