Sophie: haskell-hxt-8.3.2-1mdv2010.1 x86

haskell-hxt-8.3.2-1mdv2010.1.x86_64.rpm

<!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.AssocList</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-AssocList.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"
>hxt-8.3.2: A collection of tools for processing XML with Haskell.</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.AssocList</FONT
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
>Description</TD
></TR
><TR
><TD CLASS="doc"
><P
>simple key value assocciation list
 implemented as unordered list of pairs
</P
><P
>Version : $Id: AssocList.hs,v 1.2 2005<EM
>05</EM
>27 13:15:23 hxml Exp $
</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"
>type</SPAN
> <A HREF="#t%3AAssocList"
>AssocList</A
> k v = [(k, v)]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AlookupDef"
>lookupDef</A
> :: <A HREF="/usr/share/doc/ghc/libraries/base/Data-Eq.html#t%3AEq"
>Eq</A
> k =&gt; v -&gt; k -&gt; <A HREF="Data-AssocList.html#t%3AAssocList"
>AssocList</A
> k v -&gt; v</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Alookup1"
>lookup1</A
> :: <A HREF="/usr/share/doc/ghc/libraries/base/Data-Eq.html#t%3AEq"
>Eq</A
> k =&gt; k -&gt; <A HREF="Data-AssocList.html#t%3AAssocList"
>AssocList</A
> k [e] -&gt; [e]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AhasEntry"
>hasEntry</A
> :: <A HREF="/usr/share/doc/ghc/libraries/base/Data-Eq.html#t%3AEq"
>Eq</A
> k =&gt; k -&gt; <A HREF="Data-AssocList.html#t%3AAssocList"
>AssocList</A
> k v -&gt; <A HREF="/usr/share/doc/ghc/libraries/ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AaddEntry"
>addEntry</A
> :: <A HREF="/usr/share/doc/ghc/libraries/base/Data-Eq.html#t%3AEq"
>Eq</A
> k =&gt; k -&gt; v -&gt; <A HREF="Data-AssocList.html#t%3AAssocList"
>AssocList</A
> k v -&gt; <A HREF="Data-AssocList.html#t%3AAssocList"
>AssocList</A
> k v</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AaddEntries"
>addEntries</A
> :: <A HREF="/usr/share/doc/ghc/libraries/base/Data-Eq.html#t%3AEq"
>Eq</A
> k =&gt; <A HREF="Data-AssocList.html#t%3AAssocList"
>AssocList</A
> k v -&gt; <A HREF="Data-AssocList.html#t%3AAssocList"
>AssocList</A
> k v -&gt; <A HREF="Data-AssocList.html#t%3AAssocList"
>AssocList</A
> k v</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AdelEntry"
>delEntry</A
> :: <A HREF="/usr/share/doc/ghc/libraries/base/Data-Eq.html#t%3AEq"
>Eq</A
> k =&gt; k -&gt; <A HREF="Data-AssocList.html#t%3AAssocList"
>AssocList</A
> k v -&gt; <A HREF="Data-AssocList.html#t%3AAssocList"
>AssocList</A
> k v</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AdelEntries"
>delEntries</A
> :: <A HREF="/usr/share/doc/ghc/libraries/base/Data-Eq.html#t%3AEq"
>Eq</A
> k =&gt; [k] -&gt; <A HREF="Data-AssocList.html#t%3AAssocList"
>AssocList</A
> k v -&gt; <A HREF="Data-AssocList.html#t%3AAssocList"
>AssocList</A
> k v</TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
>Documentation</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><SPAN CLASS="keyword"
>type</SPAN
> <A NAME="t:AssocList"
><A NAME="t%3AAssocList"
></A
></A
><B
>AssocList</B
> k v = [(k, v)]</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:lookupDef"
><A NAME="v%3AlookupDef"
></A
></A
><B
>lookupDef</B
> :: <A HREF="/usr/share/doc/ghc/libraries/base/Data-Eq.html#t%3AEq"
>Eq</A
> k =&gt; v -&gt; k -&gt; <A HREF="Data-AssocList.html#t%3AAssocList"
>AssocList</A
> k v -&gt; v</TD
></TR
><TR
><TD CLASS="doc"
>lookup with default value
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:lookup1"
><A NAME="v%3Alookup1"
></A
></A
><B
>lookup1</B
> :: <A HREF="/usr/share/doc/ghc/libraries/base/Data-Eq.html#t%3AEq"
>Eq</A
> k =&gt; k -&gt; <A HREF="Data-AssocList.html#t%3AAssocList"
>AssocList</A
> k [e] -&gt; [e]</TD
></TR
><TR
><TD CLASS="doc"
>lookup with empty list (empty string) as default value
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:hasEntry"
><A NAME="v%3AhasEntry"
></A
></A
><B
>hasEntry</B
> :: <A HREF="/usr/share/doc/ghc/libraries/base/Data-Eq.html#t%3AEq"
>Eq</A
> k =&gt; k -&gt; <A HREF="Data-AssocList.html#t%3AAssocList"
>AssocList</A
> k v -&gt; <A HREF="/usr/share/doc/ghc/libraries/ghc-prim/GHC-Bool.html#t%3ABool"
>Bool</A
></TD
></TR
><TR
><TD CLASS="doc"
>test for existence of a key
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:addEntry"
><A NAME="v%3AaddEntry"
></A
></A
><B
>addEntry</B
> :: <A HREF="/usr/share/doc/ghc/libraries/base/Data-Eq.html#t%3AEq"
>Eq</A
> k =&gt; k -&gt; v -&gt; <A HREF="Data-AssocList.html#t%3AAssocList"
>AssocList</A
> k v -&gt; <A HREF="Data-AssocList.html#t%3AAssocList"
>AssocList</A
> k v</TD
></TR
><TR
><TD CLASS="doc"
>add an entry, remove an existing entry before adding the new one at the top of the list, addEntry is strict
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:addEntries"
><A NAME="v%3AaddEntries"
></A
></A
><B
>addEntries</B
> :: <A HREF="/usr/share/doc/ghc/libraries/base/Data-Eq.html#t%3AEq"
>Eq</A
> k =&gt; <A HREF="Data-AssocList.html#t%3AAssocList"
>AssocList</A
> k v -&gt; <A HREF="Data-AssocList.html#t%3AAssocList"
>AssocList</A
> k v -&gt; <A HREF="Data-AssocList.html#t%3AAssocList"
>AssocList</A
> k v</TD
></TR
><TR
><TD CLASS="doc"
>add a whole list of entries with <TT
><A HREF="Data-AssocList.html#v%3AaddEntry"
>addEntry</A
></TT
>
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:delEntry"
><A NAME="v%3AdelEntry"
></A
></A
><B
>delEntry</B
> :: <A HREF="/usr/share/doc/ghc/libraries/base/Data-Eq.html#t%3AEq"
>Eq</A
> k =&gt; k -&gt; <A HREF="Data-AssocList.html#t%3AAssocList"
>AssocList</A
> k v -&gt; <A HREF="Data-AssocList.html#t%3AAssocList"
>AssocList</A
> k v</TD
></TR
><TR
><TD CLASS="doc"
>delete an entry, delEntry is strict
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:delEntries"
><A NAME="v%3AdelEntries"
></A
></A
><B
>delEntries</B
> :: <A HREF="/usr/share/doc/ghc/libraries/base/Data-Eq.html#t%3AEq"
>Eq</A
> k =&gt; [k] -&gt; <A HREF="Data-AssocList.html#t%3AAssocList"
>AssocList</A
> k v -&gt; <A HREF="Data-AssocList.html#t%3AAssocList"
>AssocList</A
> k v</TD
></TR
><TR
><TD CLASS="doc"
>delete a list of entries with <TT
><A HREF="Data-AssocList.html#v%3AdelEntry"
>delEntry</A
></TT
>
</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.5.0</TD
></TR
></TABLE
></BODY
></HTML
>