|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Functions | |
| Array< size_t > | all_match_positions (const size_t text_size) |
| Generate an array of all positions from 0 to text_size. | |
| bool | find_unused_delimiter (const std::string_view a, const std::string_view b, char &delimiter) |
| Find a character not present in either string. | |
| bool | equals_at (const std::string_view text, const std::string_view pattern, const size_t pos) |
| Check if pattern matches text at given position. | |
Generate an array of all positions from 0 to text_size.
| [in] | text_size | The size of the text. |
Definition at line 72 of file String_Search.H.
References Aleph::divide_and_conquer_partition_dp(), and Aleph::Array< T >::reserve().
Referenced by Aleph::boyer_moore_horspool_search(), Aleph::kmp_search(), Aleph::rabin_karp_search(), and Aleph::z_search().
|
inline |
Check if pattern matches text at given position.
| [in] | text | The text to search in. |
| [in] | pattern | The pattern to match. |
| [in] | pos | The position in text to check. |
Definition at line 117 of file String_Search.H.
References Aleph::divide_and_conquer_partition_dp().
Referenced by Aleph::rabin_karp_search().
|
inline |
Find a character not present in either string.
| [in] | a | First string. |
| [in] | b | Second string. |
| [out] | delimiter | The unused character found. |
Definition at line 88 of file String_Search.H.
References Aleph::divide_and_conquer_partition_dp().
Referenced by Aleph::z_search().