Safe Haskell  None 

Language  Haskell2010 
Fast, packed, lazy bit streams (i.e. list of Bool
s) with
semiautomatic stream fusion.
This module is intended to be imported qualified
, to avoid name
clashes with Prelude functions. e.g.
import qualified Data.BitStream.Lazy as LS
Lazy Bitstream
s are made of possibly infinite list of strict
Bitstream
s as chunks, and each chunks have at least 1 bit.
 data Bitstream d
 data Left
 data Right
 empty :: Bitstream α => α
 (∅) :: Bitstream α => α
 singleton :: Bitstream α => Bool > α
 pack :: Bitstream α => [Bool] > α
 unpack :: Bitstream α => α > [Bool]
 fromChunks :: Bitstream (Bitstream d) => [Bitstream d] > Bitstream d
 toChunks :: Bitstream d > [Bitstream d]
 fromByteString :: Bitstream (Bitstream d) => ByteString > Bitstream d
 toByteString :: (Bitstream (Bitstream d), Bitstream (Packet d)) => Bitstream d > ByteString
 fromBits :: (Integral β, FiniteBits β, Bitstream α) => β > α
 fromNBits :: (Integral n, Integral β, Bits β, Bitstream α) => n > β > α
 toBits :: (Bitstream α, Integral β, Bits β) => α > β
 stream :: Bitstream α => α > Stream Bool
 unstream :: Bitstream α => Stream Bool > α
 directionLToR :: Bitstream Left > Bitstream Right
 directionRToL :: Bitstream Right > Bitstream Left
 cons :: Bitstream α => Bool > α > α
 cons' :: Bitstream α => Bool > α > α
 snoc :: Bitstream α => α > Bool > α
 append :: Bitstream α => α > α > α
 (⧺) :: Bitstream α => α > α > α
 head :: Bitstream α => α > Bool
 last :: Bitstream α => α > Bool
 tail :: Bitstream α => α > α
 init :: Bitstream α => α > α
 null :: Bitstream α => α > Bool
 length :: Bitstream α => Num n => α > n
 map :: Bitstream α => (Bool > Bool) > α > α
 reverse :: Bitstream α => α > α
 foldl :: Bitstream α => (β > Bool > β) > β > α > β
 foldl' :: Bitstream α => (β > Bool > β) > β > α > β
 foldl1 :: Bitstream α => (Bool > Bool > Bool) > α > Bool
 foldl1' :: Bitstream α => (Bool > Bool > Bool) > α > Bool
 foldr :: Bitstream α => (Bool > β > β) > β > α > β
 foldr1 :: Bitstream α => (Bool > Bool > Bool) > α > Bool
 concat :: Bitstream α => [α] > α
 concatMap :: Bitstream α => (Bool > α) > α > α
 and :: Bitstream α => α > Bool
 or :: Bitstream α => α > Bool
 any :: Bitstream α => (Bool > Bool) > α > Bool
 all :: Bitstream α => (Bool > Bool) > α > Bool
 scanl :: Bitstream α => (Bool > Bool > Bool) > Bool > α > α
 scanl1 :: Bitstream α => (Bool > Bool > Bool) > α > α
 scanr :: Bitstream α => (Bool > Bool > Bool) > Bool > α > α
 scanr1 :: Bitstream α => (Bool > Bool > Bool) > α > α
 iterate :: Bitstream (Packet d) => (Bool > Bool) > Bool > Bitstream d
 repeat :: Bitstream (Packet d) => Bool > Bitstream d
 replicate :: (Integral n, Bitstream α) => n > Bool > α
 cycle :: Bitstream (Bitstream d) => Bitstream d > Bitstream d
 unfoldr :: Bitstream α => (β > Maybe (Bool, β)) > β > α
 unfoldrN :: (Integral n, Bitstream α) => n > (β > Maybe (Bool, β)) > β > α
 take :: (Integral n, Bitstream α) => n > α > α
 drop :: (Integral n, Bitstream α) => n > α > α
 takeWhile :: Bitstream α => (Bool > Bool) > α > α
 dropWhile :: Bitstream α => (Bool > Bool) > α > α
 span :: Bitstream α => (Bool > Bool) > α > (α, α)
 break :: Bitstream α => (Bool > Bool) > α > (α, α)
 elem :: Bitstream α => Bool > α > Bool
 (∈) :: Bitstream α => Bool > α > Bool
 (∋) :: Bitstream α => α > Bool > Bool
 notElem :: Bitstream α => Bool > α > Bool
 (∉) :: Bitstream α => Bool > α > Bool
 (∌) :: Bitstream α => α > Bool > Bool
 find :: Bitstream α => (Bool > Bool) > α > Maybe Bool
 filter :: Bitstream α => (Bool > Bool) > α > α
 partition :: Bitstream α => (Bool > Bool) > α > (α, α)
 (!!) :: (Bitstream α, Integral n, Show n) => α > n > Bool
 elemIndex :: (Bitstream α, Integral n) => Bool > α > Maybe n
 elemIndices :: (Bitstream α, Integral n) => Bool > α > [n]
 findIndex :: (Bitstream α, Integral n) => (Bool > Bool) > α > Maybe n
 findIndices :: (Bitstream α, Integral n) => (Bool > Bool) > α > [n]
 zip :: Bitstream α => α > α > [(Bool, Bool)]
 zip3 :: Bitstream α => α > α > α > [(Bool, Bool, Bool)]
 zip4 :: Bitstream α => α > α > α > α > [(Bool, Bool, Bool, Bool)]
 zip5 :: Bitstream α => α > α > α > α > α > [(Bool, Bool, Bool, Bool, Bool)]
 zip6 :: Bitstream α => α > α > α > α > α > α > [(Bool, Bool, Bool, Bool, Bool, Bool)]
 zipWith :: Bitstream α => (Bool > Bool > β) > α > α > [β]
 zipWith3 :: Bitstream α => (Bool > Bool > Bool > β) > α > α > α > [β]
 zipWith4 :: Bitstream α => (Bool > Bool > Bool > Bool > β) > α > α > α > α > [β]
 zipWith5 :: Bitstream α => (Bool > Bool > Bool > Bool > Bool > β) > α > α > α > α > α > [β]
 zipWith6 :: Bitstream α => (Bool > Bool > Bool > Bool > Bool > Bool > β) > α > α > α > α > α > α > [β]
 unzip :: Bitstream α => [(Bool, Bool)] > (α, α)
 unzip3 :: Bitstream α => [(Bool, Bool, Bool)] > (α, α, α)
 unzip4 :: Bitstream α => [(Bool, Bool, Bool, Bool)] > (α, α, α, α)
 unzip5 :: Bitstream α => [(Bool, Bool, Bool, Bool, Bool)] > (α, α, α, α, α)
 unzip6 :: Bitstream α => [(Bool, Bool, Bool, Bool, Bool, Bool)] > (α, α, α, α, α, α)
 getContents :: Bitstream (Bitstream d) => IO (Bitstream d)
 putBits :: (Bitstream (Bitstream d), Bitstream (Packet d)) => Bitstream d > IO ()
 interact :: (Bitstream (Bitstream d), Bitstream (Packet d)) => (Bitstream d > Bitstream d) > IO ()
 readFile :: Bitstream (Bitstream d) => FilePath > IO (Bitstream d)
 writeFile :: (Bitstream (Bitstream d), Bitstream (Packet d)) => FilePath > Bitstream d > IO ()
 appendFile :: (Bitstream (Bitstream d), Bitstream (Packet d)) => FilePath > Bitstream d > IO ()
 hGetContents :: Bitstream (Bitstream d) => Handle > IO (Bitstream d)
 hGet :: Bitstream (Bitstream d) => Handle > Int > IO (Bitstream d)
 hGetNonBlocking :: (Bitstream (Bitstream d), Bitstream (Packet d)) => Handle > Int > IO (Bitstream d)
 hPut :: (Bitstream (Bitstream d), Bitstream (Packet d)) => Handle > Bitstream d > IO ()
