bnd-sup.hpp
Go to the documentation of this file.
Container class providing information about the Hall structure of the problem variables.
Definition bnd-sup.hpp:456
int t
Critical capacity pointer t represents a predecessor function where denotes the predecessor of i in ...
Definition bnd-sup.hpp:465
Compares two cardinality views according to the index.
Definition bnd-sup.hpp:221
int skipNonNullElementsLeft(int v) const
Skip neighbouring array entries if their values do not differ.
Definition bnd-sup.hpp:410
bool check_update_max(ViewArray< Card > &k)
Check whether the values in the partial sum structure containing the upper cardinality bounds differ ...
Definition bnd-sup.hpp:418
bool check_update_min(ViewArray< Card > &k)
Check whether the values in the partial sum structure containing the lower cardinality bounds differ ...
Definition bnd-sup.hpp:432
int sumup(int from, int to) const
Compute the maximum capacity of an interval.
Definition bnd-sup.hpp:377
int skipNonNullElementsRight(int v) const
Skip neighbouring array entries if their values do not differ.
Definition bnd-sup.hpp:403
Maps domain bounds to their position in hall[].bounds.
Definition bnd-sup.hpp:154
Class for computing unreachable values in the value GCC propagator.
Definition bnd-sup.hpp:53
T * alloc(long unsigned int n)
Allocate block of n objects of type T from space heap.
Definition core.hpp:2973
bool card_consistent(ViewArray< IntView > &x, ViewArray< Card > &k)
Consistency check, whether the cardinality values are feasible.
Definition bnd-sup.hpp:139
ExecStatus prop_card(Space &home, ViewArray< IntView > &x, ViewArray< Card > &k)
Bounds consistency check for cardinality variables.
Definition bnd-sup.hpp:74
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
Definition macros.hpp:52
Global cardinality propagators (Counting).
int pathmin_h(const HallInfo hall[], int i)
Path minimum for hall pointer structure.
Definition bnd-sup.hpp:549
int pathmax_t(const HallInfo hall[], int i)
Path maximum for capacity pointer structure.
Definition bnd-sup.hpp:579
void pathset_ps(HallInfo hall[], int start, int end, int to)
Path compression for potentially stable set structure.
Definition bnd-sup.hpp:507
int pathmax_s(const HallInfo hall[], int i)
Path maximum for stable set pointer structure.
Definition bnd-sup.hpp:587
void pathset_t(HallInfo hall[], int start, int end, int to)
Path compression for capacity pointer structure.
Definition bnd-sup.hpp:523
int pathmin_t(const HallInfo hall[], int i)
Path minimum for capacity pointer structure.
Definition bnd-sup.hpp:556
void pathset_h(HallInfo hall[], int start, int end, int to)
Path compression for hall pointer structure.
Definition bnd-sup.hpp:531
void pathset_s(HallInfo hall[], int start, int end, int to)
Path compression for stable set structure.
Definition bnd-sup.hpp:515
int pathmax_h(const HallInfo hall[], int i)
Path maximum for hall pointer structure.
Definition bnd-sup.hpp:572
int pathmax_ps(const HallInfo hall[], int i)
Path maximum for potentially stable set pointer structure.
Definition bnd-sup.hpp:594
Gecode toplevel namespace
void min(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Definition arithmetic.cpp:67
void max(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Definition arithmetic.cpp:49
