Int +base

data Int :: *
base Prelude, base Data.Int, base GHC.Exts
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.
module Data.Int
base Data.Int
Signed integer types
Int :: Integer -> Lexeme
base Text.Read.Lex, base Text.Read
Integer literal
data Integer :: *
base Prelude
Arbitrary-precision integers.
class (Real a, Enum a) => Integral a
base Prelude
Integral numbers, supporting integer division. Minimal complete definition: quotRem and toInteger
data Int16
base Data.Int
16-bit signed integer type
data Int32
base Data.Int
32-bit signed integer type
data Int64
base Data.Int
64-bit signed integer type
data Int8
base Data.Int
8-bit signed integer type
IntConstr :: Integer -> ConstrRep
base Data.Data
data IntPtr
base Foreign.Ptr
A signed integral type that can be losslessly converted to and from Ptr. This type is also compatible with the C99 type intptr_t, and can be marshalled to and from that type safely.
IntRep :: DataRep
base Data.Data
interact :: (String -> String) -> IO ()
base Prelude, base System.IO
The interact function takes a function of type String->String as its argument. The entire input from the standard input device is passed to this function as its argument, and the resulting string is output on the standard output device.
intercalate :: [a] -> [[a]] -> [a]
base Data.List
intercalate xs xss is equivalent to (concat (intersperse xs xss)). It inserts the list xs in between the lists in xss and concatenates the result.
intersect :: Eq a => [a] -> [a] -> [a]
base Data.List
The intersect function takes the list intersection of two lists. For example, > [1,2,3,4] `intersect` [2,4,6,8] == [2,4] If the first list contains duplicates, so will the result. > [1,2,2,3,4] `intersect` [6,4,4,2] == [2,2,4] It is a special case of intersectBy, which allows the programmer to supply their own equality test.
intersectBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]
base Data.List
The intersectBy function is the non-overloaded version of intersect.
intersperse :: a -> [a] -> [a]
base Data.List
The intersperse function takes an element and a list and `intersperses' that element between the elements of the list. For example, > intersperse ',' "abcde" == "a,b,c,d,e"
intPtrToPtr :: IntPtr -> Ptr a
base Foreign.Ptr
casts an IntPtr to a Ptr
intToDigit :: Int -> Char
base Data.Char
Convert an Int in the range 0..15 to the corresponding single digit Char. This function fails on other inputs, and generates lower-case hexadecimal digits.
iNT64_SIZE :: Int
base GHC.Constants

Show more results