gecoder-with-gecode 0.7.1

data/ext/gecode-1.3.1/examples/support.cc

@@ -0,0 +1,160 @@
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2004
+ *
+ *  Last modified:
+ *     $Date: 2006-08-16 13:07:15 +0200 (Wed, 16 Aug 2006) $ by $Author: zayenz $
+ *     $Revision: 3541 $
+ *
+ *  This file is part of Gecode, the generic constraint
+ *  development environment:
+ *     http://www.gecode.org
+ *
+ *  See the file "LICENSE" for information on usage and
+ *  redistribution of this file, and for a
+ *     DISCLAIMER OF ALL WARRANTIES.
+ *
+ */
+
+#include "examples/support.hh"
+
+/*
+ * Parses options for examples
+ *
+ */
+
+static const char* icl2str[] =
+  { "val", "bnd", "dom", "def" };
+
+static const char* em2str[] =
+  { "solution", "time", "stat" };
+
+static const char* bool2str[] =
+  { "false", "true" };
+
+void
+Options::parse(int argc, char** argv) {
+  using namespace std;
+  int i = 1;
+  const char* e = NULL;
+  while (i < argc) {
+    if (!strcmp(argv[i],"-help") || !strcmp(argv[i],"--help")) {
+      cerr << "Options for example " << name << ":"
+	   << endl
+	   << "\t-icl (def,val,bnd,dom) default: " << icl2str[icl]
+	   << endl
+	   << "\t\tinteger consistency level" << endl
+	   << "\t-c_d (unsigned int) default: " << c_d << endl
+	   << "\t\tcopying recomputation distance" << endl
+	   << "\t-a_d (unsigned int) default: " << a_d << endl
+	   << "\t\tadaption recomputation distance" << endl
+	   << "\t-mode (solution, time, stat) default: "
+	   << em2str[mode] << endl
+	   << "\t\twhether to print solutions, measure time, "
+	   << "or print statistics" << endl
+	   << "\t-samples (unsigned int) default: "
+	   << samples << endl
+	   << "\t\thow many samples (time-mode)" << endl
+	   << "\t-iterations (unsigned int) default: "
+	   << iterations << endl
+	   << "\t\thow many iterations per sample (time-mode)" << endl
+	   << "\t-solutions (unsigned int) default: ";
+      if (solutions == 0)
+	cerr << "all (0)";
+      else
+	cerr << solutions;
+      cerr << endl
+	   << "\t\thow many solutions to search (solution-mode)" << endl
+	   << "\t-fails (unsigned int) default: "
+	   << (fails<0 ? "(no limit) " : "") << fails << endl
+	   << "\t\tset number of allowed fails before stopping (solution-mode)"
+	   << endl
+	   << "\t-time (unsigned int) default: "
+	   << (fails<0 ? "(no limit) " : "") << time << endl
+	   << "\t\tset allowed time before stopping (solution-mode)" << endl
+	   << "\t-naive default: "
+	   << bool2str[naive] << endl
+	   << "\t\tuse naive version" << endl
+	   << "\t-smart default: "
+	   << bool2str[!naive] << endl
+	   << "\t\tuse smart version" << endl
+	   << "\t(unsigned int) default: " << size << endl
+	   << "\t\twhich version/size for example" << endl;
+      exit(EXIT_SUCCESS);
+    } else if (!strcmp(argv[i],"-icl")) {
+      if (++i == argc) goto missing;
+      if (!strcmp(argv[i],"def")) {
+	icl = ICL_DEF;
+      } else if (!strcmp(argv[i],"val")) {
+	icl = ICL_VAL;
+      } else if (!strcmp(argv[i],"bnd")) {
+	icl = ICL_BND;
+      } else if (!strcmp(argv[i],"dom")) {
+	icl = ICL_DOM;
+      } else {
+	e = "expecting: def, val, bnd, or dom";
+	goto error;
+      }
+    } else if (!strcmp(argv[i],"-c_d")) {
+      if (++i == argc) goto missing;
+      c_d = atoi(argv[i]);
+    } else if (!strcmp(argv[i],"-a_d")) {
+      if (++i == argc) goto missing;
+      a_d = atoi(argv[i]);
+    } else if (!strcmp(argv[i],"-quiet")) {
+      quiet = true;
+    } else if (!strcmp(argv[i],"-mode")) {
+      if (++i == argc) goto missing;
+      if (!strcmp(argv[i],"solution")) {
+	mode = EM_SOLUTION;
+      } else if (!strcmp(argv[i],"time")) {
+	mode = EM_TIME;
+      } else if (!strcmp(argv[i],"stat")) {
+	mode = EM_STAT;
+      } else {
+	e = "expecting: solution, time, or stat";
+	goto error;
+      }
+    } else if (!strcmp(argv[i],"-samples")) {
+      if (++i == argc) goto missing;
+      samples = atoi(argv[i]);
+    } else if (!strcmp(argv[i],"-solutions")) {
+      if (++i == argc) goto missing;
+      solutions = atoi(argv[i]);
+    } else if (!strcmp(argv[i],"-fails")) {
+      if (++i == argc) goto missing;
+      fails = atoi(argv[i]);
+    } else if (!strcmp(argv[i],"-time")) {
+      if (++i == argc) goto missing;
+      time = atoi(argv[i]);
+    } else if (!strcmp(argv[i],"-iterations")) {
+      if (++i == argc) goto missing;
+      iterations = atoi(argv[i]);
+    } else if (!strcmp(argv[i],"-naive")) {
+      naive = true;
+    } else if (!strcmp(argv[i],"-smart")) {
+      naive = false;
+    } else {
+      char* unused;
+      size = strtol(argv[i], &unused, 10);
+      if ('\0' != *unused) {
+	i++;
+	goto error;
+      }
+    }
+    i++;
+  }
+  return;
+ missing:
+  e = "missing argument";
+ error:
+  cerr << "Erroneous argument (" << argv[i-1] << ")" << endl;
+  if (e) cerr << e << endl;
+  exit(EXIT_FAILURE);
+}
+
+// STATISTICS: example-any
+

