private Rule_testRule() { PatternNode node_p2 = new PatternNode((int) NodeTypes.@Process, "node_p2", node_p2_AllowedTypes, node_p2_IsAllowedType, PatternElementType.Normal, -1); PatternNode node_p1 = new PatternNode((int) NodeTypes.@Process, "node_p1", node_p1_AllowedTypes, node_p1_IsAllowedType, PatternElementType.Normal, -1); PatternEdge edge__edge0 = new PatternEdge(node_p1, node_p2, (int) EdgeTypes.@connection, "edge__edge0", edge__edge0_AllowedTypes, edge__edge0_IsAllowedType, PatternElementType.Normal, -1); patternGraph = new PatternGraph( new PatternNode[] { node_p2, node_p1 }, new PatternEdge[] { edge__edge0 }, new Condition[] { }, new bool[2, 2] { { true, false, }, { false, true, }, }, new bool[1, 1] { { true, }, }, new bool[] { false, false, }, new bool[] { false, } ); negativePatternGraphs = new PatternGraph[] {}; inputs = new GrGenType[] { }; outputs = new GrGenType[] { }; }
/// <summary> /// Instantiates a new PatternNode object as a copy from an original node, used for independent inlining. /// </summary> /// <param name="original">The original pattern node to be copy constructed.</param> /// <param name="nameSuffix">The suffix to be added to the name of the pattern node (to avoid name collisions).</param> public PatternNode(PatternNode original, String nameSuffix) : base(original, nameSuffix) { }
/// <summary> /// Instantiates a new PatternNode object as a copy from an original node, used for subpattern inlining. /// </summary> /// <param name="original">The original pattern node to be copy constructed.</param> /// <param name="inlinedSubpatternEmbedding">The embedding which just gets inlined.</param> /// <param name="newHost">The pattern graph the new pattern node will be contained in.</param> /// <param name="nameSuffix">The suffix to be added to the name of the pattern node (to avoid name collisions).</param> public PatternNode(PatternNode original, PatternGraphEmbedding inlinedSubpatternEmbedding, PatternGraph newHost, String nameSuffix) : base(original, inlinedSubpatternEmbedding, newHost, nameSuffix) { }
/// <summary> /// Builds a pattern graph out of the graph. /// The pattern graph retains links to the original graph elements and uses them for attribute comparison. /// </summary> /// <param name="graph">The graph which is to be transfered into a pattern</param> /// <returns></returns> public PatternGraph BuildPatternGraph(LGSPGraph graph) { int numNodes = graph.NumNodes; int numEdges = graph.NumEdges; int count = 0; PatternNode[] nodes = new PatternNode[numNodes]; INode[] correspondingNodes = new INode[numNodes]; foreach(INode node in graph.Nodes) { LGSPNode n = (LGSPNode)node; nodes[count] = new PatternNode( n.Type.TypeID, n.Type, n.Type.PackagePrefixedName, graph.Name+"_node_"+count, "node_"+count, null, null, 1.0f, -1, false, null, null, null, null, null, null, false, null ); correspondingNodes[count] = node; ++count; } count = 0; PatternEdge[] edges = new PatternEdge[numEdges]; IEdge[] correspondingEdges = new IEdge[numEdges]; foreach(IEdge edge in graph.Edges) { LGSPEdge e = (LGSPEdge)edge; edges[count] = new PatternEdge( true, e.Type.TypeID, e.Type, e.Type.PackagePrefixedName, graph.Name+"_edge_"+count, "edge_"+count, null, null, 1.0f, -1, false, null, null, null, null, null, null, false, null ); correspondingEdges[count] = edge; ++count; } bool[,] homNodes = new bool[numNodes, numNodes]; for(int i = 0; i < numNodes; ++i) for(int j = 0; j < numNodes; ++j) homNodes[i, j] = false; bool[,] homEdges = new bool[numEdges, numEdges]; for(int i = 0; i < numEdges; ++i) for(int j = 0; j < numEdges; ++j) homEdges[i, j] = false; bool[,] homNodesGlobal = new bool[numNodes, numNodes]; for(int i = 0; i < numNodes; ++i) for(int j = 0; j < numNodes; ++j) homNodesGlobal[i, j] = false; bool[,] homEdgesGlobal = new bool[numEdges, numEdges]; for(int i = 0; i < numEdges; ++i) for(int j = 0; j < numEdges; ++j) homEdgesGlobal[i, j] = false; bool[] totallyHomNodes = new bool[numNodes]; for(int i = 0; i < numNodes; ++i) totallyHomNodes[i] = false; bool[] totallyHomEdges = new bool[numEdges]; for(int i = 0; i < numEdges; ++i) totallyHomEdges[i] = false; List<PatternCondition> pcs = new List<PatternCondition>(); for(int i = 0; i < numNodes; ++i) { if(nodes[i].Type.NumAttributes > 0) pcs.Add(new PatternCondition(new expression.AreAttributesEqual(correspondingNodes[i], nodes[i]), new string[] { nodes[i].name }, new string[] { }, new string[] { }, new VarType[] { })); } for(int i = 0; i < numEdges; ++i) { if(edges[i].Type.NumAttributes > 0) pcs.Add(new PatternCondition(new expression.AreAttributesEqual(correspondingEdges[i], edges[i]), new string[] { }, new string[] { edges[i].name }, new string[] { }, new VarType[] { })); } PatternCondition[] patternConditions = pcs.ToArray(); PatternGraph patternGraph = new PatternGraph( graph.Name, "", null, graph.Name, false, false, nodes, edges, new PatternVariable[0], new PatternGraphEmbedding[0], new Alternative[0], new Iterated[0], new PatternGraph[0], new PatternGraph[0], patternConditions, new PatternYielding[0], homNodes, homEdges, homNodesGlobal, homEdgesGlobal, totallyHomNodes, totallyHomEdges ); foreach(PatternNode node in nodes) node.pointOfDefinition = patternGraph; foreach(PatternEdge edge in edges) edge.pointOfDefinition = patternGraph; patternGraph.correspondingNodes = correspondingNodes; patternGraph.correspondingEdges = correspondingEdges; foreach(IEdge edge in graph.Edges) { int edgeIndex = Array.IndexOf<IEdge>(correspondingEdges, edge); int sourceIndex = Array.IndexOf<INode>(correspondingNodes, edge.Source); int targetIndex = Array.IndexOf<INode>(correspondingNodes, edge.Target); patternGraph.edgeToSourceNode.Add(edges[edgeIndex], nodes[sourceIndex]); patternGraph.edgeToTargetNode.Add(edges[edgeIndex], nodes[targetIndex]); } PatternGraphAnalyzer.PrepareInline(patternGraph); return patternGraph; }
public static void CreatePickMapCastAssignPlanEdges(PatternNode node, List<PlanEdge> planEdges, float zeroCost) { if(node.Storage != null && node.GetPatternElementThisElementDependsOnOutsideOfGraphConnectedness() != null) { PlanEdge storAccessPlanEdge = new PlanEdge( node.StorageIndex != null ? SearchOperationType.MapWithStorageDependent : SearchOperationType.PickFromStorageDependent, node.GetPatternElementThisElementDependsOnOutsideOfGraphConnectedness().TempPlanMapping, node.TempPlanMapping, zeroCost); planEdges.Add(storAccessPlanEdge); node.TempPlanMapping.IncomingEdges.Add(storAccessPlanEdge); } else if(node.IndexAccess != null && node.GetPatternElementThisElementDependsOnOutsideOfGraphConnectedness() != null) { PlanEdge indexAccessPlanEdge = new PlanEdge( SearchOperationType.PickFromIndexDependent, node.GetPatternElementThisElementDependsOnOutsideOfGraphConnectedness().TempPlanMapping, node.TempPlanMapping, zeroCost); planEdges.Add(indexAccessPlanEdge); node.TempPlanMapping.IncomingEdges.Add(indexAccessPlanEdge); } else if(node.NameLookup != null && node.GetPatternElementThisElementDependsOnOutsideOfGraphConnectedness() != null) { PlanEdge nameAccessPlanEdge = new PlanEdge( SearchOperationType.PickByNameDependent, node.GetPatternElementThisElementDependsOnOutsideOfGraphConnectedness().TempPlanMapping, node.TempPlanMapping, zeroCost); planEdges.Add(nameAccessPlanEdge); node.TempPlanMapping.IncomingEdges.Add(nameAccessPlanEdge); } else if(node.UniqueLookup != null && node.GetPatternElementThisElementDependsOnOutsideOfGraphConnectedness() != null) { PlanEdge uniqueAccessPlanEdge = new PlanEdge( SearchOperationType.PickByUniqueDependent, node.GetPatternElementThisElementDependsOnOutsideOfGraphConnectedness().TempPlanMapping, node.TempPlanMapping, zeroCost); planEdges.Add(uniqueAccessPlanEdge); node.TempPlanMapping.IncomingEdges.Add(uniqueAccessPlanEdge); } else if(node.ElementBeforeCasting != null) { PlanEdge castPlanEdge = new PlanEdge(SearchOperationType.Cast, node.ElementBeforeCasting.TempPlanMapping, node.TempPlanMapping, zeroCost); planEdges.Add(castPlanEdge); node.TempPlanMapping.IncomingEdges.Add(castPlanEdge); } else if(node.AssignmentSource != null) { PlanEdge assignPlanEdge = new PlanEdge(SearchOperationType.Assign, node.AssignmentSource.TempPlanMapping, node.TempPlanMapping, zeroCost); planEdges.Add(assignPlanEdge); node.TempPlanMapping.IncomingEdges.Add(assignPlanEdge); if(!node.AssignmentSource.TempPlanMapping.IsPreset) { PlanEdge assignPlanEdgeOpposite = new PlanEdge(SearchOperationType.Assign, node.TempPlanMapping, node.AssignmentSource.TempPlanMapping, zeroCost); planEdges.Add(assignPlanEdgeOpposite); node.AssignmentSource.TempPlanMapping.IncomingEdges.Add(assignPlanEdgeOpposite); } } }
private static void CreatePlanNodeAndLookupPlanEdge(PatternNode node, int elemId, LGSPGraphStatistics graphStatistics, PatternGraph patternGraph, bool isNegativeOrIndependent, bool isSubpatternLike, PlanNode planRoot, float zeroCost, IDictionary<PatternNode, PatternNode> originalToInlinedIndependent, IDictionary<PatternElement, SetValueType> presetsFromIndependentInlining, out PlanNode planNode, out PlanEdge rootToNodePlanEdge) { float cost; bool isPreset; SearchOperationType searchOperationType; if(node.DefToBeYieldedTo) { cost = zeroCost; isPreset = true; searchOperationType = SearchOperationType.DefToBeYieldedTo; } else if(node.PointOfDefinition == null) { cost = zeroCost; isPreset = true; searchOperationType = isSubpatternLike ? SearchOperationType.SubPreset : SearchOperationType.ActionPreset; } else if(node.PointOfDefinition != patternGraph && node.OriginalIndependentElement == null) { cost = zeroCost; isPreset = true; searchOperationType = isNegativeOrIndependent ? SearchOperationType.NegIdptPreset : SearchOperationType.SubPreset; } else if(presetsFromIndependentInlining.ContainsKey(node)) { cost = zeroCost; isPreset = true; searchOperationType = SearchOperationType.NegIdptPreset; node.PresetBecauseOfIndependentInlining = true; } else if(node.Storage != null) { if(node.GetPatternElementThisElementDependsOnOutsideOfGraphConnectedness() != null) { cost = zeroCost; isPreset = false; searchOperationType = SearchOperationType.Void; // the element we depend on is needed, so there is no lookup like operation } else { cost = zeroCost; isPreset = false; searchOperationType = SearchOperationType.PickFromStorage; // pick from storage instead of lookup from graph } } else if(node.IndexAccess != null) { if(node.GetPatternElementThisElementDependsOnOutsideOfGraphConnectedness() != null) { cost = zeroCost; isPreset = false; searchOperationType = SearchOperationType.Void; // the element we depend on is needed, so there is no lookup like operation } else { cost = zeroCost; isPreset = false; searchOperationType = SearchOperationType.PickFromIndex; // pick from index instead of lookup from graph } } else if(node.NameLookup != null) { if(node.GetPatternElementThisElementDependsOnOutsideOfGraphConnectedness() != null) { cost = zeroCost; isPreset = false; searchOperationType = SearchOperationType.Void; // the element we depend on is needed, so there is no lookup like operation } else { cost = zeroCost; isPreset = false; searchOperationType = SearchOperationType.PickByName; // pick by name instead of lookup from graph } } else if(node.UniqueLookup != null) { if(node.GetPatternElementThisElementDependsOnOutsideOfGraphConnectedness() != null) { cost = zeroCost; isPreset = false; searchOperationType = SearchOperationType.Void; // the element we depend on is needed, so there is no lookup like operation } else { cost = zeroCost; isPreset = false; searchOperationType = SearchOperationType.PickByUnique; // pick by unique instead of lookup from graph } } else if(node.ElementBeforeCasting != null) { cost = zeroCost; isPreset = false; searchOperationType = SearchOperationType.Void; // the element before casting is needed, so there is no lookup like operation } else { cost = graphStatistics.nodeCounts[node.TypeID]; cost = CostIncreaseForInlinedIndependent(node, cost); isPreset = false; searchOperationType = SearchOperationType.Lookup; } planNode = new PlanNode(node, elemId, isPreset); rootToNodePlanEdge = null; if(searchOperationType != SearchOperationType.Void) rootToNodePlanEdge = new PlanEdge(searchOperationType, planRoot, planNode, cost); }
/// <summary> /// Generate plan graph for given pattern graph with costs from the analyzed host graph. /// Plan graph contains nodes representing the pattern elements (nodes and edges) /// and edges representing the matching operations to get the elements by. /// Edges in plan graph are given in the nodes by incoming list, as needed for MSA computation. /// </summary> public PlanGraph GeneratePlanGraph(LGSPGraphStatistics graphStatistics, PatternGraph patternGraph, bool isNegativeOrIndependent, bool isSubpatternLike, IDictionary<PatternElement, SetValueType> presetsFromIndependentInlining) { // // If you change this method, chances are high you also want to change GenerateStaticPlanGraph in LGSPGrGen // look there for version without ifdef junk // todo: unify it with GenerateStaticPlanGraph in LGSPGrGen // // Create root node // Create plan graph nodes for all pattern graph nodes and all pattern graph edges // Create "lookup" plan graph edge from root node to each plan graph node // Create "implicit source" plan graph edge from each plan graph node originating with a pattern edge // to the plan graph node created by the source node of the pattern graph edge // Create "implicit target" plan graph edge from each plan graph node originating with a pattern edge // to the plan graph node created by the target node of the pattern graph edge // Create "incoming" plan graph edge from each plan graph node originating with a pattern node // to a plan graph node created by one of the incoming edges of the pattern node // Create "outgoing" plan graph edge from each plan graph node originating with a pattern node // to a plan graph node created by one of the outgoing edges of the pattern node // Ensured: there's no plan graph edge with a preset element as target besides the lookup, // so presets are only search operation sources // Create "pick from storage" plan graph edge for plan graph nodes which are to be picked from a storage, // from root node on, instead of lookup, no other plan graph edge having this node as target // Create "pick from storage attribute" plan graph edge from storage attribute owner to storage picking result, // no lookup, no other plan graph edge having this node as target // Create "map" by storage plan graph edge from accessor to storage mapping result // no lookup, no other plan graph edge having this node as target // Create "pick from index" plan graph edge for plan graph nodes which are to be picked from an index, // from root node on, instead of lookup, no other plan graph edge having this node as target // Create "pick from index depending" plan graph edge from node the index expressions depend on, // no lookup, no other plan graph edge having this node as target // Create "cast" plan graph edge from element before casting to cast result, // no lookup, no other plan graph edge having this node as target int numNodes = patternGraph.nodesPlusInlined.Length; if(InlineIndependents && !isNegativeOrIndependent) numNodes += LGSPMatcherGenerator.NumNodesInIndependentsMatchedThere(patternGraph); int numEdges = patternGraph.edgesPlusInlined.Length; if(InlineIndependents && !isNegativeOrIndependent) numEdges += LGSPMatcherGenerator.NumEdgesInIndependentsMatchedThere(patternGraph); PlanNode[] planNodes = new PlanNode[numNodes + numEdges]; List<PlanEdge> planEdges = new List<PlanEdge>(numNodes + 5 * numEdges); // upper bound for num of edges (lookup nodes + lookup edges + impl. tgt + impl. src + incoming + outgoing) Dictionary<PatternNode, PatternNode> originalToInlinedIndependent = new Dictionary<PatternNode, PatternNode>(); int nodesIndex = 0; float zeroCost = 1; PlanNode planRoot = new PlanNode("root"); // create plan nodes and lookup plan edges for all pattern graph nodes for(int i = 0; i < patternGraph.nodesPlusInlined.Length; i++) { PatternNode node = patternGraph.nodesPlusInlined[i]; PlanNode planNode; PlanEdge rootToNodePlanEdge; CreatePlanNodeAndLookupPlanEdge(node, i + 1, graphStatistics, patternGraph, isNegativeOrIndependent, isSubpatternLike, planRoot, zeroCost, originalToInlinedIndependent, presetsFromIndependentInlining, out planNode, out rootToNodePlanEdge); planNodes[nodesIndex] = planNode; if(rootToNodePlanEdge != null) { planEdges.Add(rootToNodePlanEdge); planNode.IncomingEdges.Add(rootToNodePlanEdge); } node.TempPlanMapping = planNode; ++nodesIndex; } if(InlineIndependents && !isNegativeOrIndependent) // independent inlining only if not in negative/independent { foreach(PatternGraph independent in patternGraph.independentPatternGraphsPlusInlined) { foreach(PatternNode nodeOriginal in LGSPMatcherGenerator.NodesInIndependentMatchedThere(independent)) { PatternNode node = new PatternNode(nodeOriginal, "_inlined_" + independent.name); originalToInlinedIndependent.Add(nodeOriginal, node); PlanNode planNode; PlanEdge rootToNodePlanEdge; CreatePlanNodeAndLookupPlanEdge(node, -1, graphStatistics, patternGraph, isNegativeOrIndependent, isSubpatternLike, planRoot, zeroCost, originalToInlinedIndependent, presetsFromIndependentInlining, out planNode, out rootToNodePlanEdge); planNodes[nodesIndex] = planNode; if(rootToNodePlanEdge != null) { planEdges.Add(rootToNodePlanEdge); planNode.IncomingEdges.Add(rootToNodePlanEdge); } node.TempPlanMapping = planNode; ++nodesIndex; } } } // create plan nodes and lookup plus incidence handling plan edges for all pattern graph edges for(int i = 0; i < patternGraph.edgesPlusInlined.Length; ++i) { PatternEdge edge = patternGraph.edgesPlusInlined[i]; bool isPreset; PlanNode planNode; PlanEdge rootToNodePlanEdge; CreatePlanNodeAndLookupPlanEdge(edge, i + 1, graphStatistics, patternGraph, isNegativeOrIndependent, isSubpatternLike, planRoot, zeroCost, originalToInlinedIndependent, presetsFromIndependentInlining, out isPreset, out planNode, out rootToNodePlanEdge); planNodes[nodesIndex] = planNode; if(rootToNodePlanEdge != null) { planEdges.Add(rootToNodePlanEdge); planNode.IncomingEdges.Add(rootToNodePlanEdge); } CreateSourceTargetIncomingOutgoingPlanEdges(edge, planNode, planEdges, originalToInlinedIndependent, graphStatistics, patternGraph, isPreset, zeroCost); edge.TempPlanMapping = planNode; ++nodesIndex; } if(InlineIndependents && !isNegativeOrIndependent) // independent inlining only if not in negative/independent { foreach(PatternGraph independent in patternGraph.independentPatternGraphsPlusInlined) { foreach(PatternEdge edgeOriginal in LGSPMatcherGenerator.EdgesInIndependentMatchedThere(independent)) { PatternEdge edge = new PatternEdge(edgeOriginal, "_inlined_" + independent.name); bool isPreset; PlanNode planNode; PlanEdge rootToNodePlanEdge; CreatePlanNodeAndLookupPlanEdge(edge, -1, graphStatistics, patternGraph, isNegativeOrIndependent, isSubpatternLike, planRoot, zeroCost, originalToInlinedIndependent, presetsFromIndependentInlining, out isPreset, out planNode, out rootToNodePlanEdge); planNodes[nodesIndex] = planNode; if(rootToNodePlanEdge != null) { planEdges.Add(rootToNodePlanEdge); planNode.IncomingEdges.Add(rootToNodePlanEdge); } CreateSourceTargetIncomingOutgoingPlanEdges(edge, planNode, planEdges, originalToInlinedIndependent, graphStatistics, patternGraph, isPreset, zeroCost); edge.TempPlanMapping = planNode; ++nodesIndex; } } } //////////////////////////////////////////////////////////////////////////// // second run handling dependent storage and index picking (can't be done in first run due to dependencies between elements) // create map/pick/cast/assign plan edges for all pattern graph nodes for(int i = 0; i < patternGraph.nodesPlusInlined.Length; ++i) { PatternNode node = patternGraph.nodesPlusInlined[i]; if(node.PointOfDefinition == patternGraph && !presetsFromIndependentInlining.ContainsKey(node)) CreatePickMapCastAssignPlanEdges(node, planEdges, zeroCost); } // create map/pick/cast/assign plan edges for all pattern graph edges for(int i = 0; i < patternGraph.edgesPlusInlined.Length; ++i) { PatternEdge edge = patternGraph.edgesPlusInlined[i]; if(edge.PointOfDefinition == patternGraph && !presetsFromIndependentInlining.ContainsKey(edge)) CreatePickMapCastAssignPlanEdges(edge, planEdges, zeroCost); } return new PlanGraph(planRoot, planNodes, planEdges.ToArray()); }
/// <summary> /// Instantiates a node plan node. /// </summary> /// <param name="patNode">The pattern node for this plan node.</param> /// <param name="elemID">The element ID for this plan node.</param> /// <param name="isPreset">True, if this element is a known element.</param> public PlanNode(PatternNode patNode, int elemID, bool isPreset) { NodeType = PlanNodeType.Node; ElementID = elemID; IsPreset = isPreset; PatternElement = patNode; }
private void initialize() { bool[,] testRule_isNodeHomomorphicGlobal = new bool[3, 3] { { false, false, false, }, { false, false, false, }, { false, false, false, }, }; bool[,] testRule_isEdgeHomomorphicGlobal = new bool[2, 2] { { false, false, }, { false, false, }, }; bool[] testRule_isNodeTotallyHomomorphic = new bool[3] { false, false, false, }; bool[] testRule_isEdgeTotallyHomomorphic = new bool[2] { false, false, }; GRGEN_LGSP.PatternNode testRule_node_a = new GRGEN_LGSP.PatternNode((int)GRGEN_MODEL.NodeTypes.@D231_4121, GRGEN_MODEL.NodeType_D231_4121.typeVar, "GRGEN_MODEL.ID231_4121", "testRule_node_a", "a", testRule_node_a_AllowedTypes, testRule_node_a_IsAllowedType, 5.5F, -1, false, null, null, null, null, null, null, false, null); GRGEN_LGSP.PatternNode testRule_node_f = new GRGEN_LGSP.PatternNode((int)GRGEN_MODEL.NodeTypes.@B21, GRGEN_MODEL.NodeType_B21.typeVar, "GRGEN_MODEL.IB21", "testRule_node_f", "f", testRule_node_f_AllowedTypes, testRule_node_f_IsAllowedType, 5.5F, -1, false, null, null, null, null, null, null, false, null); GRGEN_LGSP.PatternNode testRule_node_m = new GRGEN_LGSP.PatternNode((int)GRGEN_MODEL.NodeTypes.@D2211_2222_31, GRGEN_MODEL.NodeType_D2211_2222_31.typeVar, "GRGEN_MODEL.ID2211_2222_31", "testRule_node_m", "m", testRule_node_m_AllowedTypes, testRule_node_m_IsAllowedType, 5.5F, -1, false, null, null, null, null, null, null, false, null); GRGEN_LGSP.PatternEdge testRule_edge__edge0 = new GRGEN_LGSP.PatternEdge(true, (int)GRGEN_MODEL.EdgeTypes.@Edge, GRGEN_MODEL.EdgeType_Edge.typeVar, "GRGEN_LIBGR.IEdge", "testRule_edge__edge0", "_edge0", testRule_edge__edge0_AllowedTypes, testRule_edge__edge0_IsAllowedType, 5.5F, -1, false, null, null, null, null, null, null, false, null); GRGEN_LGSP.PatternEdge testRule_edge__edge1 = new GRGEN_LGSP.PatternEdge(true, (int)GRGEN_MODEL.EdgeTypes.@Edge, GRGEN_MODEL.EdgeType_Edge.typeVar, "GRGEN_LIBGR.IEdge", "testRule_edge__edge1", "_edge1", testRule_edge__edge1_AllowedTypes, testRule_edge__edge1_IsAllowedType, 5.5F, -1, false, null, null, null, null, null, null, false, null); pat_testRule = new GRGEN_LGSP.PatternGraph( "testRule", "", null, "testRule", false, false, new GRGEN_LGSP.PatternNode[] { testRule_node_a, testRule_node_f, testRule_node_m }, new GRGEN_LGSP.PatternEdge[] { testRule_edge__edge0, testRule_edge__edge1 }, new GRGEN_LGSP.PatternVariable[] { }, new GRGEN_LGSP.PatternGraphEmbedding[] { }, new GRGEN_LGSP.Alternative[] { }, new GRGEN_LGSP.Iterated[] { }, new GRGEN_LGSP.PatternGraph[] { }, new GRGEN_LGSP.PatternGraph[] { }, new GRGEN_LGSP.PatternCondition[] { }, new GRGEN_LGSP.PatternYielding[] { }, new bool[3, 3] { { true, false, false, }, { false, true, false, }, { false, false, true, }, }, new bool[2, 2] { { true, false, }, { false, true, }, }, testRule_isNodeHomomorphicGlobal, testRule_isEdgeHomomorphicGlobal, testRule_isNodeTotallyHomomorphic, testRule_isEdgeTotallyHomomorphic ); pat_testRule.edgeToSourceNode.Add(testRule_edge__edge0, testRule_node_a); pat_testRule.edgeToTargetNode.Add(testRule_edge__edge0, testRule_node_f); pat_testRule.edgeToSourceNode.Add(testRule_edge__edge1, testRule_node_f); pat_testRule.edgeToTargetNode.Add(testRule_edge__edge1, testRule_node_m); testRule_node_a.pointOfDefinition = pat_testRule; testRule_node_f.pointOfDefinition = pat_testRule; testRule_node_m.pointOfDefinition = pat_testRule; testRule_edge__edge0.pointOfDefinition = pat_testRule; testRule_edge__edge1.pointOfDefinition = pat_testRule; patternGraph = pat_testRule; }