this repo has no description
1/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */ 2/* 3 * Main authors: 4 * Guido Tack <tack@gecode.org> 5 * Christian Schulte <schulte@gecode.org> 6 * 7 * Contributing authors: 8 * Gabor Szokoli <szokoli@gecode.org> 9 * 10 * Copyright: 11 * Guido Tack, 2004 12 * Christian Schulte, 2004 13 * Gabor Szokoli, 2004 14 * 15 * This file is part of Gecode, the generic constraint 16 * development environment: 17 * http://www.gecode.org 18 * 19 * Permission is hereby granted, free of charge, to any person obtaining 20 * a copy of this software and associated documentation files (the 21 * "Software"), to deal in the Software without restriction, including 22 * without limitation the rights to use, copy, modify, merge, publish, 23 * distribute, sublicense, and/or sell copies of the Software, and to 24 * permit persons to whom the Software is furnished to do so, subject to 25 * the following conditions: 26 * 27 * The above copyright notice and this permission notice shall be 28 * included in all copies or substantial portions of the Software. 29 * 30 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 31 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 32 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 33 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE 34 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION 35 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 36 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 37 * 38 */ 39 40#ifndef GECODE_SET_SEQUENCE_HH 41#define GECODE_SET_SEQUENCE_HH 42 43#include <gecode/set.hh> 44 45namespace Gecode { namespace Set { namespace Sequence { 46 47 /** 48 * \namespace Gecode::Set::Sequence 49 * \brief Propagators for ordered sequences of sets 50 */ 51 52 /** 53 * \brief %Propagator for the sequence constraint 54 * 55 * Requires \code #include <gecode/set/sequence.hh> \endcode 56 * \ingroup FuncSetProp 57 */ 58 59 class Seq : public NaryPropagator<SetView, PC_SET_ANY> { 60 protected: 61 /// Constructor for cloning \a p 62 Seq(Space& home, Seq& p); 63 /// Constructor for posting 64 Seq(Home home, ViewArray<SetView>&); 65 public: 66 /// Copy propagator during cloning 67 GECODE_SET_EXPORT virtual Actor* copy(Space& home); 68 /// Perform propagation 69 GECODE_SET_EXPORT virtual ExecStatus propagate(Space& home, const ModEventDelta& med); 70 /// Post propagator \f$\forall 0\leq i< |x|-1 : \max(x_i)<\min(x_{i+1})\f$ 71 static ExecStatus post(Home home,ViewArray<SetView>); 72 }; 73 74 /** 75 * \brief %Propagator for the sequenced union constraint 76 * 77 * Requires \code #include <gecode/set/sequence.hh> \endcode 78 * \ingroup FuncSetProp 79 */ 80 81 class SeqU : public NaryOnePropagator<SetView,PC_SET_ANY> { 82 protected: 83 GLBndSet unionOfDets; //Union of determined variables dropped form x. 84 /// Constructor for cloning \a p 85 SeqU(Space& home, SeqU& p); 86 /// Constructor for posting 87 SeqU(Home home, ViewArray<SetView>&, SetView); 88 ExecStatus propagateSeqUnion(Space& home, 89 bool& modified, ViewArray<SetView>& x, 90 SetView& y); 91 public: 92 /// Copy propagator during cloning 93 GECODE_SET_EXPORT virtual Actor* copy(Space& home); 94 /// Perform propagation 95 GECODE_SET_EXPORT virtual ExecStatus propagate(Space& home, const ModEventDelta& med); 96 /// Post propagator \f$\forall 0\leq i< |x|-1 : \max(x_i)<\min(x_{i+1})\f$ and \f$ x = \bigcup_{i\in\{0,\dots,n-1\}} y_i \f$ 97 static ExecStatus post(Home home,ViewArray<SetView>, SetView); 98 }; 99 100 101}}} 102 103#include <gecode/set/rel.hh> 104#include <gecode/set/rel-op/common.hpp> 105#include <gecode/set/sequence/common.hpp> 106#include <gecode/set/sequence/seq.hpp> 107#include <gecode/set/sequence/seq-u.hpp> 108 109#endif 110 111// STATISTICS: set-prop