|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectagg.xt_basis.GraGra
public class GraGra
GraGra provides the functionality of a simple graph grammar, consisting of exactly one graph (the "host graph"), an arbitrary number of graph rules, and an arbitrary number of match morphisms from the rules into the start graph.
The implementation serves as a factory for Types, Rules and Matches.
Field Summary | |
---|---|
protected java.lang.String |
comment
|
protected java.lang.String |
dirName
Directory name for saving |
protected java.lang.String |
fileName
File name for saving |
protected java.util.List<java.lang.String> |
gratraOptions
The list of my transformation options (only option names) |
protected java.util.List<AtomConstraint> |
itsAtomics
The set of my atomic graph constraints. |
protected java.util.List<Formula> |
itsConstraints
The set of my constraints ( formulae ). |
protected Graph |
itsGraph
My host graph. |
protected java.util.List<Graph> |
itsGraphs
|
protected java.util.List<Match> |
itsMatches
The set of my matches. |
protected java.lang.String |
itsName
|
protected java.util.List<Pair<java.lang.String,java.util.List<java.lang.String>>> |
itsPackages
The set of the used packages of the Java classes. |
protected java.util.List<Rule> |
itsRules
The set of my rules. |
protected Graph |
itsStartGraph
My start graph. |
protected java.util.List<Pair<java.util.Vector<Pair<java.lang.String,java.lang.String>>,java.lang.String>> |
ruleSequences
|
protected MorphCompletionStrategy |
strategy
Match completion strategy |
protected TypeSet |
typeSet
My type set used in graphs and rules. |
Constructor Summary | |
---|---|
protected |
GraGra()
Construct myself as an independent new graph grammar. |
|
GraGra(boolean withGraph)
Construct myself as an independent new graph grammar. |
|
GraGra(Graph g)
Constructs a graph grammar with the given graph as host graph. |
|
GraGra(TypeSet newTypeSet)
Construct myself as an independent new graph grammar with a type set and/or type graph specified by the TypeSet newTypeSet |
|
GraGra(TypeSet newTypeSet,
boolean withGraph)
Construct myself as an independent new graph grammar. |
Method Summary | |
---|---|
boolean |
addAtomic(AtomConstraint ac)
|
boolean |
addConstraint(Formula f)
|
boolean |
addGraph(Graph g)
|
void |
addGraTraOption(java.lang.String opt)
|
boolean |
addImportGraph(Graph g)
Add a copy of the Graph g to the list of my (host) graphs. |
boolean |
addImportGraph(Graph g,
boolean adapt)
Add a copy of the Graph g to the list of my (host) graphs. |
boolean |
addImportRule(Rule r)
Add a copy of the Rule r to the list of my rules. |
boolean |
addImportRule(Rule r,
boolean adapt)
Add a copy of the Rule r to the list of my rules. |
void |
addPackage(Pair<java.lang.String,java.util.List<java.lang.String>> p)
|
boolean |
addRule(Rule r)
|
boolean |
addRuleScheme(agg.xt_agt.RuleScheme rs)
Development stage only. |
boolean |
adoptTypes(java.util.Enumeration<Type> types)
|
boolean |
checkAtomics(boolean checkAtomicValidityOnly)
|
java.lang.String |
checkEdgeTypeMultiplicity(Arc typeArc)
Checks all graphs of this GraGra due to edge type multiplicity of the specified type Arc of the current type graph. |
boolean |
checkGraphConsistency(Graph g)
Returns TRUE if the graph g satisfies all graph constraints of this graph grammar. |
boolean |
checkGraphConsistency(Graph g,
java.util.List<Formula> constraints)
Returns TRUE if the graph g satisfies the specified container with graph constraints of this graph grammar. |
boolean |
checkGraphConstraints(boolean validity)
This method checks if all graph constraints (formulas) are valid and then when parameter validity is TRUE if the host graph is consistent. |
Pair<java.lang.Object,java.lang.String> |
checkInheritedAttributesValid()
|
java.lang.String |
checkNodeTypeMultiplicity(Node typeNode)
Checks all graphs of this GraGra due to node type multiplicity of the specified type Node of the current type graph. |
void |
clearRuleConstraints()
|
void |
clearRuleConstraints(AtomConstraint ac)
|
void |
clearRuleConstraints(Formula f)
|
Graph |
cloneGraph()
Create a copy of my host graph. |
Rule |
cloneRule(Rule r)
Create a copy of the rule r. |
boolean |
compareConstraintsTo(GraGra gragra)
|
boolean |
compareRulesTo(GraGra gragra,
boolean checkLayer)
|
boolean |
compareTo(GraGra gragra)
|
boolean |
compareTo(GraGra gragra,
boolean transOption)
|
java.lang.String |
convertConstraints()
Converts all constraints (formulas) to post application conditions for all rules. |
AtomConstraint |
createAtomic(java.lang.String name)
|
Formula |
createConstraint(java.lang.String name)
|
Match |
createMatch(Rule rule)
Create an empty match morphism between the left side of the given rule and my start graph. |
Rule |
createRule()
Create an empty rule. |
agg.xt_agt.RuleScheme |
createRuleScheme()
Development stage only. |
Type |
createType()
Create a new type for typing of GraphObjects. |
Type |
createType(boolean withAttributes)
Create a new type for typing of GraphObjects. |
Graph |
createTypeGraph()
Creates an empty type graph. |
void |
destroyAllAtomics()
|
void |
destroyAllConstraints()
|
void |
destroyAllGraphs()
Destroy all my host graphs. |
void |
destroyAllMatches()
|
void |
destroyAllRules()
|
void |
destroyAtomic(AtomConstraint a)
|
void |
destroyConstraint(Formula f)
|
void |
destroyGraph(Graph g)
Remove the specified graph from my host graphs and destroy it. |
java.util.Vector<java.lang.String> |
destroyGraphObjectsOfType(Type t,
boolean fromTypeGraph)
|
java.util.Vector<java.lang.String> |
destroyGraphObjectsOfTypeFromGraphConstraints(Type t)
|
boolean |
destroyGraphObjectsOfTypeFromHostGraph(Type t)
|
java.util.Vector<java.lang.String> |
destroyGraphObjectsOfTypeFromRules(Type t)
|
java.util.Vector<java.lang.String> |
destroyGraphObjectsOfTypes(java.util.Vector<Type> ts,
boolean fromTypeGraph)
|
java.util.Vector<java.lang.String> |
destroyGraphObjectsOfTypesFromGraphConstraints(java.util.Vector<Type> ts)
|
java.util.Vector<java.lang.String> |
destroyGraphObjectsOfTypesFromHostGraph(java.util.Vector<Type> ts)
|
java.util.Vector<java.lang.String> |
destroyGraphObjectsOfTypesFromRules(java.util.Vector<Type> ts)
|
void |
destroyMatch(Match match)
Dispose the specified match. |
void |
destroyMatches(Graph g)
|
void |
destroyRule(Rule rule)
Dispose the specified rule. |
void |
destroyStartGraph()
|
void |
destroyType(Type type)
Dispose the specified type. |
void |
destroyTypeGraph()
Dispose the type graph. |
void |
dismissRuleApplicability()
|
void |
dispose()
Prepare myself for garbage collection. |
Type |
doAttrTypesExist()
|
void |
enableRuleLayer(int l,
boolean enabled)
|
void |
finalize()
|
java.util.Vector<Rule> |
getApplicableRules(Graph g,
MorphCompletionStrategy aStrategy)
Returns applicable rules due to the specified host graph and morphism completion strategy. |
java.util.Vector<Rule> |
getApplicableRules(MorphCompletionStrategy aStrategy)
Returns applicable rules due to the specified morphism completion strategy and current host graph. |
java.util.Enumeration<AtomConstraint> |
getAtomics()
Iterate through all of my atomic graph constraints. |
java.lang.String |
getConsistencyErrorMsg()
|
java.util.Enumeration<Formula> |
getConstraints()
Iterate through all of my constraints (formulae). |
java.util.List<Formula> |
getConstraintsForLayer(int l)
Returns constraints (formulae) for the specified layer. |
java.util.Vector<Formula> |
getConstraintsForPriority(int p)
Returns constraints (formulae) for the specified rule priority. |
java.util.Vector<Formula> |
getConstraintsVec()
Deprecated. replaced by getListOfConstraints() |
int |
getCountOfGraphs()
|
java.lang.String |
getDirName()
Gets the directory name for saving the gragra |
java.util.Vector<java.lang.String> |
getEnabledLayers()
|
java.util.Vector<java.lang.String> |
getEnabledPriorities()
|
java.util.List<Rule> |
getEnabledRules()
|
java.lang.String |
getFileName()
Gets the file name for saving the gragra |
java.util.List<Formula> |
getGlobalConstraints()
Returns constraints (formulae) that should be satisfied for all layers of a layered grammar. |
Graph |
getGraph()
Returns my current host graph. |
Graph |
getGraph(int indx)
Returns a host graph on the specified index or null. |
Graph |
getGraph(java.lang.String name)
Returns a host graph with the specified name. |
java.util.Enumeration<Graph> |
getGraphs()
Deprecated. replaced by getListOfGraphs() |
java.util.Vector<Graph> |
getGraphsVec()
Deprecated. replaced by getListOfGraphs() |
java.util.Vector<java.lang.String> |
getGraTraOptions()
|
int |
getIndexOfGraph()
Returns the index of my current host graph. |
java.util.Vector<java.lang.String> |
getLayers()
|
int |
getLevelOfTypeGraphCheck()
returns the level of type graph usage in the type set. |
java.util.List<Evaluable> |
getListOfAtomicObjects()
|
java.util.List<AtomConstraint> |
getListOfAtomics()
Returns a list of my atomic graph constraints. |
java.util.List<Formula> |
getListOfConstraints()
Returns a list of my constraints (formulae). |
java.util.List<Rule> |
getListOfEnabledRules()
|
java.util.List<Graph> |
getListOfGraphs()
Returns a list of my host graphs. |
java.util.List<Rule> |
getListOfRules()
Iterate through all of my rules. |
Match |
getMatch(Rule rule,
Graph g)
Iterate through all of the matches existing between the given rule and all graphs of this grammar. |
java.util.Enumeration<Match> |
getMatches(Rule rule)
Iterate through all of the matches existing between the given rule and the start graph. |
MorphCompletionStrategy |
getMorphismCompletionStrategy()
|
int |
getMultiplicityErrorKind()
|
java.lang.String |
getName()
Return my name. |
java.util.Vector<Rule> |
getNonInjectiveRules()
|
java.util.Vector<Pair<java.lang.String,java.util.List<java.lang.String>>> |
getPackages()
|
java.util.Vector<java.lang.String> |
getPriorities()
|
Rule |
getRule(int ruleIndx)
|
Rule |
getRule(java.lang.String name)
|
java.util.Enumeration<Rule> |
getRules()
Iterate through all of my rules. |
java.util.Vector<Pair<java.util.Vector<Pair<java.lang.String,java.lang.String>>,java.lang.String>> |
getRuleSequences()
Returns the rule sequences. |
java.util.Vector<Rule> |
getRulesForLayer(int l)
|
java.util.Vector<Rule> |
getRulesVec()
Deprecated. replaced by getListOfRules() |
Graph |
getStartGraph()
Return my start graph. |
java.lang.String |
getTextualComment()
Return textual comments of this grammar. |
Graph |
getTypeGraph()
Returns the type graph or null ,
if no type graph was created before. |
java.util.Enumeration<Type> |
getTypes()
Iterate through all of the types that may be assigned to GraphObjects. |
TypeSet |
getTypeSet()
returns the type manger used in this gragra and in all its graphs. |
boolean |
hasRuleChangedEvailability()
|
boolean |
hasRuleChangedLayer()
|
boolean |
hasRuleChangedPriority()
|
boolean |
importGraph(Graph g)
Reset my host graph by the Graph g. |
boolean |
importGraph(Graph g,
boolean adapt)
Reset my host graph by the Graph g. |
boolean |
importTypeGraph(Graph g,
boolean rewrite)
Adds the specified Graph g to the current type graph if it exists or to a new created type graph otherwise. |
boolean |
isElement(Graph g)
Return true, if the specified Graph g is once of my host graphs, otherwise - false. |
boolean |
isElement(Rule r)
Return true, if the Rule r is element of my rules otherwise - false. |
Pair<java.lang.Object,java.lang.String> |
isGraphConstraintReadyForTransform()
Checks atomic graph constraints. |
boolean |
isGraphReadyForTransform()
|
boolean |
isLayered()
|
boolean |
isPriority()
|
Pair<java.lang.Object,java.lang.String> |
isReadyToTransform()
Checks the types, rules and graph constraints of this grammar. |
Pair<java.lang.Object,java.lang.String> |
isReadyToTransform(boolean prepareRuleInfo)
Checks the types, rules and graph constraints of this grammar. |
boolean |
isRuleLayerEnabled(int l)
|
boolean |
isUsingType(GraphObject t)
Returns true if this gragra uses the specified type. |
void |
load(java.lang.String filename)
|
void |
oneRuleHasChangedEvailability()
|
void |
oneRuleHasChangedLayer()
|
void |
oneRuleHasChangedPriority()
|
void |
prepareRuleInfo()
Prepares info about rule: does rule create, delete, change something. |
void |
read(java.lang.String filename)
|
void |
refreshConstraintsForLayer()
|
void |
refreshConstraintsForPriority()
|
boolean |
removeAtomic(AtomConstraint ac)
|
boolean |
removeGraph(Graph g)
Remove the specified graph from my graphs. |
void |
removeGraTraOption(java.lang.String opt)
|
void |
removePackage(Pair<java.lang.String,java.util.Vector<java.lang.String>> p)
|
boolean |
removeRule(Rule r)
|
void |
removeTypeGraph()
|
boolean |
resetGraph()
Reset my host graph by my start graph. |
boolean |
resetGraph(Graph g)
Reset my host graph by the Graph g. |
boolean |
resetGraph(int atIndex,
Graph g)
|
boolean |
resetGraphWithoutGuarantee(Graph g)
Reset my host graph by the Graph g without type guarantee. |
void |
save(java.lang.String filename)
|
void |
setDirName(java.lang.String str)
Sets the directory name for saving the gragra |
void |
setFileName(java.lang.String str)
Sets the file name for saving the gragra |
void |
setGraTraOptions(MorphCompletionStrategy strat)
Set morphism completion strategy by the specified strategy. |
void |
setGraTraOptions(java.util.Vector<java.lang.String> opts)
|
java.util.Collection<TypeError> |
setLevelOfTypeGraphCheck(int level)
changes the behavior of the type graph check and defines, how the type graph is used. |
void |
setMorphismCompletionStrategy(MorphCompletionStrategy strat)
Set morphism completion strategy by the specified strategy. |
void |
setMorphismCompletionStrategyOfGraphConstraints()
|
void |
setName(java.lang.String n)
Set my name. |
void |
setPackages(java.util.Vector<Pair<java.lang.String,java.util.List<java.lang.String>>> n)
|
void |
setRuleLayer(RuleLayer rl)
Sets my rule layer |
void |
setRuleSequences(java.util.Vector<Pair<java.util.Vector<Pair<java.lang.String,java.lang.String>>,java.lang.String>> sequences)
Set the rule sequences. |
void |
setStartGraph(Graph g)
Sets my start graph to Graph g. |
void |
setTextualComment(java.lang.String text)
Set textual comments for this grammar. |
void |
setUsedClassPackages()
|
void |
sortConstraintsByLayer()
Sort constraints (formulae) by layer. |
void |
sortConstraintsByPriority()
Sort constraints (formulae) by priority. |
void |
sortRulesByLayer()
Sort rules by layer. |
void |
sortRulesByPriority()
Sort rules by rule priority. |
void |
storeUsedClassPackages()
|
void |
unsetLayerTriggerRule()
|
void |
XreadObject(XMLHelper h)
reads the properties and values of all elements of this gragra from an element called <GraphTransformationSystem> in the
XML file opened by the given XMLHelper. |
void |
XwriteObject(XMLHelper h)
Save the properties and values of all elements of this gragra in an own element in the XML file saved by the given XMLHelper. |
Methods inherited from class java.lang.Object |
---|
clone, equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Field Detail |
---|
protected final transient java.util.List<Graph> itsGraphs
protected final transient java.util.List<Rule> itsRules
Rule
.
protected final transient java.util.List<AtomConstraint> itsAtomics
protected final transient java.util.List<Formula> itsConstraints
protected final transient java.util.List<java.lang.String> gratraOptions
protected final transient java.util.List<Match> itsMatches
Match
.
protected transient java.util.List<Pair<java.util.Vector<Pair<java.lang.String,java.lang.String>>,java.lang.String>> ruleSequences
protected final transient java.util.List<Pair<java.lang.String,java.util.List<java.lang.String>>> itsPackages
protected transient TypeSet typeSet
protected transient Graph itsGraph
protected transient Graph itsStartGraph
protected transient java.lang.String itsName
protected transient java.lang.String comment
protected transient MorphCompletionStrategy strategy
protected transient java.lang.String dirName
protected transient java.lang.String fileName
Constructor Detail |
---|
protected GraGra()
public GraGra(boolean withGraph)
public GraGra(TypeSet newTypeSet)
public GraGra(TypeSet newTypeSet, boolean withGraph)
public GraGra(Graph g)
Method Detail |
---|
public java.util.Vector<Pair<java.lang.String,java.util.List<java.lang.String>>> getPackages()
public void setPackages(java.util.Vector<Pair<java.lang.String,java.util.List<java.lang.String>>> n)
public void addPackage(Pair<java.lang.String,java.util.List<java.lang.String>> p)
public void removePackage(Pair<java.lang.String,java.util.Vector<java.lang.String>> p)
public boolean addGraph(Graph g)
public void destroyGraph(Graph g)
public void destroyAllGraphs()
public boolean removeGraph(Graph g)
public boolean isElement(Rule r)
public boolean isElement(Graph g)
public boolean isPriority()
public boolean isLayered()
public java.util.Vector<java.lang.String> getLayers()
public java.util.Vector<java.lang.String> getEnabledLayers()
public java.util.Vector<java.lang.String> getPriorities()
public java.util.Vector<java.lang.String> getEnabledPriorities()
public boolean resetGraph(Graph g)
public boolean resetGraph(int atIndex, Graph g)
public boolean resetGraph()
public boolean resetGraphWithoutGuarantee(Graph g)
public boolean importTypeGraph(Graph g, boolean rewrite)
public boolean importGraph(Graph g)
public boolean importGraph(Graph g, boolean adapt)
adapt
is true, the types of the Graph g are tried to be adapted to my types.
The types with the same name are equal. Otherwise, the types of the Graph
g should be found among my types.
public boolean addImportGraph(Graph g)
public boolean addImportGraph(Graph g, boolean adapt)
adapt
is true, the types of the Graph g are
tried to be adapted to my types. The types with the same name are equal.
Otherwise, the types of the Graph g should be found among my types.
public boolean addImportRule(Rule r)
public boolean addImportRule(Rule r, boolean adapt)
adapt
is true, the types of the Rule r are tried to be
adapted to my types. The types with the same name are similar.
Otherwise, the types of the Rule r should be found among my types.
public boolean adoptTypes(java.util.Enumeration<Type> types)
public void dispose()
Disposable
dispose
in interface Disposable
public void finalize()
finalize
in class java.lang.Object
public boolean addRule(Rule r)
public boolean removeRule(Rule r)
public void removeTypeGraph()
public final void setName(java.lang.String n)
public final java.lang.String getName()
public void setTextualComment(java.lang.String text)
public java.lang.String getTextualComment()
public void setDirName(java.lang.String str)
public java.lang.String getDirName()
public void setFileName(java.lang.String str)
public java.lang.String getFileName()
public final Graph getGraph()
public int getIndexOfGraph()
public final Graph getGraph(java.lang.String name)
public final Graph getGraph(int indx)
public final java.util.Enumeration<Graph> getGraphs()
getListOfGraphs()
public final int getCountOfGraphs()
public final java.util.List<Graph> getListOfGraphs()
public final java.util.Vector<Graph> getGraphsVec()
getListOfGraphs()
public final Graph getStartGraph()
public void setStartGraph(Graph g)
public void destroyStartGraph()
public final java.util.List<Rule> getListOfRules()
Rule
public java.util.List<Rule> getListOfEnabledRules()
public void oneRuleHasChangedLayer()
public boolean hasRuleChangedLayer()
public void oneRuleHasChangedPriority()
public boolean hasRuleChangedPriority()
public void oneRuleHasChangedEvailability()
public boolean hasRuleChangedEvailability()
public final java.util.Enumeration<Rule> getRules()
Rule
public final java.util.Vector<Rule> getRulesVec()
getListOfRules()
public java.util.Vector<Rule> getRulesForLayer(int l)
public void enableRuleLayer(int l, boolean enabled)
public boolean isRuleLayerEnabled(int l)
public final Rule getRule(int ruleIndx)
public final Rule getRule(java.lang.String name)
public MorphCompletionStrategy getMorphismCompletionStrategy()
public final java.util.List<Evaluable> getListOfAtomicObjects()
public final java.util.Enumeration<AtomConstraint> getAtomics()
AtomConstraint
public final java.util.List<AtomConstraint> getListOfAtomics()
AtomConstraint
public final java.util.List<Formula> getListOfConstraints()
Formula
public final java.util.Enumeration<Formula> getConstraints()
Formula
public final java.util.Vector<Formula> getConstraintsVec()
getListOfConstraints()
Formula
public java.util.List<Formula> getGlobalConstraints()
Formula
.
Formula
public java.util.List<Formula> getConstraintsForLayer(int l)
Formula
.
Formula
public java.util.Vector<Formula> getConstraintsForPriority(int p)
Formula
.
Formula
public void refreshConstraintsForLayer()
public void refreshConstraintsForPriority()
public Rule createRule()
public agg.xt_agt.RuleScheme createRuleScheme()
public boolean addRuleScheme(agg.xt_agt.RuleScheme rs)
public void sortRulesByPriority()
public void sortRulesByLayer()
public void sortConstraintsByLayer()
public void sortConstraintsByPriority()
public Graph cloneGraph()
public Rule cloneRule(Rule r)
public AtomConstraint createAtomic(java.lang.String name)
public boolean addAtomic(AtomConstraint ac)
public boolean removeAtomic(AtomConstraint ac)
public Formula createConstraint(java.lang.String name)
public boolean addConstraint(Formula f)
public void destroyTypeGraph()
public void destroyRule(Rule rule)
public void destroyAllRules()
public void destroyAtomic(AtomConstraint a)
public void destroyAllAtomics()
public void destroyConstraint(Formula f)
public void destroyAllConstraints()
public java.util.Vector<java.lang.String> destroyGraphObjectsOfType(Type t, boolean fromTypeGraph)
public java.util.Vector<java.lang.String> destroyGraphObjectsOfTypes(java.util.Vector<Type> ts, boolean fromTypeGraph)
public boolean destroyGraphObjectsOfTypeFromHostGraph(Type t)
public java.util.Vector<java.lang.String> destroyGraphObjectsOfTypesFromHostGraph(java.util.Vector<Type> ts)
public java.util.Vector<java.lang.String> destroyGraphObjectsOfTypeFromRules(Type t)
public java.util.Vector<java.lang.String> destroyGraphObjectsOfTypesFromRules(java.util.Vector<Type> ts)
public java.util.Vector<java.lang.String> destroyGraphObjectsOfTypeFromGraphConstraints(Type t)
public java.util.Vector<java.lang.String> destroyGraphObjectsOfTypesFromGraphConstraints(java.util.Vector<Type> ts)
public final java.util.Enumeration<Match> getMatches(Rule rule)
Match
.
Match
public final Match getMatch(Rule rule, Graph g)
public Match createMatch(Rule rule)
public void destroyMatch(Match match)
public void destroyMatches(Graph g)
public void destroyAllMatches()
public Graph createTypeGraph()
public Graph getTypeGraph()
null
,
if no type graph was created before.
public Type createType()
public Type createType(boolean withAttributes)
public boolean isUsingType(GraphObject t)
true
if this gragra uses the specified type.
public TypeSet getTypeSet()
public java.util.Enumeration<Type> getTypes()
Type
.
Type
public void destroyType(Type type) throws TypeException
TypeException
public java.util.Collection<TypeError> setLevelOfTypeGraphCheck(int level)
TypeError
if there were problems during the test.
level
- TypeSet.DISABLED |
The type graph will be ignored, so all graphs can contain objects with types undefined in the type graph. Multiplicity will be also ignored. |
TypeSet.ENABLED |
The type graph will be basicaly used, so all graphs can only contain objects with types defined in the type graph. But the multiplicity will not be checked. |
TypeSet.ENABLED_MAX |
The type graph will be basicaly used, so all graphs can only contain objects with types defined in the type graph. Multiplicities in all graphs should satisfy the defined maximum constraints. |
TypeSet.ENABLED_MAX_MIN |
The type graph will be used, so all graphs can only contain objects with types defined in the type graph. Multiplicities in all graphs must satisfy the defined maximum constraints and the host graph must |
public int getLevelOfTypeGraphCheck()
TypeSet.DISABLED |
The type graph will be ignored, so all graphs can contain objects with types undefined in the type graph. Multiplicity will be also ignored. |
TypeSet.ENABLED |
The type graph will be basicaly used, so all graphs can only contain objects with types defined in the type graph. But the multiplicity will not be checked. |
TypeSet.ENABLED_MAX |
The type graph will be basicaly used, so all graphs can only contain objects with types defined in the type graph. Multiplicities in all graphs should satisfy the defined maximum constraints. |
TypeSet.ENABLED_MAX_MIN |
The type graph will be used, so all graphs can only contain objects with types defined in the type graph. Multiplicities in all graphs must satisfy the defined maximum constraints and the hosting graph must |
public void setMorphismCompletionStrategyOfGraphConstraints()
public java.lang.String checkNodeTypeMultiplicity(Node typeNode)
typeNode
-
public java.lang.String checkEdgeTypeMultiplicity(Arc typeArc)
typeArc
-
public int getMultiplicityErrorKind()
public boolean checkGraphConstraints(boolean validity)
public boolean checkGraphConsistency(Graph g)
public boolean checkGraphConsistency(Graph g, java.util.List<Formula> constraints)
public boolean checkAtomics(boolean checkAtomicValidityOnly)
public java.lang.String getConsistencyErrorMsg()
public java.lang.String convertConstraints()
public void clearRuleConstraints(AtomConstraint ac)
public void clearRuleConstraints(Formula f)
public void clearRuleConstraints()
public void setRuleLayer(RuleLayer rl)
public void unsetLayerTriggerRule()
public java.util.Vector<java.lang.String> getGraTraOptions()
public void setGraTraOptions(java.util.Vector<java.lang.String> opts)
public void addGraTraOption(java.lang.String opt)
public void removeGraTraOption(java.lang.String opt)
public void setMorphismCompletionStrategy(MorphCompletionStrategy strat)
public void setGraTraOptions(MorphCompletionStrategy strat)
public boolean compareTo(GraGra gragra, boolean transOption)
public boolean compareTo(GraGra gragra)
public boolean compareRulesTo(GraGra gragra, boolean checkLayer)
public boolean compareConstraintsTo(GraGra gragra)
public java.util.Vector<Rule> getNonInjectiveRules()
public boolean isGraphReadyForTransform()
public void prepareRuleInfo()
public Pair<java.lang.Object,java.lang.String> isReadyToTransform(boolean prepareRuleInfo)
prepareRuleInfo
is true.
public Pair<java.lang.Object,java.lang.String> isReadyToTransform()
public Pair<java.lang.Object,java.lang.String> isGraphConstraintReadyForTransform()
public Type doAttrTypesExist()
public Pair<java.lang.Object,java.lang.String> checkInheritedAttributesValid()
public java.util.List<Rule> getEnabledRules()
public java.util.Vector<Rule> getApplicableRules(MorphCompletionStrategy aStrategy)
public java.util.Vector<Rule> getApplicableRules(Graph g, MorphCompletionStrategy aStrategy)
public void dismissRuleApplicability()
public void storeUsedClassPackages()
public void setUsedClassPackages()
public void setRuleSequences(java.util.Vector<Pair<java.util.Vector<Pair<java.lang.String,java.lang.String>>,java.lang.String>> sequences)
public java.util.Vector<Pair<java.util.Vector<Pair<java.lang.String,java.lang.String>>,java.lang.String>> getRuleSequences()
public void save(java.lang.String filename)
public void load(java.lang.String filename) throws java.lang.Exception
java.lang.Exception
public void read(java.lang.String filename) throws java.lang.Exception
java.lang.Exception
public void XwriteObject(XMLHelper h)
XwriteObject
in interface XMLObject
h
- an XMLHelper, without an open element for this gragra.saveXML(agg.util.XMLHelper)
public void XreadObject(XMLHelper h)
<GraphTransformationSystem>
in the
XML file opened by the given XMLHelper.
XreadObject
in interface XMLObject
h
- an XMLHelper, with an not yet opened element for this gragra.loadXML(agg.util.XMLHelper)
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |