C++ STL

A - Container

(1) sequence_containers

Vector

vector<int> vec;
for (int i = 0; i < 10; i++)
	vec.push_back(i);
for (auto& e : vec)
	cout << e << " ";
cout << endl;

Deque

deque<int> deq;
for (int i = 0; i < 10; i++)
{
	deq.push_back(i);
	deq.push_front(i);
}
for (auto& e : deq)
	cout << e << " ";
cout << endl;

(2) associatvie_containers

Set

set<string> str_set;
str_set.insert("Hello");
tr_set.insert("World");
str_set.insert("Hello");
cout << str_set.size() << endl;
for (auto& e : str_set)
	cout << e << " ";
cout << endl;

MultiSet

std::multiset<string> str_set;
str_set.insert("Hello");
str_set.insert("World");
str_set.insert("Hello");
cout << str_set.size() << endl;
for (auto& e : str_set)
	cout << e << " ";
cout << endl;

Map

std::map<char, int> map;
map['a'] = 10;
map['b'] = 20;
map['c'] = 50;
cout << map['a'] << endl;
map['a'] = 100;
cout << map['a'] << endl;
	for (auto& e : map)
	cout << e.first /*key*/ << " " << e.second /*value*/ << " ";
cout << endl;

MultiMap

std::multimap<char, int> map;
map.insert(std::pair<char, int>('a', 10));
map.insert(std::pair<char, int>('b', 10));
map.insert(std::pair<char, int>('c', 10));
map.insert(std::pair<char, int>('d', 100));

cout << map.count('a') << endl;

for (auto& e : map)
	cout << e.first << " " << e.second << endl;
cout << endl;

(3) container_adapters

Stack

	cout << "Stack " << endl;
	
	std::stack<int> stack;
	stack.push(1);
	stack.emplace(2);
	stack.emplace(3);
	cout << stack.top() << endl;
	stack.pop();
	cout << stack.top() << endl;

Queue

	cout << "Queue" << endl;

	std::queue<int> queue;
	queue.push(1);
	queue.push(2);
	queue.push(3);
	cout << queue.front() << " " << queue.back() << endl;
	queue.pop();

Priority Queue

	std::priority_queue<int> queue;
	for (const int n : {1, 8, 5, 6, 3, 4, 0, 9, 7, 2})
		queue.push(n);

	for (int i = 0; i < 10; i++)
	{
		cout << queue.top() << endl;
		queue.pop();
	}

B - Iterator

	vector<int> container;
	for (int i = 0; i < 10; i++)
		container.push_back(i);
	vector<int> ::const_iterator itr;
	itr = container.begin();
	while (itr != container.end())
	{
		cout << *itr << " ";
		itr++;
	}
	cout << endl;
    
    for (auto iter = container.begin(); iter != container.end(); iter++)
		cout << *iter << " ";
	cout << endl;

C - Algorithm

https://www.cplusplus.com/reference/algorithm/