boost::text::boyer_moore_horspool_collation_searcher
// In header: <boost/text/collation_search.hpp> template<code_point_iter I, std::sentinel_for< I > S, searcher_break_func< I, S > BreakFunc> struct boyer_moore_horspool_collation_searcher { // construct/copy/destruct boyer_moore_horspool_collation_searcher(I, S, BreakFunc, collation_table const &, collation_strength = collation_strength::tertiary, case_level = case_level::off, variable_weighting = variable_weighting::non_ignorable); // public member functions template<code_point_iter I2, std::sentinel_for< I2 > S2> utf32_view< I2 > operator()(I2, S2) const; };
A searcher for use with the collation_search() algorithm. This searcher uses the Boyer-Moore-Horspool matching algorithm.
boyer_moore_horspool_collation_searcher
public
construct/copy/destructboyer_moore_horspool_collation_searcher(I pattern_first, S pattern_last, BreakFunc break_fn, collation_table const & table, collation_strength strength = collation_strength::tertiary, case_level case_lvl = case_level::off, variable_weighting weighting = variable_weighting::non_ignorable);
Constructs a boyer_moore_horspool_collation_searcher
from a sequence of code points to find, a break function to use to determine which code points are acceptable match boundaries, and a collation table with collation configuration settings. Consider using make_boyer_moore_horspool_collation_searcher() instead of using this constructor directly.
boyer_moore_horspool_collation_searcher
public member functionstemplate<code_point_iter I2, std::sentinel_for< I2 > S2> utf32_view< I2 > operator()(I2 first, S2 last) const;
Returns a code point range indicating the matching subsequence within [first, last)
in which this searcher's pattern was found. The range will be empty if no match exists.