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
|
#include <stdio.h>
#include <time.h>
#include <stc/cvec.h>
#include <stc/cpque.h>
#include <stc/cmap.h>
#include <stc/crand.h>
using_cvec(i, int64_t);
using_cpque(i, cvec_i, >); // min-heap (increasing values)
int main() {
size_t N = 10000000;
stc64_t rng = stc64_init(time(NULL));
stc64_uniform_t dist = stc64_uniform_init(0, N * 10);
cpque_i heap = cpque_i_init();
// Push ten million random numbers to priority queue
c_forrange (N)
cpque_i_push(&heap, stc64_uniform(&rng, &dist));
// push some negative numbers too.
c_push_items(&heap, cpque_i, {-231, -32, -873, -4, -343});
c_forrange (N)
cpque_i_push(&heap, stc64_uniform(&rng, &dist));
// Extract the hundred smallest.
c_forrange (100) {
printf("%zd ", *cpque_i_top(&heap));
cpque_i_pop(&heap);
}
cpque_i_del(&heap);
}
|
