view.hpp
Go to the documentation of this file.
void subscribe(Space &home, Propagator &p, PropCond pc, bool schedule=true)
Subscribe propagator p with propagation condition pc to view.
Definition view.hpp:650
static ModEvent me(const ModEventDelta &med)
Return modification event for view type in med.
Definition view.hpp:639
static void schedule(Space &home, Propagator &p, ModEvent me)
Schedule propagator p with modification event me.
Definition view.hpp:634
void cancel(Space &home, Propagator &p, PropCond pc)
Cancel subscription of propagator p with propagation condition pc to view.
Definition view.hpp:656
FloatVal intersect(const FloatVal &x, const FloatVal &y)
Return intersection of x and y.
Definition val.hpp:504
ModEvent exclude(Space &home, int i, int j)
Restrict least upper bound to not contain all elements between and including i and j.
Definition cached.hpp:153
ModEvent excludeI(Space &home, I &i)
Remove range sequence described by i from least upper bound.
ModEvent include(Space &home, int i, int j)
Update greatest lower bound to include all elements between and including i and j.
Definition cached.hpp:147
bool glbAny(const Delta &d) const
Test whether arbitrary values got pruned from glb.
Definition cached.hpp:242
bool glbModified(void) const
Check whether greatest lower bound cache differs from current domain.
Definition cached.hpp:304
bool lubAny(const Delta &d) const
Test whether arbitrary values got pruned from lub.
Definition cached.hpp:260
static void schedule(Space &home, Propagator &p, ModEvent me)
Schedule propagator p with modification event me.
Definition cached.hpp:202
unsigned int glbSize(void) const
Return the number of elements in the greatest lower bound.
Definition cached.hpp:49
int lubMinN(unsigned int n) const
Return n-th smallest element of the least upper bound.
ModEvent includeI(Space &home, I &i)
Include range sequence described by i in greatest lower bound.
void cacheLub(Space &home)
Update least upper bound cache to current domain.
Definition cached.hpp:297
void cacheGlb(Space &home)
Update greatest lower bound cache to current domain.
Definition cached.hpp:290
static ModEventDelta med(ModEvent)
Translate modification event me to modification event delta for view.
bool lubModified(void) const
Check whether least upper bound cache differs from current domain.
Definition cached.hpp:310
ModEvent intersectI(Space &home, I &iter)
Intersect least upper bound with range sequence described by i.
unsigned int lubSize(void) const
Return the number of elements in the least upper bound.
Definition cached.hpp:55
bool notContains(int i) const
Test whether i is not in the least upper bound.
Definition cached.hpp:71
static ModEvent me(const ModEventDelta &med)
Return modification event for view type in med.
Definition cached.hpp:207
void update(Space &home, CachedView< View > &y)
Update this view to be a clone of view y.
bool glbAny(const Delta &d) const
Test whether arbitrary values got pruned from glb.
Definition complement.hpp:303
static ModEvent me_negateset(ModEvent me)
Negate the modification event me.
Definition complement.hpp:53
ModEvent include(Space &home, int i, int j)
Update greatest lower bound to include all elements between and including i and j.
Definition complement.hpp:207
static ModEvent me(const ModEventDelta &med)
Return modification event for view type in med.
Definition complement.hpp:268
bool contains(int i) const
Test whether i is in the greatest lower bound.
Definition complement.hpp:93
unsigned int lubSize(void) const
Return the number of elements in the least upper bound.
Definition complement.hpp:81
static void schedule(Space &home, Propagator &p, ModEvent me)
Schedule propagator p with modification event me.
Definition complement.hpp:263
bool notContains(int i) const
Test whether i is not in the least upper bound.
Definition complement.hpp:97
ModEvent exclude(Space &home, int i, int j)
Restrict least upper bound to not contain all elements between and including i and j.
Definition complement.hpp:213
void subscribe(Space &home, Propagator &p, PropCond pc, bool schedule=true)
Subscribe propagator p with propagation condition pc to view.
Definition complement.hpp:238
ModEvent intersect(Space &home, int i, int j)
Update least upper bound to contain at most all elements between and including i and j.
Definition complement.hpp:199
static PropCond pc_negateset(PropCond pc)
Negate the propagation condition pc.
Definition complement.hpp:65
ModEvent intersectI(Space &home, I &iter)
Intersect least upper bound with range sequence described by i.
Definition complement.hpp:231
unsigned int glbSize(void) const
Return the number of elements in the greatest lower bound.
Definition complement.hpp:75
bool lubAny(const Delta &d) const
Test whether arbitrary values got pruned from lub.
Definition complement.hpp:321
void cancel(Space &home, Propagator &p, PropCond pc)
Cancel subscription of propagator p with propagation condition pc to view.
Definition complement.hpp:245
ModEvent excludeI(Space &home, I &i)
Remove range sequence described by i from least upper bound.
Definition complement.hpp:219
ModEvent includeI(Space &home, I &i)
Include range sequence described by i in greatest lower bound.
Definition complement.hpp:225
int lubMinN(unsigned int n) const
Return n-th smallest element of the least upper bound.
static ModEventDelta med(ModEvent)
Translate modification event me to modification event delta for view.
Definition complement.hpp:274
unsigned int unknownSize(void) const
Return the number of unknown elements.
Definition complement.hpp:87
bool notContains(int i) const
Test whether i is not in the least upper bound.
Definition const.hpp:122
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.
Definition const.hpp:105
bool glbAny(const Delta &d) const
Test whether arbitrary values got pruned from glb.
Definition const.hpp:253
ModEvent intersect(Space &home, int i, int j)
Update least upper bound to contain at most all elements between and including i and j.
Definition const.hpp:177
bool operator<(const ConstSetView &y) const
Whether this view comes before view y (arbitrary order).
Definition const.hpp:680
ModEvent include(Space &home, int i, int j)
Update greatest lower bound to include all elements between and including i and j.
Definition const.hpp:183
unsigned int glbSize(void) const
Return the number of elements in the greatest lower bound.
Definition const.hpp:102
ModEvent includeI(Space &home, I &i)
Include range sequence described by i in greatest lower bound.
Definition const.hpp:205
ModEvent exclude(Space &home, int i, int j)
Restrict least upper bound to not contain all elements between and including i and j.
Definition const.hpp:191
ModEvent intersectI(Space &home, I &iter)
Intersect least upper bound with range sequence described by i.
Definition const.hpp:211
ModEvent excludeI(Space &home, I &i)
Remove range sequence described by i from least upper bound.
Definition const.hpp:199
void update(Space &home, ConstSetView &y)
Update this view to be a clone of view y.
Definition const.hpp:217
bool lubAny(const Delta &d) const
Test whether arbitrary values got pruned from lub.
Definition const.hpp:268
ModEvent includeI(Space &home, I &i)
Include range sequence described by i in greatest lower bound.
Definition const.hpp:349
bool notContains(int i) const
Test whether i is not in the least upper bound.
Definition const.hpp:291
bool glbAny(const Delta &d) const
Test whether arbitrary values got pruned from glb.
Definition const.hpp:375
unsigned int glbSize(void) const
Return the number of elements in the greatest lower bound.
Definition const.hpp:279
ModEvent include(Space &home, int i, int j)
Update greatest lower bound to include all elements between and including i and j.
Definition const.hpp:337
ModEvent excludeI(Space &home, I &i)
Remove range sequence described by i from least upper bound.
Definition const.hpp:344
bool lubAny(const Delta &d) const
Test whether arbitrary values got pruned from lub.
Definition const.hpp:393
ModEvent exclude(Space &home, int i, int j)
Restrict least upper bound to not contain all elements between and including i and j.
Definition const.hpp:341
ModEvent intersect(Space &home, int i, int j)
Update least upper bound to contain at most all elements between and including i and j.
Definition const.hpp:334
unsigned int lubSize(void) const
Return the number of elements in the least upper bound.
Definition const.hpp:282
ModEvent intersectI(Space &home, I &iter)
Intersect least upper bound with range sequence described by i.
Definition const.hpp:354
int lubMinN(unsigned int n) const
Return n-th smallest element of the least upper bound.
Range iterator for difference of greatest lower bound and cache
Definition view.hpp:1138
Range iterator for difference of least upper bound and cache
Definition view.hpp:1155
bool lubAny(const Delta &d) const
Test whether arbitrary values got pruned from lub.
Definition set.hpp:201
bool glbAny(const Delta &d) const
Test whether arbitrary values got pruned from glb.
Definition set.hpp:188
ModEvent intersectI(Space &home, I &iter)
Intersect least upper bound with range sequence described by i.
Definition set.hpp:164
ModEvent include(Space &home, int i, int j)
Update greatest lower bound to include all elements between and including i and j.
Definition set.hpp:126
unsigned int lubSize(void) const
Return the number of elements in the least upper bound.
Definition set.hpp:66
int lubMinN(unsigned int n) const
Return n-th smallest element of the least upper bound.
Definition set.hpp:98
unsigned int glbSize(void) const
Return the number of elements in the greatest lower bound.
Definition set.hpp:62
ModEvent intersect(Space &home, int i, int j)
Update least upper bound to contain at most all elements between and including i and j.
Definition set.hpp:141
ModEvent excludeI(Space &home, I &i)
Remove range sequence described by i from least upper bound.
Definition set.hpp:160
ModEvent exclude(Space &home, int i, int j)
Restrict least upper bound to not contain all elements between and including i and j.
Definition set.hpp:156
ModEvent includeI(Space &home, I &i)
Include range sequence described by i in greatest lower bound.
Definition set.hpp:151
ModEvent exclude(Space &home, int i, int j)
Restrict least upper bound to not contain all elements between and including i and j.
Definition singleton.hpp:182
bool lubAny(const Delta &d) const
Test whether arbitrary values got pruned from lub.
Definition singleton.hpp:292
bool contains(int i) const
Test whether i is in the greatest lower bound.
Definition singleton.hpp:107
ModEvent intersect(Space &home, int i, int j)
Update least upper bound to contain at most all elements between and including i and j.
Definition singleton.hpp:154
void reschedule(Space &home, Propagator &p, PropCond pc)
Re-schedule propagator p with propagation condition pc.
Definition singleton.hpp:235
unsigned int lubSize(void) const
Return the number of elements in the least upper bound.
Definition singleton.hpp:99
static ModEvent me(const ModEventDelta &med)
Return modification event for view type in med.
Definition singleton.hpp:254
ModEvent intersectI(Space &home, I &iter)
Intersect least upper bound with range sequence described by i.
Definition singleton.hpp:221
bool glbAny(const Delta &d) const
Test whether arbitrary values got pruned from glb.
Definition singleton.hpp:283
int lubMinN(unsigned int n) const
Return n-th smallest element of the least upper bound.
unsigned int glbSize(void) const
Return the number of elements in the greatest lower bound.
Definition singleton.hpp:94
ModEvent includeI(Space &home, I &i)
Include range sequence described by i in greatest lower bound.
Definition singleton.hpp:205
void cancel(Space &home, Propagator &p, PropCond pc)
Cancel subscription of propagator p with propagation condition pc to view.
Definition singleton.hpp:231
unsigned int unknownSize(void) const
Return the number of unknown elements.
Definition singleton.hpp:102
void subscribe(Space &home, Propagator &p, PropCond pc, bool schedule=true)
Subscribe propagator p with propagation condition pc to view.
Definition singleton.hpp:226
bool notContains(int i) const
Test whether i is not in the least upper bound.
Definition singleton.hpp:111
static PropCond pc_settoint(PropCond pc)
Convert set variable PropCond pc to a PropCond for integer variables.
Definition singleton.hpp:52
ModEvent include(Space &home, int i, int j)
Update greatest lower bound to include all elements between and including i and j.
Definition singleton.hpp:177
ModEvent excludeI(Space &home, I &i)
Remove range sequence described by i from least upper bound.
Definition singleton.hpp:200
static ModEvent me_inttoset(ModEvent me)
Convert integer variable ModEvent me to a ModEvent for set variables.
Definition singleton.hpp:64
static ModEvent me_settoint(ModEvent me)
Convert set variable ModEvent me to a ModEvent for integer variables.
Definition singleton.hpp:80
static void schedule(Space &home, Propagator &p, ModEvent me)
Schedule propagator p with modification event me.
Definition singleton.hpp:250
static ModEventDelta med(ModEvent)
Translate modification event me to modification event delta for view.
Definition singleton.hpp:258
ModEvent excludeI(Space &home, I &i)
Remove range sequence described by i from least upper bound.
Definition const.hpp:465
ModEvent exclude(Space &home, int i, int j)
Restrict least upper bound to not contain all elements between and including i and j.
Definition const.hpp:462
bool lubAny(const Delta &d) const
Test whether arbitrary values got pruned from lub.
Definition const.hpp:524
ModEvent includeI(Space &home, I &i)
Include range sequence described by i in greatest lower bound.
Definition const.hpp:470
ModEvent intersectI(Space &home, I &iter)
Intersect least upper bound with range sequence described by i.
Definition const.hpp:481
ModEvent include(Space &home, int i, int j)
Update greatest lower bound to include all elements between and including i and j.
Definition const.hpp:459
ModEvent intersect(Space &home, int i, int j)
Update least upper bound to contain at most all elements between and including i and j.
Definition const.hpp:475
bool notContains(int i) const
Test whether i is not in the least upper bound.
Definition const.hpp:416
bool glbAny(const Delta &d) const
Test whether arbitrary values got pruned from glb.
Definition const.hpp:506
int lubMinN(unsigned int n) const
Return n-th smallest element of the least upper bound.
unsigned int glbSize(void) const
Return the number of elements in the greatest lower bound.
Definition const.hpp:404
unsigned int lubSize(void) const
Return the number of elements in the least upper bound.
Definition const.hpp:407
std::basic_ostream< Char, Traits > & operator<<(std::basic_ostream< Char, Traits > &os, const IdxViewArray< View > &x)
Definition idx-view.hpp:167
bool operator==(const CachedView< View > &x, const CachedView< View > &y)
Definition cached.hpp:401
bool operator!=(const CachedView< View > &x, const CachedView< View > &y)
Definition cached.hpp:406
Gecode toplevel namespace
