dep-selector-libgecode 1.0.0.alpha.0

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/int/distinct.cpp

@@ -0,0 +1,97 @@
+/* -*- 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, 2002
+ *     Gabor Szokoli, 2003
+ *
+ *  Last modified:
+ *     $Date: 2011-08-18 06:25:49 +1000 (Thu, 18 Aug 2011) $ by $Author: schulte $
+ *     $Revision: 12308 $
+ *
+ *  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.
+ *
+ */
+
+#include <gecode/int/distinct.hh>
+
+namespace Gecode {
+
+  using namespace Int;
+
+  void
+  distinct(Home home, const IntVarArgs& x, IntConLevel icl) {
+    if (x.same(home))
+      throw ArgumentSame("Int::distinct");
+    if (home.failed()) return;
+    ViewArray<IntView> xv(home,x);
+    switch (icl) {
+    case ICL_BND:
+      GECODE_ES_FAIL(Distinct::Bnd<IntView>::post(home,xv));
+      break;
+    case ICL_DOM:
+      GECODE_ES_FAIL(Distinct::Dom<IntView>::post(home,xv));
+      break;
+    default:
+      GECODE_ES_FAIL(Distinct::Val<IntView>::post(home,xv));
+    }
+  }
+
+  void
+  distinct(Home home, const IntArgs& c, const IntVarArgs& x,
+           IntConLevel icl) {
+    if (x.same(home))
+      throw ArgumentSame("Int::distinct");
+    if (c.size() != x.size())
+      throw ArgumentSizeMismatch("Int::distinct");
+    if (home.failed()) return;
+    ViewArray<OffsetView> cx(home,x.size());
+    for (int i = c.size(); i--; ) {
+      double cx_min = (static_cast<double>(c[i]) +
+                       static_cast<double>(x[i].min()));
+      double cx_max = (static_cast<double>(c[i]) +
+                       static_cast<double>(x[i].max()));
+      Limits::check(c[i],"Int::distinct");
+      Limits::check(cx_min,"Int::distinct");
+      Limits::check(cx_max,"Int::distinct");
+      cx[i] = OffsetView(x[i],c[i]);
+    }
+    switch (icl) {
+    case ICL_BND:
+      GECODE_ES_FAIL(Distinct::Bnd<OffsetView>::post(home,cx));
+      break;
+    case ICL_DOM:
+      GECODE_ES_FAIL(Distinct::Dom<OffsetView>::post(home,cx));
+      break;
+    default:
+      GECODE_ES_FAIL(Distinct::Val<OffsetView>::post(home,cx));
+    }
+  }
+
+}
+
+// STATISTICS: int-post

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/int/distinct.hh

