<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD><TITLE>2 Invoking the Explorer</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="node1.html#chapter.summary"><< Prev</A></TD><TD><A href="index.html">- Up -</A></TD><TD><A href="node3.html#chapter.interface">Next >></A></TD></TR></TABLE><DIV id="chapter.invoke"><H1><A name="chapter.invoke">2 Invoking the Explorer</A></H1><P> The Explorer is provided as an object <CODE>Explorer<SPAN class="keyword">.</SPAN>object</CODE>. The Explorer can be applied to a script as follows. </P><P> </P><DL><DT><CODE>script</CODE> <A name="label2"></A> </DT><DD><BLOCKQUOTE class="synopsis"><P></P><BLOCKQUOTE class="code"><CODE>{Explorer<SPAN class="keyword">.</SPAN>object script(</CODE><CODE>+<I>ScriptP</I></CODE><CODE>)}</CODE></BLOCKQUOTE><P> </P><BLOCKQUOTE class="code"><CODE>{Explorer<SPAN class="keyword">.</SPAN>object script(</CODE><CODE>+<I>ScriptP</I></CODE><CODE> </CODE><CODE>+<I>OrderP</I></CODE><CODE>)}</CODE></BLOCKQUOTE><P> </P></BLOCKQUOTE></DD><DD><P>Initializes the Explorer with the script <I>ScriptP</I> (a unary procedure). If the binary procedure <I>OrderP</I> is given, the Explorer runs this script in branch and bound mode. </P></DD><DT><CODE>one</CODE> <A name="label3"></A> </DT><DD><BLOCKQUOTE class="synopsis"><P></P><BLOCKQUOTE class="code"><CODE>{Explorer<SPAN class="keyword">.</SPAN>object one(</CODE><CODE>+<I>ScriptP</I></CODE><CODE>)}</CODE></BLOCKQUOTE><P> </P><BLOCKQUOTE class="code"><CODE>{Explorer<SPAN class="keyword">.</SPAN>object one(</CODE><CODE>+<I>ScriptP</I></CODE><CODE> </CODE><CODE>+<I>OrderP</I></CODE><CODE>)}</CODE></BLOCKQUOTE><P> </P></BLOCKQUOTE></DD><DD><P>Initializes the Explorer with the script <I>ScriptP</I> (a unary procedure) and starts exploration of the search tree up to the first solution. If the binary procedure <I>OrderP</I> is given, the Explorer runs this script in branch and bound mode. </P></DD><DT><CODE>all</CODE> <A name="label4"></A> </DT><DD><BLOCKQUOTE class="synopsis"><P></P><BLOCKQUOTE class="code"><CODE>{Explorer<SPAN class="keyword">.</SPAN>object all(</CODE><CODE>+<I>ScriptP</I></CODE><CODE>)}</CODE></BLOCKQUOTE><P> </P><BLOCKQUOTE class="code"><CODE>{Explorer<SPAN class="keyword">.</SPAN>object all(</CODE><CODE>+<I>ScriptP</I></CODE><CODE> </CODE><CODE>+<I>OrderP</I></CODE><CODE>)}</CODE></BLOCKQUOTE><P> </P></BLOCKQUOTE></DD><DD><P>Initializes the Explorer with the script <I>ScriptP</I> (a unary procedure) and starts exploration of the entire search tree. If the binary procedure <I>OrderP</I> is given, the Explorer runs this script in branch and bound mode. </P></DD></DL><P> </P><P> The following procedures are provided for convenience. </P><P> </P><DL><DT><CODE>one</CODE> <A name="label5"></A> </DT><DD><BLOCKQUOTE class="synopsis"><P></P><BLOCKQUOTE class="code"><CODE>{Explorer<SPAN class="keyword">.</SPAN>one </CODE><CODE>+<I>ScriptP</I></CODE><CODE>}</CODE></BLOCKQUOTE><P> </P></BLOCKQUOTE></DD><DD><P>Initializes the Explorer with the script <I>ScriptP</I> (a unary procedure) and starts exploration of the search tree up to the first solution. </P></DD><DT><CODE>all</CODE> <A name="label6"></A> </DT><DD><BLOCKQUOTE class="synopsis"><P></P><BLOCKQUOTE class="code"><CODE>{Explorer<SPAN class="keyword">.</SPAN>all </CODE><CODE>+<I>ScriptP</I></CODE><CODE>}</CODE></BLOCKQUOTE><P> </P></BLOCKQUOTE></DD><DD><P>Initializes the Explorer with the script <I>ScriptP</I> (a unary procedure) and starts exploration of the entire search tree. </P></DD><DT><CODE>best</CODE> <A name="label7"></A> </DT><DD><BLOCKQUOTE class="synopsis"><P></P><BLOCKQUOTE class="code"><CODE>{Explorer<SPAN class="keyword">.</SPAN>best </CODE><CODE>+<I>ScriptP</I></CODE><CODE> </CODE><CODE>+<I>OrderP</I></CODE><CODE>}</CODE></BLOCKQUOTE><P> </P></BLOCKQUOTE></DD><DD><P>Initializes the Explorer with the script <I>ScriptP</I> (a unary procedure) and starts exploration of the entire search tree following a branch and bound strategy. Best solution is performed with respect to <I>OrderP</I> (a binary procedure). </P></DD></DL><P> </P></DIV><TABLE align="center" border="0" cellpadding="6" cellspacing="6" class="nav"><TR bgcolor="#DDDDDD"><TD><A href="node1.html#chapter.summary"><< Prev</A></TD><TD><A href="index.html">- Up -</A></TD><TD><A href="node3.html#chapter.interface">Next >></A></TD></TR></TABLE><HR><ADDRESS><A href="http://www.ps.uni-sb.de/~schulte/">Christian Schulte</A><BR><SPAN class="version">Version 1.4.0 (20090610)</SPAN></ADDRESS></BODY></HTML>
distrib
>
Mandriva
>
2010.0
>
i586
>
media
>
contrib-release
>
by-pkgid
>
bd5c3d824c3db63ffd9226c15941e6ad
>
files
>
788
