Safe Haskell	None
Language	Haskell2010

Data.Bit

Synopsis

newtype Bit = Bit {
- unBit :: Bool
}

Documentation

newtype Bit Source #

A newtype wrapper with a custom instance of Data.Vector.Unboxed, which packs booleans as efficient as possible (8 values per byte). Vectors of Bit use 8x less memory than vectors of Bool (which stores one value per byte), but random writes are slightly slower.

In addition to Data.Vector.Unboxed interface, one can also find assorted utilities from Data.Vector.Unboxed.Bit and Data.Vector.Unboxed.Mutable.Bit.

Constructors

Bit
Fields unBit :: Bool

Instances

Bounded Bit Source #
Instance details Defined in Data.Bit.Internal Methods minBound :: Bit # maxBound :: Bit #
Enum Bit Source #
Instance details Defined in Data.Bit.Internal Methods succ :: Bit -> Bit # pred :: Bit -> Bit # toEnum :: Int -> Bit # fromEnum :: Bit -> Int # enumFrom :: Bit -> [Bit] # enumFromThen :: Bit -> Bit -> [Bit] # enumFromTo :: Bit -> Bit -> [Bit] # enumFromThenTo :: Bit -> Bit -> Bit -> [Bit] #
Eq Bit Source #
Instance details Defined in Data.Bit.Internal Methods (==) :: Bit -> Bit -> Bool # (/=) :: Bit -> Bit -> Bool #
Ord Bit Source #
Instance details Defined in Data.Bit.Internal Methods compare :: Bit -> Bit -> Ordering # (<) :: Bit -> Bit -> Bool # (<=) :: Bit -> Bit -> Bool # (>) :: Bit -> Bit -> Bool # (>=) :: Bit -> Bit -> Bool # max :: Bit -> Bit -> Bit # min :: Bit -> Bit -> Bit #
Read Bit Source #
Instance details Defined in Data.Bit.Internal Methods readsPrec :: Int -> ReadS Bit # readList :: ReadS [Bit] # readPrec :: ReadPrec Bit # readListPrec :: ReadPrec [Bit] #
Show Bit Source #
Instance details Defined in Data.Bit.Internal Methods showsPrec :: Int -> Bit -> ShowS # show :: Bit -> String # showList :: [Bit] -> ShowS #
Bits Bit Source #
Instance details Defined in Data.Bit.Internal Methods (.&.) :: Bit -> Bit -> Bit # (.\|.) :: Bit -> Bit -> Bit # xor :: Bit -> Bit -> Bit # complement :: Bit -> Bit # shift :: Bit -> Int -> Bit # rotate :: Bit -> Int -> Bit # zeroBits :: Bit # bit :: Int -> Bit # setBit :: Bit -> Int -> Bit # clearBit :: Bit -> Int -> Bit # complementBit :: Bit -> Int -> Bit # testBit :: Bit -> Int -> Bool # bitSizeMaybe :: Bit -> Maybe Int # bitSize :: Bit -> Int # isSigned :: Bit -> Bool # shiftL :: Bit -> Int -> Bit # unsafeShiftL :: Bit -> Int -> Bit # shiftR :: Bit -> Int -> Bit # unsafeShiftR :: Bit -> Int -> Bit # rotateL :: Bit -> Int -> Bit # rotateR :: Bit -> Int -> Bit # popCount :: Bit -> Int #
FiniteBits Bit Source #
Instance details Defined in Data.Bit.Internal Methods finiteBitSize :: Bit -> Int # countLeadingZeros :: Bit -> Int # countTrailingZeros :: Bit -> Int #
Unbox Bit Source #
Instance details Defined in Data.Vector.Unboxed.Bit.Internal
Vector Vector Bit Source #
Instance details Defined in Data.Vector.Unboxed.Bit.Internal Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Bit -> m (Vector Bit) # basicUnsafeThaw :: PrimMonad m => Vector Bit -> m (Mutable Vector (PrimState m) Bit) # basicLength :: Vector Bit -> Int # basicUnsafeSlice :: Int -> Int -> Vector Bit -> Vector Bit # basicUnsafeIndexM :: Monad m => Vector Bit -> Int -> m Bit # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Bit -> Vector Bit -> m () # elemseq :: Vector Bit -> Bit -> b -> b #
MVector MVector Bit Source #
Instance details Defined in Data.Vector.Unboxed.Bit.Internal Methods basicLength :: MVector s Bit -> Int # basicUnsafeSlice :: Int -> Int -> MVector s Bit -> MVector s Bit # basicOverlaps :: MVector s Bit -> MVector s Bit -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Bit) # basicInitialize :: PrimMonad m => MVector (PrimState m) Bit -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> Bit -> m (MVector (PrimState m) Bit) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Bit -> Int -> m Bit # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Bit -> Int -> Bit -> m () # basicClear :: PrimMonad m => MVector (PrimState m) Bit -> m () # basicSet :: PrimMonad m => MVector (PrimState m) Bit -> Bit -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Bit -> MVector (PrimState m) Bit -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Bit -> MVector (PrimState m) Bit -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Bit -> Int -> m (MVector (PrimState m) Bit) #
data Vector Bit Source #
Instance details Defined in Data.Vector.Unboxed.Bit.Internal data Vector Bit = BitVec !Int !Int !(Vector Word)
data MVector s Bit Source #
Instance details Defined in Data.Vector.Unboxed.Bit.Internal data MVector s Bit = BitMVec !Int !Int !(MVector s Word)