Generated on Wed Nov 1 15:04:49 2006 for Gecode by doxygen 1.4.5

bnd.icc File Reference

(Revision: 3768)

#include "gecode/support/sort.hh"

Go to the source code of this file.

Namespaces

namespace  Gecode
namespace  Gecode::Int
namespace  Gecode::Int::Distinct

Classes

class  Gecode::Int::Distinct::Rank
 Rank information. More...
class  Gecode::Int::Distinct::MaxInc< View >
 Sort-order by increasing maximum. More...
class  Gecode::Int::Distinct::MinInc< View >
 Sort-order by increasing minimum. More...
class  Gecode::Int::Distinct::HallInfo
 Information on Hall intervals. More...

Defines

#define GECODE_INT_MINSORTED(i)   (i)
#define GECODE_INT_MAXSORTED(i)   (_maxsorted[i])

Functions

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


Define Documentation

#define GECODE_INT_MINSORTED  )     (i)
 

Definition at line 149 of file bnd.icc.

#define GECODE_INT_MAXSORTED  )     (_maxsorted[i])
 

Definition at line 150 of file bnd.icc.