/usr/share/mozart/doc/cpiref/node20.html is in mozart-doc 1.4.0-8ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 | <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD><TITLE>4.6 The class PEL_PropQueue</TITLE><LINK href="ozdoc.css" rel="stylesheet" type="text/css"></HEAD><BODY><TABLE align="center" border="0" cellpadding="6" cellspacing="6" class="nav"><TR bgcolor="#DDDDDD"><TD><A href="node19.html#pel.propfncttable"><< Prev</A></TD><TD><A href="pel.html">- Up -</A></TD><TD><A href="node21.html#pel.fsetprofile">Next >></A></TD></TR></TABLE><DIV id="pel.propqueue"><H2><A name="pel.propqueue">4.6 The class <CODE>PEL_PropQueue</CODE></A></H2><P></P><DL><DT class="constructor"><CODE>PEL_PropQueue</CODE> <A name="label326"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>constructor</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>PEL_PropQueue(<SPAN class="type">void</SPAN>);</CODE></P></BLOCKQUOTE></DD><DD><P>Constructs a propagation queue. </P></DD><DT class="member"><CODE>enqueue</CODE> <A name="label327"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>member function</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE><SPAN class="type">void</SPAN> <SPAN class="functionname">enqueue</SPAN>(<SPAN class="type">int</SPAN> <SPAN class="variablename">fnct_idx</SPAN>);</CODE> </P></BLOCKQUOTE></DD><DD><P>Enqueue a propagation function index <CODE>fnct_idx</CODE>. The propagation function index is related to a propagation function table. </P></DD><DT class="member"><CODE>dequeue</CODE> <A name="label328"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>member function</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE><SPAN class="type">int</SPAN> <SPAN class="functionname">dequeue</SPAN>(<SPAN class="type">void</SPAN>);</CODE></P></BLOCKQUOTE></DD><DD><P>Returns a propagation function index. </P></DD><DT class="member"><CODE>apply</CODE> <A name="label329"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>member function</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P></P><BLOCKQUOTE class="code"><CODE><SPAN class="type">pf_return_t</SPAN> <SPAN class="functionname">apply</SPAN>(<SPAN class="type">PEL_PropFnctTable</SPAN> &<SPAN class="variablename">pft</SPAN>, <BR> <SPAN class="type">PEL_ParamTable</SPAN> &<SPAN class="variablename">pt</SPAN>, <BR> <SPAN class="type">PEL_SuspVar</SPAN> * []);</CODE></BLOCKQUOTE><P> </P></BLOCKQUOTE></DD><DD><P>Dequeues an index and applies the corresponding propagation function closure of <CODE>pft</CODE>. It returns the value returned by the propagation function. </P></DD><DT class="member"><CODE>isEmpty</CODE> <A name="label330"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>member function</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE><SPAN class="type">int</SPAN> <SPAN class="functionname">isEmpty</SPAN>(<SPAN class="type">void</SPAN>);</CODE></P></BLOCKQUOTE></DD><DD><P>Tests if the queue is empty. </P></DD><DT class="member"><CODE>setFailed</CODE> <A name="label331"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>member function</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE><SPAN class="type">void</SPAN> <SPAN class="functionname">setFailed</SPAN>(<SPAN class="type">void</SPAN>);</CODE></P></BLOCKQUOTE></DD><DD><P>Sets the queue <EM>failed</EM>. </P></DD><DT class="member"><CODE>isFailed</CODE> <A name="label332"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>member function</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE><SPAN class="type">int</SPAN> <SPAN class="functionname">isFailed</SPAN>(<SPAN class="type">void</SPAN>);</CODE></P></BLOCKQUOTE></DD><DD><P>Tests if the queue is <EM>failed</EM>. </P></DD><DT class="member"><CODE>isBasic</CODE> <A name="label333"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>member function</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE><SPAN class="type">int</SPAN> <SPAN class="functionname">isBasic</SPAN>(<SPAN class="type">void</SPAN>);</CODE> </P></BLOCKQUOTE></DD><DD><P>Tests if all propagation functions registered with the queue have ceased to exist. </P></DD><DT class="member"><CODE>incAPF</CODE> <A name="label334"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>member function</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE><SPAN class="type">void</SPAN> <SPAN class="functionname">incAPF</SPAN>(<SPAN class="type">void</SPAN>);</CODE></P></BLOCKQUOTE></DD><DD><P>Increments the registration counter by 1. </P></DD><DT class="member"><CODE>decAPF</CODE> <A name="label335"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>member function</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE><SPAN class="type">void</SPAN> <SPAN class="functionname">decAPF</SPAN>(<SPAN class="type">void</SPAN>);</CODE></P></BLOCKQUOTE></DD><DD><P>Decrements the registration counter by 1. </P></DD><DT class="member"><CODE>reset</CODE> <A name="label336"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>member function</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE><SPAN class="type">void</SPAN> <SPAN class="functionname">reset</SPAN>(<SPAN class="type">void</SPAN>);</CODE></P></BLOCKQUOTE></DD><DD><P>Resets the queue. (???) </P></DD><DT class="member"><CODE>getSize</CODE> <A name="label337"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>member function</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE><SPAN class="type">int</SPAN> <SPAN class="functionname">getSize</SPAN>(<SPAN class="type">void</SPAN>);</CODE></P></BLOCKQUOTE></DD><DD><P>Returns the number of queued propagation function entry indicies. </P></DD></DL><P> </P></DIV><TABLE align="center" border="0" cellpadding="6" cellspacing="6" class="nav"><TR bgcolor="#DDDDDD"><TD><A href="node19.html#pel.propfncttable"><< Prev</A></TD><TD><A href="pel.html">- Up -</A></TD><TD><A href="node21.html#pel.fsetprofile">Next >></A></TD></TR></TABLE><HR><ADDRESS><A href="http://www.ps.uni-sb.de/~tmueller/">Tobias Müller</A><BR><SPAN class="version">Version 1.4.0 (20110908185330)</SPAN></ADDRESS></BODY></HTML>
|