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::emplace()
This function is used to insert a new element into the set container, only if the element to be inserted is unique and does not already exists in the set.
Syntax :
setname.emplace(value)
Parameters :
The element to be inserted into the set
is passed as the parameter.
Result :
The parameter is added to the set if
the set does not contain that element already.
Examples:
Input : myset{1, 2, 3, 4, 5};
myset.emplace(6);
Output : myset = 1, 2, 3, 4, 5, 6
Input : myset{1, 2, 3, 4, 5};
myset.emplace(4);
Output : myset = 1, 2, 3, 4, 5
Errors and Exceptions
1. It has a strong exception guarantee, therefore, no changes are made if an exception is thrown
2. Parameter should be of the same type as that of the container otherwise, an error is thrown
#include <iostream>
#include <set>
using namespace std;
int main()
{
set< int > myset{};
myset.emplace(2);
myset.emplace(6);
myset.emplace(8);
myset.emplace(9);
myset.emplace(0);
myset.emplace(5);
myset.emplace(2);
for ( auto it = myset.begin();
it != myset.end(); ++it)
cout << ' ' << *it;
return 0;
}
|
Output:
0 2 5 6 8 9
#include <iostream>
#include <set>
#include <string>
using namespace std;
int main()
{
set<string> myset{};
myset.emplace( "This" );
myset.emplace( "is" );
myset.emplace( "a" );
myset.emplace( "computer science" );
myset.emplace( "portal" );
myset.emplace( "GeeksForGeeks" );
myset.emplace( "is" );
for ( auto it = myset.begin();
it != myset.end(); ++it)
cout << ' ' << *it;
return 0;
}
|
Output:
GeeksForGeeks This a computer science is portal
Time Complexity : O(logn)
Application
Input an empty multi set with the following numbers and order using emplace() function and find sum of elements.
Input : 7, 9, 4, 6, 2, 5, 3
Output : 36
#include <iostream>
#include <set>
using namespace std;
int main()
{
int sum = 0;
set< int > myset{};
myset.emplace(7);
myset.emplace(9);
myset.emplace(4);
myset.emplace(6);
myset.emplace(2);
myset.emplace(5);
myset.emplace(3);
set< int >::iterator it;
while (!myset.empty()) {
it = myset.begin();
sum = sum + *it;
myset.erase(it);
}
cout << sum;
return 0;
}
|
Output :
36
emplace() vs insert
When we use insert, we create an object and then insert it into the multiset. With emplace(), the object is constructed in-place.
#include<bits/stdc++.h>
using namespace std;
int main()
{
set<pair< char , int >> ms;
ms.emplace( 'a' , 24);
ms.insert(make_pair( 'b' , 25));
for ( auto it = ms.begin(); it != ms.end(); ++it)
cout << " " << (*it).first << " "
<< (*it).second << endl;
return 0;
}
|
Output :
a 24
b 25
Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape,
GeeksforGeeks Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've already empowered, and we're here to do the same for you. Don't miss out -
check it out now!
Last Updated :
23 Jan, 2018
Like Article
Save Article