1 /* A few tests for the xbt_heap module */
3 /* Copyright (c) 2004-2010, 2012-2015. The SimGrid Team.
4 * All rights reserved. */
6 /* This program is free software; you can redistribute it and/or modify it
7 * under the terms of the license (GNU LGPL) which comes with this package. */
11 #include <xbt/xbt_os_time.h>
13 #include "simgrid/msg.h"
15 #include "xbt/sysdep.h"
17 #define MAX_TEST 1000000
19 static int compare_double(const void *a, const void *b)
21 double pa = *((double *) a);
22 double pb = *((double *) b);
31 static void test_reset_heap(xbt_heap_t * heap, int size)
34 *heap = xbt_heap_new(size, NULL);
36 for (int i = 0; i < size; i++) {
37 xbt_heap_push(*heap, NULL, (10.0 * rand() / (RAND_MAX + 1.0)));
41 static void test_heap_validity(int size)
43 xbt_heap_t heap = xbt_heap_new(size, NULL);
44 double *tab = xbt_new0(double, size);
47 for (i = 0; i < size; i++) {
48 tab[i] = (double) (10.0 * rand() / (RAND_MAX + 1.0));
49 xbt_heap_push(heap, NULL, (double) tab[i]);
52 qsort(tab, size, sizeof(double), compare_double);
54 for (i = 0; i < size; i++) {
55 if (fabs(xbt_heap_maxkey(heap) - tab[i]) > 1e-9) {
56 fprintf(stderr, "Problem !\n");
63 printf("Validity test complete!\n");
66 static void test_heap_mean_operation(int size)
68 xbt_heap_t heap = xbt_heap_new(size, NULL);
70 double date = xbt_os_time() * 1000000;
71 for (int i = 0; i < size; i++)
72 xbt_heap_push(heap, NULL, (10.0 * rand() / (RAND_MAX + 1.0)));
74 date = xbt_os_time() * 1000000 - date;
75 printf("Creation time %d size heap : %g\n", size, date);
77 date = xbt_os_time() * 1000000;
78 for (int j = 0; j < MAX_TEST; j++) {
81 test_reset_heap(&heap, size);
83 double val = xbt_heap_maxkey(heap);
85 xbt_heap_push(heap, NULL, 3.0 * val);
87 date = xbt_os_time() * 1000000 - date;
88 printf("Mean access time for a %d size heap : %g\n", size, date * 1.0 / (MAX_TEST + 0.0));
93 int main(int argc, char** argv)
95 MSG_init(&argc, argv);
97 for (int size = 100; size < 10000; size *= 10) {
98 test_heap_validity(size);
99 test_heap_mean_operation(size);