| dph-seq-0.3: Data structures for Nested Data-Parallel Haskell. | Source code | Contents | Index

Data.Array.Parallel.Prelude.Int

Documentation
Int (I#)

(==) :: Int -> Int -> Bool | Source

(/=) :: Int -> Int -> Bool | Source

(<=) :: Int -> Int -> Bool | Source

(<) :: Int -> Int -> Bool | Source

(>=) :: Int -> Int -> Bool | Source

(>) :: Int -> Int -> Bool | Source

min :: Int -> Int -> Int | Source

max :: Int -> Int -> Int | Source

minimumP :: [:Int:] -> Int | Source

maximumP :: [:Int:] -> Int | Source

minIndexP :: [:Int:] -> Int | Source

maxIndexP :: [:Int:] -> Int | Source

(+) :: Int -> Int -> Int | Source

(-) :: Int -> Int -> Int | Source

(*) :: Int -> Int -> Int | Source

negate :: Int -> Int | Source

abs :: Int -> Int | Source

sumP :: [:Int:] -> Int | Source

productP :: [:Int:] -> Int | Source

div :: Int -> Int -> Int | Source

mod :: Int -> Int -> Int | Source

sqrt :: Int -> Int | Source

enumFromToP :: Int -> Int -> [:Int:] | Source

Produced by Haddock version 2.4.2