- 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
C++ Map Library - erase() Function
Description
The C++ function std::map::erase() removes range of element from the the map.
This member function reduces size of map.
Declaration
Following is the declaration for std::map::erase() function form std::map header.
C++11
iterator erase (const_iterator first, const_iterator last);
Parameters
first − Input iterator to the initial position in range.
last − Input iterator to the final position in range.
Return value
Returns an iterator following the last removed element.
Exceptions
This member function doesn't throw exception.
Time complexity
Linear in the distance between first to last.
Example
The following example shows the usage of std::map::erase() function.
#include <iostream> #include <map> using namespace std; int main(void) { /* Initializer_list constructor */ map<char, int> m = { {'a', 1}, {'b', 2}, {'c', 3}, {'d', 4}, {'e', 5}, }; cout << "Map contains following elements befor erase operation" << endl; for (auto it = m.begin(); it != m.end(); ++it) cout << it->first << " = " << it->second << endl; auto it = m.begin(); ++it, ++it; it = m.erase(m.begin(), it); cout << "Map contains following elements after erase operation" << endl; for (auto it = m.begin(); it != m.end(); ++it) cout << it->first << " = " << it->second << endl; cout << "After erase operation iterator points to = " << it->first << endl; return 0; }
Let us compile and run the above program, this will produce the following result −
Map contains following elements befor erase operation a = 1 b = 2 c = 3 d = 4 e = 5 Map contains following elements after erase operation c = 3 d = 4 e = 5 After erase operation iterator points to = c
map.htm
Advertisements