-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathschedule.cpp
More file actions
146 lines (127 loc) · 3.4 KB
/
schedule.cpp
File metadata and controls
146 lines (127 loc) · 3.4 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
#include <ostream>
#include "schedule.h"
#include "exceptions.h"
using namespace mtm;
using std::cout;
using std::endl;
using std::list;
bool event_pointer_compare(BaseEvent* event1, BaseEvent* event2);
Schedule::Schedule(): event_list(){}
Schedule::Schedule(const Schedule& schedule): event_list()
{
for(BaseEvent* event: schedule.event_list)
{
this->event_list.push_back(event->clone());
}
this->event_list.sort(event_pointer_compare);
}
Schedule::~Schedule()
{
this->freeEventPointers();
}
void Schedule::freeEventPointers()
{
for (BaseEvent* event: this->event_list)
{
delete event;
}
}
Schedule& Schedule::operator=(const Schedule& schedule)
{
if(this == &schedule)
{
return *this;
}
list<BaseEvent*> event_list = list<BaseEvent*>();
for(BaseEvent* event: schedule.event_list)
{
event_list.push_back(event->clone());
}
event_list.sort(event_pointer_compare);
this->freeEventPointers();
this->event_list = event_list;
return *this;
}
//#TODO: check this worsk correctly
bool event_pointer_compare(BaseEvent* event1, BaseEvent* event2)
{
return (*event1 < *event2) || (*event1 == *event2);
}
void Schedule::addEvent(const BaseEvent& event)
{
BaseEvent* event_pointer = event.clone();
this->event_list.push_back(event_pointer);
this->event_list.sort(event_pointer_compare);
}
void Schedule::addEvents(const EventContainer& container)
{
for(EventContainer::EventIterator iter_event = container.begin();iter_event != container.end();++iter_event)
{
for(BaseEvent* event_p: this->event_list)
{
if(*iter_event == *event_p)
{
throw EventAlreadyExists();
}
}
}
for(EventContainer::EventIterator iter_event = container.begin();iter_event != container.end();++iter_event)
{
this->addEvent(*iter_event);
}
}
BaseEvent* Schedule::findEventByDateAndName(const mtm::DateWrap& date, const std::string& name) const
{
for (BaseEvent* event_p: this->event_list)
{
if(event_p->getDate() == date && event_p->getName() == name)
{
return event_p;
}
}
return nullptr;
}
void Schedule::registerToEvent(const mtm::DateWrap& date, const std::string& name, int student)
{
BaseEvent* event = this->findEventByDateAndName(date, name);
if(!event)
{
throw EventDoesNotExist();
}
event->registerParticipant(student);
}
void Schedule::unregisterFromEvent(const mtm::DateWrap& date, const std::string& name, int student)
{
BaseEvent* event = this->findEventByDateAndName(date, name);
if(!event)
{
throw EventDoesNotExist();
}
event->unregisterParticipant(student);
}
void Schedule::printAllEvents() const
{
for (BaseEvent* event: this->event_list)
{
event->printShort(cout) << endl;
}
}
void Schedule::printMonthEvents(int month, int year) const
{
for (BaseEvent* event: this->event_list)
{
if(event->getDate().month() == month && event->getDate().year() == year)
{
event->printShort(cout) << endl;
}
}
}
void Schedule::printEventDetails(const mtm::DateWrap& date, const std::string& event_name) const
{
BaseEvent* event = this->findEventByDateAndName(date, event_name);
if(!event)
{
throw EventDoesNotExist();
}
event->printLong(cout) << endl;
}