mirror of
https://github.com/changkun/modern-cpp-tutorial.git
synced 2025-12-17 04:34:40 +03:00
38 lines
879 B
C++
38 lines
879 B
C++
//
|
|
// 4.2.cpp
|
|
// modern c++ tutorial
|
|
//
|
|
// created by changkun at changkun.de
|
|
// https://github.com/changkun/modern-cpp-tutorial
|
|
//
|
|
// 无序容器
|
|
|
|
#include <iostream>
|
|
#include <string>
|
|
#include <unordered_map>
|
|
#include <map>
|
|
|
|
int main() {
|
|
// 两组结构按同样的顺序初始化
|
|
std::unordered_map<int, std::string> u = {
|
|
{1, "1"},
|
|
{3, "3"},
|
|
{2, "2"}
|
|
};
|
|
std::map<int, std::string> v = {
|
|
{1, "1"},
|
|
{3, "3"},
|
|
{2, "2"}
|
|
};
|
|
|
|
// 分别对两组结构进行遍历
|
|
std::cout << "std::unordered_map" << std::endl;
|
|
for( const auto & n : u)
|
|
std::cout << "Key:[" << n.first << "] Value:[" << n.second << "]\n";
|
|
|
|
std::cout << std::endl;
|
|
std::cout << "std::map" << std::endl;
|
|
for( const auto & n : v)
|
|
std::cout << "Key:[" << n.first << "] Value:[" << n.second << "]\n";
|
|
}
|