Generated on Thu Apr 5 2018 19:44:19 for Gecode by doxygen 1.8.13
ldsb.hh
Go to the documentation of this file.
1 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
2 /*
3  * Main authors:
4  * Christopher Mears <chris.mears@monash.edu>
5  *
6  * Copyright:
7  * Christopher Mears, 2012
8  *
9  * Last modified:
10  * $Date$ by $Author$
11  * $Revision$
12  *
13  * This file is part of Gecode, the generic constraint
14  * development environment:
15  * http://www.gecode.org
16  *
17  * Permission is hereby granted, free of charge, to any person obtaining
18  * a copy of this software and associated documentation files (the
19  * "Software"), to deal in the Software without restriction, including
20  * without limitation the rights to use, copy, modify, merge, publish,
21  * distribute, sublicense, and/or sell copies of the Software, and to
22  * permit persons to whom the Software is furnished to do so, subject to
23  * the following conditions:
24  *
25  * The above copyright notice and this permission notice shall be
26  * included in all copies or substantial portions of the Software.
27  *
28  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
29  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
30  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
31  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
32  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
33  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
34  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
35  *
36  */
37 
38 #ifndef __GECODE_INT_LDSB_HH__
39 #define __GECODE_INT_LDSB_HH__
40 
41 #include <gecode/int.hh>
42 
47 namespace Gecode { namespace Int { namespace LDSB {
48 
50  class Literal {
51  public:
53  Literal(void);
55  Literal(int _var, int _val);
56 
59  int _variable;
63  int _value;
64 
67  bool operator <(const Literal &rhs) const;
68  };
69 
82  std::pair<int,int>
83  findVar(int *indices, unsigned int n_values, unsigned int seq_size, int index);
84 }}}
85 
86 namespace Gecode {
88  template<>
90  public:
94  };
95 
99  template<>
100  class ArrayTraits<LiteralArgs> {
101  public:
102  typedef LiteralArgs StorageType;
104  typedef LiteralArgs ArgsType;
105  };
106 }
107 
108 namespace Gecode { namespace Int { namespace LDSB {
111  public:
113  int nrefs;
115  SymmetryObject(void);
117  virtual ~SymmetryObject(void);
118  };
121  public:
125  int nxs;
129  ~VariableSymmetryObject(void);
130  };
133  public:
138  };
141  public:
145  int nxs;
147  int seq_size;
152  };
155  public:
159  int seq_size;
162  };
163 
165  template<class View>
166  class SymmetryImp {
167  public:
169  virtual ArgArray<Literal> symmetric(Literal, const ViewArray<View>&) const = 0;
171  virtual void update(Literal) = 0;
173  virtual SymmetryImp<View>* copy(Space& home) const = 0;
175  virtual size_t dispose(Space& home) = 0;
177  virtual ~SymmetryImp(void);
179  static void* operator new(size_t s, Space& home);
181  static void operator delete(void*,Space&);
183  static void operator delete(void*);
184  };
186  template <class View>
187  class VariableSymmetryImp : public SymmetryImp<View> {
188  protected:
191  public:
193  VariableSymmetryImp<View>(Space& home, int* vs, unsigned int n);
197  virtual size_t dispose(Space& home);
199  void update(Literal);
201  virtual ArgArray<Literal> symmetric(Literal, const ViewArray<View>&) const;
203  SymmetryImp<View>* copy(Space& home) const;
204  };
206  template <class View>
207  class ValueSymmetryImp : public SymmetryImp<View>
208  {
209  public:
213  ValueSymmetryImp<View>(Space& home, int* vs, unsigned int n);
217  virtual size_t dispose(Space& home);
219  void update(Literal);
221  virtual ArgArray<Literal> symmetric(Literal, const ViewArray<View>&) const;
223  SymmetryImp<View>* copy(Space& home) const;
224  };
226  template <class View>
228  {
229  protected:
231  unsigned int *indices;
233  unsigned int n_indices;
235  unsigned int seq_size;
237  unsigned int n_seqs;
238 
240  // e.g. lookup[2] == 10 indicates that the variable with index 2
241  // occurs at position 10 in the "indices" array.
242  // If a variable occurs more than once, only the first occurrence
243  // is recorded.
244  // A value of -1 indicates that the variable does not occur in
245  // "indices".
246  int *lookup;
248  unsigned int lookup_size;
249 
252  int getVal(unsigned int sequence, unsigned int position) const;
253  public:
255  VariableSequenceSymmetryImp<View>(Space& home, int *_indices, unsigned int n, unsigned int seqsize);
259  virtual size_t dispose(Space& home);
261  void update(Literal);
263  virtual ArgArray<Literal> symmetric(Literal, const ViewArray<View>&) const;
265  SymmetryImp<View>* copy(Space& home) const;
266  };
268  template <class View>
270  {
271  protected:
273  int *values;
275  unsigned int n_values;
277  unsigned int seq_size;
279  unsigned int n_seqs;
284  int getVal(unsigned int sequence, unsigned int position) const;
285  private:
287  public:
289  ValueSequenceSymmetryImp<View>(Space& home, int* _values, unsigned int n, unsigned int seqsize);
293  virtual size_t dispose(Space& home);
295  void update(Literal);
297  virtual ArgArray<Literal> symmetric(Literal, const ViewArray<View>&) const;
299  SymmetryImp<View>* copy(Space& home) const;
300  };
301 
304  template<class Val>
306  private:
308  const Literal * const _literals;
310  const int _nliterals;
311  public:
314  LDSBChoice(const Brancher& b, unsigned int a, const Pos& p, const Val& n,
315  const Literal* literals, int nliterals);
317  ~LDSBChoice(void);
319  const Literal* literals(void) const;
321  int nliterals(void) const;
323  virtual void archive(Archive& e) const;
324  };
325 
334  template<class View, int n, class Val, unsigned int a,
335  class Filter, class Print>
336  class LDSBBrancher : public ViewValBrancher<View,n,Val,a,Filter,Print> {
337  public:
342  int _nsyms;
343  // Position of variable that last choice was created for
344  int _prevPos;
345  protected:
347  LDSBBrancher(Space& home, LDSBBrancher& b);
349  LDSBBrancher(Home home,
351  ViewSel<View>* vs[n],
353  SymmetryImp<View>** syms, int nsyms,
356  public:
358  virtual const Choice* choice(Space& home);
360  virtual const Choice* choice(const Space& home, Archive& e);
362  virtual ExecStatus commit(Space& home, const Choice& c, unsigned int b);
364  virtual Actor* copy(Space& home);
366  virtual size_t dispose(Space& home);
368  static void post(Home home,
370  ViewSel<View>* vs[n],
372  SymmetryImp<View>** syms,
373  int nsyms,
376  };
377 
379  template<class View, int n, class Val, unsigned int a>
380  void postldsbbrancher(Home home,
382  ViewSel<View>* vs[n],
384  SymmetryImp<View>** syms, int nsyms,
387 
389  template<class View>
390  ModEvent prune(Space& home, View x, int v);
391 
392 }}}
393 
396 
397 #endif
398 
399 // STATISTICS: int-branch
400 
Int::LDSB::Literal ValueType
Definition: ldsb.hh:103
VarImpBase ** xs
Array of variables in symmetry.
Definition: ldsb.hh:123
unsigned int n_indices
Total number of indices (n_seqs * seq_size)
Definition: ldsb.hh:233
void sequence(Home home, const IntVarArgs &x, const IntSet &s, int q, int l, int u, IntPropLevel)
Post propagator for .
Definition: sequence.cpp:51
IntSet values
Set of symmetric values.
Definition: ldsb.hh:135
A Literal is a pair of variable index and value.
Definition: ldsb.hh:50
unsigned int lookup_size
Size of lookup.
Definition: ldsb.hh:248
IntArgs values
Array of values in symmetry.
Definition: ldsb.hh:157
std::pair< int, int > findVar(int *indices, unsigned int n_values, unsigned int seq_size, int index)
Find the location of an integer in a collection of sequences.
Definition: ldsb.cpp:46
View::VarType Var
The corresponding variable.
Definition: view-val.hpp:101
Implementation of a value symmetry at the modelling level.
Definition: ldsb.hh:132
Implementation of a value sequence symmetry at the modelling level.
Definition: ldsb.hh:154
std::function< void(const Space &home, const Brancher &b, unsigned int a, Var x, int i, const Val &m, std::ostream &o)> VarValPrint
Function type for printing variable and value selection.
Definition: print.hpp:47
void postldsbbrancher(Home home, ViewArray< View > &x, ViewSel< View > *vs[n], ValSelCommitBase< View, Val > *vsc, SymmetryImp< View > **syms, int nsyms, BranchFilter< typename View::VarType > bf, VarValPrint< typename View::VarType, Val > vvp)
Post LDSB brancher.
Definition: brancher.hpp:279
int ModEvent
Type for modification events.
Definition: core.hpp:64
Implementation of a symmetry at the modelling level.
Definition: ldsb.hh:110
Implementation of a variable sequence symmetry.
Definition: ldsb.hh:227
Support::BitSetOffset< Space > values
Symmetric values.
Definition: ldsb.hh:211
int * lookup
Map from variable&#39;s index to its sequence and position.
Definition: ldsb.hh:246
int _value
The value of the literal. For int and bool variables, this is the value itself; for set variables...
Definition: ldsb.hh:63
Base-class for variable implementations.
Definition: core.hpp:173
int _variable
Variable index. The ViewArray that the index is meant for is assumed to be known by context...
Definition: ldsb.hh:59
Computation spaces.
Definition: core.hpp:1668
Base-class for both propagators and branchers.
Definition: core.hpp:620
int nxs
Number of variables in symmetry.
Definition: ldsb.hh:145
ArgArray< Int::LDSB::Literal > LiteralArgs
An array of literals.
Definition: ldsb.hh:97
bool operator<(const Literal &rhs) const
Less than. The ordering is the lexicographical order on the (variable,value) pair.
Definition: brancher.hpp:53
Gecode::FloatVal c(-8, 8)
int p
Number of positive literals for node type.
Definition: bool-expr.cpp:236
Choice storing position and value, and symmetric literals to be excluded on the right branch...
Definition: ldsb.hh:305
Base-class for branchers.
Definition: core.hpp:1368
int n
Number of negative literals for node type.
Definition: bool-expr.cpp:238
unsigned int n_seqs
Number of sequences in symmetry.
Definition: ldsb.hh:279
Argument array for non-primitive types.
Definition: array.hpp:715
unsigned int * indices
Array of variable indices.
Definition: ldsb.hh:231
Generic brancher by view and value selection.
Definition: view-val.hpp:95
Literal(void)
Constructor for an empty literal.
Definition: brancher.hpp:44
ModEvent prune(Space &home, View x, int v)
Exclude value from variable view .
Implementation of a variable symmetry at the modelling level.
Definition: ldsb.hh:120
Implementation of a value symmetry.
Definition: ldsb.hh:207
std::function< bool(const Space &home, Var x, int i)> BranchFilter
Function type for branch filter functions.
Definition: filter.hpp:45
unsigned int seq_size
Size of each sequence in symmetry.
Definition: ldsb.hh:235
ArgArray< VarImpBase * > ArgsType
Definition: ldsb.hh:93
int nxs
Number of variables in symmetry.
Definition: ldsb.hh:125
Support::BitSet< Space > dead_sequences
Which sequences are dead.
Definition: ldsb.hh:281
int seq_size
Size of each sequence in symmetry.
Definition: ldsb.hh:147
Symmetry-breaking brancher with generic view and value selection.
Definition: ldsb.hh:336
Implementation of a variable sequence symmetry at the modelling level.
Definition: ldsb.hh:140
Support::BitSetOffset< Space > indices
Symmetric variable indices.
Definition: ldsb.hh:190
Integer sets.
Definition: int.hh:174
VarImpBase ** xs
Array of variables in symmetry.
Definition: ldsb.hh:143
Position information.
Definition: view.hpp:48
View arrays.
Definition: array.hpp:228
int seq_size
Size of each sequence in symmetry.
Definition: ldsb.hh:159
Passing integer arguments.
Definition: int.hh:608
unsigned int seq_size
Size of each sequence in symmetry.
Definition: ldsb.hh:277
double position(const Space &home, IntVar x, int i)
Definition: ldsb.cpp:1269
const int v[7]
Definition: distinct.cpp:263
unsigned int n_values
Total number of values (n_seqs * seq_size)
Definition: ldsb.hh:275
struct Gecode::@585::NNF::@62::@63 b
For binary nodes (and, or, eqv)
Implementation of a single symmetry.
Definition: ldsb.hh:166
struct Gecode::@585::NNF::@62::@64 a
For atomic nodes.
Choice for performing commit
Definition: core.hpp:1338
Archive representation
Definition: archive.hpp:46
ExecStatus
Definition: core.hpp:464
Implementation of a variable symmetry.
Definition: ldsb.hh:187
Simple bitsets.
Definition: bitset.hpp:49
Implementation of a value sequence symmetry.
Definition: ldsb.hh:269
Post propagator for SetVar x
Definition: set.hh:769
int _nsyms
Number of symmetry implementations.
Definition: ldsb.hh:342
SymmetryImp< View > ** _syms
Array of symmetry implementations.
Definition: ldsb.hh:340
Traits of arrays in Gecode.
Definition: array.hpp:68
unsigned int n_seqs
Number of sequences in symmetry.
Definition: ldsb.hh:237
Gecode toplevel namespace
#define GECODE_VTABLE_EXPORT
Definition: support.hh:76
#define GECODE_INT_EXPORT
Definition: int.hh:81
ArgArray< VarImpBase * > StorageType
Definition: ldsb.hh:91
Home class for posting propagators
Definition: core.hpp:846
Choice storing position and value
Definition: view-val.hpp:50
int nrefs
Number of references that point to this symmetry object.
Definition: ldsb.hh:113
void update(IntSet &y, Space &home, IntSet &py)
Definition: rel.hpp:107
Bitsets with index offset.
TFE post(PropagatorGroup g)
Only post functions (but not propagators) from g are considered.
Definition: filter.cpp:142
int * values
Set of sequences.
Definition: ldsb.hh:273