gecoder-with-gecode 0.7.1

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

@@ -0,0 +1,114 @@
+/*
+ *  Main authors:
+ *     Guido Tack <tack@gecode.org>
+ *     Christian Schulte <schulte@gecode.org>
+ *     Gabor Szokoli <szokoli@gecode.org>
+ *
+ *  Copyright:
+ *     Guido Tack, 2004
+ *     Christian Schulte, 2004
+ *     Gabor Szokoli, 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"
+
+namespace Gecode {
+
+  SetVarArray::SetVarArray(Space* home, int n)
+    : VarArray<SetVar>(home,n) {
+    for (int i = size(); i--; )
+      x[i].init(home);
+  }
+
+  SetVarArray::SetVarArray(Space* home,int n,
+			   int lbMin,int lbMax,int ubMin,int ubMax,
+			   unsigned int minCard,
+			   unsigned int maxCard)
+    : VarArray<SetVar>(home,n) {
+    if ((lbMin < Limits::Set::int_min) || 
+	(lbMax > Limits::Set::int_max) ||
+	(ubMin < Limits::Set::int_min) || 
+	(ubMax > Limits::Set::int_max))
+      throw Set::VariableOutOfRangeDomain("SetVarArray");
+    if (maxCard > Limits::Set::card_max)
+      throw Set::VariableOutOfRangeCardinality("SetVarArray");
+    if (minCard > maxCard)
+      throw Set::VariableFailedDomain("SetVarArray");
+    for (int i = size(); i--; )
+      x[i].init(home,lbMin,lbMax,ubMin,ubMax,minCard,maxCard);    
+  }
+
+  SetVarArray::SetVarArray(Space* home,int n,
+			   const IntSet& glb,int ubMin,int ubMax,
+			   unsigned int minCard,unsigned int maxCard)
+    : VarArray<SetVar>(home,n) {
+    if ( ((glb.size() > 0) &&
+	  ((glb.min() < Limits::Set::int_min) ||
+	   (glb.max() > Limits::Set::int_max))) ||
+	 (ubMin < Limits::Set::int_min) || 
+	 (ubMax > Limits::Set::int_max))
+      throw Set::VariableOutOfRangeDomain("SetVar");
+    if (maxCard > Limits::Set::card_max)
+      throw Set::VariableOutOfRangeCardinality("SetVarArray");
+    if (minCard > maxCard)
+      throw Set::VariableFailedDomain("SetVarArray");
+    for (int i = size(); i--; )
+      x[i].init(home,glb,ubMin,ubMax,minCard,maxCard);
+  }
+
+  SetVarArray::SetVarArray(Space* home,int n,
+			   int lbMin,int lbMax,const IntSet& lub,
+			   unsigned int minCard,unsigned int maxCard)
+    : VarArray<SetVar>(home,n) {
+    if ( ((lub.size() > 0) &&
+	  ((lub.min() < Limits::Set::int_min) ||
+	   (lub.max() > Limits::Set::int_max))) ||
+	 (lbMin < Limits::Set::int_min) || 
+	 (lbMax > Limits::Set::int_max))
+      throw Set::VariableOutOfRangeDomain("SetVarArray");
+    if (maxCard > Limits::Set::card_max)
+      throw Set::VariableOutOfRangeCardinality("SetVarArray");
+    if (minCard > maxCard)
+      throw Set::VariableFailedDomain("SetVarArray");
+    for (int i = size(); i--; )
+      x[i].init(home,lbMin,lbMax,lub,minCard,maxCard);
+  }
+
+  SetVarArray::SetVarArray(Space* home,int n,
+			   const IntSet& glb, const IntSet& lub,
+			   unsigned int minCard, unsigned int maxCard)
+    : VarArray<SetVar>(home,n) {
+    if (((glb.size() > 0) &&
+	 ((glb.min() < Limits::Set::int_min) ||
+	  (glb.max() > Limits::Set::int_max)))  ||
+	((lub.size() > 0) &&
+	 ((lub.min() < Limits::Set::int_min) ||
+	  (lub.max() > Limits::Set::int_max))))
+      throw Set::VariableOutOfRangeDomain("SetVar");
+    if (maxCard > Limits::Set::card_max)
+      throw Set::VariableOutOfRangeCardinality("SetVar");
+    for (int i = size(); i--; )
+      x[i].init(home,glb,lub,minCard,maxCard);
+    if (minCard > maxCard)
+      throw Set::VariableFailedDomain("SetVar");
+  }
+
+}
+
+// STATISTICS: set-other
+

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

@@ -0,0 +1,134 @@
+/*
+ *  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-12 15:53:12 +0200 (Wed, 12 Jul 2006) $ by $Author: tack $
+ *     $Revision: 3349 $
+ *
+ *  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 {
+
+  /**
+   * \defgroup TaskIntSetArgs Argument arrays
+   * 
+   * Argument arrays are just good enough for passing arguments
+   * with automatic memory management.
+   * \ingroup TaskIntSet
+   */
+
+  //@{
+  /// Passing set variables
+  typedef VarArgArray<SetVar>  SetVarArgs;
+  //@}
+
+  /**
+   * \defgroup TaskIntSetVarArrays Variable arrays
+   * 
+   * Variable arrays can store variables. They are typically used
+   * for storing the variables being part of a solution. However,
+   * they can also be used for temporary purposes (even though
+   * memory is not reclaimed until the space it is created for
+   * is deleted).
+   * \ingroup TaskIntSet
+   */
+
+  /**
+   * \brief %Set variable array
+   * \ingroup TaskIntSetVarArrays
+   */
+  class GECODE_SET_EXPORT SetVarArray : public VarArray<SetVar> {
+  public:
+    SetVarArray(void);
+    SetVarArray(const SetVarArray&);
+    /// Create an uninitialized array of size \a n
+    SetVarArray(Space* home,int n);
+    /**
+     * \brief Create an array of size \a n.
+     *
+     * Each variable is initialized with the bounds and cardinality as
+     * given by the arguments.
+     */
+    SetVarArray(Space* home,int n,int glbMin,int glbMax,int lubMin,int lubMax,
+		unsigned int minCard = 0,
+		unsigned int maxCard = Limits::Set::card_max);
+    /**
+     * \brief Create an array of size \a n.
+     *
+     * Each variable is initialized with the bounds and cardinality as
+     * given by the arguments.
+     */
+    SetVarArray(Space* home,int n,const IntSet& glb, int lubMin, int lubMax,
+		unsigned int minCard = 0,
+		unsigned int maxCard = Limits::Set::card_max);
+    /**
+     * \brief Create an array of size \a n.
+     *
+     * Each variable is initialized with the bounds and cardinality as
+     * given by the arguments.
+     */
+    SetVarArray(Space* home,int n,int glbMin,int glbMax,const IntSet& lub,
+		unsigned int minCard = 0,
+		unsigned int maxCard = Limits::Set::card_max);
+    /**
+     * \brief Create an array of size \a n.
+     *
+     * Each variable is initialized with the bounds and cardinality as
+     * given by the arguments.
+     */
+    SetVarArray(Space* home,int n,
+		const IntSet& glb,const IntSet& lub,
+		unsigned int minCard = 0,
+		unsigned int maxCard = Limits::Set::card_max);
+  };
+  
+  /// Traits of SetVarArray
+  template <>
+  class ArrayTraits<SetVarArray> {
+  public:
+    typedef SetVarArgs   storage_type;
+    typedef SetVar       value_type;
+    typedef SetVarArgs   args_type;
+  };
+  /// Traits of SetVarArgs
+  template <>
+  class ArrayTraits<SetVarArgs> {
+  public:
+    typedef SetVarArgs storage_type;
+    typedef SetVar     value_type;
+    typedef SetVarArgs args_type;
+  };
+
+  /*
+   * Implementation
+   *
+   */
+
+  forceinline
+  SetVarArray::SetVarArray(void) {}
+
+  forceinline
+  SetVarArray::SetVarArray(const SetVarArray& a)
+    : VarArray<SetVar>(a) {}
+
+}
+
+// STATISTICS: set-other

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

