gecoder-with-gecode 0.7.1

data/ext/gecode-1.3.1/gecode/int/count.hh

@@ -0,0 +1,401 @@
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *     Guido Tack <tack@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2002
+ *     Guido Tack, 2004
+ *
+ *  Last modified:
+ *     $Date: 2006-09-19 16:52:16 +0200 (Tue, 19 Sep 2006) $ by $Author: schulte $
+ *     $Revision: 3684 $
+ *
+ *  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_INT_COUNT_HH__
+#define __GECODE_INT_COUNT_HH__
+
+#include "gecode/int.hh"
+
+/**
+ * \namespace Gecode::Int::Count
+ * \brief Counting propagators
+ */
+
+namespace Gecode { namespace Int { namespace Count {
+
+  /**
+   * Relations for domain-consistent counting
+   *
+   */
+  //@{
+  /// Test whether \a x and \a y are equal
+  template <class VX>
+  RelTest holds(VX x, VX y);
+  /// Test whether \a x and \a y are equal
+  template <class VX>
+  RelTest holds(VX x, ConstIntView y);
+  /// Post that all views in \a x are equal to \a y
+  template <class VX>
+  ExecStatus post_true(Space* home, ViewArray<VX>& x, VX y);
+  /// Post that all views in \a x are equal to \a y
+  template <class VX>
+  ExecStatus post_true(Space* home, ViewArray<VX>& x, ConstIntView y);
+  /// Post that all views in \a x are not equal to \a y
+  template <class VX>
+  ExecStatus post_false(Space* home, ViewArray<VX>& x, VX y);
+  /// Post that all views in \a x are not equal to \a y
+  template <class VX>
+  ExecStatus post_false(Space* home, ViewArray<VX>& x, ConstIntView y);
+  //@}
+
+}}}
+
+#include "gecode/int/count/rel.icc"
+
+
+namespace Gecode { namespace Int { namespace Count {
+
+  /**
+   * \brief Baseclass for count propagators (integer)
+   *
+   */
+  template <class VX, class VY>
+  class BaseInt : public Propagator {
+  protected:
+    /// Views still to count
+    ViewArray<VX> x;
+    /// Views from x[0] ... x[n_s-1] have subscriptions
+    int n_s;
+    /// View to compare to
+    VY y;
+    /// Number of views which are equal and have been eliminated
+    int c;
+    /// Constructor for cloning \a p
+    BaseInt(Space* home, bool share, BaseInt& p);
+    /// Constructor for creation
+    BaseInt(Space* home, ViewArray<VX>& x, int n_s, VY y, int c);
+  public:
+    /// Cost function (defined as dynamic PC_LINEAR_LO)
+    virtual PropCost cost(void) const;
+    /// Delete propagator and return its size
+    virtual size_t dispose(Space* home);
+  };
+
+  /**
+   * \brief %Propagator for counting views (equal integer to number of equal views)
+   *
+   * Not all combinations of views are possible. The types \a VX
+   * and \a VY must be either equal, or \a VY must be ConstIntView.
+   *
+   * Requires \code #include "gecode/int/count.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template <class VX, class VY>
+  class EqInt : public BaseInt<VX,VY> {
+  protected:
+    using BaseInt<VX,VY>::x;
+    using BaseInt<VX,VY>::n_s;
+    using BaseInt<VX,VY>::y;
+    using BaseInt<VX,VY>::c;
+    /// Constructor for cloning \a p
+    EqInt(Space* home, bool share, EqInt& p);
+    /// Constructor for creation
+    EqInt(Space* home, ViewArray<VX>& x, int n_s, VY y, int c);
+  public:
+    /// Create copy during cloning
+    virtual Actor* copy(Space* home, bool share);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space* home);
+    /// Post propagator for \f$\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}=c\f$
+    static ExecStatus post(Space* home, ViewArray<VX>& x, VY y, int c);
+  };
+
+  /**
+   * \brief %Propagator for counting views (greater or equal integer to number of equal views)
+   *
+   * Not all combinations of views are possible. The types \a VX
+   * and \a VY must be either equal, or \a VY must be ConstIntView.
+   *
+   * Requires \code #include "gecode/int/count.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template <class VX, class VY>
+  class GqInt : public BaseInt<VX,VY> {
+  protected:
+    using BaseInt<VX,VY>::x;
+    using BaseInt<VX,VY>::n_s;
+    using BaseInt<VX,VY>::y;
+    using BaseInt<VX,VY>::c;
+    /// Constructor for cloning \a p
+    GqInt(Space* home, bool share, GqInt& p);
+    /// Constructor for creation
+    GqInt(Space* home, ViewArray<VX>& x, int n_s, VY y, int c);
+  public:
+    /// Create copy during cloning
+    virtual Actor* copy(Space* home, bool share);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space* home);
+    /// Post propagator for \f$\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}\geq c\f$
+    static ExecStatus post(Space* home, ViewArray<VX>& x, VY y, int c);
+  };
+
+  /**
+   * \brief %Propagator for counting views (less or equal integer to number of equal views)
+   *
+   * Not all combinations of views are possible. The types \a VX
+   * and \a VY must be either equal, or \a VY must be ConstIntView.
+   *
+   * Requires \code #include "gecode/int/count.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template <class VX, class VY>
+  class LqInt : public BaseInt<VX,VY> {
+  protected:
+    using BaseInt<VX,VY>::x;
+    using BaseInt<VX,VY>::n_s;
+    using BaseInt<VX,VY>::y;
+    using BaseInt<VX,VY>::c;
+    /// Constructor for cloning \a p
+    LqInt(Space* home, bool share, LqInt& p);
+    /// Constructor for creation
+    LqInt(Space* home, ViewArray<VX>& x, int n_s, VY y, int c);
+  public:
+    /// Create copy during cloning
+    virtual Actor* copy(Space* home, bool share);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space* home);
+    /// Post propagator for \f$\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}\geq c\f$
+    static ExecStatus post(Space* home, ViewArray<VX>& x, VY y, int c);
+  };
+
+  /**
+   * \brief %Propagator for counting views (not equal integer to number of equal views)
+   *
+   * Not all combinations of views are possible. The types \a VX
+   * and \a VY must be either equal, or \a VY must be ConstIntView.
+   *
+   * Requires \code #include "gecode/int/count.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template<class VX, class VY>
+  class NqInt : public BinaryPropagator<VX,PC_INT_DOM> {
+  protected:
+    using BinaryPropagator<VX,PC_INT_DOM>::x0;
+    using BinaryPropagator<VX,PC_INT_DOM>::x1;
+    /// Views not yet subscribed to
+    ViewArray<VX> x;
+    /// View to compare with
+    VY y;
+    /// Righthandside
+    int c;
+    /// Update subscription
+    bool resubscribe(Space* home, VX& z);
+    /// Constructor for posting
+    NqInt(Space* home,  ViewArray<VX>& x, VY y, int c);
+    /// Constructor for cloning \a p
+    NqInt(Space* home, bool share, NqInt& p);
+  public:
+    /// Copy propagator during cloning
+    virtual Actor* copy(Space* home, bool share);
+    /// Cost function (defined as PC_LINEAR_LO)
+    virtual PropCost cost(void) const;
+    /// Perform propagation
+    virtual ExecStatus propagate(Space* home);
+    /// Post propagator for \f$\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}\neq c\f$
+    static  ExecStatus post(Space* home, ViewArray<VX>& x, VY y, int c);
+    /// Delete propagator and return its size
+    virtual size_t dispose(Space* home);
+  };
+
+}}}
+
+#include "gecode/int/count/int.icc"
+
+
+namespace Gecode { namespace Int { namespace Count {
+
+  /**
+   * \brief Base-class for count propagators (view)
+   *
+   */
+  template <class VX, class VY, class VZ, bool shr>
+  class BaseView : public Propagator {
+  protected:
+    /// Views still to count
+    ViewArray<VX> x;
+    /// View to compare to
+    VY y;
+    /// View which yields result of counting
+    VZ z;
+    /// Number of views which are equal and have been eliminated
+    int   c;
+    /// Constructor for cloning \a p
+    BaseView(Space* home, bool shr, BaseView& p);
+    /// Constructor for creation
+    BaseView(Space* home, ViewArray<VX>& x, VY y, VZ z, int c);
+  public:
+    /// Delete propagator and return its size
+    virtual size_t dispose(Space* home);
+    /// Cost function (defined as dynamic PC_LINEAR_LO)
+    virtual PropCost cost(void) const;
+  protected:
+    /// Count how many views are equal now
+    void count(Space* home);
+    /// How many views are at least equal
+    int atleast(void) const;
+    /// How many views are at most equal
+    int atmost(void) const;
+    /// Test whether there is sharing of \a z with \a x or \a y
+    static bool sharing(const ViewArray<VX>& x, const VY& y, const VZ& z);
+  };
+
+  /**
+   * \brief %Propagator for counting views (equal to number of equal views)
+   *
+   * Not all combinations of views are possible. The types \a VX
+   * and \a VY must be either equal, or \a VY must be ConstIntView.
+   *
+   * Requires \code #include "gecode/int/count.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template <class VX, class VY, class VZ, bool shr>
+  class EqView : public BaseView<VX,VY,VZ,shr> {
+  protected:
+    using BaseView<VX,VY,VZ,shr>::x;
+    using BaseView<VX,VY,VZ,shr>::z;
+    using BaseView<VX,VY,VZ,shr>::c;
+    using BaseView<VX,VY,VZ,shr>::y;
+    using BaseView<VX,VY,VZ,shr>::count;
+    using BaseView<VX,VY,VZ,shr>::atleast;
+    using BaseView<VX,VY,VZ,shr>::atmost;
+
+    /// Constructor for cloning \a p
+    EqView(Space* home, bool shr, EqView& p);
+  public:
+    /// Constructor for creation
+    EqView(Space* home, ViewArray<VX>& x, VY y, VZ z, int c);
+    /// Create copy during cloning
+    virtual Actor* copy(Space* home, bool shr);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space* home);
+    /// Post propagator for \f$\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}=z+c\f$
+    static ExecStatus post(Space* home, ViewArray<VX>& x, VY y, VZ z, int c);
+  };
+
+  /**
+   * \brief %Propagator for counting views (different from number of equal views)
+   *
+   * Not all combinations of views are possible. The types \a VX
+   * and \a VY must be either equal, or \a VY must be ConstIntView.
+   *
+   * Requires \code #include "gecode/int/count.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template <class VX, class VY, class VZ, bool shr>
+  class NqView : public BaseView<VX,VY,VZ,shr> {
+  protected:
+    using BaseView<VX,VY,VZ,shr>::x;
+    using BaseView<VX,VY,VZ,shr>::z;
+    using BaseView<VX,VY,VZ,shr>::c;
+    using BaseView<VX,VY,VZ,shr>::y;
+    using BaseView<VX,VY,VZ,shr>::count;
+    using BaseView<VX,VY,VZ,shr>::atleast;
+    using BaseView<VX,VY,VZ,shr>::atmost;
+
+    /// Constructor for cloning \a p
+    NqView(Space* home, bool shr, NqView& p);
+  public:
+    /// Constructor for creation
+    NqView(Space* home, ViewArray<VX>& x, VY y, VZ z, int c);
+    /// Create copy during cloning
+    virtual Actor* copy(Space* home, bool shr);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space* home);
+    /// Post propagator for \f$\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}\neq z+c\f$
+    static ExecStatus post(Space* home, ViewArray<VX>& x, VY y, VZ z, int c);
+  };
+
+  /**
+   * \brief %Propagator for counting views (less or equal to number of equal views)
+   *
+   * Not all combinations of views are possible. The types \a VX
+   * and \a VY must be either equal, or \a VY must be ConstIntView.
+   *
+   * Requires \code #include "gecode/int/count.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template <class VX, class VY, class VZ, bool shr>
+  class LqView : public BaseView<VX,VY,VZ,shr> {
+  protected:
+    using BaseView<VX,VY,VZ,shr>::x;
+    using BaseView<VX,VY,VZ,shr>::z;
+    using BaseView<VX,VY,VZ,shr>::c;
+    using BaseView<VX,VY,VZ,shr>::y;
+    using BaseView<VX,VY,VZ,shr>::count;
+    using BaseView<VX,VY,VZ,shr>::atleast;
+    using BaseView<VX,VY,VZ,shr>::atmost;
+
+    /// Constructor for cloning \a p
+    LqView(Space* home, bool shr, LqView& p);
+  public:
+    /// Constructor for creation
+    LqView(Space* home, ViewArray<VX>& x, VY y, VZ z, int c);
+    /// Create copy during cloning
+    virtual Actor* copy(Space* home, bool shr);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space* home);
+    /// Post propagator for \f$\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}\leq z+c\f$
+    static ExecStatus post(Space* home, ViewArray<VX>& x, VY y, VZ z, int c);
+  };
+
+  /**
+   * \brief %Propagator for counting views (greater or equal to number of equal views)
+   *
+   * Not all combinations of views are possible. The types \a VX
+   * and \a VY must be either equal, or \a VY must be ConstIntView.
+   *
+   * Requires \code #include "gecode/int/count.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template <class VX, class VY, class VZ, bool shr>
+  class GqView : public BaseView<VX,VY,VZ,shr> {
+  protected:
+    using BaseView<VX,VY,VZ,shr>::x;
+    using BaseView<VX,VY,VZ,shr>::z;
+    using BaseView<VX,VY,VZ,shr>::c;
+    using BaseView<VX,VY,VZ,shr>::y;
+    using BaseView<VX,VY,VZ,shr>::count;
+    using BaseView<VX,VY,VZ,shr>::atleast;
+    using BaseView<VX,VY,VZ,shr>::atmost;
+
+    /// Constructor for cloning \a p
+    GqView(Space* home, bool shr, GqView& p);
+  public:
+    /// Constructor for creation
+    GqView(Space* home, ViewArray<VX>& x, VY y, VZ z, int c);
+    /// Create copy during cloning
+    virtual Actor* copy(Space* home, bool share);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space* home);
+    /// Post propagator for \f$\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}\geq z+c\f$
+    static ExecStatus post(Space* home, ViewArray<VX>& x, VY y, VZ z, int c);
+  };
+
+}}}
+
+#include "gecode/int/count/view.icc"
+
+#endif
+
+// STATISTICS: int-prop
+

data/ext/gecode-1.3.1/gecode/int/count/int.icc

@@ -0,0 +1,495 @@
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2006
+ *
+ *  Last modified:
+ *     $Date: 2006-08-08 20:36:53 +0200 (Tue, 08 Aug 2006) $ by $Author: schulte $
+ *     $Revision: 3538 $
+ *
+ *  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 { namespace Int { namespace Count {
+
+  /*
+   * General baseclass
+   *
+   */
+
+  template <class VX, class VY>
+  forceinline
+  BaseInt<VX,VY>::BaseInt(Space* home, 
+			  ViewArray<VX>& x0, int n_s0, VY y0, int c0)
+    : Propagator(home), x(x0), n_s(n_s0), y(y0), c(c0) {
+    for (int i=n_s; i--; )
+      x[i].subscribe(home,this,PC_INT_DOM);
+    y.subscribe(home,this,PC_INT_DOM);
+  }
+
+  template <class VX, class VY>
+  size_t
+  BaseInt<VX,VY>::dispose(Space* home) {
+    assert(!home->failed());
+    for (int i=n_s; i--; )
+      x[i].cancel(home,this,PC_INT_DOM);
+    y.cancel(home,this,PC_INT_DOM);
+    (void) Propagator::dispose(home);
+    return sizeof(*this);
+  }
+
+  template <class VX, class VY>
+  forceinline
+  BaseInt<VX,VY>::BaseInt(Space* home, bool share, BaseInt<VX,VY>& p)
+    : Propagator(home,share,p), n_s(p.n_s), c(p.c) {
+    x.update(home,share,p.x);
+    y.update(home,share,p.y);
+  }
+
+  template <class VX, class VY>
+  PropCost
+  BaseInt<VX,VY>::cost(void) const {
+    return cost_lo(x.size(),PC_LINEAR_LO);
+  }
+
+  /*
+   * Equal propagator (integer rhs)
+   *
+   */
+  template <class VX, class VY>
+  forceinline
+  EqInt<VX,VY>::EqInt(Space* home, ViewArray<VX>& x, int n_s, VY y, int c)
+    : BaseInt<VX,VY>(home,x,n_s,y,c) {}
+
+  template <class VX, class VY>
+  ExecStatus
+  EqInt<VX,VY>::post(Space* home, ViewArray<VX>& x, VY y, int c) {
+    // Eliminate decided views
+    int n_x = x.size();
+    for (int i=n_x; i--; )
+      switch (holds(x[i],y)) {
+      case RT_FALSE:
+	x[i] = x[--n_x]; break;
+      case RT_TRUE:
+	x[i] = x[--n_x]; c--; break;
+      case RT_MAYBE:
+	break;
+      default: 
+	GECODE_NEVER;
+      }
+    x.size(n_x);
+    // RHS too small or too large
+    if ((c < 0) || (c > n_x))
+      return ES_FAILED;
+    // All views must be different
+    if (c == 0) {
+      ExecStatus es = post_false(home,x,y);
+      return (es == ES_SUBSUMED) ? ES_OK : es;
+    }
+    // All views must be equal
+    if (c == n_x) {
+      ExecStatus es = post_true(home,x,y);
+      return (es == ES_SUBSUMED) ? ES_OK : es;
+    }
+    // Compute how many subscriptions must be created
+    int n_s = std::max(c,n_x-c)+1;
+    assert(n_s <= n_x);
+    (void) new (home) EqInt<VX,VY>(home,x,n_s,y,c);
+    return ES_OK;
+  }
+
+  template <class VX, class VY>
+  forceinline
+  EqInt<VX,VY>::EqInt(Space* home, bool share, EqInt<VX,VY>& p)
+    : BaseInt<VX,VY>(home,share,p) {}
+
+  template <class VX, class VY>
+  Actor*
+  EqInt<VX,VY>::copy(Space* home, bool share) {
+    return new (home) EqInt<VX,VY>(home,share,*this);
+  }
+
+  template <class VX, class VY>
+  ExecStatus
+  EqInt<VX,VY>::propagate(Space* home) {
+    // Eliminate decided views from subscribed views
+    int n_x = x.size();
+    for (int i=n_s; i--; )
+      switch (holds(x[i],y)) {
+      case RT_FALSE:
+	x[i].cancel(home,this,PC_INT_DOM);
+	x[i]=x[--n_s]; x[n_s]=x[--n_x]; 
+	break;
+      case RT_TRUE:
+	x[i].cancel(home,this,PC_INT_DOM);
+	x[i]=x[--n_s]; x[n_s]=x[--n_x]; c--; 
+	break;
+      case RT_MAYBE:
+	break;
+      default: 
+	GECODE_NEVER;
+      }
+    x.size(n_x);
+    if ((c < 0) || (c > n_x))
+      return ES_FAILED;
+    // Eliminate decided views from unsubscribed views
+    for (int i=n_x; i-- > n_s; )
+      switch (holds(x[i],y)) {
+      case RT_FALSE: x[i]=x[--n_x]; break;
+      case RT_TRUE:  x[i]=x[--n_x]; c--; break;
+      case RT_MAYBE: break;
+      default:       GECODE_NEVER;
+      }
+    x.size(n_x);
+    if ((c < 0) || (c > n_x))
+      return ES_FAILED;
+    if (c == 0)
+      // All views must be different
+      return post_false(home,x,y);
+    if (c == n_x)
+      // All views must be equal
+      return post_true(home,x,y);
+    int m = std::max(c,n_x-c)+1;
+    assert(m <= n_x);
+    // Now, there must be new subscriptions from x[n_s] up to x[m-1]
+    while (n_s < m)
+      x[n_s++].subscribe(home,this,PC_INT_DOM,false);
+    return ES_FIX;
+  }
+
+  /*
+   * Greater or equal propagator (integer rhs)
+   *
+   */
+  template <class VX, class VY>
+  forceinline
+  GqInt<VX,VY>::GqInt(Space* home, ViewArray<VX>& x, int n_s, VY y, int c)
+    : BaseInt<VX,VY>(home,x,n_s,y,c) {}
+
+  template <class VX, class VY>
+  ExecStatus
+  GqInt<VX,VY>::post(Space* home, ViewArray<VX>& x, VY y, int c) {
+    // Eliminate decided views
+    int n_x = x.size();
+    for (int i=n_x; i--; )
+      switch (holds(x[i],y)) {
+      case RT_FALSE:
+	x[i] = x[--n_x]; break;
+      case RT_TRUE:
+	x[i] = x[--n_x]; c--; break;
+      case RT_MAYBE:
+	break;
+      default: 
+	GECODE_NEVER;
+      }
+    x.size(n_x);
+    // RHS too large
+    if (n_x < c)
+      return ES_FAILED;
+    // Whatever the x[i] take for values, the inequality is subsumed
+    if (c <= 0)
+      return ES_OK;
+    // All views must be equal
+    if (c == n_x) {
+      ExecStatus es = post_true(home,x,y);
+      return (es == ES_SUBSUMED) ? ES_OK : es;
+    }
+    (void) new (home) GqInt<VX,VY>(home,x,c+1,y,c);
+    return ES_OK;
+  }
+
+  template <class VX, class VY>
+  forceinline
+  GqInt<VX,VY>::GqInt(Space* home, bool share, GqInt<VX,VY>& p)
+    : BaseInt<VX,VY>(home,share,p) {}
+
+  template <class VX, class VY>
+  Actor*
+  GqInt<VX,VY>::copy(Space* home, bool share) {
+    return new (home) GqInt<VX,VY>(home,share,*this);
+  }
+
+  template <class VX, class VY>
+  ExecStatus
+  GqInt<VX,VY>::propagate(Space* home) {
+    // Eliminate decided views from subscribed views
+    int n_x = x.size();
+    for (int i=n_s; i--; )
+      switch (holds(x[i],y)) {
+      case RT_FALSE:
+	x[i].cancel(home,this,PC_INT_DOM);
+	x[i]=x[--n_s]; x[n_s]=x[--n_x]; 
+	break;
+      case RT_TRUE:
+	x[i].cancel(home,this,PC_INT_DOM);
+	x[i]=x[--n_s]; x[n_s]=x[--n_x]; c--; 
+	break;
+      case RT_MAYBE:
+	break;
+      default: 
+	GECODE_NEVER;
+      }
+    x.size(n_x);
+    if (n_x < c)
+      return ES_FAILED;
+    if (c <= 0)
+      return ES_SUBSUMED;
+    // Eliminate decided views from unsubscribed views
+    for (int i=n_x; i-- > n_s; )
+      switch (holds(x[i],y)) {
+      case RT_FALSE: x[i]=x[--n_x]; break;
+      case RT_TRUE:  x[i]=x[--n_x]; c--; break;
+      case RT_MAYBE: break;
+      default:       GECODE_NEVER;
+      }
+    x.size(n_x);
+    if (n_x < c)
+      return ES_FAILED;
+    if (c <= 0)
+      return ES_SUBSUMED;
+    if (c == n_x)
+      // All views must be equal
+      return post_true(home,x,y);
+    // Now, there must be new subscriptions from x[n_s] up to x[c+1]
+    while (n_s <= c)
+      x[n_s++].subscribe(home,this,PC_INT_DOM,false);
+    return ES_FIX;
+  }
+
+  /*
+   * Less or equal propagator (integer rhs)
+   *
+   */
+  template <class VX, class VY>
+  forceinline
+  LqInt<VX,VY>::LqInt(Space* home, ViewArray<VX>& x, int n_s, VY y, int c)
+    : BaseInt<VX,VY>(home,x,n_s,y,c) {}
+
+  template <class VX, class VY>
+  ExecStatus
+  LqInt<VX,VY>::post(Space* home, ViewArray<VX>& x, VY y, int c) {
+    // Eliminate decided views
+    int n_x = x.size();
+    for (int i=n_x; i--; )
+      switch (holds(x[i],y)) {
+      case RT_FALSE:
+	x[i] = x[--n_x]; break;
+      case RT_TRUE:
+	x[i] = x[--n_x]; c--; break;
+      case RT_MAYBE:
+	break;
+      default: 
+	GECODE_NEVER;
+      }
+    x.size(n_x);
+    if (c < 0)
+      return ES_FAILED;
+    if (c >= n_x)
+      return ES_OK;
+    // All views must be different
+    if (c == 0) {
+      ExecStatus es = post_false(home,x,y);
+      return (es == ES_SUBSUMED) ? ES_OK : es;
+    }
+    (void) new (home) LqInt<VX,VY>(home,x,n_x-c+1,y,c);
+    return ES_OK;
+  }
+
+  template <class VX, class VY>
+  forceinline
+  LqInt<VX,VY>::LqInt(Space* home, bool share, LqInt<VX,VY>& p)
+    : BaseInt<VX,VY>(home,share,p) {}
+
+  template <class VX, class VY>
+  Actor*
+  LqInt<VX,VY>::copy(Space* home, bool share) {
+    return new (home) LqInt<VX,VY>(home,share,*this);
+  }
+
+  template <class VX, class VY>
+  ExecStatus
+  LqInt<VX,VY>::propagate(Space* home) {
+    // Eliminate decided views from subscribed views
+    int n_x = x.size();
+    for (int i=n_s; i--; )
+      switch (holds(x[i],y)) {
+      case RT_FALSE:
+	x[i].cancel(home,this,PC_INT_DOM);
+	x[i]=x[--n_s]; x[n_s]=x[--n_x]; 
+	break;
+      case RT_TRUE:
+	x[i].cancel(home,this,PC_INT_DOM);
+	x[i]=x[--n_s]; x[n_s]=x[--n_x]; c--; 
+	break;
+      case RT_MAYBE:
+	break;
+      default: 
+	GECODE_NEVER;
+      }
+    x.size(n_x);
+    if (c < 0)
+      return ES_FAILED;
+    if (c >= n_x)
+      return ES_SUBSUMED;
+    // Eliminate decided views from unsubscribed views
+    for (int i=n_x; i-- > n_s; )
+      switch (holds(x[i],y)) {
+      case RT_FALSE: x[i]=x[--n_x]; break;
+      case RT_TRUE:  x[i]=x[--n_x]; c--; break;
+      case RT_MAYBE: break;
+      default:       GECODE_NEVER;
+      }
+    x.size(n_x);
+    if (c < 0)
+      return ES_FAILED;
+    if (c >= n_x)
+      return ES_SUBSUMED;
+    if (c == 0)
+      // All views must be different
+      return post_false(home,x,y);
+    // Now, there must be new subscriptions from x[n_s] up to x[n_x-c+1]
+    int m = n_x-c;
+    while (n_s <= m)
+      x[n_s++].subscribe(home,this,PC_INT_DOM,false);
+    return ES_FIX;
+  }
+
+  /*
+   * Not-equal propagator (integer rhs)
+   *
+   */
+  template<class VX, class VY>
+  forceinline
+  NqInt<VX,VY>::NqInt(Space* home, ViewArray<VX>& x0, VY y0, int c0)
+    : BinaryPropagator<VX,PC_INT_DOM>(home,
+				      x0[x0.size()-2],
+				      x0[x0.size()-1]), x(x0), y(y0), c(c0) {
+    assert(x.size() >= 2);
+    x.size(x.size()-2);
+    y.subscribe(home,this,PC_INT_DOM);
+  }
+
+  template <class VX, class VY>
+  size_t
+  NqInt<VX,VY>::dispose(Space* home) {
+    assert(!home->failed());
+    y.cancel(home,this,PC_INT_DOM);
+    (void) BinaryPropagator<VX,PC_INT_DOM>::dispose(home);
+    return sizeof(*this);
+  }
+
+  template<class VX, class VY>
+  forceinline
+  NqInt<VX,VY>::NqInt(Space* home, bool share, NqInt<VX,VY>& p)
+    : BinaryPropagator<VX,PC_INT_DOM>(home,share,p), c(p.c) {
+    x.update(home,share,p.x);
+    y.update(home,share,p.y);
+  }
+
+  template<class VX, class VY>
+  forceinline ExecStatus
+  NqInt<VX,VY>::post(Space* home, ViewArray<VX>& x, VY y, int c) {
+    int n = x.size();
+    for (int i=n; i--; )
+      switch (holds(x[i],y)) {
+      case RT_FALSE: x[i]=x[--n]; break;
+      case RT_TRUE:  x[i]=x[--n]; c--; break;
+      case RT_MAYBE: break;
+      default:       GECODE_NEVER;
+      }
+    x.size(n);
+    if ((n < c) || (c < 0))
+      return ES_OK;
+    if (n == 0)
+      return (c == 0) ? ES_FAILED : ES_OK;
+    if (n == 1) {
+      ExecStatus es = (c == 1) ?
+	post_false(home,x[0],y) : post_true(home,x[0],y);
+      return (es == ES_SUBSUMED) ? ES_OK : es;
+    }
+    (void) new (home) NqInt(home,x,y,c);
+    return ES_OK;
+  }
+
+  template<class VX, class VY>
+  Actor*
+  NqInt<VX,VY>::copy(Space* home, bool share) {
+    return new (home) NqInt<VX,VY>(home,share,*this);
+  }
+
+  template<class VX, class VY>
+  PropCost
+  NqInt<VX,VY>::cost(void) const {
+    return PC_LINEAR_LO;
+  }
+
+  template<class VX, class VY>
+  forceinline bool
+  NqInt<VX,VY>::resubscribe(Space* home, VX& z) {
+    switch (holds(z,y)) {
+    case RT_FALSE: break;
+    case RT_TRUE:  c--; break;
+    case RT_MAYBE: return true;
+    default:       GECODE_NEVER;
+    }
+    int n = x.size();
+    for (int i=n; i--; )
+      switch (holds(x[i],y)) {
+      case RT_FALSE: 
+	x[i]=x[--n]; 
+	break;
+      case RT_TRUE:  
+	x[i]=x[--n]; c--; 
+	break;
+      case RT_MAYBE: 
+	// New undecided view found
+	z.cancel(home,this,PC_INT_DOM);
+	z=x[i]; x[i]=x[--n]; 
+	x.size(n);
+	z.subscribe(home,this,PC_INT_DOM,false);
+	return true;
+      default:       
+	GECODE_NEVER;
+      }
+    // All views have been decided
+    x.size(0);
+    return false;
+  }
+
+  template<class VX, class VY>
+  ExecStatus
+  NqInt<VX,VY>::propagate(Space* home) {
+    bool s0 = resubscribe(home,x0);
+    bool s1 = resubscribe(home,x1);
+    int n = x.size() + s0 + s1;
+    if ((n < c) || (c < 0))
+      return ES_SUBSUMED;
+    if (n == 0)
+      return (c == 0) ? ES_FAILED : ES_SUBSUMED;
+    if (n == 1) {
+      if (s0) {
+	return (c == 1) ? 
+	  post_false(home,x0,y) : post_true(home,x0,y);
+      } else {
+	assert(s1);
+	return (c == 1) ? 
+	  post_false(home,x1,y) : post_true(home,x1,y);
+      }
+      return ES_SUBSUMED;
+    }
+    return ES_FIX;
+  }
+
+}}}
+
+// STATISTICS: int-prop
+