-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQueue.java
More file actions
164 lines (134 loc) · 5.07 KB
/
Queue.java
File metadata and controls
164 lines (134 loc) · 5.07 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
import java.util.ArrayList;
import java.util.Comparator;
public class Queue {
private String name;
private ArrayList<Job> queue;
private Queue next;
private Queue result;
public Queue(ArrayList<Job> timeline, String name) {
this.queue = new ArrayList<>();
for (Job job : timeline) {
this.queue.add(job);
}
this.name = name;
}
public Queue(Queue input, String name) {
this.queue = new ArrayList<>();
for (Job job : input.queue) {
this.queue.add(job);
}
this.name = name;
}
public Queue(String name) {
this.queue = new ArrayList<>();
this.name = name;
}
public String getName() {
return this.name;
}
public void enqueue(Job job) {
this.queue.add(job);
}
public Job dequeue() {
return this.queue.removeFirst();
}
public void offer() {
Job toOffer = this.dequeue();
toOffer.incrementLevel();
this.next.enqueue(toOffer);
}
public void moveToResult() {
this.result.enqueue(this.dequeue());
}
public void requeue() {
this.enqueue(this.dequeue());
}
public Job front() {
return this.queue.getFirst();
}
public int size() {
return this.queue.size();
}
public boolean isEmpty() {
return this.queue.isEmpty();
}
public void setNextQueue(Queue next) {
this.next = next;
}
public void setResultQueue(Queue result) {
this.result = result;
}
public void incrementAllEndTime(int time) {
for (Job job : this.queue) {
job.incrementEndTime(time);
}
}
public void RR(int quantum, Logger logger) {
Job currentJob = this.front();
Log log = new Log(currentJob.getID(), currentJob.getLevel(), logger.getTime());
if (currentJob.getRemainingTime() <= quantum) {
logger.incrementTime(currentJob.getRemainingTime());
currentJob.setEndTime(logger.getTime());
currentJob.setRemainingTime(0);
logger.incrementCount();
this.moveToResult();
} else {
logger.incrementTime(quantum);
currentJob.setEndTime(logger.getTime());
currentJob.setRemainingTime(currentJob.getRemainingTime() - quantum);
this.offer();
}
log.setEndTime(logger.getTime());
logger.addLog(log);
}
public void FCFS(Logger logger) {
Job currentJob = this.front();
Log log = new Log(currentJob.getID(), currentJob.getLevel(), logger.getTime());
logger.incrementTime(currentJob.getRemainingTime());
logger.incrementCount();
currentJob.setEndTime(logger.getTime());
currentJob.setRemainingTime(0);
this.moveToResult();
log.setEndTime(logger.getTime());
logger.addLog(log);
}
public void SJF(Logger logger) {
this.sort("SJF");
Job currentJob = this.front();
Log log = new Log(currentJob.getID(), currentJob.getLevel(), logger.getTime());
logger.incrementTime(currentJob.getRemainingTime());
logger.incrementCount();
currentJob.setEndTime(logger.getTime());
currentJob.setRemainingTime(0);
this.moveToResult();
log.setEndTime(logger.getTime());
logger.addLog(log);
}
// TODO
public void NPP(Logger logger) {
}
public void calculateResults() {
for (Job job : this.queue) {
job.calculateTurnAroundTime();
job.calculateWaitingTime();
}
}
public void sort(String mode) {
switch (mode) {
case "AT":
this.queue.sort(Comparator.comparing(Job::getArrivalTime));
break;
case "SJF":
this.queue.sort(Comparator.comparing(Job::getRemainingTime));
break;
default:
break;
}
}
public void print() {
System.out.println("ID\tAT\tBT\tRT\tLevel\tET\tTaT\tWT");
for (Job job : this.queue) {
System.out.println(job);
}
}
}