38 namespace Gecode {
namespace Int {
namespace Extensional {
44 template<
unsigned int sz>
49 for (
unsigned int i=0U;
i <
n;
i++)
52 for (
unsigned int i=n;
i < sz;
i++)
56 template<
unsigned int sz>
57 template<
unsigned int largersz>
62 for (
unsigned int i = sz;
i--; )
67 template<
unsigned int sz>
68 template<
class IndexType>
71 assert(sz == sbs.
width());
73 for (
unsigned int i = sz;
i--; )
75 for (
unsigned int i = sbs.
words();
i--; ) {
81 template<
unsigned int sz>
84 for (
unsigned int i=sz;
i--; ) {
86 assert(mask[
i].none());
90 template<
unsigned int sz>
93 for (
unsigned int i=sz;
i--; )
97 template<
unsigned int sz>
101 for (
unsigned int i=sz;
i--; )
105 template<
unsigned int sz>
108 for (
unsigned int i=sz;
i--; )
112 template<
unsigned int sz>
115 for (
unsigned int i=sz;
i--; )
119 template<
unsigned int sz>
122 for (
unsigned int i=sz;
i--; )
128 template<
unsigned int sz>
131 for (
unsigned int i=sz;
i--; )
137 template<
unsigned int sz>
142 for (
unsigned int i=sz;
i--; )
149 template<
unsigned int sz>
155 template<
unsigned int sz>
void intersect_with_masks(const BitSetData *a, const BitSetData *b)
Intersect with the "or" of and b.
#define GECODE_ASSUME(p)
Assert certain property.
bool empty(void) const
Check whether the set is empty.
void intersect_with_mask(const BitSetData *mask)
Intersect with mask, sparse mask if sparse is true.
void add_to_mask(const BitSetData *b, BitSetData *mask) const
Add to mask.
BitSetData bits[_size]
Words.
unsigned int width(void) const
Return the highest active index.
Gecode::IntArgs i(4, 1, 2, 3, 4)
int n
Number of negative literals for node type.
bool empty(void) const
Check whether the set is empty.
void o(BitSetData a)
Perform "or" with a.
unsigned int size(void) const
Return the total number of words.
unsigned int words(void) const
Return the number of required bit set words.
void init(bool setbits=false)
Initialize with all bits set if setbits.
IndexType * index
Indices.
struct Gecode::@585::NNF::@62::@63 b
For binary nodes (and, or, eqv)
void clear_mask(BitSetData *mask)
Clear the first limit words in mask.
void nand_with_mask(const BitSetData *b)
Perform "nand" with b.
unsigned int width(void) const
Return the highest active index.
unsigned int words(void) const
Return the number of required bit set words.
struct Gecode::@585::NNF::@62::@64 a
For atomic nodes.
void a(BitSetData a)
Perform "and" with a.
bool intersects(const BitSetData *b)
Check if has a non-empty intersection with the set.
Gecode toplevel namespace
#define GECODE_NEVER
Assert that this command is never executed.