/usr/share/mozart/doc/system/node12.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.3 Search.object</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="node11.html#generalsearch"><< Prev</A></TD><TD><A href="node9.html">- Up -</A></TD><TD><A href="node13.html#section.search.parallel">Next >></A></TD></TR></TABLE><DIV id="sec.search.object"><H2><A name="sec.search.object">4.3 <CODE>Search<SPAN class="keyword">.</SPAN>object</CODE></A></H2><P>The object <CODE>Search<SPAN class="keyword">.</SPAN>object</CODE> implements a demand driven search engine which supports recomputation, single, all, and best solution search and different kinds of output in the same way as the search engines in the previous section. <A name="label91"></A> </P><DL><DT><CODE>script</CODE> <A name="label93"></A></DT><DD><BLOCKQUOTE class="synopsis"><P></P><BLOCKQUOTE class="code"><CODE>script(</CODE><CODE>+<I>ScriptP</I></CODE><CODE> <BR> </CODE><CODE>+<I>OrderP</I></CODE><CODE> <SPAN class="keyword"><=</SPAN> _ <BR> rcd:</CODE><CODE>+<I>RcdI</I></CODE><CODE> <SPAN class="keyword"><=</SPAN> 1)</CODE></BLOCKQUOTE><P></P></BLOCKQUOTE></DD><DD><P>Initializes the object for the script <CODE>+<I>Script</I></CODE> (a unary procedure). If the optional argument <CODE>+<I>OrderP</I></CODE> (a binary procedure) is given, the object uses a branch and bound strategy for best solution search.</P><P><CODE>+<I>RcdI</I></CODE> is the recomputation distance (see <A href="node11.html#generalsearch">Section 4.2</A>). </P></DD><DT><CODE>next</CODE> <A name="label95"></A></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>next(</CODE><CODE>?<I>Xs</I></CODE><CODE>)</CODE></P></BLOCKQUOTE></DD><DT><CODE>nextS</CODE> <A name="label97"></A></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>nextS(</CODE><CODE>?<I>Spaces</I></CODE><CODE>)</CODE></P></BLOCKQUOTE></DD><DT><CODE>nextP</CODE> <A name="label99"></A></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>nextP(</CODE><CODE>?<I>Ps</I></CODE><CODE>)</CODE></P></BLOCKQUOTE></DD><DD><P>returns a singleton list which contains the next solution. If no further solution exists, <CODE>nil</CODE> is returned. If the search is stopped by a message <CODE>stop</CODE>, <CODE>stopped</CODE> is returned.</P><P>The object releases its state immediately. </P></DD><DT><CODE>last</CODE> <A name="label101"></A></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>last(</CODE><CODE>?<I>Xs</I></CODE><CODE>)</CODE></P></BLOCKQUOTE></DD><DT><CODE>lastS</CODE> <A name="label103"></A></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>lastS(</CODE><CODE>?<I>Spaces</I></CODE><CODE>)</CODE></P></BLOCKQUOTE></DD><DT><CODE>lastP</CODE> <A name="label105"></A></DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>lastP(</CODE><CODE>?<I>Ps</I></CODE><CODE>)</CODE></P></BLOCKQUOTE></DD><DD><P>returns a singleton list which contains the last solution. If no further solution exists, <CODE>nil</CODE> is returned. If the search is stopped by a message <CODE>stop</CODE>, <CODE>stopped</CODE> is returned.</P><P>The object releases its state immediately. If the object has been initialized for best solution search, the last solution is the best solution. </P></DD><DT><CODE>stop</CODE> <A name="label107"></A></DT><DD><BLOCKQUOTE class="synopsis"><P></P><BLOCKQUOTE class="code"><CODE>stop</CODE></BLOCKQUOTE><P></P></BLOCKQUOTE></DD><DD><P>stops the search engine. The search engine can be restarted by <CODE>next</CODE>, <CODE>nextS</CODE>, <CODE>nextP</CODE>, <CODE>last</CODE>, <CODE>lastS</CODE>, and <CODE>lastP</CODE>. </P></DD></DL><P></P></DIV><TABLE align="center" border="0" cellpadding="6" cellspacing="6" class="nav"><TR bgcolor="#DDDDDD"><TD><A href="node11.html#generalsearch"><< Prev</A></TD><TD><A href="node9.html">- Up -</A></TD><TD><A href="node13.html#section.search.parallel">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>
|