Data types
A spaceefficient representation of a Bool
vector, supporting
many efficient operations. Bitstream
s have an idea of
directions controlling how octets are interpreted as bits. There
are two types of concrete Bitstream
s:
and
Bitstream
Left
.Bitstream
Right
Bitstream (Bitstream d) => Eq (Bitstream d)  
Bitstream (Bitstream d) => Ord (Bitstream d) 
let x = 
Show (Packet d) => Show (Bitstream d)  
Bitstream (Bitstream d) => Monoid (Bitstream d) 

Bitstream (Bitstream Right)  
Bitstream (Bitstream Left) 
Left
bitstreams interpret an octet as a vector of bits whose
LSB comes first and MSB comes last e.g.
 11110000 => [False, False, False, False, True, True , True , True]
 10010100 => [False, False, True , False, True, False, False, True]
Bits
operations (like toBits
) treat a Left
bitstream as a
littleendian integer.
Right
bitstreams interpret an octet as a vector of bits whose
MSB comes first and LSB comes last e.g.
 11110000 => [True, True , True , True, False, False, False, False]
 10010100 => [True, False, False, True, False, True , False, False]
Bits
operations (like toBits
) treat a Right
bitstream as a
bigendian integer.
Introducing and eliminating Bitstream
s
Converting from/to lazy ByteString
s
fromByteString :: Bitstream (Bitstream d) => ByteString > Bitstream d Source
O(n) Convert a lazy ByteString
into a lazy Bitstream
.
toByteString :: (Bitstream (Bitstream d), Bitstream (Packet d)) => Bitstream d > ByteString Source
O(n)
converts a lazy toByteString
bitsBitstream
bits
into a lazy ByteString
. The resulting octets will be padded
with zeroes if bs
is finite and its length
is not multiple of
8.
Converting from/to Bits'
fromBits :: (Integral β, FiniteBits β, Bitstream α) => β > α Source
O(n) Convert a FiniteBits
into a Bitstream
.
Converting from/to Stream
s
stream :: Bitstream α => α > Stream Bool Source
O(n) Explicitly convert a Bitstream
into a Stream
of
Bool
.
Bitstream
operations are automatically fused whenever it's
possible, safe, and effective to do so, but sometimes you may find
the rules are too conservative. These two functions stream
and
unstream
provide a means for coercive stream fusion.
You should be careful when you use stream
. Most functions in this
package are optimised to minimise frequency of memory allocations
and copyings, but getting Bitstream
s back from
requires the whole Stream
Bool
Bitstream
to be constructed from
scratch. Moreover, for lazy Bitstream
s this leads to be an
incorrect strictness behaviour because lazy Bitstream
s are
represented as lists of strict Bitstream
chunks but stream
can't preserve the original chunk structure. Let's say you have a
lazy Bitstream
with the following chunks:
bs = [chunk1, chunk2, chunk3, ...]
and you want to drop the first bit of such stream. Our tail
is
only strict on the chunk1
and will produce the following chunks:
tail
bs = [chunk0, chunk1', chunk2, chunk3, ...]
where chunk0
is a singleton vector of the first packet of
chunk1
whose first bit is dropped, and chunk1'
is a vector of
remaining packets of the chunk1
. Neither chunk2
nor chunk3
have to be evaluated here as you might expect.
But think about the following expression:
import qualified Data.Vector.Fusion.Stream as Streamunstream
$ Stream.tail $stream
bs
the resulting chunk structure will be:
[chunk1', chunk2', chunk3', ...]
where each and every chunks are slightly different from the
original chunks, and this time chunk1'
has the same length as
chunk1
but the last bit of chunk1'
is from the first bit of
chunk2
. This means when you next time apply some functions strict
on the first chunk, you end up fully evaluating chunk2
as well as
chunk1
and this can be a serious misbehaviour for lazy
Bitstream
s.
The automatic fusion rules are carefully designed to fire only when there aren't any reason to preserve the original packet / chunk structure.
Changing bit order in octets
directionLToR :: Bitstream Left > Bitstream Right Source
O(n) Convert a
into a Bitstream
Left
. Bit directions only affect octetbased operations such as
Bitstream
Right
toByteString
.
directionRToL :: Bitstream Right > Bitstream Left Source
O(n) Convert a
into a Bitstream
Right
. Bit directions only affect octetbased operations such as
Bitstream
Left
toByteString
.
Basic interface
cons :: Bitstream α => Bool > α > α Source
strict: O(n), lazy: O(1) cons
is an analogous to (:
) for
lists.
cons' :: Bitstream α => Bool > α > α Source
O(n) For strict Bitstream
s, cons'
is exactly the same as
cons
.
For lazy ones, cons'
is strict in the Bitstream
we are consing
onto. More precisely, it forces the first chunk to be evaluated. It
does this because, for space efficiency, it may coalesce the new
bit onto the first chunk rather than starting a new chunk.
head :: Bitstream α => α > Bool Source
O(1) Extract the first bit of a nonempty Bitstream
. An
exception will be thrown if empty.
last :: Bitstream α => α > Bool Source
strict: O(1), lazy: O(n) Extract the last bit of a finite
Bitstream
. An exception will be thrown if empty.
init :: Bitstream α => α > α Source
O(n) Return all the bits of a Bitstream
except the last
one. An exception will be thrown if empty.
length :: Bitstream α => Num n => α > n Source
strict: O(1), lazy: O(n) Return the length of a finite
Bitstream
.
Transforming Bitstream
s
Reducing Bitstream
s
foldl1' :: Bitstream α => (Bool > Bool > Bool) > α > Bool Source
O(n) A strict version of foldl1
.
Special folds
concatMap :: Bitstream α => (Bool > α) > α > α Source
Map a function over a Bitstream
and concatenate the results.
Building Bitstream
s
Scans
Replications
Unfolding
unfoldr :: Bitstream α => (β > Maybe (Bool, β)) > β > α Source
O(n) The unfoldr
function is a `dual' to foldr
: while
foldr
reduces a Bitstream
to a summary value, unfoldr
builds
a Bitstream
from a seed value. The function takes the element and
returns Nothing
if it is done producing the Bitstream
or
returns Just
(a, b)
, in which case, a
is a prepended to the
Bitstream
and b
is used as the next element in a recursive
call.
Substreams
Searching streams
Searching by equality
(∌) :: Bitstream α => α > Bool > Bool infix 4 Source
(∌) = flip
(∉)
U+220C, DOES NOT CONTAIN AS MEMBER
Searching with a predicate
Indexing streams
(!!) :: (Bitstream α, Integral n, Show n) => α > n > Bool infixl 9 Source
O(n) Bitstream
index (subscript) operator, starting from 0.
elemIndices :: (Bitstream α, Integral n) => Bool > α > [n] Source
O(n) The elemIndices
function extends elemIndex
, by
returning the indices of all bits equal to the query bit, in
ascending order.
findIndices :: (Bitstream α, Integral n) => (Bool > Bool) > α > [n] Source
O(n) The findIndices
function extends findIndex
, by
returning the indices of all bits satisfying the predicate, in
ascending order.
Zipping and unzipping streams
zipWith5 :: Bitstream α => (Bool > Bool > Bool > Bool > Bool > β) > α > α > α > α > α > [β] Source
zipWith6 :: Bitstream α => (Bool > Bool > Bool > Bool > Bool > Bool > β) > α > α > α > α > α > α > [β] Source
I/O with Bitstream
s
Standard input and output
getContents :: Bitstream (Bitstream d) => IO (Bitstream d) Source
O(n) getContents
is equivalent to hGetContents
stdin
. Will read lazily.
interact :: (Bitstream (Bitstream d), Bitstream (Packet d)) => (Bitstream d > Bitstream d) > IO () Source
Files
readFile :: Bitstream (Bitstream d) => FilePath > IO (Bitstream d) Source
O(n) Read an entire file lazily into a Bitstream
.
writeFile :: (Bitstream (Bitstream d), Bitstream (Packet d)) => FilePath > Bitstream d > IO () Source
O(n) Write a Bitstream
to a file.
appendFile :: (Bitstream (Bitstream d), Bitstream (Packet d)) => FilePath > Bitstream d > IO () Source
O(n) Append a Bitstream
to a file.
I/O with Handle
s
hGet :: Bitstream (Bitstream d) => Handle > Int > IO (Bitstream d) Source
reads a hGet
h nBitstream
directly from the specified
Handle
h
. First argument h
is the Handle
to read from, and
the second n
is the number of octets to read, not bits. It
returns the octets read, up to n
, or null if EOF has been
reached.
If the handle is a pipe or socket, and the writing end is closed,
hGet
will behave as if EOF was reached.