agg.parser
Class CriticalRulePairAtGraph

java.lang.Object
  extended by agg.parser.ExcludePair
      extended by agg.parser.CriticalRulePairAtGraph
All Implemented Interfaces:
CriticalPair

public class CriticalRulePairAtGraph
extends ExcludePair

This class computes critical matches of two rules at a concrete graph. The two rules and a concret host graph graph are specified by the class constructor. In case of rule application conflicts a vector with pairs of tables with critical matches will be computed. The first table contains the match mappings from the LHS of the first rule into the graph and the second table contains the mappings from the LHS of the second rule into the same graph.


Field Summary
 
Fields inherited from class agg.parser.ExcludePair
boundB1_l1, boundB1_r1, checkDependencyCond2, complete, computable, consistencyCheck, consistentOnly, contextC1_l1, contextC1_r1, criticalNACOfR2exists, dangling, danglingEdge, danglingEdges, delete, dependencyCond1, dependencyCond2, equalVariableNameOfAttrMapping, essential, grammar, ignoreIdenticalRules, levelOfTypeGraphCheck, maxOverlapping, maxOverlapSize, ownStrategy, preservedChanged, preservedK1_l1, preservedK1_r1, produce, reduce, reduceSameMatch, stop, strategy, strongAttrCheck, typesTG_L2, typesTG_NAC2, typesTG_PAC2, withInheritance, withNACs, withPACs
 
Fields inherited from interface agg.parser.CriticalPair
CONFLICT, CONFLICTFREE, DEPENDENCY, EXCLUDE, TRIGGER_DEPENDENCY, TRIGGER_SWITCH_DEPENDENCY
 
Constructor Summary
CriticalRulePairAtGraph(Rule r1, Rule r2, Graph g)
           
 
Method Summary
 java.util.Vector<Pair<java.util.Hashtable<GraphObject,GraphObject>,java.util.Hashtable<GraphObject,GraphObject>>> isCriticalAtGraph()
          Computes critical matches of two rules at a concrete graph.
 
Methods inherited from class agg.parser.ExcludePair
attributeCheckFailed, checkGlobalNACsOfRule2, checkGraphConsistency, destroyOverlapping, disableCheckOfGraphConstraints, dispose, enableComplete, enableConsistent, enableEqualVariableNameOfAttrMapping, enableIgnoreIdenticalRules, enableNACs, enablePACs, enableReduce, enableReduceSameMatch, enableStrongAttrCheck, extendLeftGraphByNAC, extendLeftGraphByPAC, getNumberOfKindOfPairs, isCritical, isExclude, resetCheckOfGraphConstraints, ruleChangesAttributes, setGraGra, setMorphismCompletionStrategy, stop, unsetAllTransientAttrValuesOfOverlapGrah, unsetAllTransientAttrValuesOfRule
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Constructor Detail

CriticalRulePairAtGraph

public CriticalRulePairAtGraph(Rule r1,
                               Rule r2,
                               Graph g)
Method Detail

isCriticalAtGraph

public java.util.Vector<Pair<java.util.Hashtable<GraphObject,GraphObject>,java.util.Hashtable<GraphObject,GraphObject>>> isCriticalAtGraph()
Computes critical matches of two rules at a concrete graph. Two rules and a concret host graph graph are specified by the class constructor. In case of rule application conflicts returns a vector with pairs of tables with critical matches. The first table contains the match mappings from the LHS of the first rule into the graph and the second table contains the mappings from the LHS of the second rule into the same graph. Returns null, if the specified two rules can be applied at the host graph without any conflicts.

Returns:
a vector with pairs of tables or null