STL-set difference and intersection
-
How to compute difference and intersection of two sets? There are functions
set_differenceandset_intersectionwhich 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 toend()and incrementing iterator does not add elements to a set. So how to compute this? -
How to compute difference and intersection of two sets? There are functions
set_differenceandset_intersectionwhich 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 toend()and incrementing iterator does not add elements to a set. So how to compute this?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 <vector>
#include <set>
#include <iostream>
#include <algorithm>
#include <iterator>int main()
{
std::set<int> a, b, c;
a.insert(1);
a.insert(2);
a.insert(3);
a.insert(4);
b.insert(2);
b.insert(4);
b.insert(5);
b.insert(7);
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, " "));
}Java, Basic, who cares - it's all a bunch of tree-hugging hippy cr*p
-
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 <vector>
#include <set>
#include <iostream>
#include <algorithm>
#include <iterator>int main()
{
std::set<int> a, b, c;
a.insert(1);
a.insert(2);
a.insert(3);
a.insert(4);
b.insert(2);
b.insert(4);
b.insert(5);
b.insert(7);
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, " "));
}Java, Basic, who cares - it's all a bunch of tree-hugging hippy cr*p