#include <iostream>
#include <set>
#include <algorithm>
using namespace std;

int main(void)
{
	//创建关联容器set
	set<int> s{ 1,2,3,4,5,6 };
	//使用set的迭代器，循环遍历
	for_each(s.cbegin(), s.cend(), [](int x) { cout << x << " "; });
	cout << endl;
	//让bool显示未true或false
	cout << boolalpha;
	s.empty();
	cout << "s是否为空:" << s.empty() << endl;
	cout << "s的元素个数:" << s.size() << endl;
	cout << "s可理论容纳的最大数量:" << s.max_size() << endl;
	cout << endl;
	//清除s内容
	s.clear();
	cout << "清除后s是否为空:" << s.empty() << endl;
	//插入元素
	s.insert(s.begin(), 99);
	for_each(s.cbegin(), s.cend(), [](int x) { cout << x << " "; });
	cout << endl;
	return 0;
}
/*
1 2 3 4 5 6
s是否为空:false
s的元素个数:6
s可理论容纳的最大数量:576460752303423487

清除后s是否为空:true
99
*/

#include <iostream>
#include <set>
using namespace std;

int main(void)
{
	set<int> c = { 1,2,3,4,1,2,3,4 };
	auto print = [&c]
	{
		cout << "c={";
		for (int n : c)
		{
			cout << n << " ";
		}
		cout <<"}"<< endl;
	};
	print();
	cout << "移除所有奇数：" << endl;
	for (auto it = c.begin(); it != c.end();)
	{
		if (*it % 2 != 0)
		{
			//擦除首元素
			it = c.erase(it);
		}
		else
		{
			++it;
		}
	}
	print();
	cout << "移除1，移除个数" << c.erase(1) << endl;
	cout << "移除2，移除个数" << c.erase(2) << endl;
	cout << "移除2，移除个数" << c.erase(2) << endl;
	print();
	return 0;
}
/*
c={1 2 3 4 }
移除所有奇数：
c={2 4 }
移除1，移除个数0
移除2，移除个数1
移除2，移除个数0
c={4 }
*/

#include <iostream>
#include <algorithm>
#include <set>
using namespace std;
int main(void)
{
	set<int> cont{ 1,2,3 };
	auto print = [](const int& n) { cout << " " << n; };
	for_each(cont.begin(), cont.end(), print);
	cout << endl;
	//C++17.解链含position所指向元素的结点柄返回占有它的结点柄
	auto nh = cont.extract(1);
	//对结点柄重新赋值
	nh.value() = 4;
	
	for_each(cont.begin(), cont.end(), print);
	cout << endl;
	//将nh结点柄插入尾部
	cont.insert(move(nh));

	for_each(cont.begin(), cont.end(), print);
	cout << endl;
}
/*
 1 2 3
 2 3
 2 3 4
*/

#include <iostream>
#include <set>
using namespace std;

template <class Os,class K>
Os& operator<<(Os& os, const std::set<K>& v)
{
	//求出set的大小
	os << '[' << v.size() << "] {";
	bool o{};
	for (const auto& e : v)
	{
		//判断是否为空决定是，还是空
		os << (o ? ", " : (o = 1, " ")) << e;
	}
	return os << " }\n";
}
int main(void)
{
	set<char> 
		p{'C','B','B','A' },
		q{ 'E','D','E','C' };
	cout << "p: " << p << "q: " << q;
	//对set进行合并
	p.merge(q);
	//合并自动去重
	//q留下重复的部分
	cout << "p.merge(q):" << p << "q: " << q;

}
/*
p: [3] { A, B, C }
q: [3] { C, D, E }
p.merge(q):[5] { A, B, C, D, E }
q: [1] { C }
*/

#include <iostream>
#include <map>
#include <string>
using namespace std;
//输出键值队map
auto print = [](auto const comment, auto const& map)
{
	cout << comment << "{";
	for (const auto& pair : map)
	{
		cout << "{" << pair.first << ":" << pair.second << "}";
	}
	cout << endl;
};

int main()
{
	map<char,int> letter_counts { {'a',27},{'b',3},{'c',1} };
	print("letter_counts初始状态下包含:", letter_counts);

	letter_counts['b'] = 42;
	letter_counts['x'] = 9;
	print("修改后的值", letter_counts);

	//统计每个单词出现的次数
	map<string, int> word_map;
	for (const auto& w : { "this","sentence","is","not","a","sentence","this","sentence","is","a","hoax" })
	{
		++word_map[w];
	}
	word_map["that"]; //插入对{"that",0}

	print("输出map:",word_map);
	
}

#include <iostream>
#include <map>
#include <string>
using namespace std;
//输出键值队map
auto print_map = [](auto const comment, map<string,int>&map)
{
	cout << comment ;
	//C++11方案
	for (const auto& pair : map)
	{
		cout << "{" << pair.first << ":" << pair.second << "}";
	}
	
	
	cout << endl;
};

int main()
{
	map<string, int> m{ {"cpu",10},{"GPU",15},{"RAM",20} };
	print_map("初始map:", m);
	//以不存在的键执行插入操作
	m["SSD"] = 30;
	print_map("插入不存在的：", m);
	//移除GPU
	m.erase("GPU");
	print_map("移除后：", m);
	//条件移除
	erase_if(m, [](const auto& pair) { return pair.second > 25; });
	print_map("条件移除后：", m);
	cout << m.size() << endl;

	m.clear();
	cout << boolalpha << "m是否为空:" << m.empty() << endl;
	return 0;
}
/*
初始map:{GPU:15}{RAM:20}{cpu:10}
插入不存在的：{GPU:15}{RAM:20}{SSD:30}{cpu:10}
移除后：{RAM:20}{SSD:30}{cpu:10}
条件移除后：{RAM:20}{cpu:10}
2
m是否为空:true

*/