set.hh File Reference

(Revision: 12346)

#include <gecode/kernel.hh>
#include <gecode/int.hh>
#include <gecode/iter.hh>
#include <gecode/support/auto-link.hpp>
#include <gecode/set/exception.hpp>
#include <gecode/set/limits.hpp>
#include <gecode/set/var-imp.hpp>
#include <gecode/set/view.hpp>
#include <gecode/set/array-traits.hpp>
#include <gecode/set/array.hpp>

Go to the source code of this file.

Classes
class	Gecode::SetVar
	Set variables More...
class	Gecode::SetVarGlbRanges
	Iterator for the greatest lower bound ranges of a set variable. More...
class	Gecode::SetVarLubRanges
	Iterator for the least upper bound ranges of a set variable. More...
class	Gecode::SetVarUnknownRanges
	Iterator for the unknown ranges of a set variable. More...
class	Gecode::SetVarGlbValues
	Iterator for the values in the greatest lower bound of a set variable. More...
class	Gecode::SetVarLubValues
	Iterator for the values in the least upper bound of a set variable. More...
class	Gecode::SetVarUnknownValues
	Iterator for the values in the unknown set of a set variable. More...
class	Gecode::SetVarArgs
	Passing set variables. More...
class	Gecode::SetVarArray
	Set variable array More...
Namespaces
namespace	Gecode::Set
	Finite integer sets.
namespace	Gecode
	Gecode toplevel namespace
namespace	Gecode::Set::Limits
	Numerical limits for set variables.
Defines
#define	GECODE_SET_EXPORT
#define	GECODE_LIBRARY_NAME "Set"
Enumerations
enum	Gecode::SetRelType { Gecode::SRT_EQ, Gecode::SRT_NQ, Gecode::SRT_SUB, Gecode::SRT_SUP, Gecode::SRT_DISJ, Gecode::SRT_CMPL, Gecode::SRT_LQ, Gecode::SRT_LE, Gecode::SRT_GQ, Gecode::SRT_GR }
	Common relation types for sets. More...
enum	Gecode::SetOpType { Gecode::SOT_UNION, Gecode::SOT_DUNION, Gecode::SOT_INTER, Gecode::SOT_MINUS }
	Common operations for sets. More...
enum	Gecode::SetVarBranch { Gecode::SET_VAR_NONE = 0, Gecode::SET_VAR_RND, Gecode::SET_VAR_DEGREE_MIN, Gecode::SET_VAR_DEGREE_MAX, Gecode::SET_VAR_AFC_MIN, Gecode::SET_VAR_AFC_MAX, Gecode::SET_VAR_MIN_MIN, Gecode::SET_VAR_MIN_MAX, Gecode::SET_VAR_MAX_MIN, Gecode::SET_VAR_MAX_MAX, Gecode::SET_VAR_SIZE_MIN, Gecode::SET_VAR_SIZE_MAX, Gecode::SET_VAR_SIZE_DEGREE_MIN, Gecode::SET_VAR_SIZE_DEGREE_MAX, Gecode::SET_VAR_SIZE_AFC_MIN, Gecode::SET_VAR_SIZE_AFC_MAX }
	Which variable to select for branching. More...
enum	Gecode::SetValBranch { Gecode::SET_VAL_MIN_INC, Gecode::SET_VAL_MIN_EXC, Gecode::SET_VAL_MED_INC, Gecode::SET_VAL_MED_EXC, Gecode::SET_VAL_MAX_INC, Gecode::SET_VAL_MAX_EXC, Gecode::SET_VAL_RND_INC, Gecode::SET_VAL_RND_EXC }
	Which values to select first for branching. More...
enum	Gecode::SetAssign { Gecode::SET_ASSIGN_MIN_INC, Gecode::SET_ASSIGN_MIN_EXC, Gecode::SET_ASSIGN_MED_INC, Gecode::SET_ASSIGN_MED_EXC, Gecode::SET_ASSIGN_MAX_INC, Gecode::SET_ASSIGN_MAX_EXC, Gecode::SET_ASSIGN_RND_INC, Gecode::SET_ASSIGN_RND_EXC }
	Which value to select for assignment. More...
