gecoder-with-gecode 0.9.0 → 0.9.1

data/ext/gecode-2.2.0/gecode/set/element/disjoint.icc

@@ -0,0 +1,75 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Guido Tack <tack@gecode.org>
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Guido Tack, 2004
+ *     Christian Schulte, 2004
+ *
+ *  Last modified:
+ *     $Date: 2008-05-27 19:24:07 +0200 (Tue, 27 May 2008) $ by $Author: tack $
+ *     $Revision: 6982 $
+ *
+ *  This file is part of Gecode, the generic constraint
+ *  development environment:
+ *     http://www.gecode.org
+ *
+ *  Permission is hereby granted, free of charge, to any person obtaining
+ *  a copy of this software and associated documentation files (the
+ *  "Software"), to deal in the Software without restriction, including
+ *  without limitation the rights to use, copy, modify, merge, publish,
+ *  distribute, sublicense, and/or sell copies of the Software, and to
+ *  permit persons to whom the Software is furnished to do so, subject to
+ *  the following conditions:
+ *
+ *  The above copyright notice and this permission notice shall be
+ *  included in all copies or substantial portions of the Software.
+ *
+ *  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+ *  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+ *  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+ *  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+ *  LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+ *  OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+ *  WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+ *
+ */
+
+namespace Gecode { namespace Set { namespace Element {
+
+  forceinline
+  ElementDisjoint::ElementDisjoint(Space* home,
+                                 IdxViewArray<SetView>& iv0,
+                                 SetView y1)
+    : Propagator(home), iv(iv0), x1(y1) {
+
+    x1.subscribe(home,this, PC_SET_ANY);
+    iv.subscribe(home,this, PC_SET_ANY);
+  }
+
+  forceinline
+  ElementDisjoint::ElementDisjoint(Space* home, bool share, ElementDisjoint& p)
+    : Propagator(home,share,p) {
+    x1.update(home,share,p.x1);
+    iv.update(home,share,p.iv);
+  }
+
+  forceinline ExecStatus
+  ElementDisjoint::post(Space* home, IdxViewArray<SetView>& xs,
+                       SetView x1) {
+    int n = xs.size();
+
+    // s2 \subseteq {0,...,n-1}
+    Iter::Ranges::Singleton s(0, n-1);
+    GECODE_ME_CHECK(x1.intersectI(home,s));
+    (void) new (home)
+      ElementDisjoint(home,xs,x1);
+    return ES_OK;
+  }
+
+
+}}}
+
+// STATISTICS: set-prop

data/ext/gecode-2.2.0/gecode/set/element/idxarray.hh

