GrGen.NET v4.4 API: the libGr class library (the type exact interface gets generated)
IMatch Interface
Base class of classes representing matches. One exact match class is generated per pattern.
Declaration Syntax
C#
public interface IMatch
Members
All MembersMethodsProperties



IconMemberDescription
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.

Clone()()()()
Clone the match

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)

getAlternative(String)
Returns submatch bound to the pattern alternative of the given name or null if no such pattern alternative exists

getAlternativeAt(Int32)
Returns submatch due to alternatives at position index (most efficient access)

getEdge(String)
Returns edge bound to the pattern edge of the given name or null if no such pattern edge exists

getEdgeAt(Int32)
Returns edge at position index (most efficient access)

getEmbeddedGraph(String)
Returns submatch bound to the subpattern of the given name or null if no such subpattern exists

getEmbeddedGraphAt(Int32)
Returns submatch due to subpattern at position index (most efficient access)

getIndependent(String)
Returns submatch bound to the independent pattern of the given name or null if no such independent pattern exists

getIndependentAt(Int32)
Returns submatch due to independents at position index (most efficient access)

getIterated(String)
Returns submatch bound to the iterated pattern of the given name or null if no such iterated pattern exists

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.

getNode(String)
Returns node bound to the pattern node of the given name or null if no such pattern node exists

getNodeAt(Int32)
Returns node at position index (most efficient access)

getVariable(String)
Returns value bound to the pattern variable of the given name or null if no such pattern variable exists

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)

IsMarked()()()()
Reads a previously written flag (intially false); helper for symmetry checking

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

Mark(Boolean)
Writes a flag to the match, which is remembered; helper for symmetry checking

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)

Assembly: libGr (Module: libGr) Version: 4.4.0.0 (4.4.0.0)