public abstract class InternalConstraint extends Object
This interface defines the functionality required by a constraint in order to be used by Geost's sweeping algorithm.
The different methods defined by this interface are likely to be called often during a single call to the consistency function, and should therefore be as efficient as possible.
Comments about implementation details.
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)
TODO, is this function potentially still useful? If not remove, if yes then adapt the description about event point series. What is it used now for? I will keep it as it may be used later on, but for sure the code implementing those functions is not tested much or requires some cleaning.
This allows to build an event point series that stays consistent whatever the lexical order is, and whatever the object to place is (some shifting is applied to take the object's shape into account)
The dimension of the point returned is k+1, where k is the object dimension. The last dimension is time.
minlex
 defines whether the maximal or minimal point should be returnedpublic abstract boolean isStatic()
TODO the description above suggests that it should be called isDynamic as it returns false if the constraint outboxes stay the same.
(not taking placed object into account; i.e. absInfeasible will always return the same points)
public abstract boolean isSingleUse()
TODO, what is the example of such constraint?
Use this function to provide the information to Geost.
public abstract DBox isFeasible(Geost.SweepDirection min, LexicographicalOrder order, GeostObject o, int currentShape, int[] c)
The boundaries of the forbidden area must have the following properties: the lower extremum has to be infeasible, but the upper extremum has to be feasible (with respect to this constraint only).
The dimension of the DBox returned is k+1, where k is the object dimension. The last dimension is time.
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()
This information is used as a heuristic in the sweeping algorithm to decide which constraint to use, so that the constraints that cover the largest space are used first.
public abstract Collection<Var> definingVariables()
Copyright © 2018. All rights reserved.