std::map::b...map::cbegin(3)
β¨ std::map::b...map::cbegin(3) β¨
okay bestie, welcome to the std::map::b...map::cbegin(3) page from the C++ Standard Libary manual β yes, that spelling is literally what's up top, and we are not fixing it π. This is the group chat where std::map learns how to point at its first element, and honestly? iconic.
πΈ NAME πΈ
std::map::begin,std::map::cbegin - std::map::begin,std::map::cbegin
(yes, the NAME line is giving copy-paste energy, but that's the canon, periodt β¨)
π¦ Synopsis π¦
iterator begin(); (1) (noexcept since C++11)
const_iterator begin() const; (2) (noexcept since C++11)
const_iterator cbegin() const noexcept; (3) (since C++11)
Returns an iterator to the first element of the map.
If the map is empty, the returned iterator will be equal to end() β that's the vibe check π«Ά.
There's also a lil diagram file named range-begin-end.svg in the original, no cap π.
π Parameters π
(none) β literally none, bestie, no arguments, no drama π .
π Return value π
Iterator to the first element.
π§ Complexity π§
Constant.
π Notes π
libc++ backports cbegin() to C++98 mode.
π₯ Example π₯
// Run this code
#include <iostream>
#include <map>
int main()
{
std::map<int, float> num_map;
num_map[4] = 4.13;
num_map[9] = 9.24;
num_map[1] = 1.09;
// Calls num_map.begin() and num_map.end()
for (auto it = num_map.begin(); it != num_map.end(); ++it)
std::cout << it->first << ", " << it->second << '\n';
}
Output:
1, 1.09
4, 4.13
9, 9.24
π Example using a custom comparison function π
// Run this code
#include <cmath>
#include <iostream>
#include <map>
struct Point { double x, y; };
// Compare the x-coordinates of two Point pointers.
struct PointCmp
{
bool operator()(const Point* lhs, const Point* rhs) const
{
return lhs->x < rhs->x;
}
};
int main()
{
// Note that although the x-coordinates are out of order, the
// map will be iterated through by increasing x-coordinates.
Point points[3] = {{2, 0}, {1, 0}, {3, 0}};
// mag is a map sending the address of node to its magnitude in
x-y plane.
// Although the keys are pointers-to-Point, we want to order the
map by the
// x-coordinates of the points and NOT by the addresses of the
Points. This
// is done by using the PointCmp class's comparison method.
std::map<Point*, double, PointCmp> mag(
{{points, 2}, {points + 1, 1}, {points + 2, 3}}
);
// Change each y-coordinate from 0 to the magnitude.
for (auto iter = mag.begin(); iter != mag.end(); ++iter)
{
auto cur = iter->first; // Pointer to Node
cur->y = mag[cur]; // Could also have used cur->y =
iter->second;
}
// Update and print the magnitude of each node.
for (auto iter = mag.begin(); iter != mag.end(); ++iter)
{
auto cur = iter->first;
mag[cur] = std::hypot(cur->x, cur->y);
std::cout << "The magnitude of (" << cur->x << ", " << cur->y
<< ") is ";
std::cout << iter->second << '\n';
}
// Repeat the above with the range-based for loop.
for (auto i : mag)
{
auto cur = i.first;
cur->y = i.second;
mag[cur] = std::hypot(cur->x, cur->y);
std::cout << "The magnitude of (" << cur->x << ", " << cur->y
<< ") is ";
std::cout << mag[cur] << '\n';
// Note that in contrast to std::cout << iter->second << '\n';
above,
// std::cout << i.second << '\n'; will NOT print the updated
magnitude.
// If auto &i : mag was used instead, it will print the updated
magnitude.
}
}
Output:
The magnitude of (1, 1) is 1.41421
The magnitude of (2, 2) is 2.82843
The magnitude of (3, 3) is 4.24264
The magnitude of (1, 1.41421) is 1.73205
The magnitude of (2, 2.82843) is 3.4641
The magnitude of (3, 4.24264) is 5.19615
π See also π
endβ returns an iterator to the endcendβ (public member function)(C++11)begincbeginβ returns an iterator to the beginning of a container or array(C++11)(function template)(C++14)
source/version: http://cppreference.com β date: 2024.06.10 β page: std::map::b...map::cbegin(3) π«Άπ
π¦ where this page comes from
- nixpkgs unstable: stdman 2024.07.05
- opensuse-leap 16.0: stdman 2024.07.05-bp160.1.9 Β· MIT
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms