首页
学习
活动
专区
工具
TVP
发布
精选内容/技术社群/优惠产品,尽在小程序
立即前往

std::map::begin

iterator begin();

const_iterator begin() const;

const_iterator cbegin() const;

(since C++11)

将迭代器返回到容器的第一个元素。

如果容器为空,则返回的迭代器将等于end()...

参数

%280%29

返回值

第一个元素的迭代器。

例外

(none)

(until C++11)

noexcept specification: noexcept

(since C++11)

复杂性

常量。

二次

代码语言:javascript
复制
#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 a_map.begin() and a_map.end()
  for (auto it = num_map.begin(); it != num_map.end(); ++it) {
    std::cout << it->first << ", " << it->second << '\n';
  }
}

二次

产出:

二次

代码语言:javascript
复制
1, 1.09
4, 4.13
9, 9.24

二次

使用自定义比较函数的示例

二次

代码语言:javascript
复制
#include <cmath>
#include <iostream>
#include <map>
 
struct Point { double x, y; };
 
typedef Point * PointPtr;
//Compare the x-coordinates of two Point pointers
struct PointCmp {
    bool operator()(const PointPtr &lhs, const PointPtr &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 the 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
    }
}

二次

产出:

二次

代码语言:javascript
复制
The magnitude of (1, 2) is 2.23607
The magnitude of (2, 1) is 2.23607
The magnitude of (3, 3) is 4.24264
The magnitude of (1, 2.23607) is 2.44949
The magnitude of (2, 2.23607) is 3
The magnitude of (3, 4.24264) is 5.19615

二次

另见

end cend

returns an iterator to the end (public member function)

代码语言:txt
复制
 © cppreference.com

在CreativeCommonsAttribution下授权-ShareAlike未移植许可v3.0。

扫码关注腾讯云开发者

领取腾讯云代金券