Copyright | (c) The University of Glasgow 2001 |
---|---|

License | BSD-style (see the file libraries/base/LICENSE) |

Maintainer | [email protected] |

Stability | experimental |

Portability | portable |

Safe Haskell | Trustworthy |

Language | Haskell2010 |

Signed integer types

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.

8-bit signed integer type

16-bit signed integer type

32-bit signed integer type

64-bit signed integer type

- 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.

© The University of Glasgow and others

Licensed under a BSD-style license (see top of the page).

https://downloads.haskell.org/~ghc/7.10.3/docs/html/libraries/base-4.8.2.0/Data-Int.html