base-4.16.0.0: Basic libraries
Copyright(c) The University of Glasgow 2001
LicenseBSD-style (see the file libraries/base/LICENSE)
Maintainerlibraries@haskell.org
Stabilityexperimental
Portabilityportable
Safe HaskellSafe
LanguageHaskell2010

Data.Word

Description

Unsigned integer types.

Synopsis

Unsigned integral types

data Word Source #

A Word is an unsigned integral type, with the same size as Int.

Instances

Instances details
Bounded Word #

Since: base-2.1

Instance details

Defined in GHC.Enum

Enum Word #

Since: base-2.1

Instance details

Defined in GHC.Enum

Eq Word 
Instance details

Defined in GHC.Classes

Methods

(==) :: Word -> Word -> Bool Source #

(/=) :: Word -> Word -> Bool Source #

Integral Word #

Since: base-2.1

Instance details

Defined in GHC.Real

Data Word #

Since: base-4.0.0.0

Instance details

Defined in Data.Data

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Word -> c Word Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Word Source #

toConstr :: Word -> Constr Source #

dataTypeOf :: Word -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Word) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Word) Source #

gmapT :: (forall b. Data b => b -> b) -> Word -> Word Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Word -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Word -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Word -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Word -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Word -> m Word Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Word -> m Word Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Word -> m Word Source #

Num Word #

Since: base-2.1

Instance details

Defined in GHC.Num

Ord Word 
Instance details

Defined in GHC.Classes

Read Word #

Since: base-4.5.0.0

Instance details

Defined in GHC.Read

Real Word #

Since: base-2.1

Instance details

Defined in GHC.Real

Show Word #

Since: base-2.1

Instance details

Defined in GHC.Show

Ix Word #

Since: base-4.6.0.0

Instance details

Defined in GHC.Ix

Bits Word #

Since: base-2.1

Instance details

Defined in GHC.Bits

FiniteBits Word #

Since: base-4.6.0.0

Instance details

Defined in GHC.Bits

Storable Word #

Since: base-2.1

Instance details

Defined in Foreign.Storable

PrintfArg Word #

Since: base-2.1

Instance details

Defined in Text.Printf

Generic1 (URec Word :: k -> Type) # 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 (URec Word) :: k -> Type Source #

Methods

from1 :: forall (a :: k0). URec Word a -> Rep1 (URec Word) a Source #

to1 :: forall (a :: k0). Rep1 (URec Word) a -> URec Word a Source #

Foldable (UWord :: Type -> Type) #

Since: base-4.9.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => UWord m -> m Source #

foldMap :: Monoid m => (a -> m) -> UWord a -> m Source #

foldMap' :: Monoid m => (a -> m) -> UWord a -> m Source #

foldr :: (a -> b -> b) -> b -> UWord a -> b Source #

foldr' :: (a -> b -> b) -> b -> UWord a -> b Source #

foldl :: (b -> a -> b) -> b -> UWord a -> b Source #

foldl' :: (b -> a -> b) -> b -> UWord a -> b Source #

foldr1 :: (a -> a -> a) -> UWord a -> a Source #

foldl1 :: (a -> a -> a) -> UWord a -> a Source #

toList :: UWord a -> [a] Source #

null :: UWord a -> Bool Source #

length :: UWord a -> Int Source #

elem :: Eq a => a -> UWord a -> Bool Source #

maximum :: Ord a => UWord a -> a Source #

minimum :: Ord a => UWord a -> a Source #

sum :: Num a => UWord a -> a Source #

product :: Num a => UWord a -> a Source #

Traversable (UWord :: Type -> Type) #

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> UWord a -> f (UWord b) Source #

sequenceA :: Applicative f => UWord (f a) -> f (UWord a) Source #

mapM :: Monad m => (a -> m b) -> UWord a -> m (UWord b) Source #

sequence :: Monad m => UWord (m a) -> m (UWord a) Source #

Functor (URec Word :: Type -> Type) #

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec Word a -> URec Word b Source #

(<$) :: a -> URec Word b -> URec Word a Source #

Eq (URec Word p) #

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(==) :: URec Word p -> URec Word p -> Bool Source #

(/=) :: URec Word p -> URec Word p -> Bool Source #

Ord (URec Word p) #

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

compare :: URec Word p -> URec Word p -> Ordering Source #

(<) :: URec Word p -> URec Word p -> Bool Source #

(<=) :: URec Word p -> URec Word p -> Bool Source #

(>) :: URec Word p -> URec Word p -> Bool Source #

(>=) :: URec Word p -> URec Word p -> Bool Source #

max :: URec Word p -> URec Word p -> URec Word p Source #

min :: URec Word p -> URec Word p -> URec Word p Source #

Show (URec Word p) #

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Generic (URec Word p) # 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (URec Word p) :: Type -> Type Source #

