std::set_intersection
From Cppreference
| Defined in header <algorithm>
|
||
| template< class InputIterator1, class InputIterator2, class OutputIterator >
OutputIterator set_intersection( InputIterator1 first1, InputIterator1 last1, |
(1) | |
| template< class InputIterator1, class InputIterator2,
class OutputIterator, class Compare > |
(2) | |
Constructs a sorted range beginning at d_first consisting of elements that are found in both sorted ranges [first1, last1) and [first2, last2). The first version expects both input ranges to be sorted with operator<, the second version expects them to be sorted with the given comparison function comp. If some element is found m times in [first1, last1) and n times in [first2, last2), the first std::min(m, n) elements will be copied from the first range to the destination range. The order of equivalent elements is preserved. The resulting range cannot overlap with either of the input ranges.
Contents |
[edit] Parameters
| first1, last1 | - | the first range of elements to examine | |||||||||
| first2, last2 | - | the second range of elements to examine | |||||||||
| comp | - | comparison function which returns true if the first argument is less than the second. The signature of the comparison function should be equivalent to the following:
The signature does not need to have const &, but the function must not modify the objects passed to it. |
|||||||||
[edit] Return value
Iterator past the end of the constructed range.
[edit] Complexity
At most 2·(N1+N2-1) comparisons, where N1 = std::distance(first1, last1) and N2 = std::distance(first2, last2).
[edit] Equivalent function
| First version |
|---|
template<class InputIterator1, class InputIterator2, class OutputIterator> OutputIterator set_intersection(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator d_first) { while (first1 != last1 && first2 != last2) { if (*first1 < *first2) { ++first1; } else { if (!(*first2 < *first1)) { *d_first++ = *first1++; } ++first2; } } return d_first; } |
| Second version |
template<class InputIterator1, class InputIterator2, class OutputIterator, class Compare> OutputIterator set_intersection(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator d_first, Compare comp) { while (first1 != last1 && first2 != last2) { if (comp(*first1, *first2)) { ++first1; } else { if (!comp(*first2, *first1)) { *d_first++ = *first1++; } ++first2; } } return d_first; } |
[edit] Example
| This section is incomplete |
[edit] See also
|
computes the union of two sets (function template) |
|