@@ -0,0 +1,113 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Guido Tack <tack@gecode.org>
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Guido Tack, 2004,2005
+ *     Christian Schulte, 2004,2005
+ *
+ *  Last modified:
+ *     $Date: 2008-05-27 19:24:07 +0200 (Tue, 27 May 2008) $ by $Author: tack $
+ *     $Revision: 6982 $
+ *
+ *  This file is part of Gecode, the generic constraint
+ *  development environment:
+ *     http://www.gecode.org
+ *
+ *  Permission is hereby granted, free of charge, to any person obtaining
+ *  a copy of this software and associated documentation files (the
+ *  "Software"), to deal in the Software without restriction, including
+ *  without limitation the rights to use, copy, modify, merge, publish,
+ *  distribute, sublicense, and/or sell copies of the Software, and to
+ *  permit persons to whom the Software is furnished to do so, subject to
+ *  the following conditions:
+ *
+ *  The above copyright notice and this permission notice shall be
+ *  included in all copies or substantial portions of the Software.
+ *
+ *  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+ *  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+ *  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+ *  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+ *  LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+ *  OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+ *  WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+ *
+ */
+
+namespace Gecode { namespace Set { namespace Element {
+
+  /**
+   * \brief Pairs of an index and a variable
+   *
+   */
+  template <class View>
+  class IdxView {
+  public:
+    /// The index
+    int idx;
+    /// The variable
+    View var;
+    /// Allocate \a n elements
+    static IdxView* allocate(Space* home,int n);
+  };
+
+  /**
+   * \brief An array of IndexView pairs
+   *
+   */
+  template <class View>
+  class IdxViewArray {
+  private:
+    /// The actual array
+    IdxView<View>* xs;
+    /// The size of the array
+    int n;
+  public:
+    /// Default constructor
+    IdxViewArray(void);
+    /// Copy constructor
+    IdxViewArray(const IdxViewArray<View>&);
+    /// Initialize from specification \a spec with variables \a vars
+    IdxViewArray(Space* home, const Reflection::VarMap& vars,
+                 Reflection::Arg* spec);
+
+    /// Construct an IdxViewArray from \a x
+    IdxViewArray(Space* home, const SetVarArgs& x);
+
+    /// Return the current size
+    int size(void) const;
+    /// Set the size to \a n
+    void size(int n);
+
+    /// Access element \a n
+    IdxView<View>& operator[](int n);
+    /// Access element \a n
+    const IdxView<View>& operator[](int) const;
+
+    /**
+     * Subscribe propagator \a p with propagation condition \a pc
+     * to all elements of the array.
+     */
+    void subscribe(Space* home,Propagator* p, PropCond pc, bool process=true);
+    /**
+     * Cancel subscription of propagator \a p with propagation condition \a pc
+     * for all elements of the array.
+     */
+    void cancel(Space* home, Propagator* p, PropCond pc);
+
+    /// Cloning
+    void update(Space* home, bool share, IdxViewArray<View>& x);
+    
+    // Specification
+    Reflection::Arg* spec(const Space* home, Reflection::VarMap& m) const;
+  };
+
+}}}
+
+#include "gecode/set/element/idxarray.icc"
+
+// STATISTICS: set-prop
+

data/ext/gecode-2.2.0/gecode/set/element/idxarray.icc

