Login | Register   
LinkedIn
Google+
Twitter
RSS Feed
Download our iPhone app
TODAY'S HEADLINES  |   ARTICLE ARCHIVE  |   FORUMS  |   TIP BANK
Browse DevX
Sign up for e-mail newsletters from DevX


Tip of the Day
Language: C++
Expertise: Intermediate
Aug 2, 2005

Retrieving Only Unique Elements from Two Sets

This algorithm helps you to retrieve all the elements contained in the first set (set1), but not in the second (set2).

Here's the template:


template<class T>
void Diff(const T& set1, const T& set2, T& res) {
    T temp;
    typename T::const_iterator it = set1.begin();
    if (&set1 == &set2)
        return;
    else {
        while (it != set1.end()) {
            if (set2.find(*it) == set2.end())  // element not found
                temp.insert(*it);
            ++i;
        }
    }
    temp.swap(result);
}
Mykola Rozhok
 
Comment and Contribute

 

 

 

 

 


(Maximum characters: 1200). You have 1200 characters left.

 

 

Sitemap