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
64
65
66
67
|
#include <stdio.h>
#include <time.h>
#define i_static
#include <stc/crand.h>
#define i_val float
#define i_cmp -c_default_cmp
#define i_tag f
#include <stc/cpque.h>
#include <queue>
static const uint32_t seed = 1234;
static const int N = 2500000;
void std_test()
{
std::priority_queue<float, std::vector<float>, std::greater<float>> pq;
csrand(seed);
clock_t start = clock();
c_forrange (i, N)
pq.push((float) crandf()*100000.0);
printf("Built priority queue: %f secs\n", (float)(clock() - start)/(float)CLOCKS_PER_SEC);
printf("%g ", pq.top());
start = clock();
c_forrange (i, N) {
pq.pop();
}
printf("\npopped PQ: %f secs\n\n", (float)(clock() - start)/(float)CLOCKS_PER_SEC);
}
void stc_test()
{
int N = 10000000;
c_auto (cpque_f, pq)
{
csrand(seed);
clock_t start = clock();
c_forrange (i, N) {
cpque_f_push(&pq, (float) crandf()*100000);
}
printf("Built priority queue: %f secs\n", (float)(clock() - start)/(float)CLOCKS_PER_SEC);
printf("%g ", *cpque_f_top(&pq));
start = clock();
c_forrange (i, N) {
cpque_f_pop(&pq);
}
printf("\npopped PQ: %f secs\n", (clock() - start) / (float) CLOCKS_PER_SEC);
}
}
int main(void)
{
puts("STD P.QUEUE:");
std_test();
puts("\nSTC P.QUEUE:");
stc_test();
}
|
