/usr/share/mozart/doc/cpiref/node7.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>1.7 The class OZ_FSetValue</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="node6.html#r_fsvar"><< Prev</A></TD><TD><A href="ip.html">- Up -</A></TD><TD><A href="node8.html#r_fsc">Next >></A></TD></TR></TABLE><DIV id="r_fs"><H2><A name="r_fs">1.7 The class <CODE>OZ_FSetValue</CODE></A></H2><DIV id="r_fs.misc"><H3><A name="r_fs.misc">1.7.1 Miscellaneous</A></H3><P> </P><DL><DT class="enumtype"><CODE>OZ_FSetState</CODE> <A name="label129"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>enumerable type</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE><SPAN class="keyword">enum</SPAN> <SPAN class="type">OZ_FSetState</SPAN> {<SPAN class="variablename">fs_empty</SPAN>, <SPAN class="variablename">fs_full</SPAN>};</CODE> </P></BLOCKQUOTE></DD><DD><P>Used when constructing a Finite Set or with the operator <CODE>==</CODE>. </P><P></P><TABLE align="center" bgcolor="#f0f0e0"><TR valign="top"><TH><P>value</P></TH><TH><P>meaning</P></TH></TR><TR valign="top"><TD><P><CODE>fs_empty</CODE></P></TD><TD><P>the empty set</P></TD></TR><TR valign="top"><TD><P><CODE>fs_full</CODE></P></TD><TD><P>the set <IMG alt="\{\mbox{\tt OZ\_getFSInf()}, \ldots, \mbox{\tt OZ\_getFSSup()}\}" src="latex12.png"></P></TD></TR></TABLE><P> </P></DD></DL><P> </P></DIV><DIV id="r_fs.constr"><H3><A name="r_fs.constr">1.7.2 Constructor Member Functions</A></H3><P> </P><DL><DT class="default"><CODE>OZ_FSetValue</CODE> <A name="label130"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>default constructor</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>OZ_FSetValue(<SPAN class="type">void</SPAN>);</CODE> </P></BLOCKQUOTE></DD><DD><P>This constructor creates an <EM>uninitialised</EM> Finite Set Value. </P></DD><DT class="overloaded"><CODE>OZ_FSetValue</CODE> <A name="label131"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>overloaded constructor</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>OZ_FSetValue(<SPAN class="keyword">const</SPAN> <SPAN class="type">OZ_FSetConstraint</SPAN> &<SPAN class="variablename">fsc</SPAN>);</CODE> </P></BLOCKQUOTE></DD><DD><P><CODE>fsc</CODE> must have a determined value (i. e. <CODE>fsc.isValue()</CODE> must be true). A Finite Set is constructed from this value. </P></DD><DT class="overloaded"><CODE>OZ_FSetValue</CODE> <A name="label132"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>overloaded constructor</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>OZ_FSetValue(<SPAN class="keyword">const</SPAN> <SPAN class="type">OZ_Term</SPAN> <SPAN class="variablename">t</SPAN>);</CODE> </P></BLOCKQUOTE></DD><DD><P>Constructor using a <EM>level4</EM> list description like for Finite Domains (see <A href="node2.html#expect.checkconstr">Section 1.2.4</A>) to create a Finite Set Value. </P></DD><DT class="overloaded"><CODE>OZ_FSetValue</CODE> <A name="label133"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>overloaded constructor</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>OZ_FSetValue(<SPAN class="keyword">const</SPAN> <SPAN class="type">OZ_FSetState</SPAN> <SPAN class="variablename">state</SPAN>);</CODE> </P></BLOCKQUOTE></DD><DD><P>Creates a Finite Set Value according to <CODE>state</CODE> (<CODE>fs_empty</CODE> or <CODE>fs_full</CODE>). </P></DD><DT class="overloaded"><CODE>OZ_FSetValue</CODE> <A name="label134"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>overloaded constructor</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>OZ_FSetValue(<SPAN class="type">int</SPAN> <SPAN class="variablename">min_elem</SPAN>, <SPAN class="type">int</SPAN> <SPAN class="variablename">max_elem</SPAN>);</CODE> </P></BLOCKQUOTE></DD><DD><P>Creates a Finite Set Value <IMG alt="\{min\_elem, \ldots, max\_elem\}" src="latex13.png">. </P></DD></DL><P> </P></DIV><DIV id="r_fs.refl"><H3><A name="r_fs.refl">1.7.3 Reflection Member Functions</A></H3><P> </P><DL><DT class="constant"><CODE>getMinElem</CODE> <A name="label135"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>constant member function</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE><SPAN class="type">int</SPAN> <SPAN class="functionname">getMinElem</SPAN>(<SPAN class="type">void</SPAN>) <SPAN class="keyword">const</SPAN>;</CODE> </P></BLOCKQUOTE></DD><DD><P>Returns the smallest element of the set. </P></DD><DT class="constant"><CODE>getMaxElem</CODE> <A name="label136"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>constant member function</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE><SPAN class="type">int</SPAN> <SPAN class="functionname">getMaxElem</SPAN>(<SPAN class="type">void</SPAN>) <SPAN class="keyword">const</SPAN>;</CODE> </P></BLOCKQUOTE></DD><DD><P>Returns the largest element of the set. </P></DD><DT class="constant"><CODE>getNextLargerElem</CODE> <A name="label137"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>constant member function</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE><SPAN class="type">int</SPAN> <SPAN class="functionname">getNextLargerElem</SPAN>(<SPAN class="type">int</SPAN> <SPAN class="variablename">i</SPAN>) <SPAN class="keyword">const</SPAN>;</CODE> </P></BLOCKQUOTE></DD><DD><P>Returns the next larger Element after i in the set, or -1 if there is none. </P></DD><DT class="constant"><CODE>getNextSmallerElem</CODE> <A name="label138"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>constant member function</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE><SPAN class="type">int</SPAN> <SPAN class="functionname">getNextSmallerElem</SPAN>(<SPAN class="type">int</SPAN> <SPAN class="variablename">i</SPAN>) <SPAN class="keyword">const</SPAN>;</CODE> </P></BLOCKQUOTE></DD><DD><P>Returns the next smaller Element before i in the set, or -1 if there is none. </P></DD><DT class="constant"><CODE>getKnownInList</CODE> <A name="label139"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>constant member function</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE><SPAN class="type">OZ_Term</SPAN> <SPAN class="functionname">getKnownInList</SPAN>(<SPAN class="type">void</SPAN>) <SPAN class="keyword">const</SPAN>;</CODE> </P></BLOCKQUOTE></DD><DD><P>Returns a <EM>level4</EM>-List (see <A href="node2.html#expect.checkconstr">Section 1.2.4</A>) containing the elements in the set. </P></DD><DT class="constant"><CODE>getKnownNotInList</CODE> <A name="label140"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>constant member function</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE><SPAN class="type">OZ_Term</SPAN> <SPAN class="functionname">getKnownNotInList</SPAN>(<SPAN class="type">void</SPAN>) <SPAN class="keyword">const</SPAN>;</CODE> </P></BLOCKQUOTE></DD><DD><P>Returns a <EM>level4</EM>-List (see <A href="node2.html#expect.checkconstr">Section 1.2.4</A>) containing the elements in the complementary set. </P></DD></DL><P> </P></DIV><DIV id="r_fs.op"><H3><A name="r_fs.op">1.7.4 Operator Member Functions</A></H3><P> </P><DL><DT class="constant"><CODE><SPAN class="keyword">operator</SPAN> ==</CODE> <A name="label141"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>operator constant member function</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE><SPAN class="type">OZ_Boolean</SPAN> <SPAN class="keyword">operator</SPAN> <SPAN class="functionname">==</SPAN> (<SPAN class="keyword">const</SPAN> <SPAN class="type">OZ_FSetValue</SPAN> &<SPAN class="variablename">fs</SPAN>) <SPAN class="keyword">const</SPAN>;</CODE> </P></BLOCKQUOTE></DD><DD><P>Tests equality on sets. </P></DD><DT class="constant"><CODE><SPAN class="keyword">operator</SPAN> <=</CODE> <A name="label142"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>operator constant member function</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE><SPAN class="type">OZ_Boolean</SPAN> <SPAN class="keyword">operator</SPAN> <SPAN class="functionname"><=</SPAN> (<SPAN class="keyword">const</SPAN> <SPAN class="type">OZ_FSetValue</SPAN> &<SPAN class="variablename">fs</SPAN>) <SPAN class="keyword">const</SPAN>;</CODE> </P></BLOCKQUOTE></DD><DD><P>Return <CODE>OZ_True</CODE> if <CODE>*<SPAN class="keyword">this</SPAN></CODE> is a subset of <CODE>fs</CODE>. </P></DD><DT class="constant"><CODE><SPAN class="keyword">operator</SPAN> &</CODE> <A name="label143"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>operator constant member function</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE><SPAN class="type">OZ_FSetValue</SPAN> <SPAN class="keyword">operator</SPAN> <SPAN class="functionname">&</SPAN> (<SPAN class="keyword">const</SPAN> <SPAN class="type">OZ_FSetValue</SPAN> &<SPAN class="variablename">fs</SPAN>) <SPAN class="keyword">const</SPAN>;</CODE> </P></BLOCKQUOTE></DD><DD><P>Returns the intersection of <CODE>*<SPAN class="keyword">this</SPAN></CODE> with <CODE>fs</CODE>. </P></DD><DT class="constant"><CODE><SPAN class="keyword">operator</SPAN> |</CODE> <A name="label144"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>operator constant member function</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE><SPAN class="type">OZ_FSetValue</SPAN> <SPAN class="keyword">operator</SPAN> <SPAN class="functionname">|</SPAN> (<SPAN class="keyword">const</SPAN> <SPAN class="type">OZ_FSetValue</SPAN> &<SPAN class="variablename">fs</SPAN>) <SPAN class="keyword">const</SPAN>;</CODE> </P></BLOCKQUOTE></DD><DD><P>Returns the union of <CODE>*<SPAN class="keyword">this</SPAN></CODE> with <CODE>fs</CODE>. </P></DD><DT class="constant"><CODE><SPAN class="keyword">operator</SPAN> -</CODE> <A name="label145"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>operator constant member function</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE><SPAN class="type">OZ_FSetValue</SPAN> <SPAN class="keyword">operator</SPAN> <SPAN class="functionname">-</SPAN> (<SPAN class="keyword">const</SPAN> <SPAN class="type">OZ_FSetValue</SPAN> &<SPAN class="variablename">fs</SPAN>) <SPAN class="keyword">const</SPAN>;</CODE> </P></BLOCKQUOTE></DD><DD><P>Returns the elements in <CODE>*<SPAN class="keyword">this</SPAN></CODE> not in <CODE>fs</CODE>. </P></DD><DT class="operator"><CODE><SPAN class="keyword">operator</SPAN> &=</CODE> <A name="label146"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>operator member function</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE><SPAN class="type">OZ_FSetValue</SPAN> <SPAN class="keyword">operator</SPAN> <SPAN class="functionname">&=</SPAN> (<SPAN class="keyword">const</SPAN> <SPAN class="type">OZ_FSetValue</SPAN> &<SPAN class="variablename">fs</SPAN>);</CODE> </P></BLOCKQUOTE></DD><DD><P><CODE>*<SPAN class="keyword">this</SPAN></CODE> is assigned its intersection with <CODE>fs</CODE>. </P></DD><DT class="operator"><CODE><SPAN class="keyword">operator</SPAN> |=</CODE> <A name="label147"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>operator member function</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE><SPAN class="type">OZ_FSetValue</SPAN> <SPAN class="keyword">operator</SPAN> <SPAN class="functionname">|=</SPAN> (<SPAN class="keyword">const</SPAN> <SPAN class="type">OZ_FSetValue</SPAN> &);</CODE> </P></BLOCKQUOTE></DD><DD><P><CODE>*<SPAN class="keyword">this</SPAN></CODE> is assigned its union with <CODE>fs</CODE>. </P></DD><DT class="operator"><CODE><SPAN class="keyword">operator</SPAN> &=</CODE> <A name="label148"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>operator member function</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE><SPAN class="type">OZ_FSetValue</SPAN> <SPAN class="keyword">operator</SPAN> <SPAN class="functionname">&=</SPAN> (<SPAN class="keyword">const</SPAN> <SPAN class="type">int</SPAN> <SPAN class="variablename">i</SPAN>);</CODE> </P></BLOCKQUOTE></DD><DD><P>If <CODE>i</CODE> is in <CODE>*<SPAN class="keyword">this</SPAN></CODE>, this function returns <IMG alt="\{i\}" src="latex14.png">; otherwise the empty set. </P></DD><DT class="operator"><CODE><SPAN class="keyword">operator</SPAN> +=</CODE> <A name="label149"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>operator member function</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE><SPAN class="type">OZ_FSetValue</SPAN> <SPAN class="keyword">operator</SPAN> <SPAN class="functionname">+=</SPAN> (<SPAN class="keyword">const</SPAN> <SPAN class="type">int</SPAN> <SPAN class="variablename">i</SPAN>);</CODE> </P></BLOCKQUOTE></DD><DD><P><CODE>i</CODE> is put into <CODE>*<SPAN class="keyword">this</SPAN></CODE>. </P></DD><DT class="operator"><CODE><SPAN class="keyword">operator</SPAN> -=</CODE> <A name="label150"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>operator member function</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE><SPAN class="type">OZ_FSetValue</SPAN> <SPAN class="keyword">operator</SPAN><SPAN class="functionname">-=</SPAN>(<SPAN class="keyword">const</SPAN> <SPAN class="type">int</SPAN>);</CODE> </P></BLOCKQUOTE></DD><DD><P><CODE>i</CODE> is removed from <CODE>*<SPAN class="keyword">this</SPAN></CODE>, if in. </P></DD><DT class="constant"><CODE><SPAN class="keyword">operator</SPAN> -</CODE> <A name="label151"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>operator constant member function</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE><SPAN class="type">OZ_FSetValue</SPAN> <SPAN class="keyword">operator</SPAN><SPAN class="functionname">-</SPAN>(<SPAN class="type">void</SPAN>) <SPAN class="keyword">const</SPAN>;</CODE> </P></BLOCKQUOTE></DD><DD><P>Returns the complement of <CODE>*<SPAN class="keyword">this</SPAN></CODE>. </P></DD></DL><P> </P></DIV><DIV id="r_fs.aux"><H3><A name="r_fs.aux">1.7.5 Auxiliary Member Functions</A></H3><P> </P><DL><DT class="member"><CODE>init</CODE> <A name="label152"></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">init</SPAN>(<SPAN class="keyword">const</SPAN> <SPAN class="type">OZ_FSetState</SPAN> <SPAN class="variablename">state</SPAN>);</CODE> </P></BLOCKQUOTE></DD><DD><P>Initializes a Finite Set Value according to <CODE>state</CODE> (<CODE>fs_empty</CODE> or <CODE>fs_full</CODE>). </P></DD><DT class="constant"><CODE>isIn</CODE> <A name="label153"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>constant member function</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE><SPAN class="type">OZ_Boolean</SPAN> <SPAN class="functionname">isIn</SPAN>(<SPAN class="type">int</SPAN> <SPAN class="variablename">i</SPAN>) <SPAN class="keyword">const</SPAN>;</CODE> </P></BLOCKQUOTE></DD><DD><P>Returns <CODE>OZ_True</CODE> if <CODE>i</CODE> is in <CODE>*<SPAN class="keyword">this</SPAN></CODE>. </P></DD><DT class="constant"><CODE>isNotIn</CODE> <A name="label154"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>constant member function</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE><SPAN class="type">OZ_Boolean</SPAN> <SPAN class="functionname">isNotIn</SPAN>(<SPAN class="type">int</SPAN>) <SPAN class="keyword">const</SPAN>;</CODE> </P></BLOCKQUOTE></DD><DD><P>Returns <CODE>OZ_True</CODE> if <CODE>i</CODE> is not in <CODE>*<SPAN class="keyword">this</SPAN></CODE>. </P></DD><DT class="constant"><CODE>getCard</CODE> <A name="label155"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>constant member function</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE><SPAN class="type">int</SPAN> <SPAN class="functionname">getCard</SPAN>(<SPAN class="type">void</SPAN>) <SPAN class="keyword">const</SPAN>;</CODE> </P></BLOCKQUOTE></DD><DD><P>Returns the cardinality of <CODE>*<SPAN class="keyword">this</SPAN></CODE>. </P></DD><DT class="constant"><CODE>getKnownNotIn</CODE> <A name="label156"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>constant member function</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE><SPAN class="type">int</SPAN> <SPAN class="functionname">getKnownNotIn</SPAN>(<SPAN class="type">void</SPAN>) <SPAN class="keyword">const</SPAN>;</CODE> </P></BLOCKQUOTE></DD><DD><P>Returns the cardinality of <CODE>*<SPAN class="keyword">this</SPAN></CODE>' complement. </P></DD><DT class="member"><CODE>copyExtension</CODE> <A name="label157"></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">copyExtension</SPAN>(<SPAN class="type">void</SPAN>);</CODE> </P></BLOCKQUOTE></DD><DD><P>This member function replaces the current extension of the set value representation by a copy of it. </P></DD><DT class="member"><CODE>disposeExtension</CODE> <A name="label158"></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">disposeExtension</SPAN>(<SPAN class="type">void</SPAN>);</CODE> </P></BLOCKQUOTE></DD><DD><P>This member function frees the heap memory occupied by the extension of the set value. </P></DD><DT class="constant"><CODE>toString</CODE> <A name="label159"></A><SPAN class="entrycategory"><SPAN class="entrycategorybracket"> [</SPAN><I>constant member function</I><SPAN class="entrycategorybracket">]</SPAN></SPAN></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE><SPAN class="type">char</SPAN> * <SPAN class="functionname">toString</SPAN>(<SPAN class="type">void</SPAN>) <SPAN class="keyword">const</SPAN>;</CODE> </P></BLOCKQUOTE></DD><DD><P>Returns a textual representation of the finite set value pointing to a static array of <CODE><SPAN class="type">char</SPAN></CODE>s. </P></DD></DL><P> </P></DIV></DIV><TABLE align="center" border="0" cellpadding="6" cellspacing="6" class="nav"><TR bgcolor="#DDDDDD"><TD><A href="node6.html#r_fsvar"><< Prev</A></TD><TD><A href="ip.html">- Up -</A></TD><TD><A href="node8.html#r_fsc">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>
|