Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
24 kB · 686 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Linnea Ingmar <linnea.ingmar@hotmail.com> * Mikael Lagerkvist <lagerkvist@gecode.org> * Christian Schulte <schulte@gecode.org> * * Copyright: * Linnea Ingmar, 2017 * Mikael Lagerkvist, 2007 * 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_INT_EXTENSIONAL_HH#define GECODE_INT_EXTENSIONAL_HH
#include <gecode/int.hh>
#include <gecode/int/rel.hh>
/** * \namespace Gecode::Int::Extensional * \brief %Extensional propagators */
namespace Gecode { namespace Int { namespace Extensional {
/** * \brief Domain consistent layered graph (regular) propagator * * The algorithm for the regular propagator is based on: * Gilles Pesant, A Regular Language Membership Constraint * for Finite Sequences of Variables, CP 2004. * Pages 482-495, LNCS 3258, Springer-Verlag, 2004. * * The propagator is not capable of dealing with multiple occurences * of the same view. * * Requires \code #include <gecode/int/extensional.hh> \endcode * \ingroup FuncIntProp */ template<class View, class Val, class Degree, class StateIdx> class LayeredGraph : public Propagator { protected: /// States are described by number of incoming and outgoing edges class State { public: Degree i_deg; ///< The in-degree (number of incoming edges) Degree o_deg; ///< The out-degree (number of outgoing edges) /// Initialize with zeroes void init(void); }; /// %Edge defined by in-state and out-state class Edge { public: StateIdx i_state; ///< Number of in-state StateIdx o_state; ///< Number of out-state }; /// %Support information for a value class Support { public: Val val; ///< Supported value Degree n_edges; ///< Number of supporting edges Edge* edges; ///< Supporting edges in layered graph }; /// Type for support size typedef typename Gecode::Support::IntTypeTraits<Val>::utype ValSize; /// %Layer for a view in the layered graph class Layer { public: View x; ///< Integer view StateIdx n_states; ///< Number of states used by outgoing edges ValSize size; ///< Number of supported values State* states; ///< States used by outgoing edges Support* support; ///< Supported values }; /// Iterator for telling variable domains by scanning support class LayerValues { private: const Support* s1; ///< Current support const Support* s2; ///< End of support public: /// Default constructor LayerValues(void); /// Initialize for support of layer \a l LayerValues(const Layer& l); /// Initialize for support of layer \a l void init(const Layer& l); /// Test whether more values supported bool operator ()(void) const; /// Move to next supported value void operator ++(void); /// Return supported value int val(void) const; }; /// %Advisors for views (by position in array) class Index : public Advisor { public: /// The position of the view in the view array int i; /// Create index advisor Index(Space& home, Propagator& p, Council<Index>& c, int i); /// Clone index advisor \a a Index(Space& home, Index& a); }; /// Range approximation of which positions have changed class IndexRange { private: int _fst; ///< First index int _lst; ///< Last index public: /// Initialize range as empty IndexRange(void); /// Reset range to be empty void reset(void); /// Add index \a i to range void add(int i); /// Add index range \a ir to range void add(const IndexRange& ir); /// Shift index range by \a n elements to the left void lshift(int n); /// Test whether range is empty bool empty(void) const; /// Return first position int fst(void) const; /// Return last position int lst(void) const; }; /// The advisor council Council<Index> c; /// Number of layers (and views) int n; /// The layers of the graph Layer* layers; /// Maximal number of states per layer StateIdx max_states; /// Total number of states unsigned int n_states; /// Total number of edges unsigned int n_edges; /// Index range with in-degree modifications IndexRange i_ch; /// Index range with out-degree modifications IndexRange o_ch; /// Index range for any change (for compression) IndexRange a_ch; /// Return in state for layer \a i and state index \a is State& i_state(int i, StateIdx is); /// Return in state for layer \a i and in state of edge \a e State& i_state(int i, const Edge& e); /// Decrement out degree for in state of edge \a e for layer \a i bool i_dec(int i, const Edge& e); /// Return out state for layer \a i and state index \a os State& o_state(int i, StateIdx os); /// Return state for layer \a i and out state of edge \a e State& o_state(int i, const Edge& e); /// Decrement in degree for out state of edge \a e for layer \a i bool o_dec(int i, const Edge& e); /// Perform consistency check on data structures void audit(void); /// Initialize layered graph template<class Var> ExecStatus initialize(Space& home, const VarArgArray<Var>& x, const DFA& dfa); /// Constructor for cloning \a p LayeredGraph(Space& home, LayeredGraph<View,Val,Degree,StateIdx>& p); public: /// Constructor for posting template<class Var> LayeredGraph(Home home, const VarArgArray<Var>& x, const DFA& dfa); /// Copy propagator during cloning virtual Actor* copy(Space& home); /// Cost function (defined as high linear) virtual PropCost cost(const Space& home, const ModEventDelta& med) const; /// Schedule function virtual void reschedule(Space& home); /// Give advice to propagator virtual ExecStatus advise(Space& home, Advisor& a, const Delta& d); /// Perform propagation virtual ExecStatus propagate(Space& home, const ModEventDelta& med); /// Delete propagator and return its size virtual size_t dispose(Space& home); /// Post propagator on views \a x and DFA \a dfa template<class Var> static ExecStatus post(Home home, const VarArgArray<Var>& x, const DFA& dfa); };
/// Select small types for the layered graph propagator template<class Var> ExecStatus post_lgp(Home home, const VarArgArray<Var>& x, const DFA& dfa);
}}}
#include <gecode/int/extensional/layered-graph.hpp>
namespace Gecode { namespace Int { namespace Extensional {
/// Import type typedef Gecode::Support::BitSetData BitSetData;
/* * Forward declarations */ template<unsigned int size> class TinyBitSet;
/// Bit-set template<class IndexType> class BitSet { template<class> friend class BitSet; template<unsigned int> friend class TinyBitSet; protected: /// Limit IndexType _limit; /// Indices IndexType* _index; /// Words BitSetData* _bits; /// Replace the \a i th word with \a w, decrease \a limit if \a w is zero void replace_and_decrease(IndexType i, BitSetData w); public: /// Initialize bit set for a number of words \a n BitSet(Space& home, unsigned int n); /// Initialize during cloning template<class OldIndexType> BitSet(Space& home, const BitSet<OldIndexType>& bs); /// Initialize during cloning (unused) BitSet(Space& home, const TinyBitSet<1U>& tbs); /// Initialize during cloning (unused) BitSet(Space& home, const TinyBitSet<2U>& tbs); /// Initialize during cloning (unused) BitSet(Space& home, const TinyBitSet<3U>& tbs); /// Initialize during cloning (unused) BitSet(Space& home, const TinyBitSet<4U>& tbs); /// Get the limit unsigned int limit(void) const; /// Check whether the set is empty bool empty(void) const; /// Make the set empty void flush(void); /// Return the highest active index unsigned int width(void) const; /// Clear the first \a limit words in \a mask void clear_mask(BitSetData* mask) const; /// Add \b to \a mask void add_to_mask(const BitSetData* b, BitSetData* mask) const; /// Intersect with \a mask, sparse mask if \a sparse is true template<bool sparse> void intersect_with_mask(const BitSetData* mask); /// Intersect with the "or" of \a and \a b void intersect_with_masks(const BitSetData* a, const BitSetData* b); /// Check if \a has a non-empty intersection with the set bool intersects(const BitSetData* b) const; /// Perform "nand" with \a b void nand_with_mask(const BitSetData* b); /// Return the number of ones unsigned long long int ones(void) const; /// Return the number of ones after intersection with \a b unsigned long long int ones(const BitSetData* b) const; /// Return an upper bound on the number of bits unsigned long long int bits(void) const; /// Return the number of required bit set words unsigned int words(void) const; /// Return the number of required bit set words unsigned int size(void) const; };
}}}
#include <gecode/int/extensional/bit-set.hpp>
namespace Gecode { namespace Int { namespace Extensional {
/// Tiny bit-set template<unsigned int _size> class TinyBitSet { template<unsigned int> friend class TinyBitSet; protected: /// Words BitSetData _bits[_size]; public: /// Initialize sparse bit set for a number of words \a n TinyBitSet(Space& home, unsigned int n); /// Initialize during cloning template<unsigned int largersize> TinyBitSet(Space& home, const TinyBitSet<largersize>& tbs); /// Initialize during cloning template<class IndexType> TinyBitSet(Space& home, const BitSet<IndexType>& bs); /// Get the limit int limit(void) const; /// Check whether the set is empty bool empty(void) const; /// Make the set empty void flush(void); /// Return the highest active index unsigned int width(void) const; /// Clear the first \a limit words in \a mask void clear_mask(BitSetData* mask); /// Add \b to \a mask void add_to_mask(const BitSetData* b, BitSetData* mask) const; /// Intersect with \a mask, sparse mask if \a sparse is true template<bool sparse> void intersect_with_mask(const BitSetData* mask); /// Intersect with the "or" of \a and \a b void intersect_with_masks(const BitSetData* a, const BitSetData* b); /// Check if \a has a non-empty intersection with the set bool intersects(const BitSetData* b); /// Perform "nand" with \a b void nand_with_mask(const BitSetData* b); /// Perform "nand" with and the "or" of \a a and \a b void nand_with_masks(const BitSetData* a, const BitSetData* b); /// Return the number of ones unsigned long long int ones(void) const; /// Return the number of ones after intersection with \a b unsigned long long int ones(const BitSetData* b) const; /// Return an upper bound on the number of bits unsigned long long int bits(void) const; /// Return the number of required bit set words unsigned int words(void) const; /// Return the total number of words unsigned int size(void) const; }; }}}
#include <gecode/int/extensional/tiny-bit-set.hpp>
namespace Gecode { namespace Int { namespace Extensional {
/// Tuple type typedef TupleSet::Tuple Tuple;
/// Base class for compact table propagator template<class View, bool pos> class Compact : public Propagator { protected: /// Range type for supports typedef TupleSet::Range Range; /// Advisor for updating current table class CTAdvisor : public ViewAdvisor<View> { public: using ViewAdvisor<View>::view; protected: /// First range of support data structure const Range* _fst; /// Last range of support data structure const Range* _lst; public: /// \name Constructors //@{ /// Initialise from parameters CTAdvisor(Space& home, Propagator& p, Council<CTAdvisor>& c, const TupleSet& ts, View x0, int i); /// Clone advisor \a a CTAdvisor(Space& home, CTAdvisor& a); //@} /// Adjust supports void adjust(void); /// Return first range of support data structure const Range* fst(void) const; /// Return lasst range of support data structure const Range* lst(void) const; /// Dispose advisor void dispose(Space& home, Council<CTAdvisor>& c); }; //@} /// \name Support iterators //@{ /// Iterator over valid supports class ValidSupports { protected: /// Number of words const unsigned int n_words; /// Maximal value int max; /// Range iterator ViewRanges<View> xr; /// Support iterator const Range* sr; /// The last range const Range* lst; /// The value int n; /// The value's support const BitSetData* s; /// Find a new value (only for negative case) void find(void); public: /// Initialize from initialized propagator ValidSupports(const Compact<View,pos>& p, CTAdvisor& a); /// Initialize during initialization ValidSupports(const TupleSet& ts, int i, View x); /// Move to next supports void operator ++(void); /// Whether there are still supports left bool operator ()(void) const; /// Return supports const BitSetData* supports(void) const; /// Return supported value int val(void) const; }; /// Iterator over lost supports class LostSupports { protected: /// Number of words const unsigned int n_words; /// Range information const Range* r; /// Last range const Range* lst; /// Low value int l; /// High value int h; /// The lost value's support const BitSetData* s; public: /// Initialize iterator for values between \a l and \a h LostSupports(const Compact<View,pos>& p, CTAdvisor& a, int l, int h); /// Move iterator to next value void operator ++(void); /// Whether iterator is done bool operator ()(void) const; /// Provide access to corresponding supports const BitSetData* supports(void) const; }; //@} /// \name Testing the number of unassigned variables //@{ /// Whether all variables are assigned bool all(void) const; /// Whether at most one variable is unassigned bool atmostone(void) const; //@} protected: /// Number of words in supports const unsigned int n_words; /// The tuple set TupleSet ts; /// The advisor council Council<CTAdvisor> c; /// Constructor for cloning \a p Compact(Space& home, Compact& p); /// Constructor for posting Compact(Home home, const TupleSet& ts); /// Setup the actual table template<class Table> void setup(Space& home, Table& table, ViewArray<View>& x); /// Check whether the table covers the whole Cartedion product template<class Table> bool full(const Table& table) const; /// Find range for \a n const Range* range(CTAdvisor& a, int n); /// Return supports for value \a n const BitSetData* supports(CTAdvisor& a, int n); public: /// Cost function virtual PropCost cost(const Space& home, const ModEventDelta& med) const; /// Delete propagator and return its size size_t dispose(Space& home); };
/** * \brief Domain consistent positive extensional propagator * * This propagator implements the compact-table propagation * algorithm based on: * J. Demeulenaere et. al., Compact-Table: Efficiently * filtering table constraints with reversible sparse * bit-sets, CP 2016. * * Requires \code #include <gecode/int/extensional.hh> \endcode * \ingroup FuncIntProp */ template<class View, class Table> class PosCompact : public Compact<View,true> { public: typedef typename Compact<View,true>::ValidSupports ValidSupports; typedef typename Compact<View,true>::Range Range; typedef typename Compact<View,true>::CTAdvisor CTAdvisor; typedef typename Compact<View,true>::LostSupports LostSupports;
using Compact<View,true>::setup; using Compact<View,true>::supports; using Compact<View,true>::all; using Compact<View,true>::atmostone; using Compact<View,true>::c; using Compact<View,true>::ts;
/// \name Status management //@{ /// Type of status enum StatusType { SINGLE = 0, ///< A single view has been touched MULTIPLE = 1, ///< Multiple view have been touched NONE = 2, ///< No view has been touched PROPAGATING = 3 ///< The propagator is currently running }; /// Status management class Status { protected: /// A tagged pointer for storing the status ptrdiff_t s; public: /// Initialize with type \a t (either NONE or SEVERAL) Status(StatusType t); /// Copy constructor Status(const Status& s); /// Return status type StatusType type(void) const; /// Check whether status is single and equal to \a a bool single(CTAdvisor& a) const; /// Set status to SINGLE or MULTIPLE depending on \a a void touched(CTAdvisor& a); /// Set status to NONE void none(void); /// Set status to PROPAGATING void propagating(void); }; /// Propagator status Status status; /// Current table Table table; /// Check whether the table is empty bool empty(void) const; /// Constructor for cloning \a p template<class TableProp> PosCompact(Space& home, TableProp& p); /// Constructor for posting PosCompact(Home home, ViewArray<View>& x, const TupleSet& ts); public: /// Schedule function virtual void reschedule(Space& home); /// Perform propagation virtual ExecStatus propagate(Space& home, const ModEventDelta& med); /// Copy propagator during cloning virtual Actor* copy(Space& home); /// Post propagator for views \a x and table \a t static ExecStatus post(Home home, ViewArray<View>& x, const TupleSet& ts); /// Delete propagator and return its size size_t dispose(Space& home); /// Give advice to propagator virtual ExecStatus advise(Space& home, Advisor& a, const Delta& d); };
/// Post function for positive compact table propagator template<class View> ExecStatus postposcompact(Home home, ViewArray<View>& x, const TupleSet& ts);
/** * \brief Domain consistent negative extensional propagator * * This propagator implements the compact-table propagation * algorithm based on: * J. Demeulenaere et. al., Compact-Table: Efficiently * filtering table constraints with reversible sparse * bit-sets, CP 2016. * and (negative tables) on: * H. Verhaeghe et al., Extending Compact-Table to * Negative and Short Tables. AAAI 2017. * * Requires \code #include <gecode/int/extensional.hh> \endcode * \ingroup FuncIntProp */ template<class View, class Table> class NegCompact : public Compact<View,false> { public: typedef typename Compact<View,false>::ValidSupports ValidSupports; typedef typename Compact<View,false>::Range Range; typedef typename Compact<View,false>::CTAdvisor CTAdvisor;
using Compact<View,false>::setup; using Compact<View,false>::full; using Compact<View,false>::supports; using Compact<View,false>::atmostone; using Compact<View,false>::c; using Compact<View,false>::ts;
/// Current table Table table; /// Constructor for cloning \a p template<class TableProp> NegCompact(Space& home, TableProp& p); /// Constructor for posting NegCompact(Home home, ViewArray<View>& x, const TupleSet& ts); public: /// Schedule function virtual void reschedule(Space& home); /// Perform propagation virtual ExecStatus propagate(Space& home, const ModEventDelta& med); /// Copy propagator during cloning virtual Actor* copy(Space& home); /// Post propagator for views \a x and table \a t static ExecStatus post(Home home, ViewArray<View>& x, const TupleSet& ts); /// Delete propagator and return its size size_t dispose(Space& home); /// Give advice to propagator virtual ExecStatus advise(Space& home, Advisor& a, const Delta& d); };
/// Post function for compact table propagator template<class View> ExecStatus postnegcompact(Home home, ViewArray<View>& x, const TupleSet& ts);
/// Domain consistent reified extensional propagator template<class View, class Table, class CtrlView, ReifyMode rm> class ReCompact : public Compact<View,false> { public: typedef typename Compact<View,false>::ValidSupports ValidSupports; typedef typename Compact<View,false>::Range Range; typedef typename Compact<View,false>::CTAdvisor CTAdvisor;
using Compact<View,false>::setup; using Compact<View,false>::full; using Compact<View,false>::supports; using Compact<View,false>::c; using Compact<View,false>::ts;
/// Current table Table table; /// Boolean control view CtrlView b; /// The views (for rewriting) ViewArray<View> y; /// Constructor for cloning \a p template<class TableProp> ReCompact(Space& home, TableProp& p); /// Constructor for posting ReCompact(Home home, ViewArray<View>& x, const TupleSet& ts, CtrlView b); public: /// Schedule function virtual void reschedule(Space& home); /// Perform propagation virtual ExecStatus propagate(Space& home, const ModEventDelta& med); /// Copy propagator during cloning virtual Actor* copy(Space& home); /// Post propagator for views \a x and table \a t static ExecStatus post(Home home, ViewArray<View>& x, const TupleSet& ts, CtrlView b); /// Delete propagator and return its size size_t dispose(Space& home); /// Give advice to propagator virtual ExecStatus advise(Space& home, Advisor& a, const Delta& d); };
/// Post function for compact table propagator template<class View, class CtrlView, ReifyMode rm> ExecStatus postrecompact(Home home, ViewArray<View>& x, const TupleSet& ts, CtrlView b);
}}}
#include <gecode/int/extensional/compact.hpp>
#endif
// STATISTICS: int-prop