-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathDetailedTaskList.hpp
183 lines (156 loc) · 5.6 KB
/
DetailedTaskList.hpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
#ifndef DETAILEDTASKLIST_H
#define DETAILEDTASKLIST_H
#include "TaskList.hpp"
class DetailedTaskList : public TaskList {
protected:
std::vector<std::vector<std::string>> subTasks;
public:
void addTask(Task task, int id = -1);
void addSubTask(std::string subTask, int id = -1);
void deleteTask(int id = -1);
void deleteSubTask(int id = -1, int subID = -1);
int getSubTaskLength(int) const;
std::string getSubTask(int id = 0, int subID = 0);
void sortID();
void sortTitle();
void sortDueDate();
void sortDateAdded();
virtual void printTask(int);
virtual void deleteAll();
virtual nlohmann::json getJson() const;
virtual void setJson(const nlohmann::json &);
};
void DetailedTaskList::addTask(Task task, int id) {
if (id < 0 || id >= taskList.size()) {
taskList.push_back(task);
subTasks.push_back(std::vector<std::string>());
} else {
taskList.insert(taskList.begin() + id, task);
subTasks.insert(subTasks.begin() + id, std::vector<std::string>());
}
}
void DetailedTaskList::addSubTask(std::string subTask, int id) {
if (id < 0 || id >= taskList.size()) return;
subTasks.at(id).push_back(subTask);
}
void DetailedTaskList::deleteTask(int id) {
if (id >= 0 && id < taskList.size()) {
taskList.erase(taskList.begin() + id);
subTasks.at(id).erase(subTasks.at(id).begin(), subTasks.at(id).end());
}
}
void DetailedTaskList::deleteSubTask(int id, int subID) {
if (id < 0 || id > taskList.size())
return;
else if (subID >= 0 || subID < subTasks.at(id).size()) {
subTasks.at(id).erase(subTasks.at(id).begin() + subID);
}
return;
}
int DetailedTaskList::getSubTaskLength(int id) const {
return subTasks.at(id).size();
}
std::string DetailedTaskList::getSubTask(int id, int subID) {
if (id < 0 || id >= subTasks.size())
return "";
if (subID < 0 || subID >= subTasks.at(id).size())
return "";
return subTasks.at(id).at(subID);
}
void DetailedTaskList::sortID() {
for (int i = 0; i < taskList.size(); i++) {
for (int j = 0; j < taskList.size(); j++) {
if (taskList[i].getID() > taskList[j].getID()) {
std::swap(taskList[i], taskList[j]);
std::swap(subTasks.at(i), subTasks.at(j));
}
}
}
}
void DetailedTaskList::sortTitle() {
for (int i = 0; i < taskList.size(); i++) {
for (int j = 0; j < taskList.size(); j++) {
if (taskList[i].getTitle() > taskList[j].getTitle()) {
std::swap(taskList[i], taskList[j]);
std::swap(subTasks.at(i), subTasks.at(j));
}
}
}
}
void DetailedTaskList::sortDueDate() {
for (int i = 0; i < taskList.size(); i++) {
for (int j = 0; j < taskList.size(); j++) {
if (taskList[i].getDueDate() > taskList[j].getDueDate()) {
std::swap(taskList[i], taskList[j]);
std::swap(subTasks.at(i), subTasks.at(j));
}
}
}
}
void DetailedTaskList::sortDateAdded() {
for (int i = 0; i < taskList.size(); i++) {
for (int j = 0; j < taskList.size(); j++) {
if (taskList[i].getDateAdded() > taskList[j].getDateAdded()) {
std::swap(taskList[i], taskList[j]);
std::swap(subTasks.at(i), subTasks.at(j));
}
}
}
}
void DetailedTaskList::printTask(int id) {
if (id >= 0 && id < taskList.size()) {
std::cout << "Title: " << taskList.at(id).getTitle() << std::endl;
std::cout << "Due Date: " << taskList.at(id).epochToString(taskList.at(id).getDueDate()) << std::endl;
std::cout << "Date Added: " << taskList.at(id).epochToString(taskList.at(id).getDateAdded()) << std::endl;
std::cout << "SubTasks: ";
if (subTasks.empty()) {
std::cout << "NO SUBTASKS AVAILABLE!" << std::endl;
} else {
if(subTasks.at(id).empty()){
std::cout << "NO SUBTASKS AT INDEX: " << id << std::endl;
} else{
std::cout << std::endl;
for (int i = 0; i < subTasks.at(id).size(); i++) {
std::cout << i + 1 << ") " << subTasks.at(id).at(i) << std::endl;
}
std::cout << std::endl;
}
}
std::cout << "Completed: " << (taskList.at(id).isCompleted() ? "Yes" : "No") << std::endl;
}
}
void DetailedTaskList::deleteAll() {
taskList.clear();
subTasks.clear();
}
nlohmann::json DetailedTaskList::getJson() const {
nlohmann::json json;
json.push_back({
{"Type", "DetailedTaskList"},
});
for (int i = 0; i < taskList.size(); i++) {
json.push_back({{"title", taskList.at(i).getTitle(false)},
{"subtasks", subTasks.at(i)},
{"dueDate", taskList.at(i).getDueDate()},
{"dateAdded", taskList.at(i).getDateAdded()},
{"completed", taskList.at(i).isCompleted()}});
}
return json;
}
void DetailedTaskList::setJson(const nlohmann::json &json) {
Task currentTask;
std::vector<std::string> tempSubTasks;
for (int i = 1; i < json.size(); i++) {
currentTask.setTitle(json.at(i)["title"]);
subTasks.push_back(json.at(i)["subtasks"]);
currentTask.setDueDate(json.at(i)["dueDate"]);
currentTask.setDateAdded(json.at(i)["dateAdded"]);
currentTask.setCompleted(json.at(i)["completed"]);
taskList.push_back(currentTask);
}
this->sortDueDate();
for (int i = 0; i < taskList.size(); i++) {
taskList[i].setID(i + 1);
}
}
#endif