Safe Haskell	Safe-Inferred
Language	GHC2021

Data.Monoid.BitAnd

Synopsis

newtype BitAnd a = BitAnd {
- getBitAnd :: a
}

Documentation

newtype BitAnd a Source #

>>> mempty :: BitAnd Int
BitAnd {getBitAnd = -1}
>>> mempty :: BitAnd Word
BitAnd {getBitAnd = 18446744073709551615}

Constructors

BitAnd
Fields getBitAnd :: a

Instances

Instances details

Unbox a => Vector Vector (BitAnd a) Source #
Instance details Defined in Data.Monoid.BitAnd Methods basicUnsafeFreeze :: Mutable Vector s (BitAnd a) -> ST s (Vector (BitAnd a)) basicUnsafeThaw :: Vector (BitAnd a) -> ST s (Mutable Vector s (BitAnd a)) basicLength :: Vector (BitAnd a) -> Int basicUnsafeSlice :: Int -> Int -> Vector (BitAnd a) -> Vector (BitAnd a) basicUnsafeIndexM :: Vector (BitAnd a) -> Int -> Box (BitAnd a) basicUnsafeCopy :: Mutable Vector s (BitAnd a) -> Vector (BitAnd a) -> ST s () elemseq :: Vector (BitAnd a) -> BitAnd a -> b -> b
Unbox a => MVector MVector (BitAnd a) Source #
Instance details Defined in Data.Monoid.BitAnd Methods basicLength :: MVector s (BitAnd a) -> Int basicUnsafeSlice :: Int -> Int -> MVector s (BitAnd a) -> MVector s (BitAnd a) basicOverlaps :: MVector s (BitAnd a) -> MVector s (BitAnd a) -> Bool basicUnsafeNew :: Int -> ST s (MVector s (BitAnd a)) basicInitialize :: MVector s (BitAnd a) -> ST s () basicUnsafeReplicate :: Int -> BitAnd a -> ST s (MVector s (BitAnd a)) basicUnsafeRead :: MVector s (BitAnd a) -> Int -> ST s (BitAnd a) basicUnsafeWrite :: MVector s (BitAnd a) -> Int -> BitAnd a -> ST s () basicClear :: MVector s (BitAnd a) -> ST s () basicSet :: MVector s (BitAnd a) -> BitAnd a -> ST s () basicUnsafeCopy :: MVector s (BitAnd a) -> MVector s (BitAnd a) -> ST s () basicUnsafeMove :: MVector s (BitAnd a) -> MVector s (BitAnd a) -> ST s () basicUnsafeGrow :: MVector s (BitAnd a) -> Int -> ST s (MVector s (BitAnd a))
Bits a => Monoid (BitAnd a) Source #
Instance details Defined in Data.Monoid.BitAnd Methods mempty :: BitAnd a # mappend :: BitAnd a -> BitAnd a -> BitAnd a # mconcat :: [BitAnd a] -> BitAnd a #
Bits a => Semigroup (BitAnd a) Source #
Instance details Defined in Data.Monoid.BitAnd Methods (<>) :: BitAnd a -> BitAnd a -> BitAnd a # sconcat :: NonEmpty (BitAnd a) -> BitAnd a # stimes :: Integral b => b -> BitAnd a -> BitAnd a #
Show a => Show (BitAnd a) Source #
Instance details Defined in Data.Monoid.BitAnd Methods showsPrec :: Int -> BitAnd a -> ShowS # show :: BitAnd a -> String # showList :: [BitAnd a] -> ShowS #
Eq a => Eq (BitAnd a) Source #
Instance details Defined in Data.Monoid.BitAnd Methods (==) :: BitAnd a -> BitAnd a -> Bool # (/=) :: BitAnd a -> BitAnd a -> Bool #
Unbox a => Unbox (BitAnd a) Source #
Instance details Defined in Data.Monoid.BitAnd
newtype MVector s (BitAnd a) Source #
Instance details Defined in Data.Monoid.BitAnd newtype MVector s (BitAnd a) = MV_BitAnd (MVector s a)
newtype Vector (BitAnd a) Source #
Instance details Defined in Data.Monoid.BitAnd newtype Vector (BitAnd a) = V_BitAnd (Vector a)