#include <iostream>
#include "unsorted_list.h"

using namespace std;

void print (UnsortedList<int>* list) {
    int i = list->getLength(), item;
    list->reset();

    while (i--) {
        list->getNext(item);
        cout << item << " ";
    }

    cout << endl;
}

int main () {
    // Create a list
    UnsortedList<int> list;

    // Insert 4 items and print all items
    int i = 4, input;
    while (i--) {
        cin >> input;
        list.insert(input);
    }
    print(&list);

    // Print length of the list
    cout << list.getLength() << endl;

    // Add another item
    cin >> input;
    list.insert(input);
    print(&list);

    // Retrieve 4 and print whether found or not
    int number = 4;
    bool found;
    list.retrieve(number, found);
    if (!found)
        cout << "Item is not found" << endl;

    // Retrieve 5 and print whether found or not
    number = 5;
    list.retrieve(number, found);
    if (found)
        cout << "Item is found" << endl;

    // Retrieve 9 and print whether found or not
    number = 9;
    list.retrieve(number, found);
    if (found)
        cout << "Item is found" << endl;

    // Retrieve 10 and print whether found or not
    number = 10;
    list.retrieve(number, found);
    if (!found)
        cout << "Item is not found" << endl;

    // Print if the list is full or not
    if (!list.isFull())
        cout << "List is not full" << endl;

    // Delete 5 and see if the list is full or not
    list.remove(5);
    if (!list.isFull())
        cout << "List is not full" << endl;

    // Delete 1 and print the list
    list.remove(1);
    print(&list);

    // Delete 6 and print the list
    list.remove(6);
    print(&list);

    return 0;
}