Generated on Wed Jan 4 17:49:20 2006 for Gecode by doxygen 1.4.6

Gecode::Int::Distinct Namespace Reference


Detailed Description

Distinct propagators


Classes

class  Rank
 Rank information. More...
class  MaxInc
 Sort-order by increasing maximum. More...
class  MinInc
 Sort-order by increasing minimum. More...
class  HallInfo
 Information on Hall intervals. More...
class  CombPtrFlag
 Class for combining two pointers with a flag. More...
class  BiLink
 Bidirectional links for both edges and anchors in nodes of view-value graph. More...
class  Node
 Base-class for nodes (both view and value nodes). More...
class  ValNode
 Value nodes in view-value graph. More...
class  ViewNode
 View nodes in view-value graph. More...
class  Edge
 Edges in view-value graph. More...
class  Val
 Naive value distinct propagator. More...
class  Bnd
 Bounds-consistent distinct propagator. More...
class  BndImp
 Implementation of bounds-consistent distinct propagator. More...
class  Dom
 Domain-consistent distinct propagator. More...

Functions

void pathset_t (HallInfo hall[], int start, int end, int to)
void pathset_h (HallInfo hall[], int start, int end, int to)
int pathmin_h (const HallInfo hall[], int i)
int pathmin_t (const HallInfo hall[], int i)
int pathmax_h (const HallInfo hall[], int i)
int pathmax_t (const HallInfo hall[], int i)
template<class View, bool shared>
ExecStatus prop_bnd (Space *home, ViewArray< View > &x)
 Perform bounds-consistent distinct propagation.
template<class View, bool complete>
ExecStatus prop_val (Space *home, ViewArray< View > &x)


Function Documentation

void Gecode::Int::Distinct::pathset_t HallInfo  hall[],
int  start,
int  end,
int  to
[inline]
 

Definition at line 102 of file bnd.icc.

void Gecode::Int::Distinct::pathset_h HallInfo  hall[],
int  start,
int  end,
int  to
[inline]
 

Definition at line 110 of file bnd.icc.

int Gecode::Int::Distinct::pathmin_h const HallInfo  hall[],
int  i
[inline]
 

Definition at line 118 of file bnd.icc.

int Gecode::Int::Distinct::pathmin_t const HallInfo  hall[],
int  i
[inline]
 

Definition at line 125 of file bnd.icc.

int Gecode::Int::Distinct::pathmax_h const HallInfo  hall[],
int  i
[inline]
 

Definition at line 132 of file bnd.icc.

int Gecode::Int::Distinct::pathmax_t const HallInfo  hall[],
int  i
[inline]
 

Definition at line 139 of file bnd.icc.

template<class View, bool shared>
ExecStatus Gecode::Int::Distinct::prop_bnd Space *  home,
ViewArray< View > &  x
 

Perform bounds-consistent distinct propagation.

This is actually the propagation algorithm for Distinct::BndImp. It is available as separate function as it is reused for both bounds-consistent and domain-consistent distinct propagators.

If shared is true, propagation takes into account that some views are shared.

Definition at line 150 of file bnd.icc.

template<class View, bool complete>
ExecStatus Gecode::Int::Distinct::prop_val Space *  home,
ViewArray< View > &  x
 

Definition at line 30 of file val.icc.