#include <iostream>
#include <vector>
#include <list>

#include "functions.h"

typedef std::list<long long> LongLongList;
typedef LongLongList::iterator LongLongListIterator;

int main(int argc, const char* argv[]) {
    // C array
    int numbers[5] = {1, 2, 3, 4, 5}; // stack array
    const int count = 10;
    int numbers2[count];

    int count2 = 10;
    int* numbers3 = new int[count2]; // heap array
    delete[] numbers3;
    numbers3 = nullptr;

    // numbers[10] = 100;
    std::cout << "size of numbers: " << sizeof(numbers) << std::endl;

    printArrayAtPosition(numbers, 19);

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

    std::cout << "size of v: " << v.size() << "/" << v.capacity() << std::endl;

    v.push_back(6);

    std::cout << "size of v: " << v.size() << "/" << v.capacity() << std::endl;

    // v[20] = 100;
    printArrayAtPosition(v.data(), 2);

    v.pop_back();

    std::cout << "size of v: " << v.size() << "/" << v.capacity() << std::endl;

    // list
    std::list<int> l = {1, 2, 3, 4, 5};
    l.push_front(0);
    // int n = l[0]; // no random access for list

    std::list<int>::iterator it;
    for (it = l.begin(); it != l.end(); ++it) {
        std::cout << *it << std::endl;
    }

    --it; --it;
    std::cout << *it << std::endl;
    l.insert(it, 100);
    for (it = l.begin(); it != l.end(); ++it) {
        std::cout << *it << std::endl;
    }

    --it; --it;
    l.erase(it);
    for (it = l.begin(); it != l.end(); ++it) {
        std::cout << *it << std::endl;
    }

    LongLongList ll = {1, 2, 3, 4, 5};
    LongLongListIterator it2;

    return 0;
}