Class Matcher

Exposes utility methods to match a TextWithTerminator against a ISuffixStructureNode<TEdge, TNode> concretion.

Inheritance

System.Object

Matcher

Inherited Members

System.Object.Equals(System.Object)

System.Object.Equals(System.Object, System.Object)

System.Object.GetHashCode()

System.Object.GetType()

System.Object.MemberwiseClone()

System.Object.ReferenceEquals(System.Object, System.Object)

System.Object.ToString()

Namespace: MoreStructures.SuffixStructures.Matching

Assembly: MoreStructures.dll

Syntax

public static class Matcher

Methods

Match<TEdge, TNode>(ISuffixStructureNode<TEdge, TNode>, TextWithTerminator, String)

Tries to match a pattern against a ISuffixStructureNode<TEdge, TNode> built on a text.

Declaration

public static Match<TreePath<TEdge, TNode>> Match<TEdge, TNode>(this ISuffixStructureNode<TEdge, TNode> node, TextWithTerminator text, string pattern)
    where TEdge : ISuffixStructureEdge<TEdge, TNode> where TNode : ISuffixStructureNode<TEdge, TNode>

Parameters

Type	Name	Description
ISuffixStructureNode<TEdge, TNode>	node	The root of the Suffix Tree, to match the suffix of text against.
TextWithTerminator	text	The text whose Suffix Tree has to be matched against the pattern.
System.String	pattern	The pattern to match. Unlike text, is a string without terminator.

Returns

Type	Description
Match<TreePath<TEdge, TNode>>	A successful or non-successful match.

Type Parameters

Name	Description
TEdge
TNode

Remarks

COMPLEXITY
Time Complexity = O(t * as) and Space Complexity = O(t * as) where t = length of the text to match and as = size of the alphabet of the text. If the alphabet is of constant size, complexity is linear.