Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Static Public Member Functions
arbology::exact::KnuthMorrisPratt Class Reference

#include <KnuthMorrisPratt.h>

Static Public Member Functions

template<class SymbolType >
static ext::set< unsigned > match (const tree::PrefixRankedBarTree< SymbolType > &subject, const tree::PrefixRankedBarTree< SymbolType > &pattern)
 
template<class SymbolType >
static ext::set< unsigned > match (const tree::PrefixRankedBarTree< SymbolType > &subject, const tree::PrefixRankedBarPattern< SymbolType > &pattern)
 
template<class SymbolType >
static ext::set< unsigned > match (const tree::PrefixRankedBarTree< SymbolType > &subject, const tree::PrefixRankedBarNonlinearPattern< SymbolType > &pattern)
 
template<class SymbolType >
static ext::set< unsigned > match (const tree::PrefixRankedTree< SymbolType > &subject, const tree::PrefixRankedTree< SymbolType > &pattern)
 
template<class SymbolType >
static ext::set< unsigned > match (const tree::PrefixRankedTree< SymbolType > &subject, const tree::PrefixRankedPattern< SymbolType > &pattern)
 
template<class SymbolType >
static ext::set< unsigned > match (const tree::PrefixRankedTree< SymbolType > &subject, const tree::PrefixRankedExtendedPattern< SymbolType > &pattern)
 
template<class SymbolType >
static ext::set< unsigned > match (const tree::PrefixRankedTree< SymbolType > &subject, const tree::PrefixRankedNonlinearPattern< SymbolType > &pattern)
 

Detailed Description

Implementation of BMH for MI(E+\eps)-EVY course 2014 To get rid of zeros in BCS table we ignore last haystack character

Member Function Documentation

◆ match() [1/7]

template<class SymbolType >
ext::set< unsigned > arbology::exact::KnuthMorrisPratt::match ( const tree::PrefixRankedBarTree< SymbolType > &  subject,
const tree::PrefixRankedBarNonlinearPattern< SymbolType > &  pattern 
)
static
Here is the call graph for this function:

◆ match() [2/7]

template<class SymbolType >
ext::set< unsigned > arbology::exact::KnuthMorrisPratt::match ( const tree::PrefixRankedBarTree< SymbolType > &  subject,
const tree::PrefixRankedBarPattern< SymbolType > &  pattern 
)
static
Here is the call graph for this function:

◆ match() [3/7]

template<class SymbolType >
ext::set< unsigned > arbology::exact::KnuthMorrisPratt::match ( const tree::PrefixRankedBarTree< SymbolType > &  subject,
const tree::PrefixRankedBarTree< SymbolType > &  pattern 
)
static

Search for pattern in linear string.

Returns
set set of occurences
Here is the call graph for this function:
Here is the caller graph for this function:

◆ match() [4/7]

template<class SymbolType >
ext::set< unsigned > arbology::exact::KnuthMorrisPratt::match ( const tree::PrefixRankedTree< SymbolType > &  subject,
const tree::PrefixRankedExtendedPattern< SymbolType > &  pattern 
)
static
Here is the call graph for this function:

◆ match() [5/7]

template<class SymbolType >
ext::set< unsigned > arbology::exact::KnuthMorrisPratt::match ( const tree::PrefixRankedTree< SymbolType > &  subject,
const tree::PrefixRankedNonlinearPattern< SymbolType > &  pattern 
)
static
Here is the call graph for this function:

◆ match() [6/7]

template<class SymbolType >
ext::set< unsigned > arbology::exact::KnuthMorrisPratt::match ( const tree::PrefixRankedTree< SymbolType > &  subject,
const tree::PrefixRankedPattern< SymbolType > &  pattern 
)
static
Here is the call graph for this function:

◆ match() [7/7]

template<class SymbolType >
ext::set< unsigned > arbology::exact::KnuthMorrisPratt::match ( const tree::PrefixRankedTree< SymbolType > &  subject,
const tree::PrefixRankedTree< SymbolType > &  pattern 
)
static
Here is the call graph for this function:

The documentation for this class was generated from the following file: