public abstract class InternalConstraint extends Object
Constructor and Description |
---|
InternalConstraint() |
Modifier and Type | Method and Description |
---|---|
abstract int[] |
AbsInfeasible(Geost.SweepDirection minlex)
It provides the largest or smallest point contained in the forbidden area represented by this
constraint.
|
abstract int |
cardInfeasible()
It provides an approximation of the number of infeasible points enforced by this constraint only.
|
abstract Collection<Var> |
definingVariables()
It provides a collection, possibly empty, of variables which define this constraint.
|
abstract DBox |
isFeasible(Geost.SweepDirection min,
LexicographicalOrder order,
GeostObject o,
int currentShape,
int[] c)
It determines whether the given point is a feasible origin of object o, considering
this constraint only.
|
abstract boolean |
isSingleUse()
In some cases, a constraint is used only once per sweep direction on a path
from root to leaf in the search tree.
|
abstract boolean |
isStatic()
It provides information about the constraint future.
|
public abstract int[] AbsInfeasible(Geost.SweepDirection minlex)
minlex
- defines whether the maximal or minimal point should be returnedpublic abstract boolean isStatic()
public abstract boolean isSingleUse()
public abstract DBox isFeasible(Geost.SweepDirection min, LexicographicalOrder order, GeostObject o, int currentShape, int[] c)
min
- the direction of the sweeporder
- the order to be usedo
- the object the constraint is applied tocurrentShape
- the shape id that is currently considered for oc
- the current position of the sweep.public abstract int cardInfeasible()
public abstract Collection<Var> definingVariables()
Copyright © 2015. All rights reserved.