Prerequisite : Unordered maps in STL
Unordered_map : unordered_map is an associated container that stores elements formed by the combination of key value and a mapped value. The key value is used to uniquely identify the element and mapped value is the content associated with the key. Both key and value can be of any type predefined or user-defined.
unordered_map :: at(): This function in C++ unordered_map returns the reference to the value with the element as key k.
unordered_map.at(k); Parameter: It is the key value of the element whose mapped value we want to access. Return type : A reference to the mapped value of the element with a key value equivalent
Note : The method gives run-time error if key is not present.
Value of key mp['second'] = 2 Exception at _Map_base::at
Practical Application : std :: unordered_map :: at() function can be used to access the mapped value and thus can edit, update etc.
Computer Application: 100 Chemistry: 98 Physics: 97 Maths: 100
How unordered_map at() is different from unordered_map operator()
- Both at() and operator is used to refer the element present at the given position, the only difference is, at() throws out-of-range exception whereas operator shows undefined behavior.
- return statement in C/C++ with Examples
- How to implement our own Vector Class in C++?
- Web Programming in C++
- Evolution of Foldable Smartphones
- C++ Program to print an Array using Recursion
- Storage Classes in C++ with Examples
- How to wait for a promise to finish before returning the variable of a function?
- How to see the extensions loaded by PHP ?
- What is the difference between single-quoted and double-quoted strings in PHP?
- How to execute PHP code using command line ?
- fill_n() function in C++ STL with examples
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.