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
|
#include <stc/crandom.h>
#include <stc/cqueue.h>
#include <stc/cfmt.h>
using_clist(i, int);
using_cqueue(i, clist_i); // min-heap (increasing values)
int main() {
int n = 10000000;
crand_uniform_i32_t dist;
crand_rng32_t rng = crand_rng32_init(1234);
dist = crand_uniform_i32_init(0, n);
cqueue_i queue = cqueue_i_init();
// Push ten million random numbers onto the queue.
c_forrange (n)
cqueue_i_push(&queue, crand_uniform_i32(&rng, &dist));
// Push or pop on the queue ten million times
c_print(1, "{}\n", n);
c_forrange (n) { // range uses initial n only.
int r = crand_uniform_i32(&rng, &dist);
if (r & 1)
++n, cqueue_i_push(&queue, r);
else
--n, cqueue_i_pop(&queue);
}
c_print(1, "{}, {}\n", n, cqueue_i_size(queue));
cqueue_i_del(&queue);
}
|
