#include <cstdlib>
#include <list>
#include <string>
#include <iostream>
#include <fstream>
#include <valarray>
#include <regex>
#include "Reservation.h"
using namespace std;

// prototypes
void readFile(string file_name, list<Reservation> & ll);
void printMenu();

string locatorGenerate(int length);
void enter(list<Reservation> & ll);
void display(list<Reservation> & ll);
void search(list<Reservation> & ll);
void edit(list<Reservation> & ll);
void delete_(list<Reservation> & ll);
void processing(char option, list<Reservation> & ll);

void writeFile(string file_name, list<Reservation> & ll);

int main(int argc, char** argv) {
/**
* 1. When the program is first started, it must read a data file called reservation.dat. The program will not prompt the user for the name of the data file. The name of the data file must be hard-coded in the program. If the file exists, the program will load the data for each reservation into the global linked list. If the file does not exist, the program will start with an empty linked list.
*/
string file_name = "reservation.dat";
list<Reservation> ll;
readFile(file_name, ll);

/**
* 2. The program will provide a simple text-based user interface that manages the all of the reservations within a linked list. Each reservation must be placed in the linked list as an object that holds all of the attributes associated with it as mentioned above. The user interface will allow the user to perform the following:
*/
string input;
char option;
do {
   printMenu();
   getline(cin, input, '\n');
   option = input[0];
   processing(option, ll);
   cout << "\n";
} while (option != 'f');

writeFile(file_name, ll);

return 0;
}

/**
* write list to file
* @param file_name
* @param ll
*/
void writeFile(string file_name, list<Reservation> & ll) {
fstream out;
out.open(file_name.c_str(), ios::out);
if (out.is_open()) {
   list<Reservation>::iterator it;
   for (it = ll.begin(); it != ll.end(); ++it) {
         out << it->toString() << "\n";
   }
   out.close();
}
}

Q2 Matrix transpose: m2[i][j] = m1[j][i], i=0,….,n-1, j=0,…,n-1...