@@ -0,0 +1,57 @@
+/*
+ *  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-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/branch.hh"
+
+namespace Gecode {
+
+  using namespace Set;
+
+  void
+  branch(Space* home, const SetVarArgs& xa, SetBvarSel vars, SetBvalSel vals) {
+    if (home->failed()) return;
+    ViewArray<SetView> x(home,xa);
+    switch (vars) {
+    case SETBVAR_NONE:
+      Branch::create<Branch::ByNone>(home,x,vals); break;
+    case SETBVAR_MIN_CARD:
+      Branch::create<Branch::ByMinCard>(home,x,vals); break;
+    case SETBVAR_MAX_CARD:
+      Branch::create<Branch::ByMaxCard>(home,x,vals); break;
+    case SETBVAR_MIN_UNKNOWN_ELEM:
+      Branch::create<Branch::ByMinUnknown>(home,x,vals); break;
+    case SETBVAR_MAX_UNKNOWN_ELEM:
+      Branch::create<Branch::ByMaxUnknown>(home,x,vals); break;
+    default:
+      throw UnknownBranching("Set::branch");
+    }
+  }
+
+}
+
+// STATISTICS: set-post
+

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

@@ -0,0 +1,176 @@
+/*
+ *  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-18 15:39:20 +0200 (Tue, 18 Jul 2006) $ by $Author: schulte $
+ *     $Revision: 3390 $
+ *
+ *  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_BRANCH_HH__
+#define __GECODE_SET_BRANCH_HH__
+
+#include "gecode/set.hh"
+#include "gecode/iter.hh"
+
+/**
+ * \namespace Gecode::Set::Branch
+ * \brief %Set branchings
+ */
+
+namespace Gecode { namespace Set { namespace Branch {
+
+  /*
+   * Value selection classes
+   *
+   */
+
+
+  /**
+   * \brief Class for selecting minimum value
+   *
+   * All value selection classes require 
+   * \code #include "gecode/set/branch.hh" \endcode
+   * \ingroup FuncSetSelVal
+   */
+  class ValMin {
+  public:
+    /// Return minimum value of view \a x
+    int val(const Space* home, SetView x) const;
+    /// Tell \f$v\in x\f$ (\a a = 0) or \f$v\notin x\f$ (\a a = 1)
+    ModEvent tell(Space* home, unsigned int a, SetView x, int v);
+  };
+
+  /**
+   * \brief Class for selecting maximum value
+   *
+   * All value selection classes require 
+   * \code #include "gecode/set/branch.hh" \endcode
+   * \ingroup FuncSetSelVal
+   */
+  class ValMax {
+  public:
+    /// Return maximum value of view \a x
+    int val(const Space* home, SetView x) const;
+    /// Tell \f$v\in x\f$ (\a a = 0) or \f$v\notin x\f$ (\a a = 1)
+    ModEvent tell(Space* home, unsigned int a, SetView x, int v);
+  };
+
+  /// Create branchings for a given view selection strategy \a ViewSel
+  template <class SelView>
+  static void
+  create(Space* home, ViewArray<SetView>&, SetBvalSel);
+
+  /*
+   * View selection classes
+   *
+   */
+
+  /**
+   * \brief View selection class for first view
+   *
+   * Requires \code #include "gecode/set/branch.hh" \endcode
+   * \ingroup FuncSetSelView
+   */
+  class ByNone {
+  public:
+    /// Intialize with view \a x
+    ViewSelStatus init(const Space* home, SetView x);
+    /// Possibly select better view \a x
+    ViewSelStatus select(const Space* home, SetView x);
+  };
+
+  /**
+   * \brief View selection class for view with smallest cardinality of lub-glb
+   *
+   * Requires \code #include "gecode/set/branch.hh" \endcode
+   * \ingroup FuncSetSelView
+   */
+  class ByMinCard {
+  private:
+    /// So-far smallest cardinality
+    unsigned int minCard;
+  public:
+    /// Intialize with view \a x
+    ViewSelStatus init(const Space* home, SetView x);
+    /// Possibly select better view \a x
+    ViewSelStatus select(const Space* home, SetView x);
+  };
+
+  /**
+   * \brief View selection class for view with greatest cardinality of lub-glb
+   *
+   * Requires \code #include "gecode/set/branch.hh" \endcode
+   * \ingroup FuncSetSelView
+   */
+  class ByMaxCard {
+  private:
+    /// So-far greatest cardinality
+    unsigned int maxCard;
+  public:
+    /// Intialize with view \a x
+    ViewSelStatus init(const Space* home, SetView x);
+    /// Possibly select better view \a x
+    ViewSelStatus select(const Space* home, SetView x);
+  };
+
+  /**
+   * \brief View selection class for view with smallest element in lub-glb
+   *
+   * Requires \code #include "gecode/set/branch.hh" \endcode
+   * \ingroup FuncSetSelView
+   */
+  class ByMinUnknown {
+  private:
+    /// So-far smallest element
+    int minUnknown;
+  public:
+    /// Intialize with view \a x
+    ViewSelStatus init(const Space* home, SetView x);
+    /// Possibly select better view \a x
+    ViewSelStatus select(const Space* home, SetView x);
+  };
+
+  /**
+   * \brief View selection class for view with greatest element in lub-glb
+   *
+   * Requires \code #include "gecode/set/branch.hh" \endcode
+   * \ingroup FuncSetSelView
+   */
+  class ByMaxUnknown {
+  private:
+    /// So-far greatest element
+    int maxUnknown;
+  public:
+    /// Intialize with view \a x
+    ViewSelStatus init(const Space* home, SetView x);
+    /// Possibly select better view \a x
+    ViewSelStatus select(const Space* home, SetView x);
+  };
+
+}}}
+
+#include "gecode/set/branch/select-val.icc"
+#include "gecode/set/branch/select-view.icc"
+
+#endif
+// STATISTICS: set-branch
+