-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtask.cpp
More file actions
169 lines (150 loc) · 3.9 KB
/
Copy pathtask.cpp
File metadata and controls
169 lines (150 loc) · 3.9 KB
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
#include<iostream>
#include<fstream>
#include<string>
using namespace std;
class Task{
private :
string description;
bool completed;
public :
Task(string desc = "") : description(desc), completed(false){}
string getDescription() const {
return description;
}
bool isCompleted() const{
return completed;
}
void setComplete(bool status){
completed = status;
}
};
class Node{
public :
Task task;
Node* next;
Node(const Task& t) : task(t), next(nullptr) {}
};
class TaskManager{
private:
Node* head;
int count;
void clearList(){
Node* curr = head;
while(curr){
Node* next = curr->next;
delete curr;
curr = next;
}
}
public:
TaskManager() : head(nullptr), count(0) {}
~TaskManager() {
clearList();
}
void addTask(const Task& task){
Node* newNode = new Node(task);
newNode-> next = head;
head = newNode;
count++;
}
void removeTask(const string& desc){
Node*curr = head;
Node* prev = nullptr;
while(curr){
if(curr->task.getDescription() == desc){
if(prev){
prev->next = curr->next;
} else {
head = curr->next;
}
delete curr;
count--;
return;
}
prev = curr;
curr = curr->next;
}
cout<< "Task not found.\n";
}
void markComplete(const string& desc){
Node* curr = head;
while(curr){
if(curr->task.getDescription() == desc){
curr->task.setComplete(true);
cout<<"Task marked complete.\n";
return;
}
curr = curr->next;
}
cout<<"Task not found.\n";
}
void displayTasks() const{
cout<<"Tasks (" << count << " total):\n";
Node* curr = head;
if(!curr){
cout<<"No tasks.\n";
return;
}
while(curr){
cout<<"- "<<curr->task.getDescription();
if(curr->task.isCompleted()) cout << " YAY DONE! ";
cout<<"\n";
curr = curr->next;
}
}
void loadFromFile(const string& filename = "tasks.txt") {
ifstream file(filename);
string line;
while (getline(file, line)) {
size_t pos = line.find('|');
if (pos != string::npos) {
string desc = line.substr(0, pos);
bool done = (line.substr(pos + 1) == "1");
Task t(desc);
if (done) t.setComplete(true);
addTask(t);
}
}
file.close();
cout << "Loaded from " << filename << "\n";
}
void saveToFile(const string& filename = "tasks.txt"){
ofstream file(filename);
Node* curr = head;
while(curr){
file << curr->task.getDescription()<<"|"<< curr->task.isCompleted()<<"\n";
curr = curr->next;
}
file.close();
cout<<"Saved to "<< filename << "\n";
}
};
int main() {
TaskManager tm;
tm.loadFromFile();
int choice;
string desc;
do {
cout << "\n=== Task Manager ===\n";
cout << "1. Add Task\n";
cout << "2. Remove Task\n";
cout << "3. Mark Complete\n";
cout << "4. Display Tasks\n";
cout << "5. Exit\n";
cout << "Choice: ";
cin >> choice;
cin.ignore();
if (choice == 5) break;
cout << "Task: ";
getline(cin, desc);
switch (choice) {
case 1: tm.addTask(Task(desc)); cout << "Added.\n"; break;
case 2: tm.removeTask(desc); break;
case 3: tm.markComplete(desc); break;
case 4: tm.displayTasks(); break;
default: cout << "Invalid choice.\n";
}
} while (true);
tm.saveToFile();
return 0;
}