bnd-sup.hpp File Reference

(Revision: 10684)

Go to the source code of this file.

Classes
class	Gecode::Int::GCC::UnReachable
	Class for computing unreachable values in the value GCC propagator. More...
class	Gecode::Int::GCC::Rank
	Maps domain bounds to their position in hall[].bounds. More...
class	Gecode::Int::GCC::MaxInc< View >
	Compares two indices i, j of two views according to the ascending order of the views upper bounds. More...
class	Gecode::Int::GCC::MinInc< View >
	Compares two indices i, j of two views according to the ascending order of the views lower bounds. More...
class	Gecode::Int::GCC::MinIdx< Card >
	Compares two cardinality views according to the index. More...
class	Gecode::Int::GCC::PartialSum< Card >
	Partial sum structure for constant time computation of the maximal capacity of an interval. More...
class	Gecode::Int::GCC::HallInfo
	Container class provding information about the Hall structure of the problem variables. More...
Namespaces
namespace	Gecode
	Gecode toplevel namespace
namespace	Gecode::Int
	Finite domain integers.
namespace	Gecode::Int::GCC
	Global cardinality propagators (Counting).
Functions
template<class Card >
ExecStatus	Gecode::Int::GCC::prop_card (Space &home, ViewArray< IntView > &x, ViewArray< Card > &k)
	Bounds consistency check for cardinality variables.
template<class Card >
bool	Gecode::Int::GCC::card_consistent (ViewArray< IntView > &x, ViewArray< Card > &k)
	Consistency check, whether the cardinality values are feasible.
Path compression
Each of the nodes on the path from start to end becomes a direct child of to.
void	Gecode::Int::GCC::pathset_ps (HallInfo hall[], int start, int end, int to)
	Path compression for potentially stable set structure.
void	Gecode::Int::GCC::pathset_s (HallInfo hall[], int start, int end, int to)
	Path compression for stable set structure.
void	Gecode::Int::GCC::pathset_t (HallInfo hall[], int start, int end, int to)
	Path compression for capacity pointer structure.
void	Gecode::Int::GCC::pathset_h (HallInfo hall[], int start, int end, int to)
	Path compression for hall pointer structure.
Path minimum
Returns the smalles reachable index starting from i.
int	Gecode::Int::GCC::pathmin_h (const HallInfo hall[], int i)
	Path minimum for hall pointer structure.
int	Gecode::Int::GCC::pathmin_t (const HallInfo hall[], int i)
	Path minimum for capacity pointer structure.
Path maximum
Returns the greatest reachable index starting from i.
int	Gecode::Int::GCC::pathmax_h (const HallInfo hall[], int i)
	Path maximum for hall pointer structure.
int	Gecode::Int::GCC::pathmax_t (const HallInfo hall[], int i)
	Path maximum for capacity pointer structure.
int	Gecode::Int::GCC::pathmax_s (const HallInfo hall[], int i)
	Path maximum for stable set pointer structure.
int	Gecode::Int::GCC::pathmax_ps (const HallInfo hall[], int i)
	Path maximum for potentially stable set pointer structure.