gecoder-with-gecode 0.7.1

data/ext/gecode-1.3.1/gecode/set/exception.icc

@@ -0,0 +1,132 @@
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *     Guido Tack <tack@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2004,2005
+ *     Guido Tack, 2005
+ *
+ *  Last modified:
+ *     $Date: 2006-07-07 10:08:10 +0200 (Fri, 07 Jul 2006) $ by $Author: tack $
+ *     $Revision: 3339 $
+ *
+ *  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 Set {
+
+  /**
+   * \defgroup FuncThrowSet Set exceptions
+   * \ingroup FuncThrow
+   */
+
+
+  //@{
+
+  /// %Exception: %Variable created with values too large for domain
+  class VariableOutOfRangeDomain : public Exception {
+  public:
+    /// Initialize with location \a l
+    VariableOutOfRangeDomain(const char* l);
+  };
+
+  /// %Exception: %Variable created with wrong cardinality
+  class VariableOutOfRangeCardinality : public Exception {
+  public:
+    /// Initialize with location \a l
+    VariableOutOfRangeCardinality(const char* l);
+  };
+
+  /// %Exception: %Variable created with failed domain
+  class VariableFailedDomain : public Exception {
+  public:
+    /// Initialize with location \a l
+    VariableFailedDomain(const char* l);
+  };
+
+  /// %Exception: No arguments available in argument array
+  class ArgumentEmpty : public Exception {
+  public:
+    /// Initialize with location \a l
+    ArgumentEmpty(const char* l);
+  };
+  
+  /// %Exception: Arguments are of different size
+  class ArgumentSizeMismatch : public Exception  {
+  public:
+    /// Initialize with location \a l
+    ArgumentSizeMismatch(const char* l);
+  };
+
+  /// %Exception: Invalid relation passed as argument
+  class InvalidRelation : public Exception  {
+  public:
+    /// Initialize with location \a l
+    InvalidRelation(const char* l);
+  };
+
+  /// %Exception: Invalid projector passed as argument
+  class InvalidProjector : public Exception  {
+  public:
+    /// Initialize with location \a l
+    InvalidProjector(const char* l);
+  };
+
+  /// %Exception: Unknown value or variable selection passed as argument
+  class UnknownBranching : public Exception {
+  public:
+    /// Initialize with location \a l
+    UnknownBranching(const char* l);
+  };
+
+  //@}
+
+  /**
+   * Classes for exceptions raised by set module
+   *
+   */
+
+  inline
+  VariableOutOfRangeDomain::VariableOutOfRangeDomain(const char* l)
+    : Exception(l,"Attempt to create variable with wrong values") {}
+
+  inline
+  VariableOutOfRangeCardinality::VariableOutOfRangeCardinality(const char* l)
+    : Exception(l,"Attempt to create variable with wrong cardinality") {}
+
+  inline
+  VariableFailedDomain::VariableFailedDomain(const char* l)
+    : Exception(l,"Attempt to create variable with initially failed domain") {}
+
+  inline
+  ArgumentEmpty::ArgumentEmpty(const char* l)
+    : Exception(l,"Passed argument array has no elements") {}
+
+  inline
+  ArgumentSizeMismatch::ArgumentSizeMismatch(const char* l)
+    : Exception(l,"Sizes of argument arrays mismatch") {}
+
+  inline
+  InvalidRelation::InvalidRelation(const char* l)
+    : Exception(l,"Invalid relation type") {}
+
+  inline
+  InvalidProjector::InvalidProjector(const char* l)
+    : Exception(l,"Invalid projector specification") {}
+
+  inline
+  UnknownBranching::UnknownBranching(const char* l)
+    : Exception(l,"Unknown branching type") {}
+
+}}
+
+// STATISTICS: set-other
+

data/ext/gecode-1.3.1/gecode/set/int.cc

