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

Data.Array.Parallel.Prelude.Int

Synopsis

data Int (==) :: 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:]

Documentation

data Int Source

A fixed-precision integer type with at least the range [-2^29 .. 2^29-1]. The exact range for a given implementation can be determined by using Prelude.minBound and Prelude.maxBound from the Prelude.Bounded class. Instances Bounded Int Enum Int Eq Int Integral Int Num Int Ord Int Real Int Show Int HS Int UPrim Int Elt Int IOElt Int UA Int UIO Int Random Int Scalar Int Random Int Elt Int

(==) :: 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.6.1