Generated on Sat Jan 12 2019 20:58:51 for Gecode by doxygen 1.8.13
violations.hpp
Go to the documentation of this file.
1 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
2 /*
3  * Main authors:
4  * Christian Schulte <schulte@gecode.org>
5  *
6  * Copyright:
7  * Christian Schulte, 2009
8  *
9  * This file is part of Gecode, the generic constraint
10  * development environment:
11  * http://www.gecode.org
12  *
13  * Permission is hereby granted, free of charge, to any person obtaining
14  * a copy of this software and associated documentation files (the
15  * "Software"), to deal in the Software without restriction, including
16  * without limitation the rights to use, copy, modify, merge, publish,
17  * distribute, sublicense, and/or sell copies of the Software, and to
18  * permit persons to whom the Software is furnished to do so, subject to
19  * the following conditions:
20  *
21  * The above copyright notice and this permission notice shall be
22  * included in all copies or substantial portions of the Software.
23  *
24  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
28  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
29  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
30  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
31  *
32  */
33 
34 #include <climits>
35 #include <cmath>
36 
37 namespace Gecode { namespace Int { namespace Sequence {
38 
41  protected:
43  mutable unsigned int fst;
44  public:
46  Violations(void);
48  void init(Space& home, unsigned int n);
50  void update(Space& home, Violations& v);
52  bool empty(void) const;
54  void add(unsigned int i);
56  unsigned int get(void);
57  };
58 
59 
62 
63  forceinline void
64  Violations::init(Space& home, unsigned int n) {
66  fst=size();
67  }
68 
69  forceinline bool
70  Violations::empty(void) const {
71  fst = next(fst);
72  return fst >= size();
73  }
74 
75  forceinline void
77  assert(v.empty());
78  init(home,v.size());
79  }
80 
81  forceinline void
82  Violations::add(unsigned int i) {
83  set(i); if (i < fst) fst = i;
84  }
85 
86  forceinline unsigned int
88  assert(!empty());
89  fst = next(fst);
91  clear(fst); fst++;
92  return fst-1;
93  }
94 
95 }}}
96 
97 // STATISTICS: int-prop
bool get(unsigned int i) const
Access value at bit i.
unsigned int fst
The (possibly) first set bit (set is empty if fst == sz)
Definition: violations.hpp:43
unsigned int size(void) const
Return size of bitset (number of bits)
void clear(unsigned int i)
Clear bit i.
Basic bitset support.
#define forceinline
Definition: config.hpp:185
Computation spaces.
Definition: core.hpp:1701
unsigned int get(void)
Get first element from violation set and remove it.
Definition: violations.hpp:87
int n
Number of negative literals for node type.
Definition: bool-expr.cpp:234
Simple bitsets for recording violations.
Definition: violations.hpp:40
Gecode::IntArgs i({1, 2, 3, 4})
unsigned int next(unsigned int i) const
Return position greater or equal i of next set bit (i is allowed to be equal to size) ...
bool empty(void) const
Return whether set is empty.
Definition: violations.hpp:70
void init(A &a, unsigned int s, bool setbits=false)
Initialize for s bits and allocator a (only after default constructor)
void init(Space &home, unsigned int n)
Initialize violation set for n violations.
Definition: violations.hpp:64
const int v[7]
Definition: distinct.cpp:259
void update(Space &home, Violations &v)
Update violation set during cloning.
Definition: violations.hpp:76
Violations(void)
Default constructor.
Definition: violations.hpp:61
Gecode toplevel namespace
void add(unsigned int i)
Add i to violation set.
Definition: violations.hpp:82