Union of two sorted ranges
The union of two sets is formed by the elements that are present in either one of the sets, or in both. Elements from the second range that have an equivalent element in the first range are not copied to the resulting range.
The elements are compared using operator< for the first version, and comp for the second. Two elements, a and b are considered equivalent if (!(a<b) && !(b<a)) or if (!comp(a, b) && !comp(b, a)).
The elements in the ranges shall already be ordered.
1. Using default operator < :
Template :
OutputIterator set_union (InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
OutputIterator result);
Parameters :
first1, last1
Input iterators to the initial and final positions of the first
sorted sequence. The range used is [first1, last1], which contains
all the elements between first1 and last1, including the element
pointed by first1 but not the element pointed by last1.
first2, last2
Input iterators to the initial and final positions of the second
sorted sequence. The range used is [first2, last2].
result
Output iterator to the initial position of the range where the
resulting sequence is stored.
comp
Binary function that accepts two arguments of the types pointed by
the input iterators, and returns a value convertible to bool.
The function shall not modify any of its arguments.
This can either be a function pointer or a function object.
The ranges shall not overlap.
CPP
// CPP program to illustrate
// std :: set_union
#include <algorithm> // std::set_union, std::sort
#include <iostream> // std::cout
#include <vector> // std::vector
// Driver code
int main()
{
int first[] = { 5, 10, 15, 20, 25 };
int second[] = { 50, 40, 30, 20, 10 };
int n = sizeof(first) / sizeof(first[0]);
// Print first array
std::cout << "First array contains :";
for (int i = 0; i < n; i++)
std::cout << " " << first[i];
std::cout << "\n";
// Print second array
std::cout << "Second array contains :";
for (int i = 0; i < n; i++)
std::cout << " " << second[i];
std::cout << "\n\n";
std::vector<int> v(10);
std::vector<int>::iterator it, st;
std::sort(first, first + n);
std::sort(second, second + n);
// Using default function
it = std::set_union(first, first + n, second,
second + n, v.begin());
std::cout << "The union has " << (it - v.begin())
<< " elements:\n";
for (st = v.begin(); st != it; ++st)
std::cout << ' ' << *st;
std::cout << '\n';
return 0;
}
OutputFirst array contains : 5 10 15 20 25
Second array contains : 50 40 30 20 10
The union has 8 elements:
5 10 15 20 25 30 40 50
2. Using custom function :
Syntax :
Template :
OutputIterator set_union (InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
OutputIterator result, Compare comp);
Parameters :
first1, last1, first2, last2, result are same as above.
comp
Binary function that accepts two arguments of the types pointed by
the input iterators, and returns a value convertible to bool.
The function shall not modify any of its arguments.
This can either be a function pointer or a function object.
The ranges shall not overlap.
CPP
// CPP program to demonstrate use of
// std :: set_symmetric_difference
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
bool comp(const string& a, const string& b) {
if (a.size() != b.size()) return false;
for (int i = 0; i < a.size(); i++) {
if ( tolower(a[i]) != tolower(b[i]) ) {
return false;
}
}
return true;
}
// Driver code
int main()
{
string first[] = { "Sachin", "Rakesh",
"Sandeep", "Serena" };
string second[] = { "vaibhav", "sandeep",
"rakesh", "neha" };
int n = sizeof(first) / sizeof(first[0]);
// Print students of first list
cout << "Students in first subject :";
for (int i = 0; i < n; i++)
cout << " " << first[i];
cout << "\n";
// Print students of second list
cout << "Students in second subject :";
for (int i = 0; i < n; i++)
cout << " " << second[i];
cout << "\n\n";
vector<string> v(10);
vector<string>::iterator it, st;
// Sorting both the list
sort(first, first + n);
sort(second, second + n);
// Using default operator<
it = set_union(first, first + n, second,
second + n, v.begin(), comp);
cout << "Students attending both subjects are :\n";
for (st = v.begin(); st != it; ++st)
cout << ' ' << *st;
cout << '\n';
return 0;
}
OutputStudents in first subject : Sachin Rakesh Sandeep Serena
Students in second subject : Vaibhav Sandeep Rakesh Neha
Students attending both subjects are :
Neha Rakesh Sachin Sandeep Serena Vaibhav
Possible Application : It is used to find the elements that are present in either one container or in both containers.
1. It can be used to find the list of all the students that are attending both subjects.
CPP
// CPP program to demonstrate use of
// std :: set_symmetric_difference
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
// Driver code
int main()
{
string first[] = { "John", "Bob", "Mary", "Serena" };
string second[] = { "Jim", "Mary", "John", "Bob" };
int n = sizeof(first) / sizeof(first[0]);
// Print students of first list
cout << "Students in first subject :";
for (int i = 0; i < n; i++)
cout << " " << first[i];
cout << "\n";
// Print students of second list
cout << "Students in second subject :";
for (int i = 0; i < n; i++)
cout << " " << second[i];
cout << "\n\n";
vector<string> v(10);
vector<string>::iterator it, st;
// Sorting both the list
sort(first, first + n);
sort(second, second + n);
// Using default operator<
it = set_union(first, first + n, second, second + n,
v.begin());
cout << "Students attending both subjects are :\n";
for (st = v.begin(); st != it; ++st)
cout << ' ' << *st;
cout << '\n';
return 0;
}
OutputStudents in first subject : John Bob Mary Serena
Students in second subject : Jim Mary John Bob
Students attending both subjects are :
Bob Jim John Mary Serena
2. It can also be use to find union of two sets.
Program is given above.
Similar Reads
std is_union() template in C++ The std::is_union template of C++ STL is used to check whether the given type is union or not. It returns a boolean value showing the same. Syntax: template <class T> struct is_union; Parameter: This template accepts single parameter T (Trait class) to check whether T is a union or not. Return
2 min read
Set in C++ STL In C++, sets are associative container which stores unique elements in some sorted order. By default, it is sorted ascending order of the keys, but this can be changed as per requirement. It provides fast insertion, deletion and search operations.Example: C++#include <iostream> #include <se
7 min read
Unordered Sets in C++ STL In C++, unordered_set is an unordered associative container that stores unique elements. Unlike set, it stores its elements using hashing. This provides average constant-time O(1) search, insert, and delete operations but the elements are not sorted in any particular order.Example:C++#include <io
6 min read
set::swap() in C++ STL Sets are a type of associative containers in which each element has to be unique, because the value of the element identifies it. The value of the element cannot be modified once it is added to the set, though it is possible to remove and add the modified value of that element. set::swap() This func
2 min read
unordered_set end() in C++ STL The unordered_set::end() function is a built-in function in C++ STL which returns an iterator pointing to the past-the-end-element. This iterator does not directly point to an element, rather it points to the location just after the last element. Syntax umap_name.end() or, umap_name.end(int i) Param
2 min read
Unordered Multiset in C++ STL In C++, unordered multiset is an unordered associative container that works similarly to an unordered set, but it can store multiple copies of the same value. It provides fast insert, delete and search operations using hashing, but the elements are not in any particular order.Example: C++#include
7 min read