choco.cp.solver.constraints.reified.leaves.bool
Class EqNode

java.lang.Object
  extended by choco.kernel.solver.constraints.reified.INode
      extended by choco.cp.solver.constraints.reified.leaves.bool.AbstractBoolNode
          extended by choco.cp.solver.constraints.reified.leaves.bool.EqNode
All Implemented Interfaces:
IPretty, BoolNode

public final class EqNode
extends AbstractBoolNode


Field Summary
 
Fields inherited from class choco.kernel.solver.constraints.reified.INode
LOGGER, subtrees
 
Constructor Summary
EqNode(INode[] subt)
           
 
Method Summary
 boolean checkTuple(int[] tuple)
           
 SConstraint extractConstraint(Solver s)
          Extracts the sub constraint without reifying it !
 boolean isALinearTerm()
           
 String pretty()
          pretty printing of the object.
 
Methods inherited from class choco.cp.solver.constraints.reified.leaves.bool.AbstractBoolNode
extractResult
 
Methods inherited from class choco.kernel.solver.constraints.reified.INode
computeLinearExpr, countNbVar, getModelScope, getNbSubTrees, getScope, getSubtree, getType, hasOnlyVariablesLeaves, isAConstant, isAVariable, isBoolean, isCsteEqualTo, isDecompositionPossible, isReified, setIndexes
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Constructor Detail

EqNode

public EqNode(INode[] subt)
Method Detail

checkTuple

public boolean checkTuple(int[] tuple)

extractConstraint

public SConstraint extractConstraint(Solver s)
Extracts the sub constraint without reifying it !

Specified by:
extractConstraint in interface BoolNode
Specified by:
extractConstraint in class AbstractBoolNode
Parameters:
s -
Returns:

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.

Returns:
a readable string representation of the object

isALinearTerm

public boolean isALinearTerm()
Overrides:
isALinearTerm in class INode


Copyright © 2012. All Rights Reserved.