Haskell Hierarchical Libraries (base package) Contents Index

Data.Int Portability portable Stability experimental Maintainer libraries@haskell.org

Contents Signed integer types Notes

Description

Signed integer types

Synopsis

data Int data Int8 data Int16 data Int32 data Int64

Signed integer types

data Int

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 minBound and maxBound from the Bounded class. Instances IArray UArray Int Ix ix => Eq (UArray ix Int) Ix ix => Ord (UArray ix Int) (Ix ix, Show ix) => Show (UArray ix Int) MArray (STUArray s) Int (ST s) (Ix ix, Show ix) => Show (DiffUArray ix Int) IArray (IOToDiffArray IOUArray) Int MArray IOUArray Int IO Bits Int Data Int Typeable Int Storable Int Ix Int Eq Int Ord Int Bounded Int Enum Int Num Int Read Int Real Int Integral Int Show Int Random Int

data Int8

8-bit signed integer type Instances IArray UArray Int8 Ix ix => Eq (UArray ix Int8) Ix ix => Ord (UArray ix Int8) (Ix ix, Show ix) => Show (UArray ix Int8) MArray (STUArray s) Int8 (ST s) (Ix ix, Show ix) => Show (DiffUArray ix Int8) IArray (IOToDiffArray IOUArray) Int8 MArray IOUArray Int8 IO Typeable Int8 Storable Int8 Show Int8 Num Int8 Real Int8 Enum Int8 Integral Int8 Bounded Int8 Ix Int8 Read Int8 Bits Int8 Eq Int8 Ord Int8

data Int16

16-bit signed integer type Instances IArray UArray Int16 Ix ix => Eq (UArray ix Int16) Ix ix => Ord (UArray ix Int16) (Ix ix, Show ix) => Show (UArray ix Int16) MArray (STUArray s) Int16 (ST s) (Ix ix, Show ix) => Show (DiffUArray ix Int16) IArray (IOToDiffArray IOUArray) Int16 MArray IOUArray Int16 IO Typeable Int16 Storable Int16 Show Int16 Num Int16 Real Int16 Enum Int16 Integral Int16 Bounded Int16 Ix Int16 Read Int16 Bits Int16 Eq Int16 Ord Int16

data Int32

32-bit signed integer type Instances IArray UArray Int32 Ix ix => Eq (UArray ix Int32) Ix ix => Ord (UArray ix Int32) (Ix ix, Show ix) => Show (UArray ix Int32) MArray (STUArray s) Int32 (ST s) (Ix ix, Show ix) => Show (DiffUArray ix Int32) IArray (IOToDiffArray IOUArray) Int32 MArray IOUArray Int32 IO Typeable Int32 Storable Int32 Show Int32 Num Int32 Enum Int32 Integral Int32 Read Int32 Bits Int32 Real Int32 Bounded Int32 Ix Int32 Eq Int32 Ord Int32

data Int64

64-bit signed integer type Instances IArray UArray Int64 Ix ix => Eq (UArray ix Int64) Ix ix => Ord (UArray ix Int64) (Ix ix, Show ix) => Show (UArray ix Int64) MArray (STUArray s) Int64 (ST s) (Ix ix, Show ix) => Show (DiffUArray ix Int64) IArray (IOToDiffArray IOUArray) Int64 MArray IOUArray Int64 IO Typeable Int64 Storable Int64 Eq Int64 Ord Int64 Show Int64 Num Int64 Enum Int64 Integral Int64 Read Int64 Bits Int64 Real Int64 Bounded Int64 Ix Int64

Notes

All arithmetic is performed modulo 2^n, where n is the number of bits in the type. For coercing between any two integer types, use fromIntegral, which is specialized for all the common cases so should be fast enough. Coercing word types (see Data.Word) to and from integer types preserves representation, not sign. The rules that hold for Enum instances over a bounded type such as Int (see the section of the Haskell report dealing with arithmetic sequences) also hold for the Enum instances over the various Int types defined here. Right and left shifts by amounts greater than or equal to the width of the type result in either zero or -1, depending on the sign of the value being shifted. This is contrary to the behaviour in C, which is undefined; a common interpretation is to truncate the shift count to the width of the type, for example 1 << 32 == 1 in some C implementations.

Produced by Haddock version 0.6