Algorithms_in_C++ 1.0.0
Set of algorithms implemented in C++.
|
Functions for the Boyer Moore algorithm implementation. More...
Classes | |
struct | pattern |
A structure representing all the data we need to search the preprocessed pattern in text. More... | |
Functions | |
void | init_good_suffix (const std::string &str, std::vector< size_t > &arg) |
A function that preprocess the good suffix thable. | |
void | init_bad_char (const std::string &str, std::vector< size_t > &arg) |
A function that preprocess the bad char table. | |
void | init_pattern (const std::string &str, pattern &arg) |
A function that initializes pattern. | |
std::vector< size_t > | search (const std::string &str, const pattern &arg) |
A function that implements Boyer-Moore's algorithm. | |
bool | is_prefix (const char *str, const char *pat, size_t len) |
Check if pat is prefix of str. | |
Functions for the Boyer Moore algorithm implementation.
void strings::boyer_moore::init_bad_char | ( | const std::string & | str, |
std::vector< size_t > & | arg ) |
A function that preprocess the bad char table.
str | The string being preprocessed |
arg | The bad char table |
void strings::boyer_moore::init_good_suffix | ( | const std::string & | str, |
std::vector< size_t > & | arg ) |
A function that preprocess the good suffix thable.
str | The string being preprocessed |
arg | The good suffix table |
void strings::boyer_moore::init_pattern | ( | const std::string & | str, |
pattern & | arg ) |
A function that initializes pattern.
str | Text used for initialization |
arg | Initialized structure |
bool strings::boyer_moore::is_prefix | ( | const char * | str, |
const char * | pat, | ||
size_t | len ) |
Check if pat is prefix of str.
str | pointer to some part of the input text. |
pat | the searched pattern. |
len | length of the searched pattern |
true
if pat IS prefix of str. false
if pat is NOT a prefix of str. std::vector< size_t > strings::boyer_moore::search | ( | const std::string & | str, |
const pattern & | arg ) |
A function that implements Boyer-Moore's algorithm.
str | Text we are seatching in. |
arg | pattern structure containing the preprocessed pattern |