-
Notifications
You must be signed in to change notification settings - Fork 0
/
State.java
117 lines (89 loc) · 2.31 KB
/
State.java
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
import java.util.*;
public class State {
public int track = 1;
private boolean up = true;
public PriorityQueue<Job> lowqueue;
public PriorityQueue<Job> highqueue;
public State(){
lowqueue = new PriorityQueue<Job>(10, new Comparator<Job>(){
public int compare(Job arg0, Job arg1) {
int t1 = arg0.track;
int t2 = arg1.track;
if (up && t1 < track)
t1 += Simulator.N;
if (up && t2 < track)
t2 += Simulator.N;
if (!up && t1 > track)
t1 += Simulator.N;
if (!up && t2 > track)
t2 += Simulator.N;
return Math.abs(t1 - track) - Math.abs(t2 - track);
}
});
highqueue = new PriorityQueue<Job>(10, new Comparator<Job>(){
public int compare(Job arg0, Job arg1) {
int t1 = arg0.track;
int t2 = arg1.track;
if (up && t1 < track)
t1 += Simulator.N;
if (up && t2 < track)
t2 += Simulator.N;
if (!up && t1 > track)
t1 += Simulator.N;
if (!up && t2 > track)
t2 += Simulator.N;
return Math.abs(t1 - track) - Math.abs(t2 - track);
}
});
}
public void addJob(Job j){
lowqueue.add(j);
}
public Job peekJob(){
return highqueue.peek();
}
public Job removeJob(){
Job j = highqueue.remove();
if (j.track > track)
up = true;
else
up = false;
return j;
}
public void resetJobs(){
PriorityQueue<Job> newqueue = new PriorityQueue<Job>(10, new Comparator<Job>(){
public int compare(Job arg0, Job arg1) {
int t1 = arg0.track;
int t2 = arg1.track;
if (up && t1 < track)
t1 += Simulator.N;
if (up && t2 < track)
t2 += Simulator.N;
if (!up && t1 > track)
t1 += Simulator.N;
if (!up && t2 > track)
t2 += Simulator.N;
return Math.abs(t1 - track) - Math.abs(t2 - track);
}
});
newqueue.addAll(lowqueue);
lowqueue = newqueue;
newqueue = new PriorityQueue<Job>(10, new Comparator<Job>(){
public int compare(Job arg0, Job arg1) {
int t1 = arg0.track;
int t2 = arg1.track;
if (up && t1 < track)
t1 += Simulator.N;
if (up && t2 < track)
t2 += Simulator.N;
if (!up && t1 > track)
t1 += Simulator.N;
if (!up && t2 > track)
t2 += Simulator.N;
return Math.abs(t1 - track) - Math.abs(t2 - track);
}
});
newqueue.addAll(highqueue);
highqueue = newqueue;
}
}