Base class of classes representing matches.
One exact match class is generated per pattern.
Declaration Syntax| C# |
public interface IMatch
Members| All Members | Methods | Properties | |||
| Icon | Member | 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)
|
 | getAlternativeAt(Int32) |
Returns submatch due to alternatives at position index (most efficient access)
|
| getEdgeAt(Int32) |
Returns edge at position index (most efficient access)
|
| getEmbeddedGraphAt(Int32) |
Returns submatch due to subpattern at position index (most efficient access)
|
| getIndependentAt(Int32) |
Returns submatch due to independents at position index (most efficient access)
|
| getIteratedAt(Int32) |
Returns submatch due to iterateds at position index (most efficient access)
The submatch is a list of all matches of the iterated pattern.
|
| getNodeAt(Int32) |
Returns node at position index (most efficient access)
|
| getVariableAt(Int32) |
Returns variable at position index (most efficient access)
|
| 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.
|
| 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.
|
| Variables |
Enumerable returning enumerator over matched variables (most inefficient access)
|
| VariablesEnumerator |
Enumerator over matched variables (efficiency in between getVariableAt and Variables)
|