|  | Home | Libraries | People | FAQ | More | 
boost::compute::set_intersection — Set intersection algorithm.
// In header: <boost/compute/algorithm/set_intersection.hpp> template<typename InputIterator1, typename InputIterator2, typename OutputIterator> OutputIterator set_intersection(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result, command_queue & queue = system::default_queue());
Finds the intersection of the sorted range [first1, last1) with the sorted range [first2, last2) and stores it in range starting at result
| Parameters: | 
 | ||||||||||||
| Returns: | Iterator pointing to end of intersection |