/
RangeList.java
206 lines (189 loc) · 6.05 KB
/
RangeList.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
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
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
import java.util.Map.Entry;
import java.util.TreeMap;
import java.util.concurrent.ConcurrentSkipListMap;
import java.util.concurrent.locks.ReadWriteLock;
import java.util.concurrent.locks.ReentrantReadWriteLock;
public interface RangeList {
public void add(int addressBegin, int addressEnd, boolean personaNonGrata);
public void subtract(int addressBegin, int addressEnd, boolean personaNonGrata);
public boolean PNG();
public boolean contains(int source);
public void print();
}
class SerialRangeList implements RangeList{
private TreeMap<Integer,Integer> ranges = new TreeMap<Integer,Integer>();
private boolean PNG;
public SerialRangeList(int addressBegin, int addressEnd, boolean personaNonGrata,boolean acceptingRange) {
//assuming addresses are fine if not stated otherwise
PNG=personaNonGrata;
if(acceptingRange){
ranges.put(Integer.MIN_VALUE, Integer.MAX_VALUE);
}
else{
ranges.put(Integer.MIN_VALUE, addressBegin);
ranges.put(addressEnd, Integer.MAX_VALUE);
}
}
public void add(int addressBegin, int addressEnd, boolean personaNonGrata) {
PNG=personaNonGrata;
Entry<Integer, Integer> entry = ranges.floorEntry(addressBegin);
if(entry.getValue()<addressBegin){
entry=ranges.higherEntry(entry.getValue());
ranges.put(addressBegin, addressEnd);
}
else if(entry.getValue()<=addressEnd){
ranges.put(entry.getKey(), addressEnd);
entry=ranges.higherEntry(entry.getValue());
}
else{
entry=ranges.higherEntry(entry.getValue());
}
//clean up extra ranges
while(entry!=null&&entry.getValue()<addressEnd){
ranges.remove(entry.getKey());
entry=ranges.higherEntry(entry.getKey());
}
if(entry!=null&&ranges.floorEntry(addressBegin).getValue()>=entry.getKey()){
ranges.remove(entry.getKey());
ranges.put(ranges.floorEntry(addressBegin).getKey(), entry.getValue());
}
}
public void subtract(int addressBegin, int addressEnd, boolean personaNonGrata) {
PNG=personaNonGrata;
Entry<Integer, Integer> entry = ranges.floorEntry(addressBegin);
if(entry.getValue()>addressEnd){// if placing range inside of an old range
ranges.put(addressEnd, entry.getValue());
if(entry.getKey()==addressBegin){
ranges.remove(entry.getKey());
}
else{
ranges.put(entry.getKey(),addressBegin);
}
}
else{
entry=ranges.higherEntry(entry.getKey());
while(entry.getValue()<addressEnd){
ranges.remove(entry.getKey());
entry=ranges.higherEntry(entry.getKey());
}
if(entry.getKey()<addressEnd){
ranges.put(addressEnd, entry.getValue());
ranges.remove(entry.getKey());
}
}
}
public boolean PNG() {
return PNG;
}
public boolean contains(int source) {
Entry<Integer, Integer> entry = ranges.firstEntry();
//System.out.println(source);
while(entry.getValue()<source){
//System.out.println("entry "+Integer.toString(entry.getKey())+" "+Integer.toString(entry.getValue()));
entry=ranges.higherEntry(entry.getKey());
}
if(entry.getKey()<source){
return true;
}
return false;
}
public void print() {
System.out.println("ranges");
for(int k:ranges.keySet()){
System.out.println(Integer.toString(k)+" - "+Integer.toString(ranges.get(k)));
}
}
}
class ParallelRangeList implements RangeList{
private TreeMap<Integer,Integer> ranges = new TreeMap<Integer,Integer>();
private volatile boolean PNG;
private ReadWriteLock lock;
public ParallelRangeList(int addressBegin, int addressEnd, boolean personaNonGrata,boolean acceptingRange) {
//assuming addresses are fine if not stated otherwise
PNG=personaNonGrata;
if(acceptingRange){
ranges.put(Integer.MIN_VALUE, Integer.MAX_VALUE);
}
else{
ranges.put(Integer.MIN_VALUE, addressBegin);
ranges.put(addressEnd, Integer.MAX_VALUE);
}
lock = new ReentrantReadWriteLock();
}
public void add(int addressBegin, int addressEnd, boolean personaNonGrata) {
lock.writeLock().lock();
PNG=personaNonGrata;
Entry<Integer, Integer> entry = ranges.floorEntry(addressBegin);
if(entry.getValue()<addressBegin){
entry=ranges.higherEntry(entry.getValue());
ranges.put(addressBegin, addressEnd);
}
else if(entry.getValue()<=addressEnd){
ranges.put(entry.getKey(), addressEnd);
entry=ranges.higherEntry(entry.getValue());
}
else{
entry=ranges.higherEntry(entry.getValue());
}
//clean up extra ranges
while(entry!=null&&entry.getValue()<addressEnd){
ranges.remove(entry.getKey());
entry=ranges.higherEntry(entry.getKey());
}
if(entry!=null&&ranges.floorEntry(addressBegin).getValue()>=entry.getKey()){
ranges.remove(entry.getKey());
ranges.put(ranges.floorEntry(addressBegin).getKey(), entry.getValue());
}
lock.writeLock().unlock();
}
public void subtract(int addressBegin, int addressEnd, boolean personaNonGrata) {
lock.writeLock().lock();
PNG=personaNonGrata;
Entry<Integer, Integer> entry = ranges.floorEntry(addressBegin);
if(entry.getValue()>addressEnd){// if placing range inside of an old range
ranges.put(addressEnd, entry.getValue());
if(entry.getKey()==addressBegin){
ranges.remove(entry.getKey());
}
else{
ranges.put(entry.getKey(),addressBegin);
}
}
else{
entry=ranges.higherEntry(entry.getKey());
while(entry.getValue()<addressEnd){
ranges.remove(entry.getKey());
entry=ranges.higherEntry(entry.getKey());
}
if(entry.getKey()<addressEnd){
ranges.put(addressEnd, entry.getValue());
ranges.remove(entry.getKey());
}
}
lock.writeLock().unlock();
}
public boolean PNG() {
return PNG;
}
public boolean contains(int source) {
lock.readLock().lock();
Entry<Integer, Integer> entry = ranges.firstEntry();
//System.out.println(source);
while(entry.getValue()<source){
//System.out.println("entry "+Integer.toString(entry.getKey())+" "+Integer.toString(entry.getValue()));
entry=ranges.higherEntry(entry.getKey());
}
if(entry.getKey()<source){
lock.readLock().unlock();
return true;
}
lock.readLock().unlock();
return false;
}
public void print() {
System.out.println("ranges");
for(int k:ranges.keySet()){
System.out.println(Integer.toString(k)+" - "+Integer.toString(ranges.get(k)));
}
}
}