Sophie

Sophie

distrib > Fedora > 14 > x86_64 > by-pkgid > c4c339edd383087c94d9f30c027b8418 > files > 67

ghc-regex-tdfa-devel-1.1.8-1.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
>Text.Regex.TDFA.IntArrTrieSet</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_Text-Regex-TDFA-IntArrTrieSet.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"
>regex-tdfa-1.1.8: Replaces/Enhances Text.Regex</TD
><TD CLASS="topbut"
><A HREF="src/Text-Regex-TDFA-IntArrTrieSet.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"
>Text.Regex.TDFA.IntArrTrieSet</FONT
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
>Description</TD
></TR
><TR
><TD CLASS="doc"
><P
>This creates a lazy Trie based on a finite range of Ints and is used to
memorize a function over the subsets of this range.
</P
><P
>To create a Trie you need two supply 2 things
  * Range of keys to bound
  * A function or functions used to construct the value for a subset of keys
</P
><P
>The Trie uses the Array type internally.
</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%3ATrieSet"
>TrieSet</A
> v = <A HREF="#v%3ATrieSet"
>TrieSet</A
> {<TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD CLASS="recfield"
><A HREF="#v%3Avalue"
>value</A
> :: v</TD
></TR
><TR
><TD CLASS="recfield"
><A HREF="#v%3Anext"
>next</A
> :: <A HREF="/usr/share/doc/ghc/html/libraries/array-0.3.0.1/Data-Array.html#t%3AArray"
>Array</A
> <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</A
> (<A HREF="Text-Regex-TDFA-IntArrTrieSet.html#t%3ATrieSet"
>TrieSet</A
> v)</TD
></TR
></TABLE
>}</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AlookupAsc"
>lookupAsc</A
> ::  <A HREF="Text-Regex-TDFA-IntArrTrieSet.html#t%3ATrieSet"
>TrieSet</A
> v -&gt; [<A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</A
>] -&gt; v</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AfromBounds"
>fromBounds</A
> ::  (<A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</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/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</A
>] -&gt; v) -&gt; <A HREF="Text-Regex-TDFA-IntArrTrieSet.html#t%3ATrieSet"
>TrieSet</A
> v</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AfromSinglesMerge"
>fromSinglesMerge</A
> ::  v -&gt; (v -&gt; v -&gt; v) -&gt; (<A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</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/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</A
> -&gt; v) -&gt; <A HREF="Text-Regex-TDFA-IntArrTrieSet.html#t%3ATrieSet"
>TrieSet</A
> v</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AfromSinglesSum"
>fromSinglesSum</A
> ::  ([v] -&gt; v) -&gt; (<A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</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/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</A
> -&gt; v) -&gt; <A HREF="Text-Regex-TDFA-IntArrTrieSet.html#t%3ATrieSet"
>TrieSet</A
> 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="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><SPAN CLASS="keyword"
>data</SPAN
>  <A NAME="t:TrieSet"
><A NAME="t%3ATrieSet"
></A
></A
><B
>TrieSet</B
> v </TD
><TD CLASS="declbut"
><A HREF="src/Text-Regex-TDFA-IntArrTrieSet.html#TrieSet"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="body"
><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD CLASS="section4"
>Constructors</TD
></TR
><TR
><TD CLASS="body"
><TABLE CLASS="vanilla" CELLSPACING="5" CELLPADDING="0"
><TR
><TD CLASS="arg"
><A NAME="v:TrieSet"
><A NAME="v%3ATrieSet"
></A
></A
><B
>TrieSet</B
></TD
><TD CLASS="rdoc"
></TD
></TR
><TR
><TD CLASS="body" COLSPAN="2"
><TABLE CLASS="vanilla" CELLSPACING="1" CELLPADDING="0"
><TR
><TD CLASS="arg"
><A NAME="v:value"
><A NAME="v%3Avalue"
></A
></A
><B
>value</B
> :: v</TD
><TD CLASS="rdoc"
></TD
></TR
><TR
><TD CLASS="arg"
><A NAME="v:next"
><A NAME="v%3Anext"
></A
></A
><B
>next</B
> :: <A HREF="/usr/share/doc/ghc/html/libraries/array-0.3.0.1/Data-Array.html#t%3AArray"
>Array</A
> <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</A
> (<A HREF="Text-Regex-TDFA-IntArrTrieSet.html#t%3ATrieSet"
>TrieSet</A
> v)</TD
><TD CLASS="rdoc"
></TD
></TR
></TABLE
></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:lookupAsc"
><A NAME="v%3AlookupAsc"
></A
></A
><B
>lookupAsc</B
> ::  <A HREF="Text-Regex-TDFA-IntArrTrieSet.html#t%3ATrieSet"
>TrieSet</A
> v -&gt; [<A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</A
>] -&gt; v</TD
><TD CLASS="declbut"
><A HREF="src/Text-Regex-TDFA-IntArrTrieSet.html#lookupAsc"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
>This is the accessor for the Trie. The list of keys should be
 sorted.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:fromBounds"
