public class FlatOr extends FlatPred
Modifier and Type | Field and Description |
---|---|
protected Bounds |
leftBounds_
Bounds information for the left_ predicate.
|
protected Set<net.sourceforge.czt.z.ast.ZName> |
outputs_
The variables that are created by *both* sides.
|
protected Bounds |
rightBounds_
Bounds information for the right_ predicate.
|
Constructor and Description |
---|
FlatOr(FlatPredList left,
FlatPredList right)
Creates a new instance of FlatOr.
|
Modifier and Type | Method and Description |
---|---|
<R> R |
accept(net.sourceforge.czt.util.Visitor<R> visitor)
Calls visitor.visitPred (preferably) or visitor.visitTerm.
|
Mode |
chooseMode(Envir env0)
Choose the mode that this predicate could use in this environment.
|
boolean |
inferBounds(Bounds bnds)
Bounds information can only flow into the disjuncts at the moment.
|
boolean |
nextEvaluation()
Generates the next solution that satisfies this predicate.
|
void |
setMode(Mode mode)
Set the mode that will be used to evaluate this list.
|
void |
startEvaluation() |
String |
toString()
A default implementation of toString.
|
freeVars, getArgs, getEnvir, getLastArg, getMode, indent, modeAllDefined, modeCollection, modeFunction, modeOneOutput, printArg, printBinOp, printLastArg, printName, printQuant
protected Bounds leftBounds_
protected Bounds rightBounds_
protected Set<net.sourceforge.czt.z.ast.ZName> outputs_
public FlatOr(FlatPredList left, FlatPredList right)
public boolean inferBounds(Bounds bnds)
inferBounds
in class FlatPred
bnds
- The database of lower and upper bounds for integer variables.The default implementation infers nothing and returns false.
public Mode chooseMode(Envir env0)
FlatPred
chooseMode
in class FlatPred
public void setMode(Mode mode)
public void startEvaluation()
startEvaluation
in class FlatPred
public boolean nextEvaluation()
FlatPred
nextEvaluation
in class FlatPred
public String toString()
FlatPred
public <R> R accept(net.sourceforge.czt.util.Visitor<R> visitor)
FlatPred
Copyright © 2003–2016 Community Z Tools Project. All rights reserved.