 | IMatch Interface |
Base class of classes representing matches.
One exact match class is generated per pattern.
Namespace: de.unika.ipd.grGen.libGr
Assembly: libGr (in libGr.dll) Version: GrGen.NET 7.1
SyntaxC#
public interface IMatch
The IMatch type exposes the following members.
Properties| Name | Description | |
|---|---|---|
 | Alternatives | Enumerable returning enumerator over submatches due to alternatives (most inefficient access) |
| AlternativesEnumerator | Enumerator over submatches due to alternatives. (efficiency in between getAlternativeAt and Alternatives) You can find out which alternative case was matched by inspecting the Pattern member of the submatch. |
| Edges | Enumerable returning enumerator over matched edges (most inefficient access) |
| EdgesEnumerator | Enumerator over matched edges (efficiency in between getEdgeAt and Edges) |
| EmbeddedGraphs | Enumerable returning enumerator over submatches due to subpatterns (most inefficient access) |
| EmbeddedGraphsEnumerator | Enumerator over submatches due to subpatterns (efficiency in between getEmbeddedGraphAt and EmbeddedGraphs) |
| Independents | Enumerable returning enumerator over submatches due to independents (most inefficient access) |
| IndependentsEnumerator | Enumerator over submatches due to independents. (efficiency in between getIndependentAt and Independents) |
| Iterateds | Enumerable returning enumerator over submatches due to iterateds (most inefficient access) The submatch is a list of all matches of the iterated pattern. |
| IteratedsEnumerator | Enumerator over submatches due to iterateds. (efficiency in between getIteratedAt and Iterateds) The submatch is a list of all matches of the iterated pattern. |
| IterationNumber | Helper for parallelized matching, for building the matches list as if it was matched sequentially |
| MatchClass | The match object represents a match of the match class given by this member. Only set in case the match class was created by a constructor, otherwise the pattern is given. |
| MatchOfEnclosingPattern | The match of the enclosing pattern if this is the pattern of a subpattern, alternative, iterated or independent; otherwise null |
| Nodes | Enumerable returning enumerator over matched nodes (most inefficient access) |
| NodesEnumerator | Enumerator over matched nodes (efficiency in between getNodeAt and Nodes) |
| NumberOfAlternatives | Number of submatches due to alternatives in the match |
| NumberOfEdges | Number of edges in the match |
| NumberOfEmbeddedGraphs | Number of submatches due to subpatterns in the match |
| NumberOfIndependents | Number of submatches due to independents in the match |
| NumberOfIterateds | Number of submatches due to iterateds in the match. Corresponding to the number of iterated patterns, not the number of matches of some iterated pattern. |
| NumberOfNodes | Number of nodes in the match |
| NumberOfVariables | Number of variables in the match |
| Pattern | The match object represents a match of the pattern given by this member. May be null in case of a match class created by a constructor instead of an action. |
| Variables | Enumerable returning enumerator over matched variables (most inefficient access) |
| VariablesEnumerator | Enumerator over matched variables (efficiency in between getVariableAt and Variables) |
Methods| Name | Description | |
|---|---|---|
 | Clone | Clone the match |
| Clone(IDictionaryIGraphElement, IGraphElement) | Clone the match, mapping the old graph elements to new graph elements according to the oldToNewMap |
| getAlternative | Returns submatch bound to the pattern alternative of the given name or null if no such pattern alternative exists |
| getAlternativeAt | Returns submatch due to alternatives at position index (most efficient access) |
| getEdge | Returns edge bound to the pattern edge of the given name or null if no such pattern edge exists |
| getEdgeAt | Returns edge at position index (most efficient access) |
| getEmbeddedGraph | Returns submatch bound to the subpattern of the given name or null if no such subpattern exists |
| getEmbeddedGraphAt | Returns submatch due to subpattern at position index (most efficient access) |
| getIndependent | Returns submatch bound to the independent pattern of the given name or null if no such independent pattern exists |
| getIndependentAt | Returns submatch due to independents at position index (most efficient access) |
| getIterated | Returns submatch bound to the iterated pattern of the given name or null if no such iterated pattern exists |
| getIteratedAt | Returns submatch due to iterateds at position index (most efficient access) The submatch is a list of all matches of the iterated pattern. |
| GetMember | Returns value bound to the member of the given name or null if no such member exists |
| getNode | Returns node bound to the pattern node of the given name or null if no such pattern node exists |
| getNodeAt | Returns node at position index (most efficient access) |
| getVariable | Returns value bound to the pattern variable of the given name or null if no such pattern variable exists |
| getVariableAt | Returns variable at position index (most efficient access) |
| IsMarked | Reads a previously written flag (intially false); helper for symmetry checking |
| Mark | Writes a flag to the match, which is remembered; helper for symmetry checking |
| SetEdge | |
| SetMember | Sets member value (to be used by post-matches-filtering) |
| SetNode | |
| SetVariable |
See Also