...one of the most highly
regarded and expertly designed C++ library projects in the
world.
— Herb Sutter and Andrei
Alexandrescu, C++
Coding Standards
boost::compute::search_n — Substring matching algorithm.
// In header: <boost/compute/algorithm/search_n.hpp> template<typename TextIterator, typename ValueType> TextIterator search_n(TextIterator t_first, TextIterator t_last, size_t n, ValueType value, command_queue & queue = system::default_queue());
Searches for the first occurrence of n consecutive occurrences of value in text [t_first, t_last).
Space complexity: \Omega(distance(t_first
, t_last
))
Parameters: |
|
||||||||||
Returns: |
Iterator pointing to beginning of first occurrence |