dep-selector-libgecode 1.0.0.alpha.0

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/set/exception.hpp

@@ -0,0 +1,146 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *     Guido Tack <tack@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2004, 2005
+ *     Guido Tack, 2005
+ *
+ *  Last modified:
+ *     $Date: 2009-07-21 00:05:21 +1000 (Tue, 21 Jul 2009) $ by $Author: tack $
+ *     $Revision: 9380 $
+ *
+ *  This file is part of Gecode, the generic constraint
+ *  development environment:
+ *     http://www.gecode.org
+ *
+ *  Permission is hereby granted, free of charge, to any person obtaining
+ *  a copy of this software and associated documentation files (the
+ *  "Software"), to deal in the Software without restriction, including
+ *  without limitation the rights to use, copy, modify, merge, publish,
+ *  distribute, sublicense, and/or sell copies of the Software, and to
+ *  permit persons to whom the Software is furnished to do so, subject to
+ *  the following conditions:
+ *
+ *  The above copyright notice and this permission notice shall be
+ *  included in all copies or substantial portions of the Software.
+ *
+ *  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+ *  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+ *  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+ *  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+ *  LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+ *  OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+ *  WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+ *
+ */
+
+namespace Gecode { namespace Set {
+
+  /**
+   * \defgroup FuncThrowSet Set exceptions
+   * \ingroup FuncThrow
+   */
+
+  /// %Exception: Value out of limits
+  class GECODE_VTABLE_EXPORT OutOfLimits : public Exception {
+  public:
+    /// Initialize with location \a l
+    OutOfLimits(const char* l);
+  };
+
+  //@{
+  /// %Exception: %Variable created with empty domain
+  class GECODE_VTABLE_EXPORT VariableEmptyDomain : public Exception {
+  public:
+    /// Initialize with location \a l
+    VariableEmptyDomain(const char* l);
+  };
+
+  /// %Exception: No arguments available in argument array
+  class GECODE_VTABLE_EXPORT TooFewArguments : public Exception {
+  public:
+    /// Initialize with location \a l
+    TooFewArguments(const char* l);
+  };
+
+  /// %Exception: Arguments are of different size
+  class GECODE_VTABLE_EXPORT ArgumentSizeMismatch : public Exception  {
+  public:
+    /// Initialize with location \a l
+    ArgumentSizeMismatch(const char* l);
+  };
+
+  /// %Exception: Unknown value or variable selection passed as argument
+  class GECODE_VTABLE_EXPORT UnknownBranching : public Exception {
+  public:
+    /// Initialize with location \a l
+    UnknownBranching(const char* l);
+  };
+
+  /// %Exception: Unknown relation type passed as argument
+  class GECODE_VTABLE_EXPORT UnknownRelation : public Exception {
+  public:
+    /// Initialize with location \a l
+    UnknownRelation(const char* l);
+  };
+
+  /// %Exception: Unknown operation type passed as argument
+  class GECODE_VTABLE_EXPORT UnknownOperation : public Exception {
+  public:
+    /// Initialize with location \a l
+    UnknownOperation(const char* l);
+  };
+
+  /// %Exception: Illegal operation passed as argument
+  class GECODE_VTABLE_EXPORT IllegalOperation : public Exception  {
+  public:
+    /// Initialize with location \a l
+    IllegalOperation(const char* l);
+  };
+
+  //@}
+
+  /**
+   * Classes for exceptions raised by set module
+   *
+   */
+
+  inline
+  OutOfLimits::OutOfLimits(const char* l)
+    : Exception(l,"Number out of limits") {}
+
+  inline
+  VariableEmptyDomain::VariableEmptyDomain(const char* l)
+    : Exception(l,"Attempt to create variable with empty domain") {}
+
+  inline
+  TooFewArguments::TooFewArguments(const char* l)
+    : Exception(l,"Passed argument array has too few elements") {}
+
+  inline
+  ArgumentSizeMismatch::ArgumentSizeMismatch(const char* l)
+    : Exception(l,"Sizes of argument arrays mismatch") {}
+
+  inline
+  IllegalOperation::IllegalOperation(const char* l)
+    : Exception(l,"Illegal operation type") {}
+
+  inline
+  UnknownBranching::UnknownBranching(const char* l)
+    : Exception(l,"Unknown branching type") {}
+
+  inline
+  UnknownRelation::UnknownRelation(const char* l)
+    : Exception(l,"Unknown relation type") {}
+
+  inline
+  UnknownOperation::UnknownOperation(const char* l)
+    : Exception(l,"Unknown operation type") {}
+
+}}
+
+// STATISTICS: set-other
+

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/set/exec.cpp

