-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTimetable.cpp
More file actions
143 lines (115 loc) · 4.42 KB
/
Timetable.cpp
File metadata and controls
143 lines (115 loc) · 4.42 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
#include "Timetable.h"
using namespace std;
int
Timetable::getClashes(const DataTuplesRaw& tuples)
{
int totalClashes = 0;
Periods::iterator it;
for (it = _periods.begin(); it != _periods.end(); ++it)
totalClashes += it->getClashes(tuples);
return totalClashes;
}
void
Timetable::removeDuplicates(const std::vector<int>& ids, RandWrapper& randw)
{
vector<vector<int>> foundIDs;
foundIDs.resize(ids.size());
Periods::iterator itp;
int i = 0;
for (itp = _periods.begin(); itp != _periods.end(); ++itp, ++i) {
vector<int>& tuples = itp->getTuplesIDs();
vector<int>::iterator itt;
for (itt = tuples.begin(); itt != tuples.end(); ++itt)
foundIDs[(*itt) - 1].push_back(i);
}
for (size_t l = 0; l < foundIDs.size(); ++l) {
int occurences = foundIDs[l].size();
if (occurences <= 1)
continue;
int indRemove = randw() % occurences;
int nPeriod = foundIDs[l][indRemove];
vector<int>& tuples = _periods[nPeriod].getTuplesIDs();
auto toRemove = find(tuples.begin(), tuples.end(), l + 1);
tuples.erase(toRemove);
}
}
void
Timetable::fillMissing(const std::vector<int>& ids, RandWrapper& randw)
{
vector<int> foundIDs;
Periods::iterator itp;
for (itp = _periods.begin(); itp != _periods.end(); ++itp) {
vector<int>& tuples = itp->getTuplesIDs();
vector<int>::iterator itt;
for (itt = tuples.begin(); itt != tuples.end(); ++itt) {
int id = *itt;
foundIDs.push_back(id);
}
}
if (ids.size() == foundIDs.size())
return;
sort(foundIDs.begin(), foundIDs.end());
vector<int>::const_iterator iti;
for (iti = ids.begin(); iti != ids.end(); ++iti) {
int id = *iti;
auto found = lower_bound(foundIDs.begin(), foundIDs.end(), id);
if (found == foundIDs.end() || *found != id) {
// RAND
int size = _periods.size();
int targetPeriod = randw() % size;
_periods[targetPeriod].addTuple(id);
}
}
}
void
Timetable::mutate(RandWrapper& randw)
{
int srcPeriod;
int dstPeriod;
int tries = 10;
vector<int>* genes;
do {
int n1 = randw();
int n2 = randw();
srcPeriod = n1 % _periods.size();
dstPeriod = n2 % _periods.size();
genes = &_periods[srcPeriod].getTuplesIDs();
if (!(--tries))
break;
} while (srcPeriod == dstPeriod || genes->empty());
if (srcPeriod == dstPeriod || genes->empty())
return;
int srcGene = randw() % genes->size();
int gene = (*genes)[srcGene];
_periods[dstPeriod].addTuple(gene);
}
std::ostream&
operator<<(std::ostream& stream, const Timetable& timetable)
{
for (int i = 0; i < timetable.getPeriodsCount(); ++i) {
stream << i << ": " << timetable[i] << endl;
}
return stream << endl;
}
void
Timetable::printPretty(std::ostream& stream, const DataTuples& tuples)
{
Periods::iterator itp;
int i = 0;
for (itp = _periods.begin(); itp != _periods.end(); ++itp, ++i) {
stream << "#Period " << i << ": " << endl;
const vector<int>& ids = itp->getTuplesIDs();
vector<int>::const_iterator iti;
for (iti = ids.begin(); iti != ids.end(); ++iti) {
const DataTuple* tuple = tuples.get(*iti);
const Class* classObj = tuple->getClass();
const Subject* subject = tuple->getSubject();
const Teacher* teacher = subject->getTeacher();
const Room* room = subject->getRoom();
stream << "\tClass: " << classObj->getName()
<< ", Subject: " << subject->getName()
<< ", Teacher: " << teacher->getName()
<< ", Room: " << room->getName() << endl;
}
}
}