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
|
#include <stc/forward.h>
forward_cpque(pnt, struct Point);
struct MyStruct {
cpque_pnt priority_queue;
int id;
};
#define i_val int
#include "cstack.h"
#define i_val int
#include "cpque.h"
struct Point { int x, y; } typedef Point;
int Point_cmp(const Point* a, const Point* b) {
int c = c_default_compare(&a->x, &b->x);
return c ? c : c_default_compare(&a->y, &b->y);
}
#define f_tag pnt // f: was forward declared.
#define i_val Point
#define i_cmp Point_cmp
#include "cpque.h"
#include <stdio.h>
int main()
{
cstack_int istk = cstack_int_init();
cstack_int_push(&istk, 123);
cstack_int_push(&istk, 321);
// print
c_foreach (i, cstack_int, istk)
printf(" %d", *i.ref);
cstack_int_del(&istk);
puts("");
cpque_pnt pque = cpque_pnt_init();
cpque_pnt_push(&pque, (Point){23, 80});
cpque_pnt_push(&pque, (Point){12, 32});
cpque_pnt_push(&pque, (Point){54, 74});
cpque_pnt_push(&pque, (Point){12, 62});
// print
while (!cpque_pnt_empty(pque)) {
cpque_pnt_value_t *v = cpque_pnt_top(&pque);
printf(" (%d,%d)", v->x, v->y);
cpque_pnt_pop(&pque);
}
// free
cpque_pnt_del(&pque);
puts("");
cpque_int ique = cpque_int_init();
cpque_int_push(&ique, 123);
cpque_int_push(&ique, 321);
// print
for (int i=0; i<cpque_int_size(ique); ++i)
printf(" %d", ique.data[i]);
cpque_int_del(&ique);
puts("");
}
|