Methods

from :: URec Word p -> Rep (URec Word p) x Source #

to :: Rep (URec Word p) x -> URec Word p Source #

data URec Word (p :: k) #

Used for marking occurrences of Word#

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

data URec Word (p :: k) = UWord {}
type Rep1 (URec Word :: k -> Type) #

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

type Rep1 (URec Word :: k -> Type) = D1 ('MetaData "URec" "GHC.Generics" "base" 'False) (C1 ('MetaCons "UWord" 'PrefixI 'True) (S1 ('MetaSel ('Just "uWord#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UWord :: k -> Type)))
type Rep (URec Word p) #

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

type Rep (URec Word p) = D1 ('MetaData "URec" "GHC.Generics" "base" 'False) (C1 ('MetaCons "UWord" 'PrefixI 'True) (S1 ('MetaSel ('Just "uWord#") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (UWord :: Type -> Type)))

data Word8 Source #

8-bit unsigned integer type

Instances

Instances details
Bounded Word8 #

Since: base-2.1

Instance details

Defined in GHC.Word

Enum Word8 #

Since: base-2.1

Instance details

Defined in GHC.Word

Eq Word8 #

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

(==) :: Word8 -> Word8 -> Bool Source #

(/=) :: Word8 -> Word8 -> Bool Source #

Integral Word8 #

Since: base-2.1

Instance details

Defined in GHC.Word

Data Word8 #

Since: base-4.0.0.0

Instance details

Defined in Data.Data

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Word8 -> c Word8 Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Word8 Source #

toConstr :: Word8 -> Constr Source #

dataTypeOf :: Word8 -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Word8) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Word8) Source #

gmapT :: (forall b. Data b => b -> b) -> Word8 -> Word8 Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Word8 -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Word8 -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Word8 -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Word8 -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Word8 -> m Word8 Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Word8 -> m Word8 Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Word8 -> m Word8 Source #

Num Word8 #

Since: base-2.1

Instance details

Defined in GHC.Word

Ord Word8 #

Since: base-2.1

Instance details

Defined in GHC.Word

Read Word8 #

Since: base-2.1

Instance details

Defined in GHC.Read

Real Word8 #

Since: base-2.1

Instance details

Defined in GHC.Word

Show Word8 #

Since: base-2.1

Instance details

Defined in GHC.Word

Ix Word8 #

Since: base-2.1

Instance details

Defined in GHC.Word

Bits Word8 #

Since: base-2.1

Instance details

Defined in GHC.Word

FiniteBits Word8 #

Since: base-4.6.0.0

Instance details

Defined in GHC.Word

Storable Word8 #

Since: base-2.1

Instance details

Defined in Foreign.Storable

PrintfArg Word8 #

Since: base-2.1

Instance details

Defined in Text.Printf

data Word16 Source #

16-bit unsigned integer type

Instances

Instances details
Bounded Word16 #

Since: base-2.1

Instance details

Defined in GHC.Word

Enum Word16 #

Since: base-2.1

Instance details

Defined in GHC.Word

Eq Word16 #

Since: base-2.1

Instance details

Defined in GHC.Word

Integral Word16 #

Since: base-2.1

Instance details

Defined in GHC.Word

Data Word16 #

Since: base-4.0.0.0

Instance details

Defined in Data.Data

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Word16 -> c Word16 Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Word16 Source #

toConstr :: Word16 -> Constr Source #

dataTypeOf :: Word16 -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Word16) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Word16) Source #

gmapT :: (forall b. Data b => b -> b) -> Word16 -> Word16 Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Word16 -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Word16 -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Word16 -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Word16 -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Word16 -> m Word16 Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Word16 -> m Word16 Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Word16 -> m Word16 Source #

Num Word16 #

Since: base-2.1

Instance details

Defined in GHC.Word

Ord Word16 #

Since: base-2.1

Instance details

Defined in GHC.Word

Read Word16 #

Since: base-2.1

Instance details

Defined in GHC.Read

Real Word16 #

Since: base-2.1

Instance details

Defined in GHC.Word

Show Word16 #

Since: base-2.1

Instance details

Defined in GHC.Word

Ix Word16 #

Since: base-2.1

Instance details

Defined in GHC.Word

Bits Word16 #

Since: base-2.1

Instance details

Defined in GHC.Word

FiniteBits Word16 #

Since: base-4.6.0.0

Instance details

Defined in GHC.Word

Storable Word16 #

Since: base-2.1

Instance details

Defined in Foreign.Storable

PrintfArg Word16 #

Since: base-2.1

Instance details

Defined in Text.Printf

data Word32 Source #

32-bit unsigned integer type

Instances

Instances details
Bounded Word32 #

Since: base-2.1

Instance details

Defined in GHC.Word

Enum Word32 #

Since: base-2.1

Instance details

Defined in GHC.Word

Eq Word32 #

Since: base-2.1

Instance details

Defined in GHC.Word

Integral Word32 #

Since: base-2.1

Instance details

Defined in GHC.Word

Data Word32 #

Since: base-4.0.0.0

Instance details

Defined in Data.Data

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Word32 -> c Word32 Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Word32 Source #

toConstr :: Word32 -> Constr Source #

dataTypeOf :: Word32 -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Word32) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Word32) Source #

