dep-selector-libgecode 1.0.0.alpha.0

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/int/rel/lex.hpp

@@ -0,0 +1,414 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2003
+ *
+ *  Last modified:
+ *     $Date: 2011-07-08 19:58:02 +1000 (Fri, 08 Jul 2011) $ by $Author: schulte $
+ *     $Revision: 12163 $
+ *
+ *  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 Int { namespace Rel {
+
+  /*
+   * Lexical order propagator
+   */
+  template<class View>
+  inline
+  LexLqLe<View>::LexLqLe(Home home,
+                         ViewArray<View>& x0, ViewArray<View>& y0, bool s)
+    : Propagator(home), x(x0), y(y0), strict(s) {
+    x.subscribe(home, *this, PC_INT_BND);
+    y.subscribe(home, *this, PC_INT_BND);
+  }
+
+  template<class View>
+  forceinline
+  LexLqLe<View>::LexLqLe(Space& home, bool share, LexLqLe<View>& p)
+    : Propagator(home,share,p), strict(p.strict) {
+    x.update(home,share,p.x);
+    y.update(home,share,p.y);
+  }
+
+  template<class View>
+  Actor*
+  LexLqLe<View>::copy(Space& home, bool share) {
+    return new (home) LexLqLe<View>(home,share,*this);
+  }
+
+  template<class View>
+  PropCost
+  LexLqLe<View>::cost(const Space&, const ModEventDelta&) const {
+    return PropCost::linear(PropCost::LO, x.size());
+  }
+
+  template<class View>
+  forceinline size_t
+  LexLqLe<View>::dispose(Space& home) {
+    assert(!home.failed());
+    x.cancel(home,*this,PC_INT_BND);
+    y.cancel(home,*this,PC_INT_BND);
+    (void) Propagator::dispose(home);
+    return sizeof(*this);
+  }
+
+  template<class View>
+  ExecStatus
+  LexLqLe<View>::propagate(Space& home, const ModEventDelta&) {
+    /*
+     * State 1
+     *
+     */
+    {
+      int i = 0;
+      int n = x.size();
+
+      while ((i < n) && (x[i].min() == y[i].max())) {
+        // case: =, >=
+        GECODE_ME_CHECK(x[i].lq(home,y[i].max()));
+        GECODE_ME_CHECK(y[i].gq(home,x[i].min()));
+        i++;
+      }
+
+      if (i == n) // case: $
+        return strict ? ES_FAILED : home.ES_SUBSUMED(*this);
+
+      // Possible cases left: <, <=, > (yields failure), ?
+      GECODE_ME_CHECK(x[i].lq(home,y[i].max()));
+      GECODE_ME_CHECK(y[i].gq(home,x[i].min()));
+
+      if (x[i].max() < y[i].min()) // case: < (after tell)
+        return home.ES_SUBSUMED(*this);
+
+      // x[i] can never be equal to y[i] (otherwise: >=)
+      assert(!(x[i].assigned() && y[i].assigned() &&
+               x[i].val() == y[i].val()));
+      // Remove all elements between 0...i-1 as they are assigned and equal
+      x.drop_fst(i); y.drop_fst(i);
+      // After this, execution continues at [1]
+    }
+
+    /*
+     * State 2
+     *   prefix: (?|<=)
+     *
+     */
+    {
+      int i = 1;
+      int n = x.size();
+
+      while ((i < n) &&
+             (x[i].min() == y[i].max()) &&
+             (x[i].max() == y[i].min())) { // case: =
+        assert(x[i].assigned() && y[i].assigned() &&
+               (x[i].val() == y[i].val()));
+        i++;
+      }
+
+      if (i == n) { // case: $
+        if (strict)
+          goto rewrite_le;
+        else
+          goto rewrite_lq;
+      }
+
+      if (x[i].max() < y[i].min()) // case: <
+        goto rewrite_lq;
+
+      if (x[i].min() > y[i].max()) // case: >
+        goto rewrite_le;
+
+      if (i > 1) {
+        // Remove equal elements [1...i-1], keep element [0]
+        x[i-1]=x[0]; x.drop_fst(i-1);
+        y[i-1]=y[0]; y.drop_fst(i-1);
+      }
+    }
+
+    if (x[1].max() <= y[1].min()) {
+      // case: <= (invariant: not =, <)
+      /*
+       * State 3
+       *   prefix: (?|<=),<=
+       *
+       */
+      int i = 2;
+      int n = x.size();
+
+      while ((i < n) && (x[i].max() == y[i].min())) // case: <=, =
+        i++;
+
+      if (i == n) { // case: $
+        if (strict)
+          return ES_FIX;
+        else
+          goto rewrite_lq;
+      }
+
+      if (x[i].max() < y[i].min()) // case: <
+        goto rewrite_lq;
+
+      if (x[i].min() > y[i].max()) { // case: >
+        // Eliminate [i]...[n-1]
+        for (int j=i; j<n; j++) {
+          x[j].cancel(home,*this,PC_INT_BND);
+          y[j].cancel(home,*this,PC_INT_BND);
+        }
+        x.size(i); y.size(i);
+        strict = true;
+      }
+
+      return ES_FIX;
+    }
+
+    if (x[1].min() >= y[1].max()) {
+      // case: >= (invariant: not =, >)
+      /*
+       * State 4
+       *   prefix: (?|<=) >=
+       *
+       */
+      int i = 2;
+      int n = x.size();
+
+      while ((i < n) && (x[i].min() == y[i].max()))
+        // case: >=, =
+        i++;
+
+      if (i == n) { // case: $
+        if (strict)
+          goto rewrite_le;
+        else
+          return ES_FIX;
+      }
+
+      if (x[i].min() > y[i].max()) // case: >
+        goto rewrite_le;
+
+      if (x[i].max() < y[i].min()) { // case: <
+        // Eliminate [i]...[n-1]
+        for (int j=i; j<n; j++) {
+          x[j].cancel(home,*this,PC_INT_BND);
+          y[j].cancel(home,*this,PC_INT_BND);
+        }
+        x.size(i); y.size(i);
+        strict = false;
+      }
+
+      return ES_FIX;
+    }
+
+    return ES_FIX;
+
+  rewrite_le:
+    GECODE_REWRITE(*this,Le<View>::post(home(*this),x[0],y[0]));
+  rewrite_lq:
+    GECODE_REWRITE(*this,Lq<View>::post(home(*this),x[0],y[0]));
+  }
+
+  template<class View>
+  ExecStatus
+  LexLqLe<View>::post(Home home,
+                      ViewArray<View>& x, ViewArray<View>& y, bool strict) {
+    if (x.size() < y.size()) {
+      y.size(x.size()); strict=false;
+    } else if (x.size() > y.size()) {
+      x.size(y.size()); strict=true;
+    }
+    if (x.size() == 0)
+      return strict ? ES_FAILED : ES_OK;
+    if (x.size() == 1) {
+      if (strict)
+        return Le<View>::post(home,x[0],y[0]);
+      else
+        return Lq<View>::post(home,x[0],y[0]);
+    }
+    (void) new (home) LexLqLe<View>(home,x,y,strict);
+    return ES_OK;
+  }
+
+
+  /*
+   * Lexical disequality propagator
+   */
+  template<class View>
+  forceinline
+  LexNq<View>::LexNq(Home home, ViewArray<View>& xv, ViewArray<View>& yv)
+    : Propagator(home), 
+      x0(xv[xv.size()-2]), y0(yv[xv.size()-2]),
+      x1(xv[xv.size()-1]), y1(yv[xv.size()-1]),
+      x(xv), y(yv) {
+    int n = x.size();
+    assert(n > 1);
+    assert(n == y.size());
+    x.size(n-2); y.size(n-2);
+    x0.subscribe(home,*this,PC_INT_VAL); y0.subscribe(home,*this,PC_INT_VAL);
+    x1.subscribe(home,*this,PC_INT_VAL); y1.subscribe(home,*this,PC_INT_VAL);
+  }
+
+  template<class View>
+  PropCost
+  LexNq<View>::cost(const Space&, const ModEventDelta&) const {
+    return PropCost::binary(PropCost::HI);
+  }
+
+  template<class View>
+  forceinline
+  LexNq<View>::LexNq(Space& home, bool share, LexNq<View>& p)
+    : Propagator(home,share,p) {
+    x0.update(home,share,p.x0); y0.update(home,share,p.y0);
+    x1.update(home,share,p.x1); y1.update(home,share,p.y1);
+    x.update(home,share,p.x); y.update(home,share,p.y);
+  }
+
+  template<class View>
+  Actor*
+  LexNq<View>::copy(Space& home, bool share) {
+    /*
+    int n = x.size();
+    if (n > 0) {
+      // Eliminate all equal views and keep one disequal pair
+      for (int i=n; i--; )
+        switch (rtest_eq_bnd(x[i],y[i])) {
+        case RT_TRUE:
+          // Eliminate equal pair
+          n--; x[i]=x[n]; y[i]=y[n];
+          break;
+        case RT_FALSE:
+          // Just keep a single disequal pair
+          n=1; x[0]=x[i]; y[0]=y[i];
+          goto done;
+        case RT_MAYBE:
+          break;
+        default:
+          GECODE_NEVER;
+        }
+    done:
+      x.size(n); y.size(n);
+    }
+    */
+    return new (home) LexNq<View>(home,share,*this);
+  }
+
+  template<class View>
+  inline ExecStatus
+  LexNq<View>::post(Home home, ViewArray<View>& x, ViewArray<View>& y) {
+    if (x.size() != y.size())
+      return ES_OK;
+    int n = x.size();
+    if (n > 0) {
+      // Eliminate all equal views
+      for (int i=n; i--; )
+        switch (rtest_eq_bnd(x[i],y[i])) {
+        case RT_TRUE:
+          // Eliminate equal pair
+          n--; x[i]=x[n]; y[i]=y[n];
+          break;
+        case RT_FALSE:
+          return ES_OK;
+        case RT_MAYBE:
+          if (same(x[i],y[i])) {
+            // Eliminate equal pair
+            n--; x[i]=x[n]; y[i]=y[n];
+          }
+          break;
+        default:
+          GECODE_NEVER;
+        }
+      x.size(n); y.size(n);
+    }
+    if (n == 0)
+      return ES_FAILED;
+    if (n == 1)
+      return Nq<View>::post(home,x[0],y[0]);
+    (void) new (home) LexNq(home,x,y);
+    return ES_OK;
+  }
+
+  template<class View>
+  forceinline size_t
+  LexNq<View>::dispose(Space& home) {
+    x0.cancel(home,*this,PC_INT_VAL); y0.cancel(home,*this,PC_INT_VAL);
+    x1.cancel(home,*this,PC_INT_VAL); y1.cancel(home,*this,PC_INT_VAL);
+    (void) Propagator::dispose(home);
+    return sizeof(*this);
+  }
+
+  template<class View>
+  forceinline ExecStatus
+  LexNq<View>::resubscribe(Space& home, 
+                           RelTest rt, View& x0, View& y0, View x1, View y1) {
+    if (rt == RT_TRUE) {
+      assert(x0.assigned() && y0.assigned());
+      assert(x0.val() == y0.val());
+      int n = x.size();
+      for (int i=n; i--; )
+        switch (rtest_eq_bnd(x[i],y[i])) {
+        case RT_TRUE:
+          // Eliminate equal pair
+          n--; x[i]=x[n]; y[i]=y[n];
+          break;
+        case RT_FALSE:
+          return home.ES_SUBSUMED(*this);
+        case RT_MAYBE:
+          // Move to x0, y0 and subscribe
+          x0=x[i]; y0=y[i];
+          n--; x[i]=x[n]; y[i]=y[n];
+          x.size(n); y.size(n);
+          x0.subscribe(home,*this,PC_INT_VAL,false);
+          y0.subscribe(home,*this,PC_INT_VAL,false);
+          return ES_FIX;
+        default:
+          GECODE_NEVER;
+        }
+      // No more views to subscribe to left
+      GECODE_REWRITE(*this,Nq<View>::post(home,x1,y1));
+    }
+    return ES_FIX;
+  }
+
+  template<class View>
+  ExecStatus
+  LexNq<View>::propagate(Space& home, const ModEventDelta&) {
+    RelTest rt0 = rtest_eq_bnd(x0,y0);
+    if (rt0 == RT_FALSE)
+      return home.ES_SUBSUMED(*this);
+    RelTest rt1 = rtest_eq_bnd(x1,y1);
+    if (rt1 == RT_FALSE)
+      return home.ES_SUBSUMED(*this);
+    GECODE_ES_CHECK(resubscribe(home,rt0,x0,y0,x1,y1));
+    GECODE_ES_CHECK(resubscribe(home,rt1,x1,y1,x0,y0));
+    return ES_FIX;
+  }
+
+
+}}}
+
+// STATISTICS: int-prop

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/int/rel/lq-le.hpp

