std::set_symmetric_difference
De cppreference.com
 [] |
This page has been machine-translated from the English version of the wiki using Google Translate.
The translation may contain errors and awkward wording. Hover over text to see the original version. You can help to fix errors and improve the translation. For instructions click here. |
![[]](https://upload.cppreference.com/mwiki/images/3/31/Imbox_notice.png){kind=link}
<metanoindex/>
<tbody> </tbody>| Dclar dans l'en-tte <algorithm>
|
||
template< class InputIt1, class InputIt2, class OutputIt > OutputIt set_symmetric_difference( InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt d_first ); |
(1) | |
template< class InputIt1, class InputIt2, class OutputIt, class Compare > OutputIt set_symmetric_difference( InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt d_first, Compare comp ); |
(2) | |
Copie les lments de la gamme
[first1, last1) tris qui ne se trouvent pas dans la gamme [first2, last2) tris et les lments de la gamme [first2, last2) tris qui ne se trouvent pas dans la gamme [first1, last1) tris au dbut plage d_first. La plage rsultante est galement trie. La premire version prvoit la fois d'entre se situe trier avec operator<, la deuxime version s'attend ce qu'ils soient tris la comp fonction de comparaison donne. Si un lment est trouv m fois en [first1, last1) et n fois dans [first2, last2), il sera copi dans d_first exactement std::abs(m-n) fois. Si m>n, le m-n dernier de ces lments sont copis partir [first1,last1), sinon les lments n-m derniers sont copis partir [first2,last2). La gamme rsultante ne peut pas faire double emploi avec l'une des plages d'entre .Original:
Copies the elements from the sorted range
[first1, last1) which are not found in the sorted range [first2, last2) and the elements from the sorted range [first2, last2) which are not found in the sorted range [first1, last1) to the range beginning at d_first. The resulting range is also sorted. 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), it will be copied to d_first exactly std::abs(m-n) times. If m>n, then the last m-n of those elements are copied from [first1,last1), otherwise the last n-m elements are copied from [first2,last2). The resulting range cannot overlap with either of the input ranges.The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
Paramtres
| first1, last1 | - | la premire gamme d'lments tris
Original: the first sorted range of elements The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
| first2, last2 | - | la seconde plage d'lments tris
Original: the second sorted range of elements The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
| 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 |
| Type requirements | ||
-InputIt1 must meet the requirements of InputIterator.
| ||
-InputIt2 must meet the requirements of InputIterator.
| ||
-OutputIt must meet the requirements of OutputIterator.
| ||
Retourne la valeur
Iterator-del de la fin de la gamme construit .
Original:
Iterator past the end of the constructed range.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
Complexit
A comparaisons plupart 2·(N1+N2-1), o N1
= std::distance(first1, last1) et N2 = std::distance(first2, last2) .Original:
At most 2·(N1+N2-1) comparisons, where N1
= std::distance(first1, last1) and N2 = std::distance(first2, last2).The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
Mise en uvre possible
| First version |
|---|
template<class InputIt1, class InputIt2, class OutputIt>
OutputIt set_difference(InputIt1 first1, InputIt1 last1,
InputIt2 first2, InputIt2 last2,
OutputIt d_first)
{
while (first1 != last1) {
if (first2 == last2) return std::copy(first1, last1, d_first);
if (*first1 < *first2) {
*d_first++ = *first1++;
} else {
if (*first2 < *first1) {
*d_first++ = *first2;
} else {
++first1;
}
++first2;
}
}
return std::copy(first2, last2, d_first);
}
|
| Second version |
template<class InputIt1, class InputIt2,
class OutputIt, class Compare>
OutputIt set_difference(InputIt1 first1, InputIt1 last1,
InputIt2 first2, InputIt2 last2,
OutputIt d_first, Compare comp)
{
while (first1 != last1) {
if (first2 == last2) return std::copy(first1, last1, d_first);
if (comp(*first1, *first2)) {
*d_first++ = *first1++;
} else {
if (comp(*first2, *first1)) {
*d_first++ = *first2;
} else {
++first1;
}
++first2;
}
}
return std::copy(first2, last2, d_first);
}
|
Exemple
#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
int main()
{
std::vector<int> v1{1,2,3,4,5,6,7,8 };
std::vector<int> v2{ 5, 7, 9,10};
std::sort(v1.begin(), v1.end());
std::sort(v2.begin(), v2.end());
std::vector<int> v_intersection;
std::set_symmetric_difference(
v1.begin(), v1.end(),
v2.begin(), v2.end(),
std::back_inserter(v_intersection));
for(int n : v_intersection)
std::cout << n << ' ';
}
Rsultat :
1 2 3 4 6 8 9 10
Voir aussi
retourne vrai si un ensemble est un sous-ensemble de l'autre Original: returns true if one set is a subset of another The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (fonction gnrique) | |
calcule la diffrence entre deux ensembles Original: computes the difference between two sets The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (fonction gnrique) | |
calcule l'union de deux ensembles Original: computes the union of two sets The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (fonction gnrique) | |
calcule l'intersection des deux ensembles Original: computes the intersection of two sets The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (fonction gnrique) | |