std::unordered_map::begin
STD:无序[医]地图::BEGIN,STD::无序[医]地图::
iterator begin( | | (since C++11) |
---|---|---|
const_iterator begin() const; | | (since C++11) |
const_iterator cbegin() const; | | (since C++11) |
将迭代器返回到容器的第一个元素。
如果容器为空,则返回的迭代器将等于end()
...
参数
%280%29
返回值
第一个元素的迭代器。
例外
noexcept
规格:
noexcept
复杂性
常量。
例
二次
#include <cmath>
#include <iostream>
#include <unordered_map>
struct Node { double x, y; };
int main() {
Node nodes[3] = { {1, 0}, {2, 0}, {3, 0} };
//mag is a map mapping the address of a Node to its magnitude in the plane
std::unordered_map<Node *, double> mag = {
{ nodes, 1 },
{ nodes + 1, 2 },
{ nodes + 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
}
}
二次
可能的产出:
二次
The magnitude of (3, 3) is 4.24264
The magnitude of (1, 1) is 1.41421
The magnitude of (2, 2) is 2.82843
The magnitude of (3, 4.24264) is 5.19615
The magnitude of (1, 1.41421) is 1.73205
The magnitude of (2, 2.82843) is 3.4641
二次
另见
end cend | returns an iterator to the end (public member function) |
---|
© cppreference.com
在CreativeCommonsAttribution下授权-ShareAlike未移植许可v3.0。