Solution_
- the solution type, the class with the PlanningSolution
annotationpublic class TailChainSwapMove<Solution_> extends AbstractMove<Solution_>
Modifier and Type | Field and Description |
---|---|
protected AnchorVariableSupply |
anchorVariableSupply |
protected SingletonInverseVariableSupply |
inverseVariableSupply |
protected Object |
leftEntity |
protected Object |
rightValue |
protected GenuineVariableDescriptor<Solution_> |
variableDescriptor |
Constructor and Description |
---|
TailChainSwapMove(GenuineVariableDescriptor<Solution_> variableDescriptor,
SingletonInverseVariableSupply inverseVariableSupply,
AnchorVariableSupply anchorVariableSupply,
Object leftEntity,
Object rightValue) |
Modifier and Type | Method and Description |
---|---|
TailChainSwapMove<Solution_> |
createUndoMove(ScoreDirector<Solution_> scoreDirector)
Called before the move is done, so the move can be evaluated and then be undone
without resulting into a permanent change in the solution.
|
protected Object |
determineRightAnchor() |
protected void |
doMoveOnGenuineVariables(ScoreDirector<Solution_> scoreDirector)
Like
AbstractMove.doMove(ScoreDirector) but without the ScoreDirector.triggerVariableListeners() call
(because AbstractMove.doMove(ScoreDirector) already does that). |
boolean |
equals(Object o) |
protected Object |
findLastEntityInChainOrLeftEntity() |
Object |
getLeftEntity() |
Collection<? extends Object> |
getPlanningEntities()
Returns all planning entities that are being changed by this move.
|
Collection<? extends Object> |
getPlanningValues()
Returns all planning values that entities are being assigned to by this move.
|
Object |
getRightValue() |
String |
getSimpleMoveTypeDescription()
Describes the move type for statistical purposes.
|
String |
getVariableName() |
int |
hashCode() |
boolean |
isMoveDoable(ScoreDirector<Solution_> scoreDirector)
Called before a move is evaluated to decide whether the move can be done and evaluated.
|
TailChainSwapMove<Solution_> |
rebase(ScoreDirector<Solution_> destinationScoreDirector)
Rebases a move from an origin
ScoreDirector to another destination ScoreDirector
which is usually on another Thread or JVM. |
protected void |
reverseChain(ScoreDirector scoreDirector,
Object fromValue,
Object fromEntity,
Object toEntity) |
String |
toString() |
doMove, rebaseArray, rebaseList
protected final GenuineVariableDescriptor<Solution_> variableDescriptor
protected final SingletonInverseVariableSupply inverseVariableSupply
protected final AnchorVariableSupply anchorVariableSupply
protected final Object leftEntity
protected final Object rightValue
public TailChainSwapMove(GenuineVariableDescriptor<Solution_> variableDescriptor, SingletonInverseVariableSupply inverseVariableSupply, AnchorVariableSupply anchorVariableSupply, Object leftEntity, Object rightValue)
public String getVariableName()
public Object getLeftEntity()
public Object getRightValue()
protected Object determineRightAnchor()
public boolean isMoveDoable(ScoreDirector<Solution_> scoreDirector)
Move
PlanningSolution
.It is recommended to keep this method implementation simple: do not use it in an attempt to satisfy normal hard and soft constraints.
Although you could also filter out non-doable moves in for example the MoveSelector
or MoveListFactory
, this is not needed as the Solver
will do it for you.
scoreDirector
- the ScoreDirector
not yet modified by the move.public TailChainSwapMove<Solution_> createUndoMove(ScoreDirector<Solution_> scoreDirector)
AbstractMove
createUndoMove
in class AbstractMove<Solution_>
scoreDirector
- the ScoreDirector
not yet modified by the move.protected void doMoveOnGenuineVariables(ScoreDirector<Solution_> scoreDirector)
AbstractMove
AbstractMove.doMove(ScoreDirector)
but without the ScoreDirector.triggerVariableListeners()
call
(because AbstractMove.doMove(ScoreDirector)
already does that).doMoveOnGenuineVariables
in class AbstractMove<Solution_>
scoreDirector
- never nullprotected Object findLastEntityInChainOrLeftEntity()
protected void reverseChain(ScoreDirector scoreDirector, Object fromValue, Object fromEntity, Object toEntity)
public TailChainSwapMove<Solution_> rebase(ScoreDirector<Solution_> destinationScoreDirector)
Move
ScoreDirector
to another destination ScoreDirector
which is usually on another Thread
or JVM.
The new move returned by this method mutates the entities and problem facts
of the destination PlanningSolution
of the destination ScoreDirector
,
That destination PlanningSolution
should be a deep planning clone (or an even deeper clone)
of the origin PlanningSolution
that this move was generated from.
That new move does the exact same change as this move,
resulting in the same PlanningSolution
state,
presuming that destination PlanningSolution
was in the same state
as the original PlanningSolution
to begin with.
Generally speaking, an implementation of this method iterates through every entity and fact instance in this move,
translates each one to the destination ScoreDirector
with ScoreDirector.lookUpWorkingObject(Object)
and creates a new move instance of the same move type, using those translated instances.
destinationScoreDirector
- never null, the ScoreDirector.getWorkingSolution()
that the new move should change the planning entity instances of.public String getSimpleMoveTypeDescription()
Move
The format is not formalized. Never parse the String
returned by this method.
getSimpleMoveTypeDescription
in interface Move<Solution_>
getSimpleMoveTypeDescription
in class AbstractMove<Solution_>
public Collection<? extends Object> getPlanningEntities()
Move
AcceptorType.ENTITY_TABU
.
Duplicate entries in the returned Collection
are best avoided.
The returned Collection
is recommended to be in a stable order.
For example: use List
or LinkedHashSet
, but not HashSet
.
public Collection<? extends Object> getPlanningValues()
Move
AcceptorType.VALUE_TABU
.
Duplicate entries in the returned Collection
are best avoided.
The returned Collection
is recommended to be in a stable order.
For example: use List
or LinkedHashSet
, but not HashSet
.
Copyright © 2006–2018 JBoss by Red Hat. All rights reserved.