Functions
void	Gecode::Set::Limits::check (int n, const char *l)
	Check whether integer n is in range, otherwise throw overflow exception with information l.
void	Gecode::Set::Limits::check (unsigned int n, const char *l)
	Check whether unsigned int n is in range for cardinality, otherwise throw overflow exception with information l.
void	Gecode::Set::Limits::check (const IntSet &s, const char *l)
	Check whether minimum and maximum of IntSet s is in range, otherwise throw overflow exception with information l.
void	Gecode::dom (Home home, SetVar x, SetRelType r, int i)
	Propagates $x \sim_r \{i\}$ .
void	Gecode::dom (Home home, SetVar x, SetRelType r, int i, int j)
	Propagates $x \sim_r \{i,\dots,j\}$ .
void	Gecode::dom (Home home, SetVar x, SetRelType r, const IntSet &s)
	Propagates $x \sim_r s$ .
void	Gecode::dom (Home home, SetVar x, SetRelType r, int i, BoolVar b)
	Post propagator for $(x \sim_r \{i\}) \Leftrightarrow b$ .
void	Gecode::dom (Home home, SetVar x, SetRelType r, int i, int j, BoolVar b)
	Post propagator for $(x \sim_r \{i,\dots,j\}) \Leftrightarrow b$ .
void	Gecode::dom (Home home, SetVar x, SetRelType r, const IntSet &s, BoolVar b)
	Post propagator for $(x \sim_r s) \Leftrightarrow b$ .
void	Gecode::cardinality (Home home, SetVar x, unsigned int i, unsigned int j)
	Propagates $i \leq \|s\| \leq j$ .
void	Gecode::rel (Home home, SetVar x, SetRelType r, SetVar y)
	Post propagator for $x \sim_r y$ .
void	Gecode::rel (Home home, SetVar x, SetRelType r, SetVar y, BoolVar b)
	Post propagator for $(x \sim_r y) \Leftrightarrow b$ .
void	Gecode::rel (Home home, SetVar s, SetRelType r, IntVar x)
	Post propagator for $s \sim_r \{x\}$ .
void	Gecode::rel (Home home, IntVar x, SetRelType r, SetVar s)
	Post propagator for $\{x\} \sim_r s$ .
void	Gecode::rel (Home home, SetVar s, SetRelType r, IntVar x, BoolVar b)
	Post propagator for $(s \sim_r \{x\}) \Leftrightarrow b$ .
void	Gecode::rel (Home home, IntVar x, SetRelType r, SetVar s, BoolVar b)
	Post propagator for $(\{x\} \sim_r s) \Leftrightarrow b$ .
void	Gecode::rel (Home home, SetVar s, IntRelType r, IntVar x)
	Post propagator for $\|s\|\geq 1 \land \forall i\in s:\ i \sim_r x$ .
void	Gecode::rel (Home home, IntVar x, IntRelType r, SetVar s)
	Post propagator for $\|s\|\geq 1 \land \forall i\in s:\ x \sim_r i$ .
void	Gecode::rel (Home home, SetVar x, SetOpType op, SetVar y, SetRelType r, SetVar z)
	Post propagator for $(x \diamond_{\mathit{op}} y) \sim_r z$ .
void	Gecode::rel (Home home, SetOpType op, const SetVarArgs &x, SetVar y)
	Post propagator for $y = \diamond_{\mathit{op}} x$ .
void	Gecode::rel (Home home, SetOpType op, const SetVarArgs &x, const IntSet &z, SetVar y)
	Post propagator for $y = \diamond_{\mathit{op}} x \diamond_{\mathit{op}} z$ .
void	Gecode::rel (Home home, SetOpType op, const IntVarArgs &x, const IntSet &z, SetVar y)
	Post propagator for $y = \diamond_{\mathit{op}} x \diamond_{\mathit{op}} z$ .
