44 namespace Gecode {
namespace Set {
78 unsigned int cardMin(
void)
const;
80 unsigned int cardMax(
void)
const;
93 unsigned int glbSize(
void)
const;
95 unsigned int lubSize(
void)
const;
172 template<
class Char,
class Traits>
173 std::basic_ostream<Char,Traits>&
174 operator <<(std::basic_ostream<Char,Traits>& os,
const SetView&
x);
200 unsigned int domSize;
212 unsigned int cardMin(
void)
const;
215 unsigned int cardMax(
void)
const;
228 unsigned int glbSize(
void)
const;
230 unsigned int lubSize(
void)
const;
312 template<
class Char,
class Traits>
313 std::basic_ostream<Char,Traits>&
314 operator <<(std::basic_ostream<Char,Traits>& os,
const ConstSetView&
x);
345 unsigned int cardMin(
void)
const;
348 unsigned int cardMax(
void)
const;
361 unsigned int glbSize(
void)
const;
363 unsigned int lubSize(
void)
const;
439 template<
class Char,
class Traits>
440 std::basic_ostream<Char,Traits>&
441 operator <<(std::basic_ostream<Char,Traits>& os,
const EmptyView&
x);
473 unsigned int cardMin(
void)
const;
475 unsigned int cardMax(
void)
const;
488 unsigned int glbSize(
void)
const;
490 unsigned int lubSize(
void)
const;
566 template<
class Char,
class Traits>
567 std::basic_ostream<Char,Traits>&
568 operator <<(std::basic_ostream<Char,Traits>& os,
const UniverseView&
x);
616 unsigned int cardMin(
void)
const;
618 unsigned int cardMax(
void)
const;
631 unsigned int glbSize(
void)
const;
633 unsigned int lubSize(
void)
const;
739 template<
class Char,
class Traits>
740 std::basic_ostream<Char,Traits>&
741 operator <<(std::basic_ostream<Char,Traits>& os,
const SingletonView&
x);
777 unsigned int cardMin(
void)
const;
779 unsigned int cardMax(
void)
const;
792 unsigned int glbSize(
void)
const;
794 unsigned int lubSize(
void)
const;
900 template<
class Char,
class Traits,
class View>
901 std::basic_ostream<Char,Traits>&
902 operator <<(std::basic_ostream<Char,Traits>& os,
947 unsigned int cardMin(
void)
const;
949 unsigned int cardMax(
void)
const;
962 unsigned int glbSize(
void)
const;
964 unsigned int lubSize(
void)
const;
1089 template<
class Char,
class Traits,
class View>
1090 std::basic_ostream<Char,Traits>&
1091 operator <<(std::basic_ostream<Char,Traits>& os,
1098 template<
class View>
1115 template<
class View>
bool lubAny(const Delta &d) const
Test whether arbitrary values got pruned from lub.
int lubMinN(unsigned int n) const
Return n-th smallest element of the least upper bound.
unsigned int lubSize(void) const
Return the number of elements in the least upper bound.
ModEvent intersectI(Space &home, I &iter)
Intersect least upper bound with range sequence described by i.
void cacheGlb(Space &home)
Update greatest lower bound cache to current domain.
static ModEvent modevent(const Delta &d)
Return modification event.
int lubMinN(unsigned int n) const
Return n-th smallest element of the least upper bound.
bool lubAny(const Delta &d) const
Test whether arbitrary values got pruned from lub.
bool lubAny(const Delta &d) const
Test whether arbitrary values got pruned from lub.
static ModEvent modevent(const Delta &d)
Return modification event.
unsigned int cardMin(void) const
Return minimum cardinality.
static ModEventDelta med(ModEvent)
Translate modification event me to modification event delta for view.
bool notContains(int i) const
Test whether i is not in the least upper bound.
static ModEvent modevent(const Delta &d)
Return modification event.
ModEvent include(Space &home, int i, int j)
Update greatest lower bound to include all elements between and including i and j.
unsigned int cardMin(void) const
Return minimum cardinality.
unsigned int glbSize(void) const
Return the number of elements in the greatest lower bound.
bool glbModified(void) const
Check whether greatest lower bound cache differs from current domain.
void update(Space &home, bool share, ConstSetView &y)
Update this view to be a clone of view y.
ModEvent includeI(Space &home, I &i)
Include range sequence described by i in greatest lower bound.
ComplementView(void)
Default constructor.
ModEvent includeI(Space &home, I &i)
Include range sequence described by i in greatest lower bound.
ConstSetView(void)
Default constructor.
bool lubAny(const Delta &d) const
Test whether arbitrary values got pruned from lub.
bool notContains(int i) const
Test whether i is not in the least upper bound.
unsigned int glbSize(void) const
Return the number of elements in the greatest lower bound.
bool contains(int i) const
Test whether i is in the greatest lower bound.
ModEvent intersectI(Space &home, I &iter)
Intersect least upper bound with range sequence described by i.
unsigned int cardMax(void) const
Return maximum cardinality.
unsigned int unknownSize(void) const
Return the number of unknown elements.
bool glbAny(const Delta &d) const
Test whether arbitrary values got pruned from glb.
bool glbAny(const Delta &d) const
Test whether arbitrary values got pruned from glb.
int glbMin(void) const
Return minimum of the greatest lower bound.
unsigned int lubSize(void) const
Return the number of elements in the least upper bound.
bool glbAny(const Delta &d) const
Test whether arbitrary values got pruned from glb.
Shrinking sets of integers.
SingletonView(void)
Default constructor.
ModEvent include(Space &home, int i, int j)
Update greatest lower bound to include all elements between and including i and j.
int lubMinN(unsigned int n) const
Return n-th smallest element of the least upper bound.
static void schedule(Space &home, Propagator &p, ModEvent me)
Schedule propagator p with modification event me.
int ModEvent
Type for modification events.
ModEvent include(Space &home, int i, int j)
Update greatest lower bound to include all elements between and including i and j.
unsigned int cardMax(void) const
Return maximum cardinality.
void cancel(Space &home, Propagator &p, PropCond pc)
Cancel subscription of propagator p with propagation condition pc to view.
unsigned int glbSize(void) const
Return the number of elements in the greatest lower bound.
Base-class for propagators.
int lubMin(void) const
Return minimum of the least upper bound.
ModEvent intersectI(Space &home, I &iter)
Intersect least upper bound with range sequence described by i.
ModEvent intersect(Space &home, int i, int j)
Update least upper bound to contain at most all elements between and including i and j...
BndSetRanges cr
Cached lower bound.
int lubMinN(unsigned int n) const
Return n-th smallest element of the least upper bound.
Range iterator for the greatest lower bound.
ModEvent intersectI(Space &home, I &iter)
Intersect least upper bound with range sequence described by i.
unsigned int unknownSize(void) const
Return the number of unknown elements.
Finite integer set variable implementation.
bool contains(int i) const
Test whether i is in the greatest lower bound.
ModEvent intersect(Space &home, int i, int j)
Update least upper bound to contain at most all elements between and including i and j...
bool contains(int i) const
Test whether i is in the greatest lower bound.
ModEvent excludeI(Space &home, I &i)
Remove range sequence described by i from least upper bound.
bool notContains(int i) const
Test whether i is not in the least upper bound.
bool lubModified(void) const
Check whether least upper bound cache differs from current domain.
Base-class for constant views.
static PropCond pc_settoint(PropCond pc)
Convert set variable PropCond pc to a PropCond for integer variables.
static ModEvent modevent(const Delta &d)
Return modification event.
Base-class for derived views.
Range iterator for the least upper bound.
int lubMin(void) const
Return minimum of the least upper bound.
UniverseView(void)
Default constructor.
ModEvent exclude(Space &home, View &x, int s)
Prune view x to exclude all values from s.
ModEvent excludeI(Space &home, I &i)
Remove range sequence described by i from least upper bound.
int med(void) const
Return median of domain (greatest element not greater than the median)
unsigned int unknownSize(void) const
Return the number of unknown elements.
bool glbAny(const Delta &d) const
Test whether arbitrary values got pruned from glb.
unsigned int unknownSize(void) const
Return the number of unknown elements.
unsigned int cardMax(void) const
Return maximum cardinality.
GlbDiffRanges(const CachedView< View > &x)
Constructor.
ModEvent excludeI(Space &home, I &i)
Remove range sequence described by i from least upper bound.
ModEvent includeI(Space &home, I &i)
Include range sequence described by i in greatest lower bound.
int p
Number of positive literals for node type.
unsigned int unknownSize(void) const
Return the number of unknown elements.
unsigned int cardMax(void) const
Return maximum cardinality.
int glbMax(void) const
Return maximum of the greatest lower bound.
Gecode::IntArgs i(4, 1, 2, 3, 4)
int glbMin(void) const
Return minimum of the greatest lower bound.
int n
Number of negative literals for node type.
ModEvent exclude(Space &home, int i, int j)
Restrict least upper bound to not contain all elements between and including i and j...
void cancel(Space &home, Propagator &p, PropCond pc)
Cancel subscription of propagator p with propagation condition pc to view.
int glbMin(void) const
Return minimum of the greatest lower bound.
unsigned int unknownSize(void) const
Return the number of unknown elements.
unsigned int cardMax(void) const
Return maximum cardinality.
ModEvent intersect(Space &home, int i, int j)
Update least upper bound to contain at most all elements between and including i and j...
static ModEventDelta med(ModEvent)
Translate modification event me to modification event delta for view.
static ModEvent me(const ModEventDelta &med)
Return modification event for view type in med.
int lubMin(void) const
Return minimum of the least upper bound.
int glbMin(void) const
Return minimum of the greatest lower bound.
Constant view for the universe.
FloatVal intersect(const FloatVal &x, const FloatVal &y)
bool lubAny(const Delta &d) const
Test whether arbitrary values got pruned from lub.
static ModEvent me_negateset(ModEvent me)
Negate the modification event me.
bool notContains(int i) const
Test whether i is not in the least upper bound.
int PropCond
Type for propagation conditions.
int lubMin(void) const
Return minimum of the least upper bound.
static ModEvent me_inttoset(ModEvent me)
Convert integer variable ModEvent me to a ModEvent for set variables.
int lubMax(void) const
Return maximum of the least upper bound.
int glbMax(void) const
Return maximum of the greatest lower bound.
SetView(void)
Default constructor.
unsigned int lubSize(void) const
Return the number of elements in the least upper bound.
GLBndSet glbCache
The cached greatest lower bound.
unsigned int size(I &i)
Size of all ranges of range iterator i.
unsigned int cardMax(void) const
Return maximum cardinality.
EmptyView(void)
Default constructor.
unsigned int cardMax(void) const
Return maximum cardinality.
int glbMin(void) const
Return minimum of the greatest lower bound.
Range iterator for integer sets.
unsigned int lubSize(void) const
Return the number of elements in the least upper bound.
ModEvent exclude(Space &home, int i, int j)
Restrict least upper bound to not contain all elements between and including i and j...
int lubMinN(unsigned int n) const
Return n-th smallest element of the least upper bound.
Base-class for variable implementation views.
unsigned int glbSize(void) const
Return the number of elements in the greatest lower bound.
bool contains(int i) const
Test whether i is in the greatest lower bound.
ModEvent excludeI(Space &home, I &i)
Remove range sequence described by i from least upper bound.
bool contains(int i) const
Test whether i is in the greatest lower bound.
bool contains(int i) const
Test whether i is in the greatest lower bound.
CachedView(void)
Default constructor.
Range iterator for difference of greatest lower bound and cache
ModEvent includeI(Space &home, I &i)
Include range sequence described by i in greatest lower bound.
ModEvent includeI(Space &home, I &i)
Include range sequence described by i in greatest lower bound.
bool notContains(int i) const
Test whether i is not in the least upper bound.
void cancel(Space &home, Propagator &p, PropCond pc)
Cancel subscription of propagator p with propagation condition pc to view.
int lubMax(void) const
Return maximum of the least upper bound.
int lubMax(void) const
Return maximum of the least upper bound.
ModEvent includeI(Space &home, I &i)
Include range sequence described by i in greatest lower bound.
int lubMax(void) const
Return maximum of the least upper bound.
unsigned int lubSize(void) const
Return the number of elements in the least upper bound.
int lubMax(void) const
Return maximum of the least upper bound.
bool same(const ConstSetView &x, const ConstSetView &y)
unsigned int lubSize(void) const
Return the number of elements in the least upper bound.
bool glbAny(const Delta &d) const
Test whether arbitrary values got pruned from glb.
ModEvent excludeI(Space &home, I &i)
Remove range sequence described by i from least upper bound.
ModEvent intersect(Space &home, int i, int j)
Update least upper bound to contain at most all elements between and including i and j...
ModEvent intersectI(Space &home, I &iter)
Intersect least upper bound with range sequence described by i.
unsigned int glbSize(void) const
Return the number of elements in the greatest lower bound.
void update(Space &home, bool share, CachedView< View > &y)
Update this view to be a clone of view y.
ModEvent exclude(Space &home, int i, int j)
Restrict least upper bound to not contain all elements between and including i and j...
unsigned int cardMin(void) const
Return minimum cardinality.
Set view for set variables
int glbMax(void) const
Return maximum of the greatest lower bound.
int lubMax(void) const
Return maximum of the least upper bound.
ModEvent excludeI(Space &home, I &i)
Remove range sequence described by i from least upper bound.
Integer view for integer variables.
void subscribe(Space &home, Propagator &p, PropCond pc, bool schedule=true)
Subscribe propagator p with propagation condition pc to view.
void subscribe(Space &home, Propagator &p, PropCond pc, bool schedule=true)
Subscribe propagator p with propagation condition pc to view.
void cacheLub(Space &home)
Update least upper bound cache to current domain.
unsigned int glbSize(void) const
Return the number of elements in the greatest lower bound.
unsigned int cardMin(void) const
Return minimum cardinality.
Node * x
Pointer to corresponding Boolean expression node.
Generic domain change information to be supplied to advisors.
LUBndSet lubCache
The cached least upper bound.
bool glbAny(const Delta &d) const
Test whether arbitrary values got pruned from glb.
ModEvent include(Space &home, View &x, int s)
Prune view x to only include values from s.
ModEvent includeI(Space &home, I &i)
Include range sequence described by i in greatest lower bound.
ModEvent include(Space &home, int i, int j)
Update greatest lower bound to include all elements between and including i and j.
unsigned int glbSize(void) const
Return the number of elements in the greatest lower bound.
ModEvent intersectI(Space &home, I &iter)
Intersect least upper bound with range sequence described by i.
int lubMin(void) const
Return minimum of the least upper bound.
int glbMax(void) const
Return maximum of the greatest lower bound.
Growing sets of integers.
int glbMax(void) const
Return maximum of the greatest lower bound.
int lubMax(void) const
Return maximum of the least upper bound.
ModEvent intersect(Space &home, int i, int j)
Update least upper bound to contain at most all elements between and including i and j...
static void schedule(Space &home, Propagator &p, ModEvent me)
Schedule propagator p with modification event me.
ModEvent intersect(Space &home, int i, int j)
Update least upper bound to contain at most all elements between and including i and j...
void subscribe(Space &home, Propagator &p, PropCond pc, bool schedule=true)
Subscribe propagator p with propagation condition pc to view.
static ModEvent me(const ModEventDelta &med)
Return modification event for view type in med.
int lubMinN(unsigned int n) const
Return n-th smallest element of the least upper bound.
ModEvent exclude(Space &home, int i, int j)
Restrict least upper bound to not contain all elements between and including i and j...
int glbMin(void) const
Return minimum of the greatest lower bound.
int lubMinN(unsigned int n) const
Return n-th smallest element of the least upper bound.
ModEvent exclude(Space &home, int i, int j)
Restrict least upper bound to not contain all elements between and including i and j...
bool notContains(int i) const
Test whether i is not in the least upper bound.
ModEvent excludeI(Space &home, I &i)
Remove range sequence described by i from least upper bound.
Gecode toplevel namespace
bool lubAny(const Delta &d) const
Test whether arbitrary values got pruned from lub.
ModEvent include(Space &home, int i, int j)
Update greatest lower bound to include all elements between and including i and j.
bool glbAny(const Delta &d) const
Test whether arbitrary values got pruned from glb.
LubRanges< View > lr
Upper bound iterator.
Range iterator for computing set difference.
int glbMax(void) const
Return maximum of the greatest lower bound.
LubDiffRanges(const CachedView< View > &x)
Constructor.
static void schedule(Space &home, Propagator &p, ModEvent me)
Schedule propagator p with modification event me.
static PropCond pc_negateset(PropCond pc)
Negate the propagation condition pc.
GlbRanges< View > gr
Lower bound iterator.
unsigned int unknownSize(void) const
Return the number of unknown elements.
Constant view for the empty set.
int ModEventDelta
Modification event deltas.
bool before(const ConstSetView &x, const ConstSetView &y)
void initCache(Space &home, const IntSet &s)
Initialize cache to set s.
int glbMax(void) const
Return maximum of the greatest lower bound.
unsigned int lubSize(void) const
Return the number of elements in the least upper bound.
Range iterator for difference of least upper bound and cache
unsigned int cardMin(void) const
Return minimum cardinality.
int glbMin(void) const
Return minimum of the greatest lower bound.
unsigned int cardMin(void) const
Return minimum cardinality.
unsigned int cardMin(void) const
Return minimum cardinality.
bool lubAny(const Delta &d) const
Test whether arbitrary values got pruned from lub.
struct Gecode::@518::NNF::@57::@59 a
For atomic nodes.
ModEvent intersectI(Space &home, I &iter)
Intersect least upper bound with range sequence described by i.
int lubMin(void) const
Return minimum of the least upper bound.
ModEvent exclude(Space &home, int i, int j)
Restrict least upper bound to not contain all elements between and including i and j...
static ModEvent me_settoint(ModEvent me)
Convert set variable ModEvent me to a ModEvent for integer variables.
bool contains(int i) const
Test whether i is in the greatest lower bound.
static ModEvent me(const ModEventDelta &med)
Return modification event for view type in med.
bool notContains(int i) const
Test whether i is not in the least upper bound.
int lubMin(void) const
Return minimum of the least upper bound.
BndSetRanges cr
Cached upper bound.
ModEvent include(Space &home, int i, int j)
Update greatest lower bound to include all elements between and including i and j.