arbology::exact::BoyerMooreHorspool Class Reference

#include <BoyerMooreHorspool.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)

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/3]

template<class SymbolType >

ext::set< unsigned > arbology::exact::BoyerMooreHorspool::match ( const tree::PrefixRankedBarTree< SymbolType > &  subject, const tree::PrefixRankedBarNonlinearPattern< SymbolType > &  pattern  )

static

Here is the call graph for this function:

match() [2/3]

template<class SymbolType >

ext::set< unsigned > arbology::exact::BoyerMooreHorspool::match ( const tree::PrefixRankedBarTree< SymbolType > &  subject, const tree::PrefixRankedBarPattern< SymbolType > &  pattern  )

static

Here is the call graph for this function:

match() [3/3]

template<class SymbolType >

ext::set< unsigned > arbology::exact::BoyerMooreHorspool::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:

---

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

• alib2algo/src/arbology/exact/BoyerMooreHorspool.h