void	Gecode::rel (Home home, SetOpType op, const IntVarArgs &x, SetVar y)
	Post propagator for $y = \diamond_{\mathit{op}} x$ .
void	Gecode::rel (Home home, const IntSet &x, SetOpType op, SetVar y, SetRelType r, SetVar z)
	Post propagator for $(x \diamond_{\mathit{op}} y) \sim_r z$ .
void	Gecode::rel (Home home, SetVar x, SetOpType op, const IntSet &y, SetRelType r, SetVar z)
	Post propagator for $(x \diamond_{\mathit{op}} y) \sim_r z$ .
void	Gecode::rel (Home home, SetVar x, SetOpType op, SetVar y, SetRelType r, const IntSet &z)
	Post propagator for $(x \diamond_{\mathit{op}} y) \sim_r z$ .
void	Gecode::rel (Home home, const IntSet &x, SetOpType op, SetVar y, SetRelType r, const IntSet &z)
	Post propagator for $(x \diamond_{\mathit{op}} y) \sim_r z$ .
void	Gecode::rel (Home home, SetVar x, SetOpType op, const IntSet &y, SetRelType r, const IntSet &z)
	Post propagator for $(x \diamond_{\mathit{op}} y) \sim_r z$ .
void	Gecode::convex (Home home, SetVar x)
	Post propagator that propagates that x is convex.
void	Gecode::convex (Home home, SetVar x, SetVar y)
	Post propagator that propagates that y is the convex hull of x.
void	Gecode::sequence (Home home, const SetVarArgs &x)
	Post propagator for $\forall 0\leq i< \|x\|-1 : \max(x_i)<\min(x_{i+1})$ .
void	Gecode::sequence (Home home, const SetVarArgs &y, SetVar x)
	Post propagator for $\forall 0\leq i< \|x\|-1 : \max(x_i)<\min(x_{i+1})$ and $x = \bigcup_{i\in\{0,\dots,n-1\}} y_i$ .
void	Gecode::atmostOne (Home home, const SetVarArgs &x, unsigned int c)
	Post propagator for $\forall 0\leq i\leq \|x\| : \|x_i\|=c$ and $\forall 0\leq i<j\leq \|x\| : \|x_i\cap x_j\|\leq 1$ .
void	Gecode::min (Home home, SetVar s, IntVar x)
	Post propagator that propagates that x is the minimal element of s, and that s is not empty.
void	Gecode::notMin (Home home, SetVar s, IntVar x)
	Post propagator that propagates that x is not the minimal element of s.
void	Gecode::min (Home home, SetVar s, IntVar x, BoolVar b)
	Post reified propagator for b iff x is the minimal element of s.
void	Gecode::max (Home home, SetVar s, IntVar x)
	Post propagator that propagates that x is the maximal element of s, and that s is not empty.
void	Gecode::notMax (Home home, SetVar s, IntVar x)
	Post propagator that propagates that x is not the maximal element of s.
void	Gecode::max (Home home, SetVar s, IntVar x, BoolVar b)
	Post reified propagator for b iff x is the maximal element of s.
void	Gecode::channelSorted (Home home, const IntVarArgs &x, SetVar y)
	Post propagator for $\{x_0,\dots,x_{n-1}\}=y$ and $x_i<x_{i+1}$ .
void	Gecode::channel (Home home, const IntVarArgs &x, const SetVarArgs &y)
	Post propagator for $x_i=j \Leftrightarrow i\in y_j$ .
void	Gecode::channel (Home home, const BoolVarArgs &x, SetVar y)
	Post propagator for $x_i=1 \Leftrightarrow i\in y$ .
void	Gecode::cardinality (Home home, SetVar s, IntVar x)
	Post propagator for .
void	Gecode::weights (Home home, IntSharedArray elements, IntSharedArray weights, SetVar x, IntVar y)
	Post propagator for $y = \mathrm{weight}(x)$ .
void	Gecode::precede (Home home, const SetVarArgs &x, int s, int t)
	Post propagator that s precedes t in x.
void	Gecode::precede (Home home, const SetVarArgs &x, const IntArgs &c)
	Post propagator that successive values in c precede each other in x.
void	Gecode::element (Home home, SetOpType op, const SetVarArgs &x, SetVar y, SetVar z, const IntSet &u=IntSet(Set::Limits::min, Set::Limits::max))
	Post propagator for $z=\diamond_{\mathit{op}}\langle x_0,\dots,x_{n-1}\rangle[y]$ .
void	Gecode::element (Home home, SetOpType op, const IntVarArgs &x, SetVar y, SetVar z, const IntSet &u=IntSet(Set::Limits::min, Set::Limits::max))
	Post propagator for $z=\diamond_{\mathit{op}}\langle \{x_0\},\dots,\{x_{n-1}\}\rangle[y]$ .
void	Gecode::element (Home home, SetOpType op, const IntSetArgs &x, SetVar y, SetVar z, const IntSet &u=IntSet(Set::Limits::min, Set::Limits::max))
	Post propagator for $z=\diamond_{\mathit{op}}\langle x_0,\dots,x_{n-1}\rangle[y]$ .
void	Gecode::element (Home home, SetOpType op, const IntArgs &x, SetVar y, SetVar z, const IntSet &u=IntSet(Set::Limits::min, Set::Limits::max))
	Post propagator for $z=\diamond_{\mathit{op}}\langle \{x_0\},\dots,\{x_{n-1}\}\rangle[y]$ .
void	Gecode::element (Home home, const SetVarArgs &x, IntVar y, SetVar z)
	Post propagator for $z=\langle x_0,\dots,x_{n-1}\rangle[y]$ .
void	Gecode::element (Home home, const IntSetArgs &s, IntVar y, SetVar z)
	Post propagator for $z=\langle s_0,\dots,s_{n-1}\rangle[y]$ .
void	Gecode::element (Home home, const IntSetArgs &a, IntVar x, int w, IntVar y, int h, SetVar z)
	Post propagator for $a_{x+w\cdot y}=z$ .
void	Gecode::element (Home home, const SetVarArgs &a, IntVar x, int w, IntVar y, int h, SetVar z)
	Post propagator for $a_{x+w\cdot y}=z$ .
void	Gecode::wait (Home home, SetVar x, void(*c)(Space &home))
	Execute c when x becomes assigned.
void	Gecode::wait (Home home, const SetVarArgs &x, void(*c)(Space &home))
	Execute c when all variables in x become assigned.
void	Gecode::branch (Home home, const SetVarArgs &x, SetVarBranch vars, SetValBranch vals, const VarBranchOptions &o_vars=VarBranchOptions::def, const ValBranchOptions &o_vals=ValBranchOptions::def)
	Branch over x with variable selection vars and value selection vals.
void	Gecode::branch (Home home, const SetVarArgs &x, const TieBreakVarBranch< SetVarBranch > &vars, SetValBranch vals, const TieBreakVarBranchOptions &o_vars=TieBreakVarBranchOptions::def, const ValBranchOptions &o_vals=ValBranchOptions::def)
	Branch over x with tie-breaking variable selection vars and value selection vals.
void	Gecode::branch (Home home, SetVar x, SetValBranch vals, const ValBranchOptions &o_vals=ValBranchOptions::def)
	Branch over x with value selection vals.
void	Gecode::assign (Home home, const SetVarArgs &x, SetAssign vals, const ValBranchOptions &o_vals=ValBranchOptions::def)
	Assign all x with value selection vals.
void	Gecode::assign (Home home, SetVar x, SetAssign vals, const ValBranchOptions &o_vals=ValBranchOptions::def)
	Assign x with value selection vals.
Variables
const int	Gecode::Set::Limits::max = (Gecode::Int::Limits::max / 2) - 1
	Largest allowed integer in integer set.
const int	Gecode::Set::Limits::min = -max
	Smallest allowed integer in integer set.
const unsigned int	Gecode::Set::Limits::card = max-min+1
	Maximum cardinality of an integer set.