@@ -0,0 +1,58 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2009
+ *
+ *  Last modified:
+ *     $Date: 2010-03-04 03:40:32 +1100 (Thu, 04 Mar 2010) $ by $Author: schulte $
+ *     $Revision: 10365 $
+ *
+ *  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/set.hh>
+#include <gecode/kernel/wait.hh>
+
+namespace Gecode {
+
+  void
+  wait(Home home, SetVar x, void (*c)(Space& home)) {
+    if (home.failed()) return;
+    GECODE_ES_FAIL(Kernel::UnaryWait<Set::SetView>::post(home,x,c));
+  }
+
+  void
+  wait(Home home, const SetVarArgs& x, void (*c)(Space& home)) {
+    if (home.failed()) return;
+    ViewArray<Set::SetView> xv(home,x);
+    GECODE_ES_FAIL(Kernel::NaryWait<Set::SetView>::post(home,xv,c));
+  }
+
+}
+
+// STATISTICS: set-post

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

@@ -0,0 +1,191 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Guido Tack <tack@gecode.org>
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Guido Tack, 2004
+ *     Christian Schulte, 2004
+ *
+ *  Last modified:
+ *     $Date: 2011-08-18 20:26:27 +1000 (Thu, 18 Aug 2011) $ by $Author: tack $
+ *     $Revision: 12314 $
+ *
+ *  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/set.hh>
+
+#include <gecode/set/int.hh>
+#include <gecode/set/rel.hh>
+
+using namespace Gecode::Int;
+
+namespace Gecode {
+
+  void
+  rel(Home home, SetVar s, IntRelType r, IntVar x) {
+    if (home.failed()) return;
+    switch (r) {
+    case IRT_EQ:
+      {
+        Gecode::Int::IntView xv(x);
+        Set::SingletonView xsingle(xv);
+        GECODE_ES_FAIL(
+                       (Set::Rel::Eq<Set::SetView,Set::SingletonView>
+                        ::post(home,s,xsingle)));
+
+      }
+      break;
+    case IRT_NQ:
+      {
+        Gecode::Set::SetView sv(s);
+        GECODE_ME_FAIL( sv.cardMin(home, 1));
+        Gecode::Int::IntView xv(x);
+        Set::SingletonView xsingle(xv);
+        GECODE_ES_FAIL(
+                       (Set::Rel::NoSubset<Set::SingletonView,Set::SetView>
+                        ::post(home,xsingle,sv)));
+
+      }
+      break;
+    case IRT_LQ:
+      {
+        IntVar tmp(home, Int::Limits::min, Int::Limits::max);
+        rel(home, tmp, IRT_LQ, x);
+        GECODE_ES_FAIL(Set::Int::MaxElement<Set::SetView>::post(home,s,tmp));
+      }
+      break;
+    case IRT_LE:
+      {
+        IntVar tmp(home, Int::Limits::min, Int::Limits::max);
+        rel(home, tmp, IRT_LE, x);
+        GECODE_ES_FAIL(Set::Int::MaxElement<Set::SetView>::post(home,s,tmp));
+      }
+      break;
+    case IRT_GQ:
+      {
+        IntVar tmp(home, Int::Limits::min, Int::Limits::max);
+        rel(home, tmp, IRT_GQ, x);
+        GECODE_ES_FAIL(Set::Int::MinElement<Set::SetView>::post(home,s,tmp));
+      }
+      break;
+    case IRT_GR:
+      {
+        IntVar tmp(home, Int::Limits::min, Int::Limits::max);
+        rel(home, tmp, IRT_GR, x);
+        GECODE_ES_FAIL(Set::Int::MinElement<Set::SetView>::post(home,s,tmp));
+      }
+      break;
+    default:
+      throw UnknownRelation("Set::rel");
+    }
+
+  }
+
+  void
+  rel(Home home, IntVar x, IntRelType r, SetVar s) {
+    IntRelType rr;
+    switch (r) {
+    case IRT_LE: rr=IRT_GR; break;
+    case IRT_LQ: rr=IRT_GQ; break;
+    case IRT_GR: rr=IRT_LE; break;
+    case IRT_GQ: rr=IRT_LQ; break;
+    default: rr=r;
+    }
+    rel(home, s, rr, x);
+  }
+
+  void
+  min(Home home, SetVar s, IntVar x){
+    if (home.failed()) return;
+    GECODE_ES_FAIL(Set::Int::MinElement<Set::SetView>::post(home,s,x));
+  }
+  void
+  notMin(Home home, SetVar s, IntVar x){
+    if (home.failed()) return;
+    GECODE_ES_FAIL(Set::Int::NotMinElement<Set::SetView>::post(home,s,x));
+  }
+  void
+  min(Home home, SetVar s, IntVar x, BoolVar b){
+    if (home.failed()) return;
+    GECODE_ES_FAIL(
+                   Set::Int::ReMinElement<Set::SetView>::post(home,s,x,b));
+  }
+  void
+  max(Home home, SetVar s, IntVar x){
+    if (home.failed()) return;
+    GECODE_ES_FAIL(Set::Int::MaxElement<Set::SetView>::post(home,s,x));
+  }
+  void
+  notMax(Home home, SetVar s, IntVar x){
+    if (home.failed()) return;
+    GECODE_ES_FAIL(Set::Int::NotMaxElement<Set::SetView>::post(home,s,x));
+  }
+  void
+  max(Home home, SetVar s, IntVar x, BoolVar b){
+    if (home.failed()) return;
+    GECODE_ES_FAIL(
+                   Set::Int::ReMaxElement<Set::SetView>::post(home,s,x,b));
+  }
+
+  void
+  channelSorted(Home home, const IntVarArgs& x, SetVar y) {
+    if (home.failed()) return;
+    ViewArray<IntView> xa(home,x);
+    GECODE_ES_FAIL(Set::Int::Match<Set::SetView>::post(home,y,xa));
+  }
+
+  void
+  channel(Home home, const IntVarArgs& x, const SetVarArgs& y) {
+    if (home.failed()) return;
+    ViewArray<Int::CachedView<Int::IntView> > xa(home,x.size());
+    for (int i=x.size(); i--;)
+      new (&xa[i]) Int::CachedView<Int::IntView>(x[i]);
+    ViewArray<Set::CachedView<Set::SetView> > ya(home,y.size());
+    for (int i=y.size(); i--;)
+      new (&ya[i]) Set::CachedView<Set::SetView>(y[i]);
+    GECODE_ES_FAIL((Set::Int::ChannelInt<Set::SetView>::post(home,xa,ya)));
+  }
+
+  void
+  channel(Home home, const BoolVarArgs& x, SetVar y) {
+    if (home.failed()) return;
+    ViewArray<Int::BoolView> xv(home,x);
+    GECODE_ES_FAIL((Set::Int::ChannelBool<Set::SetView>
+                         ::post(home,xv,y)));
+  }
+
+  void weights(Home home, IntSharedArray elements, IntSharedArray weights,
+               SetVar x, IntVar y) {
+    if (home.failed()) return;
+    GECODE_ES_FAIL(Set::Int::Weights<Set::SetView>::post(home,elements,
+                                                              weights,x,y));
+  }
+
+}
+
+// STATISTICS: set-post

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

