choco.cp.solver.constraints.reified.leaves.arithm
Class DivNode

java.lang.Object
  extended by choco.kernel.solver.constraints.reified.INode
      extended by choco.cp.solver.constraints.reified.leaves.arithm.DivNode
All Implemented Interfaces:
IPretty, ArithmNode

public final class DivNode
extends INode
implements ArithmNode

Integer division


Field Summary
 
Fields inherited from class choco.kernel.solver.constraints.reified.INode
LOGGER, subtrees
 
Constructor Summary
DivNode(INode[] subt)
           
 
Method Summary
 int eval(int[] tuple)
           
 IntDomainVar extractResult(Solver s)
           
 boolean isDecompositionPossible()
          check if this node can be decomposed
 String pretty()
          pretty printing of the object.
 
Methods inherited from class choco.kernel.solver.constraints.reified.INode
computeLinearExpr, countNbVar, getModelScope, getNbSubTrees, getScope, getSubtree, getType, hasOnlyVariablesLeaves, isAConstant, isALinearTerm, isAVariable, isBoolean, isCsteEqualTo, isReified, setIndexes
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Constructor Detail

DivNode

public DivNode(INode[] subt)
Method Detail

eval

public int eval(int[] tuple)
Specified by:
eval in interface ArithmNode

isDecompositionPossible

public boolean isDecompositionPossible()
Description copied from class: INode
check if this node can be decomposed

Overrides:
isDecompositionPossible in class INode
Returns:

extractResult

public IntDomainVar extractResult(Solver s)
Overrides:
extractResult in class INode
Returns:
a variable that represents the true/false value of the tree belows this node if it is a reified node or its value if it is an arithmetic node

pretty

public String pretty()
Description copied from interface: IPretty
pretty printing of the object. This String is not constant and may depend on the context.

Specified by:
pretty in interface IPretty
Returns:
a readable string representation of the object


Copyright © 2012. All Rights Reserved.