gecoder-with-gecode 0.7.1 → 0.8.0

data/ext/gecode-1.3.1/gecode/search/restart.icc

@@ -1,76 +0,0 @@
-/*
- *  Main authors:
- *     Christian Schulte <schulte@gecode.org>
- *
- *  Copyright:
- *     Christian Schulte, 2004
- *
- *  Last modified:
- *     $Date: 2006-03-31 10:27:07 +0200 (Fri, 31 Mar 2006) $ by $Author: schulte $
- *     $Revision: 3142 $
- *
- *  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.
- *
- */
-
-namespace Gecode {
-
-  /*
-   * Control for restart best solution search engine
-   *
-   */
-
-  template <class T>
-  Restart<T>::Restart(T* s, unsigned int c_d, unsigned int a_d,
-		      Search::Stop* st) :
-    Gecode::DFS<T>(s,c_d,a_d,st), root(s->clone()), best(NULL) {}
-
-  template <class T>
-  forceinline
-  Restart<T>::~Restart(void) {
-    delete best;
-    delete root;
-  }
-
-  template <class T>
-  forceinline T*
-  Restart<T>::next(void) {
-    if (best != NULL) {
-      static_cast<T*>(root)->constrain(static_cast<T*>(best));
-      this->e.clone++;
-      this->e.reset(root->clone(true,this->e.propagate));
-    }
-    Space* b = this->e.explore();
-    delete best;
-    best = (b != NULL) ? b->clone() : NULL;
-    return static_cast<T*>(b);
-  }
-
-
-
-
-  /*
-   * Restart convenience
-   *
-   */
-
-  template <class T>
-  T*
-  restart(T* s, unsigned int c_d, unsigned int a_d, Search::Stop* st) {
-    Restart<T> b(s,c_d,a_d,st);
-    T* l = NULL;
-    while (T* n = b.next()) {
-      delete l; l = n;
-    }
-    return l;
-  }
-
-}
-
-// STATISTICS: search-any

data/ext/gecode-1.3.1/gecode/search/statistics.icc

@@ -1,30 +0,0 @@
-/*
- *  Main authors:
- *     Christian Schulte <schulte@gecode.org>
- *
- *  Copyright:
- *     Christian Schulte, 2004
- *
- *  Last modified:
- *     $Date: 2006-03-30 19:42:28 +0200 (Thu, 30 Mar 2006) $ by $Author: schulte $
- *     $Revision: 3141 $
- *
- *  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.
- *
- */
-
-namespace Gecode { namespace Search {
-
-  forceinline
-  Statistics::Statistics(void)
-    : propagate(0), fail(0), clone(0), commit(0), memory(0) {}
-
-}}
-
-// STATISTICS: search-any

data/ext/gecode-1.3.1/gecode/search/stop.cc

@@ -1,58 +0,0 @@
-/*
- *  Main authors:
- *     Christian Schulte <schulte@gecode.org>
- *
- *  Copyright:
- *     Christian Schulte, 2006
- *
- *  Last modified:
- *     $Date: 2006-08-04 16:03:17 +0200 (Fri, 04 Aug 2006) $ by $Author: schulte $
- *     $Revision: 3511 $
- *
- *  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 "gecode/search.hh"
-
-namespace Gecode { namespace Search {
-
-  /*
-   * Stopping for memory limit
-   *
-   */
-  bool
-  MemoryStop::stop(const Statistics& s) {
-    return s.memory > l;
-  }
-
-
-  /*
-   * Stopping for memory limit
-   *
-   */
-  bool
-  FailStop::stop(const Statistics& s) {
-    return s.fail > l;
-  }
-
-
-  /*
-   * Stopping for memory limit
-   *
-   */
-  bool
-  TimeStop::stop(const Statistics&) {
-    return static_cast<unsigned long int>
-      ((static_cast<double>(clock()-s)/CLOCKS_PER_SEC) * 1000.0) > l;
-  }
-
-}}
-
-// STATISTICS: search-any

data/ext/gecode-1.3.1/gecode/search/stop.icc

