tmp/tmp61rya8p8/{from.md → to.md}
RENAMED
|
@@ -5,28 +5,42 @@ template<class InputIterator1, class InputIterator2,
|
|
| 5 |
class OutputIterator>
|
| 6 |
OutputIterator
|
| 7 |
set_symmetric_difference(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_symmetric_difference(InputIterator1 first1, InputIterator1 last1,
|
| 15 |
InputIterator2 first2, InputIterator2 last2,
|
| 16 |
OutputIterator result, Compare comp);
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 17 |
```
|
| 18 |
|
|
|
|
|
|
|
|
|
|
| 19 |
*Effects:* Copies the elements of the range \[`first1`, `last1`) that
|
| 20 |
are not present in the range \[`first2`, `last2`), and the elements of
|
| 21 |
the range \[`first2`, `last2`) that are not present in the range
|
| 22 |
\[`first1`, `last1`) to the range beginning at `result`. The elements in
|
| 23 |
the constructed range are sorted.
|
| 24 |
|
| 25 |
-
*Requires:* The resulting range shall not overlap with either of the
|
| 26 |
-
original ranges.
|
| 27 |
-
|
| 28 |
*Returns:* The end of the constructed range.
|
| 29 |
|
| 30 |
*Complexity:* At most `2 * ((last1 - first1) + (last2 - first2)) - 1`
|
| 31 |
comparisons.
|
| 32 |
|
|
|
|
| 5 |
class OutputIterator>
|
| 6 |
OutputIterator
|
| 7 |
set_symmetric_difference(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_symmetric_difference(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_symmetric_difference(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_symmetric_difference(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:* Copies the elements of the range \[`first1`, `last1`) that
|
| 37 |
are not present in the range \[`first2`, `last2`), and the elements of
|
| 38 |
the range \[`first2`, `last2`) that are not present in the range
|
| 39 |
\[`first1`, `last1`) to the range beginning at `result`. The elements in
|
| 40 |
the constructed range are sorted.
|
| 41 |
|
|
|
|
|
|
|
|
|
|
| 42 |
*Returns:* The end of the constructed range.
|
| 43 |
|
| 44 |
*Complexity:* At most `2 * ((last1 - first1) + (last2 - first2)) - 1`
|
| 45 |
comparisons.
|
| 46 |
|