Data.Bits.HT
(.<<.) :: Bits a => a -> Int -> a infixl 7 Source #
Infix variant of shiftL. Precedence is chosen like multiplication since a .<<. k == a * 2^k.
shiftL
a .<<. k == a * 2^k
(.>>.) :: Bits a => a -> Int -> a infixl 7 Source #
Infix variant of shiftR. Precedence is chosen like division since a .>>. k == a / 2^k.
shiftR
a .>>. k == a / 2^k