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
|
package align2;
public final class PackedHeap {
public PackedHeap(int maxSize){
int len=maxSize+1;
if((len&1)==1){len++;} //Array size is always even.
CAPACITY=maxSize;
array=new long[len];
// queue=new PriorityQueue<T>(maxSize);
}
public boolean add(long t){
//assert(testForDuplicates());
// assert(queue.size()==size);
// queue.add(t);
assert(size==0 || array[size]!=-1L);
size++;
array[size]=t;
percDown(size);
// assert(queue.size()==size);
// assert(queue.peek()==peek());
//assert(testForDuplicates());
return true;
}
public long peek(){
//assert(testForDuplicates());
// assert(queue.size()==size);
if(size==0){return -1L;}
// assert(array[1]==queue.peek()) : size+", "+queue.size()+"\n"+
// array[1]+"\n"+
// array[2]+" , "+array[3]+"\n"+
// array[4]+" , "+array[5]+" , "+array[6]+" , "+array[7]+"\n"+
// queue.peek()+"\n";
//assert(testForDuplicates());
return array[1];
}
public long poll(){
//assert(testForDuplicates());
// assert(queue.size()==size);
if(size==0){return -1L;}
long t=array[1];
// assert(t==queue.poll());
array[1]=array[size];
array[size]=-1L;
size--;
if(size>0){percUp(1);}
// assert(queue.size()==size);
// assert(queue.peek()==peek());
//assert(testForDuplicates());
return t;
}
private void percDown(int loc){
//assert(testForDuplicates());
assert(loc>0);
if(loc==1){return;}
int next=loc/2;
final long a=array[loc];
long b=array[next];
// while(loc>1 && (a.site<b.site || (a.site==b.site && a.column<b.column))){
while(loc>1 && a<b){
array[loc]=b;
loc=next;
next=next/2;
b=array[next];
}
array[loc]=a;
}
private void percUp(int loc){
//assert(testForDuplicates());
assert(loc>0 && loc<=size) : loc+", "+size;
int next1=loc*2;
int next2=next1+1;
if(next1>size){return;}
long a=array[loc];
long b=array[next1];
long c=array[next2];
assert(a!=b);
assert(b!=c);
assert(b!=-1L);
//assert(testForDuplicates());
if(c==-1L || b<=c){
if(a>b){
// if((a.site>b.site || (a.site==b.site && a.column>b.column))){
array[next1]=a;
array[loc]=b;
//assert(testForDuplicates());
percUp(next1);
}
}else{
if(a>c){
// if((a.site>c.site || (a.site==c.site && a.column>c.column))){
array[next2]=a;
array[loc]=c;
//assert(testForDuplicates());
percUp(next2);
}
}
}
private void percUpIter(int loc){
//assert(testForDuplicates());
assert(loc>0 && loc<=size) : loc+", "+size;
final long a=array[loc];
//assert(testForDuplicates());
int next1=loc*2;
int next2=next1+1;
while(next1<=size){
long b=array[next1];
long c=array[next2];
assert(a!=b);
assert(b!=c);
assert(b!=-1L);
if(c==-1L || b<=c){
// if(c==-1L || (b.site<c.site || (b.site==c.site && b.column<c.column))){
if(a>b){
// if((a.site>b.site || (a.site==b.site && a.column>b.column))){
// array[next1]=a;
array[loc]=b;
loc=next1;
}else{
break;
}
}else{
if(a>c){
// if((a.site>c.site || (a.site==c.site && a.column>c.column))){
// array[next2]=a;
array[loc]=c;
loc=next2;
}else{
break;
}
}
next1=loc*2;
next2=next1+1;
}
array[loc]=a;
}
public boolean isEmpty(){
// assert((size==0) == queue.isEmpty());
return size==0;
}
public void clear(){
// queue.clear();
// for(int i=1; i<=size; i++){array[i]=-1L;}
size=0;
}
public int size(){
return size;
}
public static int tier(int x){
int leading=Integer.numberOfLeadingZeros(x);
return 31-leading;
}
public boolean testForDuplicates(){
for(int i=0; i<array.length; i++){
for(int j=i+1; j<array.length; j++){
if(array[i]!=-1L && array[i]==array[j]){return false;}
}
}
return true;
}
final long[] array;
private final int CAPACITY;
private int size=0;
}
|