@@ -0,0 +1,155 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Guido Tack <tack@gecode.org>
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Guido Tack, 2004,2005
+ *     Christian Schulte, 2004,2005
+ *
+ *  Last modified:
+ *     $Date: 2008-05-27 19:24:07 +0200 (Tue, 27 May 2008) $ by $Author: tack $
+ *     $Revision: 6982 $
+ *
+ *  This file is part of Gecode, the generic constraint
+ *  development environment:
+ *     http://www.gecode.org
+ *
+ *  Permission is hereby granted, free of charge, to any person obtaining
+ *  a copy of this software and associated documentation files (the
+ *  "Software"), to deal in the Software without restriction, including
+ *  without limitation the rights to use, copy, modify, merge, publish,
+ *  distribute, sublicense, and/or sell copies of the Software, and to
+ *  permit persons to whom the Software is furnished to do so, subject to
+ *  the following conditions:
+ *
+ *  The above copyright notice and this permission notice shall be
+ *  included in all copies or substantial portions of the Software.
+ *
+ *  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+ *  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+ *  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+ *  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+ *  LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+ *  OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+ *  WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+ *
+ */
+
+namespace Gecode { namespace Set { namespace Element {
+
+  template <class View>
+  forceinline IdxView<View>*
+  IdxView<View>::allocate(Space* home, int n) {
+    return static_cast<IdxView<View>*>(home->alloc(sizeof(IdxView<View>)*n));
+  }
+
+  template <class View>
+  IdxViewArray<View>::IdxViewArray(void) : xs(NULL), n(0) {}
+
+  template <class View>
+  IdxViewArray<View>::IdxViewArray(const IdxViewArray<View>& a) {
+    n = a.n; xs = a.xs;
+  }
+
+  template <class View>
+  IdxViewArray<View>::IdxViewArray(Space* home, const SetVarArgs& xa)
+    : xs(NULL) {
+    n = xa.size();
+    if (n>0) {
+      xs = IdxView<View>::allocate(home, n);
+      for (int i = n; i--; ) {
+        SetView xav(xa[i]);
+        View xavv(xav);
+        xs[i].idx = i; xs[i].var = xavv;
+      }
+    }
+  }
+
+  template <class View>
+  forceinline int
+  IdxViewArray<View>::size(void) const {
+    return n;
+  }
+
+  template <class View>
+  forceinline void
+  IdxViewArray<View>::size(int n0) {
+    n = n0;
+  }
+
+  template <class View>
+  forceinline IdxView<View>&
+  IdxViewArray<View>::operator[](int i) {
+    assert((i >= 0) && (i < size()));
+    return xs[i];
+  }
+
+  template <class View>
+  forceinline const IdxView<View>&
+  IdxViewArray<View>::operator[](int i) const {
+    assert((i >= 0) && (i < size()));
+    return xs[i];
+  }
+
+  template <class View>
+  void
+  IdxViewArray<View>::subscribe(Space* home, Propagator* p, PropCond pc,
+                                bool process) {
+    for (int i = n; i--; )
+      xs[i].var.subscribe(home,p,pc,process);
+  }
+
+  template <class View>
+  void
+  IdxViewArray<View>::cancel(Space* home, Propagator* p, PropCond pc) {
+    for (int i = n; i--; )
+      xs[i].var.cancel(home,p,pc);
+  }
+
+  template <class View>
+  void
+  IdxViewArray<View>::update(Space* home, bool share, IdxViewArray<View>& a) {
+    n = a.size();
+    if (n>0) {
+      xs = IdxView<View>::allocate(home,n);
+      for (int i=n; i--; ) {
+        xs[i].idx = a[i].idx;
+        xs[i].var.update(home,share,a[i].var);
+      }
+    }
+  }
+  
+  template <class View>
+  Reflection::Arg*
+  IdxViewArray<View>::spec(const Space* home, Reflection::VarMap& m) const {
+    Reflection::IntArrayArg* is = Reflection::Arg::newIntArray(n);
+    for (int i = 0; i<n; i++)
+      (*is)[i] = xs[i].idx;
+    Reflection::ArrayArg* s = Reflection::Arg::newArray(n);
+    for (int i = 0; i<n; i++)
+      (*s)[i] = xs[i].var.spec(home, m);
+    return Reflection::Arg::newPair(is,s);
+  }
+
+  template <class View>
+  IdxViewArray<View>::IdxViewArray(Space* home,
+                                   const Reflection::VarMap& vars,
+                                   Reflection::Arg* spec) : xs(NULL) {
+    Reflection::IntArrayArg* is = spec->first()->toIntArray();
+    Reflection::ArrayArg* s = spec->second()->toArray();
+    n = is->size();
+    if (n>0) {
+      xs = IdxView<View>::allocate(home, n);
+      for (int i = n; i--; ) {
+        View xavv(home, vars, (*s)[i]);
+        xs[i].idx = (*is)[i]; xs[i].var = xavv;
+      }
+    }                                     
+  }
+
+}}}
+
+// STATISTICS: set-prop
+

data/ext/gecode-2.2.0/gecode/set/element/inter.icc

