gecoder-with-gecode 0.7.1

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

@@ -0,0 +1,1056 @@
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *     Guido Tack <tack@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2002
+ *     Guido Tack, 2004
+ *
+ *  Last modified:
+ *     $Date: 2006-09-06 15:51:28 +0200 (Wed, 06 Sep 2006) $ by $Author: schulte $
+ *     $Revision: 3604 $
+ *
+ *  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_LINEAR_HH__
+#define __GECODE_INT_LINEAR_HH__
+
+#include "gecode/int.hh"
+
+/**
+ * \namespace Gecode::Int::Linear
+ * \brief %Linear propagators
+ */
+
+namespace Gecode { namespace Int { namespace Linear {
+
+  /*
+   * Binary propagators
+   *
+   */
+
+  /**
+   * \brief Base-class for binary linear propagators
+   *
+   * The type \a Val can be either \c double or \c int, defining the
+   * numerical precision during propagation. The types \a A and \a B
+   * give the types of the views.
+   *
+   * The propagation condition \a pc refers to both views.
+   */
+  template <class Val, class A, class B, PropCond pc>
+  class LinBin : public Propagator {
+  protected:
+    /// View of type \a A
+    A x0;
+    /// View of type \a B
+    B x1;
+    /// Value of type \a Val
+    Val c;
+    /// Constructor for cloning \a p
+    LinBin(Space* home, bool share, LinBin& p);
+    /// Constructor for rewriting \a p during cloning
+    LinBin(Space* home, bool share, Propagator& p, A x0, B x1, Val c);
+    /// Constructor for creation
+    LinBin(Space* home, A x0, B x1, Val c);
+  public:
+    /// Cost function (defined as PC_BINARY_LO)
+    virtual PropCost cost(void) const;
+    /// Delete propagator and return its size
+    virtual size_t dispose(Space* home);
+  };
+
+  /**
+   * \brief Base-class for reified binary linear propagators
+   *
+   * The type \a Val can be either \c double or \c int, defining the
+   * numerical precision during propagation. The types \a A and \a B
+   * give the types of the views.
+   *
+   * The propagation condition \a pc refers to both views.
+   */
+  template <class Val, class A, class B, PropCond pc, class Ctrl>
+  class ReLinBin : public Propagator {
+  protected:
+    /// View of type \a A
+    A x0;
+    /// View of type \a B
+    B x1;
+    /// Value of type \a Val
+    Val c;
+    /// Control view for reification
+    Ctrl b;
+    /// Constructor for cloning \a p
+    ReLinBin(Space* home, bool share, ReLinBin& p);
+    /// Constructor for creation
+    ReLinBin(Space* home, A x0, B x1, Val c, Ctrl b);
+  public:
+    /// Cost function (defined as PC_BINARY_LO)
+    virtual PropCost cost(void) const;
+    /// Delete propagator and return its size
+    virtual size_t dispose(Space* home);
+  };
+
+  /**
+   * \brief %Propagator for bounds-consistent binary linear equality
+   *
+   * The type \a Val can be either \c double or \c int, defining the
+   * numerical precision during propagation. The types \a A and \a B
+   * give the types of the views.
+   *
+   * The propagation condition \a pc refers to both views.
+   *
+   * Requires \code #include "gecode/int/linear.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template <class Val, class A, class B>
+  class EqBin : public LinBin<Val,A,B,PC_INT_BND> {
+  protected:
+    using LinBin<Val,A,B,PC_INT_BND>::x0;
+    using LinBin<Val,A,B,PC_INT_BND>::x1;
+    using LinBin<Val,A,B,PC_INT_BND>::c;
+
+    /// Constructor for cloning \a p
+    EqBin(Space* home, bool share, EqBin& p);
+    /// Constructor for creation
+    EqBin(Space* home, A x0, B x1, Val c);
+  public:
+    /// Constructor for rewriting \a p during cloning
+    EqBin(Space* home, bool share, Propagator& p, A x0, B x1, Val c);
+    /// Create copy during cloning
+    virtual Actor* copy(Space* home, bool share);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space* home);
+    /// Post propagator for \f$x_0+x_1 = c\f$
+    static ExecStatus post(Space* home, A x0, B x1, Val c);
+  };
+
+  /**
+   * \brief %Propagator for reified bounds-consistent binary linear equality
+   *
+   * The type \a Val can be either \c double or \c int, defining the
+   * numerical precision during propagation. The types \a A and \a B
+   * give the types of the views.
+   *
+   * The propagation condition \a pc refers to both views.
+   *
+   * Requires \code #include "gecode/int/linear.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template <class Val, class A, class B, class Ctrl>
+  class ReEqBin : public ReLinBin<Val,A,B,PC_INT_BND,Ctrl> {
+  protected:
+    using ReLinBin<Val,A,B,PC_INT_BND,Ctrl>::x0;
+    using ReLinBin<Val,A,B,PC_INT_BND,Ctrl>::x1;
+    using ReLinBin<Val,A,B,PC_INT_BND,Ctrl>::c;
+    using ReLinBin<Val,A,B,PC_INT_BND,Ctrl>::b;
+
+    /// Constructor for cloning \a p
+    ReEqBin(Space* home, bool share, ReEqBin& p);
+    /// Constructor for creation
+    ReEqBin(Space* home,A,B,Val,Ctrl);
+  public:
+    /// Create copy during cloning
+    virtual Actor* copy(Space* home, bool share);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space* home);
+    /// Post propagator for \f$(x_0+x_1 = c)\Leftrightarrow b\f$
+    static ExecStatus post(Space* home, A x0, B x1, Val c, Ctrl b);
+  };
+
+  /**
+   * \brief %Propagator for bounds-consistent binary linear disequality
+   *
+   * The type \a Val can be either \c double or \c int, defining the
+   * numerical precision during propagation. The types \a A and \a B
+   * give the types of the views.
+   *
+   * The propagation condition \a pc refers to both views.
+   *
+   * Requires \code #include "gecode/int/linear.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template <class Val, class A, class B>
+  class NqBin : public LinBin<Val,A,B,PC_INT_VAL> {
+  protected:
+    using LinBin<Val,A,B,PC_INT_VAL>::x0;
+    using LinBin<Val,A,B,PC_INT_VAL>::x1;
+    using LinBin<Val,A,B,PC_INT_VAL>::c;
+
+    /// Constructor for cloning \a p
+    NqBin(Space* home, bool share, NqBin& p);
+    /// Constructor for creation
+    NqBin(Space* home, A x0, B x1, Val c);
+  public:
+    /// Constructor for rewriting \a p during cloning
+    NqBin(Space* home, bool share, Propagator& p, A x0, B x1, Val c);
+    /// Create copy during cloning
+    virtual Actor* copy(Space* home, bool share);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space* home);
+    /// Cost function (defined as PC_UNARY_LO)
+    virtual PropCost cost(void) const;
+    /// Post propagator for \f$x_0+x_1 \neq c\f$
+    static ExecStatus post(Space* home, A x0, B x1, Val c);
+  };
+
+  /**
+   * \brief %Propagator for bounds-consistent binary linear less or equal
+   *
+   * The type \a Val can be either \c double or \c int, defining the
+   * numerical precision during propagation. The types \a A and \a B
+   * give the types of the views.
+   *
+   * The propagation condition \a pc refers to both views.
+   *
+   * Requires \code #include "gecode/int/linear.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template <class Val, class A, class B>
+  class LqBin : public LinBin<Val,A,B,PC_INT_BND> {
+  protected:
+    using LinBin<Val,A,B,PC_INT_BND>::x0;
+    using LinBin<Val,A,B,PC_INT_BND>::x1;
+    using LinBin<Val,A,B,PC_INT_BND>::c;
+
+    /// Constructor for cloning \a p
+    LqBin(Space* home, bool share, LqBin& p);
+    /// Constructor for creation
+    LqBin(Space* home, A x0, B x1, Val c);
+  public:
+    /// Constructor for rewriting \a p during cloning
+    LqBin(Space* home, bool share, Propagator& p, A x0, B x1, Val c);
+    /// Create copy during cloning
+    virtual Actor* copy(Space* home, bool share);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space* home);
+    /// Post propagator for \f$x_0+x_1 \leq c\f$
+    static ExecStatus post(Space* home, A x0, B x1, Val c);
+  };
+
+  /**
+   * \brief %Propagator for bounds-consistent binary linear greater or equal
+   *
+   * The type \a Val can be either \c double or \c int, defining the
+   * numerical precision during propagation. The types \a A and \a B
+   * give the types of the views.
+   *
+   * The propagation condition \a pc refers to both views.
+   *
+   * Requires \code #include "gecode/int/linear.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template <class Val, class A, class B>
+  class GqBin : public LinBin<Val,A,B,PC_INT_BND> {
+  protected:
+    using LinBin<Val,A,B,PC_INT_BND>::x0;
+    using LinBin<Val,A,B,PC_INT_BND>::x1;
+    using LinBin<Val,A,B,PC_INT_BND>::c;
+
+    /// Constructor for cloning \a p
+    GqBin(Space* home, bool share, GqBin& p);
+    /// Constructor for creation
+    GqBin(Space* home, A x0, B x1, Val c);
+  public:
+    /// Constructor for rewriting \a p during cloning
+    GqBin(Space* home, bool share, Propagator& p, A x0, B x1, Val c);
+    /// Create copy during cloning
+    virtual Actor* copy(Space* home, bool share);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space* home);
+    /// Post propagator for \f$x_0+x_1 \geq c\f$
+    static ExecStatus post(Space* home, A x0, B x1, Val c);
+  };
+
+  /**
+   * \brief %Propagator for reified bounds-consistent binary linear less or equal
+   *
+   * The type \a Val can be either \c double or \c int, defining the
+   * numerical precision during propagation. The types \a A and \a B
+   * give the types of the views.
+   *
+   * The propagation condition \a pc refers to both views.
+   *
+   * Requires \code #include "gecode/int/linear.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template <class Val, class A, class B>
+  class ReLqBin : public ReLinBin<Val,A,B,PC_INT_BND,BoolView> {
+  protected:
+    using ReLinBin<Val,A,B,PC_INT_BND,BoolView>::x0;
+    using ReLinBin<Val,A,B,PC_INT_BND,BoolView>::x1;
+    using ReLinBin<Val,A,B,PC_INT_BND,BoolView>::c;
+    using ReLinBin<Val,A,B,PC_INT_BND,BoolView>::b;
+
+    /// Constructor for cloning \a p
+    ReLqBin(Space* home, bool share, ReLqBin& p);
+    /// Constructor for creation
+    ReLqBin(Space* home, A x0, B x1, Val c, BoolView b);
+  public:
+    /// Create copy during cloning
+    virtual Actor* copy(Space* home, bool share);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space* home);
+    /// Post propagator for \f$(x_0+x_1 \leq c)\Leftrightarrow b\f$
+    static ExecStatus post(Space* home, A x0, B x1, Val c, BoolView b);
+  };
+
+}}}
+
+#include "gecode/int/linear/binary.icc"
+
+namespace Gecode { namespace Int { namespace Linear {
+
+  /*
+   * Ternary propagators
+   *
+   */
+
+  /**
+   * \brief Base-class for ternary linear propagators
+   *
+   * The type \a Val can be either \c double or \c int, defining the
+   * numerical precision during propagation. The types \a A, \a B,
+   * and \a C give the types of the views.
+   *
+   * The propagation condition \a pc refers to all three views.
+   */
+  template <class Val, class A, class B, class C, PropCond pc>
+  class LinTer : public Propagator {
+  protected:
+    /// View of type \a A
+    A x0;
+    /// View of type \a B
+    B x1;
+    /// View of type \a C
+    C x2;
+    /// Value of type \a Val
+    Val c;
+    /// Constructor for cloning \a p
+    LinTer(Space* home, bool share, LinTer& p);
+    /// Constructor for creation
+    LinTer(Space* home, A x0, B x1, C x2, Val c);
+    /// Constructor for rewriting \a p during cloning
+    LinTer(Space* home, bool share, Propagator& p, A x0, B x1, C x2, Val c);
+  public:
+    /// Cost function (defined as PC_TERNARY_LO)
+    virtual PropCost cost(void) const;
+    /// Delete propagator and return its size
+    virtual size_t dispose(Space* home);
+  };
+
+  /**
+   * \brief %Propagator for bounds-consistent ternary linear equality
+   *
+   * The type \a Val can be either \c double or \c int, defining the
+   * numerical precision during propagation. The types \a A, \a B,
+   * and \a C give the types of the views.
+   *
+   * The propagation condition \a pc refers to all three views.
+   *
+   * Requires \code #include "gecode/int/linear.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template <class Val, class A, class B, class C>
+  class EqTer : public LinTer<Val,A,B,C,PC_INT_BND> {
+  protected:
+    using LinTer<Val,A,B,C,PC_INT_BND>::x0;
+    using LinTer<Val,A,B,C,PC_INT_BND>::x1;
+    using LinTer<Val,A,B,C,PC_INT_BND>::x2;
+    using LinTer<Val,A,B,C,PC_INT_BND>::c;
+
+    /// Constructor for cloning \a p
+    EqTer(Space* home, bool share, EqTer& p);
+    /// Constructor for creation
+    EqTer(Space* home, A x0, B x1, C x2, Val c);
+  public:
+    /// Constructor for rewriting \a p during cloning
+    EqTer(Space* home, bool share, Propagator& p, A x0, B x1, C x2, Val c);
+    /// Create copy during cloning
+    virtual Actor* copy(Space* home, bool share);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space* home);
+    /// Post propagator for \f$x_0+x_1+x_2 = c\f$
+    static ExecStatus post(Space* home, A x0, B x1, C x2, Val c);
+  };
+
+  /**
+   * \brief %Propagator for bounds-consistent ternary linear disquality
+   *
+   * The type \a Val can be either \c double or \c int, defining the
+   * numerical precision during propagation. The types \a A, \a B,
+   * and \a C give the types of the views.
+   *
+   * The propagation condition \a pc refers to all three views.
+   *
+   * Requires \code #include "gecode/int/linear.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template <class Val, class A, class B, class C>
+  class NqTer : public LinTer<Val,A,B,C,PC_INT_VAL> {
+  protected:
+    using LinTer<Val,A,B,C,PC_INT_VAL>::x0;
+    using LinTer<Val,A,B,C,PC_INT_VAL>::x1;
+    using LinTer<Val,A,B,C,PC_INT_VAL>::x2;
+    using LinTer<Val,A,B,C,PC_INT_VAL>::c;
+
+    /// Constructor for cloning \a p
+    NqTer(Space* home, bool share, NqTer& p);
+    /// Constructor for creation
+    NqTer(Space* home, A x0, B x1, C x2, Val c);
+  public:
+    /// Constructor for rewriting \a p during cloning
+    NqTer(Space* home, bool share, Propagator& p, A x0, B x1, C x2, Val c);
+    /// Create copy during cloning
+    virtual Actor* copy(Space* home, bool share);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space* home);
+    /// Post propagator for \f$x_0+x_1+x_2 \neq c\f$
+    static ExecStatus post(Space* home, A x0, B x1, C x2, Val c);
+  };
+
+  /**
+   * \brief %Propagator for bounds-consistent ternary linear less or equal
+   *
+   * The type \a Val can be either \c double or \c int, defining the
+   * numerical precision during propagation. The types \a A, \a B,
+   * and \a C give the types of the views.
+   *
+   * The propagation condition \a pc refers to all three views.
+   *
+   * Requires \code #include "gecode/int/linear.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template <class Val, class A, class B, class C>
+  class LqTer : public LinTer<Val,A,B,C,PC_INT_BND> {
+  protected:
+    using LinTer<Val,A,B,C,PC_INT_BND>::x0;
+    using LinTer<Val,A,B,C,PC_INT_BND>::x1;
+    using LinTer<Val,A,B,C,PC_INT_BND>::x2;
+    using LinTer<Val,A,B,C,PC_INT_BND>::c;
+
+    /// Constructor for cloning \a p
+    LqTer(Space* home, bool share, LqTer& p);
+    /// Constructor for creation
+    LqTer(Space* home, A x0, B x1, C x2, Val c);
+  public:
+    /// Constructor for rewriting \a p during cloning
+    LqTer(Space* home, bool share, Propagator& p, A x0, B x1, C x2, Val c);
+    /// Create copy during cloning
+    virtual Actor* copy(Space* home, bool share);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space* home);
+    /// Post propagator for \f$x_0+x_1+x_2 \leq c\f$
+    static ExecStatus post(Space* home, A x0, B x1, C x2, Val c);
+  };
+
+}}}
+
+#include "gecode/int/linear/ternary.icc"
+
+namespace Gecode { namespace Int { namespace Linear {
+
+  /*
+   * n-ary propagators
+   *
+   */
+
+  /**
+   * \brief Base-class for n-ary linear propagators
+   *
+   * The type \a Val can be either \c double or \c int, defining the
+   * numerical precision during propagation. Positive views are of
+   * type \a P whereas negative views are of type \a N.
+   *
+   * The propagation condition \a pc refers to all views.
+   */
+  template <class Val, class P, class N, PropCond pc>
+  class Lin : public Propagator {
+  protected:
+    /// Array of positive views
+    ViewArray<P> x;
+    /// Array of negative views
+    ViewArray<N> y;
+    /// Constant value
+    Val c;
+
+    /// Constructor for cloning \a p
+    Lin(Space* home, bool share, Lin& p);
+    /// Constructor for creation
+    Lin(Space* home, ViewArray<P>& x, ViewArray<N>& y, Val 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 Base-class for reified n-ary linear propagators
+   *
+   * The type \a Val can be either \c double or \c int, defining the
+   * numerical precision during propagation. Positive views are of
+   * type \a P whereas negative views are of type \a N.
+   *
+   * The propagation condition \a pc refers to all views.
+   */
+  template <class Val, class P, class N, PropCond pc, class Ctrl>
+  class ReLin : public Lin<Val,P,N,pc> {
+  protected:
+    /// Control view for reification
+    Ctrl b;
+    /// Constructor for cloning \a p
+    ReLin(Space* home, bool share, ReLin& p);
+    /// Constructor for creation
+    ReLin(Space* home, ViewArray<P>& x, ViewArray<N>& y, Val c, Ctrl b);
+  public:
+    /// Delete propagator and return its size
+    virtual size_t dispose(Space* home);
+  };
+
+  /**
+   * \brief Compute bounds information for positive views
+   *
+   * \relates Lin
+   */
+  template <class Val, class View>
+  void bounds_p(const Propagator*, ViewArray<View>& x,
+		Val& c, Val& sl, Val& su);
+
+  /**
+   * \brief Compute bounds information for negative views
+   *
+   * \relates Lin
+   */
+  template <class Val, class View>
+  void bounds_n(const Propagator*, ViewArray<View>& y,
+		Val& c, Val& sl, Val& su);
+
+  /**
+   * \brief %Propagator for bounds-consistent n-ary linear equality
+   *
+   * The type \a Val can be either \c double or \c int, defining the
+   * numerical precision during propagation. The types \a P and \a N
+   * give the types of the views.
+   *
+   * The propagation condition \a pc refers to both views.
+   *
+   * Requires \code #include "gecode/int/linear.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template <class Val, class P, class N>
+  class Eq : public Lin<Val,P,N,PC_INT_BND> {
+  protected:
+    using Lin<Val,P,N,PC_INT_BND>::x;
+    using Lin<Val,P,N,PC_INT_BND>::y;
+    using Lin<Val,P,N,PC_INT_BND>::c;
+
+    /// Constructor for cloning \a p
+    Eq(Space* home, bool share, Eq& p);
+  public:
+    /// Constructor for creation
+    Eq(Space* home, ViewArray<P>& x, ViewArray<N>& y, Val c);
+    /// Create copy during cloning
+    virtual Actor* copy(Space* home, bool share);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space* home);
+    /// Post propagator for \f$\sum_{i=0}^{|x|-1}x_i-\sum_{i=0}^{|y|-1}y_i=c\f$
+    static ExecStatus
+    post(Space* home, ViewArray<P>& x, ViewArray<N>& y, Val c);
+  };
+
+  /**
+   * \brief %Propagator for domain-consistent n-ary linear equality
+   *
+   * The type \a Val can be either \c double or \c int, defining the
+   * numerical precision during propagation. The types \a View
+   * give the type of the view.
+   *
+   * Requires \code #include "gecode/int/linear.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template <class Val, class View>
+  class DomEq
+    : public Lin<Val,View,View,PC_INT_DOM> {
+  protected:
+    using Lin<Val,View,View,PC_INT_DOM>::x;
+    using Lin<Val,View,View,PC_INT_DOM>::y;
+    using Lin<Val,View,View,PC_INT_DOM>::c;
+
+    /// Constructor for cloning \a p
+    DomEq(Space* home, bool share, DomEq& p);
+  public:
+    /// Constructor for creation
+    DomEq(Space* home, ViewArray<View>& x, ViewArray<View>& y, Val c);
+    /// Create copy during cloning
+    virtual Actor* copy(Space* home, bool share);
+    /// Propagation cost
+    virtual PropCost cost(void) const;
+    /// Perform propagation
+    virtual ExecStatus propagate(Space* home);
+    /// Post propagator for \f$\sum_{i=0}^{|x|-1}x_i-\sum_{i=0}^{|y|-1}y_i=c\f$
+    static ExecStatus
+    post(Space* home, ViewArray<View>& x, ViewArray<View>& y, Val c);
+  };
+
+  /**
+   * \brief %Propagator for reified bounds-consistent n-ary linear equality
+   *
+   * The type \a Val can be either \c double or \c int, defining the
+   * numerical precision during propagation. The types \a P and \a N
+   * give the types of the views.
+   *
+   * The propagation condition \a pc refers to both views.
+   *
+   * Requires \code #include "gecode/int/linear.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template <class Val, class P, class N, class Ctrl>
+  class ReEq : public ReLin<Val,P,N,PC_INT_BND,Ctrl> {
+  protected:
+    using ReLin<Val,P,N,PC_INT_BND,Ctrl>::x;
+    using ReLin<Val,P,N,PC_INT_BND,Ctrl>::y;
+    using ReLin<Val,P,N,PC_INT_BND,Ctrl>::c;
+    using ReLin<Val,P,N,PC_INT_BND,Ctrl>::b;
+
+    /// Constructor for cloning \a p
+    ReEq(Space* home, bool share, ReEq& p);
+  public:
+    /// Constructor for creation
+    ReEq(Space* home, ViewArray<P>& x, ViewArray<N>& y, Val c, Ctrl b);
+    /// Create copy during cloning
+    virtual Actor* copy(Space* home, bool share);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space* home);
+    /// Post propagator for \f$\left(\sum_{i=0}^{|x|-1}x_i-\sum_{i=0}^{|y|-1}y_i=c\right)\Leftrightarrow b\f$
+    static ExecStatus
+    post(Space* home, ViewArray<P>& x, ViewArray<N>& y, Val c, Ctrl b);
+  };
+
+  /**
+   * \brief %Propagator for bounds-consistent n-ary linear disequality
+   *
+   * The type \a Val can be either \c double or \c int, defining the
+   * numerical precision during propagation. The types \a P and \a N
+   * give the types of the views.
+   *
+   * The propagation condition \a pc refers to both views.
+   *
+   * Requires \code #include "gecode/int/linear.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template <class Val, class P, class N>
+  class Nq : public Lin<Val,P,N,PC_INT_VAL> {
+  protected:
+    using Lin<Val,P,N,PC_INT_VAL>::x;
+    using Lin<Val,P,N,PC_INT_VAL>::y;
+    using Lin<Val,P,N,PC_INT_VAL>::c;
+
+    /// Constructor for cloning \a p
+    Nq(Space* home, bool share, Nq& p);
+  public:
+    /// Constructor for creation
+    Nq(Space* home, ViewArray<P>& x, ViewArray<N>& y, Val c);
+    /// Create copy during cloning
+    virtual Actor* copy(Space* home, bool share);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space* home);
+    /// Post propagator for \f$\sum_{i=0}^{|x|-1}x_i-\sum_{i=0}^{|y|-1}y_i\neq c\f$
+    static ExecStatus
+    post(Space* home, ViewArray<P>& x, ViewArray<N>& y, Val c);
+  };
+
+  /**
+   * \brief %Propagator for bounds-consistent n-ary linear less or equal
+   *
+   * The type \a Val can be either \c double or \c int, defining the
+   * numerical precision during propagation. The types \a P and \a N
+   * give the types of the views.
+   *
+   * The propagation condition \a pc refers to both views.
+   *
+   * Requires \code #include "gecode/int/linear.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template <class Val, class P, class N>
+  class Lq : public Lin<Val,P,N,PC_INT_BND> {
+  protected:
+    using Lin<Val,P,N,PC_INT_BND>::x;
+    using Lin<Val,P,N,PC_INT_BND>::y;
+    using Lin<Val,P,N,PC_INT_BND>::c;
+
+    /// Constructor for cloning \a p
+    Lq(Space* home, bool share, Lq& p);
+  public:
+    /// Constructor for creation
+    Lq(Space* home, ViewArray<P>& x, ViewArray<N>& y, Val c);
+    /// Create copy during cloning
+    virtual Actor* copy(Space* home, bool share);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space* home);
+    /// Post propagator for \f$\sum_{i=0}^{|x|-1}x_i-\sum_{i=0}^{|y|-1}y_i\leq c\f$
+    static ExecStatus
+    post(Space* home, ViewArray<P>& x, ViewArray<N>& y, Val c);
+  };
+
+  /**
+   * \brief %Propagator for reified bounds-consistent n-ary linear less or equal
+   *
+   * The type \a Val can be either \c double or \c int, defining the
+   * numerical precision during propagation. The types \a P and \a N
+   * give the types of the views.
+   *
+   * The propagation condition \a pc refers to both views.
+   *
+   * Requires \code #include "gecode/int/linear.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template <class Val, class P, class N>
+  class ReLq : public ReLin<Val,P,N,PC_INT_BND,BoolView> {
+  protected:
+    using ReLin<Val,P,N,PC_INT_BND,BoolView>::x;
+    using ReLin<Val,P,N,PC_INT_BND,BoolView>::y;
+    using ReLin<Val,P,N,PC_INT_BND,BoolView>::c;
+    using ReLin<Val,P,N,PC_INT_BND,BoolView>::b;
+
+    /// Constructor for cloning \a p
+    ReLq(Space* home, bool share, ReLq& p);
+  public:
+    /// Constructor for creation
+    ReLq(Space* home, ViewArray<P>& x, ViewArray<N>& y, Val c, BoolView b);
+    /// Create copy during cloning
+    virtual Actor* copy(Space* home, bool share);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space* home);
+    /// Post propagator for \f$\left(\sum_{i=0}^{|x|-1}x_i-\sum_{i=0}^{|y|-1}y_i\leq c\right)\Leftrightarrow b\f$
+    static ExecStatus
+    post(Space* home, ViewArray<P>& x, ViewArray<N>& y, Val c, BoolView b);
+  };
+
+}}}
+
+#include "gecode/int/linear/nary.icc"
+#include "gecode/int/linear/dom.icc"
+
+namespace Gecode { namespace Int { namespace Linear {
+
+  /*
+   * Boolean linear propagators
+   *
+   */
+
+  /**
+   * \brief Baseclass for integer Boolean sum
+   *
+   */
+  template <class VX>
+  class LinBoolInt : public Propagator {
+  protected:
+    /// Boolean views
+    ViewArray<VX> x;
+    /// Views from x[0] ... x[n_s-1] have subscriptions
+    int n_s;
+    /// Righthandside
+    int c;
+    /// Constructor for cloning \a p
+    LinBoolInt(Space* home, bool share, LinBoolInt& p);
+    /// Constructor for creation
+    LinBoolInt(Space* home, ViewArray<VX>& x, int n_s, 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 integer equal to Boolean sum (cardinality)
+   *
+   * Requires \code #include "gecode/int/linear.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template <class VX>
+  class EqBoolInt : public LinBoolInt<VX> {
+  protected:
+    using LinBoolInt<VX>::x;
+    using LinBoolInt<VX>::n_s;
+    using LinBoolInt<VX>::c;
+    /// Constructor for cloning \a p
+    EqBoolInt(Space* home, bool share, EqBoolInt& p);
+    /// Constructor for creation
+    EqBoolInt(Space* home, ViewArray<VX>& x, int n_s, 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$\sum_{i=0}^{|x|-1}x_i = c\f$
+    static ExecStatus post(Space* home, ViewArray<VX>& x, int c);
+  };
+
+  /**
+   * \brief %Propagator for integer less or equal to Boolean sum (cardinality)
+   *
+   * Requires \code #include "gecode/int/linear.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template <class VX>
+  class GqBoolInt : public LinBoolInt<VX> {
+  protected:
+    using LinBoolInt<VX>::x;
+    using LinBoolInt<VX>::n_s;
+    using LinBoolInt<VX>::c;
+    /// Constructor for cloning \a p
+    GqBoolInt(Space* home, bool share, GqBoolInt& p);
+    /// Constructor for creation
+    GqBoolInt(Space* home, ViewArray<VX>& x, int n_s, 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$\sum_{i=0}^{|x|-1}x_i \geq c\f$
+    static ExecStatus post(Space* home, ViewArray<VX>& x, int c);
+  };
+
+  /**
+   * \brief %Propagator for integer disequal to Boolean sum (cardinality)
+   *
+   * Requires \code #include "gecode/int/linear.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template<class VX>
+  class NqBoolInt : public BinaryPropagator<VX,PC_INT_VAL> {
+  protected:
+    using BinaryPropagator<VX,PC_INT_VAL>::x0;
+    using BinaryPropagator<VX,PC_INT_VAL>::x1;
+    /// Views not yet subscribed to
+    ViewArray<VX> x;
+    /// Righthandside
+    int c;
+    /// Update subscription
+    bool resubscribe(Space* home, VX& y);
+    /// Constructor for posting
+    NqBoolInt(Space* home,  ViewArray<VX>& b, int c);
+    /// Constructor for cloning \a p
+    NqBoolInt(Space* home, bool share, NqBoolInt<VX>& 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$\sum_{i=0}^{|x|-1}x_i \neq c\f$
+    static  ExecStatus post(Space* home, ViewArray<VX>& b, int c);
+  };
+
+}}}
+
+#include "gecode/int/linear/bool-int.icc"
+
+namespace Gecode { namespace Int { namespace Linear {
+
+  /**
+   * \brief Base-class for Boolean linear propagators
+   *
+   */
+  template <class XV, class YV>
+  class LinBoolView : public Propagator {
+  protected:
+    /// Boolean views
+    ViewArray<XV> x;
+    /// View to compare number of assigned Boolean views to
+    YV y;
+    /// Righthandside (constant part from Boolean views assigned to 1)
+    int c;
+    /// Constructor for cloning \a p
+    LinBoolView(Space* home, bool share, LinBoolView& p);
+    /// Constructor for creation
+    LinBoolView(Space* home, ViewArray<XV>& x, YV 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 equality to Boolean sum (cardinality)
+   *
+   * Requires \code #include "gecode/int/linear.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template <class XV, class YV>
+  class EqBoolView : public LinBoolView<XV,YV> {
+  protected:
+    using LinBoolView<XV,YV>::x;
+    using LinBoolView<XV,YV>::y;
+    using LinBoolView<XV,YV>::c;
+
+    /// Constructor for cloning \a p
+    EqBoolView(Space* home, bool share, EqBoolView& p);
+    /// Constructor for creation
+    EqBoolView(Space* home, ViewArray<XV>& x, YV 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$\sum_{i=0}^{|x|-1}x_i+n = y\f$
+    static ExecStatus post(Space* home, ViewArray<XV>& x, YV y, int c);
+  };
+
+  /**
+   * \brief %Propagator for disequality to Boolean sum (cardinality)
+   *
+   * Requires \code #include "gecode/int/linear.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template <class XV, class YV>
+  class NqBoolView : public LinBoolView<XV,YV> {
+  protected:
+    using LinBoolView<XV,YV>::x;
+    using LinBoolView<XV,YV>::y;
+    using LinBoolView<XV,YV>::c;
+
+    /// Constructor for cloning \a p
+    NqBoolView(Space* home, bool share, NqBoolView& p);
+    /// Constructor for creation
+    NqBoolView(Space* home, ViewArray<XV>& x, YV 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$\sum_{i=0}^{|x|-1}x_i+n \neq y\f$
+    static ExecStatus post(Space* home, ViewArray<XV>& x, YV y, int c);
+  };
+
+  /**
+   * \brief %Propagator for greater or equal to Boolean sum (cardinality)
+   *
+   * Requires \code #include "gecode/int/linear.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  template <class XV, class YV>
+  class GqBoolView : public LinBoolView<XV,YV> {
+  protected:
+    using LinBoolView<XV,YV>::x;
+    using LinBoolView<XV,YV>::y;
+    using LinBoolView<XV,YV>::c;
+
+    /// Constructor for cloning \a p
+    GqBoolView(Space* home, bool share, GqBoolView& p);
+    /// Constructor for creation
+    GqBoolView(Space* home, ViewArray<XV>& x, YV 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$\sum_{i=0}^{|x|-1}x_i+n \geq y\f$
+    static ExecStatus post(Space* home, ViewArray<XV>& x, YV y, int c);
+  };
+
+}}}
+
+#include "gecode/int/linear/bool-view.icc"
+
+namespace Gecode { namespace Int { namespace Linear {
+
+
+  /*
+   * Support for preprocessing and posting
+   *
+   */
+
+  /**
+   * \brief Class for describing linear term \f$a\cdot x\f$
+   *
+   */
+  class Term {
+  public:
+    /// Coefficient
+    int a;
+    /// View
+    IntView x;
+  };
+
+  /**
+   * \brief Post propagator for linear constraint
+   * \param e array of linear terms
+   * \param n size of array
+   * \param r type of relation
+   * \param c result of linear constraint
+   *
+   * All variants for linear constraints share the following properties:
+   *  - Only bounds-consistency is supported.
+   *  - Variables occuring multiply in the term array are replaced
+   *    by a single occurence: for example, \f$ax+bx\f$ becomes
+   *    \f$(a+b)x\f$.
+   *  - If in the above simplification the value for \f$(a+b)\f$ (or for
+   *    \f$a\f$ and \f$b\f$) exceeds the limits for integers as
+   *    defined in Limits::Int, an exception of type
+   *    Int::NumericalOverflow is thrown.
+   *  - Assume linear terms for the constraint
+   *    \f$\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_r c\f$.
+   *    If  \f$|c|+\sum_{i=0}^{|x|-1}a_i\cdot x_i\f$ exceeds the limits
+   *    for doubles as defined in Limits::Int, an exception of
+   *    type Int::NumericalOverflow is thrown.
+   *  - In all other cases, the created propagators are accurate (that
+   *    is, they will not silently overflow during propagation).
+   *
+   * Requires \code #include "gecode/int/linear.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  GECODE_INT_EXPORT void
+  post(Space* home, Term t[], int n, IntRelType r, int c, IntConLevel=ICL_DEF);
+
+  /**
+   * \brief Post reified propagator for linear constraint
+   * \param e array of linear terms
+   * \param n size of array
+   * \param r type of relation
+   * \param c result of linear constraint
+   * \param b Boolean control view
+   *
+   * All variants for linear constraints share the following properties:
+   *  - Only bounds-consistency is supported.
+   *  - Variables occuring multiply in the term array are replaced
+   *    by a single occurence: for example, \f$ax+bx\f$ becomes
+   *    \f$(a+b)x\f$.
+   *  - If in the above simplification the value for \f$(a+b)\f$ (or for
+   *    \f$a\f$ and \f$b\f$) exceeds the limits for integers as
+   *    defined in Limits::Int, an exception of type
+   *    Int::NumericalOverflow is thrown.
+   *  - Assume linear terms for the constraint
+   *    \f$\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_r c\f$.
+   *    If  \f$|c|+\sum_{i=0}^{|x|-1}a_i\cdot x_i\f$ exceeds the limits
+   *    for doubles as defined in Limits::Int, an exception of
+   *    type Int::NumericalOverflow is thrown.
+   *  - In all other cases, the created propagators are accurate (that
+   *    is, they will not silently overflow during propagation).
+   *
+   * Requires \code #include "gecode/int/linear.hh" \endcode
+   * \ingroup FuncIntProp
+   */
+  GECODE_INT_EXPORT void
+  post(Space* home, Term t[], int n, IntRelType r, int c, BoolView b);
+
+}}}
+
+#endif
+
+// STATISTICS: int-prop
+