std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::end, std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::cend
来自cppreference.com
< cpp | container | unordered map
iterator end() noexcept; |
(C++11 起) | |
const_iterator end() const noexcept; |
(C++11 起) | |
const_iterator cend() const noexcept; |
(C++11 起) | |
返回指向 unordered_map
末元素后一元素的迭代器。
此元素表现为占位符;试图访问它导致未定义行为。
参数
(无)
返回值
指向后随最后元素的迭代器。
复杂度
常数。
示例
运行此代码
#include <cmath> #include <iostream> #include <unordered_map> struct Node { double x, y; }; int main() { Node nodes[3] = { {1, 0}, {2, 0}, {3, 0} }; // mag 是映射 Node 地址到其平面中长度的 map std::unordered_map<Node *, double> mag = { { nodes, 1 }, { nodes + 1, 2 }, { nodes + 2, 3 } }; // 从 0 到长度更改每个 y 坐标 for(auto iter = mag.begin(); iter != mag.end(); ++iter){ auto cur = iter->first; // 指向 Node 的指针 cur->y = mag[cur]; // 亦能使用 cur->y = iter->second; } // 更新并打印每个结点的长度 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'; } // 以基于范围的 for 循环重复上述内容 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'; // 注意与上述 std::cout << iter->second << '\n'; 相反, // std::cout << i.second << '\n'; 将不会打印更新的长度 } }
可能的输出:
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
参阅
返回指向起始的迭代器 (公开成员函数) |