data/ext/gecode-1.3.1/examples/support.hh

@@ -0,0 +1,98 @@
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2004
+ *
+ *  Last modified:
+ *     $Date: 2006-08-04 16:06:52 +0200 (Fri, 04 Aug 2006) $ by $Author: schulte $
+ *     $Revision: 3517 $
+ *
+ *  This file is part of Gecode, the generic constraint
+ *  development environment:
+ *     http://www.gecode.org
+ *
+ *  See the file "LICENSE" for information on usage and
+ *  redistribution of this file, and for a
+ *     DISCLAIMER OF ALL WARRANTIES.
+ *
+ */
+
+#ifndef __GECODE_EXAMPLES_SUPPORT_HH__
+#define __GECODE_EXAMPLES_SUPPORT_HH__
+
+#include <iostream>
+#include <iomanip>
+
+#include <cstdlib>
+#include <cstring>
+
+#include "gecode/kernel.hh"
+#include "gecode/int.hh"
+#include "gecode/search.hh"
+
+#include "examples/timer.hh"
+
+/*
+ * Options for running the examples
+ *
+ */
+
+using namespace Gecode;
+
+/// Different modes for executing examples
+enum ExampleMode {
+  EM_SOLUTION, ///< Print solution and some statistics
+  EM_TIME,     ///< Measure average runtime
+  EM_STAT      ///< Print statistics for example
+};
+
+/// Class for options for examples
+class Options {
+public:
+  IntConLevel  icl;        ///< integer consistency level
+  unsigned int c_d;        ///< recomputation copy distance
+  unsigned int a_d;        ///< recomputation adaption distance
+  ExampleMode  mode;       ///< in which mode to run
+  bool         quiet;      ///< quiet mode
+  unsigned int samples;    ///< how many samples
+  unsigned int iterations; ///< how many iterations per sample
+  unsigned int solutions;  ///< how many solutions (0 == all)
+  int          fails;      ///< number of fails before stopping search
+  int          time;       ///< allowed time before stopping search
+  bool         naive;      ///< use naive version
+  unsigned int size;       ///< problem size/variant
+  const char*  name;       ///< name of problem
+
+  /// Initialize options for example with name \a s
+  Options(const char* s);
+  /// Parse options from arguments \a argv (number is \a argc)
+  void parse(int argc, char** argv);
+};
+
+
+/**
+ * \brief Base-class for %Gecode examples
+ *
+ * All examples must inherit from this class
+ *  - adds printing to examples
+ *  - run allows to execute examples
+ *
+ */
+class Example : public Space {
+public:
+  Example(void) {}
+  Example(bool share, Example& e) : Space(share,e) {}
+  virtual void print(void) {}
+  template <class Script, template<class> class Engine>
+  static void run(const Options&);
+private:
+  explicit Example(Example& e);
+};
+
+#include "examples/support.icc"
+
+#endif
+
+// STATISTICS: example-any