@@ -0,0 +1,314 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *     Guido Tack <tack@gecode.org>
+ *
+ *  Contributing authors:
+ *     Gabor Szokoli <szokoli@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2002
+ *     Guido Tack, 2004
+ *     Gabor Szokoli, 2003
+ *
+ *  Last modified:
+ *     $Date: 2011-10-07 02:27:42 +1100 (Fri, 07 Oct 2011) $ by $Author: schulte $
+ *     $Revision: 12423 $
+ *
+ *  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.
+ *
+ */
+
+#ifndef __GECODE_INT_DISTINCT_HH__
+#define __GECODE_INT_DISTINCT_HH__
+
+#include <gecode/int.hh>
+
+#include <gecode/int/view-val-graph.hh>
+#include <gecode/int/rel.hh>
+
+/**
+ * \namespace Gecode::Int::Distinct
+ * \brief %Distinct propagators
+ */
+
+namespace Gecode { namespace Int { namespace Distinct {
+
+  /**
+   * \brief Naive value distinct propagator
+   *
+   * Eliminates values of assigned views of type \a View.
+   *
+   * Requires \code #include <gecode/int/distinct.hh> \endcode
+   * \ingroup FuncIntProp
+   */
+  template<class View>
+  class Val : public NaryPropagator<View,PC_INT_VAL> {
+  protected:
+    using NaryPropagator<View,PC_INT_VAL>::x;
+
+    /// Constructor for posting
+    Val(Home home, ViewArray<View>& x);
+    /// Constructor for cloning \a p
+    Val(Space& home, bool share, Val<View>& p);
+  public:
+    /// Copy propagator during cloning
+    virtual Actor*     copy(Space& home, bool share);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
+    /// Post propagator for view array \a x
+    static ExecStatus post(Home home, ViewArray<View>& x);
+  };
+
+  /**
+   * \brief Eliminate singletons by naive value propagation
+   *
+   * This is actually the propagation algorithm for Distinct::Val.
+   * It is available as separate function as it is reused for
+   * both bounds consistent and domain consistent distinct
+   * propagators.
+   *
+   * If \a complete is true, computes fixpoint, otherwise might not
+   * compute fixpoint. This can be helpful when used together with
+   * bounds or domain propagation to protect from pathological cases
+   * which can be handled more efficiently with bounds propagation.
+   */
+  template<class View, bool complete>
+  ExecStatus prop_val(Space& home, ViewArray<View>&);
+
+
+
+  /**
+   * \brief Bounds consistent distinct propagator
+   *
+   * The propagator uses staging: first it uses naive value-based
+   * propagation and only then uses bounds consistent propagation.
+   * Due to using naive value-based propagation, the propagator
+   * might actually achieve stronger consistency than just
+   * bounds consistency.
+   *
+   * The algorithm is taken from:
+   *        A. Lopez-Ortiz, C.-G. Quimper, J. Tromp, and P. van Beek.
+   *        A fast and simple algorithm for bounds consistency of the
+   *        alldifferent constraint. IJCAI-2003.
+   *
+   * This implementation uses the code that is provided by
+   * Peter Van Beek:
+   *   http://ai.uwaterloo.ca/~vanbeek/software/software.html
+   * The code (originally by John Tromp) here has only been slightly modified
+   * to fit %Gecode (taking idempotent/non-idempotent propagation into account)
+   * and uses a more efficient layout of datastructures (keeping the number
+   * of different arrays small).
+   *
+   * Requires \code #include <gecode/int/distinct.hh> \endcode
+   * \ingroup FuncIntProp
+   */
+  template<class View>
+  class Bnd : public Propagator {
+  protected:
+    /// Views on which to perform bounds-propagation
+    ViewArray<View> x;
+    /// Views on which to perform value-propagation (subset of \c x)
+    ViewArray<View> y;
+    /// Minimum (approximation) of view in \a x
+    int min_x;
+    /// Maximum (approximation) of view in \a x
+    int max_x;
+    /// Constructor for posting
+    Bnd(Home home, ViewArray<View>& x);
+    /// Constructor for cloning \a p
+    Bnd(Space& home, bool share, Bnd<View>& p);
+  public:
+    /// Post propagator for view array \a x
+    static ExecStatus post(Home home, ViewArray<View>& x);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
+    /**
+     * \brief Cost function
+     *
+     * If in stage for naive value propagation, the cost is
+     * low linear. Otherwise it is low quadratic.
+     */
+    virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
+    /// Copy propagator during cloning
+    virtual Actor* copy(Space& home, bool share);
+    /// Destructor
+    virtual size_t dispose(Space& home);
+  };
+
+  /**
+   * \brief Perform bounds consistent distinct propagation
+   *
+   * This is actually the propagation algorithm for Distinct::Bnd.
+   * It is available as separate function as it is reused for
+   * both bounds consistent and domain consistent distinct
+   * propagators.
+   */
+  template<class View>
+  ExecStatus prop_bnd(Space& home, ViewArray<View>& x, int& min_x, int& max_x);
+
+  /**
+   * \brief Perform bounds consistent distinct propagation
+   *
+   * This is actually the propagation algorithm for Distinct::Bnd.
+   * It is available as separate function as it is reused for
+   * both bounds consistent and domain consistent distinct
+   * propagators.
+   */
+  template<class View>
+  ExecStatus prop_bnd(Space& home, ViewArray<View>& x);
+
+
+  /// View-value graph for propagation
+  template<class View>
+  class Graph : public ViewValGraph::Graph<View> {
+  public:
+    using ViewValGraph::Graph<View>::view;
+    using ViewValGraph::Graph<View>::n_view;
+    using ViewValGraph::Graph<View>::val;
+    using ViewValGraph::Graph<View>::n_val;
+    using ViewValGraph::Graph<View>::count;
+    using ViewValGraph::Graph<View>::scc;
+    using ViewValGraph::Graph<View>::match;
+    /// Construct graph as not yet initialized
+    Graph(void);
+    /// Initialize graph
+    ExecStatus init(Space& home, ViewArray<View>& x);
+    /// Mark edges in graph, return true if pruning is at all possible
+    bool mark(Space& home);
+    /// Prune unmarked edges, \a assigned is true if a view got assigned
+    ExecStatus prune(Space& home, bool& assigned);
+    /// Synchronize graph with new view domains
+    bool sync(Space& home);
+  };
+
+  /**
+   * \brief Propagation controller for domain consistent distinct
+   *
+   * The propagation controller provides convenient access to
+   * performing incremental domain consistent distinct propagation
+   * so that the routines can be reused easily.
+   *
+   * Requires \code #include <gecode/int/distinct.hh> \endcode
+   * \ingroup FuncIntProp
+   */
+  template<class View>
+  class DomCtrl {
+  protected:
+    /// Propagation is performed on a view-value graph
+    Graph<View> g;
+  public:
+    /// Initialize with non-initialized view-value graph
+    DomCtrl(void);
+    /// Check whether a view-value graph is available
+    bool available(void);
+    /// Initialize view-value graph for views \a x
+    ExecStatus init(Space& home, ViewArray<View>& x);
+    /// Synchronize available view-value graph
+    ExecStatus sync(Space& home);
+    /// Perform propagation, \a assigned is true if a view gets assigned
+    ExecStatus propagate(Space& home, bool& assigned);
+  };
+
+  /**
+   * \brief Domain consistent distinct propagator
+   *
+   * The propagator uses staging: first it uses naive value-based
+   * propagation and only then uses domain consistent propagation.
+   *
+   * The algorithm is taken from:
+   *    Jean-Charles R�gin, A filtering algorithm for constraints
+   *    of difference in CSPs, Proceedings of the Twelfth National
+   *    Conference on Artificial Intelligence, pages 362--367.
+   *    Seattle, WA, USA, 1994.
+   *
+   * Requires \code #include <gecode/int/distinct.hh> \endcode
+   * \ingroup FuncIntProp
+   */
+  template<class View>
+  class Dom : public NaryPropagator<View,PC_INT_DOM> {
+  protected:
+    using NaryPropagator<View,PC_INT_DOM>::x;
+    /// Propagation controller
+    DomCtrl<View> dc;
+    /// Constructor for cloning \a p
+    Dom(Space& home, bool share, Dom<View>& p);
+    /// Constructor for posting
+    Dom(Home home, ViewArray<View>& x);
+  public:
+    /// Perform propagation
+    virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
+    /**
+     * \brief Cost function
+     *
+     * If in stage for naive value propagation, the cost is
+     * low linear. Otherwise it is high quadratic.
+     */
+    virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
+    /// Copy propagator during cloning
+    virtual Actor* copy(Space& home, bool share);
+    /// Post propagator for views \a x
+    static ExecStatus post(Home home, ViewArray<View>& x);
+  };
+
+  /**
+   * \brief Ternary domain consistent distinct propagator
+   *
+   * Requires \code #include <gecode/int/distinct.hh> \endcode
+   * \ingroup FuncIntProp
+   */
+  template<class View>
+  class TerDom : public TernaryPropagator<View,PC_INT_DOM> {
+  protected:
+    using TernaryPropagator<View,PC_INT_DOM>::x0;
+    using TernaryPropagator<View,PC_INT_DOM>::x1;
+    using TernaryPropagator<View,PC_INT_DOM>::x2;
+
+    /// Constructor for cloning \a p
+    TerDom(Space& home, bool share, TerDom<View>& p);
+    /// Constructor for posting
+    TerDom(Home home, View x0, View x1, View x2);
+  public:
+    /// Perform propagation
+    virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
+    /// Copy propagator during cloning
+    virtual Actor* copy(Space& home, bool share);
+    /// Post propagator for views \a x
+    static  ExecStatus post(Home home, View x0, View x1, View x2);
+  };
+
+}}}
+
+#include <gecode/int/distinct/val.hpp>
+#include <gecode/int/distinct/bnd.hpp>
+#include <gecode/int/distinct/ter-dom.hpp>
+#include <gecode/int/distinct/graph.hpp>
+#include <gecode/int/distinct/dom-ctrl.hpp>
+#include <gecode/int/distinct/dom.hpp>
+
+#endif
+
+// STATISTICS: int-prop
+

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/int/distinct/bnd.hpp

