| dph-seq-0.3: Data structures for Nested Data-Parallel Haskell. | Source code | Contents | Index
Data.Array.Parallel.Prelude.Word8
Documentation
Word8 (W8#)
(==) :: Word8 -> Word8 -> Bool | Source
(/=) :: Word8 -> Word8 -> Bool | Source
(<=) :: Word8 -> Word8 -> Bool | Source
(<) :: Word8 -> Word8 -> Bool | Source
(>=) :: Word8 -> Word8 -> Bool | Source
(>) :: Word8 -> Word8 -> Bool | Source
min :: Word8 -> Word8 -> Word8 | Source
max :: Word8 -> Word8 -> Word8 | Source
minimumP :: [:Word8:] -> Word8 | Source
maximumP :: [:Word8:] -> Word8 | Source
minIndexP :: [:Word8:] -> Int | Source
maxIndexP :: [:Word8:] -> Int | Source
(+) :: Word8 -> Word8 -> Word8 | Source
(-) :: Word8 -> Word8 -> Word8 | Source
(*) :: Word8 -> Word8 -> Word8 | Source
negate :: Word8 -> Word8 | Source
abs :: Word8 -> Word8 | Source
sumP :: [:Word8:] -> Word8 | Source
productP :: [:Word8:] -> Word8 | Source
div :: Word8 -> Word8 -> Word8 | Source
mod :: Word8 -> Word8 -> Word8 | Source
toInt :: Word8 -> Int | Source
fromInt :: Int -> Word8 | Source
Produced by Haddock version 2.4.2