...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::includes — Includes algorithm.
// In header: <boost/compute/algorithm/includes.hpp> template<typename InputIterator1, typename InputIterator2> bool includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, command_queue & queue = system::default_queue());
Finds if the sorted range [first1, last1) includes the sorted range [first2, last2). In other words, it checks if [first1, last1) is a superset of [first2, last2).
Space complexity: \Omega(distance(first1
, last1
) + distance(first2
, last2
))
Parameters: |
|
||||||||||
Returns: |
True, if [first1, last1) includes [first2, last2). False otherwise. |