| Home | Libraries | People | FAQ | More

## Function template set_intersection

boost::compute::set_intersection — Set intersection algorithm.

## Synopsis

    // 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());

## Description

Finds the intersection of the sorted range [first1, last1) with the sorted range [first2, last2) and stores it in range starting at result Space complexity: \Omega(2(distance(`first1`, `last1`) + distance(`first2`, `last2`)))

Parameters: |
`first1` | Iterator pointing to start of first set
`first2` | Iterator pointing to start of second set
`last1` | Iterator pointing to end of first set
`last2` | Iterator pointing to end of second set
`queue` | Queue on which to execute
`result` | Iterator pointing to start of range in which the intersection will be stored
Returns: | Iterator pointing to end of intersection