Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
7.5 kB · 230 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231/* -*- 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 * * 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 <gecode/set.hh>
#include <gecode/int/idx-view.hh>#include <gecode/int/element.hh>#include <gecode/set/rel.hh>#include <gecode/set/rel-op.hh>
namespace Gecode { namespace Int {
/// VarArg type for %Set views template<> class ViewToVarArg<Gecode::Set::SetView> { public: typedef Gecode::SetVarArgs argtype; };
/// VarArg type for singleton views template<> class ViewToVarArg<Gecode::Set::SingletonView> { 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 <gecode/set/element.hh> \endcode * \ingroup FuncSetProp */ template<class View, class View0, class View1> class ElementIntersection : public Propagator { public: typedef Gecode::Int::IdxViewArray<View> IdxViewArray; protected: IntSet universe; IdxViewArray iv; View0 x0; View1 x1;
/// Constructor for cloning \a p ElementIntersection(Space& home, ElementIntersection& p); /// Constructor for posting ElementIntersection(Home home, IdxViewArray&,View0,View1, const IntSet& universe); public: /// Copy propagator during cloning virtual Actor* copy(Space& home); /// Cost function virtual PropCost cost(const Space& home, const ModEventDelta& med) const; /// Schedule function virtual void reschedule(Space& home); /// 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 <gecode/set/element.hh> \endcode * \ingroup FuncSetProp */ template<class View, class View0, class View1> class ElementUnion : public Propagator { public: typedef Gecode::Int::IdxViewArray<View> IdxViewArray; protected: IdxViewArray iv; View0 x0; View1 x1;
/// Constructor for cloning \a p ElementUnion(Space& home, ElementUnion& p); /// Constructor for posting ElementUnion(Home home,IdxViewArray&,View0,View1); public: /// Copy propagator during cloning virtual Actor* copy(Space& home); /// Cost function virtual PropCost cost(const Space& home, const ModEventDelta& med) const; /// Schedule function virtual void reschedule(Space& home); /// 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 <gecode/set/element.hh> \endcode * \ingroup FuncSetProp */ template<class SView, class RView> class ElementUnionConst : public Propagator { protected: SView x0; IntSet* iv; int n_iv; RView x1;
/// Constructor for cloning \a p ElementUnionConst(Space& home, ElementUnionConst& p); /// Constructor for posting ElementUnionConst(Home home, SView, const IntSetArgs&, RView); public: /// Copy propagator during cloning virtual Actor* copy(Space& home); /// Cost function virtual PropCost cost(const Space& home, const ModEventDelta& med) const; /// Schedule function virtual void reschedule(Space& home); /// 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 <gecode/set/element.hh> \endcode * \ingroup FuncSetProp */ template<class SView, class RView> class ElementDisjoint : public Propagator { public: typedef Gecode::Int::IdxViewArray<SView> IdxViewArray; protected: IdxViewArray iv; RView x1;
/// Constructor for cloning \a p ElementDisjoint(Space& home, ElementDisjoint& p); /// Constructor for posting ElementDisjoint(Home home,IdxViewArray&,RView); public: /// Copy propagator during cloning virtual Actor* copy(Space& home); /// Cost function virtual PropCost cost(const Space& home, const ModEventDelta& med) const; /// Schedule function virtual void reschedule(Space& home); /// 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 <gecode/set/element/inter.hpp>#include <gecode/set/element/union.hpp>#include <gecode/set/element/unionConst.hpp>#include <gecode/set/element/disjoint.hpp>
#endif
// STATISTICS: set-prop