Sophie: ghc-ForSyDe-devel-3.1.1-4.fc14 i686

ghc-ForSyDe-devel-3.1.1-4.fc14.i686.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
>ForSyDe.Shallow.Queue</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_ForSyDe-Shallow-Queue.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"
>ForSyDe-3.1.1: ForSyDe's Haskell-embedded Domain Specific Language.</TD
><TD CLASS="topbut"
><A HREF="src/ForSyDe-Shallow-Queue.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"
>ForSyDe.Shallow.Queue</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"
>forsyde-dev@ict.kth.se</TD
></TR
></TABLE
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
>Description</TD
></TR
><TR
><TD CLASS="doc"
>This provides two data types, that can be used to model queue
 structures, such as FIFOs. There is a data type for an queue of
 infinite size <TT
><A HREF="ForSyDe-Shallow-Queue.html#t%3AQueue"
>Queue</A
></TT
> and one for finite size <TT
><A HREF="ForSyDe-Shallow-Queue.html#t%3AFiniteQueue"
>FiniteQueue</A
></TT
>.
</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%3AQueue"
>Queue</A
> a = <A HREF="#v%3AQ"
>Q</A
> [a]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><SPAN CLASS="keyword"
>data</SPAN
>  <A HREF="#t%3AFiniteQueue"
>FiniteQueue</A
> a = <A HREF="#v%3AFQ"
>FQ</A
> <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</A
> [a]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3ApushQ"
>pushQ</A
> ::  <A HREF="ForSyDe-Shallow-Queue.html#t%3AQueue"
>Queue</A
> a -&gt; a -&gt; <A HREF="ForSyDe-Shallow-Queue.html#t%3AQueue"
>Queue</A
> a</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3ApushListQ"
>pushListQ</A
> ::  <A HREF="ForSyDe-Shallow-Queue.html#t%3AQueue"
>Queue</A
> a -&gt; [a] -&gt; <A HREF="ForSyDe-Shallow-Queue.html#t%3AQueue"
>Queue</A
> a</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3ApopQ"
>popQ</A
> ::  <A HREF="ForSyDe-Shallow-Queue.html#t%3AQueue"
>Queue</A
> a -&gt; (<A HREF="ForSyDe-Shallow-Queue.html#t%3AQueue"
>Queue</A
> a, <A HREF="ForSyDe-Shallow-AbsentExt.html#t%3AAbstExt"
>AbstExt</A
> a)</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Aqueue"
>queue</A
> ::  [a] -&gt; <A HREF="ForSyDe-Shallow-Queue.html#t%3AQueue"
>Queue</A
> a</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3ApushFQ"
>pushFQ</A
> ::  <A HREF="ForSyDe-Shallow-Queue.html#t%3AFiniteQueue"
>FiniteQueue</A
> a -&gt; a -&gt; <A HREF="ForSyDe-Shallow-Queue.html#t%3AFiniteQueue"
>FiniteQueue</A
> a</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3ApushListFQ"
>pushListFQ</A
> ::  <A HREF="ForSyDe-Shallow-Queue.html#t%3AFiniteQueue"
>FiniteQueue</A
> a -&gt; [a] -&gt; <A HREF="ForSyDe-Shallow-Queue.html#t%3AFiniteQueue"
>FiniteQueue</A
> a</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3ApopFQ"
>popFQ</A
> ::  <A HREF="ForSyDe-Shallow-Queue.html#t%3AFiniteQueue"
>FiniteQueue</A
> a -&gt; (<A HREF="ForSyDe-Shallow-Queue.html#t%3AFiniteQueue"
>FiniteQueue</A
> a, <A HREF="ForSyDe-Shallow-AbsentExt.html#t%3AAbstExt"
>AbstExt</A
> a)</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AfiniteQueue"
>finiteQueue</A
> ::  <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</A
> -&gt; [a] -&gt; <A HREF="ForSyDe-Shallow-Queue.html#t%3AFiniteQueue"
>FiniteQueue</A
> a</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:Queue"
><A NAME="t%3AQueue"
></A
></A
><B
>Queue</B
> a </TD
><TD CLASS="declbut"
><A HREF="src/ForSyDe-Shallow-Queue.html#Queue"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="body"
><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD CLASS="ndoc"
>A queue is modeled as a list. The data type <TT
><A HREF="ForSyDe-Shallow-Queue.html#t%3AQueue"
>Queue</A
></TT
> modelles an queue of infinite size.
</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:Q"
><A NAME="v%3AQ"
></A
></A
><B
>Q</B
> [a]</TD
><TD CLASS="rdoc"
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="section4"
><IMG SRC="minus.gif" CLASS="coll" ONCLICK="toggle(this,'i:Queue')" ALT="show/hide"
> Instances</TD
></TR
><TR
><TD CLASS="body"
><DIV ID="i:Queue" STYLE="display:block;"
><TABLE CLASS="vanilla" CELLSPACING="1" CELLPADDING="0"
><TR
><TD CLASS="decl"
><A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> a =&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> (<A HREF="ForSyDe-Shallow-Queue.html#t%3AQueue"
>Queue</A
> a)</TD
></TR
><TR
><TD CLASS="decl"
><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/Text-Show.html#t%3AShow"
>Show</A
> (<A HREF="ForSyDe-Shallow-Queue.html#t%3AQueue"
>Queue</A
> a)</TD
></TR
></TABLE
></DIV
></TD
></TR
></TABLE
></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:FiniteQueue"
><A NAME="t%3AFiniteQueue"
></A
></A
><B
>FiniteQueue</B
> a </TD
><TD CLASS="declbut"
><A HREF="src/ForSyDe-Shallow-Queue.html#FiniteQueue"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="body"
><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD CLASS="ndoc"
>The data type <TT
><A HREF="ForSyDe-Shallow-Queue.html#t%3AFiniteQueue"
>FiniteQueue</A
></TT
> has an additional parameter, that determines the size of the queue.
</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:FQ"
><A NAME="v%3AFQ"
></A
></A
><B
>FQ</B
> <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</A
> [a]</TD
><TD CLASS="rdoc"
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="section4"
><IMG SRC="minus.gif" CLASS="coll" ONCLICK="toggle(this,'i:FiniteQueue')" ALT="show/hide"
> Instances</TD
></TR
><TR
><TD CLASS="body"
><DIV ID="i:FiniteQueue" STYLE="display:block;"
><TABLE CLASS="vanilla" CELLSPACING="1" CELLPADDING="0"
><TR
><TD CLASS="decl"
><A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> a =&gt; <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Eq.html#t%3AEq"
>Eq</A
> (<A HREF="ForSyDe-Shallow-Queue.html#t%3AFiniteQueue"
>FiniteQueue</A
> a)</TD
></TR
><TR
><TD CLASS="decl"
><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/Text-Show.html#t%3AShow"
>Show</A
> (<A HREF="ForSyDe-Shallow-Queue.html#t%3AFiniteQueue"
>FiniteQueue</A
> a)</TD
></TR
></TABLE
></DIV
></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:pushQ"
><A NAME="v%3ApushQ"
></A
></A
><B
>pushQ</B
> ::  <A HREF="ForSyDe-Shallow-Queue.html#t%3AQueue"
>Queue</A
> a -&gt; a -&gt; <A HREF="ForSyDe-Shallow-Queue.html#t%3AQueue"
>Queue</A
> a</TD
><TD CLASS="declbut"
><A HREF="src/ForSyDe-Shallow-Queue.html#pushQ"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
><TT
><A HREF="ForSyDe-Shallow-Queue.html#v%3ApushQ"
>pushQ</A
></TT
> pushes one element into an infinite queue.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:pushListQ"
><A NAME="v%3ApushListQ"
></A
></A
><B
>pushListQ</B
> ::  <A HREF="ForSyDe-Shallow-Queue.html#t%3AQueue"
>Queue</A
> a -&gt; [a] -&gt; <A HREF="ForSyDe-Shallow-Queue.html#t%3AQueue"
>Queue</A
> a</TD
><TD CLASS="declbut"
><A HREF="src/ForSyDe-Shallow-Queue.html#pushListQ"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
><TT
><A HREF="ForSyDe-Shallow-Queue.html#v%3ApushListQ"
>pushListQ</A
></TT
> pushes a list of elements into an infinite queue.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:popQ"
><A NAME="v%3ApopQ"
></A
></A
><B
>popQ</B
> ::  <A HREF="ForSyDe-Shallow-Queue.html#t%3AQueue"
>Queue</A
> a -&gt; (<A HREF="ForSyDe-Shallow-Queue.html#t%3AQueue"
>Queue</A
> a, <A HREF="ForSyDe-Shallow-AbsentExt.html#t%3AAbstExt"
>AbstExt</A
> a)</TD
><TD CLASS="declbut"
><A HREF="src/ForSyDe-Shallow-Queue.html#popQ"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
><TT
><A HREF="ForSyDe-Shallow-Queue.html#v%3ApopQ"
>popQ</A
></TT
> pops one element from an infinite queue.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:queue"
><A NAME="v%3Aqueue"
></A
></A
><B
>queue</B
> ::  [a] -&gt; <A HREF="ForSyDe-Shallow-Queue.html#t%3AQueue"
>Queue</A
> a</TD
><TD CLASS="declbut"
><A HREF="src/ForSyDe-Shallow-Queue.html#queue"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
><TT
><A HREF="ForSyDe-Shallow-Queue.html#v%3Aqueue"
>queue</A
></TT
> transforms a list into an infinite queue.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:pushFQ"
><A NAME="v%3ApushFQ"
></A
></A
><B
>pushFQ</B
> ::  <A HREF="ForSyDe-Shallow-Queue.html#t%3AFiniteQueue"
>FiniteQueue</A
> a -&gt; a -&gt; <A HREF="ForSyDe-Shallow-Queue.html#t%3AFiniteQueue"
>FiniteQueue</A
> a</TD
><TD CLASS="declbut"
><A HREF="src/ForSyDe-Shallow-Queue.html#pushFQ"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
><TT
><A HREF="ForSyDe-Shallow-Queue.html#v%3ApushFQ"
>pushFQ</A
></TT
> pushes one element into a finite queue.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:pushListFQ"
><A NAME="v%3ApushListFQ"
></A
></A
><B
>pushListFQ</B
> ::  <A HREF="ForSyDe-Shallow-Queue.html#t%3AFiniteQueue"
>FiniteQueue</A
> a -&gt; [a] -&gt; <A HREF="ForSyDe-Shallow-Queue.html#t%3AFiniteQueue"
>FiniteQueue</A
> a</TD
><TD CLASS="declbut"
><A HREF="src/ForSyDe-Shallow-Queue.html#pushListFQ"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
><TT
><A HREF="ForSyDe-Shallow-Queue.html#v%3ApushListFQ"
>pushListFQ</A
></TT
> pushes a list of elements into a finite queue.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:popFQ"
><A NAME="v%3ApopFQ"
></A
></A
><B
>popFQ</B
> ::  <A HREF="ForSyDe-Shallow-Queue.html#t%3AFiniteQueue"
>FiniteQueue</A
> a -&gt; (<A HREF="ForSyDe-Shallow-Queue.html#t%3AFiniteQueue"
>FiniteQueue</A
> a, <A HREF="ForSyDe-Shallow-AbsentExt.html#t%3AAbstExt"
>AbstExt</A
> a)</TD
><TD CLASS="declbut"
><A HREF="src/ForSyDe-Shallow-Queue.html#popFQ"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
><TT
><A HREF="ForSyDe-Shallow-Queue.html#v%3ApopFQ"
>popFQ</A
></TT
> pops one element from a finite queue.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="topdecl"
><TABLE CLASS="declbar"
><TR
><TD CLASS="declname"
><A NAME="v:finiteQueue"
><A NAME="v%3AfiniteQueue"
></A
></A
><B
>finiteQueue</B
> ::  <A HREF="/usr/share/doc/ghc/html/libraries/base-4.2.0.2/Data-Int.html#t%3AInt"
>Int</A
> -&gt; [a] -&gt; <A HREF="ForSyDe-Shallow-Queue.html#t%3AFiniteQueue"
>FiniteQueue</A
> a</TD
><TD CLASS="declbut"
><A HREF="src/ForSyDe-Shallow-Queue.html#finiteQueue"
>Source</A
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="doc"
><TT
><A HREF="ForSyDe-Shallow-Queue.html#v%3AfiniteQueue"
>finiteQueue</A
></TT
> transforms a list into an infinite queue.
</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
>