Sophie

Sophie

distrib > Fedora > 14 > x86_64 > by-pkgid > 94a4f7d3ef121dc9291cc0566822165d > files > 143

ghc-MissingH-devel-1.1.0.3-2.fc14.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.List.Utils</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-List-Utils.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"
>MissingH-1.1.0.3: Large utility library</TD
><TD CLASS="topbut"
><A HREF="src/Data-List-Utils.html"
>Source code</A
></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.List.Utils</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"
>provisional</TD
></TR
><TR
><TD CLASS="infohead"
>Maintainer</TD
><TD CLASS="infoval"
>John Goerzen &lt;jgoerzen@complete.org&gt; </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"
>Merging
</A
></DT
><DT
><A HREF="#2"
>Tests
</A
></DT
><DT
><A HREF="#3"
>Association List Utilities
</A
></DT
><DD
><DL
><DT
><A HREF="#4"
>Association List Conversions
</A
></DT
></DL
></DD
><DT
><A HREF="#5"
>Conversions
</A
></DT
><DD
><DL
><DT
><A HREF="#6"
>Advanced Conversions
</A
></DT
></DL
></DD
><DT
><A HREF="#7"
>Fixed-Width and State Monad Utilities
</A
></DT
><DT
><A HREF="#8"
>Miscellaneous
</A
></DT
></DL
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
>Description</TD
></TR
><TR
><TD CLASS="doc"
><P
>This module provides various helpful utilities for dealing with lists.
</P
><P
>Written by John Goerzen, jgoerzen@complete.org
</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"
><A HREF="#v%3Amerge"
>merge</A
> :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Ord.html#t%3AOrd"
>Ord</A
> a =&gt; [a] -&gt; [a] -&gt; [a]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AmergeBy"
>mergeBy</A
> ::  (a -&gt; a -&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Ord.html#t%3AOrdering"
>Ordering</A
>) -&gt; [a] -&gt; [a] -&gt; [a]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Astartswith"
>startswith</A
> :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> a =&gt; [a] -&gt; [a] -&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Bool.html#t%3ABool"
>Bool</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Aendswith"
>endswith</A
> :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> a =&gt; [a] -&gt; [a] -&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Bool.html#t%3ABool"
>Bool</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Acontains"
>contains</A
> :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> a =&gt; [a] -&gt; [a] -&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Bool.html#t%3ABool"
>Bool</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AhasAny"
>hasAny</A
> :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> a =&gt; [a] -&gt; [a] -&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Bool.html#t%3ABool"
>Bool</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AaddToAL"
>addToAL</A
> :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> key =&gt; [(key, elt)] -&gt; key -&gt; elt -&gt; [(key, elt)]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AdelFromAL"
>delFromAL</A
> :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> key =&gt; [(key, a)] -&gt; key -&gt; [(key, a)]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AflipAL"
>flipAL</A
> :: (<A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> key, <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> val) =&gt; [(key, val)] -&gt; [(val, [key])]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AkeysAL"
>keysAL</A
> ::  [(key, a)] -&gt; [key]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AvaluesAL"
>valuesAL</A
> ::  [(a, value)] -&gt; [value]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AhasKeyAL"
>hasKeyAL</A
> :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> a =&gt; a -&gt; [(a, b)] -&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Bool.html#t%3ABool"
>Bool</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AstrFromAL"
>strFromAL</A
> :: (<A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Text-Show.html#t%3AShow"
>Show</A
> a, <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Text-Show.html#t%3AShow"
>Show</A
> b) =&gt; [(a, b)] -&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Char.html#t%3AString"
>String</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AstrToAL"
>strToAL</A
> :: (<A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Text-Read.html#t%3ARead"
>Read</A
> a, <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Text-Read.html#t%3ARead"
>Read</A
> b) =&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Char.html#t%3AString"
>String</A
> -&gt; [(a, b)]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Asplit"
>split</A
> :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> a =&gt; [a] -&gt; [a] -&gt; [[a]]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Ajoin"
>join</A
> ::  [a] -&gt; [[a]] -&gt; [a]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Areplace"
>replace</A
> :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> a =&gt; [a] -&gt; [a] -&gt; [a] -&gt; [a]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AgenericJoin"
>genericJoin</A
> :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Text-Show.html#t%3AShow"
>Show</A
> a =&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Char.html#t%3AString"
>String</A
> -&gt; [a] -&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Char.html#t%3AString"
>String</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AtakeWhileList"
>takeWhileList</A
> ::  ([a] -&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Bool.html#t%3ABool"
>Bool</A
>) -&gt; [a] -&gt; [a]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AdropWhileList"
>dropWhileList</A
> ::  ([a] -&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Bool.html#t%3ABool"
>Bool</A
>) -&gt; [a] -&gt; [a]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AspanList"
>spanList</A
> ::  ([a] -&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Bool.html#t%3ABool"
>Bool</A
>) -&gt; [a] -&gt; ([a], [a])</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AbreakList"
>breakList</A
> ::  ([a] -&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Bool.html#t%3ABool"
>Bool</A
>) -&gt; [a] -&gt; ([a], [a])</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><SPAN CLASS="keyword"
>newtype</SPAN
>  <A HREF="#t%3AWholeFunc"
>WholeFunc</A
> a b = <A HREF="#v%3AWholeFunc"
>WholeFunc</A
> ([a] -&gt; (<A HREF="Data-List-Utils.html#t%3AWholeFunc"
>WholeFunc</A
> a b, [a], [b]))</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AwholeMap"
>wholeMap</A
> ::  <A HREF="Data-List-Utils.html#t%3AWholeFunc"
>WholeFunc</A
> a b -&gt; [a] -&gt; [b]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AfixedWidth"
>fixedWidth</A
> ::  [<A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</A
>] -&gt; <A HREF="Data-List-Utils.html#t%3AWholeFunc"
>WholeFunc</A
> a [a]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Agrab"
>grab</A
> ::  <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</A
> -&gt; <A HREF="/usr/share/doc/ghc/html/libraries/mtl-1.1.0.2/Control-Monad-State-Lazy.html#t%3AState"
>State</A
> [a] [a]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AcountElem"
>countElem</A
> :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> a =&gt; a -&gt; [a] -&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AelemRIndex"
>elemRIndex</A
> :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> a =&gt; a -&gt; [a] -&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Maybe.html#t%3AMaybe"
>Maybe</A
> <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AalwaysElemRIndex"
>alwaysElemRIndex</A
> :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> a =&gt; a -&gt; [a] -&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AseqList"
>seqList</A
> ::  [a] -&gt; [a]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AsubIndex"
>subIndex</A
> :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> a =&gt; [a] -&gt; [a] -&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Maybe.html#t%3AMaybe"
>Maybe</A
> <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Auniq"
>uniq</A
> :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> a =&gt; [a] -&gt; [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"
>Merging
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:merge"
><A NAME="v%3Amerge"
></A
></A
><B
>merge</B
> :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Ord.html#t%3AOrd"
>Ord</A
> a =&gt; [a] -&gt; [a] -&gt; [a]</TD
><TD CLASS="declbut"
><A HREF="src/Data-List-Utils.html#merge"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
><P
>Merge two sorted lists into a single, sorted whole.
</P
><P
>Example:
</P
><PRE
> merge [1,3,5] [1,2,4,6] -&gt; [1,1,2,3,4,5,6]
</PRE
><P
>QuickCheck test property:
</P
><P
>prop_merge xs ys =
    merge (sort xs) (sort ys) == sort (xs ++ ys)
          where types = xs :: [Int]
</P
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:mergeBy"
><A NAME="v%3AmergeBy"
></A
></A
><B
>mergeBy</B
> ::  (a -&gt; a -&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Ord.html#t%3AOrdering"
>Ordering</A
>) -&gt; [a] -&gt; [a] -&gt; [a]</TD
><TD CLASS="declbut"
><A HREF="src/Data-List-Utils.html#mergeBy"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
><P
>Merge two sorted lists using into a single, sorted whole,
allowing the programmer to specify the comparison function.
</P
><P
>QuickCheck test property:
</P
><P
>prop_mergeBy xs ys =
    mergeBy cmp (sortBy cmp xs) (sortBy cmp ys) == sortBy cmp (xs ++ ys)
          where types = xs :: [ (Int, Int) ]
                cmp (x1,_) (x2,_) = compare x1 x2
</P
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
><A NAME="2"
><A NAME="2"
>Tests
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:startswith"
><A NAME="v%3Astartswith"
></A
></A
><B
>startswith</B
> :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> a =&gt; [a] -&gt; [a] -&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Bool.html#t%3ABool"
>Bool</A
></TD
><TD CLASS="declbut"
><A HREF="src/Data-List-Utils.html#startswith"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
><P
>Returns true if the given list starts with the specified elements;
false otherwise.  (This is an alias for <A HREF="Data-List-isPrefixOf.html"
>Data.List.isPrefixOf</A
>.)
</P
><P
>Example:
</P
><PRE
> startswith &quot;He&quot; &quot;Hello&quot; -&gt; True
</PRE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:endswith"
><A NAME="v%3Aendswith"
></A
></A
><B
>endswith</B
> :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> a =&gt; [a] -&gt; [a] -&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Bool.html#t%3ABool"
>Bool</A
></TD
><TD CLASS="declbut"
><A HREF="src/Data-List-Utils.html#endswith"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
><P
>Returns true if the given list ends with the specified elements;
false otherwise.  (This is an alias for <A HREF="Data-List-isSuffixOf.html"
>Data.List.isSuffixOf</A
>.)
</P
><P
>Example:
</P
><PRE
> endswith &quot;lo&quot; &quot;Hello&quot; -&gt; True
</PRE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:contains"
><A NAME="v%3Acontains"
></A
></A
><B
>contains</B
> :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> a =&gt; [a] -&gt; [a] -&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Bool.html#t%3ABool"
>Bool</A
></TD
><TD CLASS="declbut"
><A HREF="src/Data-List-Utils.html#contains"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
><P
>Returns true if the given parameter is a sublist of the given list;
false otherwise.
</P
><P
>Example:
</P
><PRE
> contains &quot;Haskell&quot; &quot;I really like Haskell.&quot; -&gt; True
 contains &quot;Haskell&quot; &quot;OCaml is great.&quot; -&gt; False
</PRE
><P
>This function was submitted to GHC and was applied as
<TT
><A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-List.html#v%3AisInfixOf"
>isInfixOf</A
></TT
>.  This function therefore is deprecated and will
be removed in future versions.
</P
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:hasAny"
><A NAME="v%3AhasAny"
></A
></A
><B
>hasAny</B
></TD
><TD CLASS="declbut"
><A HREF="src/Data-List-Utils.html#hasAny"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="body"
><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD CLASS="arg"
>:: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> a</TD
><TD CLASS="rdoc"
></TD
></TR
><TR
><TD CLASS="arg"
>=&gt; [a]</TD
><TD CLASS="rdoc"
>List of elements to look for
</TD
></TR
><TR
><TD CLASS="arg"
>-&gt; [a]</TD
><TD CLASS="rdoc"
>List to search
</TD
></TR
><TR
><TD CLASS="arg"
>-&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Bool.html#t%3ABool"
>Bool</A
></TD
><TD CLASS="rdoc"
>Result
</TD
></TR
><TR
><TD CLASS="ndoc" COLSPAN="2"
>Returns true if the given list contains any of the elements in the search
list. 
</TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
><A NAME="3"
><A NAME="3"
>Association List Utilities
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="doc"
>These functions are designed to augment the
                     association list functions in <A HREF="Data-List.html"
>Data.List</A
> and
                     provide an interface similar to <A HREF="Data-FiniteMap.html"
>Data.FiniteMap</A
> or
                     <A HREF="Data-Map.html"
>Data.Map</A
>
                     for association lists. 
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:addToAL"
><A NAME="v%3AaddToAL"
></A
></A
><B
>addToAL</B
> :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> key =&gt; [(key, elt)] -&gt; key -&gt; elt -&gt; [(key, elt)]</TD
><TD CLASS="declbut"
><A HREF="src/Data-List-Utils.html#addToAL"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
>Adds the specified (key, value) pair to the given list, removing any
existing pair with the same key already present. 
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:delFromAL"
><A NAME="v%3AdelFromAL"
></A
></A
><B
>delFromAL</B
> :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> key =&gt; [(key, a)] -&gt; key -&gt; [(key, a)]</TD
><TD CLASS="declbut"
><A HREF="src/Data-List-Utils.html#delFromAL"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
>Removes all (key, value) pairs from the given list where the key
matches the given one. 
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:flipAL"
><A NAME="v%3AflipAL"
></A
></A
><B
>flipAL</B
> :: (<A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> key, <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> val) =&gt; [(key, val)] -&gt; [(val, [key])]</TD
><TD CLASS="declbut"
><A HREF="src/Data-List-Utils.html#flipAL"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
>Flips an association list.  Converts (key1, val), (key2, val) pairs
to (val, [key1, key2]). 
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:keysAL"
><A NAME="v%3AkeysAL"
></A
></A
><B
>keysAL</B
> ::  [(key, a)] -&gt; [key]</TD
><TD CLASS="declbut"
><A HREF="src/Data-List-Utils.html#keysAL"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
><P
>Returns the keys that comprise the (key, value) pairs of the given AL.
</P
><P
>Same as:
</P
><PRE
>map fst
</PRE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:valuesAL"
><A NAME="v%3AvaluesAL"
></A
></A
><B
>valuesAL</B
> ::  [(a, value)] -&gt; [value]</TD
><TD CLASS="declbut"
><A HREF="src/Data-List-Utils.html#valuesAL"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
><P
>Returns the values the comprise the (key, value) pairs of the given
AL.
</P
><P
>Same as:
</P
><PRE
>map snd
</PRE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:hasKeyAL"
><A NAME="v%3AhasKeyAL"
></A
></A
><B
>hasKeyAL</B
> :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> a =&gt; a -&gt; [(a, b)] -&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Bool.html#t%3ABool"
>Bool</A
></TD
><TD CLASS="declbut"
><A HREF="src/Data-List-Utils.html#hasKeyAL"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
>Indicates whether or not the given key is in the AL. 
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section2"
><A NAME="4"
><A NAME="4"
>Association List Conversions
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:strFromAL"
><A NAME="v%3AstrFromAL"
></A
></A
><B
>strFromAL</B
> :: (<A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Text-Show.html#t%3AShow"
>Show</A
> a, <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Text-Show.html#t%3AShow"
>Show</A
> b) =&gt; [(a, b)] -&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Char.html#t%3AString"
>String</A
></TD
><TD CLASS="declbut"
><A HREF="src/Data-List-Utils.html#strFromAL"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
><P
>Converts an association list to a string.  The string will have
one pair per line, with the key and value both represented as a Haskell string.
</P
><P
>This function is designed to work with [(String, String)] association lists,
but may work with other types as well. 
</P
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:strToAL"
><A NAME="v%3AstrToAL"
></A
></A
><B
>strToAL</B
> :: (<A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Text-Read.html#t%3ARead"
>Read</A
> a, <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Text-Read.html#t%3ARead"
>Read</A
> b) =&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Char.html#t%3AString"
>String</A
> -&gt; [(a, b)]</TD
><TD CLASS="declbut"
><A HREF="src/Data-List-Utils.html#strToAL"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
><P
>The inverse of <TT
><A HREF="Data-List-Utils.html#v%3AstrFromAL"
>strFromAL</A
></TT
>, this function reads a string and outputs the
appropriate association list. 
</P
><P
>Like <TT
><A HREF="Data-List-Utils.html#v%3AstrFromAL"
>strFromAL</A
></TT
>, this is designed to work with [(String, String)] association
lists but may also work with other objects with simple representations.
</P
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
><A NAME="5"
><A NAME="5"
>Conversions
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:split"
><A NAME="v%3Asplit"
></A
></A
><B
>split</B
> :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> a =&gt; [a] -&gt; [a] -&gt; [[a]]</TD
><TD CLASS="declbut"
><A HREF="src/Data-List-Utils.html#split"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
><P
>Given a delimiter and a list (or string), split into components.
</P
><P
>Example:
</P
><PRE
> split &quot;,&quot; &quot;foo,bar,,baz,&quot; -&gt; [&quot;foo&quot;, &quot;bar&quot;, &quot;&quot;, &quot;baz&quot;, &quot;&quot;]
</PRE
><PRE
> split &quot;ba&quot; &quot;,foo,bar,,baz,&quot; -&gt; [&quot;,foo,&quot;,&quot;r,,&quot;,&quot;z,&quot;]
</PRE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:join"
><A NAME="v%3Ajoin"
></A
></A
><B
>join</B
> ::  [a] -&gt; [[a]] -&gt; [a]</TD
><TD CLASS="declbut"
><A HREF="src/Data-List-Utils.html#join"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
><P
>Given a delimiter and a list of items (or strings), join the items
by using the delimiter.
</P
><P
>Example:
</P
><PRE
> join &quot;|&quot; [&quot;foo&quot;, &quot;bar&quot;, &quot;baz&quot;] -&gt; &quot;foo|bar|baz&quot;
</PRE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:replace"
><A NAME="v%3Areplace"
></A
></A
><B
>replace</B
> :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> a =&gt; [a] -&gt; [a] -&gt; [a] -&gt; [a]</TD
><TD CLASS="declbut"
><A HREF="src/Data-List-Utils.html#replace"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
><P
>Given a list and a replacement list, replaces each occurance of the search
list with the replacement list in the operation list.
</P
><P
>Example:
</P
><PRE
>replace &quot;,&quot; &quot;.&quot; &quot;127,0,0,1&quot; -&gt; &quot;127.0.0.1&quot;
</PRE
><P
>This could logically be thought of as:
</P
><PRE
>replace old new l = join new . split old $ l
</PRE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:genericJoin"
><A NAME="v%3AgenericJoin"
></A
></A
><B
>genericJoin</B
> :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Text-Show.html#t%3AShow"
>Show</A
> a =&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Char.html#t%3AString"
>String</A
> -&gt; [a] -&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Char.html#t%3AString"
>String</A
></TD
><TD CLASS="declbut"
><A HREF="src/Data-List-Utils.html#genericJoin"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
><P
>Like <TT
><A HREF="Data-List-Utils.html#v%3Ajoin"
>join</A
></TT
>, but works with a list of anything showable, converting
it to a String.
</P
><P
>Examples:
</P
><PRE
> genericJoin &quot;, &quot; [1, 2, 3, 4] -&gt; &quot;1, 2, 3, 4&quot;
 genericJoin &quot;|&quot; [&quot;foo&quot;, &quot;bar&quot;, &quot;baz&quot;] -&gt; &quot;\&quot;foo\&quot;|\&quot;bar\&quot;|\&quot;baz\&quot;&quot;
</PRE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:takeWhileList"
><A NAME="v%3AtakeWhileList"
></A
></A
><B
>takeWhileList</B
> ::  ([a] -&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Bool.html#t%3ABool"
>Bool</A
>) -&gt; [a] -&gt; [a]</TD
><TD CLASS="declbut"
><A HREF="src/Data-List-Utils.html#takeWhileList"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
>Similar to Data.List.takeWhile, takes elements while the func is true.
The function is given the remainder of the list to examine. 
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:dropWhileList"
><A NAME="v%3AdropWhileList"
></A
></A
><B
>dropWhileList</B
> ::  ([a] -&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Bool.html#t%3ABool"
>Bool</A
>) -&gt; [a] -&gt; [a]</TD
><TD CLASS="declbut"
><A HREF="src/Data-List-Utils.html#dropWhileList"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
>Similar to Data.List.dropWhile, drops elements while the func is true.
The function is given the remainder of the list to examine. 
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:spanList"
><A NAME="v%3AspanList"
></A
></A
><B
>spanList</B
> ::  ([a] -&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Bool.html#t%3ABool"
>Bool</A
>) -&gt; [a] -&gt; ([a], [a])</TD
><TD CLASS="declbut"
><A HREF="src/Data-List-Utils.html#spanList"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
><P
>Similar to Data.List.span, but performs the test on the entire remaining
list instead of just one element. 
</P
><P
><TT
>spanList p xs</TT
> is the same as <TT
>(takeWhileList p xs, dropWhileList p xs)</TT
> 
</P
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:breakList"
><A NAME="v%3AbreakList"
></A
></A
><B
>breakList</B
> ::  ([a] -&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Bool.html#t%3ABool"
>Bool</A
>) -&gt; [a] -&gt; ([a], [a])</TD
><TD CLASS="declbut"
><A HREF="src/Data-List-Utils.html#breakList"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
>Similar to Data.List.break, but performs the test on the entire remaining
list instead of just one element.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section2"
><A NAME="6"
><A NAME="6"
>Advanced Conversions
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><SPAN CLASS="keyword"
>newtype</SPAN
>  <A NAME="t:WholeFunc"
><A NAME="t%3AWholeFunc"
></A
></A
><B
>WholeFunc</B
> a b </TD
><TD CLASS="declbut"
><A HREF="src/Data-List-Utils.html#WholeFunc"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="body"
><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD CLASS="ndoc"
>The type used for functions for <TT
><A HREF="Data-List-Utils.html#v%3AwholeMap"
>wholeMap</A
></TT
>.  See <TT
><A HREF="Data-List-Utils.html#v%3AwholeMap"
>wholeMap</A
></TT
> for details.
</TD
></TR
><TR
><TD CLASS="section4"
>Constructors</TD
></TR
><TR
><TD CLASS="body"
><TABLE CLASS="vanilla" CELLSPACING="1" CELLPADDING="0"
><TR
><TD CLASS="arg"
><A NAME="v:WholeFunc"
><A NAME="v%3AWholeFunc"
></A
></A
><B
>WholeFunc</B
> ([a] -&gt; (<A HREF="Data-List-Utils.html#t%3AWholeFunc"
>WholeFunc</A
> a b, [a], [b]))</TD
><TD CLASS="rdoc"
></TD
></TR
></TABLE
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:wholeMap"
><A NAME="v%3AwholeMap"
></A
></A
><B
>wholeMap</B
> ::  <A HREF="Data-List-Utils.html#t%3AWholeFunc"
>WholeFunc</A
> a b -&gt; [a] -&gt; [b]</TD
><TD CLASS="declbut"
><A HREF="src/Data-List-Utils.html#wholeMap"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
><P
>This is an enhanced version of the concatMap or map functions in 
Data.List.
</P
><P
>Unlike those functions, this one:
</P
><UL
><LI
> Can consume a varying number of elements from the input list during
   each iteration
</LI
><LI
> Can arbitrarily decide when to stop processing data
</LI
><LI
> Can return a varying number of elements to insert into the output list
</LI
><LI
> Can actually switch processing functions mid-stream
</LI
><LI
> Is not even restricted to processing the input list intact
</LI
></UL
><P
>The function used by wholeMap, of type <TT
><A HREF="Data-List-Utils.html#t%3AWholeFunc"
>WholeFunc</A
></TT
>, is repeatedly called
with the input list.  The function returns three things: the function
to call for the next iteration (if any), what remains of the input list,
and the list of output elements generated during this iteration.  The return
value of <TT
><A HREF="Data-List-Utils.html#v%3AwholeMap"
>wholeMap</A
></TT
> is the concatenation of the output element lists from
all iterations.
</P
><P
>Processing stops when the remaining input list is empty.  An example
of a <TT
><A HREF="Data-List-Utils.html#t%3AWholeFunc"
>WholeFunc</A
></TT
> is <TT
><A HREF="Data-List-Utils.html#v%3AfixedWidth"
>fixedWidth</A
></TT
>. 
</P
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:fixedWidth"
><A NAME="v%3AfixedWidth"
></A
></A
><B
>fixedWidth</B
> ::  [<A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</A
>] -&gt; <A HREF="Data-List-Utils.html#t%3AWholeFunc"
>WholeFunc</A
> a [a]</TD
><TD CLASS="declbut"
><A HREF="src/Data-List-Utils.html#fixedWidth"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
><P
>A parser designed to process fixed-width input fields.  Use it with
<TT
><A HREF="Data-List-Utils.html#v%3AwholeMap"
>wholeMap</A
></TT
>.
</P
><P
>The Int list passed to this function is the list of the field widths desired
from the input.  The result is a list of those widths, if possible.  If any
of the input remains after processing this list, it is added on as the final
element in the result list.  If the input is less than the sum of the requested
widths, then the result list will be short the appropriate number of elements,
and its final element may be shorter than requested.
</P
><P
>Examples:
</P
><PRE
>wholeMap (fixedWidth [1, 2, 3]) &quot;1234567890&quot;
 --&gt; [&quot;1&quot;,&quot;23&quot;,&quot;456&quot;,&quot;7890&quot;]
wholeMap (fixedWidth (repeat 2)) &quot;123456789&quot;
 --&gt; [&quot;12&quot;,&quot;34&quot;,&quot;56&quot;,&quot;78&quot;,&quot;9&quot;]
wholeMap (fixedWidth []) &quot;123456789&quot;
 --&gt; [&quot;123456789&quot;]
wholeMap (fixedWidth [5, 3, 6, 1]) &quot;Hello, This is a test.&quot;
 --&gt; [&quot;Hello&quot;,&quot;, T&quot;,&quot;his is&quot;,&quot; &quot;,&quot;a test.&quot;]
</PRE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
><A NAME="7"
><A NAME="7"
>Fixed-Width and State Monad Utilities
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:grab"
><A NAME="v%3Agrab"
></A
></A
><B
>grab</B
> ::  <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</A
> -&gt; <A HREF="/usr/share/doc/ghc/html/libraries/mtl-1.1.0.2/Control-Monad-State-Lazy.html#t%3AState"
>State</A
> [a] [a]</TD
><TD CLASS="declbut"
><A HREF="src/Data-List-Utils.html#grab"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
><P
>Helps you pick out fixed-width components from a list.
</P
><P
>Example:
</P
><PRE
>conv :: String -&gt; (String,String)
conv = runState $
        do f3 &lt;- grab 3
           n2 &lt;- grab 2
           return $ f3 ++ &quot;,&quot; ++ n2

main = print $ conv &quot;TestIng&quot;
</PRE
><P
>Prints:
</P
><PRE
>(&quot;Tes,tI&quot;,&quot;ng&quot;)
</PRE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
><A NAME="8"
><A NAME="8"
>Miscellaneous
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:countElem"
><A NAME="v%3AcountElem"
></A
></A
><B
>countElem</B
> :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> a =&gt; a -&gt; [a] -&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</A
></TD
><TD CLASS="declbut"
><A HREF="src/Data-List-Utils.html#countElem"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
>Returns a count of the number of times the given element occured in the
given list. 
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:elemRIndex"
><A NAME="v%3AelemRIndex"
></A
></A
><B
>elemRIndex</B
> :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> a =&gt; a -&gt; [a] -&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Maybe.html#t%3AMaybe"
>Maybe</A
> <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</A
></TD
><TD CLASS="declbut"
><A HREF="src/Data-List-Utils.html#elemRIndex"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
>Returns the rightmost index of the given element in the
given list. 
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:alwaysElemRIndex"
><A NAME="v%3AalwaysElemRIndex"
></A
></A
><B
>alwaysElemRIndex</B
> :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> a =&gt; a -&gt; [a] -&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</A
></TD
><TD CLASS="declbut"
><A HREF="src/Data-List-Utils.html#alwaysElemRIndex"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
>Like elemRIndex, but returns -1 if there is nothing
found. 
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:seqList"
><A NAME="v%3AseqList"
></A
></A
><B
>seqList</B
> ::  [a] -&gt; [a]</TD
><TD CLASS="declbut"
><A HREF="src/Data-List-Utils.html#seqList"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
>Forces the evaluation of the entire list. 
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:subIndex"
><A NAME="v%3AsubIndex"
></A
></A
><B
>subIndex</B
> :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> a =&gt; [a] -&gt; [a] -&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Maybe.html#t%3AMaybe"
>Maybe</A
> <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</A
></TD
><TD CLASS="declbut"
><A HREF="src/Data-List-Utils.html#subIndex"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
><P
>Similar to Data.List.elemIndex.  Instead of looking for one element in a
list, this function looks for the first occurance of a sublist in the list,
and returns the index of the first element of that occurance.  If there is no
such list, returns Nothing.
</P
><P
>If the list to look for is the empty list, will return Just 0 regardless
of the content of the list to search.
</P
><P
>Examples:
</P
><PRE
>subIndex &quot;foo&quot; &quot;asdfoobar&quot; -&gt; Just 3
subIndex &quot;foo&quot; [] -&gt; Nothing
subIndex &quot;&quot; [] -&gt; Just 0
subIndex &quot;&quot; &quot;asdf&quot; -&gt; Just 0
subIndex &quot;test&quot; &quot;asdftestbartest&quot; -&gt; Just 4
subIndex [(1::Int), 2] [0, 5, 3, 2, 1, 2, 4] -&gt; Just 4
</PRE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:uniq"
><A NAME="v%3Auniq"
></A
></A
><B
>uniq</B
> :: <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> a =&gt; [a] -&gt; [a]</TD
><TD CLASS="declbut"
><A HREF="src/Data-List-Utils.html#uniq"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
><P
>Given a list, returns a new list with all duplicate elements removed.
For example:
</P
><PRE
>uniq &quot;Mississippi&quot; -&gt; &quot;Misp&quot;
</PRE
><P
>You should not rely on this function necessarily preserving order, though
the current implementation happens to.
</P
><P
>This function is not compatible with infinite lists.
</P
><P
>This is presently an alias for Data.List.nub
</P
></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
>

Perl :: Catalyst :: PostgreSQL :: RPM Valid HTML 4.01 Transitional