<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<!--Rendered using the Haskell Html Library v0.2-->
<HTML
><HEAD
><META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=UTF-8"
><TITLE
>Data.ByteString</TITLE
><LINK HREF="haddock.css" REL="stylesheet" TYPE="text/css"
><SCRIPT SRC="haddock-util.js" TYPE="text/javascript"
></SCRIPT
><SCRIPT TYPE="text/javascript"
>window.onload = function () {setSynopsis("mini_Data-ByteString.html")};</SCRIPT
></HEAD
><BODY
><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD CLASS="topbar"
><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD
><IMG SRC="haskell_icon.gif" WIDTH="16" HEIGHT="16" ALT=" "
></TD
><TD CLASS="title"
>bytestring-0.9.1.4: Fast, packed, strict and lazy byte arrays with a list interface</TD
><TD CLASS="topbut"
><A HREF="index.html"
>Contents</A
></TD
><TD CLASS="topbut"
><A HREF="doc-index.html"
>Index</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="modulebar"
><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD
><FONT SIZE="6"
>Data.ByteString</FONT
></TD
><TD ALIGN="right"
><TABLE CLASS="narrow" CELLSPACING="0" CELLPADDING="0"
><TR
><TD CLASS="infohead"
>Portability</TD
><TD CLASS="infoval"
>portable</TD
></TR
><TR
><TD CLASS="infohead"
>Stability</TD
><TD CLASS="infoval"
>experimental</TD
></TR
><TR
><TD CLASS="infohead"
>Maintainer</TD
><TD CLASS="infoval"
>dons@cse.unsw.edu.au</TD
></TR
></TABLE
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD
><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD CLASS="section4"
><B
>Contents</B
></TD
></TR
><TR
><TD
><DL
><DT
><A HREF="#1"
>The <TT
>ByteString</TT
> type
</A
></DT
><DT
><A HREF="#2"
>Introducing and eliminating <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
>s
</A
></DT
><DT
><A HREF="#3"
>Basic interface
</A
></DT
><DT
><A HREF="#4"
>Transforming ByteStrings
</A
></DT
><DT
><A HREF="#5"
>Reducing <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
>s (folds)
</A
></DT
><DD
><DL
><DT
><A HREF="#6"
>Special folds
</A
></DT
></DL
></DD
><DT
><A HREF="#7"
>Building ByteStrings
</A
></DT
><DD
><DL
><DT
><A HREF="#8"
>Scans
</A
></DT
><DT
><A HREF="#9"
>Accumulating maps
</A
></DT
><DT
><A HREF="#10"
>Generating and unfolding ByteStrings
</A
></DT
></DL
></DD
><DT
><A HREF="#11"
>Substrings
</A
></DT
><DD
><DL
><DT
><A HREF="#12"
>Breaking strings
</A
></DT
><DT
><A HREF="#13"
>Breaking into many substrings
</A
></DT
></DL
></DD
><DT
><A HREF="#14"
>Predicates
</A
></DT
><DD
><DL
><DT
><A HREF="#15"
>Search for arbitrary substrings
</A
></DT
></DL
></DD
><DT
><A HREF="#16"
>Searching ByteStrings
</A
></DT
><DD
><DL
><DT
><A HREF="#17"
>Searching by equality
</A
></DT
><DT
><A HREF="#18"
>Searching with a predicate
</A
></DT
></DL
></DD
><DT
><A HREF="#19"
>Indexing ByteStrings
</A
></DT
><DT
><A HREF="#20"
>Zipping and unzipping ByteStrings
</A
></DT
><DT
><A HREF="#21"
>Ordered ByteStrings
</A
></DT
><DT
><A HREF="#22"
>Low level conversions
</A
></DT
><DD
><DL
><DT
><A HREF="#23"
>Copying ByteStrings
</A
></DT
><DT
><A HREF="#24"
>Packing <TT
><A HREF="../base/Foreign-C-String.html#t%3ACString"
>CString</A
></TT
>s and pointers
</A
></DT
><DT
><A HREF="#25"
>Using ByteStrings as <TT
><A HREF="../base/Foreign-C-String.html#t%3ACString"
>CString</A
></TT
>s
</A
></DT
></DL
></DD
><DT
><A HREF="#26"
>I/O with <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
>s
</A
></DT
><DD
><DL
><DT
><A HREF="#27"
>Standard input and output
</A
></DT
><DT
><A HREF="#28"
>Files
</A
></DT
><DT
><A HREF="#29"
>I/O with Handles
</A
></DT
></DL
></DD
></DL
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
>Description</TD
></TR
><TR
><TD CLASS="doc"
><P
>A time and space-efficient implementation of byte vectors using
packed Word8 arrays, suitable for high performance use, both in terms
of large data quantities, or high speed requirements. Byte vectors
are encoded as strict <TT
><A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
></TT
> arrays of bytes, held in a <TT
><A HREF="../base/Foreign-ForeignPtr.html#t%3AForeignPtr"
>ForeignPtr</A
></TT
>,
and can be passed between C and Haskell with little effort.
</P
><P
>This module is intended to be imported <TT
>qualified</TT
>, to avoid name
clashes with <A HREF="Prelude.html"
>Prelude</A
> functions. eg.
</P
><PRE
> import qualified Data.ByteString as B
</PRE
><P
>Original GHC implementation by Bryan O'Sullivan.
Rewritten to use Data.Array.Unboxed.UArray by Simon Marlow.
Rewritten to support slices and use <TT
><A HREF="../base/Foreign-ForeignPtr.html#t%3AForeignPtr"
>ForeignPtr</A
></TT
> by David Roundy.
Polished and extended by Don Stewart.
</P
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
>Synopsis</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="body"
><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD CLASS="decl"
><SPAN CLASS="keyword"
>data</SPAN
> <A HREF="#t%3AByteString"
>ByteString</A
> </TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Aempty"
>empty</A
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Asingleton"
>singleton</A
> :: <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Apack"
>pack</A
> :: [<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>] -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Aunpack"
>unpack</A
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> [<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Acons"
>cons</A
> :: <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Asnoc"
>snoc</A
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Aappend"
>append</A
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Ahead"
>head</A
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Auncons"
>uncons</A
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/Data-Maybe.html#t%3AMaybe"
>Maybe</A
> (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>, <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>)</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Alast"
>last</A
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Atail"
>tail</A
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Ainit"
>init</A
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Anull"
>null</A
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Alength"
>length</A
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Amap"
>map</A
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Areverse"
>reverse</A
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Aintersperse"
>intersperse</A
> :: <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Aintercalate"
>intercalate</A
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> [<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>] -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Atranspose"
>transpose</A
> :: [<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>] -> [<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Afoldl"
>foldl</A
> :: (a -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> a) -> a -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> a</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Afoldl%27"
>foldl'</A
> :: (a -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> a) -> a -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> a</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Afoldl1"
>foldl1</A
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Afoldl1%27"
>foldl1'</A
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Afoldr"
>foldr</A
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> a -> a) -> a -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> a</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Afoldr%27"
>foldr'</A
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> a -> a) -> a -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> a</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Afoldr1"
>foldr1</A
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Afoldr1%27"
>foldr1'</A
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Aconcat"
>concat</A
> :: [<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>] -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AconcatMap"
>concatMap</A
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Aany"
>any</A
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Aall"
>all</A
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Amaximum"
>maximum</A
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Aminimum"
>minimum</A
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Ascanl"
>scanl</A
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>) -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Ascanl1"
>scanl1</A
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Ascanr"
>scanr</A
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>) -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Ascanr1"
>scanr1</A
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AmapAccumL"
>mapAccumL</A
> :: (acc -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> (acc, <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>)) -> acc -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> (acc, <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>)</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AmapAccumR"
>mapAccumR</A
> :: (acc -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> (acc, <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>)) -> acc -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> (acc, <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>)</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Areplicate"
>replicate</A
> :: <A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Aunfoldr"
>unfoldr</A
> :: (a -> <A HREF="../base/Data-Maybe.html#t%3AMaybe"
>Maybe</A
> (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>, a)) -> a -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AunfoldrN"
>unfoldrN</A
> :: <A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
> -> (a -> <A HREF="../base/Data-Maybe.html#t%3AMaybe"
>Maybe</A
> (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>, a)) -> a -> (<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>, <A HREF="../base/Data-Maybe.html#t%3AMaybe"
>Maybe</A
> a)</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Atake"
>take</A
> :: <A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Adrop"
>drop</A
> :: <A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AsplitAt"
>splitAt</A
> :: <A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> (<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>, <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>)</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AtakeWhile"
>takeWhile</A
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AdropWhile"
>dropWhile</A
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Aspan"
>span</A
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> (<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>, <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>)</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AspanEnd"
>spanEnd</A
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> (<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>, <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>)</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Abreak"
>break</A
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> (<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>, <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>)</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AbreakEnd"
>breakEnd</A
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> (<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>, <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>)</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Agroup"
>group</A
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> [<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AgroupBy"
>groupBy</A
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> [<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Ainits"
>inits</A
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> [<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Atails"
>tails</A
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> [<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Asplit"
>split</A
> :: <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> [<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AsplitWith"
>splitWith</A
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> [<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AisPrefixOf"
>isPrefixOf</A
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AisSuffixOf"
>isSuffixOf</A
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AisInfixOf"
>isInfixOf</A
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AbreakSubstring"
>breakSubstring</A
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> (<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>, <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>)</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AfindSubstring"
>findSubstring</A
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/Data-Maybe.html#t%3AMaybe"
>Maybe</A
> <A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AfindSubstrings"
>findSubstrings</A
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> [<A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
>]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Aelem"
>elem</A
> :: <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AnotElem"
>notElem</A
> :: <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Afind"
>find</A
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/Data-Maybe.html#t%3AMaybe"
>Maybe</A
> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Afilter"
>filter</A
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Apartition"
>partition</A
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> (<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>, <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>)</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Aindex"
>index</A
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AelemIndex"
>elemIndex</A
> :: <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/Data-Maybe.html#t%3AMaybe"
>Maybe</A
> <A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AelemIndices"
>elemIndices</A
> :: <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> [<A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
>]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AelemIndexEnd"
>elemIndexEnd</A
> :: <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/Data-Maybe.html#t%3AMaybe"
>Maybe</A
> <A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AfindIndex"
>findIndex</A
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/Data-Maybe.html#t%3AMaybe"
>Maybe</A
> <A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AfindIndices"
>findIndices</A
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> [<A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
>]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Acount"
>count</A
> :: <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Azip"
>zip</A
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> [(<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>, <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>)]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AzipWith"
>zipWith</A
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> a) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> [a]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Aunzip"
>unzip</A
> :: [(<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>, <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>)] -> (<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>, <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>)</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Asort"
>sort</A
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Acopy"
>copy</A
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3ApackCString"
>packCString</A
> :: <A HREF="../base/Foreign-C-String.html#t%3ACString"
>CString</A
> -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3ApackCStringLen"
>packCStringLen</A
> :: <A HREF="../base/Foreign-C-String.html#t%3ACStringLen"
>CStringLen</A
> -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AuseAsCString"
>useAsCString</A
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> (<A HREF="../base/Foreign-C-String.html#t%3ACString"
>CString</A
> -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> a) -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> a</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AuseAsCStringLen"
>useAsCStringLen</A
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> (<A HREF="../base/Foreign-C-String.html#t%3ACStringLen"
>CStringLen</A
> -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> a) -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> a</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AgetLine"
>getLine</A
> :: <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AgetContents"
>getContents</A
> :: <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AputStr"
>putStr</A
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="../ghc-prim/GHC-Unit.html#t%3A%28%29"
>()</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AputStrLn"
>putStrLn</A
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="../ghc-prim/GHC-Unit.html#t%3A%28%29"
>()</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Ainteract"
>interact</A
> :: (<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>) -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="../ghc-prim/GHC-Unit.html#t%3A%28%29"
>()</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AreadFile"
>readFile</A
> :: <A HREF="../base/System-IO.html#t%3AFilePath"
>FilePath</A
> -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AwriteFile"
>writeFile</A
> :: <A HREF="../base/System-IO.html#t%3AFilePath"
>FilePath</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="../ghc-prim/GHC-Unit.html#t%3A%28%29"
>()</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AappendFile"
>appendFile</A
> :: <A HREF="../base/System-IO.html#t%3AFilePath"
>FilePath</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="../ghc-prim/GHC-Unit.html#t%3A%28%29"
>()</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AhGetLine"
>hGetLine</A
> :: <A HREF="../base/System-IO.html#t%3AHandle"
>Handle</A
> -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AhGetContents"
>hGetContents</A
> :: <A HREF="../base/System-IO.html#t%3AHandle"
>Handle</A
> -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AhGet"
>hGet</A
> :: <A HREF="../base/System-IO.html#t%3AHandle"
>Handle</A
> -> <A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
> -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AhGetNonBlocking"
>hGetNonBlocking</A
> :: <A HREF="../base/System-IO.html#t%3AHandle"
>Handle</A
> -> <A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
> -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AhPut"
>hPut</A
> :: <A HREF="../base/System-IO.html#t%3AHandle"
>Handle</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="../ghc-prim/GHC-Unit.html#t%3A%28%29"
>()</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AhPutStr"
>hPutStr</A
> :: <A HREF="../base/System-IO.html#t%3AHandle"
>Handle</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="../ghc-prim/GHC-Unit.html#t%3A%28%29"
>()</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AhPutStrLn"
>hPutStrLn</A
> :: <A HREF="../base/System-IO.html#t%3AHandle"
>Handle</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="../ghc-prim/GHC-Unit.html#t%3A%28%29"
>()</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AbreakByte"
>breakByte</A
> :: <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> (<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>, <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>)</TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
><A NAME="1"
><A NAME="1"
>The <TT
>ByteString</TT
> type
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><SPAN CLASS="keyword"
>data</SPAN
> <A NAME="t:ByteString"
><A NAME="t%3AByteString"
></A
></A
><B
>ByteString</B
> </TD
></TR
><TR
><TD CLASS="body"
><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD CLASS="ndoc"
><P
>A space-efficient representation of a Word8 vector, supporting many
efficient operations. A <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
> contains 8-bit characters only.
</P
><P
>Instances of Eq, Ord, Read, Show, Data, Typeable
</P
></TD
></TR
><TR
><TD CLASS="section4"
><IMG SRC="minus.gif" CLASS="coll" ONCLICK="toggle(this,'i:ByteString')" ALT="show/hide"
> Instances</TD
></TR
><TR
><TD CLASS="body"
><DIV ID="i:ByteString" STYLE="display:block;"
><TABLE CLASS="vanilla" CELLSPACING="1" CELLPADDING="0"
><TR
><TD CLASS="decl"
><A HREF="../base/Data-Eq.html#t%3AEq"
>Eq</A
> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="../base/Data-Data.html#t%3AData"
>Data</A
> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="../base/Data-Ord.html#t%3AOrd"
>Ord</A
> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="../base/Text-Read.html#t%3ARead"
>Read</A
> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="../base/Text-Show.html#t%3AShow"
>Show</A
> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="../base/Data-Typeable.html#t%3ATypeable"
>Typeable</A
> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="../base/Data-String.html#t%3AIsString"
>IsString</A
> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="../base/Data-Monoid.html#t%3AMonoid"
>Monoid</A
> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
></TABLE
></DIV
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
><A NAME="2"
><A NAME="2"
>Introducing and eliminating <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
>s
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:empty"
><A NAME="v%3Aempty"
></A
></A
><B
>empty</B
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(1)</EM
> The empty <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
>
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:singleton"
><A NAME="v%3Asingleton"
></A
></A
><B
>singleton</B
> :: <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(1)</EM
> Convert a <TT
><A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
></TT
> into a <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
>
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:pack"
><A NAME="v%3Apack"
></A
></A
><B
>pack</B
> :: [<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>] -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
><P
><EM
>O(n)</EM
> Convert a '[Word8]' into a <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
>.
</P
><P
>For applications with large numbers of string literals, pack can be a
bottleneck. In such cases, consider using packAddress (GHC only).
</P
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:unpack"
><A NAME="v%3Aunpack"
></A
></A
><B
>unpack</B
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> [<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>]</TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(n)</EM
> Converts a <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
> to a '[Word8]'.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
><A NAME="3"
><A NAME="3"
>Basic interface
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:cons"
><A NAME="v%3Acons"
></A
></A
><B
>cons</B
> :: <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(n)</EM
> <TT
><A HREF="Data-ByteString.html#v%3Acons"
>cons</A
></TT
> is analogous to (:) for lists, but of different
complexity, as it requires a memcpy.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:snoc"
><A NAME="v%3Asnoc"
></A
></A
><B
>snoc</B
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(n)</EM
> Append a byte to the end of a <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
>
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:append"
><A NAME="v%3Aappend"
></A
></A
><B
>append</B
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(n)</EM
> Append two ByteStrings
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:head"
><A NAME="v%3Ahead"
></A
></A
><B
>head</B
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(1)</EM
> Extract the first element of a ByteString, which must be non-empty.
An exception will be thrown in the case of an empty ByteString.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:uncons"
><A NAME="v%3Auncons"
></A
></A
><B
>uncons</B
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/Data-Maybe.html#t%3AMaybe"
>Maybe</A
> (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>, <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>)</TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(1)</EM
> Extract the head and tail of a ByteString, returning Nothing
if it is empty.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:last"
><A NAME="v%3Alast"
></A
></A
><B
>last</B
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(1)</EM
> Extract the last element of a ByteString, which must be finite and non-empty.
An exception will be thrown in the case of an empty ByteString.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:tail"
><A NAME="v%3Atail"
></A
></A
><B
>tail</B
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(1)</EM
> Extract the elements after the head of a ByteString, which must be non-empty.
An exception will be thrown in the case of an empty ByteString.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:init"
><A NAME="v%3Ainit"
></A
></A
><B
>init</B
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(1)</EM
> Return all the elements of a <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
> except the last one.
An exception will be thrown in the case of an empty ByteString.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:null"
><A NAME="v%3Anull"
></A
></A
><B
>null</B
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(1)</EM
> Test whether a ByteString is empty.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:length"
><A NAME="v%3Alength"
></A
></A
><B
>length</B
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(1)</EM
> <TT
><A HREF="Data-ByteString.html#v%3Alength"
>length</A
></TT
> returns the length of a ByteString as an <TT
><A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
></TT
>.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
><A NAME="4"
><A NAME="4"
>Transforming ByteStrings
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:map"
><A NAME="v%3Amap"
></A
></A
><B
>map</B
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(n)</EM
> <TT
><A HREF="Data-ByteString.html#v%3Amap"
>map</A
></TT
> <TT
>f xs</TT
> is the ByteString obtained by applying <TT
>f</TT
> to each
element of <TT
>xs</TT
>. This function is subject to array fusion.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:reverse"
><A NAME="v%3Areverse"
></A
></A
><B
>reverse</B
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(n)</EM
> <TT
><A HREF="Data-ByteString.html#v%3Areverse"
>reverse</A
></TT
> <TT
>xs</TT
> efficiently returns the elements of <TT
>xs</TT
> in reverse order.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:intersperse"
><A NAME="v%3Aintersperse"
></A
></A
><B
>intersperse</B
> :: <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(n)</EM
> The <TT
><A HREF="Data-ByteString.html#v%3Aintersperse"
>intersperse</A
></TT
> function takes a <TT
><A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
></TT
> and a
<TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
> and `intersperses' that byte between the elements of
the <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
>. It is analogous to the intersperse function on
Lists.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:intercalate"
><A NAME="v%3Aintercalate"
></A
></A
><B
>intercalate</B
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> [<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>] -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(n)</EM
> The <TT
><A HREF="Data-ByteString.html#v%3Aintercalate"
>intercalate</A
></TT
> function takes a <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
> and a list of
<TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
>s and concatenates the list after interspersing the first
argument between each element of the list.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:transpose"
><A NAME="v%3Atranspose"
></A
></A
><B
>transpose</B
> :: [<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>] -> [<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>]</TD
></TR
><TR
><TD CLASS="doc"
>The <TT
><A HREF="Data-ByteString.html#v%3Atranspose"
>transpose</A
></TT
> function transposes the rows and columns of its
<TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
> argument.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
><A NAME="5"
><A NAME="5"
>Reducing <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
>s (folds)
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:foldl"
><A NAME="v%3Afoldl"
></A
></A
><B
>foldl</B
> :: (a -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> a) -> a -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> a</TD
></TR
><TR
><TD CLASS="doc"
><P
><TT
><A HREF="Data-ByteString.html#v%3Afoldl"
>foldl</A
></TT
>, applied to a binary operator, a starting value (typically
the left-identity of the operator), and a ByteString, reduces the
ByteString using the binary operator, from left to right.
</P
><P
>This function is subject to array fusion.
</P
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:foldl'"
><A NAME="v%3Afoldl%27"
></A
></A
><B
>foldl'</B
> :: (a -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> a) -> a -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> a</TD
></TR
><TR
><TD CLASS="doc"
>'foldl\'' is like <TT
><A HREF="Data-ByteString.html#v%3Afoldl"
>foldl</A
></TT
>, but strict in the accumulator.
However, for ByteStrings, all left folds are strict in the accumulator.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:foldl1"
><A NAME="v%3Afoldl1"
></A
></A
><B
>foldl1</B
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
></TD
></TR
><TR
><TD CLASS="doc"
><TT
><A HREF="Data-ByteString.html#v%3Afoldl1"
>foldl1</A
></TT
> is a variant of <TT
><A HREF="Data-ByteString.html#v%3Afoldl"
>foldl</A
></TT
> that has no starting value
argument, and thus must be applied to non-empty ByteStrings.
This function is subject to array fusion.
An exception will be thrown in the case of an empty ByteString.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:foldl1'"
><A NAME="v%3Afoldl1%27"
></A
></A
><B
>foldl1'</B
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
></TD
></TR
><TR
><TD CLASS="doc"
>'foldl1\'' is like <TT
><A HREF="Data-ByteString.html#v%3Afoldl1"
>foldl1</A
></TT
>, but strict in the accumulator.
An exception will be thrown in the case of an empty ByteString.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:foldr"
><A NAME="v%3Afoldr"
></A
></A
><B
>foldr</B
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> a -> a) -> a -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> a</TD
></TR
><TR
><TD CLASS="doc"
><TT
><A HREF="Data-ByteString.html#v%3Afoldr"
>foldr</A
></TT
>, applied to a binary operator, a starting value
(typically the right-identity of the operator), and a ByteString,
reduces the ByteString using the binary operator, from right to left.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:foldr'"
><A NAME="v%3Afoldr%27"
></A
></A
><B
>foldr'</B
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> a -> a) -> a -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> a</TD
></TR
><TR
><TD CLASS="doc"
>'foldr\'' is like <TT
><A HREF="Data-ByteString.html#v%3Afoldr"
>foldr</A
></TT
>, but strict in the accumulator.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:foldr1"
><A NAME="v%3Afoldr1"
></A
></A
><B
>foldr1</B
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
></TD
></TR
><TR
><TD CLASS="doc"
><TT
><A HREF="Data-ByteString.html#v%3Afoldr1"
>foldr1</A
></TT
> is a variant of <TT
><A HREF="Data-ByteString.html#v%3Afoldr"
>foldr</A
></TT
> that has no starting value argument,
and thus must be applied to non-empty <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
>s
An exception will be thrown in the case of an empty ByteString.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:foldr1'"
><A NAME="v%3Afoldr1%27"
></A
></A
><B
>foldr1'</B
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
></TD
></TR
><TR
><TD CLASS="doc"
>'foldr1\'' is a variant of <TT
><A HREF="Data-ByteString.html#v%3Afoldr1"
>foldr1</A
></TT
>, but is strict in the
accumulator.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section2"
><A NAME="6"
><A NAME="6"
>Special folds
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:concat"
><A NAME="v%3Aconcat"
></A
></A
><B
>concat</B
> :: [<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>] -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(n)</EM
> Concatenate a list of ByteStrings.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:concatMap"
><A NAME="v%3AconcatMap"
></A
></A
><B
>concatMap</B
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
>Map a function over a <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
> and concatenate the results
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:any"
><A NAME="v%3Aany"
></A
></A
><B
>any</B
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(n)</EM
> Applied to a predicate and a ByteString, <TT
><A HREF="Data-ByteString.html#v%3Aany"
>any</A
></TT
> determines if
any element of the <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
> satisfies the predicate.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:all"
><A NAME="v%3Aall"
></A
></A
><B
>all</B
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(n)</EM
> Applied to a predicate and a <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
>, <TT
><A HREF="Data-ByteString.html#v%3Aall"
>all</A
></TT
> determines
if all elements of the <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
> satisfy the predicate.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:maximum"
><A NAME="v%3Amaximum"
></A
></A
><B
>maximum</B
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(n)</EM
> <TT
><A HREF="Data-ByteString.html#v%3Amaximum"
>maximum</A
></TT
> returns the maximum value from a <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
>
This function will fuse.
An exception will be thrown in the case of an empty ByteString.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:minimum"
><A NAME="v%3Aminimum"
></A
></A
><B
>minimum</B
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(n)</EM
> <TT
><A HREF="Data-ByteString.html#v%3Aminimum"
>minimum</A
></TT
> returns the minimum value from a <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
>
This function will fuse.
An exception will be thrown in the case of an empty ByteString.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
><A NAME="7"
><A NAME="7"
>Building ByteStrings
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section2"
><A NAME="8"
><A NAME="8"
>Scans
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:scanl"
><A NAME="v%3Ascanl"
></A
></A
><B
>scanl</B
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>) -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
><P
><TT
><A HREF="Data-ByteString.html#v%3Ascanl"
>scanl</A
></TT
> is similar to <TT
><A HREF="Data-ByteString.html#v%3Afoldl"
>foldl</A
></TT
>, but returns a list of successive
reduced values from the left. This function will fuse.
</P
><PRE
> scanl f z [x1, x2, ...] == [z, z `f` x1, (z `f` x1) `f` x2, ...]
</PRE
><P
>Note that
</P
><PRE
> last (scanl f z xs) == foldl f z xs.
</PRE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:scanl1"
><A NAME="v%3Ascanl1"
></A
></A
><B
>scanl1</B
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
><P
><TT
><A HREF="Data-ByteString.html#v%3Ascanl1"
>scanl1</A
></TT
> is a variant of <TT
><A HREF="Data-ByteString.html#v%3Ascanl"
>scanl</A
></TT
> that has no starting value argument.
This function will fuse.
</P
><PRE
> scanl1 f [x1, x2, ...] == [x1, x1 `f` x2, ...]
</PRE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:scanr"
><A NAME="v%3Ascanr"
></A
></A
><B
>scanr</B
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>) -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
>scanr is the right-to-left dual of scanl.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:scanr1"
><A NAME="v%3Ascanr1"
></A
></A
><B
>scanr1</B
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
><TT
><A HREF="Data-ByteString.html#v%3Ascanr1"
>scanr1</A
></TT
> is a variant of <TT
><A HREF="Data-ByteString.html#v%3Ascanr"
>scanr</A
></TT
> that has no starting value argument.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section2"
><A NAME="9"
><A NAME="9"
>Accumulating maps
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:mapAccumL"
><A NAME="v%3AmapAccumL"
></A
></A
><B
>mapAccumL</B
> :: (acc -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> (acc, <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>)) -> acc -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> (acc, <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>)</TD
></TR
><TR
><TD CLASS="doc"
>The <TT
><A HREF="Data-ByteString.html#v%3AmapAccumL"
>mapAccumL</A
></TT
> function behaves like a combination of <TT
><A HREF="Data-ByteString.html#v%3Amap"
>map</A
></TT
> and
<TT
><A HREF="Data-ByteString.html#v%3Afoldl"
>foldl</A
></TT
>; it applies a function to each element of a ByteString,
passing an accumulating parameter from left to right, and returning a
final value of this accumulator together with the new list.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:mapAccumR"
><A NAME="v%3AmapAccumR"
></A
></A
><B
>mapAccumR</B
> :: (acc -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> (acc, <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>)) -> acc -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> (acc, <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>)</TD
></TR
><TR
><TD CLASS="doc"
>The <TT
><A HREF="Data-ByteString.html#v%3AmapAccumR"
>mapAccumR</A
></TT
> function behaves like a combination of <TT
><A HREF="Data-ByteString.html#v%3Amap"
>map</A
></TT
> and
<TT
><A HREF="Data-ByteString.html#v%3Afoldr"
>foldr</A
></TT
>; it applies a function to each element of a ByteString,
passing an accumulating parameter from right to left, and returning a
final value of this accumulator together with the new ByteString.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section2"
><A NAME="10"
><A NAME="10"
>Generating and unfolding ByteStrings
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:replicate"
><A NAME="v%3Areplicate"
></A
></A
><B
>replicate</B
> :: <A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
><P
><EM
>O(n)</EM
> <TT
><A HREF="Data-ByteString.html#v%3Areplicate"
>replicate</A
></TT
> <TT
>n x</TT
> is a ByteString of length <TT
>n</TT
> with <TT
>x</TT
>
the value of every element. The following holds:
</P
><PRE
> replicate w c = unfoldr w (\u -> Just (u,u)) c
</PRE
><P
>This implemenation uses <TT
>memset(3)</TT
>
</P
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:unfoldr"
><A NAME="v%3Aunfoldr"
></A
></A
><B
>unfoldr</B
> :: (a -> <A HREF="../base/Data-Maybe.html#t%3AMaybe"
>Maybe</A
> (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>, a)) -> a -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
><P
><EM
>O(n)</EM
>, where <EM
>n</EM
> is the length of the result. The <TT
><A HREF="Data-ByteString.html#v%3Aunfoldr"
>unfoldr</A
></TT
>
function is analogous to the List 'unfoldr'. <TT
><A HREF="Data-ByteString.html#v%3Aunfoldr"
>unfoldr</A
></TT
> builds a
ByteString from a seed value. The function takes the element and
returns <TT
><A HREF="../base/Data-Maybe.html#v%3ANothing"
>Nothing</A
></TT
> if it is done producing the ByteString or returns
<TT
><A HREF="../base/Data-Maybe.html#v%3AJust"
>Just</A
></TT
> <TT
>(a,b)</TT
>, in which case, <TT
>a</TT
> is the next byte in the string,
and <TT
>b</TT
> is the seed value for further production.
</P
><P
>Examples:
</P
><PRE
> unfoldr (\x -> if x <= 5 then Just (x, x + 1) else Nothing) 0
== pack [0, 1, 2, 3, 4, 5]
</PRE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:unfoldrN"
><A NAME="v%3AunfoldrN"
></A
></A
><B
>unfoldrN</B
> :: <A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
> -> (a -> <A HREF="../base/Data-Maybe.html#t%3AMaybe"
>Maybe</A
> (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>, a)) -> a -> (<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>, <A HREF="../base/Data-Maybe.html#t%3AMaybe"
>Maybe</A
> a)</TD
></TR
><TR
><TD CLASS="doc"
><P
><EM
>O(n)</EM
> Like <TT
><A HREF="Data-ByteString.html#v%3Aunfoldr"
>unfoldr</A
></TT
>, <TT
><A HREF="Data-ByteString.html#v%3AunfoldrN"
>unfoldrN</A
></TT
> builds a ByteString from a seed
value. However, the length of the result is limited by the first
argument to <TT
><A HREF="Data-ByteString.html#v%3AunfoldrN"
>unfoldrN</A
></TT
>. This function is more efficient than <TT
><A HREF="Data-ByteString.html#v%3Aunfoldr"
>unfoldr</A
></TT
>
when the maximum length of the result is known.
</P
><P
>The following equation relates <TT
><A HREF="Data-ByteString.html#v%3AunfoldrN"
>unfoldrN</A
></TT
> and <TT
><A HREF="Data-ByteString.html#v%3Aunfoldr"
>unfoldr</A
></TT
>:
</P
><PRE
> snd (unfoldrN n f s) == take n (unfoldr f s)
</PRE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
><A NAME="11"
><A NAME="11"
>Substrings
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section2"
><A NAME="12"
><A NAME="12"
>Breaking strings
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:take"
><A NAME="v%3Atake"
></A
></A
><B
>take</B
> :: <A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(1)</EM
> <TT
><A HREF="Data-ByteString.html#v%3Atake"
>take</A
></TT
> <TT
>n</TT
>, applied to a ByteString <TT
>xs</TT
>, returns the prefix
of <TT
>xs</TT
> of length <TT
>n</TT
>, or <TT
>xs</TT
> itself if <TT
>n > <TT
><A HREF="Data-ByteString.html#v%3Alength"
>length</A
></TT
> xs</TT
>.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:drop"
><A NAME="v%3Adrop"
></A
></A
><B
>drop</B
> :: <A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(1)</EM
> <TT
><A HREF="Data-ByteString.html#v%3Adrop"
>drop</A
></TT
> <TT
>n xs</TT
> returns the suffix of <TT
>xs</TT
> after the first <TT
>n</TT
>
elements, or <TT
>[]</TT
> if <TT
>n > <TT
><A HREF="Data-ByteString.html#v%3Alength"
>length</A
></TT
> xs</TT
>.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:splitAt"
><A NAME="v%3AsplitAt"
></A
></A
><B
>splitAt</B
> :: <A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> (<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>, <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>)</TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(1)</EM
> <TT
><A HREF="Data-ByteString.html#v%3AsplitAt"
>splitAt</A
></TT
> <TT
>n xs</TT
> is equivalent to <TT
>(<TT
><A HREF="Data-ByteString.html#v%3Atake"
>take</A
></TT
> n xs, <TT
><A HREF="Data-ByteString.html#v%3Adrop"
>drop</A
></TT
> n xs)</TT
>.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:takeWhile"
><A NAME="v%3AtakeWhile"
></A
></A
><B
>takeWhile</B
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
><TT
><A HREF="Data-ByteString.html#v%3AtakeWhile"
>takeWhile</A
></TT
>, applied to a predicate <TT
>p</TT
> and a ByteString <TT
>xs</TT
>,
returns the longest prefix (possibly empty) of <TT
>xs</TT
> of elements that
satisfy <TT
>p</TT
>.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:dropWhile"
><A NAME="v%3AdropWhile"
></A
></A
><B
>dropWhile</B
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
><TT
><A HREF="Data-ByteString.html#v%3AdropWhile"
>dropWhile</A
></TT
> <TT
>p xs</TT
> returns the suffix remaining after <TT
><A HREF="Data-ByteString.html#v%3AtakeWhile"
>takeWhile</A
></TT
> <TT
>p xs</TT
>.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:span"
><A NAME="v%3Aspan"
></A
></A
><B
>span</B
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> (<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>, <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>)</TD
></TR
><TR
><TD CLASS="doc"
><TT
><A HREF="Data-ByteString.html#v%3Aspan"
>span</A
></TT
> <TT
>p xs</TT
> breaks the ByteString into two segments. It is
equivalent to <TT
>(<TT
><A HREF="Data-ByteString.html#v%3AtakeWhile"
>takeWhile</A
></TT
> p xs, <TT
><A HREF="Data-ByteString.html#v%3AdropWhile"
>dropWhile</A
></TT
> p xs)</TT
>
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:spanEnd"
><A NAME="v%3AspanEnd"
></A
></A
><B
>spanEnd</B
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> (<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>, <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>)</TD
></TR
><TR
><TD CLASS="doc"
><P
><TT
><A HREF="Data-ByteString.html#v%3AspanEnd"
>spanEnd</A
></TT
> behaves like <TT
><A HREF="Data-ByteString.html#v%3Aspan"
>span</A
></TT
> but from the end of the <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
>.
We have
</P
><PRE
> spanEnd (not.isSpace) "x y z" == ("x y ","z")
</PRE
><P
>and
</P
><PRE
> spanEnd (not . isSpace) ps
==
let (x,y) = span (not.isSpace) (reverse ps) in (reverse y, reverse x)
</PRE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:break"
><A NAME="v%3Abreak"
></A
></A
><B
>break</B
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> (<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>, <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>)</TD
></TR
><TR
><TD CLASS="doc"
><P
><TT
><A HREF="Data-ByteString.html#v%3Abreak"
>break</A
></TT
> <TT
>p</TT
> is equivalent to <TT
><TT
><A HREF="Data-ByteString.html#v%3Aspan"
>span</A
></TT
> (<TT
><A HREF="../base/Data-Bool.html#v%3Anot"
>not</A
></TT
> . p)</TT
>.
</P
><P
>Under GHC, a rewrite rule will transform break (==) into a
call to the specialised breakByte:
</P
><PRE
> break ((==) x) = breakByte x
break (==x) = breakByte x
</PRE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:breakEnd"
><A NAME="v%3AbreakEnd"
></A
></A
><B
>breakEnd</B
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> (<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>, <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>)</TD
></TR
><TR
><TD CLASS="doc"
><P
><TT
><A HREF="Data-ByteString.html#v%3AbreakEnd"
>breakEnd</A
></TT
> behaves like <TT
><A HREF="Data-ByteString.html#v%3Abreak"
>break</A
></TT
> but from the end of the <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
>
</P
><P
>breakEnd p == spanEnd (not.p)
</P
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:group"
><A NAME="v%3Agroup"
></A
></A
><B
>group</B
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> [<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>]</TD
></TR
><TR
><TD CLASS="doc"
><P
>The <TT
><A HREF="Data-ByteString.html#v%3Agroup"
>group</A
></TT
> function takes a ByteString and returns a list of
ByteStrings such that the concatenation of the result is equal to the
argument. Moreover, each sublist in the result contains only equal
elements. For example,
</P
><PRE
> group "Mississippi" = ["M","i","ss","i","ss","i","pp","i"]
</PRE
><P
>It is a special case of <TT
><A HREF="Data-ByteString.html#v%3AgroupBy"
>groupBy</A
></TT
>, which allows the programmer to
supply their own equality test. It is about 40% faster than
<EM
>groupBy (==)</EM
>
</P
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:groupBy"
><A NAME="v%3AgroupBy"
></A
></A
><B
>groupBy</B
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> [<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>]</TD
></TR
><TR
><TD CLASS="doc"
>The <TT
><A HREF="Data-ByteString.html#v%3AgroupBy"
>groupBy</A
></TT
> function is the non-overloaded version of <TT
><A HREF="Data-ByteString.html#v%3Agroup"
>group</A
></TT
>.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:inits"
><A NAME="v%3Ainits"
></A
></A
><B
>inits</B
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> [<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>]</TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(n)</EM
> Return all initial segments of the given <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
>, shortest first.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:tails"
><A NAME="v%3Atails"
></A
></A
><B
>tails</B
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> [<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>]</TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(n)</EM
> Return all final segments of the given <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
>, longest first.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section2"
><A NAME="13"
><A NAME="13"
>Breaking into many substrings
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:split"
><A NAME="v%3Asplit"
></A
></A
><B
>split</B
> :: <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> [<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>]</TD
></TR
><TR
><TD CLASS="doc"
><P
><EM
>O(n)</EM
> Break a <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
> into pieces separated by the byte
argument, consuming the delimiter. I.e.
</P
><PRE
> split '\n' "a\nb\nd\ne" == ["a","b","d","e"]
split 'a' "aXaXaXa" == ["","X","X","X",""]
split 'x' "x" == ["",""]
</PRE
><P
>and
</P
><PRE
> intercalate [c] . split c == id
split == splitWith . (==)
</PRE
><P
>As for all splitting functions in this library, this function does
not copy the substrings, it just constructs new ByteStrings that
are slices of the original.
</P
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:splitWith"
><A NAME="v%3AsplitWith"
></A
></A
><B
>splitWith</B
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> [<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>]</TD
></TR
><TR
><TD CLASS="doc"
><P
><EM
>O(n)</EM
> Splits a <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
> into components delimited by
separators, where the predicate returns True for a separator element.
The resulting components do not contain the separators. Two adjacent
separators result in an empty component in the output. eg.
</P
><PRE
> splitWith (=='a') "aabbaca" == ["","","bb","c",""]
splitWith (=='a') [] == []
</PRE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
><A NAME="14"
><A NAME="14"
>Predicates
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:isPrefixOf"
><A NAME="v%3AisPrefixOf"
></A
></A
><B
>isPrefixOf</B
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(n)</EM
> The <TT
><A HREF="Data-ByteString.html#v%3AisPrefixOf"
>isPrefixOf</A
></TT
> function takes two ByteStrings and returns <TT
><A HREF="../ghc-prim/GHC-Bool.html#v%3ATrue"
>True</A
></TT
>
iff the first is a prefix of the second.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:isSuffixOf"
><A NAME="v%3AisSuffixOf"
></A
></A
><B
>isSuffixOf</B
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
></TD
></TR
><TR
><TD CLASS="doc"
><P
><EM
>O(n)</EM
> The <TT
><A HREF="Data-ByteString.html#v%3AisSuffixOf"
>isSuffixOf</A
></TT
> function takes two ByteStrings and returns <TT
><A HREF="../ghc-prim/GHC-Bool.html#v%3ATrue"
>True</A
></TT
>
iff the first is a suffix of the second.
</P
><P
>The following holds:
</P
><PRE
> isSuffixOf x y == reverse x `isPrefixOf` reverse y
</PRE
><P
>However, the real implemenation uses memcmp to compare the end of the
string only, with no reverse required..
</P
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:isInfixOf"
><A NAME="v%3AisInfixOf"
></A
></A
><B
>isInfixOf</B
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
></TD
></TR
><TR
><TD CLASS="doc"
>Check whether one string is a substring of another. <TT
>isInfixOf
p s</TT
> is equivalent to <TT
>not (null (findSubstrings p s))</TT
>.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section2"
><A NAME="15"
><A NAME="15"
>Search for arbitrary substrings
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:breakSubstring"
><A NAME="v%3AbreakSubstring"
></A
></A
><B
>breakSubstring</B
></TD
></TR
><TR
><TD CLASS="body"
><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD CLASS="arg"
>:: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
><TD CLASS="rdoc"
>String to search for
</TD
></TR
><TR
><TD CLASS="arg"
>-> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
><TD CLASS="rdoc"
>String to search in
</TD
></TR
><TR
><TD CLASS="arg"
>-> (<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>, <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>)</TD
><TD CLASS="rdoc"
>Head and tail of string broken at substring
</TD
></TR
><TR
><TD CLASS="ndoc" COLSPAN="2"
><P
>Break a string on a substring, returning a pair of the part of the
string prior to the match, and the rest of the string.
</P
><P
>The following relationships hold:
</P
><PRE
> break (== c) l == breakSubstring (singleton c) l
</PRE
><P
>and:
</P
><PRE
> findSubstring s l ==
if null s then Just 0
else case breakSubstring s l of
(x,y) | null y -> Nothing
| otherwise -> Just (length x)
</PRE
><P
>For example, to tokenise a string, dropping delimiters:
</P
><PRE
> tokenise x y = h : if null t then [] else tokenise x (drop (length x) t)
where (h,t) = breakSubstring x y
</PRE
><P
>To skip to the first occurence of a string:
</P
><PRE
> snd (breakSubstring x y)
</PRE
><P
>To take the parts of a string before a delimiter:
</P
><PRE
> fst (breakSubstring x y)
</PRE
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:findSubstring"
><A NAME="v%3AfindSubstring"
></A
></A
><B
>findSubstring</B
></TD
></TR
><TR
><TD CLASS="body"
><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD CLASS="arg"
>:: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
><TD CLASS="rdoc"
>String to search for.
</TD
></TR
><TR
><TD CLASS="arg"
>-> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
><TD CLASS="rdoc"
>String to seach in.
</TD
></TR
><TR
><TD CLASS="arg"
>-> <A HREF="../base/Data-Maybe.html#t%3AMaybe"
>Maybe</A
> <A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
></TD
><TD CLASS="rdoc"
></TD
></TR
><TR
><TD CLASS="ndoc" COLSPAN="2"
>Get the first index of a substring in another string,
or <TT
><A HREF="../base/Data-Maybe.html#v%3ANothing"
>Nothing</A
></TT
> if the string is not found.
<TT
>findSubstring p s</TT
> is equivalent to <TT
>listToMaybe (findSubstrings p s)</TT
>.
</TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:findSubstrings"
><A NAME="v%3AfindSubstrings"
></A
></A
><B
>findSubstrings</B
></TD
></TR
><TR
><TD CLASS="body"
><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD CLASS="arg"
>:: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
><TD CLASS="rdoc"
>String to search for.
</TD
></TR
><TR
><TD CLASS="arg"
>-> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
><TD CLASS="rdoc"
>String to seach in.
</TD
></TR
><TR
><TD CLASS="arg"
>-> [<A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
>]</TD
><TD CLASS="rdoc"
></TD
></TR
><TR
><TD CLASS="ndoc" COLSPAN="2"
>Find the indexes of all (possibly overlapping) occurances of a
substring in a string.
</TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
><A NAME="16"
><A NAME="16"
>Searching ByteStrings
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section2"
><A NAME="17"
><A NAME="17"
>Searching by equality
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:elem"
><A NAME="v%3Aelem"
></A
></A
><B
>elem</B
> :: <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(n)</EM
> <TT
><A HREF="Data-ByteString.html#v%3Aelem"
>elem</A
></TT
> is the <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
> membership predicate.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:notElem"
><A NAME="v%3AnotElem"
></A
></A
><B
>notElem</B
> :: <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(n)</EM
> <TT
><A HREF="Data-ByteString.html#v%3AnotElem"
>notElem</A
></TT
> is the inverse of <TT
><A HREF="Data-ByteString.html#v%3Aelem"
>elem</A
></TT
>
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section2"
><A NAME="18"
><A NAME="18"
>Searching with a predicate
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:find"
><A NAME="v%3Afind"
></A
></A
><B
>find</B
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/Data-Maybe.html#t%3AMaybe"
>Maybe</A
> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
></TD
></TR
><TR
><TD CLASS="doc"
><P
><EM
>O(n)</EM
> The <TT
><A HREF="Data-ByteString.html#v%3Afind"
>find</A
></TT
> function takes a predicate and a ByteString,
and returns the first element in matching the predicate, or <TT
><A HREF="../base/Data-Maybe.html#v%3ANothing"
>Nothing</A
></TT
>
if there is no such element.
</P
><PRE
> find f p = case findIndex f p of Just n -> Just (p ! n) ; _ -> Nothing
</PRE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:filter"
><A NAME="v%3Afilter"
></A
></A
><B
>filter</B
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(n)</EM
> <TT
><A HREF="Data-ByteString.html#v%3Afilter"
>filter</A
></TT
>, applied to a predicate and a ByteString,
returns a ByteString containing those characters that satisfy the
predicate. This function is subject to array fusion.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:partition"
><A NAME="v%3Apartition"
></A
></A
><B
>partition</B
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> (<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>, <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>)</TD
></TR
><TR
><TD CLASS="doc"
><P
><EM
>O(n)</EM
> The <TT
><A HREF="Data-ByteString.html#v%3Apartition"
>partition</A
></TT
> function takes a predicate a ByteString and returns
the pair of ByteStrings with elements which do and do not satisfy the
predicate, respectively; i.e.,
</P
><PRE
> partition p bs == (filter p xs, filter (not . p) xs)
</PRE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
><A NAME="19"
><A NAME="19"
>Indexing ByteStrings
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:index"
><A NAME="v%3Aindex"
></A
></A
><B
>index</B
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(1)</EM
> <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
> index (subscript) operator, starting from 0.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:elemIndex"
><A NAME="v%3AelemIndex"
></A
></A
><B
>elemIndex</B
> :: <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/Data-Maybe.html#t%3AMaybe"
>Maybe</A
> <A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(n)</EM
> The <TT
><A HREF="Data-ByteString.html#v%3AelemIndex"
>elemIndex</A
></TT
> function returns the index of the first
element in the given <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
> which is equal to the query
element, or <TT
><A HREF="../base/Data-Maybe.html#v%3ANothing"
>Nothing</A
></TT
> if there is no such element.
This implementation uses memchr(3).
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:elemIndices"
><A NAME="v%3AelemIndices"
></A
></A
><B
>elemIndices</B
> :: <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> [<A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
>]</TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(n)</EM
> The <TT
><A HREF="Data-ByteString.html#v%3AelemIndices"
>elemIndices</A
></TT
> function extends <TT
><A HREF="Data-ByteString.html#v%3AelemIndex"
>elemIndex</A
></TT
>, by returning
the indices of all elements equal to the query element, in ascending order.
This implementation uses memchr(3).
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:elemIndexEnd"
><A NAME="v%3AelemIndexEnd"
></A
></A
><B
>elemIndexEnd</B
> :: <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/Data-Maybe.html#t%3AMaybe"
>Maybe</A
> <A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
></TD
></TR
><TR
><TD CLASS="doc"
><P
><EM
>O(n)</EM
> The <TT
><A HREF="Data-ByteString.html#v%3AelemIndexEnd"
>elemIndexEnd</A
></TT
> function returns the last index of the
element in the given <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
> which is equal to the query
element, or <TT
><A HREF="../base/Data-Maybe.html#v%3ANothing"
>Nothing</A
></TT
> if there is no such element. The following
holds:
</P
><PRE
> elemIndexEnd c xs ==
(-) (length xs - 1) `fmap` elemIndex c (reverse xs)
</PRE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:findIndex"
><A NAME="v%3AfindIndex"
></A
></A
><B
>findIndex</B
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/Data-Maybe.html#t%3AMaybe"
>Maybe</A
> <A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
></TD
></TR
><TR
><TD CLASS="doc"
>The <TT
><A HREF="Data-ByteString.html#v%3AfindIndex"
>findIndex</A
></TT
> function takes a predicate and a <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
> and
returns the index of the first element in the ByteString
satisfying the predicate.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:findIndices"
><A NAME="v%3AfindIndices"
></A
></A
><B
>findIndices</B
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
>) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> [<A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
>]</TD
></TR
><TR
><TD CLASS="doc"
>The <TT
><A HREF="Data-ByteString.html#v%3AfindIndices"
>findIndices</A
></TT
> function extends <TT
><A HREF="Data-ByteString.html#v%3AfindIndex"
>findIndex</A
></TT
>, by returning the
indices of all elements satisfying the predicate, in ascending order.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:count"
><A NAME="v%3Acount"
></A
></A
><B
>count</B
> :: <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
></TD
></TR
><TR
><TD CLASS="doc"
><P
>count returns the number of times its argument appears in the ByteString
</P
><PRE
> count = length . elemIndices
</PRE
><P
>But more efficiently than using length on the intermediate list.
</P
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
><A NAME="20"
><A NAME="20"
>Zipping and unzipping ByteStrings
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:zip"
><A NAME="v%3Azip"
></A
></A
><B
>zip</B
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> [(<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>, <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>)]</TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(n)</EM
> <TT
><A HREF="Data-ByteString.html#v%3Azip"
>zip</A
></TT
> takes two ByteStrings and returns a list of
corresponding pairs of bytes. If one input ByteString is short,
excess elements of the longer ByteString are discarded. This is
equivalent to a pair of <TT
><A HREF="Data-ByteString.html#v%3Aunpack"
>unpack</A
></TT
> operations.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:zipWith"
><A NAME="v%3AzipWith"
></A
></A
><B
>zipWith</B
> :: (<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> a) -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> [a]</TD
></TR
><TR
><TD CLASS="doc"
><TT
><A HREF="Data-ByteString.html#v%3AzipWith"
>zipWith</A
></TT
> generalises <TT
><A HREF="Data-ByteString.html#v%3Azip"
>zip</A
></TT
> by zipping with the function given as
the first argument, instead of a tupling function. For example,
<TT
><TT
><A HREF="Data-ByteString.html#v%3AzipWith"
>zipWith</A
></TT
> (+)</TT
> is applied to two ByteStrings to produce the list of
corresponding sums.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:unzip"
><A NAME="v%3Aunzip"
></A
></A
><B
>unzip</B
> :: [(<A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>, <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
>)] -> (<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>, <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>)</TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(n)</EM
> <TT
><A HREF="Data-ByteString.html#v%3Aunzip"
>unzip</A
></TT
> transforms a list of pairs of bytes into a pair of
ByteStrings. Note that this performs two <TT
><A HREF="Data-ByteString.html#v%3Apack"
>pack</A
></TT
> operations.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
><A NAME="21"
><A NAME="21"
>Ordered ByteStrings
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:sort"
><A NAME="v%3Asort"
></A
></A
><B
>sort</B
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(n)</EM
> Sort a ByteString efficiently, using counting sort.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
><A NAME="22"
><A NAME="22"
>Low level conversions
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section2"
><A NAME="23"
><A NAME="23"
>Copying ByteStrings
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:copy"
><A NAME="v%3Acopy"
></A
></A
><B
>copy</B
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(n)</EM
> Make a copy of the <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
> with its own storage.
This is mainly useful to allow the rest of the data pointed
to by the <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
> to be garbage collected, for example
if a large string has been read in, and only a small part of it
is needed in the rest of the program.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section2"
><A NAME="24"
><A NAME="24"
>Packing <TT
><A HREF="../base/Foreign-C-String.html#t%3ACString"
>CString</A
></TT
>s and pointers
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:packCString"
><A NAME="v%3ApackCString"
></A
></A
><B
>packCString</B
> :: <A HREF="../base/Foreign-C-String.html#t%3ACString"
>CString</A
> -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(n).</EM
> Construct a new <TT
>ByteString</TT
> from a <TT
>CString</TT
>. The
resulting <TT
>ByteString</TT
> is an immutable copy of the original
<TT
>CString</TT
>, and is managed on the Haskell heap. The original
<TT
>CString</TT
> must be null terminated.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:packCStringLen"
><A NAME="v%3ApackCStringLen"
></A
></A
><B
>packCStringLen</B
> :: <A HREF="../base/Foreign-C-String.html#t%3ACStringLen"
>CStringLen</A
> -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(n).</EM
> Construct a new <TT
>ByteString</TT
> from a <TT
>CStringLen</TT
>. The
resulting <TT
>ByteString</TT
> is an immutable copy of the original <TT
>CStringLen</TT
>.
The <TT
>ByteString</TT
> is a normal Haskell value and will be managed on the
Haskell heap.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section2"
><A NAME="25"
><A NAME="25"
>Using ByteStrings as <TT
><A HREF="../base/Foreign-C-String.html#t%3ACString"
>CString</A
></TT
>s
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:useAsCString"
><A NAME="v%3AuseAsCString"
></A
></A
><B
>useAsCString</B
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> (<A HREF="../base/Foreign-C-String.html#t%3ACString"
>CString</A
> -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> a) -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> a</TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(n) construction</EM
> Use a <TT
>ByteString</TT
> with a function requiring a
null-terminated <TT
>CString</TT
>. The <TT
>CString</TT
> will be freed
automatically. This is a memcpy(3).
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:useAsCStringLen"
><A NAME="v%3AuseAsCStringLen"
></A
></A
><B
>useAsCStringLen</B
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> (<A HREF="../base/Foreign-C-String.html#t%3ACStringLen"
>CStringLen</A
> -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> a) -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> a</TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(n) construction</EM
> Use a <TT
>ByteString</TT
> with a function requiring a <TT
>CStringLen</TT
>.
As for <TT
>useAsCString</TT
> this function makes a copy of the original <TT
>ByteString</TT
>.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
><A NAME="26"
><A NAME="26"
>I/O with <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
>s
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section2"
><A NAME="27"
><A NAME="27"
>Standard input and output
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:getLine"
><A NAME="v%3AgetLine"
></A
></A
><B
>getLine</B
> :: <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
>Read a line from stdin.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:getContents"
><A NAME="v%3AgetContents"
></A
></A
><B
>getContents</B
> :: <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
>getContents. Read stdin strictly. Equivalent to hGetContents stdin
The <TT
><A HREF="../base/System-IO.html#t%3AHandle"
>Handle</A
></TT
> is closed after the contents have been read.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:putStr"
><A NAME="v%3AputStr"
></A
></A
><B
>putStr</B
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="../ghc-prim/GHC-Unit.html#t%3A%28%29"
>()</A
></TD
></TR
><TR
><TD CLASS="doc"
>Write a ByteString to stdout
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:putStrLn"
><A NAME="v%3AputStrLn"
></A
></A
><B
>putStrLn</B
> :: <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="../ghc-prim/GHC-Unit.html#t%3A%28%29"
>()</A
></TD
></TR
><TR
><TD CLASS="doc"
>Write a ByteString to stdout, appending a newline byte
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:interact"
><A NAME="v%3Ainteract"
></A
></A
><B
>interact</B
> :: (<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>) -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="../ghc-prim/GHC-Unit.html#t%3A%28%29"
>()</A
></TD
></TR
><TR
><TD CLASS="doc"
>The interact function takes a function of type <TT
>ByteString -> ByteString</TT
>
as its argument. The entire input from the standard input device is passed
to this function as its argument, and the resulting string is output on the
standard output device.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section2"
><A NAME="28"
><A NAME="28"
>Files
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:readFile"
><A NAME="v%3AreadFile"
></A
></A
><B
>readFile</B
> :: <A HREF="../base/System-IO.html#t%3AFilePath"
>FilePath</A
> -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
>Read an entire file strictly into a <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
>. This is far more
efficient than reading the characters into a <TT
><A HREF="../base/Data-Char.html#t%3AString"
>String</A
></TT
> and then using
<TT
><A HREF="Data-ByteString.html#v%3Apack"
>pack</A
></TT
>. It also may be more efficient than opening the file and
reading it using hGet. Files are read using 'binary mode' on Windows,
for 'text mode' use the Char8 version of this function.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:writeFile"
><A NAME="v%3AwriteFile"
></A
></A
><B
>writeFile</B
> :: <A HREF="../base/System-IO.html#t%3AFilePath"
>FilePath</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="../ghc-prim/GHC-Unit.html#t%3A%28%29"
>()</A
></TD
></TR
><TR
><TD CLASS="doc"
>Write a <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
> to a file.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:appendFile"
><A NAME="v%3AappendFile"
></A
></A
><B
>appendFile</B
> :: <A HREF="../base/System-IO.html#t%3AFilePath"
>FilePath</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="../ghc-prim/GHC-Unit.html#t%3A%28%29"
>()</A
></TD
></TR
><TR
><TD CLASS="doc"
>Append a <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
> to a file.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section2"
><A NAME="29"
><A NAME="29"
>I/O with Handles
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:hGetLine"
><A NAME="v%3AhGetLine"
></A
></A
><B
>hGetLine</B
> :: <A HREF="../base/System-IO.html#t%3AHandle"
>Handle</A
> -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
>Read a line from a handle
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:hGetContents"
><A NAME="v%3AhGetContents"
></A
></A
><B
>hGetContents</B
> :: <A HREF="../base/System-IO.html#t%3AHandle"
>Handle</A
> -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
><P
>Read entire handle contents strictly into a <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
>.
</P
><P
>This function reads chunks at a time, doubling the chunksize on each
read. The final buffer is then realloced to the appropriate size. For
files > half of available memory, this may lead to memory exhaustion.
Consider using <TT
><A HREF="Data-ByteString.html#v%3AreadFile"
>readFile</A
></TT
> in this case.
</P
><P
>As with <TT
><A HREF="Data-ByteString.html#v%3AhGet"
>hGet</A
></TT
>, the string representation in the file is assumed to
be ISO-8859-1.
</P
><P
>The Handle is closed once the contents have been read,
or if an exception is thrown.
</P
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:hGet"
><A NAME="v%3AhGet"
></A
></A
><B
>hGet</B
> :: <A HREF="../base/System-IO.html#t%3AHandle"
>Handle</A
> -> <A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
> -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
><P
>Read a <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
> directly from the specified <TT
><A HREF="../base/System-IO.html#t%3AHandle"
>Handle</A
></TT
>. This
is far more efficient than reading the characters into a <TT
><A HREF="../base/Data-Char.html#t%3AString"
>String</A
></TT
>
and then using <TT
><A HREF="Data-ByteString.html#v%3Apack"
>pack</A
></TT
>. First argument is the Handle to read from,
and the second is the number of bytes to read. It returns the bytes
read, up to n, or EOF.
</P
><P
><TT
><A HREF="Data-ByteString.html#v%3AhGet"
>hGet</A
></TT
> is implemented in terms of <TT
><A HREF="../base/System-IO.html#v%3AhGetBuf"
>hGetBuf</A
></TT
>.
</P
><P
>If the handle is a pipe or socket, and the writing end
is closed, <TT
><A HREF="Data-ByteString.html#v%3AhGet"
>hGet</A
></TT
> will behave as if EOF was reached.
</P
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:hGetNonBlocking"
><A NAME="v%3AhGetNonBlocking"
></A
></A
><B
>hGetNonBlocking</B
> :: <A HREF="../base/System-IO.html#t%3AHandle"
>Handle</A
> -> <A HREF="../ghc-prim/GHC-Types.html#t%3AInt"
>Int</A
> -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
>hGetNonBlocking is identical to <TT
><A HREF="Data-ByteString.html#v%3AhGet"
>hGet</A
></TT
>, except that it will never block
waiting for data to become available, instead it returns only whatever data
is available.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:hPut"
><A NAME="v%3AhPut"
></A
></A
><B
>hPut</B
> :: <A HREF="../base/System-IO.html#t%3AHandle"
>Handle</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="../ghc-prim/GHC-Unit.html#t%3A%28%29"
>()</A
></TD
></TR
><TR
><TD CLASS="doc"
>Outputs a <TT
><A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
> to the specified <TT
><A HREF="../base/System-IO.html#t%3AHandle"
>Handle</A
></TT
>.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:hPutStr"
><A NAME="v%3AhPutStr"
></A
></A
><B
>hPutStr</B
> :: <A HREF="../base/System-IO.html#t%3AHandle"
>Handle</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="../ghc-prim/GHC-Unit.html#t%3A%28%29"
>()</A
></TD
></TR
><TR
><TD CLASS="doc"
>A synonym for <TT
>hPut</TT
>, for compatibility
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:hPutStrLn"
><A NAME="v%3AhPutStrLn"
></A
></A
><B
>hPutStrLn</B
> :: <A HREF="../base/System-IO.html#t%3AHandle"
>Handle</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="../base/System-IO.html#t%3AIO"
>IO</A
> <A HREF="../ghc-prim/GHC-Unit.html#t%3A%28%29"
>()</A
></TD
></TR
><TR
><TD CLASS="doc"
>Write a ByteString to a handle, appending a newline byte
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:breakByte"
><A NAME="v%3AbreakByte"
></A
></A
><B
>breakByte</B
> :: <A HREF="../base/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> (<A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>, <A HREF="Data-ByteString.html#t%3AByteString"
>ByteString</A
>)</TD
></TR
><TR
><TD CLASS="doc"
><P
><TT
><A HREF="Data-ByteString.html#v%3AbreakByte"
>breakByte</A
></TT
> breaks its ByteString argument at the first occurence
of the specified byte. It is more efficient than <TT
><A HREF="Data-ByteString.html#v%3Abreak"
>break</A
></TT
> as it is
implemented with <TT
>memchr(3)</TT
>. I.e.
</P
><PRE
> break (=='c') "abcd" == breakByte 'c' "abcd"
</PRE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="botbar"
>Produced by <A HREF="http://www.haskell.org/haddock/"
>Haddock</A
> version 2.4.2</TD
></TR
></TABLE
></BODY
></HTML
>
distrib
>
Mandriva
>
2010.0
>
i586
>
media
>
contrib-release
>
by-pkgid
>
1f2b142b9d2ef4849a6f5316fa1c5b12
>
files
>
1548