data/ext/gecode-1.3.1/examples/support.icc

@@ -0,0 +1,187 @@
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2004
+ *
+ *  Last modified:
+ *     $Date: 2006-10-25 13:51:24 +0200 (Wed, 25 Oct 2006) $ by $Author: schulte $
+ *     $Revision: 3787 $
+ *
+ *  This file is part of Gecode, the generic constraint
+ *  development environment:
+ *     http://www.gecode.org
+ *
+ *  See the file "LICENSE" for information on usage and
+ *  redistribution of this file, and for a
+ *     DISCLAIMER OF ALL WARRANTIES.
+ *
+ */
+
+inline
+Options::Options(const char* n)
+  : icl(ICL_DEF),
+    c_d(Search::Config::c_d),
+    a_d(Search::Config::a_d),
+    mode(EM_SOLUTION),
+    quiet(false),
+    samples(1),
+    iterations(1),
+    solutions(1),
+    fails(-1),
+    time(-1),
+    naive(false),
+    size(0),
+    name(n) {}
+
+namespace {
+  /// Stop opbject for controlling stoppage based on both time and
+  /// failures.
+  class FailTimeStop : public Search::Stop {
+  private:
+    Search::TimeStop *ts;
+    Search::FailStop *fs;
+    FailTimeStop(int fails, int time) {
+      ts = new Search::TimeStop(time);
+      fs = new Search::FailStop(fails);
+    }
+  public:
+    bool stop(const Search::Statistics& s) {
+      return fs->stop(s) || ts->stop(s);
+    }
+    /// Create appropriate stop-object
+    static Search::Stop* create(int fails, int time) {
+      if (fails < 0 && time < 0) return NULL;
+      if (fails < 0) return new Search::TimeStop( time);
+      if (time  < 0) return new Search::FailStop(fails);
+      return new FailTimeStop(fails, time);
+    }
+  };
+}
+
+
+template <class Script, template<class> class Engine>
+void
+Example::run(const Options& o) {
+  using namespace std;
+  try {
+    if (!o.quiet)
+      cout << o.name << endl;
+    switch (o.mode) {
+    case EM_SOLUTION:
+      {
+	Timer t;
+	int i = o.solutions;
+	t.start();
+	Script* s = new Script(o);
+	unsigned int n_p = 0;
+	unsigned int n_b = 0;
+	if (s->status() != SS_FAILED) {
+	  n_p = s->propagators();
+	  n_b = s->branchings();
+	}
+	Search::Stop* stop = FailTimeStop::create(o.fails, o.time);
+	Engine<Script> e(s,o.c_d,o.a_d,stop);
+	delete s;
+	do {
+	  Example* ex = e.next();
+	  if (ex == NULL)
+	    break;
+	  ex->print();
+	  delete ex;
+	} while (--i != 0);
+	Search::Statistics stat = e.statistics();
+	cout << endl;
+	cout << "Initial" << endl
+	     << "\tpropagators:   " << n_p << endl
+	     << "\tbranchings:    " << n_b << endl
+	     << endl
+	     << "Summary" << endl
+	     << "\truntime:       " << t.stop() << endl
+	     << "\tsolutions:     " << abs(static_cast<int>(o.solutions) - i) << endl
+	     << "\tpropagations:  " << stat.propagate << endl
+	     << "\tfailures:      " << stat.fail << endl
+	     << "\tclones:        " << stat.clone << endl
+	     << "\tcommits:       " << stat.commit << endl
+	     << "\tpeak memory:   "
+	     << static_cast<int>((stat.memory+1023) / 1024) << " KB"
+	     << endl;
+      }
+      break;
+    case EM_STAT:
+      {
+	int i = o.solutions;
+	Script* s = new Script(o);
+	unsigned int n_p = 0;
+	unsigned int n_b = 0;
+	if (s->status() != SS_FAILED) {
+	  n_p = s->propagators();
+	  n_b = s->branchings();
+	}
+	Engine<Script> e(s,o.c_d,o.a_d);
+	delete s;
+	do {
+	  Example* ex = e.next();
+	  if (ex == NULL)
+	    break;
+	  delete ex;
+	} while (--i != 0);
+	Search::Statistics stat = e.statistics();
+	cout << endl
+	     << "\tpropagators:   " << n_p << endl
+	     << "\tbranchings:    " << n_b << endl
+	     << "\tsolutions:     " << abs(static_cast<int>(o.solutions) - i) << endl
+	     << "\tpropagations:  " << stat.propagate << endl
+	     << "\tfailures:      " << stat.fail << endl
+	     << "\tclones:        " << stat.clone << endl
+	     << "\tcommits:       " << stat.commit << endl
+	     << "\tpeak memory:   "
+	     << static_cast<int>((stat.memory+1023) / 1024) << " KB"
+	     << endl;
+      }
+      break;
+    case EM_TIME:
+      {
+	Timer t;
+	GECODE_AUTOARRAY(double,ts,o.samples);
+	for (int s = o.samples; s--; ) {
+	  t.start();
+	  for (int k = o.iterations; k--; ) {
+	    unsigned int i = o.solutions;
+	    Script* s = new Script(o);
+	    Engine<Script> e(s,o.c_d,o.a_d);
+	    delete s;
+	    do {
+	      Example* ex = e.next();
+	      if (ex == NULL)
+		break;
+	      delete ex;
+	    } while (--i != 0);
+	  }
+	  ts[s] = t.stop() / o.iterations;
+	}
+	double m = am(ts,o.samples);
+	double d = dev(ts,o.samples) * 100.0;
+	if (o.quiet) {
+	  cout << showpoint << setprecision(6) << m << " "
+	       << setprecision(2) << d
+	       << endl;
+	} else {
+	  cout << "\tRuntime: "
+	       << setw(20) << right
+	       << showpoint << fixed
+	       << setprecision(6) << m << "ms"
+	       << setprecision(2) << " (" << d << "% deviation)"
+	       << endl;
+	}
+      }
+      break;
+    }
+  } catch (Exception e) {
+    cout << "Exception: " << e.what() << "." << endl
+	 << "Stopping..." << endl;
+  }
+}
+
+// STATISTICS: example-any

data/ext/gecode-1.3.1/examples/timer.cc

@@ -0,0 +1,47 @@
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2004
+ *
+ *  Last modified:
+ *     $Date: 2005-11-02 13:53:36 +0100 (Wed, 02 Nov 2005) $ by $Author: schulte $
+ *     $Revision: 2470 $
+ *
+ *  This file is part of Gecode, the generic constraint
+ *  development environment:
+ *     http://www.gecode.org
+ *
+ *  See the file "LICENSE" for information on usage and
+ *  redistribution of this file, and for a
+ *     DISCLAIMER OF ALL WARRANTIES.
+ *
+ */
+
+#include "examples/timer.hh"
+
+double
+am(double t[], int n) {
+  if (n < 1)
+    return 0.0;
+  double s = 0;
+  for (int i=n; i--; )
+    s += t[i];
+  return s / n;
+}
+
+double
+dev(double t[], int n) {
+  if (n < 2)
+    return 0.0;
+  double m = am(t,n);
+  double s = 0.0;
+  for (int i=n; i--; ) {
+    double d = t[i]-m;
+    s += d*d;
+  }
+  return sqrt(s / (n-1)) / m;
+}
+
+// STATISTICS: example-any