...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::adjacent_find
// In header: <boost/compute/algorithm/adjacent_find.hpp> template<typename InputIterator, typename Compare> InputIterator adjacent_find(InputIterator first, InputIterator last, Compare compare, command_queue & queue = system::default_queue()); template<typename InputIterator> InputIterator adjacent_find(InputIterator first, InputIterator last, command_queue & queue = system::default_queue());
Searches the range [first
, last
) for two identical adjacent elements and returns an iterator pointing to the first.
Space complexity: \Omega(1)
See Also:
find(), adjacent_difference()
Parameters: |
|
||||||||
Returns: |
|