CouNumber & lb(register int index)
return current lower bound
std::stack< DomainPoint * > domStack_
stack of saved points
CouNumber & x(register int index)
return current variable
Domain(const Domain &src)
copy constructor
CouNumber * x()
return current variable vector
CouNumber & ub(register int index)
current upper bound
DomainPoint(int dim, CouNumber *x, CouNumber *lb, CouNumber *ub, bool copy=true)
constructor
CouNumber * lb()
return current lower bound vector
CouNumber & lb(register int index)
current lower bound
CouNumber * x()
return current variable vector
Define a point in the solution space and the bounds around it.
bool copied_
true if data has been copied (so we own it, and have to delete it upon destruction) ...
CouNumber & ub(register int index)
return current upper bound
bool isNlp_
true if this point comes from an NLP solver (and is thus nlp feasible)
bool & isNlp()
true if this point is the nlp solution
CouNumber & x(register int index)
current variable
void push(int dim, CouNumber *x, CouNumber *lb, CouNumber *ub, bool copy=true)
save current point and start using another
DomainPoint & operator=(const DomainPoint &src)
assignment operator
CouNumber * ub()
return current upper bound vector
CouNumber * x_
current value of variables
CouNumber * lb()
return current lower bound vector
CouNumber * ub()
return current upper bound vector
Define a dynamic point+bounds, with a way to save and restore previous points+bounds through a LIFO s...
void resize(int newdim)
resize domain point (for extending into higher space)