-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathHEAPx.h
108 lines (96 loc) · 2.73 KB
/
HEAPx.h
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
#include "B.h"
#define T X(, )
typedef T const X(, c);
typedef int (*X(, cmpfn))(const X(, ) *, const X(, ) *);
fun void X(HEAP, up)(X($c, ) heap) {
if ($len(heap) == 0) return;
size_t a = $len(heap) - 1;
while (a) {
size_t b = (a - 1) / 2; // parent
int cmp = X(, cmp)(*heap + b, *heap + a);
if (cmp <= 0) break;
X(, swap)(*heap + a, *heap + b);
a = b;
}
}
fun void X(HEAP, down)(X($c, ) heap) {
size_t i = 0;
size_t n = $len(heap);
do {
size_t left = 2 * i + 1;
if (left >= n || left < i) break;
size_t j = left;
size_t right = left + 1;
if (right < n && X(, cmp)(*heap + j, *heap + right) > 0) j = right;
if (X(, cmp)(*heap + i, *heap + j) <= 0) break;
X(, swap)(*heap + i, *heap + j);
i = j;
} while (1);
}
fun ok64 X(HEAP, pop)(T *v, X(B, ) buf) {
T **data = X(B, data)(buf);
if ($empty(data)) return Bnodata;
X(, mv)(v, $head(data));
X(, swap)($head(data), $last(data));
--$term(data);
X(HEAP, down)(data);
return OK;
}
fun ok64 X(HEAP, push)(X(B, ) buf, T const *v) {
ok64 o = X(B, feedp)(buf, v);
if (o != OK) return o;
X(HEAP, up)(X(B, data)(buf));
return OK;
}
fun ok64 X(HEAP, push1)(X(B, ) buf, T v) {
ok64 o = X(B, feed1)(buf, v);
if (o != OK) return o;
X(HEAP, up)(X(B, data)(buf));
return OK;
}
fun void X(HEAP, upf)(X($c, ) heap, X(, cmpfn) fn) {
if ($len(heap) == 0) return;
size_t a = $len(heap) - 1;
while (a) {
size_t b = (a - 1) / 2; // parent
int cmp = fn(*heap + b, *heap + a);
if (cmp <= 0) break;
X(, swap)(*heap + a, *heap + b);
a = b;
}
}
fun void X(HEAP, downf)(X($c, ) heap, X(, cmpfn) fn) {
size_t i = 0;
size_t n = $len(heap);
do {
size_t left = 2 * i + 1;
if (left >= n || left < i) break;
size_t j = left;
size_t right = left + 1;
if (right < n && fn(*heap + j, *heap + right) > 0) j = right;
if (fn(*heap + i, *heap + j) <= 0) break;
X(, swap)(*heap + i, *heap + j);
i = j;
} while (1);
}
fun ok64 X(HEAP, popf)(T *v, X(B, ) buf, X(, cmpfn) fn) {
T **data = X(B, data)(buf);
if ($empty(data)) return Bnodata;
X(, mv)(v, $head(data));
X(, swap)($head(data), $last(data));
--$term(data);
X(HEAP, downf)(data, fn);
return OK;
}
fun ok64 X(HEAP, pushf)(X(B, ) buf, T const *v, X(, cmpfn) fn) {
ok64 o = X(B, feedp)(buf, v);
if (o != OK) return o;
X(HEAP, upf)(X(B, data)(buf), fn);
return OK;
}
fun ok64 X(HEAP, push1f)(X(B, ) buf, T v, X(, cmpfn) fn) {
ok64 o = X(B, feed1)(buf, v);
if (o != OK) return o;
X(HEAP, upf)(X(B, data)(buf), fn);
return OK;
}