shiftL is:exact

shiftL :: Bits a => a -> Int -> a

base Data.Bits GHC.Bits, protolude Protolude, base-prelude BasePrelude, foundation Foundation.Bits, ghc-internal GHC.Internal.Bits GHC.Internal.Data.Bits, rebase Rebase.Prelude

Shift the argument left by the specified number of bits (which must be non-negative). Some instances may throw an Overflow exception if given a negative input. An instance can define either this and shiftR or the unified shift, depending on which is more convenient for the type in question.

shiftL :: Bits a => a -> Int -> a

ghc GHC.Prelude.Basic, ghc-lib-parser GHC.Prelude.Basic

shiftL :: Int -> a -> Vector n a -> Vector n a

parameterized-utils Data.Parameterized.Vector

Move all elements towards smaller indexes. Elements that fall off the front are ignored. Empty slots are filled in with the given element. O(n).

shiftL :: Word128 -> Int -> Word128

basement Basement.Types.Word128

Bitwise Shift Left

shiftL :: Word256 -> Int -> Word256

basement Basement.Types.Word256

Bitwise Shift Left

shiftL :: Wrd n -> Int -> Wrd n

bin Data.Wrd

shiftL :: Bits a => a -> Int -> a

hmpfr Data.Number.MPFR.Internal

Shift the argument left by the specified number of bits (which must be non-negative). An instance can define either this and shiftR or the unified shift, depending on which is more convenient for the type in question.