...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::find_end — Substring matching algorithm.
// In header: <boost/compute/algorithm/find_end.hpp> template<typename TextIterator, typename PatternIterator> TextIterator find_end(TextIterator t_first, TextIterator t_last, PatternIterator p_first, PatternIterator p_last, command_queue & queue = system::default_queue());
Searches for the last match of the pattern [p_first, p_last) in text [t_first, t_last). Space complexity: \Omega(n)
Parameters: |
|
||||||||||
Returns: |
Iterator pointing to beginning of last occurence |