dph-seq-0.4.0: Data structures for Nested Data-Parallel Haskell.Source codeContentsIndex
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.
show/hide Instances
(==) :: 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.6.1