Click here to Skip to main content
12,695,739 members (34,073 online)
Rate this:
Please Sign up or sign in to vote.
See more: C++ ATL WTL STL
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 22-Apr-09 0:03am

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>

  Print Answers RSS
Top Experts
Last 24hrsThis month

Advertise | Privacy | Mobile
Web02 | 2.8.170118.1 | Last Updated 22 Apr 2009
Copyright © CodeProject, 1999-2017
All Rights Reserved. Terms of Service
Layout: fixed | fluid

CodeProject, 503-250 Ferrand Drive Toronto Ontario, M3C 3G8 Canada +1 416-849-8900 x 100