@@ -1,100 +0,0 @@
-/*
- *  Main authors:
- *     Christian Schulte <schulte@gecode.org>
- *
- *  Copyright:
- *     Christian Schulte, 2006
- *
- *  Last modified:
- *     $Date: 2006-08-04 16:03:17 +0200 (Fri, 04 Aug 2006) $ by $Author: schulte $
- *     $Revision: 3511 $
- *
- *  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.
- *
- */
-
-namespace Gecode { namespace Search {
-
-  /*
-   * Base class
-   *
-   */
-  forceinline
-  Stop::Stop(void) {}
-
-  forceinline
-  Stop::~Stop(void) {}
-
-
-
-  /*
-   * Stopping for memory limit
-   *
-   */
-
-  forceinline
-  MemoryStop::MemoryStop(size_t l0) : l(l0) {}
-
-  forceinline size_t
-  MemoryStop::limit(void) const {
-    return l;
-  }
-
-  forceinline void
-  MemoryStop::limit(size_t l0) {
-    l=l0;
-  }
-
-
-  /*
-   * Stopping for memory limit
-   *
-   */
-
-  forceinline
-  FailStop::FailStop(unsigned long int l0) : l(l0) {}
-
-  forceinline unsigned long int
-  FailStop::limit(void) const {
-    return l;
-  }
-
-  forceinline void
-  FailStop::limit(unsigned long int l0) {
-    l=l0;
-  }
-
-
-  /*
-   * Stopping for memory limit
-   *
-   */
-
-  forceinline
-  TimeStop::TimeStop(unsigned long int l0)
-    : s(clock()), l(l0) {}
-
-  forceinline unsigned long int
-  TimeStop::limit(void) const {
-    return l;
-  }
-
-  forceinline void
-  TimeStop::limit(unsigned long int l0) {
-    l=l0;
-  }
-
-  forceinline void
-  TimeStop::reset(void) {
-    s=clock();
-  }
-
-}}
-
-// STATISTICS: search-any

data/ext/gecode-1.3.1/gecode/set.hh

