gecoder-with-gecode 0.7.1 → 0.8.0

data/ext/gecode-1.3.1/gecode/set/rel-op.cc

@@ -1,96 +0,0 @@
-/*
- *  Main authors:
- *     Guido Tack <tack@gecode.org>
- *
- *  Contributing authors:
- *     Gabor Szokoli <szokoli@gecode.org>
- *
- *  Copyright:
- *     Guido Tack, 2004, 2005
- *
- *  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/iter.hh"
-#include "gecode/set/rel.hh"
-#include "gecode/set/rel-op.hh"
-
-namespace Gecode {
-  using namespace Gecode::Set;
-  using namespace Gecode::Set::Rel;
-  using namespace Gecode::Set::RelOp;
-
-  void
-  rel(Space* home, SetVar x, SetOpType op, SetVar y, SetRelType r, SetVar z) {
-    rel_op_post<SetView,SetView,SetView>(home, x, op, y, r, z);
-  }
-
-  void
-  rel(Space* home, SetOpType op, const SetVarArgs& x, SetVar y) {
-    if (home->failed()) return;
-    ViewArray<SetView> xa(home,x);
-    switch(op) {
-    case SOT_UNION:
-      GECODE_ES_FAIL(home,(RelOp::UnionN<SetView,SetView>::post(home, xa, y)));
-      break;
-    case SOT_DUNION:
-      GECODE_ES_FAIL(home,
-		     (RelOp::PartitionN<SetView,SetView>::post(home, xa, y)));
-      break;
-    case SOT_INTER:
-      {
-	GECODE_ES_FAIL(home,
-		       (RelOp::IntersectionN<SetView,SetView>
-			::post(home, xa, y)));
-      }
-      break;
-    case SOT_MINUS:
-      throw InvalidRelation("rel minus");
-      break;
-    }
-  }
-
-  void
-  rel(Space* home, SetOpType op, const IntVarArgs& x, SetVar y) {
-    if (home->failed()) return;
-    ViewArray<SingletonView> xa(home,x.size());
-    for (int i=x.size(); i--;) {
-      Int::IntView iv(x[i]);
-      SingletonView sv(iv);
-      xa[i] = sv;
-    }
-      
-    switch(op) {
-    case SOT_UNION:
-      GECODE_ES_FAIL(home,(RelOp::UnionN<SingletonView,SetView>
-			   ::post(home, xa, y)));
-      break;
-    case SOT_DUNION:
-      GECODE_ES_FAIL(home,(RelOp::PartitionN<SingletonView,SetView>
-			   ::post(home, xa, y)));
-      break;
-    case SOT_INTER:
-      GECODE_ES_FAIL(home,
-		     (RelOp::IntersectionN<SingletonView,SetView>
-		      ::post(home, xa, y)));
-      break;
-    case SOT_MINUS:
-      throw InvalidRelation("rel minus");
-      break;
-    }
-  }
-}
-
-// STATISTICS: set-post

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

@@ -1,267 +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-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.
- *
- */
-
-#ifndef __GECODE_SET_RELOP_HH__
-#define __GECODE_SET_RELOP_HH__
-
-#include "gecode/set.hh"
-#include "gecode/iter.hh"
-#include "gecode/set/rel.hh"
-
-namespace Gecode { namespace Set { namespace RelOp {
-
-  /**
-   * \namespace Gecode::Set::RelOp
-   * \brief Standard set operation propagators
-   */
-
-   /**
-    * \brief %Propagator for the superset of intersection
-    *
-    * Requires \code #include "gecode/set/rel-op.hh" \endcode
-    * \ingroup FuncSetProp
-    */
-  
-   template <class View0, class View1, class View2>
-   class SuperOfInter :
-    public InhomTernaryPropagator<View0,PC_SET_ANY,View1,PC_SET_ANY,
-				  View2,PC_SET_CLUB> {
-   protected:
-     using InhomTernaryPropagator<View0,PC_SET_ANY,View1,PC_SET_ANY,
-				  View2,PC_SET_CLUB>::x0;
-     using InhomTernaryPropagator<View0,PC_SET_ANY,View1,PC_SET_ANY,
-				  View2,PC_SET_CLUB>::x1;
-     using InhomTernaryPropagator<View0,PC_SET_ANY,View1,PC_SET_ANY,
-				  View2,PC_SET_CLUB>::x2;
-     /// Constructor for cloning \a p
-     SuperOfInter(Space* home, bool share,SuperOfInter& p);
-     /// Constructor for posting
-     SuperOfInter(Space* home,View0, View1, View2);
-   public:
-     /// Copy propagator during cloning
-     virtual Actor*      copy(Space* home,bool);
-     /// Perform propagation
-     virtual ExecStatus  propagate(Space* home);
-     /// Post propagator \f$ z \supseteq x \cap y\f$ 
-     static  ExecStatus  post(Space* home, View0 x, View1 y, View2 z);
-   };
-
-  /**
-   * \brief %Propagator for the subset of union
-   *
-   * Requires \code #include "gecode/set/rel-op.hh" \endcode
-   * \ingroup FuncSetProp
-   */
-  template <class View0, class View1, class View2>
-  class SubOfUnion :
-    public InhomTernaryPropagator<View0,PC_SET_ANY,View1,PC_SET_ANY,
-				  View2,PC_SET_ANY> {
-  protected:
-    using InhomTernaryPropagator<View0,PC_SET_ANY,View1,PC_SET_ANY,
-				 View2,PC_SET_ANY>::x0;
-    using InhomTernaryPropagator<View0,PC_SET_ANY,View1,PC_SET_ANY,
-				 View2,PC_SET_ANY>::x1;
-    using InhomTernaryPropagator<View0,PC_SET_ANY,View1,PC_SET_ANY,
-				 View2,PC_SET_ANY>::x2;
-    /// Constructor for cloning \a p
-    SubOfUnion(Space* home, bool share,SubOfUnion& p);
-    /// Constructor for posting
-    SubOfUnion(Space* home,View0, View1, View2);
-  public:
-    /// Copy propagator during cloning
-    virtual Actor*      copy(Space* home,bool);
-    /// Perform propagation
-    virtual ExecStatus  propagate(Space* home);
-    /// Post propagator \f$ z \subseteq x \cap y\f$ 
-    static  ExecStatus  post(Space* home,View0 x,View1 y,View2 z);
-  };
-
-
-   /**
-    * \brief %Propagator for ternary intersection
-    *
-    * Requires \code #include "gecode/set/rel-op.hh" \endcode
-    * \ingroup FuncSetProp
-    */
-   template <class View0, class View1, class View2>
-   class Intersection:
-    public InhomTernaryPropagator<View0,PC_SET_ANY,View1,PC_SET_ANY,
-				  View2,PC_SET_ANY> {
-   protected:
-     using InhomTernaryPropagator<View0,PC_SET_ANY,View1,PC_SET_ANY,
-				  View2,PC_SET_ANY>::x0;
-     using InhomTernaryPropagator<View0,PC_SET_ANY,View1,PC_SET_ANY,
-				  View2,PC_SET_ANY>::x1;
-     using InhomTernaryPropagator<View0,PC_SET_ANY,View1,PC_SET_ANY,
-				  View2,PC_SET_ANY>::x2;
-     /// Constructor for cloning \a p
-     Intersection(Space* home, bool share,Intersection& p);
-     /// Constructor for posting
-     Intersection(Space* home,View0,View1,View2);
-   public:
-     /// Copy propagator during cloning
-     virtual Actor*      copy(Space* home,bool);
-     /// Perform propagation
-     virtual ExecStatus  propagate(Space* home);
-     /// Post propagator \f$ z=x\cap y\f$ 
-     static  ExecStatus  post(Space* home,View0 x,View1 y,View2 z);
-   };
-
-  /**
-   * \brief %Propagator for ternary union
-   *
-   * Requires \code #include "gecode/set/rel-op.hh" \endcode
-   * \ingroup FuncSetProp
-   */
-  template <class View0, class View1, class View2>
-  class Union:
-    public InhomTernaryPropagator<View0,PC_SET_ANY,View1,PC_SET_ANY,
-				  View2,PC_SET_ANY> {
-  protected:
-    using InhomTernaryPropagator<View0,PC_SET_ANY,View1,PC_SET_ANY,
-				 View2,PC_SET_ANY>::x0;
-    using InhomTernaryPropagator<View0,PC_SET_ANY,View1,PC_SET_ANY,
-				 View2,PC_SET_ANY>::x1;
-    using InhomTernaryPropagator<View0,PC_SET_ANY,View1,PC_SET_ANY,
-				 View2,PC_SET_ANY>::x2;
-    /// Constructor for cloning \a p
-    Union(Space* home, bool share,Union& p);
-    /// Constructor for posting
-    Union(Space* home,View0,View1,View2);
-  public:
-    /// Copy propagator during cloning
-    virtual Actor*      copy(Space* home,bool);
-    /// Perform propagation
-    virtual ExecStatus  propagate(Space* home);
-    /// Post propagator \f$ z=x\cup y\f$
-    static  ExecStatus  post(Space* home,View0 x,View1 y,View2 z);
-  };
-
-   /**
-    * \brief %Propagator for nary intersection
-    *
-    * Requires \code #include "gecode/set/rel-op.hh" \endcode
-    * \ingroup FuncSetProp
-    */
-  template <class View0, class View1>
-  class IntersectionN : public InhomNaryOnePropagator<View0,PC_SET_ANY,
-						      View1,PC_SET_ANY> {
-  protected:
-    using InhomNaryOnePropagator<View0,PC_SET_ANY,View1,PC_SET_ANY>::x;
-    using InhomNaryOnePropagator<View0,PC_SET_ANY,View1,PC_SET_ANY>::y;
-    /// Whether the any views share a variable implementation
-    bool shared;
-    /// Intersection of the determined \f$x_i\f$ (which are dropped)
-    LUBndSet intOfDets;
-    /// Constructor for cloning \a p
-    IntersectionN(Space* home, bool share,IntersectionN& p);
-    /// Constructor for posting
-    IntersectionN(Space* home,ViewArray<View0>&, View1);
-  public:
-    virtual PropCost    cost(void) const;
-    /// Copy propagator during cloning
-    virtual Actor*      copy(Space* home,bool);
-    /// Perform propagation
-    virtual ExecStatus  propagate(Space* home);
-    /// Post propagator \f$ x = \bigcap_{i\in\{0,\dots,n-1\}} y_i \f$
-    static  ExecStatus  post(Space* home,ViewArray<View0>& y,View1 x);
-  };
-
-  /**
-   * \brief %Propagator for nary union
-   *
-   * Requires \code #include "gecode/set/rel-op.hh" \endcode
-   * \ingroup FuncSetProp
-   */
-  template <class View0, class View1>
-  class UnionN : public InhomNaryOnePropagator<View0,PC_SET_ANY,
-					       View1,PC_SET_ANY> {
-  protected:
-    using InhomNaryOnePropagator<View0,PC_SET_ANY,View1,PC_SET_ANY>::x;
-    using InhomNaryOnePropagator<View0,PC_SET_ANY,View1,PC_SET_ANY>::y;
-    /// Whether the any views share a variable implementation
-    bool shared;
-    /// Union of the determined \f$x_i\f$ (which are dropped)
-    GLBndSet unionOfDets;
-    /// Constructor for cloning \a p
-    UnionN(Space* home, bool share,UnionN& p);
-    /// Constructor for posting
-    UnionN(Space* home,ViewArray<View0>&,View1);
-  public:
-    /// Copy propagator during cloning
-    virtual Actor*      copy(Space* home, bool);
-    /// Perform propagation
-    virtual ExecStatus  propagate(Space* home);
-    virtual PropCost    cost(void) const;
-    /// Post propagator \f$ x = \bigcup_{i\in\{0,\dots,n-1\}} y_i \f$ 
-    static  ExecStatus  post(Space* home,ViewArray<View0>& y,View1 x);
-  };
-
-
-  /**
-   * \brief %Propagator for nary partition
-   *
-   * Requires \code #include "gecode/set/rel-op.hh" \endcode
-   * \ingroup FuncSetProp
-   */
-  template <class View0, class View1>
-  class PartitionN : public InhomNaryOnePropagator<View0,PC_SET_ANY,
-						   View1,PC_SET_ANY> {
-  protected:
-    using InhomNaryOnePropagator<View0,PC_SET_ANY,View1,PC_SET_ANY>::x;
-    using InhomNaryOnePropagator<View0,PC_SET_ANY,View1,PC_SET_ANY>::y;
-    /// Whether the any views share a variable implementation
-    bool shared;
-    /// Union of the determined \f$x_i\f$ (which are dropped)
-    GLBndSet unionOfDets;
-    /// Constructor for cloning \a p
-    PartitionN(Space* home, bool share,PartitionN& p);
-    /// Constructor for posting
-    PartitionN(Space* home,ViewArray<View0>&, View1);
-  public:
-    /// Copy propagator during cloning
-    virtual Actor*      copy(Space* home,bool);
-    /// Perform propagation
-    virtual ExecStatus  propagate(Space* home);
-    virtual PropCost    cost(void) const;
-    /// Post propagator \f$ x = \biguplus_{i\in\{0,\dots,n-1\}} y_i \f$ 
-    static  ExecStatus  post(Space* home,ViewArray<View0>& y,View1 x);
-  };
-
-}}}
-
-#include "gecode/set/rel-op/common.icc"
-#include "gecode/set/rel-op/superofinter.icc"
-#include "gecode/set/rel-op/subofunion.icc"
-#include "gecode/set/rel-op/inter.icc"
-#include "gecode/set/rel-op/union.icc"
-#include "gecode/set/rel-op/partition.icc"
-#include "gecode/set/rel-op/post.icc"
-
-#endif
-
-// STATISTICS: set-prop

