tmp/tmper5v4rf8/{from.md → to.md}
RENAMED
|
@@ -5,26 +5,40 @@ template<class InputIterator1, class InputIterator2,
|
|
| 5 |
class OutputIterator>
|
| 6 |
OutputIterator
|
| 7 |
set_intersection(InputIterator1 first1, InputIterator1 last1,
|
| 8 |
InputIterator2 first2, InputIterator2 last2,
|
| 9 |
OutputIterator result);
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 10 |
|
| 11 |
template<class InputIterator1, class InputIterator2,
|
| 12 |
class OutputIterator, class Compare>
|
| 13 |
OutputIterator
|
| 14 |
set_intersection(InputIterator1 first1, InputIterator1 last1,
|
| 15 |
InputIterator2 first2, InputIterator2 last2,
|
| 16 |
OutputIterator result, Compare comp);
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 17 |
```
|
| 18 |
|
|
|
|
|
|
|
|
|
|
| 19 |
*Effects:* Constructs a sorted intersection of the elements from the two
|
| 20 |
ranges; that is, the set of elements that are present in both of the
|
| 21 |
ranges.
|
| 22 |
|
| 23 |
-
*Requires:* The resulting range shall not overlap with either of the
|
| 24 |
-
original ranges.
|
| 25 |
-
|
| 26 |
*Returns:* The end of the constructed range.
|
| 27 |
|
| 28 |
*Complexity:* At most `2 * ((last1 - first1) + (last2 - first2)) - 1`
|
| 29 |
comparisons.
|
| 30 |
|
|
|
|
| 5 |
class OutputIterator>
|
| 6 |
OutputIterator
|
| 7 |
set_intersection(InputIterator1 first1, InputIterator1 last1,
|
| 8 |
InputIterator2 first2, InputIterator2 last2,
|
| 9 |
OutputIterator result);
|
| 10 |
+
template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2,
|
| 11 |
+
class ForwardIterator>
|
| 12 |
+
ForwardIterator
|
| 13 |
+
set_intersection(ExecutionPolicy&& exec,
|
| 14 |
+
ForwardIterator1 first1, ForwardIterator1 last1,
|
| 15 |
+
ForwardIterator2 first2, ForwardIterator2 last2,
|
| 16 |
+
ForwardIterator result);
|
| 17 |
|
| 18 |
template<class InputIterator1, class InputIterator2,
|
| 19 |
class OutputIterator, class Compare>
|
| 20 |
OutputIterator
|
| 21 |
set_intersection(InputIterator1 first1, InputIterator1 last1,
|
| 22 |
InputIterator2 first2, InputIterator2 last2,
|
| 23 |
OutputIterator result, Compare comp);
|
| 24 |
+
template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2,
|
| 25 |
+
class ForwardIterator, class Compare>
|
| 26 |
+
ForwardIterator
|
| 27 |
+
set_intersection(ExecutionPolicy&& exec,
|
| 28 |
+
ForwardIterator1 first1, ForwardIterator1 last1,
|
| 29 |
+
ForwardIterator2 first2, ForwardIterator2 last2,
|
| 30 |
+
ForwardIterator result, Compare comp);
|
| 31 |
```
|
| 32 |
|
| 33 |
+
*Requires:* The resulting range shall not overlap with either of the
|
| 34 |
+
original ranges.
|
| 35 |
+
|
| 36 |
*Effects:* Constructs a sorted intersection of the elements from the two
|
| 37 |
ranges; that is, the set of elements that are present in both of the
|
| 38 |
ranges.
|
| 39 |
|
|
|
|
|
|
|
|
|
|
| 40 |
*Returns:* The end of the constructed range.
|
| 41 |
|
| 42 |
*Complexity:* At most `2 * ((last1 - first1) + (last2 - first2)) - 1`
|
| 43 |
comparisons.
|
| 44 |
|