@@ -1,419 +0,0 @@
-/*
- *  Main authors:
- *     Guido Tack <tack@gecode.org>
- *     Christian Schulte <schulte@gecode.org>
- *
- *  Contributing authors:
- *     Gabor Szokoli <szokoli@gecode.org>
- *
- *  Copyright:
- *     Guido Tack, 2004
- *     Christian Schulte, 2004
- *     Gabor Szokoli, 2004
- *
- *  Last modified:
- *     $Date: 2006-07-28 16:27:48 +0200 (Fri, 28 Jul 2006) $ by $Author: tack $
- *     $Revision: 3477 $
- *
- *  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_SET_HH__
-#define __GECODE_SET_HH__
-
-namespace Gecode { namespace Set {
-  /** 
-   * \namespace Gecode::Set
-   * \brief Finite integer sets
-   * 
-   * The Gecode::Set namespace contains all functionality required
-   * to program propagators and branchings for finite integer sets.
-   * In addition, all propagators and branchings for finite integer
-   * sets provided by %Gecode are contained as nested namespaces.
-   *
-   */
-}}
-
-#include "gecode/limits.hh"
-
-#include "gecode/kernel.hh"
-#include "gecode/int.hh"
-
-/*
- * Support for DLLs under Windows
- *
- */
-
-#if !defined(GECODE_STATIC_LIBS) && \
-    (defined(__CYGWIN__) || defined(__MINGW32__) || defined(_MSC_VER))
-
-#ifdef GECODE_BUILD_SET
-#define GECODE_SET_EXPORT __declspec( dllexport )
-#else
-#define GECODE_SET_EXPORT __declspec( dllimport )
-#endif
-
-#else
-
-#ifdef GCC_HASCLASSVISIBILITY
-
-#define GECODE_SET_EXPORT __attribute__ ((visibility("default")))
-
-#else
-
-#define GECODE_SET_EXPORT
-
-#endif
-#endif
-
-#include "gecode/set/exception.icc"
-#include "gecode/set/var.icc"
-#include "gecode/set/view.icc"
-#include "gecode/set/propagator.icc"
-#include "gecode/set/array.icc"
-
-namespace Gecode {
-
-  /**
-   * \brief Common relation types for sets
-   * \ingroup TaskIntSet
-   */
-  enum SetRelType {
-    SRT_EQ,   ///< Equality (\f$=\f$)
-    SRT_NQ,   ///< Disequality (\f$\neq\f$)
-    SRT_SUB,  ///< Subset (\f$\subseteq\f$)
-    SRT_SUP,  ///< Superset (\f$\supseteq\f$)
-    SRT_DISJ, ///< Disjoint (\f$\parallel\f$)
-    SRT_CMPL  ///< Complement
-  };
-
-  /**
-   * \brief Common operations for sets
-   * \ingroup TaskIntSet
-   */
-  enum SetOpType {
-    SOT_UNION,  ///< Union
-    SOT_DUNION, ///< Disjoint union
-    SOT_INTER,  ///< %Intersection
-    SOT_MINUS   ///< Difference
-  };
-
-  /**
-   * \defgroup TaskIntSetDom Domain constraints
-   * \ingroup TaskIntSet
-   *
-   */
-
-  //@{
-
-  /// Propagates \f$ x \sim_r \{i\}\f$
-  GECODE_SET_EXPORT void
-  dom(Space* home, SetVar x, SetRelType r, int i);
-
-  /// Propagates \f$ x \sim_r \{i,\dots,j\}\f$
-  GECODE_SET_EXPORT void
-  dom(Space* home, SetVar x, SetRelType r, int i, int j);
-
-  /// Propagates \f$ x \sim_r s\f$
-  GECODE_SET_EXPORT void
-  dom(Space* home, SetVar x, SetRelType r, const IntSet& s);
-
-  /// Post propagator for \f$ (x \sim_r \{i\}) \Leftrightarrow b \f$
-  GECODE_SET_EXPORT void
-  dom(Space* home, SetVar x, SetRelType r, int i, BoolVar b);
-
-  /// Post propagator for \f$ (x \sim_r \{i,\dots,j\}) \Leftrightarrow b \f$
-  GECODE_SET_EXPORT void
-  dom(Space* home, SetVar x, SetRelType r, int i, int j, BoolVar b);
-
-  /// Post propagator for \f$ (x \sim_r s) \Leftrightarrow b \f$
-  GECODE_SET_EXPORT void
-  dom(Space* home, SetVar x, SetRelType r, const IntSet& s, BoolVar b);
-
-  /// Propagates \f$ i \leq |s| \leq j \f$
-  GECODE_SET_EXPORT void
-  cardinality(Space* home, SetVar x, unsigned int i, unsigned int j);
-
-  //@}
-
-
-  /**
-   * \defgroup TaskIntSetRel Relation constraints
-   * \ingroup TaskIntSet
-   *
-   */
-
-  //@{
-
-  /// Post propagator for \f$ x \sim_r y\f$
-  GECODE_SET_EXPORT void
-  rel(Space* home, SetVar x, SetRelType r, SetVar y);
-
-  /// Post propagator for \f$ (x \sim_r y) \Leftrightarrow b \f$
-  GECODE_SET_EXPORT void
-  rel(Space* home, SetVar x, SetRelType r, SetVar y, BoolVar b);
-  
-  /// Post propagator for \f$ s \sim_r \{x\}\f$
-  GECODE_SET_EXPORT void
-  rel(Space* home, SetVar s, SetRelType r, IntVar x);
-
-  /// Post propagator for \f$ \{x\} \sim_r s\f$
-  GECODE_SET_EXPORT void
-  rel(Space* home, IntVar x, SetRelType r, SetVar s);
-
-  /// Post propagator for \f$ (s \sim_r \{x\}) \Leftrightarrow b \f$
-  GECODE_SET_EXPORT void
-  rel(Space* home, SetVar s, SetRelType r, IntVar x, BoolVar b);
-
-  /// Post propagator for \f$ (\{x\} \sim_r s) \Leftrightarrow b \f$
-  GECODE_SET_EXPORT void
-  rel(Space* home, IntVar x, SetRelType r, SetVar s, BoolVar b);
-
-  /// Post propagator for \f$\forall i\in s:\ i \sim_r x\f$
-  GECODE_SET_EXPORT void
-  rel(Space* home, SetVar s, IntRelType r, IntVar x);
-
-  /// Post propagator for \f$\forall i\in s:\ x \sim_r i\f$
-  GECODE_SET_EXPORT void
-  rel(Space* home, IntVar x, IntRelType r, SetVar s);
-
-  //@}
-
-  /**
-   * \defgroup TaskIntSetRelOp Set operation/relation constraints
-   * \ingroup TaskIntSet
-   *
-   */
-
-  //@{
-
-  /// Post propagator for \f$ (x \diamond_{\mathit{op}} y) \sim_r z \f$
-  GECODE_SET_EXPORT void
-  rel(Space* home, SetVar x, SetOpType op, SetVar y, SetRelType r, SetVar z);
-
-  /// Post propagator for \f$ y = \diamond_{\mathit{op}} x\f$
-  GECODE_SET_EXPORT void
-  rel(Space* home, SetOpType op, const SetVarArgs& x, SetVar y);
-
-  /// Post propagator for \f$ y = \diamond_{\mathit{op}} x\f$
-  GECODE_SET_EXPORT void
-  rel(Space* home, SetOpType op, const IntVarArgs& x, SetVar y);
-
-  /// Post propagator for \f$ (x \diamond_{\mathit{op}} y) \sim_r z \f$
-  GECODE_SET_EXPORT void
-  rel(Space* home, const IntSet& x, SetOpType op, SetVar y,
-      SetRelType r, SetVar z);
-
-  /// Post propagator for \f$ (x \diamond_{\mathit{op}} y) \sim_r z \f$
-  GECODE_SET_EXPORT void
-  rel(Space* home, SetVar x, SetOpType op, const IntSet& y,
-      SetRelType r, SetVar z);
-
-  /// Post propagator for \f$ (x \diamond_{\mathit{op}} y) \sim_r z \f$
-  GECODE_SET_EXPORT void
-  rel(Space* home, SetVar x, SetOpType op, SetVar y,
-      SetRelType r, const IntSet& z);
-
-  /// Post propagator for \f$ (x \diamond_{\mathit{op}} y) \sim_r z \f$
-  GECODE_SET_EXPORT void
-  rel(Space* home, const IntSet& x, SetOpType op, const IntSet& y,
-      SetRelType r, SetVar z);
-
-  /// Post propagator for \f$ (x \diamond_{\mathit{op}} y) \sim_r z \f$
-  GECODE_SET_EXPORT void
-  rel(Space* home, const IntSet& x, SetOpType op, SetVar y, SetRelType r,
-      const IntSet& z);
-
-  /// Post propagator for \f$ (x \diamond_{\mathit{op}} y) \sim_r z \f$
-  GECODE_SET_EXPORT void
-  rel(Space* home, SetVar x, SetOpType op, const IntSet& y, SetRelType r,
-      const IntSet& z);
-
-  //@}
-
-
-  /**
-   * \defgroup TaskIntSetConvex Convexity constraints
-   * \ingroup TaskIntSet
-   *
-   */
-  //@{
-
-  /// Post propagator that propagates that \a x is convex 
-  GECODE_SET_EXPORT void
-  convex(Space* home, SetVar x);
-
-  /// Post propagator that propagates that \a y is the convex hull of \a x
-  GECODE_SET_EXPORT void
-  convexHull(Space* home, SetVar x, SetVar y);
-
-  //@}
-
-  /**
-   * \defgroup TaskIntSetSequence Sequence constraints
-   * \ingroup TaskIntSet
-   *
-   */
-  //@{
-
-  /// Post propagator for \f$\forall 0\leq i< |x|-1 : \max(x_i)<\min(x_{i+1})\f$
-  GECODE_SET_EXPORT void
-  sequence(Space* home, const SetVarArgs& x);
-
-  /// Post propagator for \f$\forall 0\leq i< |x|-1 : \max(x_i)<\min(x_{i+1})\f$ and \f$ x = \bigcup_{i\in\{0,\dots,n-1\}} y_i \f$ 
-  GECODE_SET_EXPORT void
-  sequentialUnion(Space* home, const SetVarArgs& y, SetVar x);
-
-  //@}
-
-  /**
-   * \defgroup TaskIntSetDistinct Distinctness constraints
-   * \ingroup TaskIntSet
-   *
-   */
-  //@{
-
-
-  /// Post propagator for \f$\forall 0\leq i\leq |x| : |x_i|=c\f$ and \f$\forall 0\leq i<j\leq |x| : |x_i\cap x_j|\leq 1\f$
-  GECODE_SET_EXPORT void
-  atmostOne(Space* home, const SetVarArgs& x, unsigned int c);
-
-  /// Post propagator for \f$\forall 0\leq i\leq |x| : |x_i|=c\f$ and \f$\forall 0\leq i<j\leq |x| : x_i\neq x_j\f$
-  GECODE_SET_EXPORT void
-  distinct(Space* home, const SetVarArgs& x, unsigned int c);
-
-  //@}
-
-  /**
-   * \defgroup TaskIntSetConnect Connection constraints to finite domain variables
-   * \ingroup TaskIntSet
-   *
-   */
-
-  //@{
-
-  /// Post propagator that propagates that \a x is the minimal element of \a s 
-  GECODE_SET_EXPORT void
-  min(Space* home, SetVar s, IntVar x);
-  
-  /// Post propagator that propagates that \a x is the maximal element of \a s 
-  GECODE_SET_EXPORT void
-  max(Space* home, SetVar s, IntVar x);
-  
-  /// Post propagator that propagates that \a s contains the \f$x_i\f$, which are sorted in non-descending order 
-  GECODE_SET_EXPORT void
-  match(Space* home, SetVar s, const IntVarArgs& x);
-  
-  /// Post propagator for \f$x_i=j \Leftrightarrow i\in y_j\f$
-  GECODE_SET_EXPORT void
-  channel(Space* home, const IntVarArgs& x,const SetVarArgs& y);
-  
-  /// Post propagator for \f$ |s|=x \f$ 
-  GECODE_SET_EXPORT void
-  cardinality(Space* home, SetVar s, IntVar x);
-
-
-  /**
-   * \brief Post propagator for \f$y = \mathrm{weight}(x)\f$
-   *
-   * The weights are given as pairs of elements and their weight:
-   * \f$\mathrm{weight}(\mathrm{elements}_i) = \mathrm{weights}_i\f$
-   *
-   * The upper bound of \a x is constrained to contain only elements from
-   * \a elements. The weight of a set is the sum of the weights of its
-   * elements.
-   */
-  GECODE_SET_EXPORT void
-  weights(Space* home, const IntArgs& elements, const IntArgs& weights,
-	  SetVar x, IntVar y);
-
-  //@}
-
-  /**
-   * \defgroup TaskIntSetSelection Selection constraints
-   * \ingroup TaskIntSet
-   *
-   * A selection constraint selects zero, one or more elements out of a 
-   * sequence. We write \f$ \langle x_0,\dots, x_{n-1} \rangle \f$ for the
-   * sequence, and \f$ [y] \f$ for the selector variable.
-   *
-   * Set selection constraints are closely related to the ::element constraint
-   * on finite domain variables.
-   */
-
-  //@{
-
-  /**
-   * \brief Post propagator for \f$ z=\bigcup\langle x_0,\dots,x_{n-1}\rangle[y] \f$
-   * If \a y is the empty set, \a z will also be constrained to be empty
-   * (as an empty union is empty).
-   */
-  GECODE_SET_EXPORT void
-  selectUnion(Space* home, const SetVarArgs& x, SetVar y, SetVar z);
-
-  /** Post propagator for \f$ z=\bigcap\langle x_0,\dots,x_{n-1}\rangle[y] \f$ using \f$ \mathcal{U} \f$ as universe
-   *
-   * If \a y is empty, \a z will be constrained to be the universe
-   * \f$ \mathcal{U} \f$ (as an empty intersection is the universe).
-   */
-  GECODE_SET_EXPORT void
-  selectInter(Space* home, const SetVarArgs& x, SetVar y, SetVar z);
-
-  /** Post propagator for \f$ z=\bigcap\langle x_0,\dots,x_{n-1}\rangle[y] \f$ using \a u as universe
-   *
-   * If \a y is empty, \a z will be constrained to be the given universe
-   * \a u (as an empty intersection is the universe).
-   */
-  GECODE_SET_EXPORT void
-  selectInterIn(Space* home, const SetVarArgs& x, SetVar y, SetVar z,
-		const IntSet& u);
-
-  /// Post propagator for \f$ \parallel\langle x_0,\dots,x_{n-1}\rangle[y] \f$ 
-  GECODE_SET_EXPORT void
-  selectDisjoint(Space* home, const SetVarArgs& x, SetVar y);
-
-  /// Post propagator for \f$ z=\langle x_0,\dots,x_{n-1}\rangle[y] \f$ 
-  GECODE_SET_EXPORT void
-  selectSet(Space* home, const SetVarArgs& x, IntVar y, SetVar z);
-
-  //@}
-
-  /**
-   * \defgroup TaskIntSetBranch Branching
-   * \ingroup TaskIntSet
-   */
-
-  //@{
-  
-  /// Which variable to select for branching
-  enum SetBvarSel {
-    SETBVAR_NONE,               ///< First unassigned
-    SETBVAR_MIN_CARD,           ///< With smallest unknown set
-    SETBVAR_MAX_CARD,           ///< With largest unknown set
-    SETBVAR_MIN_UNKNOWN_ELEM,   ///< With smallest unknown element
-    SETBVAR_MAX_UNKNOWN_ELEM,   ///< With largest unknown element
-  };
-  
-  /// Which values to select first for branching
-  enum SetBvalSel {
-    SETBVAL_MIN,                ///< Select smallest value in unknown set
-    SETBVAL_MAX,                ///< Select largest value in unknown set
-  };
-
-  /// Branch over all \a x with variable selection \a vars and value selection \a vals
-  GECODE_SET_EXPORT void
-  branch(Space* home, const SetVarArgs& x, SetBvarSel vars, SetBvalSel vals);
-  //@}
-
-}
-
-#endif
-
-// STATISTICS: set-post