<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html>
<head>
<!-- Generated by HsColour, http://www.cs.york.ac.uk/fp/darcs/hscolour/ -->
<title>src/ForSyDe/Shallow/Queue.hs</title>
<link type='text/css' rel='stylesheet' href='hscolour.css' />
</head>
<body>
<pre><a name="line-1"></a><span class='hs-comment'>-----------------------------------------------------------------------------</span>
<a name="line-2"></a><span class='hs-comment'>-- |</span>
<a name="line-3"></a><span class='hs-comment'>-- Module : ForSyDe.Shallow.Queue</span>
<a name="line-4"></a><span class='hs-comment'>-- Copyright : (c) SAM Group, KTH/ICT/ECS 2007-2008</span>
<a name="line-5"></a><span class='hs-comment'>-- License : BSD-style (see the file LICENSE)</span>
<a name="line-6"></a><span class='hs-comment'>-- </span>
<a name="line-7"></a><span class='hs-comment'>-- Maintainer : forsyde-dev@ict.kth.se</span>
<a name="line-8"></a><span class='hs-comment'>-- Stability : experimental</span>
<a name="line-9"></a><span class='hs-comment'>-- Portability : portable</span>
<a name="line-10"></a><span class='hs-comment'>--</span>
<a name="line-11"></a><span class='hs-comment'>--</span>
<a name="line-12"></a><span class='hs-comment'>-- This provides two data types, that can be used to model queue</span>
<a name="line-13"></a><span class='hs-comment'>-- structures, such as FIFOs. There is a data type for an queue of</span>
<a name="line-14"></a><span class='hs-comment'>-- infinite size 'Queue' and one for finite size 'FiniteQueue'.</span>
<a name="line-15"></a><span class='hs-comment'>-----------------------------------------------------------------------------</span>
<a name="line-16"></a><span class='hs-keyword'>module</span> <span class='hs-conid'>ForSyDe</span><span class='hs-varop'>.</span><span class='hs-conid'>Shallow</span><span class='hs-varop'>.</span><span class='hs-conid'>Queue</span> <span class='hs-keyword'>where</span>
<a name="line-17"></a>
<a name="line-18"></a><span class='hs-keyword'>import</span> <span class='hs-conid'>ForSyDe</span><span class='hs-varop'>.</span><span class='hs-conid'>Shallow</span><span class='hs-varop'>.</span><span class='hs-conid'>AbsentExt</span>
<a name="line-19"></a>
<a name="line-20"></a><a name="Queue"></a><span class='hs-comment'>-- | A queue is modeled as a list. The data type 'Queue' modelles an queue of infinite size.</span>
<a name="line-21"></a><a name="Queue"></a><span class='hs-keyword'>data</span> <span class='hs-conid'>Queue</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>Q</span> <span class='hs-keyglyph'>[</span><span class='hs-varid'>a</span><span class='hs-keyglyph'>]</span> <span class='hs-keyword'>deriving</span> <span class='hs-layout'>(</span><span class='hs-conid'>Eq</span><span class='hs-layout'>,</span> <span class='hs-conid'>Show</span><span class='hs-layout'>)</span>
<a name="line-22"></a>
<a name="line-23"></a><a name="FiniteQueue"></a><span class='hs-comment'>-- | The data type 'FiniteQueue' has an additional parameter, that determines the size of the queue.</span>
<a name="line-24"></a><a name="FiniteQueue"></a><span class='hs-keyword'>data</span> <span class='hs-conid'>FiniteQueue</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>FQ</span> <span class='hs-conid'>Int</span> <span class='hs-keyglyph'>[</span><span class='hs-varid'>a</span><span class='hs-keyglyph'>]</span> <span class='hs-keyword'>deriving</span> <span class='hs-layout'>(</span><span class='hs-conid'>Eq</span><span class='hs-layout'>,</span> <span class='hs-conid'>Show</span><span class='hs-layout'>)</span>
<a name="line-25"></a>
<a name="line-26"></a><span class='hs-comment'>{-
<a name="line-27"></a>Table \ref{tab:QueueFunctions} shows the functions an the data types \haskell{Queue} and \haskell{FiniteQueue}.
<a name="line-28"></a>%
<a name="line-29"></a>\begin{table}
<a name="line-30"></a>\label{tab:QueueFunctions}
<a name="line-31"></a>\begin{tabular}{lll}
<a name="line-32"></a>\hline
<a name="line-33"></a>infinite & finite & description \\
<a name="line-34"></a>\hline
<a name="line-35"></a>\hline
<a name="line-36"></a>\haskell{pushQ} & \haskell{pushFQ} & pushes one element on the queue \\
<a name="line-37"></a>\haskell{pushListQ} & \haskell{pushListFQ} & pushes a list of elements on the queue \\
<a name="line-38"></a>\haskell{popQ} & \haskell{popFQ} & pops one element from the queue \\
<a name="line-39"></a>\haskell{queue} & \haskell{finiteQueue} & transforms a list into a queue \\
<a name="line-40"></a>\hline
<a name="line-41"></a>\end{tabular}
<a name="line-42"></a>\caption{Functions on the data types \haskell{Queue} and \haskell{FiniteQueue}}
<a name="line-43"></a>\end{table}
<a name="line-44"></a>-}</span>
<a name="line-45"></a>
<a name="line-46"></a><a name="pushQ"></a><span class='hs-comment'>-- | 'pushQ' pushes one element into an infinite queue.</span>
<a name="line-47"></a><span class='hs-definition'>pushQ</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Queue</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Queue</span> <span class='hs-varid'>a</span>
<a name="line-48"></a>
<a name="line-49"></a><a name="pushListQ"></a><span class='hs-comment'>-- | 'pushListQ' pushes a list of elements into an infinite queue.</span>
<a name="line-50"></a><span class='hs-definition'>pushListQ</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Queue</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-keyglyph'>[</span><span class='hs-varid'>a</span><span class='hs-keyglyph'>]</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Queue</span> <span class='hs-varid'>a</span>
<a name="line-51"></a>
<a name="line-52"></a><a name="popQ"></a><span class='hs-comment'>-- | 'popQ' pops one element from an infinite queue.</span>
<a name="line-53"></a><span class='hs-definition'>popQ</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Queue</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-layout'>(</span><span class='hs-conid'>Queue</span> <span class='hs-varid'>a</span><span class='hs-layout'>,</span> <span class='hs-conid'>AbstExt</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span>
<a name="line-54"></a>
<a name="line-55"></a><a name="queue"></a><span class='hs-comment'>-- | 'queue' transforms a list into an infinite queue.</span>
<a name="line-56"></a><span class='hs-definition'>queue</span> <span class='hs-keyglyph'>::</span> <span class='hs-keyglyph'>[</span><span class='hs-varid'>a</span><span class='hs-keyglyph'>]</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Queue</span> <span class='hs-varid'>a</span>
<a name="line-57"></a>
<a name="line-58"></a><a name="pushFQ"></a><span class='hs-comment'>-- | 'pushFQ' pushes one element into a finite queue.</span>
<a name="line-59"></a><span class='hs-definition'>pushFQ</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>FiniteQueue</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>FiniteQueue</span> <span class='hs-varid'>a</span>
<a name="line-60"></a>
<a name="line-61"></a><a name="pushListFQ"></a><span class='hs-comment'>-- | 'pushListFQ' pushes a list of elements into a finite queue.</span>
<a name="line-62"></a><span class='hs-definition'>pushListFQ</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>FiniteQueue</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-keyglyph'>[</span><span class='hs-varid'>a</span><span class='hs-keyglyph'>]</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>FiniteQueue</span> <span class='hs-varid'>a</span>
<a name="line-63"></a>
<a name="line-64"></a><a name="popFQ"></a><span class='hs-comment'>-- | 'popFQ' pops one element from a finite queue.</span>
<a name="line-65"></a><span class='hs-definition'>popFQ</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>FiniteQueue</span> <span class='hs-varid'>a</span>
<a name="line-66"></a> <span class='hs-keyglyph'>-></span> <span class='hs-layout'>(</span><span class='hs-conid'>FiniteQueue</span> <span class='hs-varid'>a</span><span class='hs-layout'>,</span> <span class='hs-conid'>AbstExt</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span>
<a name="line-67"></a>
<a name="line-68"></a><a name="finiteQueue"></a><span class='hs-comment'>-- | 'finiteQueue' transforms a list into an infinite queue.</span>
<a name="line-69"></a><span class='hs-definition'>finiteQueue</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Int</span> <span class='hs-keyglyph'>-></span> <span class='hs-keyglyph'>[</span><span class='hs-varid'>a</span><span class='hs-keyglyph'>]</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>FiniteQueue</span> <span class='hs-varid'>a</span>
<a name="line-70"></a>
<a name="line-71"></a>
<a name="line-72"></a><span class='hs-comment'>-- Implementation</span>
<a name="line-73"></a>
<a name="line-74"></a><span class='hs-definition'>pushQ</span> <span class='hs-layout'>(</span><span class='hs-conid'>Q</span> <span class='hs-varid'>q</span><span class='hs-layout'>)</span> <span class='hs-varid'>x</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>Q</span> <span class='hs-layout'>(</span><span class='hs-varid'>q</span> <span class='hs-varop'>++</span> <span class='hs-keyglyph'>[</span><span class='hs-varid'>x</span><span class='hs-keyglyph'>]</span><span class='hs-layout'>)</span>
<a name="line-75"></a>
<a name="line-76"></a><span class='hs-definition'>pushListQ</span> <span class='hs-layout'>(</span><span class='hs-conid'>Q</span> <span class='hs-varid'>q</span><span class='hs-layout'>)</span> <span class='hs-varid'>xs</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>Q</span> <span class='hs-layout'>(</span><span class='hs-varid'>q</span> <span class='hs-varop'>++</span> <span class='hs-varid'>xs</span><span class='hs-layout'>)</span>
<a name="line-77"></a>
<a name="line-78"></a><span class='hs-definition'>popQ</span> <span class='hs-layout'>(</span><span class='hs-conid'>Q</span> <span class='hs-conid'>[]</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span> <span class='hs-layout'>(</span><span class='hs-conid'>Q</span> <span class='hs-conid'>[]</span><span class='hs-layout'>,</span> <span class='hs-conid'>Abst</span><span class='hs-layout'>)</span>
<a name="line-79"></a><span class='hs-definition'>popQ</span> <span class='hs-layout'>(</span><span class='hs-conid'>Q</span> <span class='hs-layout'>(</span><span class='hs-varid'>x</span><span class='hs-conop'>:</span><span class='hs-varid'>xs</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span> <span class='hs-layout'>(</span><span class='hs-conid'>Q</span> <span class='hs-varid'>xs</span><span class='hs-layout'>,</span> <span class='hs-conid'>Prst</span> <span class='hs-varid'>x</span><span class='hs-layout'>)</span>
<a name="line-80"></a>
<a name="line-81"></a><span class='hs-definition'>queue</span> <span class='hs-varid'>xs</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>Q</span> <span class='hs-varid'>xs</span>
<a name="line-82"></a>
<a name="line-83"></a><span class='hs-definition'>pushFQ</span> <span class='hs-layout'>(</span><span class='hs-conid'>FQ</span> <span class='hs-varid'>n</span> <span class='hs-varid'>q</span><span class='hs-layout'>)</span> <span class='hs-varid'>x</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>if</span> <span class='hs-varid'>length</span> <span class='hs-varid'>q</span> <span class='hs-varop'><</span> <span class='hs-varid'>n</span> <span class='hs-keyword'>then</span>
<a name="line-84"></a> <span class='hs-layout'>(</span><span class='hs-conid'>FQ</span> <span class='hs-varid'>n</span> <span class='hs-layout'>(</span><span class='hs-varid'>q</span> <span class='hs-varop'>++</span> <span class='hs-keyglyph'>[</span><span class='hs-varid'>x</span><span class='hs-keyglyph'>]</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span>
<a name="line-85"></a> <span class='hs-keyword'>else</span>
<a name="line-86"></a> <span class='hs-layout'>(</span><span class='hs-conid'>FQ</span> <span class='hs-varid'>n</span> <span class='hs-varid'>q</span><span class='hs-layout'>)</span>
<a name="line-87"></a>
<a name="line-88"></a><span class='hs-definition'>pushListFQ</span> <span class='hs-layout'>(</span><span class='hs-conid'>FQ</span> <span class='hs-varid'>n</span> <span class='hs-varid'>q</span><span class='hs-layout'>)</span> <span class='hs-varid'>xs</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>FQ</span> <span class='hs-varid'>n</span> <span class='hs-layout'>(</span><span class='hs-varid'>take</span> <span class='hs-varid'>n</span> <span class='hs-layout'>(</span><span class='hs-varid'>q</span> <span class='hs-varop'>++</span> <span class='hs-varid'>xs</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span>
<a name="line-89"></a>
<a name="line-90"></a><span class='hs-definition'>popFQ</span> <span class='hs-layout'>(</span><span class='hs-conid'>FQ</span> <span class='hs-varid'>n</span> <span class='hs-conid'>[]</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span> <span class='hs-layout'>(</span><span class='hs-conid'>FQ</span> <span class='hs-varid'>n</span> <span class='hs-conid'>[]</span><span class='hs-layout'>,</span> <span class='hs-conid'>Abst</span><span class='hs-layout'>)</span>
<a name="line-91"></a><span class='hs-definition'>popFQ</span> <span class='hs-layout'>(</span><span class='hs-conid'>FQ</span> <span class='hs-varid'>n</span> <span class='hs-layout'>(</span><span class='hs-varid'>q</span><span class='hs-conop'>:</span><span class='hs-varid'>qs</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span> <span class='hs-layout'>(</span><span class='hs-conid'>FQ</span> <span class='hs-varid'>n</span> <span class='hs-varid'>qs</span><span class='hs-layout'>,</span> <span class='hs-conid'>Prst</span> <span class='hs-varid'>q</span><span class='hs-layout'>)</span>
<a name="line-92"></a>
<a name="line-93"></a><span class='hs-definition'>finiteQueue</span> <span class='hs-varid'>n</span> <span class='hs-varid'>xs</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>FQ</span> <span class='hs-varid'>n</span> <span class='hs-layout'>(</span><span class='hs-varid'>take</span> <span class='hs-varid'>n</span> <span class='hs-varid'>xs</span><span class='hs-layout'>)</span>
<a name="line-94"></a>
<a name="line-95"></a>
<a name="line-96"></a>
<a name="line-97"></a>
<a name="line-98"></a>
</pre></body>
</html>
distrib
>
Fedora
>
14
>
x86_64
>
media
>
updates
>
by-pkgid
>
a47f0719970f9f829128f311a437816d
>
files
>
347
