Speeding up Pattern Searches with Boyer-Moore Algorithm from C++17--Bartlomiej Filipek

Interested?

Speeding up Pattern Searches with Boyer-Moore Algorithm from C++17

by Bartlomiej Filipek

From the article:

With C++17, you can now use more sophisticated algorithms for pattern searches! You’ll have more control and a promising performance boost for many use cases. This article shows primary usage and runs a benchmark comparing the new techniques.

May 2022 Updates: added notes about C++20 and constexpr algorithms, updated the benchmark and compared against std::ranges::search and custom strchr versions.

Add a Comment

You must sign in or register to add a comment.

Comments (0)

There are currently no comments on this entry.