@@ -0,0 +1,348 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Guido Tack <tack@gecode.org>
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Guido Tack, 2004
+ *     Christian Schulte, 2004
+ *
+ *  Last modified:
+ *     $Date: 2008-05-27 19:24:07 +0200 (Tue, 27 May 2008) $ by $Author: tack $
+ *     $Revision: 6982 $
+ *
+ *  This file is part of Gecode, the generic constraint
+ *  development environment:
+ *     http://www.gecode.org
+ *
+ *  Permission is hereby granted, free of charge, to any person obtaining
+ *  a copy of this software and associated documentation files (the
+ *  "Software"), to deal in the Software without restriction, including
+ *  without limitation the rights to use, copy, modify, merge, publish,
+ *  distribute, sublicense, and/or sell copies of the Software, and to
+ *  permit persons to whom the Software is furnished to do so, subject to
+ *  the following conditions:
+ *
+ *  The above copyright notice and this permission notice shall be
+ *  included in all copies or substantial portions of the Software.
+ *
+ *  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+ *  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+ *  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+ *  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+ *  LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+ *  OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+ *  WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+ *
+ */
+
+namespace Gecode { namespace Set { namespace Element {
+
+  template <class SView, class RView>
+  forceinline
+  ElementIntersection<SView,RView>::
+  ElementIntersection(Space* home, SView y0,
+                     IdxViewArray<SView>& iv0,
+                     RView y1,
+                     const IntSet& theUniverse)
+    : Propagator(home), universe(theUniverse), x0(y0), iv(iv0), x1(y1) {
+    force(home);
+    x0.subscribe(home,this, PC_SET_ANY);
+    x1.subscribe(home,this, PC_SET_ANY);
+    iv.subscribe(home,this, PC_SET_ANY);
+  }
+
+  template <class SView, class RView>
+  forceinline
+  ElementIntersection<SView,RView>::
+  ElementIntersection(Space* home, bool share,
+                     ElementIntersection<SView,RView>& p)
+    : Propagator(home,share,p) {
+    x0.update(home,share,p.x0);
+    x1.update(home,share,p.x1);
+    iv.update(home,share,p.iv);
+    universe.update(home,share,p.universe);
+  }
+
+  template <class SView, class RView>
+  PropCost
+  ElementIntersection<SView,RView>::cost(ModEventDelta) const {
+    return PC_LINEAR_HI;
+  }
+
+  template <class SView, class RView>
+  Support::Symbol
+  ElementIntersection<SView,RView>::ati(void) {
+    return Reflection::mangle<SView,RView>("Gecode::Set::Element::Intersection");
+  }
+
+  template <class SView, class RView>
+  Reflection::ActorSpec
+  ElementIntersection<SView,RView>::spec(const Space* home,
+                                        Reflection::VarMap& m) const {
+    Reflection::ActorSpec s(ati());
+    int count = 0;
+    for (IntSetRanges ur(universe); ur(); ++ur)
+      count++;
+    Reflection::IntArrayArg* a = Reflection::Arg::newIntArray(count*2);
+    count = 0;
+    for (IntSetRanges ur(universe); ur(); ++ur) {
+      (*a)[count++] = ur.min();
+      (*a)[count++] = ur.max();
+    }
+    return s << a
+             << x0.spec(home, m)
+             << iv.spec(home, m)
+             << x1.spec(home, m);
+  }
+
+  template <class SView, class RView>
+  void
+  ElementIntersection<SView,RView>::post(Space* home,
+                                        Reflection::VarMap& vars,
+                                        const Reflection::ActorSpec& spec) {
+    spec.checkArity(4);
+    Reflection::IntArrayArgRanges ur(spec[0]->toIntArray());
+    IntSet universe(ur);
+    SView x0(home, vars, spec[1]);
+    IdxViewArray<SView> iv(home, vars, spec[2]);
+    RView x1(home, vars, spec[3]);
+    (void) new (home) ElementIntersection(home, x0, iv, x1, universe);
+  }
+
+  template <class SView, class RView>
+  size_t
+  ElementIntersection<SView,RView>::dispose(Space* home) {
+    unforce(home);
+    if (!home->failed()) {
+      x0.cancel(home,this, PC_SET_ANY);
+      x1.cancel(home,this, PC_SET_ANY);
+      iv.cancel(home,this,PC_SET_ANY);
+    }
+    universe.~IntSet();
+    (void) Propagator::dispose(home);
+    return sizeof(*this);
+  }
+
+  template <class SView, class RView>
+  ExecStatus
+  ElementIntersection<SView,RView>::
+  post(Space* home, SView x0, IdxViewArray<SView>& xs,
+       RView x1, const IntSet& universe) {
+    int n = xs.size();
+
+    // s2 \subseteq {1,...,n}
+    Iter::Ranges::Singleton s(0, n-1);
+    GECODE_ME_CHECK(x1.intersectI(home,s));
+    (void) new (home)
+      ElementIntersection<SView,RView>(home,x0,xs,x1,universe);
+    return ES_OK;
+  }
+
+  template <class SView, class RView>
+  Actor*
+  ElementIntersection<SView,RView>::copy(Space* home, bool share) {
+    return new (home) ElementIntersection<SView,RView>(home,share,*this);
+  }
+
+  template <class SView, class RView>
+  ExecStatus
+  ElementIntersection<SView,RView>::propagate(Space* home, ModEventDelta) {
+    int n = iv.size();
+
+    bool loopVar;
+    do {
+      loopVar = false;
+
+      // Cache the upper bound iterator, as we have to
+      // modify the upper bound while iterating
+      LubRanges<RView> x1ub(x1);
+      Iter::Ranges::Cache<LubRanges<RView> > x1ubc(x1ub);
+      Iter::Ranges::ToValues<Iter::Ranges::Cache<LubRanges<RView> > >
+        vx1ub(x1ubc);
+
+      GlbRanges<RView> x1lb(x1);
+      Iter::Ranges::Cache<GlbRanges<RView> > x1lbc(x1lb);
+      Iter::Ranges::ToValues<Iter::Ranges::Cache<GlbRanges<RView> > >
+        vx1(x1lbc);
+
+      // In the first iteration, compute in before[i] the intersection
+      // of all the lower bounds of the x_i. At the same time,
+      // exclude inconsistent x_i from x1 and remove them from
+      // the list, cancel their dependencies.
+
+      LUBndSet sofarBefore(home,universe);
+      GECODE_AUTOARRAY(LUBndSet, before, n);
+
+      int j = 0;
+      int i = 0;
+      while ( vx1ub() ) {
+
+        // Remove vars at indices not in the upper bound
+        if (iv[i].idx < vx1ub.val()) {
+          iv[i].var.cancel(home,this, PC_SET_ANY);
+          ++i;
+          continue;
+        }
+        assert(iv[i].idx == vx1ub.val());
+        iv[j] = iv[i];
+
+        SView candidate = iv[j].var;
+        int candidateInd = iv[j].idx;
+
+        // inter = glb(x0) & complement(lub(candidate))
+        GlbRanges<SView> x0lb(x0);
+        LubRanges<SView> candub(candidate);
+        Iter::Ranges::Diff<GlbRanges<SView>,LubRanges<SView> >
+          inter(x0lb, candub);
+
+        // exclude inconsistent x_i
+        // an x_i is inconsistent if
+        //  * its max cardinality is less than minCard of x0
+        //  * inter is not empty (there are elements in x_0
+        //    that can't be in x_i)
+        if (candidate.cardMax() < x0.cardMin() ||
+            inter()) {
+          ModEvent me = (x1.exclude(home,candidateInd));
+          loopVar |= me_modified(me);
+          GECODE_ME_CHECK(me);
+
+          iv[j].var.cancel(home,this, PC_SET_ANY);
+          ++i;
+          ++vx1ub;
+          continue;
+        } else {
+          // if x_i is consistent, check whether we know
+          // that its index is in x1
+          if (vx1() && vx1.val()==candidateInd) {
+            // x0 <= candidate, candidate >= x0
+            GlbRanges<SView> x0lb(x0);
+            ModEvent me = candidate.includeI(home,x0lb);
+            loopVar |= me_modified(me);
+            GECODE_ME_CHECK(me);
+
+            LubRanges<SView> candub(candidate);
+            me = x0.intersectI(home,candub);
+            loopVar |= me_modified(me);
+            GECODE_ME_CHECK(me);
+            ++vx1;
+          }
+          new (&before[j]) LUBndSet(home);
+          before[j].update(home,sofarBefore);
+          GlbRanges<SView> clb(candidate);
+          sofarBefore.intersectI(home,clb);
+        }
+
+        ++vx1ub;
+        ++i; ++j;
+      }
+
+      // cancel the variables with index greater than
+      // max of lub(x1)
+      for (int k=i; k<n; k++) {
+        iv[k].var.cancel(home,this, PC_SET_ANY);
+      }
+      n = j;
+      iv.size(n);
+
+      if (x1.cardMax()==0) {
+        // Elementor is empty, hence the result must be universe
+        {
+          IntSetRanges uniI(universe);
+          GECODE_ME_CHECK(x0.includeI(home,uniI));
+        }
+        {
+          IntSetRanges uniI(universe);
+          GECODE_ME_CHECK(x0.intersectI(home,uniI));
+        }
+        for (int i=n; i--;)
+          before[i].dispose(home);
+        return ES_SUBSUMED(this,home);
+      }
+
+      {
+        // x0 >= sofarBefore
+        BndSetRanges sfB(sofarBefore);
+        ModEvent me = x0.includeI(home,sfB);
+        loopVar |= me_modified(me);
+        GECODE_ME_CHECK(me);
+      }
+
+      sofarBefore.dispose(home);
+
+      LUBndSet sofarAfter(home, universe);
+
+      // In the second iteration, this time backwards, compute
+      // sofarAfter as the intersection of all glb(x_j) with j>i
+      for (int i=n; i--;) {
+        if (sofarAfter.size() == 0) break;
+        
+        // extra = inter(before[i], sofarAfter) - lub(x0)
+        BndSetRanges b(before[i]);
+        BndSetRanges s(sofarAfter);
+        LubRanges<SView> x0ub(x0);
+        Iter::Ranges::Inter<BndSetRanges, BndSetRanges> inter(b,s);
+        Iter::Ranges::Diff<Iter::Ranges::Inter<BndSetRanges,
+          BndSetRanges>, LubRanges<SView> > diff(inter, x0ub);
+        if (diff()) {
+          ModEvent me = (x1.include(home,iv[i].idx));
+          loopVar |= me_modified(me);
+          GECODE_ME_CHECK(me);
+
+          // candidate != extra
+          me = iv[i].var.excludeI(home,diff);
+          loopVar |= me_modified(me);
+          GECODE_ME_CHECK(me);
+        }
+
+        GlbRanges<SView> ivilb(iv[i].var);
+        sofarAfter.intersectI(home,ivilb);
+        before[i].dispose(home);
+      }
+      sofarAfter.dispose(home);
+
+    } while (loopVar);
+
+    // Test whether we determined x1 without determining x0
+    if (x1.assigned() && !x0.assigned()) {
+      int ubsize = x1.lubSize();
+      if (ubsize > 2) {
+        assert(ubsize==n);
+        ViewArray<SView> is(home,ubsize);
+        for (int i=n; i--;)
+          is[i]=iv[i].var;
+        GECODE_REWRITE(this,(RelOp::IntersectionN<SView, SView>
+                        ::post(home,is,x0)));
+      } else if (ubsize == 2) {
+        assert(n==2);
+        SView a = iv[0].var;
+        SView b = iv[1].var;
+        GECODE_REWRITE(this,(RelOp::Intersection<SView, SView, SView>
+                       ::post(home,a,b,x0)));
+      } else if (ubsize == 1) {
+        assert(n==1);
+        GECODE_REWRITE(this,(Rel::Eq<SView,SView>::post(home,x0,iv[0].var)));
+      } else {
+        GECODE_ME_CHECK(x0.cardMax(home, 0));
+        return ES_SUBSUMED(this,home);
+      }
+    }
+
+    bool allAssigned = true;
+    for (int i=iv.size(); i--;) {
+      if (!iv[i].var.assigned()) {
+        allAssigned = false;
+        break;
+      }
+    }
+    if (x0.assigned() && x1.assigned() && allAssigned) {
+      return ES_SUBSUMED(this,home);
+    }
+
+    return ES_FIX;
+  }
+
+}}}
+
+// STATISTICS: set-prop