><A NAME="v%3AfromBounds"
></A
></A
><B
>fromBounds</B
></TD
><TD CLASS="declbut"
><A HREF="src/Text-Regex-TDFA-IntArrTrieSet.html#fromBounds"
>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-Int.html#t%3AInt"
>Int</A
>, <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</A
>)</TD
><TD CLASS="rdoc"
>(lower,upper) range of keys, lower&lt;=upper
</TD
></TR
><TR
><TD CLASS="arg"
>-&gt; [<A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</A
>] -&gt; v</TD
><TD CLASS="rdoc"
>Function from list of keys to its value.
   It must work for distinct ascending lists.
</TD
></TR
><TR
><TD CLASS="arg"
>-&gt; <A HREF="Text-Regex-TDFA-IntArrTrieSet.html#t%3ATrieSet"
>TrieSet</A
> v</TD
><TD CLASS="rdoc"
>The constructed Trie
</TD
></TR
><TR
><TD CLASS="ndoc" COLSPAN="2"
>This is a Trie constructor for a complete range of keys.
</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:fromSinglesMerge"
><A NAME="v%3AfromSinglesMerge"
></A
></A
><B
>fromSinglesMerge</B
></TD
><TD CLASS="declbut"
><A HREF="src/Text-Regex-TDFA-IntArrTrieSet.html#fromSinglesMerge"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="body"
><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD CLASS="arg"
>:: v</TD
><TD CLASS="rdoc"
>value for (lookupAsc trie [])
</TD
></TR
><TR
><TD CLASS="arg"
>-&gt; v -&gt; v -&gt; v</TD
><TD CLASS="rdoc"
>merge operation on values
</TD
></TR
><TR
><TD CLASS="arg"
>-&gt; (<A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</A
>, <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</A
>)</TD
><TD CLASS="rdoc"
>(lower,upper) range of keys, lower&lt;=upper
</TD
></TR
><TR
><TD CLASS="arg"
>-&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</A
> -&gt; v</TD
><TD CLASS="rdoc"
>Function from a single key to its value
</TD
></TR
><TR
><TD CLASS="arg"
>-&gt; <A HREF="Text-Regex-TDFA-IntArrTrieSet.html#t%3ATrieSet"
>TrieSet</A
> v</TD
><TD CLASS="rdoc"
>The constructed Trie
</TD
></TR
><TR
><TD CLASS="ndoc" COLSPAN="2"
>This is a Trie constructor for a complete range of keys that uses
 a function from single values and a merge operation on values to
 fill the Trie.
</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:fromSinglesSum"
><A NAME="v%3AfromSinglesSum"
></A
></A
><B
>fromSinglesSum</B
></TD
><TD CLASS="declbut"
><A HREF="src/Text-Regex-TDFA-IntArrTrieSet.html#fromSinglesSum"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="body"
><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD CLASS="arg"
>:: [v] -&gt; v</TD
><TD CLASS="rdoc"
>summation operation for values
</TD
></TR
><TR
><TD CLASS="arg"
>-&gt; (<A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</A
>, <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</A
>)</TD
><TD CLASS="rdoc"
>(lower,upper) range of keys, lower &lt;= upper
</TD
></TR
><TR
><TD CLASS="arg"
>-&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</A
> -&gt; v</TD
><TD CLASS="rdoc"
>Function from a single key to its value
</TD
></TR
><TR
><TD CLASS="arg"
>-&gt; <A HREF="Text-Regex-TDFA-IntArrTrieSet.html#t%3ATrieSet"
>TrieSet</A
> v</TD
><TD CLASS="rdoc"
>The constructed Trie
</TD
></TR
><TR
><TD CLASS="ndoc" COLSPAN="2"
>This is a Trie constructor for a complete range of keys that uses
 a function from single values and a sum operation of values to fill
 the Trie.
</TD
></TR
></TABLE
></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