71 (opt.size() < 31) ? (1 << (opt.size()-1))-1 :
Int::
Limits::
max) {
80 const int n =
m.size();
81 const int n_d = (n*n-n)/2;
87 for (
int k=0, i=0; i<n-1; i++)
88 for (
int j=i+1; j<n; j++, k++)
104 return m[
m.size()-1];
110 os <<
"\tm[" <<
m.size() <<
"] = " <<
m << std::endl;
116 m.update(*
this, s.
m);
134 opt.
parse(argc,argv);
static void run(const Options &opt, Script *s=NULL)
Passing integer variables.
Options for scripts with additional size parameter
int main(int argc, char *argv[])
Main-function.
virtual Space * copy(void)
Copy during cloning.
virtual void print(std::ostream &os) const
Print solution.
IntVarArray m
Array for ruler marks.
GolombRuler(const SizeOptions &opt)
Actual model.
GolombRuler(GolombRuler &s)
Constructor for cloning s.
virtual IntVar cost(void) const
Return cost.
void parse(int argc, char *argv[])
Parse commandline arguments.
Driver::ScriptBase< Driver::IgnoreStepOption< IntMinimizeSpace > > IntMinimizeScript
Base-class for scripts for finding solution of lowest integer cost.
void branch(Home home, const FloatVarArgs &x, FloatVarBranch vars, FloatValBranch vals, FloatBranchFilter bf=nullptr, FloatVarValPrint vvp=nullptr)
Branch over x with variable selection vars and value selection vals.
void rel(Home home, FloatVar x0, FloatRelType frt, FloatVar x1)
Post propagator for .
@ IRT_GQ
Greater or equal ( )
@ IPL_BND
Bounds propagation.
Numerical limits for integer variables.
Gecode toplevel namespace
IntVar expr(Home home, const LinIntExpr &e, const IntPropLevels &ipls=IntPropLevels::def)
Post linear expression and return its value.
void distinct(Home home, const IntVarArgs &x, IntPropLevel ipl=IPL_DEF)
Post propagator for for all .
IntVarBranch INT_VAR_NONE(void)
Select first unassigned variable.
IntValBranch INT_VAL_MIN(void)
Select smallest value.
void max(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .