// C++ program to illustrate the vector container
#include <iostream>
#include <vector>
using namespace std;

int main()
{
    // 1d vector with initialization list
    vector<int> v1 = { 1, 2, 3, 4, 5 };
    // 2d vector with size and element value initialization
    vector<vector<int> > v2(3, vector<int>(3, 5));

    // adding values using push_back()
    v1.push_back(6);
    // printing v1 using size()
    cout << "v1: ";
    for (int i = 0; i < v1.size(); i++) {
        cout << v1[i] << " ";
    }
    cout << endl;

    v1.erase(v1.begin() + 4);
    // printing v1 using iterators
    cout << "v1: ";
    for (auto i = v1.begin(); i != v1.end(); i++) {
        cout << *i << " ";
    }

    // printing v2 using range based for loop
    cout << "v2:-" << endl;
    for (auto i : v2) {
        for (auto j : i) {
            cout << j << " ";
        }
        cout << endl;
    }
    return 0;
}

// C++ Program to illustrate the list container
#include <iostream>
#include <list>
#include <vector>
using namespace std;

// driver code
int main()
{
    // creating std::list object using initializer list
    list<int> l1 = { 1, 5, 9, 1, 4, 6 };

    // vector for initialization
    vector<char> v = { 'G', 'e', 'e', 'k', 's' };
    list<int> l2(v.begin(), v.end());

    // printing first element
    cout << "First element if l1: " << l1.front() << endl;

    // adding element
    l1.insert(l1.begin(), 5);

    // deleting element
    l1.erase(l1.begin());

    // traversing and printing l1
    cout << "l1: ";
    for (auto i = l1.begin(); i != l1.end(); i++) {
        cout << *i << " ";
    }
    cout << endl;

    // traversing and printing l2
    cout << "l2: ";
    for (auto i : l2) {
        cout << char(i);
    }
    cout << endl;

    return 0;
}

// C++ program to illustrate the deque
#include <deque>
#include <iostream>
using namespace std;

int main()
{
    // creating a deque
    deque<int> d = { 1, 2, 3, 4, 5 };

    // removing two elements from the back and pushing them
    // at the front
    d.push_front(d.back());
    d.pop_back();
    d.push_front(d.back());
    d.pop_back();

    for (auto i : d) {
        cout << i << " ";
    }

    return 0;
}

// C++ Program to illustrate the stack
#include <bits/stdc++.h>
using namespace std;

int main()
{
    stack<int> s;

    for (int i = 1; i <= 5; i++) {
        s.push(i);
    }

    s.push(6);
    // checking top element
    cout << "s.top() = " << s.top() << endl;

    // getting all the elements
    cout << "s: ";
    while (!s.empty()) {
        cout << s.top() << " ";
        s.pop();
    }

    // size after popping all elements
    cout << "Final Size: " << s.size();

    return 0;
}

// C++ program to illustate the queue container
#include <iostream>
#include <queue>
using namespace std;

int main()
{

    // creating queue
    queue<int> q;

    // pushing elements
    for (int i = 1; i <= 5; i++) {
        q.push(i);
    }
    q.push(6);

    cout << "q.front() = " << q.front() << endl;
    cout << "q.back() = " << q.back() << endl;

    // printing queue by popping all elements
    cout << "q: ";
    int size = q.size();
    for (int i = 0; i < size; i++) {
        cout << q.front() << " ";
        q.pop();
    }

    return 0;
}

// C++ program to illustrate set
#include <iostream>
#include <set>
#include <vector>
using namespace std;

int main()
{
    // creating vector
    vector<int> v = { 1, 5, 3, 4, 2 };
    // creating set using vector v
    set<int> s(v.begin(), v.end());

    // finding 4
    if (s.find(4) == s.end()) {
        cout << "4 not found" << endl;
    }
    else {
        cout << "4 found" << endl;
    }

    // adding 9
    s.insert(9);

    // printing set
    cout << "s: ";
    for (set<int>::iterator i = s.begin(); i != s.end();
         i++) {
        cout << *i << " ";
    }
    cout << endl;
    return 0;
}

// C++ Program to illustrate the map container
#include <iostream>
#include <map>
using namespace std;

int main()
{

    // creating std::map object
    map<int, string> m;

    // adding elements
    m[1] = "ONE";
    m[2] = "TWO";
    m[3] = "THREE";

    // checking size
    cout << "Size of map m: " << m.size() << endl;

    // inserting using insert pair
    m.insert({ 4, "FOUR" });

    // deleting key 2 with its value
    m.erase(2);

    // printing the map
    cout << "Map:-" << endl;
    for (auto i : m) {
        cout << "Key: " << i.first << '\t';
        cout << "Value: " << i.second << endl;
    }

    return 0;
}