@@ -0,0 +1,537 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *     Gabor Szokoli <szokoli@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2003
+ *     Gabor Szokoli, 2003
+ *
+ *  Last modified:
+ *     $Date: 2011-07-14 02:58:53 +1000 (Thu, 14 Jul 2011) $ by $Author: tack $
+ *     $Revision: 12196 $
+ *
+ *  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 Int { namespace Rel {
+
+  /*
+   * Less or equal propagator
+   *
+   */
+
+  template<class View>
+  forceinline
+  Lq<View>::Lq(Home home, View x0, View x1)
+    : BinaryPropagator<View,PC_INT_BND>(home,x0,x1) {}
+
+  template<class View>
+  ExecStatus
+  Lq<View>::post(Home home, View x0, View x1) {
+    GECODE_ME_CHECK(x0.lq(home,x1.max()));
+    GECODE_ME_CHECK(x1.gq(home,x0.min()));
+    if (!same(x0,x1) && (x0.max() > x1.min()))
+      (void) new (home) Lq<View>(home,x0,x1);
+    return ES_OK;
+  }
+
+  template<class View>
+  forceinline
+  Lq<View>::Lq(Space& home, bool share, Lq<View>& p)
+    : BinaryPropagator<View,PC_INT_BND>(home,share,p) {}
+
+  template<class View>
+  Actor*
+  Lq<View>::copy(Space& home, bool share) {
+    return new (home) Lq<View>(home,share,*this);
+  }
+
+  template<class View>
+  ExecStatus
+  Lq<View>::propagate(Space& home, const ModEventDelta&) {
+    GECODE_ME_CHECK(x0.lq(home,x1.max()));
+    GECODE_ME_CHECK(x1.gq(home,x0.min()));
+    return (x0.max() <= x1.min()) ? home.ES_SUBSUMED(*this) : ES_FIX;
+  }
+
+
+
+
+  /*
+   * Less propagator
+   *
+   */
+  template<class View>
+  forceinline
+  Le<View>::Le(Home home, View x0, View x1)
+    : BinaryPropagator<View,PC_INT_BND>(home,x0,x1) {}
+
+  template<class View>
+  ExecStatus
+  Le<View>::post(Home home, View x0, View x1) {
+    if (same(x0,x1))
+      return ES_FAILED;
+    GECODE_ME_CHECK(x0.le(home,x1.max()));
+    GECODE_ME_CHECK(x1.gr(home,x0.min()));
+    if (x0.max() >= x1.min())
+      (void) new (home) Le<View>(home,x0,x1);
+    return ES_OK;
+  }
+
+  template<class View>
+  forceinline
+  Le<View>::Le(Space& home, bool share, Le<View>& p)
+    : BinaryPropagator<View,PC_INT_BND>(home,share,p) {}
+
+  template<class View>
+  Actor*
+  Le<View>::copy(Space& home, bool share) {
+    return new (home) Le<View>(home,share,*this);
+  }
+
+  template<class View>
+  ExecStatus
+  Le<View>::propagate(Space& home, const ModEventDelta&) {
+    GECODE_ME_CHECK(x0.le(home,x1.max()));
+    GECODE_ME_CHECK(x1.gr(home,x0.min()));
+    return (x0.max() < x1.min()) ? home.ES_SUBSUMED(*this) : ES_FIX;
+  }
+
+
+
+  /*
+   * Nary less and less or equal propagator
+   *
+   */
+
+  template<class View, int o>
+  forceinline
+  NaryLqLe<View,o>::Index::Index(Space& home, Propagator& p,
+                                 Council<Index>& c, int i0)
+    : Advisor(home,p,c), i(i0) {}
+
+  template<class View, int o>
+  forceinline
+  NaryLqLe<View,o>::Index::Index(Space& home, bool share, Index& a)
+    : Advisor(home,share,a), i(a.i) {}
+
+
+
+  template<class View, int o>
+  forceinline
+  NaryLqLe<View,o>::Pos::Pos(int p0, Pos* n)
+    : FreeList(n), p(p0) {}
+
+  template<class View, int o>
+  forceinline typename NaryLqLe<View,o>::Pos*
+  NaryLqLe<View,o>::Pos::next(void) const {
+    return static_cast<Pos*>(FreeList::next());
+  }
+
+  template<class View, int o>
+  forceinline void
+  NaryLqLe<View,o>::Pos::operator delete(void*) {}
+
+  template<class View, int o>
+  forceinline void
+  NaryLqLe<View,o>::Pos::operator delete(void*, Space&) {
+    GECODE_NEVER;
+  }
+
+  template<class View, int o>
+  forceinline void*
+  NaryLqLe<View,o>::Pos::operator new(size_t, Space& home) {
+    return home.fl_alloc<sizeof(Pos)>();
+  }
+
+  template<class View, int o>
+  forceinline void
+  NaryLqLe<View,o>::Pos::dispose(Space& home) {
+    home.fl_dispose<sizeof(Pos)>(this,this);
+  }
+
+
+  template<class View, int o>
+  forceinline bool
+  NaryLqLe<View,o>::empty(void) const {
+    return pos == NULL;
+  }
+  template<class View, int o>
+  forceinline void
+  NaryLqLe<View,o>::push(Space& home, int p) {
+    // Try to avoid entering same position twice
+    if ((pos != NULL) && (pos->p == p))
+      return;
+    pos = new (home) Pos(p,pos);
+  }
+  template<class View, int o>
+  forceinline int
+  NaryLqLe<View,o>::pop(Space& home) {
+    Pos* t = pos;
+    int p = t->p;
+    pos = pos->next();
+    t->dispose(home);
+    return p;
+  }
+
+  template<class View, int o>
+  forceinline
+  NaryLqLe<View,o>::NaryLqLe(Home home, ViewArray<View>& x)
+    : NaryPropagator<View,PC_INT_NONE>(home,x), 
+      c(home), pos(NULL), run(false), n_subsumed(0) {
+    for (int i=x.size(); i--; )
+      x[i].subscribe(home, *new (home) Index(home,*this,c,i));
+  }
+
+  template<class View, int o>
+  ExecStatus
+  NaryLqLe<View,o>::post(Home home, ViewArray<View>& x) {
+    assert((o == 0) || (o == 1));
+    // Check for sharing
+    if (x.same(home)) {
+      if (o == 1)
+        return ES_FAILED;
+      /*
+       * Eliminate sharing: if a view occurs twice, all views in between
+       * must be equal.
+       */
+      int n = x.size();
+      for (int i=0; i<n; i++)
+        for (int j=n-1; j>i; j--)
+          if (same(x[i],x[j])) {
+            if (i+1 != j) {
+              // Create equality propagator for elements i+1 ... j
+              ViewArray<View> y(home,j-i);
+              for (int k=j-i; k--; )
+                y[k] = x[i+1+k];
+              GECODE_ES_CHECK(NaryEqBnd<View>::post(home,y));
+            }
+            for (int k=0; k<n-1-j-1+1; k++)
+              x[i+1+k]=x[j+1+k];
+            n -= j-i;
+          }
+      x.size(n);
+    }
+        
+    // Propagate one round
+    for (int i=1; i<x.size(); i++)
+      GECODE_ME_CHECK(x[i].gq(home,x[i-1].min()+o));
+    for (int i=x.size()-1; i--;)
+      GECODE_ME_CHECK(x[i].lq(home,x[i+1].max()-o));
+    // Eliminate redundant variables
+    {
+      // Eliminate at beginning
+      {
+        int i=0;
+        while ((i+1 < x.size()) && (x[i].max()+o <= x[i+1].min()))
+          i++;
+        x.drop_fst(i);
+      }
+      // Eliminate at end
+      {
+        int i=x.size()-1;
+        while ((i > 0) && (x[i-1].max()+o <= x[i].min()))
+          i--;
+        x.drop_lst(i);
+      }
+      // Eliminate in the middle
+      if (x.size() > 1) {
+        int j=1;
+        for (int i=1; i+1<x.size(); i++)
+          if ((x[j-1].max()+o > x[i].min()) ||
+              (x[i].max()+o > x[i+1].min()))
+            x[j++]=x[i];
+        x[j++]=x[x.size()-1];
+        x.size(j);
+      }
+    }
+    if (x.size() == 2) {
+      if (o == 0)
+        return Lq<View>::post(home,x[0],x[1]);
+      else
+        return Le<View>::post(home,x[0],x[1]);
+    } else if (x.size() >= 2) {
+      (void) new (home) NaryLqLe<View,o>(home,x);
+    }
+    return ES_OK;
+  }
+
+  template<class View, int o>
+  forceinline
+  NaryLqLe<View,o>::NaryLqLe(Space& home, bool share, NaryLqLe<View,o>& p)
+    : NaryPropagator<View,PC_INT_NONE>(home,share,p), 
+      pos(NULL), run(false), n_subsumed(p.n_subsumed) {
+    assert(p.pos == NULL);
+    c.update(home, share, p.c);
+  }
+
+  template<class View, int o>
+  Actor*
+  NaryLqLe<View,o>::copy(Space& home, bool share) {
+    if (n_subsumed > n_threshold) {
+      Region r(home);
+      // Record for which views there is an advisor
+      Support::BitSet<Region> a(r,static_cast<unsigned int>(x.size()));
+      for (Advisors<Index> as(c); as(); ++as)
+        a.set(static_cast<unsigned int>(as.advisor().i));
+      // Compact view array and compute map for advisors
+      int* m = r.alloc<int>(x.size());
+      int j=0;
+      for (int i=0; i<x.size(); i++)
+        if (a.get(static_cast<unsigned int>(i))) {
+          m[i] = j; x[j++] = x[i];
+        }
+      x.size(j);
+      // Remap advisors
+      for (Advisors<Index> as(c); as(); ++as)
+        as.advisor().i = m[as.advisor().i];
+      
+      n_subsumed = 0;
+    }
+    return new (home) NaryLqLe<View,o>(home,share,*this);
+  }
+
+  template<class View, int o>
+  PropCost
+  NaryLqLe<View,o>::cost(const Space&, const ModEventDelta&) const {
+    return PropCost::binary(PropCost::HI);
+  }
+
+  template<class View, int o>
+  forceinline size_t
+  NaryLqLe<View,o>::dispose(Space& home) {
+    for (Advisors<Index> as(c); as(); ++as)
+      x[as.advisor().i].cancel(home,as.advisor());
+    c.dispose(home);
+    while (!empty())
+      (void) pop(home);
+    (void) NaryPropagator<View,PC_INT_NONE>::dispose(home);
+    return sizeof(*this);
+  }
+
+
+  template<class View, int o>
+  ExecStatus
+  NaryLqLe<View,o>::advise(Space& home, Advisor& _a, const Delta& d) {
+    Index& a = static_cast<Index&>(_a);
+    const int i = a.i;
+    switch (View::modevent(d)) {
+    case ME_INT_VAL:
+      a.dispose(home,c);
+      n_subsumed++;
+      break;
+    case ME_INT_BND:
+      if (((i == 0) || (x[i-1].max()+o <= x[i].min())) &&
+          ((i == x.size()-1) || (x[i].max()+o <= x[i+1].min()))) {
+        x[i].cancel(home,a);
+        a.dispose(home,c);
+        n_subsumed++;
+        return (run || (n_subsumed + 1 < x.size())) ? ES_FIX : ES_NOFIX;
+      }
+      break;
+    default:
+      return ES_FIX;
+    }
+    if (run)
+      return ES_FIX;
+    if (((i < x.size()-1) && (x[i+1].min() < x[i].min()+o)) ||
+        ((i > 0) && (x[i-1].max() > x[i].max()-o))) {
+      push(home,i);
+      return ES_NOFIX;
+    }
+    return (n_subsumed+1 >= x.size()) ? ES_NOFIX : ES_FIX;
+  }
+
+  template<class View, int o>
+  ExecStatus
+  NaryLqLe<View,o>::propagate(Space& home, const ModEventDelta&) {
+    run = true;
+    int n = x.size();
+    while (!empty()) {
+      int p = pop(home);
+      for (int i=p; i<n-1; i++) {
+        ModEvent me = x[i+1].gq(home,x[i].min()+o);
+        if (me_failed(me))
+          return ES_FAILED;
+        if (!me_modified(me))
+          break;
+      }
+      for (int i=p; i>0; i--) {
+        ModEvent me = x[i-1].lq(home,x[i].max()-o);
+        if (me_failed(me))
+          return ES_FAILED;
+        if (!me_modified(me))
+          break;
+      }
+    }
+#ifdef GECODE_AUDIT
+    for (int i=0; i<n-1; i++)
+      assert(!me_modified(x[i+1].gq(home,x[i].min()+o)));
+    for (int i=n-1; i>0; i--)
+      assert(!me_modified(x[i-1].lq(home,x[i].max()-o)));
+#endif
+    if (n_subsumed+1 >= n)
+      return home.ES_SUBSUMED(*this);
+    run = false;
+    return ES_FIX;
+  }
+
+
+
+  /*
+   * Reified less or equal propagator
+   *
+   */
+
+  template<class View, class CtrlView>
+  forceinline
+  ReLq<View,CtrlView>::ReLq(Home home, View x0, View x1, CtrlView b)
+    : ReBinaryPropagator<View,PC_INT_BND,CtrlView>(home,x0,x1,b) {}
+
+  template<class View, class CtrlView>
+  ExecStatus
+  ReLq<View,CtrlView>::post(Home home, View x0, View x1, CtrlView b) {
+    if (b.one())
+      return Lq<View>::post(home,x0,x1);
+    if (b.zero())
+      return Le<View>::post(home,x1,x0);
+    if (!same(x0,x1)) {
+      switch (rtest_lq(x0,x1)) {
+      case RT_TRUE:
+        GECODE_ME_CHECK(b.one_none(home)); break;
+      case RT_FALSE:
+        GECODE_ME_CHECK(b.zero_none(home)); break;
+      case RT_MAYBE:
+        (void) new (home) ReLq<View,CtrlView>(home,x0,x1,b); break;
+      default: GECODE_NEVER;
+      }
+    } else {
+      GECODE_ME_CHECK(b.one_none(home));
+    }
+    return ES_OK;
+  }
+
+  template<class View, class CtrlView>
+  forceinline
+  ReLq<View,CtrlView>::ReLq(Space& home, bool share, ReLq& p)
+    : ReBinaryPropagator<View,PC_INT_BND,CtrlView>(home,share,p) {}
+
+  template<class View, class CtrlView>
+  Actor*
+  ReLq<View,CtrlView>::copy(Space& home, bool share) {
+    return new (home) ReLq<View,CtrlView>(home,share,*this);
+  }
+
+  template<class View, class CtrlView>
+  ExecStatus
+  ReLq<View,CtrlView>::propagate(Space& home, const ModEventDelta&) {
+    if (b.one())
+      GECODE_REWRITE(*this,Lq<View>::post(home(*this),x0,x1));
+    if (b.zero())
+      GECODE_REWRITE(*this,Le<View>::post(home(*this),x1,x0));
+    switch (rtest_lq(x0,x1)) {
+    case RT_TRUE:
+      GECODE_ME_CHECK(b.one_none(home));  return home.ES_SUBSUMED(*this);
+    case RT_FALSE:
+      GECODE_ME_CHECK(b.zero_none(home)); return home.ES_SUBSUMED(*this);
+    case RT_MAYBE:
+      break;
+    default: GECODE_NEVER;
+    }
+    return ES_FIX;
+  }
+
+  /*
+   * Reified less or equal propagator involving one variable
+   *
+   */
+
+  template<class View, class CtrlView>
+  forceinline
+  ReLqInt<View,CtrlView>::ReLqInt(Home home, View x, int c0, CtrlView b)
+    : ReUnaryPropagator<View,PC_INT_BND,CtrlView>(home,x,b), c(c0) {}
+
+  template<class View, class CtrlView>
+  ExecStatus
+  ReLqInt<View,CtrlView>::post(Home home, View x, int c, CtrlView b) {
+    if (b.one()) {
+      GECODE_ME_CHECK(x.lq(home,c));
+    } else if (b.zero()) {
+      GECODE_ME_CHECK(x.gr(home,c));
+    } else {
+      switch (rtest_lq(x,c)) {
+      case RT_TRUE:
+        GECODE_ME_CHECK(b.one_none(home)); break;
+      case RT_FALSE:
+        GECODE_ME_CHECK(b.zero_none(home)); break;
+      case RT_MAYBE:
+        (void) new (home) ReLqInt<View,CtrlView>(home,x,c,b); break;
+      default: GECODE_NEVER;
+      }
+    }
+    return ES_OK;
+  }
+
+
+  template<class View, class CtrlView>
+  forceinline
+  ReLqInt<View,CtrlView>::ReLqInt(Space& home, bool share, ReLqInt& p)
+    : ReUnaryPropagator<View,PC_INT_BND,CtrlView>(home,share,p), c(p.c) {}
+
+  template<class View, class CtrlView>
+  Actor*
+  ReLqInt<View,CtrlView>::copy(Space& home, bool share) {
+    return new (home) ReLqInt<View,CtrlView>(home,share,*this);
+  }
+
+  template<class View, class CtrlView>
+  ExecStatus
+  ReLqInt<View,CtrlView>::propagate(Space& home, const ModEventDelta&) {
+    if (b.one()) {
+      GECODE_ME_CHECK(x0.lq(home,c)); goto subsumed;
+    }
+    if (b.zero()) {
+      GECODE_ME_CHECK(x0.gr(home,c)); goto subsumed;
+    }
+    switch (rtest_lq(x0,c)) {
+    case RT_TRUE:
+      GECODE_ME_CHECK(b.one_none(home)); goto subsumed;
+    case RT_FALSE:
+      GECODE_ME_CHECK(b.zero_none(home)); goto subsumed;
+    case RT_MAYBE:
+      break;
+    default: GECODE_NEVER;
+    }
+    return ES_FIX;
+  subsumed:
+    return home.ES_SUBSUMED(*this);
+  }
+
+}}}
+
+// STATISTICS: int-prop
+