
- The C Standard Library
- The C Standard Library
- The C++ Standard Library
- C++ Library - Home
- C++ Library - <fstream>
- C++ Library - <iomanip>
- C++ Library - <ios>
- C++ Library - <iosfwd>
- C++ Library - <iostream>
- C++ Library - <istream>
- C++ Library - <ostream>
- C++ Library - <sstream>
- C++ Library - <streambuf>
- C++ Library - <atomic>
- C++ Library - <complex>
- C++ Library - <exception>
- C++ Library - <functional>
- C++ Library - <limits>
- C++ Library - <locale>
- C++ Library - <memory>
- C++ Library - <new>
- C++ Library - <numeric>
- C++ Library - <regex>
- C++ Library - <stdexcept>
- C++ Library - <string>
- C++ Library - <thread>
- C++ Library - <tuple>
- C++ Library - <typeinfo>
- C++ Library - <utility>
- C++ Library - <valarray>
- The C++ STL Library
- C++ Library - <array>
- C++ Library - <bitset>
- C++ Library - <deque>
- C++ Library - <forward_list>
- C++ Library - <list>
- C++ Library - <map>
- C++ Library - <queue>
- C++ Library - <set>
- C++ Library - <stack>
- C++ Library - <unordered_map>
- C++ Library - <unordered_set>
- C++ Library - <vector>
- C++ Library - <algorithm>
- C++ Library - <iterator>
- C++ Programming Resources
- C++ Programming Tutorial
- C++ Useful Resources
- C++ Discussion
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
C++ Unordered_multimap Library - insert() Function
Description
The C++ function std::unordered_multimap::insert() extends container by inserting new element in unordered_multimap. This function increases container size by one.
Declaration
Following is the declaration for std::unordered_multimap::insert() function form std::unordered_map() header.
C++11
iterator insert(const value_type& val);
Parameters
val − value to be inserted.
Return value
Returns an iterator pointing to the newly inserted element.
Time complexity
Constant i.e. O(1) in average case.
Linear i.e. O(n) in worst case.
Example
The following example shows the usage of std::unordered_multimap::insert() function.
#include <iostream> #include <unordered_map> using namespace std; int main(void) { unordered_multimap<char, int> umm = { {'a', 1}, {'b', 2}, {'c', 3}, {'d', 4}, }; auto pos = umm.insert(pair<char, int>('e', 5)); cout << "After inserting new element iterator poinst to " << pos->first << " = " << pos->second << endl; return 0; }
Let us compile and run the above program, this will produce the following result −
After inserting new element iterator poinst to e = 5
unordered_map.htm
Advertisements