Place all elements that are not in both sequences into result , in their sorted order. Return an iterator positioned immediately after the end of the new sequence. The result is undefined if the two input sequences overlap. The first version assumes that both sequences are already sorted using operator< , whereas the second version assumes that both sequences are already sorted using the binary function compare .

Declaration


  
#include <algorithm>

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 compare
  );

Complexity

Time complexity is linear. Space complexity is constant.

Example <ospace/osstd/examples/setsymd0.cpp>


    #include <iostream>
#include <algorithm>

int v1[ 3 ] = { 13, 18, 23 };
int v2[ 4 ] = { 10, 13, 17, 23 };
int result[ 4 ] = { 0, 0, 0, 0 };

void
main()
  {
  set_symmetric_difference
    (
    v1,
    v1 + 3,
    v2,
    v2 + 4,
    result
    );

  for ( int i = 0; i < 4; ++i )
    cout << result[ i ] << ` `;
  cout << "\n";
  }

10 17 18 0

Example <ospace/osstd/examples/setsymd1.cpp>


    #include <iostream>
#include <algorithm>
#include <iterator>
#include <vector>

void
main()
  {
  vector< int > v1( 10 );
  vector< int > v2( 10 );
  for ( int i = 0; i < v1.size(); ++i )
    {
    v1[ i ] = i;
    v2[ i ] = 7 + i;
    }
  ostream_iterator< int > iter( cout, " " );
  cout << "v1: ";
  copy( v1.begin(), v1.end(), iter );
  cout << "\nv2: ";
  copy( v2.begin(), v2.end(), iter );
  cout << "\n";

  set_symmetric_difference
    (
    v1.begin(),
    v1.end(),
    v2.begin(),
    v2.end(),
    iter
    );

  cout << "\n";
  }

v1: 0 1 2 3 4 5 6 7 8 9
v2: 7 8 9 10 11 12 13 14 15 16
0 1 2 3 4 5 6 10 11 12 13 14 15 16

Example <ospace/osstd/examples/setsymd2.cpp>


    #include <iostream>
#include <string.h>
#include <algorithm>
#include <functional>
#include <iterator>

char* word1 = "ABCDEFGHIJKLMNO";
char* word2 = "LMNOPQRSTUVWXYZ";

void
main()
  {
  ostream_iterator< char > iter( cout, " " );
  cout << "word1: ";
  copy( word1, word1 + ::strlen( word1 ), iter );
  cout << "\nword2: ";
  copy( word2, word2 + ::strlen( word2 ), iter );
  cout << "\n";

  set_symmetric_difference
    (
    word1,
    word1 + ::strlen( word1 ),
    word2,
    word2 + ::strlen( word2 ),
    iter,
    less< char >()
    );

  cout << "\n";
  }

word1: A B C D E F G H I J K L M N O
word2: L M N O P Q R S T U V W X Y Z
A B C D E F G H I J K P Q R S T U V W X Y Z

set_symmetric_difference

Library

Declaration

Complexity

Example <ospace/osstd/examples/setsymd0.cpp>

Example <ospace/osstd/examples/setsymd1.cpp>

Example <ospace/osstd/examples/setsymd2.cpp>