@@ -0,0 +1,444 @@
+/* -*- 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-10-10 00:06:06 +1100 (Mon, 10 Oct 2011) $ by $Author: schulte $
+ *     $Revision: 12431 $
+ *
+ *  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 Distinct {
+
+  template<class View>
+  forceinline
+  Bnd<View>::Bnd(Home home, ViewArray<View>& x0)
+    : Propagator(home), x(x0), y(home,x0) {
+    // Both x and y initially contain the same variables
+    //  - x is used for bounds propagation
+    //  - y is used for performing singleton propagation
+    // They can not be shared as singleton propagation removes
+    // determined variables still required for bounds propagation.
+    y.subscribe(home,*this,PC_INT_BND);
+    int min = x[x.size()-1].min(), max = x[x.size()-1].max();
+    for (int i=x.size()-1; i--; ) {
+      min = std::min(min,x[i].min());
+      max = std::max(max,x[i].max());
+    }
+    min_x = min; max_x = max;
+  }
+
+  template<class View>
+  forceinline size_t
+  Bnd<View>::dispose(Space& home) {
+    y.cancel(home,*this,PC_INT_BND);
+    (void) Propagator::dispose(home);
+    return sizeof(*this);
+  }
+
+  template<class View>
+  forceinline
+  Bnd<View>::Bnd(Space& home, bool share, Bnd<View>& p)
+    : Propagator(home,share,p), min_x(p.min_x), max_x(p.max_x) {
+    x.update(home,share,p.x);
+    y.update(home,share,p.y);
+  }
+
+  template<class View>
+  Actor*
+  Bnd<View>::copy(Space& home, bool share) {
+    return new (home) Bnd<View>(home,share,*this);
+  }
+
+  template<class View>
+  PropCost
+  Bnd<View>::cost(const Space&, const ModEventDelta& med) const {
+    if (View::me(med) == ME_INT_VAL)
+      return PropCost::linear(PropCost::LO, y.size());
+    else
+      return PropCost::quadratic(PropCost::LO, x.size());
+  }
+
+
+  /// %Rank information
+  class Rank {
+  public:
+    int min, max;
+  };
+
+  /// Sort-order by increasing maximum (by index)
+  template<class View>
+  class MaxIncIdx {
+  protected:
+    ViewArray<View> x;
+  public:
+    forceinline
+    MaxIncIdx(const ViewArray<View>& x0) : x(x0) {}
+    forceinline bool
+    operator ()(const int i, const int j) {
+      return x[i].max() < x[j].max();
+    }
+  };
+
+  /// Sort-order by increasing minimum (by index)
+  template<class View>
+  class MinIncIdx {
+  protected:
+    ViewArray<View> x;
+  public:
+    forceinline 
+    MinIncIdx(const ViewArray<View>& x0) : x(x0) {}
+    forceinline bool
+    operator ()(const int i, const int j) {
+      return x[i].min() < x[j].min();
+    }
+  };
+
+  /// Sort-order by increasing minimum (direct)
+  template<class View>
+  class MinInc {
+  public:
+    forceinline bool
+    operator ()(const View& x, const View& y) {
+      return x.min() < y.min();
+    }
+  };
+
+  /// Information on Hall intervals
+  class HallInfo {
+  public:
+    int bounds, t, d, h;
+  };
+
+  forceinline void
+  pathset_t(HallInfo hall[], int start, int end, int to) {
+    int k, l;
+    for (l=start; (k=l) != end; hall[k].t=to) {
+      l = hall[k].t;
+    }
+  }
+
+  forceinline void
+  pathset_h(HallInfo hall[], int start, int end, int to) {
+    int k, l;
+    for (l=start; (k=l) != end; hall[k].h=to) {
+      l = hall[k].h;
+    }
+  }
+
+  forceinline int
+  pathmin_h(const HallInfo hall[], int i) {
+    while (hall[i].h < i)
+      i = hall[i].h;
+    return i;
+  }
+
+  forceinline int
+  pathmin_t(const HallInfo hall[], int i) {
+    while (hall[i].t < i)
+      i = hall[i].t;
+    return i;
+  }
+
+  forceinline int
+  pathmax_h(const HallInfo hall[], int i) {
+    while (hall[i].h > i)
+      i = hall[i].h;
+    return i;
+  }
+
+  forceinline int
+  pathmax_t(const HallInfo hall[], int i) {
+    while (hall[i].t > i)
+      i = hall[i].t;
+    return i;
+  }
+
+  template<class View>
+  ExecStatus
+  prop_bnd(Space& home, ViewArray<View>& x, int& min_x, int& max_x) {
+    const int n = x.size();
+
+    Region r(home);
+
+    int* minsorted = r.alloc<int>(n);
+    int* maxsorted = r.alloc<int>(n);
+
+    unsigned int d = static_cast<unsigned int>(max_x - min_x) + 1;
+
+    if (d < static_cast<unsigned int>(n))
+      return ES_FAILED;
+
+    if (d > 2*static_cast<unsigned int>(n)) {
+      for (int i = n; i--; )
+        minsorted[i]=maxsorted[i]=i;
+
+      MinIncIdx<View> min_inc(x);
+      Support::quicksort<int,MinIncIdx<View> >(minsorted, n, min_inc);
+      MaxIncIdx<View> max_inc(x);
+      Support::quicksort<int,MaxIncIdx<View> >(maxsorted, n, max_inc);
+    } else {
+
+      int* minbucket = r.alloc<int>(d);
+      int* maxbucket = r.alloc<int>(d);
+      for (unsigned int i=d; i--; )
+        minbucket[i]=maxbucket[i]=0;
+
+      for (int i=n; i--; ) {
+        minbucket[x[i].min() - min_x]++;
+        maxbucket[x[i].max() - min_x]++;
+      }
+
+      int c_min = 0, c_max = 0;
+      for (unsigned int i=0; i<d; i++) {
+        int t_min = minbucket[i];
+        int t_max = maxbucket[i];
+        minbucket[i] = c_min; c_min += t_min;
+        maxbucket[i] = c_max; c_max += t_max;
+      }
+      assert((c_min == n) && (c_max == n));
+
+      for (int i=n; i--; ) {
+        minsorted[minbucket[x[i].min() - min_x]++] = i;
+        maxsorted[maxbucket[x[i].max() - min_x]++] = i;
+      }
+    }
+
+    // Update minimum and maximum information
+    min_x = x[minsorted[0]].min();
+    max_x = x[maxsorted[n-1]].max();
+
+
+    // Setup rank and bounds info
+    HallInfo* hall = r.alloc<HallInfo>(2*n+2);
+    Rank* rank = r.alloc<Rank>(n);
+
+    int nb = 0;
+    {
+      int min  = x[minsorted[0]].min();
+      int max  = x[maxsorted[0]].max() + 1;
+      int last = min - 2;
+
+      hall[0].bounds = last;
+
+      int i = 0;
+      int j = 0;
+      while (true) {
+        if ((i < n) && (min < max)) {
+          if (min != last)
+            hall[++nb].bounds = last = min;
+          rank[minsorted[i]].min = nb;
+          if (++i < n)
+            min = x[minsorted[i]].min();
+        } else {
+          if (max != last)
+            hall[++nb].bounds = last = max;
+          rank[maxsorted[j]].max = nb;
+          if (++j == n)
+            break;
+          max = x[maxsorted[j]].max() + 1;
+        }
+      }
+      hall[nb+1].bounds = hall[nb].bounds + 2;
+    }
+
+    // If tells cross holes, we do not compute a fixpoint
+    ExecStatus es = ES_FIX;
+
+    // Propagate lower bounds
+    for (int i=nb+2; --i;) {
+      hall[i].t = hall[i].h = i-1;
+      hall[i].d = hall[i].bounds - hall[i-1].bounds;
+    }
+    for (int i=0; i<n; i++) { // visit intervals in increasing max order
+      int x0 = rank[maxsorted[i]].min;
+      int z = pathmax_t(hall, x0+1);
+      int j = hall[z].t;
+      if (--hall[z].d == 0)
+        hall[z = pathmax_t(hall, hall[z].t=z+1)].t = j;
+      pathset_t(hall, x0+1, z, z); // path compression
+      int y = rank[maxsorted[i]].max;
+      if (hall[z].d < hall[z].bounds-hall[y].bounds)
+        return ES_FAILED;
+      if (hall[x0].h > x0) {
+        int w = pathmax_h(hall, hall[x0].h);
+        int m = hall[w].bounds;
+        ModEvent me = x[maxsorted[i]].gq(home,m);
+        if (me_failed(me))
+          return ES_FAILED;
+        if ((me == ME_INT_VAL) ||
+            ((me == ME_INT_BND) && (m != x[maxsorted[i]].min())))
+          es = ES_NOFIX;
+        pathset_h(hall, x0, w, w); // path compression
+      }
+      if (hall[z].d == hall[z].bounds-hall[y].bounds) {
+        pathset_h(hall, hall[y].h, j-1, y); // mark hall interval
+        hall[y].h = j-1;
+      }
+    }
+
+    // Propagate upper bounds
+    for (int i=nb+1; i--;) {
+      hall[i].t = hall[i].h = i+1;
+      hall[i].d = hall[i+1].bounds - hall[i].bounds;
+    }
+    for (int i=n; --i>=0; ) { // visit intervals in decreasing min order
+      int x0 = rank[minsorted[i]].max;
+      int z = pathmin_t(hall, x0-1);
+      int j = hall[z].t;
+      if (--hall[z].d == 0)
+        hall[z = pathmin_t(hall, hall[z].t=z-1)].t = j;
+      pathset_t(hall, x0-1, z, z);
+      int y = rank[minsorted[i]].min;
+      if (hall[z].d < hall[y].bounds-hall[z].bounds)
+        return ES_FAILED;
+      if (hall[x0].h < x0) {
+        int w = pathmin_h(hall, hall[x0].h);
+        int m = hall[w].bounds - 1;
+        ModEvent me = x[minsorted[i]].lq(home,m);
+        if (me_failed(me))
+          return ES_FAILED;
+        if ((me == ME_INT_VAL) ||
+            ((me == ME_INT_BND) && (m != x[maxsorted[i]].min())))
+          es = ES_NOFIX;
+        pathset_h(hall, x0, w, w);
+      }
+      if (hall[z].d == hall[y].bounds-hall[z].bounds) {
+        pathset_h(hall, hall[y].h, j+1, y);
+        hall[y].h = j+1;
+      }
+    }
+
+    return es;
+  }
+
+  template<class View>
+  ExecStatus
+  prop_bnd(Space& home, ViewArray<View>& x) {
+    int min = x[x.size()-1].min(), max = x[x.size()-1].max();
+    for (int i=x.size()-1; i--; ) {
+      min = std::min(min,x[i].min());
+      max = std::max(max,x[i].max());
+    }
+    return prop_bnd(home, x, min, max);
+  }
+
+  template<class View>
+  ExecStatus
+  Bnd<View>::propagate(Space& home, const ModEventDelta& med) {
+    assert(x.size() > 1);
+
+    if (View::me(med) == ME_INT_VAL) {
+      ExecStatus es = prop_val<View,false>(home,y);
+      GECODE_ES_CHECK(es);
+      if (y.size() < 2)
+        return home.ES_SUBSUMED(*this);
+      if (es == ES_FIX)
+        return home.ES_FIX_PARTIAL(*this,View::med(ME_INT_BND));
+    }
+
+    if (y.size() == 2)
+      GECODE_REWRITE(*this,Rel::Nq<View>::post(home(*this),y[0],y[1]));
+
+    ExecStatus es = prop_bnd<View>(home,x,min_x,max_x);
+
+    GECODE_ES_CHECK(es);
+
+    const int n = x.size();
+
+    if ((n > 2*y.size()) && (n > 6)) {
+      // If there are many assigned views, try to eliminate them
+      unsigned int d = static_cast<unsigned int>(max_x - min_x) + 1;
+      if (d > 2*static_cast<unsigned int>(n)) {
+        MinInc<View> min_inc;
+        Support::quicksort<View,MinInc<View> >(&x[0], n, min_inc);
+      } else {
+        Region r(home);
+        int* minbucket = r.alloc<int>(d);
+        View* minsorted = r.alloc<View>(n);
+
+        for (unsigned int i=d; i--; )
+          minbucket[i]=0;
+        for (int i=n; i--; )
+          minbucket[x[i].min() - min_x]++;
+
+        int c_min = 0;
+        for (unsigned int i=0; i<d; i++) {
+          int t_min = minbucket[i];
+          minbucket[i] = c_min; c_min += t_min;
+        }
+        assert(c_min == n);
+
+        for (int i=n; i--;)
+          minsorted[minbucket[x[i].min() - min_x]++] = x[i];
+        for (int i=n; i--;)
+          x[i] = minsorted[i];
+      }
+
+      int i   = 0;
+      int j   = 0;
+      int max = x[0].max()-1;
+      while (i < n-1) {
+        if (!x[i].assigned() ||
+            (x[i].val() <= max) || (x[i].val() > x[i+1].min())) {
+          // Keep view x[i]
+          max = std::max(max,x[i].max());
+          x[j++]=x[i];
+        }
+        i++;
+      }
+      if (!x[i].assigned() || (x[i].val() <= max))
+        x[j++]=x[i];
+      x.size(j);
+    }
+
+    if (x.size() < 2)
+      return home.ES_SUBSUMED(*this);
+
+    if (x.size() == 2)
+      GECODE_REWRITE(*this,Rel::Nq<View>::post(home(*this),x[0],x[1]));
+
+    return es;
+  }
+
+  template<class View>
+  ExecStatus
+  Bnd<View>::post(Home home, ViewArray<View>& x){
+    if (x.size() == 2)
+      return Rel::Nq<View>::post(home,x[0],x[1]);
+    if (x.size() > 2)
+      (void) new (home) Bnd<View>(home,x);
+    return ES_OK;
+  }
+
+}}}
+
+// STATISTICS: int-prop
+