<!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.Binary.Builder</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-Binary-Builder.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"
>ghc-binary-0.5.0.2: Binary serialisation for Haskell values using lazy ByteStrings</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.Binary.Builder</FONT
></TD
><TD ALIGN="right"
><TABLE CLASS="narrow" CELLSPACING="0" CELLPADDING="0"
><TR
><TD CLASS="infohead"
>Portability</TD
><TD CLASS="infoval"
>portable to Hugs and GHC</TD
></TR
><TR
><TD CLASS="infohead"
>Stability</TD
><TD CLASS="infoval"
>experimental</TD
></TR
><TR
><TD CLASS="infohead"
>Maintainer</TD
><TD CLASS="infoval"
>Lennart Kolmodin <kolmodin@dtek.chalmers.se></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 Builder type
</A
></DT
><DT
><A HREF="#2"
>Constructing Builders
</A
></DT
><DT
><A HREF="#3"
>Flushing the buffer state
</A
></DT
><DT
><A HREF="#4"
>Derived Builders
</A
></DT
><DD
><DL
><DT
><A HREF="#5"
>Big-endian writes
</A
></DT
><DT
><A HREF="#6"
>Little-endian writes
</A
></DT
><DT
><A HREF="#7"
>Host-endian, unaligned writes
</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"
>Efficient construction of lazy bytestrings.
</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%3ABuilder"
>Builder</A
> </TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AtoLazyByteString"
>toLazyByteString</A
> :: <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
> -> <A HREF="../bytestring-0.9.1.7/Data-ByteString-Lazy.html#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-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Asingleton"
>singleton</A
> :: <A HREF="../base-4.2.0.2/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Aappend"
>append</A
> :: <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
> -> <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
> -> <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AfromByteString"
>fromByteString</A
> :: <A HREF="../bytestring-0.9.1.7/Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AfromLazyByteString"
>fromLazyByteString</A
> :: <A HREF="../bytestring-0.9.1.7/Data-ByteString-Lazy.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Aflush"
>flush</A
> :: <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AputWord16be"
>putWord16be</A
> :: <A HREF="../base-4.2.0.2/Data-Word.html#t%3AWord16"
>Word16</A
> -> <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AputWord32be"
>putWord32be</A
> :: <A HREF="../base-4.2.0.2/Data-Word.html#t%3AWord32"
>Word32</A
> -> <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AputWord64be"
>putWord64be</A
> :: <A HREF="../base-4.2.0.2/Data-Word.html#t%3AWord64"
>Word64</A
> -> <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AputWord16le"
>putWord16le</A
> :: <A HREF="../base-4.2.0.2/Data-Word.html#t%3AWord16"
>Word16</A
> -> <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AputWord32le"
>putWord32le</A
> :: <A HREF="../base-4.2.0.2/Data-Word.html#t%3AWord32"
>Word32</A
> -> <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AputWord64le"
>putWord64le</A
> :: <A HREF="../base-4.2.0.2/Data-Word.html#t%3AWord64"
>Word64</A
> -> <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AputWordhost"
>putWordhost</A
> :: <A HREF="../base-4.2.0.2/Data-Word.html#t%3AWord"
>Word</A
> -> <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AputWord16host"
>putWord16host</A
> :: <A HREF="../base-4.2.0.2/Data-Word.html#t%3AWord16"
>Word16</A
> -> <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AputWord32host"
>putWord32host</A
> :: <A HREF="../base-4.2.0.2/Data-Word.html#t%3AWord32"
>Word32</A
> -> <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AputWord64host"
>putWord64host</A
> :: <A HREF="../base-4.2.0.2/Data-Word.html#t%3AWord64"
>Word64</A
> -> <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</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 Builder type
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><SPAN CLASS="keyword"
>data</SPAN
> <A NAME="t:Builder"
><A NAME="t%3ABuilder"
></A
></A
><B
>Builder</B
> </TD
></TR
><TR
><TD CLASS="body"
><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD CLASS="ndoc"
><P
>A <TT
><A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TT
> is an efficient way to build lazy <TT
><A HREF="../bytestring-0.9.1.7/Data-ByteString-Lazy.html#t%3AByteString"
>ByteString</A
></TT
>s.
There are several functions for constructing <TT
><A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TT
>s, but only one
to inspect them: to extract any data, you have to turn them into lazy
<TT
><A HREF="../bytestring-0.9.1.7/Data-ByteString-Lazy.html#t%3AByteString"
>ByteString</A
></TT
>s using <TT
><A HREF="Data-Binary-Builder.html#v%3AtoLazyByteString"
>toLazyByteString</A
></TT
>.
</P
><P
>Internally, a <TT
><A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TT
> constructs a lazy L.Bytestring by filling byte
arrays piece by piece. As each buffer is filled, it is 'popped'
off, to become a new chunk of the resulting lazy <TT
><A HREF="../bytestring-0.9.1.7/Data-ByteString-Lazy.html#t%3AByteString"
>ByteString</A
></TT
>.
All this is hidden from the user of the <TT
><A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TT
>.
</P
></TD
></TR
><TR
><TD CLASS="section4"
><IMG SRC="minus.gif" CLASS="coll" ONCLICK="toggle(this,'i:Builder')" ALT="show/hide"
> Instances</TD
></TR
><TR
><TD CLASS="body"
><DIV ID="i:Builder" STYLE="display:block;"
><TABLE CLASS="vanilla" CELLSPACING="1" CELLPADDING="0"
><TR
><TD CLASS="decl"
><A HREF="../base-4.2.0.2/Data-Monoid.html#t%3AMonoid"
>Monoid</A
> <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TD
></TR
></TABLE
></DIV
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:toLazyByteString"
><A NAME="v%3AtoLazyByteString"
></A
></A
><B
>toLazyByteString</B
> :: <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
> -> <A HREF="../bytestring-0.9.1.7/Data-ByteString-Lazy.html#t%3AByteString"
>ByteString</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(n).</EM
> Extract a lazy <TT
><A HREF="../bytestring-0.9.1.7/Data-ByteString-Lazy.html#t%3AByteString"
>ByteString</A
></TT
> from a <TT
><A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TT
>.
The construction work takes place if and when the relevant part of
the lazy <TT
><A HREF="../bytestring-0.9.1.7/Data-ByteString-Lazy.html#t%3AByteString"
>ByteString</A
></TT
> is demanded.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
><A NAME="2"
><A NAME="2"
>Constructing Builders
</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-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TD
></TR
><TR
><TD CLASS="doc"
><P
><EM
>O(1).</EM
> The empty Builder, satisfying
</P
><UL
><LI
><PRE
><TT
><A HREF="Data-Binary-Builder.html#v%3AtoLazyByteString"
>toLazyByteString</A
></TT
> <TT
><A HREF="Data-Binary-Builder.html#v%3Aempty"
>empty</A
></TT
> = <TT
><A HREF="../bytestring-0.9.1.7/Data-ByteString-Lazy.html#v%3Aempty"
>empty</A
></TT
></PRE
></LI
></UL
></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-4.2.0.2/Data-Word.html#t%3AWord8"
>Word8</A
> -> <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TD
></TR
><TR
><TD CLASS="doc"
><P
><EM
>O(1).</EM
> A Builder taking a single byte, satisfying
</P
><UL
><LI
><PRE
><TT
><A HREF="Data-Binary-Builder.html#v%3AtoLazyByteString"
>toLazyByteString</A
></TT
> (<TT
><A HREF="Data-Binary-Builder.html#v%3Asingleton"
>singleton</A
></TT
> b) = <TT
><A HREF="../bytestring-0.9.1.7/Data-ByteString-Lazy.html#v%3Asingleton"
>singleton</A
></TT
> b</PRE
></LI
></UL
></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-Binary-Builder.html#t%3ABuilder"
>Builder</A
> -> <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
> -> <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TD
></TR
><TR
><TD CLASS="doc"
><P
><EM
>O(1).</EM
> The concatenation of two Builders, an associative operation
with identity <TT
><A HREF="Data-Binary-Builder.html#v%3Aempty"
>empty</A
></TT
>, satisfying
</P
><UL
><LI
><PRE
><TT
><A HREF="Data-Binary-Builder.html#v%3AtoLazyByteString"
>toLazyByteString</A
></TT
> (<TT
><A HREF="Data-Binary-Builder.html#v%3Aappend"
>append</A
></TT
> x y) = <TT
><A HREF="../bytestring-0.9.1.7/Data-ByteString-Lazy.html#v%3Aappend"
>append</A
></TT
> (<TT
><A HREF="Data-Binary-Builder.html#v%3AtoLazyByteString"
>toLazyByteString</A
></TT
> x) (<TT
><A HREF="Data-Binary-Builder.html#v%3AtoLazyByteString"
>toLazyByteString</A
></TT
> y)</PRE
></LI
></UL
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:fromByteString"
><A NAME="v%3AfromByteString"
></A
></A
><B
>fromByteString</B
> :: <A HREF="../bytestring-0.9.1.7/Data-ByteString.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TD
></TR
><TR
><TD CLASS="doc"
><P
><EM
>O(1).</EM
> A Builder taking a <TT
><A HREF="../bytestring-0.9.1.7/Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
>, satisfying
</P
><UL
><LI
><PRE
><TT
><A HREF="Data-Binary-Builder.html#v%3AtoLazyByteString"
>toLazyByteString</A
></TT
> (<TT
><A HREF="Data-Binary-Builder.html#v%3AfromByteString"
>fromByteString</A
></TT
> bs) = <TT
><A HREF="../bytestring-0.9.1.7/Data-ByteString-Lazy.html#v%3AfromChunks"
>fromChunks</A
></TT
> [bs]</PRE
></LI
></UL
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:fromLazyByteString"
><A NAME="v%3AfromLazyByteString"
></A
></A
><B
>fromLazyByteString</B
> :: <A HREF="../bytestring-0.9.1.7/Data-ByteString-Lazy.html#t%3AByteString"
>ByteString</A
> -> <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TD
></TR
><TR
><TD CLASS="doc"
><P
><EM
>O(1).</EM
> A Builder taking a lazy <TT
><A HREF="../bytestring-0.9.1.7/Data-ByteString-Lazy.html#t%3AByteString"
>ByteString</A
></TT
>, satisfying
</P
><UL
><LI
><PRE
><TT
><A HREF="Data-Binary-Builder.html#v%3AtoLazyByteString"
>toLazyByteString</A
></TT
> (<TT
><A HREF="Data-Binary-Builder.html#v%3AfromLazyByteString"
>fromLazyByteString</A
></TT
> bs) = bs</PRE
></LI
></UL
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
><A NAME="3"
><A NAME="3"
>Flushing the buffer state
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:flush"
><A NAME="v%3Aflush"
></A
></A
><B
>flush</B
> :: <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(1).</EM
> Pop the <TT
><A HREF="../bytestring-0.9.1.7/Data-ByteString.html#t%3AByteString"
>ByteString</A
></TT
> we have constructed so far, if any,
yielding a new chunk in the result lazy <TT
><A HREF="../bytestring-0.9.1.7/Data-ByteString-Lazy.html#t%3AByteString"
>ByteString</A
></TT
>.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
><A NAME="4"
><A NAME="4"
>Derived Builders
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section2"
><A NAME="5"
><A NAME="5"
>Big-endian writes
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:putWord16be"
><A NAME="v%3AputWord16be"
></A
></A
><B
>putWord16be</B
> :: <A HREF="../base-4.2.0.2/Data-Word.html#t%3AWord16"
>Word16</A
> -> <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TD
></TR
><TR
><TD CLASS="doc"
>Write a Word16 in big endian format
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:putWord32be"
><A NAME="v%3AputWord32be"
></A
></A
><B
>putWord32be</B
> :: <A HREF="../base-4.2.0.2/Data-Word.html#t%3AWord32"
>Word32</A
> -> <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TD
></TR
><TR
><TD CLASS="doc"
>Write a Word32 in big endian format
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:putWord64be"
><A NAME="v%3AputWord64be"
></A
></A
><B
>putWord64be</B
> :: <A HREF="../base-4.2.0.2/Data-Word.html#t%3AWord64"
>Word64</A
> -> <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TD
></TR
><TR
><TD CLASS="doc"
>Write a Word64 in big endian format
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section2"
><A NAME="6"
><A NAME="6"
>Little-endian writes
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:putWord16le"
><A NAME="v%3AputWord16le"
></A
></A
><B
>putWord16le</B
> :: <A HREF="../base-4.2.0.2/Data-Word.html#t%3AWord16"
>Word16</A
> -> <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TD
></TR
><TR
><TD CLASS="doc"
>Write a Word16 in little endian format
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:putWord32le"
><A NAME="v%3AputWord32le"
></A
></A
><B
>putWord32le</B
> :: <A HREF="../base-4.2.0.2/Data-Word.html#t%3AWord32"
>Word32</A
> -> <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TD
></TR
><TR
><TD CLASS="doc"
>Write a Word32 in little endian format
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:putWord64le"
><A NAME="v%3AputWord64le"
></A
></A
><B
>putWord64le</B
> :: <A HREF="../base-4.2.0.2/Data-Word.html#t%3AWord64"
>Word64</A
> -> <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TD
></TR
><TR
><TD CLASS="doc"
>Write a Word64 in little endian format
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section2"
><A NAME="7"
><A NAME="7"
>Host-endian, unaligned writes
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:putWordhost"
><A NAME="v%3AputWordhost"
></A
></A
><B
>putWordhost</B
> :: <A HREF="../base-4.2.0.2/Data-Word.html#t%3AWord"
>Word</A
> -> <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TD
></TR
><TR
><TD CLASS="doc"
><EM
>O(1).</EM
> A Builder taking a single native machine word. The word is
written in host order, host endian form, for the machine you're on.
On a 64 bit machine the Word is an 8 byte value, on a 32 bit machine,
4 bytes. Values written this way are not portable to
different endian or word sized machines, without conversion.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:putWord16host"
><A NAME="v%3AputWord16host"
></A
></A
><B
>putWord16host</B
> :: <A HREF="../base-4.2.0.2/Data-Word.html#t%3AWord16"
>Word16</A
> -> <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TD
></TR
><TR
><TD CLASS="doc"
>Write a Word16 in native host order and host endianness.
2 bytes will be written, unaligned.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:putWord32host"
><A NAME="v%3AputWord32host"
></A
></A
><B
>putWord32host</B
> :: <A HREF="../base-4.2.0.2/Data-Word.html#t%3AWord32"
>Word32</A
> -> <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TD
></TR
><TR
><TD CLASS="doc"
>Write a Word32 in native host order and host endianness.
4 bytes will be written, unaligned.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:putWord64host"
><A NAME="v%3AputWord64host"
></A
></A
><B
>putWord64host</B
> :: <A HREF="../base-4.2.0.2/Data-Word.html#t%3AWord64"
>Word64</A
> -> <A HREF="Data-Binary-Builder.html#t%3ABuilder"
>Builder</A
></TD
></TR
><TR
><TD CLASS="doc"
>Write a Word64 in native host order.
On a 32 bit machine we write two host order Word32s, in big endian form.
8 bytes will be written, unaligned.
</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.6.1</TD
></TR
></TABLE
></BODY
></HTML
>
