/usr/share/mozart/doc/cpitut/toc.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>Table of Contents</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="index.html">- Up -</A></TD><TD><A href="node1.html#chapter.ip">Next >></A></TD></TR></TABLE><H1><A name="label1">Table of Contents</A></H1><HR><UL class="toc"><LI><A href="toc.html#label1">Table of Contents</A></LI><LI><A href="node1.html#chapter.ip">1 Implementing Propagators</A><UL class="toc"><LI><A href="node2.html#u_basic_concepts">1.1 Basic Concepts</A><UL class="toc"><LI><A href="node2.html#u_basic_concepts.computation">1.1.1 Computation with Constraints in Oz</A></LI><LI><A href="node2.html#u_basic_concepts.impprop">1.1.2 Implementation of Propagators</A></LI></UL></LI><LI><A href="node3.html#u_getting_started">1.2 Getting Started</A><UL class="toc"><LI><A href="node3.html#u_getting_started.prerequisites">1.2.1 Prerequisites</A></LI><LI><A href="node3.html#u_getting_started.building">1.2.2 Building a Propagator</A><UL class="toc"><LI><A href="node3.html#u_getting_started.building.def">A Propagator's Class Definition</A></LI><LI><A href="node3.html#u_getting_started.propagation">The Propagation Part of a Propagator</A></LI><LI><A href="node3.html#u_getting_started.creating">Creating a Propagator</A></LI></UL></LI></UL></LI><LI><A href="node4.html#u_replacing">1.3 Replacing a Propagator</A><UL class="toc"><LI><A href="node4.html#u_replace.twice">1.3.1 A Twice Propagator</A></LI><LI><A href="node4.html#u_replace.equality">1.3.2 Equality Detection and Replacement</A></LI><LI><A href="node4.html#u_replace.benefits">1.3.3 Benefits of Replacing Propagators</A></LI></UL></LI><LI><A href="node5.html#u_nesting">1.4 Imposing Propagators</A><UL class="toc"><LI><A href="node5.html#u_nesting.basic">1.4.1 Basic Concepts</A></LI><LI><A href="node5.html#u_nesting.impose">1.4.2 Imposing Nestable Propagators</A></LI><LI><A href="node5.html#u_nesting.customize">1.4.3 Customizing <CODE>OZ_Expect</CODE></A></LI></UL></LI><LI><A href="node6.html#u_vectors">1.5 Using Vectors in Propagators</A><UL class="toc"><LI><A href="node6.html#u_vector.element">1.5.1 The <EM>element</EM> Constraint</A></LI><LI><A href="node6.html#u_vector.class">1.5.2 The Class Definition of <CODE>ElementProp</CODE></A></LI><LI><A href="node6.html#u_vector.header">1.5.3 The Header Function</A></LI><LI><A href="node6.html#u_vector.iterators">1.5.4 Iterators Make Life Easier</A></LI><LI><A href="node6.html#u_vector.rules">1.5.5 Implementing the Propagation Rules</A></LI></UL></LI><LI><A href="node7.html#u_connect">1.6 Connecting Finite Domain and Finite Set Constraints</A><UL class="toc"><LI><A href="node7.html#label3">1.6.1 The Class Definition</A></LI><LI><A href="node7.html#label4">1.6.2 The Propagation Function</A></LI><LI><A href="node7.html#label5">1.6.3 The Header Function and Connecting to the Native Functor Interface</A></LI><LI><A href="node7.html#label6">1.6.4 Testing the Propagator</A></LI></UL></LI><LI><A href="node8.html#u_advanced">1.7 Advanced Topics</A><UL class="toc"><LI><A href="node8.html#u_advanced.detect">1.7.1 Detecting Equal Variables in a Vector</A></LI><LI><A href="node8.html#u_advanced.redundant">1.7.2 Avoiding Redundant Copying</A></LI><LI><A href="node8.html#u_advanced.reified">1.7.3 Reified Constraints</A></LI></UL></LI></UL></LI><LI><A href="ct.html#chapter.ct">2 Building Constraint Systems from Scratch</A><UL class="toc"><LI><A href="node9.html#ct.introduction">2.1 The Generic Part of the C<SPAN class="allcaps">PI</SPAN></A><UL class="toc"><LI><A href="node10.html#ct.intro.model">2.1.1 The Model of a Generic Constraint Solver</A></LI><LI><A href="node11.html#ct.intro.overview">2.1.2 Overview over Generic Part of the C<SPAN class="allcaps">PI</SPAN></A></LI></UL></LI><LI><A href="node12.html#ct.casestudy">2.2 A Casestudy: Real Interval Constraints</A><UL class="toc"><LI><A href="node13.html#ct.casestudy.impl">2.2.1 An Implementation</A><UL class="toc"><LI><A href="node14.html#ct.casestudy.impl.ridef">A Definition Class for Real-Interval Constraints</A></LI><LI><A href="node15.html#ct.casestudy.impl.profilewakeup">Determining Wake-up Events for Real-Interval Constraints</A></LI><LI><A href="node16.html#ct.casestudy.impl.constraint">The Actual Real-Interval Constraint</A></LI><LI><A href="node17.html#ct.casestudy.impl.rivar">Accessing the Constraint Store</A></LI><LI><A href="node18.html#ct.casestudy.impl.expect">Extending <CODE>OZ_Expect</CODE></A></LI><LI><A href="node19.html#ct.casestudy.impl.propagator">A Simple Propagator</A></LI></UL></LI><LI><A href="node20.html#ct.casestudy.reference">2.2.2 The Reference of the Implemented Real-Interval Constraint Solver</A></LI></UL></LI></UL></LI><LI><A href="lp.html#chapter.lp">3 Employing Linear Programming Solvers</A><UL class="toc"><LI><A href="node21.html#lp.tutorial.intro">3.1 Introduction</A></LI><LI><A href="node22.html#lp.tutorial.fd">3.2 The Finite Domain Model</A></LI><LI><A href="node23.html#lp.tutorial.lp">3.3 The Linear Programming Model</A></LI><LI><A href="node24.html#lp.tutorial.fdlp">3.4 Combining Both Models</A></LI><LI><A href="node25.html#lp.tutorial.eval">3.5 Short Evalution</A></LI></UL></LI><LI><A href="bib.html#label25">Bibliography</A></LI><LI><A href="idx.html#label26">Index</A></LI></UL><HR><TABLE align="center" border="0" cellpadding="6" cellspacing="6" class="nav"><TR bgcolor="#DDDDDD"><TD><A href="index.html">- Up -</A></TD><TD><A href="node1.html#chapter.ip">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>
|