data/ext/gecode-1.3.1/gecode/set/rel-op/common.icc

@@ -1,528 +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-08-25 17:31:32 +0200 (Fri, 25 Aug 2006) $ by $Author: tack $
- *     $Revision: 3573 $
- *
- *  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 { 
-
-  template <class View0, class View1>
-  forceinline bool
-  viewarrayshared(const ViewArray<View0>& va,
-		       const View1& y) {
-    return va.shared(y);
-  }
-
-  template <>
-  forceinline bool
-  viewarrayshared<Set::SingletonView,Set::SetView>
-  (const ViewArray<Set::SingletonView>& va, const Set::SetView& y) {
-    return false;
-  }
-
-  template <>
-  forceinline bool
-  viewarrayshared<Set::ComplementView<Set::SingletonView>,Set::SetView>
-  (const ViewArray<Set::ComplementView<Set::SingletonView> >& va,
-   const Set::SetView& y) {
-    return false;
-  }
-
-  template <>
-  forceinline bool
-  viewarrayshared<Set::ComplementView<Set::SingletonView>,
-		       Set::ComplementView<Set::SetView> >
-  (const ViewArray<Set::ComplementView<Set::SingletonView> >& va,
-   const Set::ComplementView<Set::SetView>& y) {
-    return false;
-  }
-
-
-namespace Set { namespace RelOp {
-
-  /*
-   * Detect sharing between 3 variables
-   *
-   */
-  template <class View0, class View1, class View2>
-  forceinline bool
-  shared(View0 v0, View1 v1, View2 v2) {
-    return shared(v0,v1) || shared(v0,v2) || shared(v1,v2);
-  }
-
-  template <class View0, class View1, class View2>
-  ExecStatus unionCard(Space* home,
-		       bool& retmodified, View0& x0, View1& x1, View2& x2) {
-    bool modified = false;
-    do {
-      retmodified |= modified;
-      modified = false;
-
-      {
-	LubRanges<View0> x0ub(x0);
-	LubRanges<View1> x1ub(x1);
-	Iter::Ranges::Inter<LubRanges<View0>, LubRanges<View1> > i1(x0ub,x1ub);
-	unsigned int s1 = Iter::Ranges::size(i1);
-        unsigned int res = std::max(x0.cardMin()+
-                                    (x1.cardMin()<s1 ?
-                                     0 : x1.cardMin()-s1),
-                                    std::max(x0.cardMin(),
-                                             x1.cardMin()));
-	GECODE_ME_CHECK_MODIFIED(modified, x2.cardMin(home,res));
-      }
-
-      {
-	LubRanges<View0> x0ub(x0);
-	LubRanges<View1> x1ub(x1);
-	Iter::Ranges::Union<LubRanges<View0>, LubRanges<View1> > u1(x0ub,x1ub);
-	unsigned int s1 = Iter::Ranges::size(u1);
-	GECODE_ME_CHECK_MODIFIED(modified, 
-			  x2.cardMax(home,
-				     std::min(x0.cardMax()+x1.cardMax(),s1)));
-      }
-
-      if (x2.cardMin() > x1.cardMax())
-	GECODE_ME_CHECK_MODIFIED(modified,
-			  x0.cardMin(home,x2.cardMin() - x1.cardMax()));
-
-      if (x2.cardMin() > x0.cardMax())
-	GECODE_ME_CHECK_MODIFIED(modified,
-			  x1.cardMin(home,x2.cardMin() - x0.cardMax()));
-
-      GECODE_ME_CHECK_MODIFIED(modified,
-			x0.cardMax(home,x2.cardMax()));
-      GECODE_ME_CHECK_MODIFIED(modified,
-			x1.cardMax(home,x2.cardMax()));
-    } while(modified);
-    return ES_FIX;
-  }
-
-  template <class View0, class View1>
-  ExecStatus
-  unionNCard(Space* home, bool& modified, ViewArray<View0>& x,
-	     View1& y, GLBndSet& unionOfDets) {
-    int xsize = x.size();
-    // Max(Xi.cardMin) <= y.card <= Sum(Xi.cardMax)
-    // Xi.card <=y.cardMax
-    unsigned int cardMaxSum=unionOfDets.size();
-    bool maxValid = true;
-    for (int i=xsize; i--; ){
-      cardMaxSum+=x[i].cardMax();
-      if (cardMaxSum < x[i].cardMax()) { maxValid = false; } //overflow
-      GECODE_ME_CHECK_MODIFIED(modified, y.cardMin(home,x[i].cardMin()) );
-      GECODE_ME_CHECK_MODIFIED(modified, x[i].cardMax(home,y.cardMax()) );
-    }
-    if (maxValid) {
-      GECODE_ME_CHECK_MODIFIED(modified, y.cardMax(home,cardMaxSum));
-    }
-    //y.cardMin - Sum(Xj.cardMax) <= Xi.card
-
-    //TODO: overflow management is a waste now.
-    {
-      GECODE_AUTOARRAY(unsigned int, rightSum, xsize);
-      rightSum[xsize-1]=0;
-
-      for (int i=x.size()-1;i--;) {
-	rightSum[i] = rightSum[i+1] + x[i+1].cardMax();
-	if (rightSum[i] < rightSum[i+1]) {
-	  //overflow, fill the rest of the array.
-	  for (int j=i; j>0;j--) {
-	    rightSum[j]=Limits::Set::card_max;
-	  }
-	  break;
-	}
-      }
-
-      //Size of union of determied vars missing from x sneaked in here:
-      unsigned int leftAcc=unionOfDets.size();
-
-      for (int i=0; i<xsize;i++) {
-	unsigned int jsum = leftAcc+rightSum[i];
-	//If jsum did not overflow and is less than y.cardMin:
-	if (jsum >= leftAcc &&  jsum < y.cardMin()) {
-	  GECODE_ME_CHECK_MODIFIED(modified, x[i].cardMin(home,y.cardMin()-jsum));
-	}
-	leftAcc += x[i].cardMax();
-	if (leftAcc < x[i].cardMax()) {leftAcc = Limits::Set::card_max;}
-      }
-    }
-
-    //y.cardMin - |U(Xj.ub)| <= Xi.card
-
-    {
-      GECODE_AUTOARRAY(GLBndSet, rightUnion, xsize);
-      rightUnion[xsize-1].init(home);
-      for (int i=xsize-1;i--;){
-	BndSetRanges prev(rightUnion[i+1]);
-	LubRanges<View0> prevX(x[i+1]);
-	Iter::Ranges::Union< BndSetRanges,LubRanges<View0> >
-	  iter(prev,prevX);
-	rightUnion[i].init(home);
-	rightUnion[i].includeI(home, iter);
-      }
-
-      //union of determied vars missing from x sneaked in here:
-      GLBndSet leftAcc;
-      leftAcc.update(home,unionOfDets);
-      for (int i=0; i<xsize; i++) {
-	BndSetRanges left(leftAcc);
-	BndSetRanges right(rightUnion[i]);
-	Iter::Ranges::Union<BndSetRanges,
-	  BndSetRanges> iter(left, right);
-	unsigned int unionSize = Iter::Ranges::size(iter);
-	if (y.cardMin() > unionSize) {
-	  GECODE_ME_CHECK_MODIFIED(modified,
-			    x[i].cardMin(home, y.cardMin() - unionSize) );
-	}
-	LubRanges<View0> xiub(x[i]);
-	leftAcc.includeI(home, xiub);
-      }
-
-      for (int i=xsize; i--;)
-	rightUnion[i].dispose(home);
-      leftAcc.dispose(home);
-    }
-
-    //no need for this: |y.lb - U(Xj.cardMax)| <= S.card
-
-    return ES_NOFIX;
-
-  }
-
-  /*
-   * Xi UB is subset of YUB
-   * Subscribes to Y UB
-   */
-  template <class View0, class View1>
-  ExecStatus
-  unionNXiUB(Space* home,
-	     bool& modified, ViewArray<View0>& x, View1& y,
-	     GLBndSet & unionOfDets) {
-    int xsize = x.size();
-    for (int i=xsize; i--; ) {
-      LubRanges<View1> yub(y);
-      GECODE_ME_CHECK_MODIFIED(modified, x[i].intersectI(home, yub));
-    }
-    return ES_FIX;
-  }
-
-  // cardinality rules for PartitionN constraint
-  template <class View0, class View1>
-  ExecStatus
-  partitionNCard(Space* home,
-		 bool& modified, ViewArray<View0>& x, View1& y,
-		 GLBndSet& unionOfDets) {
-    unsigned int cardMinSum=unionOfDets.size();
-    unsigned int cardMaxSum=unionOfDets.size();
-    int xsize = x.size();
-    for (int i=xsize; i--; ) {
-      cardMinSum+=x[i].cardMin();
-      if (cardMinSum < x[i].cardMin()) {
-	//sum of mins overflows: fail the space.
-	GECODE_ME_CHECK(ME_SET_FAILED);
-      }
-    }
-    GECODE_ME_CHECK_MODIFIED(modified, y.cardMin(home,cardMinSum));
-    for (int i=xsize; i--; ) {
-      cardMaxSum+=x[i].cardMax();
-      if (cardMaxSum < x[i].cardMax()) {
-	//sum of maxes overflows: no useful information to tell.
-	goto overflow;
-      }
-    }
-    GECODE_ME_CHECK_MODIFIED(modified, y.cardMax(home,cardMaxSum));
-  overflow:
-
-    //Cardinality of each x[i] limited by cardinality of y minus all x[j]s:
-
-    {
-      GECODE_AUTOARRAY(unsigned int, rightMinSum, xsize);
-      GECODE_AUTOARRAY(unsigned int, rightMaxSum, xsize);
-      rightMinSum[xsize-1]=0;
-      rightMaxSum[xsize-1]=0;
-
-      for (int i=x.size()-1;i--;) {
-	rightMaxSum[i] = rightMaxSum[i+1] + x[i+1].cardMax();
-	if (rightMaxSum[i] < rightMaxSum[i+1]) {
-	  //overflow, fill the rest of the array.
-	  for (int j=i; j>0;j--) {
-	    rightMaxSum[j]=Limits::Set::card_max;
-	  }
-	  break;
-	}
-
-	rightMinSum[i] = rightMinSum[i+1] + x[i+1].cardMin();
-	if (rightMinSum[i] < rightMinSum[i+1]) {
-	  //overflow, fail the space
-	  GECODE_ME_CHECK(ME_SET_FAILED);
-	}
-
-
-      }
-      unsigned int leftMinAcc=unionOfDets.size();
-      unsigned int leftMaxAcc=unionOfDets.size();
-
-      for (int i=0; i<xsize;i++) {
-	unsigned int maxSum = leftMaxAcc+rightMaxSum[i];
-	unsigned int minSum = leftMinAcc+rightMinSum[i];
-	//If maxSum did not overflow and is less than y.cardMin:
-	if (maxSum >= leftMaxAcc &&  maxSum < y.cardMin()) {
-	  GECODE_ME_CHECK_MODIFIED(modified, x[i].cardMin(home,y.cardMin()-maxSum));
-	}
-
-	//Overflow, fail.
-	if (minSum < leftMinAcc || y.cardMax() < minSum) {
-	  GECODE_ME_CHECK(ME_SET_FAILED);
-	}
-	else {
-	  GECODE_ME_CHECK_MODIFIED(modified, x[i].cardMax(home,y.cardMax()-minSum));
-	}
-
-	leftMaxAcc += x[i].cardMax();
-	if (leftMaxAcc < x[i].cardMax()) {leftMaxAcc = Limits::Set::card_max;}
-	leftMinAcc += x[i].cardMin();
-	if (leftMinAcc < x[i].cardMin()) {GECODE_ME_CHECK(ME_SET_FAILED);}
-      }
-    }
-
-    return ES_NOFIX;
-  }
-
-  // Xi LB includes YLB minus union Xj UB
-  // Xi UB is subset of YUB minus union of Xj LBs
-  template <class View0, class View1>
-  ExecStatus
-  partitionNXi(Space* home,
-	       bool& modified, ViewArray<View0>& x, View1& y) {
-    int xsize = x.size();
-    GECODE_AUTOARRAY(GLBndSet, afterUB, xsize);
-    GECODE_AUTOARRAY(GLBndSet, afterLB, xsize);
-
-    {
-      GLBndSet sofarAfterUB;
-      GLBndSet sofarAfterLB;
-      for (int i=xsize; i--;) {
-	afterUB[i].init(home);
-	afterLB[i].init(home);
-	afterUB[i].update(home,sofarAfterUB);
-	afterLB[i].update(home,sofarAfterLB);
-	LubRanges<View0> xiub(x[i]);
-	GlbRanges<View0> xilb(x[i]);
-	sofarAfterUB.includeI(home,xiub);
-	sofarAfterLB.includeI(home,xilb);
-      }
-      sofarAfterUB.dispose(home);
-      sofarAfterLB.dispose(home);
-    }
-
-    {
-      GLBndSet sofarBeforeUB;
-      GLBndSet sofarBeforeLB;
-      for (int i=0; i<xsize; i++) {
-	LubRanges<View1> yub(y);
-	BndSetRanges slb(sofarBeforeLB);
-	BndSetRanges afterlb(afterLB[i]);
-	Iter::Ranges::Union<BndSetRanges,
-	  BndSetRanges> xjlb(slb, afterlb);
-	Iter::Ranges::Diff<LubRanges<View1>,
-	  Iter::Ranges::Union<BndSetRanges,
-	  BndSetRanges> > diff1(yub, xjlb);
-	GECODE_ME_CHECK_MODIFIED(modified, x[i].intersectI(home,diff1));
-
-	GlbRanges<View1> ylb(y);
-	BndSetRanges sub(sofarBeforeUB);
-	BndSetRanges afterub(afterUB[i]);
-	Iter::Ranges::Union<BndSetRanges,
-	  BndSetRanges> xjub(sub, afterub);
-	Iter::Ranges::Diff<GlbRanges<View1>,
-	  Iter::Ranges::Union<BndSetRanges,
-	  BndSetRanges> > diff2(ylb, xjub);
-	GECODE_ME_CHECK_MODIFIED(modified, x[i].includeI(home,diff2));
-
-	LubRanges<View0> xiub(x[i]);
-	GlbRanges<View0> xilb(x[i]);
-	sofarBeforeUB.includeI(home,xiub);
-	sofarBeforeLB.includeI(home,xilb);
-      }
-      sofarBeforeLB.dispose(home);
-      sofarBeforeUB.dispose(home);
-    }
-
-    for (int i=xsize;i--;) {
-      afterUB[i].dispose(home);
-      afterLB[i].dispose(home);
-    }
-
-    return ES_NOFIX;
-  }
-
-  // Xi UB is subset of YUB minus union of Xj LBs
-  template <class View0, class View1>
-  ExecStatus
-  partitionNXiUB(Space* home,
-		 bool& modified, ViewArray<View0>& x, View1& y,
-		 GLBndSet& unionOfDets) {
-    int xsize = x.size();
-    GECODE_AUTOARRAY(GLBndSet, afterLB, xsize);
-
-    {
-      GLBndSet sofarAfterLB;
-      for (int i=xsize; i--;) {
-	afterLB[i].init(home);
-	afterLB[i].update(home,sofarAfterLB);
-	GlbRanges<View0> xilb(x[i]);
-	sofarAfterLB.includeI(home,xilb);
-      }
-      sofarAfterLB.dispose(home);
-    }
-
-    {
-      GLBndSet sofarBeforeLB;
-      sofarBeforeLB.update(home,unionOfDets);
-      for (int i=0; i<xsize; i++) {
-	LubRanges<View1> yub(y);
-	BndSetRanges slb(sofarBeforeLB);
-	BndSetRanges afterlb(afterLB[i]);
-	Iter::Ranges::Union<BndSetRanges,
-	  BndSetRanges> xjlb(slb, afterlb);
-	Iter::Ranges::Diff<LubRanges<View1>,
-	  Iter::Ranges::Union<BndSetRanges,
-	  BndSetRanges> > diff1(yub, xjlb);
-	GECODE_ME_CHECK_MODIFIED(modified, x[i].intersectI(home,diff1));
-
-	GlbRanges<View0> xilb(x[i]);
-	sofarBeforeLB.includeI(home,xilb);
-      }
-      sofarBeforeLB.dispose(home);
-    }
-    for (int i=xsize; i--;)
-      afterLB[i].dispose(home);
-    return ES_NOFIX;
-  }
-
-  // Xi LB includes YLB minus union Xj UB
-  template <class View0, class View1>
-  ExecStatus
-  partitionNXiLB(Space* home,
-		 bool& modified, ViewArray<View0>& x, View1& y,
-		 GLBndSet& unionOfDets) {
-    int xsize = x.size();
-    GECODE_AUTOARRAY(GLBndSet, afterUB, xsize);
-
-    {
-      GLBndSet sofarAfterUB;
-      for (int i=xsize; i--;) {
-	afterUB[i].init(home);
-	afterUB[i].update(home,sofarAfterUB);
-	LubRanges<View0> xiub(x[i]);
-	sofarAfterUB.includeI(home,xiub);
-      }
-      sofarAfterUB.dispose(home);
-    }
-
-    {
-      //The union of previously determined x[j]-s is added to the mix here:
-      GLBndSet sofarBeforeUB;
-      sofarBeforeUB.update(home,unionOfDets);
-      for (int i=0; i<xsize; i++) {
-	GlbRanges<View1> ylb(y);
-	BndSetRanges sub(sofarBeforeUB);
-	BndSetRanges afterub(afterUB[i]);
-	Iter::Ranges::Union<BndSetRanges,
-	  BndSetRanges> xjub(sub, afterub);
-	Iter::Ranges::Diff<GlbRanges<View1>,
-	  Iter::Ranges::Union<BndSetRanges,
-	  BndSetRanges> > diff2(ylb, xjub);
-	GECODE_ME_CHECK_MODIFIED(modified, x[i].includeI(home,diff2));
-
-	LubRanges<View0> xiub(x[i]);
-	sofarBeforeUB.includeI(home,xiub);
-      }
-      sofarBeforeUB.dispose(home);
-    }
-    for (int i=xsize;i--;)
-      afterUB[i].dispose(home);
-    return ES_NOFIX;
-  }
-
-  // Y LB contains union of X LBs
-  template <class View0, class View1>
-  ExecStatus
-  partitionNYLB(Space* home,
-		bool& modified, ViewArray<View0>& x, View1& y,
-		GLBndSet& unionOfDets) {
-    assert(unionOfDets.isConsistent());
-    int xsize = x.size();
-    GECODE_AUTOARRAY(GlbRanges<View0>,xLBs,xsize);
-    int nonEmptyCounter=0;
-    for (int i = xsize; i--; ) {
-      GlbRanges<View0> r(x[i]);
-      if (r()) {
-	xLBs[nonEmptyCounter] = r;
-	nonEmptyCounter++;
-      }
-    }
-    if (nonEmptyCounter !=0) {
-      Iter::Ranges::NaryUnion<GlbRanges<View0> >
-	xLBUnion(xLBs,nonEmptyCounter);
-      BndSetRanges dets(unionOfDets);
-      Iter::Ranges::Union<Iter::Ranges::NaryUnion<GlbRanges<View0> >,
-	BndSetRanges>
-	allUnion(xLBUnion,dets);
-      GECODE_ME_CHECK_MODIFIED(modified, y.includeI(home,allUnion));
-    }
-    return ES_FIX;
-  }
-
-  // Y UB is subset of union of X UBs
-  template <class View0, class View1>
-  ExecStatus
-  partitionNYUB(Space* home,
-		bool& modified, ViewArray<View0>& x, View1& y,
-		GLBndSet& unionOfDets) {
-    int xsize = x.size();
-    GECODE_AUTOARRAY(LubRanges<View0>,xUBs,xsize);
-    int nonEmptyCounter=0;
-    for (int i = xsize; i--; ) {
-      LubRanges<View0> r(x[i]);
-      if (r()) {
-	xUBs[nonEmptyCounter] = r;
-	nonEmptyCounter++;
-      }
-    }
-    if (nonEmptyCounter !=0) {
-      Iter::Ranges::NaryUnion<LubRanges<View0> >
-	xUBUnion(xUBs,nonEmptyCounter);
-      BndSetRanges dets(unionOfDets);
-      Iter::Ranges::Union<Iter::Ranges::NaryUnion<LubRanges<View0> >,
-	BndSetRanges>
-	fullUnion(xUBUnion, dets);
-      GECODE_ME_CHECK_MODIFIED(modified, y.intersectI(home,fullUnion));
-    }
-    return ES_FIX;
-  }
-
-}}}
-
-// STATISTICS: set-prop