// C++ Program to illustrate the unordered_set container
#include <iostream>
#include <unordered_set>
using namespace std;

int main()
{

    // creating an unordered_set object
    unordered_set<int> us = { 1, 5, 2, 3, 4 };

    // checking size
    cout << "Size of us: " << us.size() << endl;

    // inserting data
    us.insert(7);

    // finding some key
    if (us.find(3) != us.end()) {
        cout << "3 found!" << endl;
    }
    else {
        cout << "3 not found" << endl;
    }

    // traversing unordered_set using iterators
    cout << "us: ";
    for (auto i = us.begin(); i != us.end(); i++) {
        cout << *i << " ";
    }
    cout << endl;

    return 0;
}

// C++ program to illustrate the unordered_map container
#include <iostream>
#include <unordered_map>
using namespace std;

int main()
{
    // creating unordered_map object
    unordered_map<int, string> umap;

    // inserting key value pairs
    umap[1] = "ONE";
    umap[2] = "TWO";
    umap[3] = "THREE";
    umap.insert({ 4, "FOUR" });

    // finding some key
    if (umap.find(12) != umap.end()) {
        cout << "Key 12 Found!" << endl;
    }
    else {
        cout << "Key 12 Not Found!" << endl;
    }

    // traversing whole map at once using iterators
    cout << "umap:--" << endl;
    for (auto i = umap.begin(); i != umap.end(); i++) {
        cout << "Key:" << i->first
             << "\tValue: " << i->second << endl;
    }

    return 0;
}

// C++ program to demonstrate default behaviour of
// sort() in STL.
#include <bits/stdc++.h>
using namespace std;

int main()
{
    int arr[] = { 1, 5, 8, 9, 6, 7, 3, 4, 2, 0 };
    int n = sizeof(arr) / sizeof(arr[0]);

    /*Here we take two parameters, the beginning of the
    array and the length n upto which we want the array to
    be sorted*/
    sort(arr, arr + n);

    cout << "\nArray after sorting using "
            "default sort is : \n";
    for (int i = 0; i < n; ++i)
        cout << arr[i] << " ";

    return 0;
}

// C++ Program to print vector using copy function and input
// and output stream iterators
#include <algorithm>
#include <iostream>
#include <iterator>
#include <sstream>
#include <vector>
using namespace std;

int main()
{
    // creating vector
    vector<int> v = { 1, 2, 3, 4, 5 };

    // copying data to ostream
    copy(v.begin(), v.end(),
         ostream_iterator<int>(cout, " "));
    return 0;
}

// C++ program to demonstrate the use of std::max_element
#include <algorithm>
#include <iostream>
#include <iterator>
#include <vector>
using namespace std;
int main()
{
    // creating vector
    vector<int> v = { 10, 88, 2, 9, 45, 82, 546, 42, 221 };

    // Finding the maximum value between the first and the
    // fourth element
    auto max = max_element(begin(v), end(v));

    cout << "Maximum Element: " << *max << "\n";
    return 0;
}

// C++ program to illustrate the find()
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

int main()
{

    // creating vector
    vector<int> v
        = { 1, 8, 97, 3, 654, 132, 65, 4, 321, 5, 45 };

    // finding 5
    auto itr = find(v.begin(), v.end(), 5);
    if (itr != v.end()) {
        cout << *itr << " is found!" << endl;
    }
    else {
        cout << "5 is not found!" << endl;
    }

    return 0;
}

// C++ program to print vector using for
#include <algorithm>
#include <iostream>
#include <iterator>
#include <vector>
using namespace std;

int main()
{

    // creating vector
    vector<int> v = { 1, 2, 3, 4, 5 };

    // adding 1 to each element
    for_each(v.begin(), v.end(), [](int& i){
      i = i + 1;
    });

    // printing vector
    copy(v.begin(), v.end(), ostream_iterator<int>(cout, " "));

    return 0;
}

// C++ program to illustrate some builtin functors
#include <functional>
#include <iostream>
using namespace std;

int main()
{
    // creating objects
    equal_to<int> eq;
    not_equal_to<int> neq;
    greater<int> gt;
    less<int> ls;
    plus<int> p;
    minus<int> m;

    // printing return values
    cout << "Functors and their return value\n";
    cout << boolalpha;
    cout << "equal_to, (10,20): " << eq(10, 20) << endl;
    cout << "greater, (10,20): " << gt(10, 20) << endl;
    cout << "less, (10,20): " << ls(10, 20) << endl;
    cout << "plus, (10,20): " << p(10, 20) << endl;
    cout << "minus(10,20): " << m(10, 20) << endl;

    return 0;
}