base-4.20.0.0: Core data structures and operations
Copyright(c) The University of Glasgow 2001
LicenseBSD-style (see the file libraries/base/LICENSE)
Maintainerlibraries@haskell.org
Stabilitystable
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
PrintfArg Word Source #

Since: base-2.1

Instance details

Defined in Text.Printf

Bits Word Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Bits

FiniteBits Word Source #

Since: base-4.6.0.0

Instance details

Defined in GHC.Internal.Bits

Data Word Source #

Since: base-4.0.0.0

Instance details

Defined in GHC.Internal.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 #

Bounded Word Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Enum

Enum Word Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Enum

Storable Word Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Foreign.Storable

Ix Word Source #

Since: base-4.6.0.0

Instance details

Defined in GHC.Internal.Ix

Num Word Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Num

Read Word Source #

Since: base-4.5.0.0

Instance details

Defined in GHC.Internal.Read

Integral Word Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Real

Real Word Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Real

Show Word Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Show

Eq Word Source # 
Instance details

Defined in GHC.Classes

Methods

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

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

Ord Word Source # 
Instance details

Defined in GHC.Classes

Lift Word Source # 
Instance details

Defined in GHC.Internal.TH.Lift

Methods

lift :: Quote m => Word -> m Exp Source #

liftTyped :: forall (m :: Type -> Type). Quote m => Word -> Code m Word Source #

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

Defined in GHC.Internal.Generics

Associated Types

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

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

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

Methods

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

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

Eq1 (UWord :: Type -> Type) Source #

Since: base-4.21.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftEq :: (a -> b -> Bool) -> UWord a -> UWord b -> Bool Source #

Ord1 (UWord :: Type -> Type) Source #

Since: base-4.21.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftCompare :: (a -> b -> Ordering) -> UWord a -> UWord b -> Ordering Source #

Show1 (UWord :: Type -> Type) Source #

Since: base-4.21.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> UWord a -> ShowS Source #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [UWord a] -> ShowS Source #

Foldable (UWord :: Type -> Type) Source #

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.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) Source #

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.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) Source #

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

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

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

Generic (URec Word p) Source # 
Instance details

Defined in GHC.Internal.Generics

Associated Types

type Rep (URec Word p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

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

Methods

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

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

Show (URec Word p) Source #

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

Eq (URec Word p) Source #

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

Methods

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

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

Ord (URec Word p) Source #

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.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 #

data URec Word (p :: k) Source #

Used for marking occurrences of Word#

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

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

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

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

Since: base-4.9.0.0

Instance details

Defined in GHC.Internal.Generics

type Rep (URec Word p) = D1 ('MetaData "URec" "GHC.Internal.Generics" "ghc-internal" '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
PrintfArg Word8 Source #

Since: base-2.1

Instance details

Defined in Text.Printf

Bits Word8 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

FiniteBits Word8 Source #

Since: base-4.6.0.0

Instance details

Defined in GHC.Internal.Word

Data Word8 Source #

Since: base-4.0.0.0

Instance details

Defined in GHC.Internal.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 #

Bounded Word8 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Enum Word8 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Storable Word8 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Foreign.Storable

Ix Word8 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Num Word8 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Read Word8 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Read

Integral Word8 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Real Word8 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Show Word8 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Eq Word8 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Methods

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

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

Ord Word8 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Lift Word8 Source # 
Instance details

Defined in GHC.Internal.TH.Lift

Methods

lift :: Quote m => Word8 -> m Exp Source #

liftTyped :: forall (m :: Type -> Type). Quote m => Word8 -> Code m Word8 Source #

data Word16 Source #

16-bit unsigned integer type

Instances

Instances details
PrintfArg Word16 Source #

Since: base-2.1

Instance details

Defined in Text.Printf

Bits Word16 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

FiniteBits Word16 Source #

Since: base-4.6.0.0

Instance details

Defined in GHC.Internal.Word

Data Word16 Source #

Since: base-4.0.0.0

Instance details

Defined in GHC.Internal.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 #

Bounded Word16 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Enum Word16 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Storable Word16 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Foreign.Storable

Ix Word16 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Num Word16 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Read Word16 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Read

Integral Word16 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Real Word16 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Show Word16 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Eq Word16 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Ord Word16 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Lift Word16 Source # 
Instance details

Defined in GHC.Internal.TH.Lift

Methods

lift :: Quote m => Word16 -> m Exp Source #

liftTyped :: forall (m :: Type -> Type). Quote m => Word16 -> Code m Word16 Source #

data Word32 Source #

32-bit unsigned integer type

Instances

Instances details
PrintfArg Word32 Source #

Since: base-2.1

Instance details

Defined in Text.Printf

Bits Word32 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

FiniteBits Word32 Source #

Since: base-4.6.0.0

Instance details

Defined in GHC.Internal.Word

Data Word32 Source #

Since: base-4.0.0.0

Instance details

Defined in GHC.Internal.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 #

Bounded Word32 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Enum Word32 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Storable Word32 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Foreign.Storable

Ix Word32 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Num Word32 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Read Word32 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Read

Integral Word32 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Real Word32 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Show Word32 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Eq Word32 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Ord Word32 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Lift Word32 Source # 
Instance details

Defined in GHC.Internal.TH.Lift

Methods

lift :: Quote m => Word32 -> m Exp Source #

liftTyped :: forall (m :: Type -> Type). Quote m => Word32 -> Code m Word32 Source #

data Word64 Source #

64-bit unsigned integer type

Instances

Instances details
PrintfArg Word64 Source #

Since: base-2.1

Instance details

Defined in Text.Printf

Bits Word64 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

FiniteBits Word64 Source #

Since: base-4.6.0.0

Instance details

Defined in GHC.Internal.Word

Data Word64 Source #

Since: base-4.0.0.0

Instance details

Defined in GHC.Internal.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 #

Bounded Word64 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Enum Word64 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Storable Word64 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Foreign.Storable

Ix Word64 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Num Word64 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Read Word64 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Read

Integral Word64 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Real Word64 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Show Word64 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Eq Word64 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Ord Word64 Source #

Since: base-2.1

Instance details

Defined in GHC.Internal.Word

Lift Word64 Source # 
Instance details

Defined in GHC.Internal.TH.Lift

Methods

lift :: Quote m => Word64 -> m Exp Source #

liftTyped :: forall (m :: Type -> Type). Quote m => Word64 -> Code m Word64 Source #

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

bitReverse16 :: Word16 -> Word16 Source #

Reverse the order of the bits in a Word16.

Since: base-4.14.0.0

bitReverse32 :: Word32 -> Word32 Source #

Reverse the order of the bits in a Word32.

Since: base-4.14.0.0

bitReverse64 :: Word64 -> Word64 Source #

Reverse the order of the bits in a Word64.

Since: base-4.14.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.