dph-seq-0.3: Data structures for Nested Data-Parallel Haskell.Source codeContentsIndex
Data.Array.Parallel.Prelude.Int
Documentation
Int (I#)
(==) :: Int -> Int -> BoolSource
(/=) :: Int -> Int -> BoolSource
(<=) :: Int -> Int -> BoolSource
(<) :: Int -> Int -> BoolSource
(>=) :: Int -> Int -> BoolSource
(>) :: Int -> Int -> BoolSource
min :: Int -> Int -> IntSource
max :: Int -> Int -> IntSource
minimumP :: [:Int:] -> IntSource
maximumP :: [:Int:] -> IntSource
minIndexP :: [:Int:] -> IntSource
maxIndexP :: [:Int:] -> IntSource
(+) :: Int -> Int -> IntSource
(-) :: Int -> Int -> IntSource
(*) :: Int -> Int -> IntSource
negate :: Int -> IntSource
abs :: Int -> IntSource
sumP :: [:Int:] -> IntSource
productP :: [:Int:] -> IntSource
div :: Int -> Int -> IntSource
mod :: Int -> Int -> IntSource
sqrt :: Int -> IntSource
enumFromToP :: Int -> Int -> [:Int:]Source
Produced by Haddock version 2.4.2