-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathScheduleTableCreator.java
More file actions
71 lines (56 loc) · 1.97 KB
/
Copy pathScheduleTableCreator.java
File metadata and controls
71 lines (56 loc) · 1.97 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
public class ScheduleTableCreator {
private TaskModel taskModel;
private boolean weeksTable[][];
private String tasksTable[][];
private int maxDays;
ScheduleTableCreator(TaskModel taskModel) {
this.taskModel = taskModel;
maxDays = findMaxDays();
createWeeksTable();
createtaskTable();
}
void createtaskTable () {
tasksTable = new String[taskModel.getTaskUnits().size()][Finals.LENGTH_OF_TASKS_TABLE];
for (int i = 0; i < taskModel.getTaskUnits().size(); i++) {
tasksTable[i][0] = "" + (i + 1);
tasksTable[i][1] = taskModel.getTaskUnits().get(i).getUnitTitle();
tasksTable[i][2] = taskModel.getTaskUnits().get(i).getUnitateMetric();
tasksTable[i][3] = "" + taskModel.getTaskUnits().get(i).getCantitate();
tasksTable[i][4] = "" + taskModel.getTaskUnits().get(i).getOre();
}
}
void createWeeksTable(){
weeksTable = new boolean[taskModel.getTaskUnits().size()][maxDays + Finals.EXTRA_ORAR_DAYS +1]; // +1 mert 0-tol indexeljuk a napokat
for(boolean[] bt : weeksTable){
for (int i = 0; i < bt.length; i++){
bt[i] = false;
}
}
for (int i = 0; i < taskModel.getTaskUnits().size(); i++){
TaskUnit tu = taskModel.getTaskUnits().get(i);
for (int j = 0; j < tu.getSchedules().size(); j ++){
weeksTable[i][tu.getSchedules().get(j)] = true;
}
}
}
int findMaxDays() {
int max = 0;
for(TaskUnit tu : taskModel.getTaskUnits()){
for(int i : tu.getSchedules()){
if (i > max){
max = i;
}
}
}
return max;
}
public boolean[][] getWeeksTable() {
return weeksTable;
}
public String[][] getTasksTable() {
return tasksTable;
}
public int getMaxDays() {
return maxDays;
}
}