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
|
#include <stdio.h>
#include <time.h>
#include <stc/crandom.h>
#define i_val float
#define i_cmp -c_default_cmp
#define i_tag f
#include <stc/cpque.h>
int main()
{
uint32_t seed = time(NULL);
stc64_t rng;
int N = 10000000, M = 10;
cpque_f pq = cpque_f_init();
cpque_f_resize(&pq, N, 0.0f);
rng = stc64_init(seed);
clock_t start = clock();
c_forrange (i, N)
pq.data[i] = (float) stc64_randf(&rng)*100000;
cpque_f_make_heap(&pq);
printf("Built priority queue: %f secs\n", (clock() - start) / (float) CLOCKS_PER_SEC);
c_forrange (i, int, M) {
printf("%g ", *cpque_f_top(&pq));
cpque_f_pop(&pq);
}
start = clock();
c_forrange (i, int, M, N)
cpque_f_pop(&pq);
printf("\n\npopped PQ: %f secs\n", (clock() - start) / (float) CLOCKS_PER_SEC);
start = clock();
c_forrange (i, int, N)
cpque_f_push(&pq, (float) stc64_randf(&rng)*100000);
printf("pushed PQ: %f secs\n", (clock() - start) / (float) CLOCKS_PER_SEC);
c_forrange (i, int, M) {
printf("%g ", *cpque_f_top(&pq));
cpque_f_pop(&pq);
}
puts("");
cpque_f_drop(&pq);
}
|
