|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.ObjectJaCoP.search.SimpleSelect<T>
JaCoP.search.SplitSelect<T>
T - type of variable being used in the search.public class SplitSelect<T extends IntVar>
It is simple and customizable selector of decisions (constraints) which will be enforced by search. However, it does not use X=c as a search decision but rather X <= c (potentially splitting the domain), unless c is equal to the maximal value in the domain of X then the constraint X < c is used.
| Field Summary | |
|---|---|
boolean |
leftFirst
It specifies if the left branch (values smaller or equal to the value selected) are first considered. |
| Fields inherited from class JaCoP.search.SimpleSelect |
|---|
inputOrderTieBreaking, position |
| Constructor Summary | |
|---|---|
SplitSelect(T[] variables,
ComparatorVariable<T> varSelect,
ComparatorVariable<T> tieBreakerVarSelect,
Indomain<T> indomain)
It constructs a simple selection mechanism for choice points. |
|
SplitSelect(T[] variables,
ComparatorVariable<T> varSelect,
Indomain<T> indomain)
The constructor to create a simple choice select mechanism. |
|
| Method Summary | |
|---|---|
PrimitiveConstraint |
getChoiceConstraint(int index)
It always returns null as choice point is obtained by getChoiceVariable and getChoiceValue. |
T |
getChoiceVariable(int index)
It returns the variable which is the base on the next choice point. |
| Methods inherited from class JaCoP.search.SimpleSelect |
|---|
getChoiceValue, getIndex, getVariablesMapping, placeSearchVariable, toString |
| Methods inherited from class java.lang.Object |
|---|
equals, getClass, hashCode, notify, notifyAll, wait, wait, wait |
| Field Detail |
|---|
public boolean leftFirst
| Constructor Detail |
|---|
public SplitSelect(T[] variables,
ComparatorVariable<T> varSelect,
Indomain<T> indomain)
variables - variables upon which the choice points are created.varSelect - the variable comparator to choose the variable.indomain - the value heuristic to choose a value for a given variable.
public SplitSelect(T[] variables,
ComparatorVariable<T> varSelect,
ComparatorVariable<T> tieBreakerVarSelect,
Indomain<T> indomain)
variables - variables used as basis of the choice point.varSelect - the main variable comparator.tieBreakerVarSelect - secondary variable comparator employed if the first one gives the same metric.indomain - the heuristic to choose value assigned to a chosen variable.| Method Detail |
|---|
public T getChoiceVariable(int index)
SimpleSelect
getChoiceVariable in interface SelectChoicePoint<T extends IntVar>getChoiceVariable in class SimpleSelect<T extends IntVar>index - the position of the last variable in selection choice point heuristic.
public PrimitiveConstraint getChoiceConstraint(int index)
SimpleSelect
getChoiceConstraint in interface SelectChoicePoint<T extends IntVar>getChoiceConstraint in class SimpleSelect<T extends IntVar>index - the position of the last variable returned by selection choice point heuristic.
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||