dph-prim-seq-0.3: Sequential Primitives for Data-Parallel Haskell.ContentsIndex
Search:
!:
1 (Function)
2 (Function)
!:^
+:+
1 (Function)
2 (Function)
+:+^
>:
1 (Function)
2 (Function)
allU
andSU
andU
anyU
Array
atomicUpdateMU
bpermute
bpermuteDftU
bpermuteSU
bpermuteSU'
bpermuteU
combine
combineCU
combineSU
combineU
concat
concatSU
consU
copyMU
copyright
date
disclaimer
dropCU
dropU
elemU
Elt
empty
emptyU
enumFromStepLenU
enumFromThenToSU
enumFromThenToU
enumFromTo
enumFromToEach
enumFromToEachU
enumFromToSU
enumFromToU
extractSU
extractU
filterSU
filterU
findIndexU
findU
flattenSU
fold
fold1
fold1MaybeU
fold1SU
fold1U
fold1_s
foldl1MaybeU
foldl1U
foldlSU
foldlU
foldSU
foldU
fold_s
fromList
fromSU
fromU
fromUSegd
fsts
fstSU
fstU
hasAtomicWriteMU
hGetU
hPutU
idstr
indexed
indexedSU
indexedU
indexed_s
indicesSU
indices_s
length
lengthsSU
lengthsToUSegd
lengthSU
lengthsUSegd
lengths_s
lengthU
lengthU'
length_s
map
mapAccumLU
mapSU
mapU
maximumByU
maximumIndexByU
maximumIndexU
maximumSU
maximumU
minimumByU
minimumIndexByU
minimumIndexU
minimumSU
minimumU
MUArr
name
newMU
newU
notElemU
nullU
orSU
orU
pack
packCU
packU
permuteMU
permuteU
productSU
productU
randomRs
randomRU
randoms
randomU
repeat
repeatU
replicate
replicateCU
replicateEach
replicateEachU
replicateSU
replicateU
reverseU
SArray
scan
scan1U
scanl1U
scanlU
scanResU
scanU
Segd
segdSU
segmentArrU
segmentU
singletonSU
singletonU
sliceSU
sliceU
sndSU
sndU
splitAtU
SUArr
sum
sumSU
sumU
sum_s
tailU
takeCU
takeU
toList
toSegd
toSU
toU
toUSegd
UA
UArr
UIO
unitsU
unsafeFreezeAllMU
unzip
unzip3
unzip3U
unzipU
updateU
USegd
version
versnum
zip
zip3
zip3U
zipSU
zipU
zipWith
zipWith3
zipWith3U
zipWithSU
zipWithU
^+:+^
1 (Function)
2 (Function)