Safe Haskell	None
Language	Haskell2010

Data.BitString.BigEndian

Description

Lazy, big-endian bitstrings, somewhat similar to lazy bytestrings.

In this context, "big-endian" means that the bits in the bytes are in the opposite order than what would be logical. If you ask me, this is doesn't make too much sense, but this convention apparently still have usage...

This module is intended to be imported qualified.

Synopsis

data BitString
empty :: BitString
bitString :: ByteString -> BitString
bitStringLazy :: ByteString -> BitString
unsafeBitString' :: Int64 -> Int64 -> ByteString -> BitString
showBitString :: BitString -> String
debugShowBitString :: BitString -> String
take :: Int64 -> BitString -> BitString
drop :: Int64 -> BitString -> BitString
splitAt :: Int64 -> BitString -> (BitString, BitString)
append :: BitString -> BitString -> BitString
concat :: [BitString] -> BitString
toList :: BitString -> [Bool]
fromList :: [Bool] -> BitString
to01List :: BitString -> [Word8]
from01List :: [Word8] -> BitString
null :: BitString -> Bool
length :: BitString -> Int64
foldl' :: (a -> Bool -> a) -> a -> BitString -> a
findSubstring :: BitString -> BitString -> Maybe Int64
realizeBitStringLazy :: BitString -> ByteString
realizeBitStringStrict :: BitString -> ByteString
realizeBitString' :: BitString -> [ByteString]

Documentation

data BitString Source #

Instances

Instances details

Show BitString Source #
Instance details Defined in Data.BitString.BigEndian Methods showsPrec :: Int -> BitString -> ShowS # show :: BitString -> String # showList :: [BitString] -> ShowS #
Eq BitString Source #	warning! very slow! TODO: make a better routine
Instance details Defined in Data.BitString.BigEndian Methods (==) :: BitString -> BitString -> Bool # (/=) :: BitString -> BitString -> Bool #