Algorithm - set_symmetric_difference()

원형)

//기본형
template <class InputIterator1, class InputIterator2, class OutputIterator>
  OutputIterator set_symmetric_difference (InputIterator1 first1, InputIterator1 last1,
                                           InputIterator2 first2, InputIterator2 last2,
                                           OutputIterator result);
 
//사용자 정의형
template <class InputIterator1, class InputIterator2,
          class OutputIterator, class Compare>
  OutputIterator set_symmetric_difference (InputIterator1 first1, InputIterator1 last1,
                                           InputIterator2 first2, InputIterator2 last2,
                                           OutputIterator result, Compare comp);

의미)

정렬된 [Iterator first1, Iterator last1)사이에 있는 데이터들과 정렬된 [Iterator first2, Iterator last2)사이에 있는 데이터 들의 XOR연산 결과(대칭 차집합 연산 결과)의 데이터들을 정렬하여 Iterator result가 가리키는 위치부터 삽입합니다.

소스)

#include<iostream>
#include<algorithm>
#include<vector>
 
void Print(const std::vector<int>& target)
{
    for (std::vector<int>::const_iterator iterPos = target.cbegin(); iterPos != target.cend(); iterPos++)
        std::cout << *iterPos << " ";
    std::cout << std::endl;
}
 
void main()
{
    std::vector<int> vector = { 10,5,20,15,30 };
    std::vector<int> vector2 = { 1,3,5,7,9,11,13,15 };
    std::vector<int> vectorSymmetric(16);
    std::vector<int>::iterator iter;
 
    std::sort(vector.begin(), vector.end());
    std::sort(vector2.begin(), vector2.end());
    Print(vector);
    Print(vector2);
 
    iter = std::set_symmetric_difference(vector.begin(), vector.end(), vector2.begin(), vector2.end(), vectorSymmetric.begin());
    vectorSymmetric.resize(iter - vectorSymmetric.begin());
    Print(vectorSymmetric);
}

리턴값)

대칭 차집합으로 만들어진 결과들의 가장 마지막을 가리키는 Iterator를 리턴한다.

결과)