arbology::exact::QuickSearch Class Reference

#include <QuickSearch.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 the Quick Search algorithm for tree pattern matching. This variant searches the subject tree from left to right, while comparing matches from right to left. This algorithm makes use of a Bad character shift table as well as a Subtree jump table.

Member Function Documentation

match() [1/3]

template<class SymbolType >

ext::set< unsigned > arbology::exact::QuickSearch::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::QuickSearch::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::QuickSearch::match ( const tree::PrefixRankedBarTree< SymbolType > &  subject, const tree::PrefixRankedBarTree< SymbolType > &  pattern  )

static

Search for a tree pattern in a tree.

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/QuickSearch.h