Removed dead stress test from docs

Christian Schulte · Christian Schulte · commit ce990cf1eb2e · 2010-10-07T09:52:01.000Z
git-svn-id: file:///Users/tack/GecodeGitMigration/gecode-svn-mirror/gecode/trunk@11473 e85b7adc-8362-4630-8c63-7469d557c915
diff --git a/doxygen/doxygen.hh.in b/doxygen/doxygen.hh.in
@@ -352,24 +352,6 @@
  *
  */
 
-/**
- * \defgroup ExProblem Scripts for problems
- * \ingroup Example
- *
- * These scripts are for small problems that exemplify how to model
- * with %Gecode.
- *
- */
-
-/**
- * \defgroup ExStress Scripts for stress tests
- * \ingroup Example
- *
- * These scripts are for stressing certain system features, typically
- * the implementation of a particular constraint.
- *
- */
-
 /*
  * Collect some definitions for which no reasonable place exists
  *
diff --git a/examples/all-interval.cpp b/examples/all-interval.cpp
@@ -61,7 +61,7 @@ using namespace Gecode;
  *
  * See also problem 7 at http://www.csplib.org/.
  *
- * \ingroup ExProblem
+ * \ingroup Example
  */
 class AllInterval : public Script {
 private:
diff --git a/examples/alpha.cpp b/examples/alpha.cpp
@@ -47,7 +47,7 @@ using namespace Gecode;
  *
  * Well-known cryptoarithmetic puzzle of unknown origin.
  *
- * \ingroup ExProblem
+ * \ingroup Example
  *
  */
 class Alpha : public Script {
diff --git a/examples/bacp.cpp b/examples/bacp.cpp
@@ -94,7 +94,7 @@ namespace {
  * Academic Curriculum Problem", J.N. Monette, P. Schaus, S. Zampelli,
  * Y. Deville, and P. Dupont is available.
  *
- * \ingroup ExProblem
+ * \ingroup Example
  *
  */
 class BACP : public MinimizeScript {
diff --git a/examples/bibd.cpp b/examples/bibd.cpp
@@ -90,7 +90,7 @@ class BIBDOptions : public Options {
  *
  * See problem 28 at http://www.csplib.org/.
  *
- * \ingroup ExProblem
+ * \ingroup Example
  *
  */
 class BIBD : public Script {
diff --git a/examples/bin-packing.cpp b/examples/bin-packing.cpp
@@ -351,7 +351,7 @@ class CDBF : public Brancher {
 /**
  * \brief %Example: bin packing
  *
- * \ingroup ExProblem
+ * \ingroup Example
  *
  */
 class BinPacking : public MinimizeScript {
diff --git a/examples/black-hole.cpp b/examples/black-hole.cpp
@@ -190,7 +190,7 @@ class BlackHoleBranch : Brancher {
  * The conditional symmetry identified in the above paper can be
  * eliminated (enabled by default).
  *
- * \ingroup ExProblem
+ * \ingroup Example
  *
  */
 class BlackHole : public Script {
diff --git a/examples/car-sequencing.cpp b/examples/car-sequencing.cpp
@@ -205,7 +205,7 @@ namespace {
  * in "Combining Forces to Solve the Car Sequencing Problem", Perron
  * and Shaw, CPAIOR 2004.
  *
- * \ingroup ExProblem
+ * \ingroup Example
  */
 class CarSequencing : public Script {
 public:
diff --git a/examples/crew.cpp b/examples/crew.cpp
@@ -88,7 +88,7 @@ namespace {
  * number of cabin crew, and they have to speak certain languages.
  * Every cabin crew member has two flights off after an attended flight.
  *
- * \ingroup ExProblem
+ * \ingroup Example
  *
  */
 class Crew : public Script {
diff --git a/examples/crossword.cpp b/examples/crossword.cpp
@@ -65,7 +65,7 @@ namespace {
  *  Note that "Modeling and Programming with Gecode" uses this example
  *  as a case study.
  *
- * \ingroup ExProblem
+ * \ingroup Example
  */
 class Crossword : public Script {
 protected:
diff --git a/examples/crowded-chess.cpp b/examples/crowded-chess.cpp
@@ -182,7 +182,7 @@ namespace {
    <TD>R</TD><TD>K</TD><TD>B</TD><TD>B</TD></TR>
  </TABLE>
 
-   \ingroup ExProblem
+   \ingroup Example
 */
 class CrowdedChess : public Script {
 protected:
diff --git a/examples/domino.cpp b/examples/domino.cpp
@@ -66,7 +66,7 @@ namespace {
  * The board is set up with a number in each field that must match the
  * number of the domino piece placed on that field.
  *
- * \ingroup ExProblem
+ * \ingroup Example
  *
  */
 class Domino : public Script {
diff --git a/examples/donald.cpp b/examples/donald.cpp
@@ -46,7 +46,7 @@ using namespace Gecode;
  *
  * Well-known cryptoarithmetic puzzle of unknown origin.
  *
- * \ingroup ExProblem
+ * \ingroup Example
  *
  */
 class Donald : public Script {
diff --git a/examples/efpa.cpp b/examples/efpa.cpp
@@ -112,7 +112,7 @@ class EFPAOptions : public Options {
  * P. Gent, Paul McKay, Peter Nightingale, and Sophie Huczynska. It
  * implements the non-Boolean model without SAC.
  *
- * \ingroup ExProblem
+ * \ingroup Example
  *
  */
 class EFPA : public Script {
diff --git a/examples/eq20.cpp b/examples/eq20.cpp
@@ -45,7 +45,7 @@ using namespace Gecode;
  *
  * Standard benchmark for solving linear equations.
  *
- * \ingroup ExProblem
+ * \ingroup Example
  *
  */
 class Eq20 : public Script {
diff --git a/examples/golf.cpp b/examples/golf.cpp
@@ -74,7 +74,7 @@ class GolfOptions : public Options {
  * Note that "Modeling and Programming with Gecode" uses this example
  * as a case study.
  *
- * \ingroup ExProblem
+ * \ingroup Example
  *
  */
 class Golf : public Script {
diff --git a/examples/golomb-ruler.cpp b/examples/golomb-ruler.cpp
@@ -60,7 +60,7 @@ using namespace Gecode;
  * Note that "Modeling and Programming with Gecode" uses this example
  * as a case study.
  *
- * \ingroup ExProblem
+ * \ingroup Example
  *
  */
 class GolombRuler : public MinimizeScript {
diff --git a/examples/graph-color.cpp b/examples/graph-color.cpp
@@ -305,7 +305,7 @@ const GraphColorSpec g2(200, g2_e, g2_c);
 /**
  * \brief %Example: Clique-based graph coloring
  *
- * \ingroup ExProblem
+ * \ingroup Example
  *
  */
 class GraphColor : public MinimizeScript {
diff --git a/examples/grocery.cpp b/examples/grocery.cpp
@@ -54,7 +54,7 @@ using namespace Gecode;
  * Constraint Programming in Oz. A Tutorial. 2001.
  * Available from: http://www.mozart-oz.org/documentation/fdt/
  *
- * \ingroup ExProblem
+ * \ingroup Example
  *
  */
 class Grocery : public Script {
diff --git a/examples/hamming.cpp b/examples/hamming.cpp
@@ -84,7 +84,7 @@ class HammingOptions : public Options {
  * The Hamming distance between two words is the number of bit positions
  * where they differ.
  *
- * \ingroup ExProblem
+ * \ingroup Example
  *
  */
 class Hamming : public Script {
diff --git a/examples/ind-set.cpp b/examples/ind-set.cpp
@@ -78,7 +78,7 @@ const Graph g_40_20(40, 20, e_40_20);
 /**
  * \brief %Example: Independent sets in a graph
  *
- * \ingroup ExProblem
+ * \ingroup Example
  *
  */
 class IndSet : public MaximizeScript {
diff --git a/examples/kakuro.cpp b/examples/kakuro.cpp
@@ -470,7 +470,7 @@ namespace {
  * Note that "Modeling and Programming with Gecode" uses this example
  * as a case study.
  *
- * \ingroup ExProblem
+ * \ingroup Example
  */
 class Kakuro : public Script {
 protected:
diff --git a/examples/knights.cpp b/examples/knights.cpp
@@ -230,7 +230,7 @@ class Knights : public Script {
  * the knight does a full tour (last move reaches first move
  * again). The formulation is due to Gert Smolka.
  *
- * \ingroup ExProblem
+ * \ingroup Example
  *
  */
 class KnightsReified : public Knights {
@@ -283,7 +283,7 @@ class KnightsReified : public Knights {
  * knights do a full tour by knights move (last knight reaches
  * first knight again).
  *
- * \ingroup ExProblem
+ * \ingroup Example
  *
  */
 class KnightsCircuit : public Knights {
diff --git a/examples/langford-number.cpp b/examples/langford-number.cpp
@@ -79,7 +79,7 @@ class LangfordNumberOptions : public Options {
  *
  * See problem 24 at http://www.csplib.org/.
  *
- * \ingroup ExProblem
+ * \ingroup Example
  */
 class LangfordNumber : public Script {
 protected:
diff --git a/examples/magic-sequence.cpp b/examples/magic-sequence.cpp
@@ -57,7 +57,7 @@ using namespace Gecode;
  * Note that "Modeling and Programming with Gecode" uses this example
  * as a case study.
  *
- * \ingroup ExProblem
+ * \ingroup Example
  *
  */
 class MagicSequence : public Script {
diff --git a/examples/magic-square.cpp b/examples/magic-square.cpp
@@ -48,7 +48,7 @@ using namespace Gecode;
  *
  * See problem 19 at http://www.csplib.org/.
  *
- * \ingroup ExProblem
+ * \ingroup Example
  *
  */
 class MagicSquare : public Script {
diff --git a/examples/minesweeper.cpp b/examples/minesweeper.cpp
@@ -58,7 +58,7 @@ namespace {
  * The instances are taken from
  *   http://www.janko.at/Raetsel/Minesweeper/index.htm
  *
- * \ingroup ExProblem
+ * \ingroup Example
  *
  */
 class MineSweeper : public Script {
diff --git a/examples/money.cpp b/examples/money.cpp
@@ -47,7 +47,7 @@ using namespace Gecode;
  * Well-known cryptoarithmetic puzzle.
  * Henry Dudeney, Strand Magazine, July 1924.
  *
- * \ingroup ExProblem
+ * \ingroup Example
  *
  */
 class Money : public Script {
diff --git a/examples/nonogram.cpp b/examples/nonogram.cpp
@@ -71,7 +71,7 @@ namespace {
  * Note that "Modeling and Programming with Gecode" uses this example
  * as a case study.
  *
- * \ingroup ExProblem
+ * \ingroup Example
  *
  */
 class Nonogram : public Script {
diff --git a/examples/open-shop.cpp b/examples/open-shop.cpp
@@ -62,7 +62,7 @@ namespace {
 /**
  * \brief %Example: open-shop scheduling
  *
- * \ingroup ExProblem
+ * \ingroup Example
  *
  */
 class OpenShop : public MinimizeScript {
diff --git a/examples/ortho-latin.cpp b/examples/ortho-latin.cpp
@@ -43,7 +43,7 @@ using namespace Gecode;
 /**
  * \brief %Example: Orthogonal latin squares
  *
- * \ingroup ExProblem
+ * \ingroup Example
  */
 class OrthoLatinSquare : public Script {
 protected:
diff --git a/examples/partition.cpp b/examples/partition.cpp
@@ -44,7 +44,7 @@ using namespace Gecode;
 /**
  * \brief %Example: partition numbers into two groups
  *
- * \ingroup ExProblem
+ * \ingroup Example
  */
 class Partition : public Script {
 protected:
diff --git a/examples/pentominoes.cpp b/examples/pentominoes.cpp
@@ -259,7 +259,7 @@ namespace {
  * for the piece symmetries and lexicographical order constraints.
  *
  *
- * \ingroup ExProblem
+ * \ingroup Example
  *
  */
 class Pentominoes : public Script {
diff --git a/examples/perfect-square.cpp b/examples/perfect-square.cpp
@@ -185,7 +185,7 @@ const unsigned int n_specs = sizeof(specs) / sizeof(int*);
  *
  * See problem 9 at http://www.csplib.org/.
  *
- * \ingroup ExProblem
+ * \ingroup Example
  */
 class PerfectSquare : public Script {
 protected:
diff --git a/examples/photo.cpp b/examples/photo.cpp
@@ -74,7 +74,7 @@ const PhotoSpec p_large(9,17, l_prefs);
  * photo. The problem to be solved is to find a placement that
  * violates as few preferences as possible.
  *
- * \ingroup ExProblem
+ * \ingroup Example
  *
  */
 class Photo : public MinimizeScript {
diff --git a/examples/queen-armies.cpp b/examples/queen-armies.cpp
@@ -65,7 +65,7 @@ IntSet* A;
  * from the above paper, that helps speeding up the proof of
  * optimality.
  *
- * \ingroup ExProblem
+ * \ingroup Example
  *
  */
 class QueenArmies : public MaximizeScript {
diff --git a/examples/queens.cpp b/examples/queens.cpp
@@ -51,7 +51,7 @@ using namespace Gecode;
  * Place n queens on an n times n chessboard such that they do not
  * attack each other.
  *
- * \ingroup ExProblem
+ * \ingroup Example
  *
  */
 class Queens : public Script {
diff --git a/examples/radiotherapy.cpp b/examples/radiotherapy.cpp
@@ -95,7 +95,7 @@ namespace {
  *   Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices:
  *   CP and IP Approaches. CPAIOR 2007
  *
- * \ingroup ExProblem
+ * \ingroup Example
  *
  */
 
diff --git a/examples/sat.cpp b/examples/sat.cpp
@@ -110,7 +110,7 @@ class SatOptions : public Options {
  * Benchmarks on satlib.org, for instance,
  * are in the dimacs CNF format.
  *
- * \ingroup ExProblem
+ * \ingroup Example
  */
 class Sat : public Script {
 private:
diff --git a/examples/sports-league.cpp b/examples/sports-league.cpp
@@ -173,7 +173,7 @@ class RRS {
  *
  * See also problem 26 at http://www.csplib.org/.
  *
- * \ingroup ExProblem
+ * \ingroup Example
  */
 class SportsLeague : public Script {
 protected:
diff --git a/examples/steel-mill.cpp b/examples/steel-mill.cpp
@@ -141,7 +141,7 @@ class SteelMillOptions : public Options {
  * "http://becool.info.ucl.ac.be/steelmillslab">
  * http://becool.info.ucl.ac.be/steelmillslab</a>.
  *
- * \ingroup ExProblem
+ * \ingroup Example
  *
  */
 class SteelMill : public MinimizeScript {
diff --git a/examples/steiner.cpp b/examples/steiner.cpp
diff --git a/examples/sudoku.cpp b/examples/sudoku.cpp
diff --git a/examples/tsp.cpp b/examples/tsp.cpp
diff --git a/examples/warehouses.cpp b/examples/warehouses.cpp
diff --git a/examples/word-square.cpp b/examples/word-square.cpp

Original file line number	Diff line number	Diff line change
`@@ -61,7 +61,7 @@ using namespace Gecode;`
`61`	`61`	`*`
`62`	`62`	`* See also problem 7 at http://www.csplib.org/.`
`63`	`63`	`*`
`64`		`- * \ingroup ExProblem`
	`64`	`+ * \ingroup Example`
`65`	`65`	`*/`
`66`	`66`	`class AllInterval : public Script {`
`67`	`67`	`private:`
Original file line number	Diff line number	Diff line change
`@@ -47,7 +47,7 @@ using namespace Gecode;`
`47`	`47`	`*`
`48`	`48`	`* Well-known cryptoarithmetic puzzle of unknown origin.`
`49`	`49`	`*`
`50`		`- * \ingroup ExProblem`
	`50`	`+ * \ingroup Example`
`51`	`51`	`*`
`52`	`52`	`*/`
`53`	`53`	`class Alpha : public Script {`
Original file line number	Diff line number	Diff line change
`@@ -94,7 +94,7 @@ namespace {`
`94`	`94`	`* Academic Curriculum Problem", J.N. Monette, P. Schaus, S. Zampelli,`
`95`	`95`	`* Y. Deville, and P. Dupont is available.`
`96`	`96`	`*`
`97`		`- * \ingroup ExProblem`
	`97`	`+ * \ingroup Example`
`98`	`98`	`*`
`99`	`99`	`*/`
`100`	`100`	`class BACP : public MinimizeScript {`
Original file line number	Diff line number	Diff line change
`@@ -90,7 +90,7 @@ class BIBDOptions : public Options {`
`90`	`90`	`*`
`91`	`91`	`* See problem 28 at http://www.csplib.org/.`
`92`	`92`	`*`
`93`		`- * \ingroup ExProblem`
	`93`	`+ * \ingroup Example`
`94`	`94`	`*`
`95`	`95`	`*/`
`96`	`96`	`class BIBD : public Script {`
Original file line number	Diff line number	Diff line change
`@@ -351,7 +351,7 @@ class CDBF : public Brancher {`
`351`	`351`	`/**`
`352`	`352`	`* \brief %Example: bin packing`
`353`	`353`	`*`
`354`		`- * \ingroup ExProblem`
	`354`	`+ * \ingroup Example`
`355`	`355`	`*`
`356`	`356`	`*/`
`357`	`357`	`class BinPacking : public MinimizeScript {`
Original file line number	Diff line number	Diff line change
`@@ -190,7 +190,7 @@ class BlackHoleBranch : Brancher {`
`190`	`190`	`* The conditional symmetry identified in the above paper can be`
`191`	`191`	`* eliminated (enabled by default).`
`192`	`192`	`*`
`193`		`- * \ingroup ExProblem`
	`193`	`+ * \ingroup Example`
`194`	`194`	`*`
`195`	`195`	`*/`
`196`	`196`	`class BlackHole : public Script {`
Original file line number	Diff line number	Diff line change
`@@ -205,7 +205,7 @@ namespace {`
`205`	`205`	`* in "Combining Forces to Solve the Car Sequencing Problem", Perron`
`206`	`206`	`* and Shaw, CPAIOR 2004.`
`207`	`207`	`*`
`208`		`- * \ingroup ExProblem`
	`208`	`+ * \ingroup Example`
`209`	`209`	`*/`
`210`	`210`	`class CarSequencing : public Script {`
`211`	`211`	`public:`
Original file line number	Diff line number	Diff line change
`@@ -88,7 +88,7 @@ namespace {`
`88`	`88`	`* number of cabin crew, and they have to speak certain languages.`
`89`	`89`	`* Every cabin crew member has two flights off after an attended flight.`
`90`	`90`	`*`
`91`		`- * \ingroup ExProblem`
	`91`	`+ * \ingroup Example`
`92`	`92`	`*`
`93`	`93`	`*/`
`94`	`94`	`class Crew : public Script {`
Original file line number	Diff line number	Diff line change
`@@ -65,7 +65,7 @@ namespace {`
`65`	`65`	`* Note that "Modeling and Programming with Gecode" uses this example`
`66`	`66`	`* as a case study.`
`67`	`67`	`*`
`68`		`- * \ingroup ExProblem`
	`68`	`+ * \ingroup Example`
`69`	`69`	`*/`
`70`	`70`	`class Crossword : public Script {`
`71`	`71`	`protected:`