/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */ /* * Main authors: * Guido Tack * Christian Schulte * * Copyright: * Guido Tack, 2004 * Christian Schulte, 2004 * * Last modified: * $Date: 2011-09-06 18:05:16 +1000 (Tue, 06 Sep 2011) $ by $Author: tack $ * $Revision: 12391 $ * * 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_SELECT_HH__ #define __GECODE_SET_SELECT_HH__ #include #include #include #include namespace Gecode { namespace Int { namespace Element { /// VarArg type for %Set views template<> class ViewToVarArg { public: typedef Gecode::SetVarArgs argtype; }; /// VarArg type for singleton views template<> class ViewToVarArg { public: typedef Gecode::IntVarArgs argtype; }; }}} namespace Gecode { namespace Set { namespace Element { /** * \namespace Gecode::Set::Element * \brief %Set element propagators */ /** * \brief %Propagator for element with intersection * * Requires \code #include \endcode * \ingroup FuncSetProp */ template class ElementIntersection : public Propagator { public: typedef Gecode::Int::Element::IdxViewArray IdxViewArray; protected: IntSet universe; IdxViewArray iv; View0 x0; View1 x1; /// Constructor for cloning \a p ElementIntersection(Space& home, bool share,ElementIntersection& p); /// Constructor for posting ElementIntersection(Home home,IdxViewArray&,View0,View1, const IntSet& universe); public: /// Copy propagator during cloning virtual Actor* copy(Space& home,bool); 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$ z=\bigcap\langle x_0,\dots,x_{n-1}\rangle[y] \f$ using \a u as universe * * If \a y is empty, \a z will be constrained to be the given universe * \a u (as an empty intersection is the universe). */ static ExecStatus post(Home home,IdxViewArray& x, View0 y, View1 z, const IntSet& u); }; /** * \brief %Propagator for element with union * * Requires \code #include \endcode * \ingroup FuncSetProp */ template class ElementUnion : public Propagator { public: typedef Gecode::Int::Element::IdxViewArray IdxViewArray; protected: IdxViewArray iv; View0 x0; View1 x1; /// Constructor for cloning \a p ElementUnion(Space& home, bool share,ElementUnion& p); /// Constructor for posting ElementUnion(Home home,IdxViewArray&,View0,View1); public: /// Copy propagator during cloning virtual Actor* copy(Space& home,bool); 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$ z=\bigcup\langle x_0,\dots,x_{n-1}\rangle[y] \f$ * * If \a y is empty, \a z will be constrained to be empty * (as an empty union is the empty set). */ static ExecStatus post(Home home,IdxViewArray& x,View0 y, View1 z); }; /** * \brief %Propagator for element with union of constant sets * * Requires \code #include \endcode * \ingroup FuncSetProp */ template class ElementUnionConst : public Propagator { protected: SView x0; IntSet* iv; int n_iv; RView x1; /// Constructor for cloning \a p ElementUnionConst(Space& home, bool share,ElementUnionConst& p); /// Constructor for posting ElementUnionConst(Home home,SView,const IntSetArgs&,RView); public: /// Copy propagator during cloning virtual Actor* copy(Space& home,bool); 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$ z=\bigcup\langle s_0,\dots,s_{n-1}\rangle[y] \f$ * * If \a y is empty, \a z will be constrained to be empty * (as an empty union is the empty set). */ static ExecStatus post(Home home,SView z,const IntSetArgs& x,RView y); }; /** * \brief %Propagator for element with disjointness * * Requires \code #include \endcode * \ingroup FuncSetProp */ template class ElementDisjoint : public Propagator { public: typedef Gecode::Int::Element::IdxViewArray IdxViewArray; protected: IdxViewArray iv; RView x1; /// Constructor for cloning \a p ElementDisjoint(Space& home, bool share,ElementDisjoint& p); /// Constructor for posting ElementDisjoint(Home home,IdxViewArray&,RView); public: /// Copy propagator during cloning virtual Actor* copy(Space& home,bool); 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$ \parallel\langle x_0,\dots,x_{n-1}\rangle[y] \f$ static ExecStatus post(Home home,IdxViewArray& x,RView y); }; }}} #include #include #include #include #endif // STATISTICS: set-prop