[project @ 2002-05-10 16:18:28 by simonmar]
[packages/base.git] / Data / Word.hs
1 {-# OPTIONS -fno-implicit-prelude #-}
2 -----------------------------------------------------------------------------
3 -- |
4 -- Module : Data.Word
5 -- Copyright : (c) The University of Glasgow 2001
6 -- License : BSD-style (see the file libraries/base/LICENSE)
7 --
8 -- Maintainer : libraries@haskell.org
9 -- Stability : experimental
10 -- Portability : portable
11 --
12 -- Unsigned integer types.
13 --
14 -----------------------------------------------------------------------------
15
16 module Data.Word
17 (
18 -- * Unsigned integral types
19
20 Word,
21 Word8, Word16, Word32, Word64,
22
23 -- * Notes
24
25 -- $notes
26 ) where
27
28 #ifdef __GLASGOW_HASKELL__
29 import GHC.Word
30 #endif
31
32 {- $notes
33
34 * All arithmetic is performed modulo 2^n, where n is the number of
35 bits in the type. One non-obvious consequence of this is that 'negate'
36 should /not/ raise an error on negative arguments.
37
38 * For coercing between any two integer types, use
39 'fromIntegral', which is specialized for all the
40 common cases so should be fast enough. Coercing word types to and
41 from integer types preserves representation, not sign.
42
43 * It would be very natural to add a type 'Natural' providing an unbounded
44 size unsigned integer, just as 'Integer' provides unbounded
45 size signed integers. We do not do that yet since there is no demand
46 for it.
47
48 * The rules that hold for 'Enum' instances over a bounded type
49 such as 'Int' (see the section of the Haskell report dealing
50 with arithmetic sequences) also hold for the 'Enum' instances
51 over the various 'Word' types defined here.
52
53 * Right and left shifts by amounts greater than or equal to the width
54 of the type result in a zero result. This is contrary to the
55 behaviour in C, which is undefined; a common interpretation is to
56 truncate the shift count to the width of the type, for example @1 \<\<
57 32 == 1@ in some C implementations.
58 -}