gmapT :: (forall b. Data b => b -> b) -> Word32 -> Word32 Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Word32 -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Word32 -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Word32 -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Word32 -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Word32 -> m Word32 Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Word32 -> m Word32 Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Word32 -> m Word32 Source #

Num Word32 #

Since: base-2.1

Instance details

Defined in GHC.Word

Ord Word32 #

Since: base-2.1

Instance details

Defined in GHC.Word

Read Word32 #

Since: base-2.1

Instance details

Defined in GHC.Read

Real Word32 #

Since: base-2.1

Instance details

Defined in GHC.Word

Show Word32 #

Since: base-2.1

Instance details

Defined in GHC.Word

Ix Word32 #

Since: base-2.1

Instance details

Defined in GHC.Word

Bits Word32 #

Since: base-2.1

Instance details

Defined in GHC.Word

FiniteBits Word32 #

Since: base-4.6.0.0

Instance details

Defined in GHC.Word

Storable Word32 #

Since: base-2.1

Instance details

Defined in Foreign.Storable

PrintfArg Word32 #

Since: base-2.1

Instance details

Defined in Text.Printf

data Word64 Source #

64-bit unsigned integer type

Instances

Instances details
Bounded Word64 #

Since: base-2.1

Instance details

Defined in GHC.Word

Enum Word64 #

Since: base-2.1

Instance details

Defined in GHC.Word

Eq Word64 #

Since: base-2.1

Instance details

Defined in GHC.Word

Integral Word64 #

Since: base-2.1

Instance details

Defined in GHC.Word

Data Word64 #

Since: base-4.0.0.0

Instance details

Defined in Data.Data

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Word64 -> c Word64 Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Word64 Source #

toConstr :: Word64 -> Constr Source #

dataTypeOf :: Word64 -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Word64) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Word64) Source #

gmapT :: (forall b. Data b => b -> b) -> Word64 -> Word64 Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Word64 -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Word64 -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Word64 -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Word64 -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Word64 -> m Word64 Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Word64 -> m Word64 Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Word64 -> m Word64 Source #

Num Word64 #

Since: base-2.1

Instance details

Defined in GHC.Word

Ord Word64 #

Since: base-2.1

Instance details

Defined in GHC.Word

Read Word64 #

Since: base-2.1

Instance details

Defined in GHC.Read

Real Word64 #

Since: base-2.1

Instance details

Defined in GHC.Word

Show Word64 #

Since: base-2.1

Instance details

Defined in GHC.Word

Ix Word64 #

Since: base-2.1

Instance details

Defined in GHC.Word

Bits Word64 #

Since: base-2.1

Instance details

Defined in GHC.Word

FiniteBits Word64 #

Since: base-4.6.0.0

Instance details

Defined in GHC.Word

Storable Word64 #

Since: base-2.1

Instance details

Defined in Foreign.Storable

PrintfArg Word64 #

Since: base-2.1

Instance details

Defined in Text.Printf

byte swapping

byteSwap16 :: Word16 -> Word16 Source #

Reverse order of bytes in Word16.

Since: base-4.7.0.0

byteSwap32 :: Word32 -> Word32 Source #

Reverse order of bytes in Word32.

Since: base-4.7.0.0

byteSwap64 :: Word64 -> Word64 Source #

Reverse order of bytes in Word64.

Since: base-4.7.0.0

bit reversal

bitReverse8 :: Word8 -> Word8 Source #

Reverse the order of the bits in a Word8.

Since: base-4.12.0.0

bitReverse16 :: Word16 -> Word16 Source #

Reverse the order of the bits in a Word16.

Since: base-4.12.0.0

bitReverse32 :: Word32 -> Word32 Source #

Reverse the order of the bits in a Word32.

Since: base-4.12.0.0

bitReverse64 :: Word64 -> Word64 Source #

Reverse the order of the bits in a Word64.

Since: base-4.12.0.0

Notes

  • All arithmetic is performed modulo 2^n, where n is the number of bits in the type. One non-obvious consequence of this is that negate should not raise an error on negative arguments.
  • 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 to and from integer types preserves representation, not sign.
  • An unbounded size unsigned integer type is available with Natural.
  • 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 Word types defined here.
  • Right and left shifts by amounts greater than or equal to the width of the type result in a zero result. 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.