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

Data.Array.Parallel.Prelude.Int

Documentation

Int (I#)

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

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

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

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

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

(>) :: Int -> Int -> Bool

min :: Int -> Int -> Int

max :: Int -> Int -> Int

minimumP :: [:Int:] -> Int

maximumP :: [:Int:] -> Int

minIndexP :: [:Int:] -> Int

maxIndexP :: [:Int:] -> Int

(+) :: Int -> Int -> Int

(-) :: Int -> Int -> Int

(*) :: Int -> Int -> Int

negate :: Int -> Int

abs :: Int -> Int

sumP :: [:Int:] -> Int

productP :: [:Int:] -> Int

div :: Int -> Int -> Int

mod :: Int -> Int -> Int

sqrt :: Int -> Int

enumFromToP :: Int -> Int -> [:Int:]

Produced by Haddock version 2.4.2