Search Results for

    Show / Hide Table of Contents

    Namespace MoreStructures.SuffixStructures.Matching

    Classes

    Matcher

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

    NaiveSnssFinder

    A ISnssFinder implementation which checks for the presence of each substring of the first text in the second text, from the longest to the shortest.

    SuffixStructureBasedSnssFinder

    Base class for all ISnssFinder concretions which implement Find(IEnumerable<Char>, IEnumerable<Char>) using a suffix structure (a concretions of ISuffixStructureNode<TEdge, TNode>, implementing IRecImmDictIndexedTreeNode<TEdge, TNode>), such as SuffixTreeNode or SuffixTrieNode).

    SuffixTreeBasedSnssFinder

    A ISnssFinder implementation and SuffixStructureBasedSnssFinder concretion which uses a SuffixTreeNode structure to implement Find(IEnumerable<Char>, IEnumerable<Char>).

    SuffixTrieBasedSnssFinder

    A ISnssFinder implementation and SuffixStructureBasedSnssFinder concretion which uses a SuffixTrieNode structure to implement Find(IEnumerable<Char>, IEnumerable<Char>).

    Interfaces

    ISnssFinder

    Any algorithm finding the Shortest Non-shared Substring (Snss) between two strings.

    In This Article
    Back to top Generated by DocFX