| line |
true |
false |
branch |
|
79
|
21008 |
220 |
for (i = 0; i < alphaSize; i++)
|
|
80
|
18688 |
2320 |
weight[i+1] = (freq[i] == 0 ? 1 : freq[i]) << 8;
|
|
91
|
21008 |
220 |
for (i = 1; i <= alphaSize; i++) {
|
|
95
|
16610 |
21008 |
UPHEAP(nHeap);
|
|
98
|
0 |
220 |
AssertH( nHeap < (BZ_MAX_ALPHA_SIZE+2), 2001 );
|
|
100
|
20788 |
220 |
while (nHeap > 1) {
|
|
101
|
19512 |
108740 |
n1 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP(1);
|
|
|
107404 |
1336 |
n1 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP(1);
|
|
|
48729 |
58675 |
n1 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP(1);
|
|
|
1276 |
107464 |
n1 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP(1);
|
|
102
|
16725 |
106885 |
n2 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP(1);
|
|
|
105704 |
1181 |
n2 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP(1);
|
|
|
48045 |
57659 |
n2 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP(1);
|
|
|
4063 |
102822 |
n2 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP(1);
|
|
109
|
1137 |
20788 |
UPHEAP(nHeap);
|
|
112
|
0 |
220 |
AssertH( nNodes < (BZ_MAX_ALPHA_SIZE * 2), 2002 );
|
|
115
|
21008 |
220 |
for (i = 1; i <= alphaSize; i++) {
|
|
118
|
162517 |
21008 |
while (parent[k] >= 0) { k = parent[k]; j++; }
|
|
120
|
0 |
21008 |
if (j > maxLen) tooLong = True;
|
|
123
|
220 |
0 |
if (! tooLong) break;
|
|
142
|
0 |
0 |
for (i = 1; i <= alphaSize; i++) {
|
|
161
|
183 |
55 |
for (n = minLen; n <= maxLen; n++) {
|
|
162
|
23298 |
183 |
for (i = 0; i < alphaSize; i++)
|
|
163
|
5252 |
18046 |
if (length[i] == n) { code[i] = vec; vec++; };
|
|
181
|
286 |
81 |
for (i = minLen; i <= maxLen; i++)
|
|
182
|
32800 |
286 |
for (j = 0; j < alphaSize; j++)
|
|
183
|
7154 |
25646 |
if (length[j] == i) { perm[pp] = j; pp++; };
|
|
185
|
1863 |
81 |
for (i = 0; i < BZ_MAX_CODE_LEN; i++) base[i] = 0;
|
|
186
|
7154 |
81 |
for (i = 0; i < alphaSize; i++) base[length[i]+1]++;
|
|
188
|
1782 |
81 |
for (i = 1; i < BZ_MAX_CODE_LEN; i++) base[i] += base[i-1];
|
|
190
|
1863 |
81 |
for (i = 0; i < BZ_MAX_CODE_LEN; i++) limit[i] = 0;
|
|
193
|
286 |
81 |
for (i = minLen; i <= maxLen; i++) {
|
|
198
|
205 |
81 |
for (i = minLen + 1; i <= maxLen; i++)
|