/*
 CIS 22C: Homework 4

 Sorted Circular Doubly-Linked List ADT with Sentinel Node

 Build and procees a sorted linked list of Park objects.
 The list is sorted in ascending order by the Park code, a unique identifier.

*/

// Written by: Iurii Tatishchev
// Reviewed & Modified by: Iurii Tatishchev
// IDE: CLion

#include <iostream>
#include <fstream>
#include <sstream>
#include <string>
#include <cctype>  //  toupper()

#include "LinkedListADT.h"
#include "Park.h"

using namespace std;

void buildList(const string &filename, LinkedList<Park> &list);

void deleteManager(LinkedList<Park> &list);

void searchManager(const LinkedList<Park> &list);

void displayManager(const LinkedList<Park> &list);

int main() {

    string inputFileName = "national_parks.txt";
    LinkedList<Park> list;

    buildList(inputFileName, list);
    displayManager(list);
    searchManager(list);
    deleteManager(list);
    displayManager(list);
    return 0;
}

/*
 This function reads data about national parks from a file and inserts them
 into a sorted linked list. The list is sorted in ascending order by code.
 */
void buildList(const string &filename, LinkedList<Park> &list) {
    ifstream inputFile(filename);
    cout << "Reading data from \"" << filename << "\"" << endl;

    if (!inputFile) {
        cout << "Error opening the input file: \"" << filename << "\"" << endl;
        exit(EXIT_FAILURE);
    }

    string line;
    while (getline(inputFile, line)) {
        int year;
        string code, name, state, dsc;

        stringstream temp(line);   // create temp with data from line
        temp >> code;              // read from temp
        temp >> state;
        temp >> year;
        temp.ignore();             // to ignore space in front of name
        getline(temp, name, ';');   // stop reading name at ';'
        temp.ignore();             // to ignore space in front of description
        getline(temp, dsc);
        // create a Park object and initialize it with data from file
        Park aPark(code, state, name, dsc, year);
        list.insertNode(aPark);
    }

    inputFile.close();
}

/*
 Delete manager: delete items from the list until the user enters Q to quit
 deleting
 Input & Output Parameter: list
 */
void deleteManager(LinkedList<Park> &list) {
    string targetCode;

    cout << endl << " Delete" << endl;
    cout << "=======" << endl;

    while (targetCode != "Q") {
        cout << "Enter a park code (or Q to stop deleting):" << endl;
        getline(cin, targetCode);
        targetCode[0] = toupper(targetCode[0]);
        if (targetCode != "Q") {
            Park target;
            target.setCode(targetCode);
            if (list.deleteNode(target))
                cout << "    " << targetCode << " has been deleted!" << endl;
            else
                cout << "Park \"" << targetCode << "\" was not found in this list." << endl;
        }
    }
    cout << "___________________END DELETE SECTION_____" << endl;
}

/*
 Search manager: search the list until the user enters Q to quit searching
 Input Parameter: list
 */
void searchManager(const LinkedList<Park> &list) {
    string targetCode = "";
    Park aPark;

    cout << endl << " Search" << endl;
    cout << "=======" << endl;

    while (targetCode != "Q") {
        cout << "Enter a park code (or Q to stop searching):" << endl;
        getline(cin, targetCode);
        targetCode[0] = toupper(targetCode[0]);
        if (targetCode != "Q") {
            Park target;
            target.setCode(targetCode);
            if (list.searchList(target, aPark))
                aPark.vDisplay();
            else
                cout << "Park \"" << targetCode << "\" was not found in this list." << endl;
        }
    }
    cout << "___________________END SEARCH SECTION _____" << endl;
}

/*
Display manager:
 - displays the number of national parks in this list
 - calls the displayListForw()/displayListBack() function upon request
Input Parameter: list
 */
void displayManager(const LinkedList<Park> &list) {
    string action;

    cout << "Number of National Parks in this list: " << list.getLength() << endl;
    cout << "Display list [F/B/N]?" << endl;
    getline(cin, action);

    switch (toupper(action[0])) {
        case 'F':
            list.displayListForw();
            break;
        case 'B':
            list.displayListBack();
            break;
    }
}