c++11 初始化列表 std::initializer_list
#include <iostream>
#include <vector>
#include <map>
class Foo
{
public:
Foo(std::initializer_list <int>) {}
};
class FooVector
{
std::vector<int> content_;
public:
FooVector(std::initializer_list<int> list)
{
for (auto it = list.begin(); it != list.end(); ++it)
{
content_.push_back(*it);
}
}
};
class FooMap
{
std::map<int, int> content_;
using pair_t = std::map<int, int>::value_type;
public:
FooMap(std::initializer_list<pair_t> list)
{
for (auto it = list.begin(); it != list.end(); ++it)
{
content_.insert(*it);
}
}
};
void test01()
{
Foo foo = { 1,2,3,4,5 };
FooVector foo1 = { 1, 2, 3, 4, 5 };
FooMap foo2 = { { 1, 2 }, { 3, 4 }, { 5, 6 } };
}
void func(std::initializer_list<int> list)
{
std::cout << "size = " << list.size() << std::endl;
for (auto it = list.begin(); it != list.end(); it++)
{
std::cout << *it << std::endl;
}
}
void test02()
{
func({});
func({ 1,2,3 });
}
std::initializer_list<int> func2(void)
{
int a = 1, b = 2;
return { a,b };
}
std::vector<int> func3(void)
{
int a = 1, b = 2;
return { a,b };
}
void test03()
{
std::initializer_list<int> myList;
size_t n = myList.size();
myList = { 1,2,3,4,5,6 };
n = myList.size();
std::cout << "n="<<n << std::endl;
myList = { 11,22 };
n = myList.size();
std::cout <<"n="<< n << std::endl;
std::vector<int> a;
a = func2();
for (auto it = a.begin(); it != a.end(); it++) {
std::cout << *it << " ";
}
std::cout<<std::endl;
a = func3();
for (auto it = a.begin(); it != a.end(); it++) {
std::cout << *it << " ";
}
std::cout << std::endl;
}
int main(void)
{
test01();
test02();
test03();
system("pause");
return 0;
}
输出:
size = 0
size = 3
1
2
3
n=6
n=2
389674272 125
1 2