hw

//HW3
//Due: 11:59PM, February 21 (Friday)

#include <iostream>
#include <list>
#include <map>
#include <string>
using namespace std;

class course {
public:
	string name;
	int section;
	int credits;
	string grade;
	course() {}
	course(string n, int s, int c, string g) { name = n; section = s; credits = c; grade = g; }

	//You might need to implement some overloaded operators here.

};
//Implement the following functions.
//When adding a student, if the student is already in DB, then ignore the operation.
//When adding a course, if the course is already in DB, then ignore the operation.
//When dropping a course, if the course does not exist, then ignore the operation.
//When removing a student, if the student does not exist, then ignore the operation.
//All courses in a semester need to be sorted.
//When dropping or adding a course, overall GPA, semester GPA, overall credits and semester credits all need to be updated.

//Semeser numbers:  Spring 2019: 20191; Fall 2019: 20192, etc.

void add_student(map<int, tuple<int, float, map<int, tuple<int, float, list<course*>*> >*>*>& DB, int id);
void remove_student(map<int, tuple<int, float, map<int, tuple<int, float, list<course*>*> >*>*>& DB, int id);
void add_course(map<int, tuple<int, float, map<int, tuple<int, float, list<course*>*> >*>*>& DB, int semester, int id, course c); //20171 Spring semester of 2017; 20172: Fall semester of 2017
																//All courses in the list should be sorted according to name (increasing order)
void drop_course(map<int, tuple<int, float, map<int, tuple<int, float, list<course*>*> >*>*>& DB, int semester, int id, course c);
void print_student_semester_courses(map<int, tuple<int, float, map<int, tuple<int, float, list<course*>*> >*>*>& DB, int semester, int id);
void print_student_all_courses(map<int, tuple<int, float, map<int, tuple<int, float, list<course*>*> >*>*>& DB, int id);

//Implement additional functions such that you can do
//cout << DB << endl;

//You might need to implement some overloaded operators in the course class.

int main() {
	map<int, tuple<int, float, map<int, tuple<int, float, list<course*>*> >*>*>  DB;

	add_student(DB, 11111);
	course C1("CIS554", 1, 3, "A-"), C2("CSE674", 1, 3, "B+"), C3("MAT296", 8, 4, "A"), C4("WRT205", 5, 3, "A");

	add_course(DB, 20171, 11111, C1);
	add_course(DB, 20171, 11111, C4);
	add_course(DB, 20171, 11111, C3);
	add_course(DB, 20171, 11111, C2);
	print_student_semester_courses(DB, 20171, 11111);

	drop_course(DB, 20171, 11111, C1);
	print_student_semester_courses(DB, 20171, 11111); //sorted according to course name

	course C5("CIS351", 2, 3, "A-"), C6("PSY205", 5, 3, "B+"), C7("MAT331", 2, 3, "A"), C8("ECN203", 4, 3, "A");
	add_course(DB, 20172, 11111, C5);
	add_course(DB, 20172, 11111, C6);
	add_course(DB, 20172, 11111, C7);
	add_course(DB, 20172, 11111, C8);
	add_course(DB, 20172, 11111, C3);
	print_student_all_courses(DB, 11111);//ID GPA

	add_student(DB, 11112);
	add_course(DB, 20171, 11112, C2);
	add_course(DB, 20171, 11112, C5);
	add_course(DB, 20171, 11112, C7);
	add_course(DB, 20171, 11112, C4);
	print_student_semester_courses(DB, 20171, 11112);

	add_course(DB, 20172, 11112, C8);
	add_course(DB, 20172, 11112, C3);
	add_course(DB, 20172, 11112, C5);
	add_course(DB, 20172, 11112, C1);
	print_student_semester_courses(DB, 20172, 11112);

	print_student_all_courses(DB, 11112);

	cout << DB << endl;
	remove_student(DB, 11111);
	cout << DB << endl;
	getchar();
	getchar();
	return 0;
}
//map<int, tuple<int, float, map<int, tuple<int, float, list<course*>*> >*>*>
//
void add_student(map<int, tuple<int, float, map<int, tuple<int, float, list<course*>*> >*>*>& DB, int id) {
	if (DB.find(id) != DB.end())return;
	tuple<int, float, map<int, tuple<int, float, list<course*>*> >*>* overall = new tuple<int, float, map<int, tuple<int, float, list<course*>*> >*>;
	map<int, tuple<int, float, list<course*>*>>* semesterCollection = new map<int, tuple<int, float, list<course*>*>>;
	get<2>(*overall) = semesterCollection;
	DB[id] = overall;
}
void remove_student(map<int, tuple<int, float, map<int, tuple<int, float, list<course*>*> >*>*>& DB, int id) {
	if (DB.find(id) != DB.end()) {
		auto overall_Tuple = DB[id]; //first tuple
		auto mapSemester_Map = get<2>(*overall_Tuple); //second map

		if (mapSemester_Map.size() != 0) { //checks if semester isnt empty

			auto mapSemester_Tuple = mapSemester_Map[semester];
			auto courseList = get<2>(*mapSemester_Tuple);

			if (courseList.size() != 0) {//searching the courselist, if found
				courseList.clear();
			}
			else {
				return;
			}

		}
		else { return; }


	}return;
}

void add_course(map<int, tuple<int, float, map<int, tuple<int, float, list<course*>*> >*>*>& DB, int semester, int id, course c) {
	if (DB.find(id) != DB.end()) {
		auto overall_Tuple = DB[id]; //first tuple
		auto mapSemester_Map = get<2>(*overall_Tuple); //second map

		if (mapSemester_Map.find(semester) == mapSemester_Map.end()) { //checks if the semester is already there in the tuple

			tuple<int, float, list<course*>*>* semesterTuple = new tuple<int, float, list<course*>*>; //semestertuple of 2nd map
			mapSemester_Map->insert(semester, semesterTuple);//setting 20191 value to semestertuple
			auto classes = get<2>(*semesterTuple); //list of classes of the semester tuple

			if (classes->find(course) == classes->end()) {

				list<course*>* courseList = new list<course*>*;
				courseList->insert(course);
			}
			else {
				return;
			}
		}
		else {
			auto existingSem = mapSemester.find(semester);
			if (existingSem->find(course) == existingSem->end()) {
				courseList->insert(course);

			}
			else {
				return;
			}
		}

	}return;
	//comparator sort overload the course
}

void drop_course(map<int, tuple<int, float, map<int, tuple<int, float, list<course*>*> >*>*>& DB, int semester, int id, course c) {
	if (DB.find(id) != DB.end()) {
		auto overall_Tuple = DB[id]; //first tuple
		auto mapSemester_Map = get<2>(*overall_Tuple); //second map

		if (mapSemester_Map.find(semester) != mapSemester_Map.end()) { //checks if the semester is found

			auto mapSemester_Tuple = mapSemester_Map[semester];
			auto courseList = get<2>(*mapSemester_Tuple);

			if (courseList.find(course) != courseList.end()) {//searching the courselist, if found
				courseList.remove(course);
			}
			else {
				return;
			}
		}
		else { return; }


	}return;
}

void print_student_semester_courses(map<int, tuple<int, float, map<int, tuple<int, float, list<course*>*> >*>*>& DB, int semester, int id) {

}
void print_student_all_courses(map<int, tuple<int, float, map<int, tuple<int, float, list<course*>*> >*>*>& DB, int id) {

}