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
|
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include "priority_queue.h"
int intcmp(void *_a, void *_b) {
int a = *(int *)_a;
int b = *(int *)_b;
if (a < b) return 1;
if (a > b) return -1;
return 0;
}
int main() {
printf("[TEST] pque\n");
priority_queue_t pq;
init_priority_queue(&pq, 3, sizeof(int), intcmp);
int elems[10] = {1, 3, 2, 4, 6, 5, 9, 7, 8, 10};
for (int i = 0; i < 10; i++) {
int e = elems[i];
priority_queue_push(&pq, &e);
}
for (int i = 1; i < 11; i++) {
int *top = priority_queue_top(&pq);
assert(i == *top);
priority_queue_pop(&pq);
}
assert(priority_queue_top(&pq) == NULL);
int elems2[10] = {10, 8, 7, 9, 5, 6, 4, 2, 3, 1};
int expected[10] = {10, 8, 7, 7, 5, 5, 4, 2, 2, 1};
for (int i = 0; i < 10; i++) {
int e = elems2[i];
priority_queue_push(&pq, &e);
int *top = priority_queue_top(&pq);
assert(*top == expected[i]);
}
printf("[PASS] pque\n");
return 0;
}
|
