
- C++ Basics
- C++ Home
- C++ Overview
- C++ Environment Setup
- C++ Basic Syntax
- C++ Comments
- C++ Data Types
- C++ Variable Types
- C++ Variable Scope
- C++ Constants/Literals
- C++ Modifier Types
- C++ Storage Classes
- C++ Operators
- C++ Loop Types
- C++ Decision Making
- C++ Functions
- C++ Numbers
- C++ Arrays
- C++ Strings
- C++ Pointers
- C++ References
- C++ Date & Time
- C++ Basic Input/Output
- C++ Data Structures
- C++ Object Oriented
- C++ Classes & Objects
- C++ Inheritance
- C++ Overloading
- C++ Polymorphism
- C++ Abstraction
- C++ Encapsulation
- C++ Interfaces
emplace vs insert in C++ STL
emplace operation avoids unnecessary copy of object and does the insertion more efficiently than insert operation. Insert operation takes a reference to an object.
Algorithm
Begin Declare set. Use emplace() to insert pair. Use insert() to insert pair by using emplace(). Print the set. End
Example Code
#include<bits/stdc++.h> using namespace std; int main() { set<pair<int, char>> s; s.emplace(7, 'a'); s.insert(make_pair(6, 'b')); for (auto it = s.begin(); it != s.end(); ++it) cout << " " << (*it).first << " " << (*it).second << endl; return 0; }
Output
7 a 6 b
- Related Articles
- queue::emplace() in C++ STL
- map emplace() in C++ STL
- multimap::emplace() in C++ STL
- stack emplace() in C++ STL
- list emplace() function in C++ STL
- list insert( ) in C++ STL
- Set insert() in C++ STL
- map insert() in C++ STL
- multimap insert() in C++ STL
- multiset insert() function in C++ STL
- vector insert() function in C++ STL
- Set vs Map in C++ STL
- set vs unordered_set in C++ STL(3)
- How to insert elements in C++ STL List?
- C++ program to insert delete and find from set STL

Advertisements