@@ -0,0 +1,459 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Guido Tack <tack@gecode.org>
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Guido Tack, 2004
+ *     Christian Schulte, 2004
+ *
+ *  Last modified:
+ *     $Date: 2011-05-02 08:24:42 +1000 (Mon, 02 May 2011) $ by $Author: tack $
+ *     $Revision: 11973 $
+ *
+ *  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_SET_INT_HH__
+#define __GECODE_SET_INT_HH__
+
+#include <gecode/set.hh>
+
+namespace Gecode { namespace Set { namespace Int {
+
+  /**
+   * \namespace Gecode::Set::Int
+   * \brief Propagators connecting set and int variables
+   */
+
+  /**
+   * \brief %Propagator for minimum element
+   *
+   * Requires \code #include <gecode/set/int.hh> \endcode
+   * \ingroup FuncSetProp
+   */
+  template<class View>
+  class MinElement :
+    public MixBinaryPropagator<View,PC_SET_ANY,
+      Gecode::Int::IntView,Gecode::Int::PC_INT_BND> {
+  protected:
+    using MixBinaryPropagator<View,PC_SET_ANY,
+      Gecode::Int::IntView,Gecode::Int::PC_INT_BND>::x0;
+    using MixBinaryPropagator<View,PC_SET_ANY,
+      Gecode::Int::IntView,Gecode::Int::PC_INT_BND>::x1;
+    /// Constructor for cloning \a p
+    MinElement(Space& home, bool share,MinElement& p);
+    /// Constructor for posting
+    MinElement(Home home, View, Gecode::Int::IntView);
+  public:
+    /// Copy propagator during cloning
+    virtual Actor* copy(Space& home,bool);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
+    /// Post propagator for \a x is the minimal element of \a s
+    static ExecStatus post(Home home, View s, Gecode::Int::IntView x);
+  };
+
+  /**
+   * \brief %Propagator for not minimum element
+   *
+   * Requires \code #include "gecode/set/int.hh" \endcode
+   * \ingroup FuncSetProp
+   */
+  template<class View>
+  class NotMinElement :
+    public MixBinaryPropagator<View,PC_SET_ANY,
+      Gecode::Int::IntView,Gecode::Int::PC_INT_DOM> {
+  protected:
+    using MixBinaryPropagator<View,PC_SET_ANY,
+      Gecode::Int::IntView,Gecode::Int::PC_INT_DOM>::x0;
+    using MixBinaryPropagator<View,PC_SET_ANY,
+      Gecode::Int::IntView,Gecode::Int::PC_INT_DOM>::x1;
+    /// Constructor for cloning \a p
+    NotMinElement(Space& home, bool share,NotMinElement& p);
+    /// Constructor for posting
+    NotMinElement(Home home, View, Gecode::Int::IntView);
+  public:
+    /// Copy propagator during cloning
+    virtual Actor* copy(Space& home,bool);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
+    /// Post propagator for \a x is not the minimal element of \a s
+    static ExecStatus post(Home home, View s, Gecode::Int::IntView x);
+  };
+
+  /**
+   * \brief %Propagator for reified minimum element
+   *
+   * Requires \code #include "gecode/set/int.hh" \endcode
+   * \ingroup FuncSetProp
+   */
+  template<class View>
+  class ReMinElement :
+    public Gecode::Int::ReMixBinaryPropagator<View,PC_SET_ANY,
+      Gecode::Int::IntView,Gecode::Int::PC_INT_DOM,Gecode::Int::BoolView> {
+  protected:
+    using Gecode::Int::ReMixBinaryPropagator<View,PC_SET_ANY,
+      Gecode::Int::IntView,Gecode::Int::PC_INT_DOM,Gecode::Int::BoolView>::x0;
+    using Gecode::Int::ReMixBinaryPropagator<View,PC_SET_ANY,
+      Gecode::Int::IntView,Gecode::Int::PC_INT_DOM,Gecode::Int::BoolView>::x1;
+    using Gecode::Int::ReMixBinaryPropagator<View,PC_SET_ANY,
+      Gecode::Int::IntView,Gecode::Int::PC_INT_DOM,Gecode::Int::BoolView>::b;
+    /// Constructor for cloning \a p
+    ReMinElement(Space& home, bool share,ReMinElement& p);
+    /// Constructor for posting
+    ReMinElement(Home home, View, Gecode::Int::IntView,
+                 Gecode::Int::BoolView);
+  public:
+    /// Copy propagator during cloning
+    virtual Actor* copy(Space& home,bool);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
+    /// Post reified propagator for \a b iff \a x is the minimal element of \a s
+    static ExecStatus post(Home home, View s, Gecode::Int::IntView x,
+                           Gecode::Int::BoolView b);
+  };
+
+  /**
+   * \brief %Propagator for maximum element
+   *
+   * Requires \code #include <gecode/set/int.hh> \endcode
+   * \ingroup FuncSetProp
+   */
+  template<class View>
+  class MaxElement :
+    public MixBinaryPropagator<View,PC_SET_ANY,Gecode::Int::IntView,Gecode::Int::PC_INT_BND> {
+  protected:
+    using MixBinaryPropagator<View,PC_SET_ANY,
+      Gecode::Int::IntView,Gecode::Int::PC_INT_BND>::x0;
+    using MixBinaryPropagator<View,PC_SET_ANY,
+      Gecode::Int::IntView,Gecode::Int::PC_INT_BND>::x1;
+    /// Constructor for cloning \a p
+    MaxElement(Space& home, bool share,MaxElement& p);
+    /// Constructor for posting
+    MaxElement(Home home, View, Gecode::Int::IntView);
+  public:
+    /// Copy propagator during cloning
+    virtual Actor* copy(Space& home,bool);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
+    /// Post propagator for \a x is the largest element of \a s
+    static ExecStatus post(Home home, View s, Gecode::Int::IntView x);
+  };
+
+  /**
+   * \brief %Propagator for not maximum element
+   *
+   * Requires \code #include "gecode/set/int.hh" \endcode
+   * \ingroup FuncSetProp
+   */
+  template<class View>
+  class NotMaxElement :
+    public MixBinaryPropagator<View,PC_SET_ANY,
+      Gecode::Int::IntView,Gecode::Int::PC_INT_DOM> {
+  protected:
+    using MixBinaryPropagator<View,PC_SET_ANY,
+      Gecode::Int::IntView,Gecode::Int::PC_INT_DOM>::x0;
+    using MixBinaryPropagator<View,PC_SET_ANY,
+      Gecode::Int::IntView,Gecode::Int::PC_INT_DOM>::x1;
+    /// Constructor for cloning \a p
+    NotMaxElement(Space& home, bool share,NotMaxElement& p);
+    /// Constructor for posting
+    NotMaxElement(Home home, View, Gecode::Int::IntView);
+  public:
+    /// Copy propagator during cloning
+    virtual Actor* copy(Space& home,bool);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
+    /// Post propagator for \a x is not the largest element of \a s
+    static ExecStatus post(Home home, View s, Gecode::Int::IntView x);
+  };
+
+  /**
+   * \brief %Reified propagator for maximum element
+   *
+   * Requires \code #include "gecode/set/int.hh" \endcode
+   * \ingroup FuncSetProp
+   */
+  template<class View>
+  class ReMaxElement :
+    public Gecode::Int::ReMixBinaryPropagator<View,PC_SET_ANY,
+      Gecode::Int::IntView,Gecode::Int::PC_INT_DOM,Gecode::Int::BoolView> {
+  protected:
+    using Gecode::Int::ReMixBinaryPropagator<View,PC_SET_ANY,
+      Gecode::Int::IntView,Gecode::Int::PC_INT_DOM,Gecode::Int::BoolView>::x0;
+    using Gecode::Int::ReMixBinaryPropagator<View,PC_SET_ANY,
+      Gecode::Int::IntView,Gecode::Int::PC_INT_DOM,Gecode::Int::BoolView>::x1;
+    using Gecode::Int::ReMixBinaryPropagator<View,PC_SET_ANY,
+      Gecode::Int::IntView,Gecode::Int::PC_INT_DOM,Gecode::Int::BoolView>::b;
+    /// Constructor for cloning \a p
+    ReMaxElement(Space& home, bool share,ReMaxElement& p);
+    /// Constructor for posting
+    ReMaxElement(Home home, View, Gecode::Int::IntView, Gecode::Int::BoolView);
+  public:
+    /// Copy propagator during cloning
+    virtual Actor* copy(Space& home,bool);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
+    /// Post reified propagator for \a b iff \a x is the largest element of \a s
+    static ExecStatus post(Home home, View s, Gecode::Int::IntView x,
+                           Gecode::Int::BoolView b);
+  };
+
+  /**
+   * \brief %Propagator for cardinality
+   *
+   * Requires \code #include <gecode/set/int.hh> \endcode
+   * \ingroup FuncSetProp
+   */
+  template<class View>
+  class Card :
+    public MixBinaryPropagator<View,PC_SET_CARD,
+      Gecode::Int::IntView,Gecode::Int::PC_INT_BND> {
+  protected:
+    using MixBinaryPropagator<View,PC_SET_CARD,
+      Gecode::Int::IntView,Gecode::Int::PC_INT_BND>::x0;
+    using MixBinaryPropagator<View,PC_SET_CARD,
+      Gecode::Int::IntView,Gecode::Int::PC_INT_BND>::x1;
+    /// Constructor for cloning \a p
+    Card(Space& home, bool share,Card& p);
+    /// Constructor for posting
+    Card(Home home, View, Gecode::Int::IntView);
+  public:
+    /// Copy propagator during cloning
+    virtual Actor* copy(Space& home,bool);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
+    /// Post propagator for \f$ |s|=x \f$
+    static ExecStatus post(Home home, View s, Gecode::Int::IntView x);
+  };
+
+
+  /**
+   * \brief %Propagator for the match constraint
+   *
+   * Requires \code #include <gecode/set/int.hh> \endcode
+   * \ingroup FuncSetProp
+   */
+  template<class View>
+  class Match : public Propagator {
+  protected:
+    /// SetView for the match
+    View x0;
+    /// IntViews that together form the set \a x0
+    ViewArray<Gecode::Int::IntView> xs;
+
+    /// Constructor for cloning \a p
+    Match(Space& home, bool share,Match& p);
+    /// Constructor for posting
+    Match(Home home, View, ViewArray<Gecode::Int::IntView>&);
+  public:
+    /// Copy propagator during cloning
+    virtual Actor* copy(Space& home,bool);
+    /// Cost function (defined as PC_LINEAR_LO)
+    virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
+    /// Delete Propagator
+    virtual size_t dispose(Space& home);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
+    /// Post propagator that propagates that \a s contains the \f$x_i\f$, which are sorted in non-descending order
+    static ExecStatus post(Home home, View s,
+                           ViewArray<Gecode::Int::IntView>& x);
+  };
+
+  /**
+   * \brief %Propagator for channelling between variable-value-dual models
+   *
+   * Implements channelling constraints between IntVars and SetVars.
+   * For IntVars \f$x_0,\dots,x_n\f$ and SetVars \f$y_0,\dots,y_m\f$ it
+   * propagates the constraint \f$x_i=j \Leftrightarrow i\in y_j\f$.
+   *
+   * Can be used to implement the "channelling constraints" for disjoint with
+   * cardinalities from
+   *   "Disjoint, Partition and Intersection Constraints for
+   *    Set and Multiset Variables"
+   *    Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Toby Walsh
+   *    CP 2004
+   *
+   * Requires \code #include <gecode/set/int.hh> \endcode
+   * \ingroup FuncSetProp
+   */
+  template<class View>
+  class ChannelInt : public Propagator {
+  protected:
+    /// IntViews, \f$x_i\f$ reflects which set contains element \f$i\f$
+    ViewArray<Gecode::Int::CachedView<Gecode::Int::IntView> > xs;
+    /// SetViews that are constrained to be disjoint
+    ViewArray<CachedView<View> > ys;
+
+    /// Constructor for cloning \a p
+    ChannelInt(Space& home, bool share,ChannelInt& p);
+    /// Constructor for posting
+    ChannelInt(Home home,
+               ViewArray<Gecode::Int::CachedView<Gecode::Int::IntView> >&,
+               ViewArray<CachedView<View> >&);
+  public:
+    /// Copy propagator during cloning
+    virtual Actor*   copy(Space& home,bool);
+    /// Cost function (defined as PC_QUADRATIC_LO)
+    virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
+    /// Delete propagator and return its size
+    virtual size_t dispose(Space& home);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
+    /// Post propagator for \f$x_i=j \Leftrightarrow i\in y_j\f$
+    static ExecStatus post(Home home,
+                           ViewArray<Gecode::Int::CachedView<
+                            Gecode::Int::IntView> >& x,
+                           ViewArray<CachedView<View> >& y);
+  };
+
+  /**
+   * \brief %Propagator for channelling between set variable and its
+   * characteristic function
+   *
+   * Implements channelling constraints between BoolVar and a SetVar.
+   * For BoolVars \f$x_0,\dots,x_n\f$ and SetVar \f$y\f$ it
+   * propagates the constraint \f$x_i=1 \Leftrightarrow i\in y\f$.
+   *
+   * Requires \code #include <gecode/set/int.hh> \endcode
+   * \ingroup FuncSetProp
+   */
+  template<class View>
+  class ChannelBool
+    : public MixNaryOnePropagator<Gecode::Int::BoolView,
+                                  Gecode::Int::PC_BOOL_VAL,
+                                  View,PC_GEN_NONE> {
+  protected:
+    typedef MixNaryOnePropagator<Gecode::Int::BoolView,
+                                 Gecode::Int::PC_BOOL_VAL,
+                                 View,PC_GEN_NONE> Super;
+    using Super::x;
+    using Super::y;
+
+    /// Constructor for cloning \a p
+    ChannelBool(Space& home, bool share,ChannelBool& p);
+    /// Constructor for posting
+    ChannelBool(Home home,ViewArray<Gecode::Int::BoolView>&,
+                View);
+
+    /// %Advisor storing a single index
+    class IndexAdvisor : public Advisor {
+    protected:
+      /// The single index
+      int idx;
+    public:
+      /// Constructor for creation
+      template<class A>
+      IndexAdvisor(Space& home, ChannelBool<View>& p, Council<A>& c,
+                   int index);
+      /// Constructor for cloning \a a
+      IndexAdvisor(Space& home, bool share, IndexAdvisor& a);
+      /// Access index
+      int index(void) const;
+      /// Delete advisor
+      template<class A>
+      void dispose(Space& home, Council<A>& c);
+    };
+
+    /// Council for managing advisors
+    Council<IndexAdvisor> co;
+    /// Accumulated delta information
+    SetDelta delta;
+    /// Accumulated zero Booleans
+    GLBndSet zeros;
+    /// Accumulated one Booleans
+    GLBndSet ones;
+    /// Flag whether propagation is currently running
+    bool running;
+  public:
+    /// Copy propagator during cloning
+    virtual Actor*   copy(Space& home,bool);
+    /// Cost function (defined as PC_QUADRATIC_LO)
+    virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
+    /// Delete propagator and return its size
+    virtual size_t dispose(Space& home);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
+    /// Give advice to propagator
+    virtual ExecStatus advise(Space& home, Advisor& a, const Delta& d);
+    /// Post propagator for \f$x_i=j \Leftrightarrow i\in y_j\f$
+    static ExecStatus post(Home home,ViewArray<Gecode::Int::BoolView>& x,
+                           View y);
+  };
+
+  /**
+   * \brief %Propagator for weight of a set
+   *
+   * Requires \code #include <gecode/set/int.hh> \endcode
+   * \ingroup FuncSetProp
+   */
+  template<class View>
+  class Weights : public Propagator {
+  protected:
+    /// List of elements in the upper bound
+    SharedArray<int> elements;
+    /// Weights for the elements in the upper bound
+    SharedArray<int> weights;
+
+    /// The set view
+    View x;
+    /// The integer view
+    Gecode::Int::IntView y;
+
+    /// Constructor for cloning \a p
+    Weights(Space& home, bool share,Weights& p);
+    /// Constructor for posting
+    Weights(Home home, const SharedArray<int>&, const SharedArray<int>&,
+            View, Gecode::Int::IntView);
+  public:
+    /// Copy propagator during cloning
+    virtual Actor* copy(Space& home,bool);
+    /// Cost function (defined as PC_LINEAR_LO)
+    virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
+    /// Delete propagator and return its size
+    virtual size_t dispose(Space& home);
+    /// Perform propagation
+    virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
+    /// Post propagator for \f$\sum_{i\in x} weights_i = y \f$
+    static ExecStatus post(Home home,
+                           const SharedArray<int>& elements,
+                           const SharedArray<int>& weights,
+                           View x, Gecode::Int::IntView y);
+  };
+
+}}}
+
+#include <gecode/set/int/minmax.hpp>
+#include <gecode/set/int/card.hpp>
+#include <gecode/set/int/match.hpp>
+#include <gecode/set/int/channel-int.hpp>
+#include <gecode/set/int/channel-bool.hpp>
+#include <gecode/set/int/weights.hpp>
+
+#endif
+
+// STATISTICS: set-prop