dph-prim-par-0.4.0: Parallel Primitives for Data-Parallel Haskell.ContentsIndex
!:
+:+
:*:
1 (Data Constructor)
2 (Type/Class)
and
andD
andUP
append_s
Array
atomicUpdateD
balanced
bpermute
bpermuteD
bpermuteDft
bpermuteUP
combine
combineUP
count
Dist
Distribution
drop
dropUP
DT
elementsSegd
elementsUSegdD
Elt
empty
enumFromStepLen
enumFromStepLenEach
enumFromStepLenEachUP
enumFromStepLenUP
enumFromThenTo
enumFromThenToUP
enumFromTo
enumFromToEach
enumFromToUP
eqD
extract
filter
filterUP
fold
fold1
fold1_s
foldD
foldSUP
foldUP
fold_s
forkGang
fromD
fromList
fstD
fsts
Gang
gangSize
hGet
hPut
indexed
indexedUP
indicesSegd
indicesUSegdD
indices_s
IOElt
joinD
joinLengthD
length
lengthD
lengthSegd
lengthsSegd
lengthsToSegd
lengthsUSegdD
lengthUSegdD
map
mapD
mapUP
mbpermute
mkSegd
neqD
orD
pack
packUP
permute
permuteD
pick
randomRs
randoms
repeat
repeatUP
repeat_c
replicate
replicateRSUP
replicateSUP
replicateUP
replicate_rs
replicate_s
scalarD
scan
scanD
scanUP
Segd
selectorToIndices2
seqGang
sequentialGang
sndD
snds
splitAsD
splitD
splitJoinD
splitLenD
splitLengthD
splitSD
splitSegdD
sum
sumD
sumRUP
sumSUP
sumUP
sum_r
sum_s
theGang
toD
toList
unbalanced
unzip
unzip3
unzipD
update
updateUP
zip
zip3
zipD
zipWith
zipWith3
zipWithD
zipWithUP