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

#include <Dogaru.h>

Static Public Member Functions

template<class SymbolType >
static ext::set< unsigned > match (const string::LinearString< SymbolType > &subject, const string::LinearString< SymbolType > &pattern)
 

Detailed Description

Implementation of the Dogaru algorithm from article "On the All Occurrences of a Word in a Text" by O.C.Dogaru

Member Function Documentation

◆ match()

template<class SymbolType >
ext::set< unsigned > stringology::exact::Dogaru::match ( const string::LinearString< SymbolType > &  subject,
const string::LinearString< SymbolType > &  pattern 
)
static

Search for pattern in linear string.

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

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