Container fun

containerfun.cpp

#include <algorithm>
#include <list>
#include <string>
#include <iostream>
using namespace std;

template <typename T>
void print_list(list<T> l) {
	for (auto e: l)
	{
		cout << to_string(e) << endl;
	}
}

int main(int argc, char* argv[]) {
	list<unsigned int> container;
	auto a = container;
	auto b = container;
	a = {1, 2, 3};
	b = {1, 2, 3, 4};
	if (a > b)
	{
		cout << "a is real superset of b" << endl;
	}
	if (a >= b)
	{
		cout << "a is superset of b" << endl;
	}
	if (a <= b) {
		cout << "b is superset of a" << endl;
	}
	if (a < b) {
		cout << "b is real superset of a" << endl;
	}

	auto intersect = container;
	set_intersection(a.begin(), a.end(), b.begin(), b.end(), back_inserter(intersect));

	cout << "elements in intersection:" << endl;
	print_list(intersect);
	
	auto difference = container;
	set_difference(b.begin(), b.end(), a.begin(), a.end(), back_inserter(difference));
	cout << "elements in diff:" << endl;
	print_list(difference);

	auto un = container;
	cout << "elements in union:" << endl;
	set_union(a.begin(), a.end(), b.begin(), b.end(), back_inserter(un));
	print_list(un);

	auto min = min_element(un.begin(), un.end());
	cout << "the minimum element of a and b is " << to_string(*min) << endl;

	auto max = max_element(un.begin(), un.end());
	cout << "the maximum element of a and b is " << to_string(*max) << endl;

	return 0;
}