Click here to Skip to main content
Rate this: bad
Please Sign up or sign in to vote.
See more: C++ATLWTLSTL
How to compute difference and intersection of two sets?
There are functions set_difference and set_intersection which requires two pairs of iterators of source sets and output iterator of resulting set. Here, set can be any sorted container with incrementable iterator. There is another requirement that the output should be large enough to contain the destination range.
For STL-set, however, you cannot set the size of it and using an empty set as output leads to assertion. In fact, output iterator of destination empty set is equal to end() and incrementing iterator does not add elements to a set.
So how to compute this?
Posted 21-Apr-09 23:03pm

1 solution

Rate this: bad
Please Sign up or sign in to vote.

Solution 1

Use std::inserter[^] or std::back_inserter[^] for the output iterator. That causes the items to be inserted into the container without having to know what size it should be before you've constructed it.

If you're using a vector or list as the output, I'd use std::back_inserter. For a set, std::inserter is required. Here's an example:

#include <span class="code-keyword"><vector></span>
#include <span class="code-keyword"><set></span>
#include <span class="code-keyword"><iostream></span>
#include <span class="code-keyword"><algorithm></span>
#include <span class="code-keyword"><iterator></span>

int main()
   std::set<int> a, b, c;
   std::vector<int> d;

   std::set_intersection(a.begin(), a.end(), b.begin(), b.end(), std::inserter(c, c.end()));
   std::set_intersection(a.begin(), a.end(), b.begin(), b.end(), std::back_inserter(d));
   std::copy(c.begin(), c.end(), std::ostream_iterator<int>(std::cout, " "));
   std::copy(d.begin(), d.end(), std::ostream_iterator<int>(std::cout, " "));

  Print Answers RSS
0 Sergey Alexandrovich Kryukov 668
1 OriginalGriff 396
2 Tadit Dash 345
3 sanket saxena 329
4 Peter Leow 193
0 Sergey Alexandrovich Kryukov 12,109
1 OriginalGriff 7,326
2 Peter Leow 5,013
3 Abhinav S 4,013
4 Maciej Los 3,575

Advertise | Privacy | Mobile
Web03 | 2.8.140421.2 | Last Updated 22 Apr 2009
Copyright © CodeProject, 1999-2014
All Rights Reserved. Terms of Use
Layout: fixed | fluid