Package | Description |
---|---|
de.interactive_instruments.ShapeChange.Target.FOL2Schematron |
Modifier and Type | Class and Description |
---|---|
static class |
FolSchematronNode.Arithmetic
************************************************************************
This class stands for OCL arithmetic.
|
static class |
FolSchematronNode.AttributeNode
************************************************************************
This class represents a chain of attribute selectors based on some value
source such as a variable.
|
static class |
FolSchematronNode.ComparisonNode
************************************************************************
This class stands for comparisons.
|
static class |
FolSchematronNode.Empty
************************************************************************
This one stands for the OCL isEmpty() and notEmpty()
predicate operations.
|
static class |
FolSchematronNode.Error
************************************************************************
This is generated for unimplemented material.
|
static class |
FolSchematronNode.IsNullNode
************************************************************************
This class represents the isNull filter.
|
static class |
FolSchematronNode.IsTypeOfNode
************************************************************************
This class represents a type check.
|
static class |
FolSchematronNode.LiteralNode
************************************************************************
This wraps any form of Literal value.
|
static class |
FolSchematronNode.Logic
************************************************************************
This class stands for logical operations AND, OR, XOR and EQV.
|
static class |
FolSchematronNode.Matches
************************************************************************
This class stands for matches operation, which this implemention added to
OCL's core functions.
|
static class |
FolSchematronNode.MessageComment
This represents an error message comment.
|
static class |
FolSchematronNode.NotNode
************************************************************************
|
static class |
FolSchematronNode.QuantificationNode
************************************************************************
This class represents a universal or existential quantification.
|
static class |
FolSchematronNode.VariableNode
************************************************************************
This class represents a variable.
|
Modifier and Type | Field and Description |
---|---|
protected FolSchematronNode |
FolSchematronNode.IsNullNode.generatorBody |
protected FolSchematronNode |
FolSchematronNode.parent
The parent reference
|
Modifier and Type | Field and Description |
---|---|
protected ArrayList<FolSchematronNode> |
FolSchematronNode.children
The children of the SchematronNode
|
Modifier and Type | Method and Description |
---|---|
FolSchematronNode |
FolSchematronNode.QuantificationNode.condition() |
FolSchematronNode |
FolSchematronNode.nodeVariableIsBoundTo(Variable vardecl)
This method determines whether the node binds the given variable
declaration (this can only happen for iterators) and if it does, which is
the expression the variable is bound to.
|
protected FolSchematronNode |
FOL2Schematron.translateConstraint(FolExpression folExpr,
FolSchematronNode enclosing)
This function recursively descends into an FolConstraint following the
FOL expression structure.
|
FolSchematronNode |
FolSchematronNode.VariableNode.value() |
Modifier and Type | Method and Description |
---|---|
void |
FolSchematronNode.addChild(FolSchematronNode child)
Method to add children to a node and at the same time establish the node
as parent of the child to be added.
|
void |
FolSchematronNode.QuantificationNode.setCondition(FolSchematronNode fsn) |
void |
FolSchematronNode.VariableNode.setValue(FolSchematronNode varValue) |
protected FolSchematronNode |
FOL2Schematron.translateConstraint(FolExpression folExpr,
FolSchematronNode enclosing)
This function recursively descends into an FolConstraint following the
FOL expression structure.
|
Copyright © 2017. All rights reserved.