Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- j += MAX(bmGs[i], bmBc[y[i + j]] - m + 1 + i);
- #include <algorithm>
- #include <string>
- #include <functional>
- int main()
- {
- std::string haystack = "The quick brown fox jumped over the lazy dog";
- std::string needle = "brown";
- const auto s = std::boyer_moore_searcher<std::string::iterator>(needle.begin(), needle.end());
- const auto it = std::search(haystack.begin(), haystack.end(), s);
- return 0;
- }
Add Comment
Please, Sign In to add comment