@@ -0,0 +1,139 @@
+/*
+ *  Main authors:
+ *     Guido Tack <tack@gecode.org>
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Guido Tack, 2004
+ *     Christian Schulte, 2004
+ *
+ *  Last modified:
+ *     $Date: 2006-04-11 15:58:37 +0200 (Tue, 11 Apr 2006) $ by $Author: tack $
+ *     $Revision: 3188 $
+ *
+ *  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/set.hh"
+
+#include "gecode/set/int.hh"
+#include "gecode/set/rel.hh"
+
+using namespace Gecode::Int;
+
+namespace Gecode {
+
+  void
+  rel(Space* home, SetVar s, IntRelType r, IntVar x) {
+    if (home->failed()) return;
+    switch(r) {
+    case IRT_EQ:
+      {
+	Gecode::Int::IntView xv(x);
+	Set::SingletonView xsingle(xv);
+	GECODE_ES_FAIL(home,
+		       (Set::Rel::Eq<Set::SetView,Set::SingletonView>
+			::post(home,s,xsingle)));
+
+      }
+      break;
+    case IRT_NQ:
+      {
+	Gecode::Int::IntView xv(x);
+	Set::SingletonView xsingle(xv);
+	GECODE_ES_FAIL(home,
+		       (Set::Rel::Distinct<Set::SetView,Set::SingletonView>
+			::post(home,s,xsingle)));
+
+      }
+      break;
+    case IRT_LQ:
+      {
+	IntVar tmp(home, Limits::Int::int_min, Limits::Int::int_max);
+	rel(home, tmp, IRT_LQ, x);
+	GECODE_ES_FAIL(home,Set::Int::MaxElement::post(home,s,tmp));
+      }
+      break;
+    case IRT_LE:
+      {
+	IntVar tmp(home, Limits::Int::int_min, Limits::Int::int_max);
+	rel(home, tmp, IRT_LE, x);
+	GECODE_ES_FAIL(home,Set::Int::MaxElement::post(home,s,tmp));
+      }
+      break;
+    case IRT_GQ:
+      {
+	IntVar tmp(home, Limits::Int::int_min, Limits::Int::int_max);
+	rel(home, tmp, IRT_GQ, x);
+	GECODE_ES_FAIL(home,Set::Int::MinElement::post(home,s,tmp));
+      }
+      break;
+    case IRT_GR:
+      {
+	IntVar tmp(home, Limits::Int::int_min, Limits::Int::int_max);
+	rel(home, tmp, IRT_GR, x);
+	GECODE_ES_FAIL(home,Set::Int::MinElement::post(home,s,tmp));
+      }
+      break;
+    }
+
+  }
+
+  void
+  rel(Space* home, IntVar x, IntRelType r, SetVar s) {
+    IntRelType rr;
+    switch (r) {
+    case IRT_LE: rr=IRT_GR; break;
+    case IRT_LQ: rr=IRT_GQ; break;
+    case IRT_GR: rr=IRT_LE; break;
+    case IRT_GQ: rr=IRT_LQ; break;
+    default: rr=r;
+    }
+    rel(home, s, rr, x);
+  }
+
+  void
+  min(Space* home, SetVar s, IntVar x){
+    if (home->failed()) return;
+    GECODE_ES_FAIL(home,Set::Int::MinElement::post(home,s,x));
+  }
+  void
+  max(Space* home, SetVar s, IntVar x){
+    if (home->failed()) return;
+    GECODE_ES_FAIL(home,Set::Int::MaxElement::post(home,s,x));
+  }
+
+  void
+  match(Space* home, SetVar s, const IntVarArgs& x) {
+    if (home->failed()) return;
+    ViewArray<IntView> xa(home,x);
+    GECODE_ES_FAIL(home,Set::Int::Match::post(home,s,xa));
+  }
+
+  void
+  channel(Space* home, const IntVarArgs& x, const SetVarArgs& y) {
+    if (home->failed()) return;
+    ViewArray<Int::IntView> xa(home,x);
+    ViewArray<Set::SetView> ya(home,y);
+    GECODE_ES_FAIL(home,Set::Int::Channel::post(home,xa,ya));
+  }
+
+  void weights(Space* home, const IntArgs& elements, const IntArgs& weights,
+	       SetVar x, IntVar y) {
+    if (home->failed()) return;
+    Set::SetView xv(x);
+    Int::IntView yv(y);
+    GECODE_ES_FAIL(home,Set::Int::Weights::post(home,elements,weights,x,y));
+  }
+
+}
+
+// STATISTICS: set-post
+

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

@@ -0,0 +1,226 @@
+/*
+ *  Main authors:
+ *     Guido Tack <tack@gecode.org>
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Guido Tack, 2004
+ *     Christian Schulte, 2004
+ *
+ *  Last modified:
+ *     $Date: 2006-05-29 09:42:21 +0200 (Mon, 29 May 2006) $ by $Author: schulte $
+ *     $Revision: 3246 $
+ *
+ *  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_INT_HH__
+#define __GECODE_SET_INT_HH__
+
+#include "gecode/set.hh"
+
+namespace Gecode { namespace Set { namespace Int {
+
+  /**
+   * \namespace Gecode::Set::Int
+   * \brief Propagators connecting set and int variables
+   */
+
+  /**
+   * \brief %Propator for minimum element
+   *
+   * Requires \code #include "gecode/set/int.hh" \endcode
+   * \ingroup FuncSetProp
+   */
+  class MinElement :
+    public IntSetPropagator<SetView,PC_SET_ANY,Gecode::Int::PC_INT_BND> {
+  protected:
+    /// Constructor for cloning \a p
+    MinElement(Space* home, bool share,MinElement& p);
+    /// Constructor for posting
+    MinElement(Space* home,SetView, Gecode::Int::IntView);
+  public:
+    /// Copy propagator during cloning
+    GECODE_SET_EXPORT virtual Actor*      copy(Space* home,bool);
+    /// Perform propagation
+    GECODE_SET_EXPORT virtual ExecStatus propagate(Space* home);
+    /// Post propagator for \a x is the minimal element of \a s 
+    static ExecStatus post(Space* home,SetView s, Gecode::Int::IntView x);
+  };
+
+  /**
+   * \brief %Propator for maximum element
+   *
+   * Requires \code #include "gecode/set/int.hh" \endcode
+   * \ingroup FuncSetProp
+   */
+  class MaxElement :
+    public IntSetPropagator<SetView,PC_SET_ANY,Gecode::Int::PC_INT_BND> {
+  protected:
+    /// Constructor for cloning \a p
+    MaxElement(Space* home, bool share,MaxElement& p);
+    /// Constructor for posting
+    MaxElement(Space* home,SetView, Gecode::Int::IntView);
+  public:
+    /// Copy propagator during cloning
+    GECODE_SET_EXPORT virtual Actor*      copy(Space* home,bool);
+    /// Perform propagation
+    GECODE_SET_EXPORT virtual ExecStatus propagate(Space* home);
+    /// Post propagator for \a x is the largest element of \a s 
+    static ExecStatus post(Space* home,SetView s, Gecode::Int::IntView x);
+  };
+
+  /**
+   * \brief %Propagator for cardinality
+   *
+   * Requires \code #include "gecode/set/int.hh" \endcode
+   * \ingroup FuncSetProp
+   */
+  class Card :
+    public IntSetPropagator<SetView,PC_SET_CARD,Gecode::Int::PC_INT_BND> {
+  protected:
+    /// Constructor for cloning \a p
+    Card(Space* home, bool share,Card& p);
+    /// Constructor for posting
+    Card(Space* home,SetView, Gecode::Int::IntView);
+  public:
+    /// Copy propagator during cloning
+    GECODE_SET_EXPORT virtual Actor*      copy(Space* home,bool);
+    /// Perform propagation
+    GECODE_SET_EXPORT virtual ExecStatus propagate(Space* home);
+    /// Post propagator for \f$ |s|=x \f$ 
+    static ExecStatus post(Space* home,SetView s, Gecode::Int::IntView x);
+  };
+
+
+  /**
+   * \brief %Propagator for the match constraint
+   *
+   * Requires \code #include "gecode/set/int.hh" \endcode
+   * \ingroup FuncSetProp
+   */
+  class Match : public Propagator {
+  protected:
+    /// SetView for the match
+    SetView x0;
+    /// IntViews that together form the set \a x0
+    ViewArray< Gecode::Int::IntView > xs;
+
+    /// Constructor for cloning \a p
+    Match(Space* home, bool share,Match& p);
+    /// Constructor for posting
+    Match(Space* home,SetView, ViewArray< Gecode::Int::IntView >&);
+  public:
+    /// Copy propagator during cloning
+    GECODE_SET_EXPORT virtual Actor*   copy(Space* home,bool);
+    /// Cost function (defined as PC_LINEAR_LO)
+    GECODE_SET_EXPORT virtual PropCost cost(void) const;
+    /// Delete Propagator
+    GECODE_SET_EXPORT virtual size_t dispose(Space* home);
+    /// Perform propagation
+    GECODE_SET_EXPORT virtual ExecStatus propagate(Space* home);
+    /// Post propagator that propagates that \a s contains the \f$x_i\f$, which are sorted in non-descending order 
+    static ExecStatus post(Space* home,SetView s,
+			   ViewArray< Gecode::Int::IntView >& x);
+  };
+
+  /**
+   * \brief %Propagator for channelling between variable-value-dual models
+   *
+   * Implements channelling constraints between IntVars and SetVars.
+   * For IntVars \f$x_0,\dots,x_n\f$ and SetVars \f$y_0,\dots,y_m\f$ it
+   * propagates the constraint \f$x_i=j \Leftrightarrow i\in y_j\f$.
+   *
+   * Can be used to implement the "channelling constraints" for disjoint with
+   * cardinalities from
+   *   "Disjoint, Partition and Intersection Constraints for
+   *    Set and Multiset Variables"
+   *    Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Toby Walsh
+   *    CP 2004
+   *
+   * Requires \code #include "gecode/set/int.hh" \endcode
+   * \ingroup FuncSetProp
+   */
+  class Channel : public Propagator {
+  protected:
+    /// IntViews, \f$x_i\f$ reflects which set contains element \f$i\f$
+    ViewArray< Gecode::Int::IntView > xs;
+    /// SetViews that are constrained to be disjoint
+    ViewArray< SetView > ys;
+
+    /// Constructor for cloning \a p
+    Channel(Space* home, bool share,Channel& p);
+    /// Constructor for posting
+    Channel(Space* home,ViewArray< Gecode::Int::IntView >&,
+	    ViewArray< SetView >&);
+  public:
+    /// Copy propagator during cloning
+    GECODE_SET_EXPORT virtual Actor*   copy(Space* home,bool);
+    /// Cost function (defined as PC_QUADRATIC_LO)
+    GECODE_SET_EXPORT virtual PropCost cost(void) const;
+    /// Delete propagator and return its size
+    GECODE_SET_EXPORT virtual size_t dispose(Space* home);
+    /// Perform propagation
+    GECODE_SET_EXPORT virtual ExecStatus propagate(Space* home);
+    /// Post propagator for \f$x_i=j \Leftrightarrow i\in y_j\f$
+    static ExecStatus post(Space* home,ViewArray< Gecode::Int::IntView >& x,
+                           ViewArray< SetView >& y);
+  };
+
+  /**
+   * \brief %Propagator for weight of a set
+   *
+   * Requires \code #include "gecode/set/int.hh" \endcode
+   * \ingroup FuncSetProp
+   */
+  class Weights : public Propagator {
+  protected:
+    /// List of elements in the upper bound
+    Support::SharedArray<int> elements;
+    /// Weights for the elements in the upper bound
+    Support::SharedArray<int> weights;
+
+    /// The set view
+    SetView x;
+    /// The integer view
+    Gecode::Int::IntView y;
+
+    /// Constructor for cloning \a p
+    Weights(Space* home, bool share,Weights& p);
+    /// Constructor for posting
+    Weights(Space* home, const IntArgs&, const IntArgs&,
+	    SetView, Gecode::Int::IntView);
+  public:
+    /// Copy propagator during cloning
+    GECODE_SET_EXPORT virtual Actor*   copy(Space* home,bool);
+    /// Cost function (defined as PC_LINEAR_LO)
+    GECODE_SET_EXPORT virtual PropCost cost(void) const;
+    /// Delete propagator and return its size
+    GECODE_SET_EXPORT virtual size_t dispose(Space* home);
+    /// Perform propagation
+    GECODE_SET_EXPORT virtual ExecStatus propagate(Space* home);
+    /// Post propagator for \f$\sum_{i\in x} weights_i = y \f$
+    static ExecStatus post(Space* home,
+			   const IntArgs& elements, const IntArgs& weights,
+			   SetView x, Gecode::Int::IntView y);
+  };
+
+}}}
+
+#include "gecode/set/int/minmax.icc"
+#include "gecode/set/int/card.icc"
+#include "gecode/set/int/match.icc"
+#include "gecode/set/int/channel.icc"
+#include "gecode/set/int/weights.icc"
+
+#endif
+
+// STATISTICS: set-prop
+