/usr/share/mozart/doc/system/node43.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>8 Feature Constraints: RecordC</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="node33.html#chapter.fs"><< Prev</A></TD><TD><A href="index.html">- Up -</A></TD><TD><A href="node44.html#chapter.combinator">Next >></A></TD></TR></TABLE><DIV id="chapter.recordc"><H1><A name="chapter.recordc">8 Feature Constraints: <CODE>RecordC</CODE></A></H1><P> This chapter explains procedures dedicated to feature constraints. </P><DL><DT><A name="label450"></A><SPAN class="index"><CODE>is</CODE></SPAN> <A name="label452"></A> </DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>{RecordC<SPAN class="keyword">.</SPAN>is </CODE><CODE>*<I>X</I></CODE><CODE> </CODE><CODE>?<I>B</I></CODE><CODE>}</CODE> </P></BLOCKQUOTE></DD><DD><P>tests whether <CODE><I>X</I></CODE> has kind record. </P></DD><DT><A name="label453"></A><SPAN class="index"><CODE>tell</CODE></SPAN> <A name="label455"></A> </DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>{RecordC<SPAN class="keyword">.</SPAN>tell </CODE><CODE>+<I>L</I></CODE><CODE> </CODE><CODE>?<I>R</I></CODE><CODE>}</CODE> </P></BLOCKQUOTE></DD><DD><P>tells the constraint store that <CODE><I>R</I></CODE> is a record with label <CODE><I>L</I></CODE>. </P></DD><DT><A name="label456"></A><SPAN class="index"><CODE>tellSize</CODE></SPAN> <A name="label458"></A> </DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>{RecordC<SPAN class="keyword">.</SPAN>tellSize </CODE><CODE>+<I>L</I></CODE><CODE> </CODE><CODE>+<I>I</I></CODE><CODE> </CODE><CODE>?<I>R</I></CODE><CODE>}</CODE> </P></BLOCKQUOTE></DD><DD><P>tells the constraint store that <CODE><I>R</I></CODE> is a record with label <CODE><I>L</I></CODE>. </P><P> Signals the implementation that it is likely that <CODE><I>I</I></CODE> features are told to <CODE><I>R</I></CODE>. <CODE>RecordC<SPAN class="keyword">.</SPAN>tellSize</CODE> is semantically equivalent to <CODE>RecordC<SPAN class="keyword">.</SPAN>tell</CODE>, but the current implementation optimizes memory allocation. </P></DD><DT><A name="label459"></A><SPAN class="index"><CODE>^</CODE></SPAN> <A name="label460"></A> </DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>{RecordC<SPAN class="keyword">.</SPAN><SPAN class="string">'^'</SPAN> </CODE><CODE><I>R</I></CODE><CODE> </CODE><CODE>+<I>LI</I></CODE><CODE> </CODE><CODE><I>X</I></CODE><CODE>}</CODE> </P></BLOCKQUOTE></DD><DD><P>tells the constraint store that <CODE><I>R</I></CODE> is a FC having field <CODE><I>X</I></CODE> at feature <CODE><I>LI</I></CODE>. </P><P> Is supported by the infix operator <CODE>^</CODE>, that is </P><BLOCKQUOTE class="code"><CODE>{RecordC<SPAN class="keyword">.</SPAN><SPAN class="string">'^'</SPAN> </CODE><CODE><I>R</I></CODE><CODE> </CODE><CODE><I>LI</I></CODE><CODE> </CODE><CODE><I>X</I></CODE><CODE>}</CODE></BLOCKQUOTE><P> can also be written as </P><BLOCKQUOTE class="code"><CODE><I>R</I></CODE><CODE>^</CODE><CODE><I>LI</I></CODE><CODE>=</CODE><CODE><I>X</I></CODE></BLOCKQUOTE><P> </P></DD><DT><A name="label461"></A><SPAN class="index"><CODE>width</CODE></SPAN> <A name="label463"></A> </DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>{RecordC<SPAN class="keyword">.</SPAN>width </CODE><CODE>*<I>R</I></CODE><CODE> </CODE><CODE>?<I>D</I></CODE><CODE>}</CODE> </P></BLOCKQUOTE></DD><DD><P>posts a propagator for the constraint that <CODE><I>D</I></CODE> is the width of <CODE><I>R</I></CODE>. Also tells the constraint store that <CODE><I>D</I></CODE> is a finite domain integer. </P></DD><DT><CODE>reflectArity</CODE> <A name="label465"></A> </DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>{RecordC<SPAN class="keyword">.</SPAN>reflectArity </CODE><CODE>*<I>R</I></CODE><CODE> </CODE><CODE>?<I>LIs</I></CODE><CODE>}</CODE> </P></BLOCKQUOTE></DD><DD><P>returns a list <CODE><I>LIs</I></CODE> containing the currently known features of <CODE><I>R</I></CODE>. </P></DD><DT><CODE>monitorArity</CODE> <A name="label467"></A> </DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>{RecordC<SPAN class="keyword">.</SPAN>monitorArity </CODE><CODE>*<I>R</I></CODE><CODE> </CODE><CODE>?<I>P</I></CODE><CODE> </CODE><CODE>?<I>LIs</I></CODE><CODE>}</CODE> </P></BLOCKQUOTE></DD><DD><P>returns a nullary procedure <CODE><I>P</I></CODE> and a stream <CODE><I>LIs</I></CODE> containing the currently known features of <CODE><I>R</I></CODE>. </P><P> Features appear in the stream as soon as they become known to the constraint store. Application of <CODE><I>P</I></CODE> closes the stream and deletes the propagator. The stream is automatically closed once the constraint store determines <CODE><I>R</I></CODE>. </P></DD><DT><CODE>hasLabel</CODE> <A name="label469"></A> </DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>{RecordC<SPAN class="keyword">.</SPAN>hasLabel </CODE><CODE>*<I>R</I></CODE><CODE> </CODE><CODE>?<I>B</I></CODE><CODE>}</CODE> </P></BLOCKQUOTE></DD><DD><P>blocks until <CODE><I>R</I></CODE> becomes a feature structure. Tests whether <CODE><I>R</I></CODE> has been told a label with <CODE>RecordC<SPAN class="keyword">.</SPAN>tell</CODE>. </P></DD></DL><P> </P></DIV><TABLE align="center" border="0" cellpadding="6" cellspacing="6" class="nav"><TR bgcolor="#DDDDDD"><TD><A href="node33.html#chapter.fs"><< Prev</A></TD><TD><A href="index.html">- Up -</A></TD><TD><A href="node44.html#chapter.combinator">Next >></A></TD></TR></TABLE><HR><ADDRESS><A href="http://www.ps.uni-sb.de/~duchier/">Denys Duchier</A>, <A href="http://www.ps.uni-sb.de/~kornstae/">Leif Kornstaedt</A>, <A href="http://www.ps.uni-sb.de/~homik/">Martin Homik</A>, <A href="http://www.ps.uni-sb.de/~tmueller/">Tobias Müller</A>, <A href="http://www.ps.uni-sb.de/~schulte/">Christian Schulte</A> and <A href="http://www.info.ucl.ac.be/~pvr">Peter Van Roy</A><BR><SPAN class="version">Version 1.4.0 (20110908185330)</SPAN></ADDRESS></BODY></HTML>
|