Boyer-Moore search algorithm.
More...
Go to the source code of this file.
|
bm_fwd_table_t * | bm_memmem_study (char const *needle, size_t nlen) |
| Build case-sensitive forward skip table bm_fwd_table_t for Boyer-Moore algorithm.
|
|
char * | bm_memmem (char const *haystack, size_t hlen, char const *needle, size_t nlen, bm_fwd_table_t *fwd) |
| Search for a substring using Boyer-Moore algorithm.
|
|
bm_fwd_table_t * | bm_memcasemem_study (char const *needle, size_t) |
| Build case-insensitive forward skip table for Boyer-Moore algorithm.
|
|
char * | bm_memcasemem (char const *haystack, size_t hlen, char const *needle, size_t nlen, bm_fwd_table_t *fwd) |
| Search for substring using Boyer-Moore algorithm.
|
|
Boyer-Moore search algorithm.
- Author
- Pekka.nosp@m..Pes.nosp@m.si@no.nosp@m.kia..nosp@m.com
- Date
- Created: Mon Apr 11 17:03:13 2005 ppessi