1 /* A few tests for the xbt_heap module */
3 /* Copyright (c) 2004, 2005, 2006, 2007, 2008, 2009, 2010. 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. */
18 #include "gras/virtu.h" /* time manipulation in bench */
20 #include "xbt/sysdep.h" /* calloc, printf */
22 #define MAX_TEST 1000000
25 int _XBT_CALL compare_double(const void *a, const void *b);
27 int compare_double(const void *a, const void *b);
30 void test_heap_validity(int size);
31 void test_heap_mean_operation(int size);
32 void test_reset_heap(xbt_heap_t * heap, int size);
35 int compare_double(const void *a, const void *b)
49 void test_heap_validity(int size)
51 xbt_heap_t heap = xbt_heap_new(size, NULL);
52 double *tab = xbt_new0(double, size);
56 for (i = 0; i < size; i++) {
57 tab[i] = (double) (10.0 * rand() / (RAND_MAX + 1.0));
58 xbt_heap_push(heap, NULL, (double) tab[i]);
61 qsort(tab, size, sizeof(double), compare_double);
63 for (i = 0; i < size; i++) {
64 /* printf("%lg" " ", xbt_heap_maxkey(heap)); */
65 if (xbt_heap_maxkey(heap) != tab[i]) {
66 fprintf(stderr, "Problem !\n");
73 printf("Validity test complete!\n");
76 void test_heap_mean_operation(int size)
78 xbt_heap_t heap = xbt_heap_new(size, NULL);
83 date = gras_os_time() * 1000000;
84 for (i = 0; i < size; i++)
85 xbt_heap_push(heap, NULL, (10.0 * rand() / (RAND_MAX + 1.0)));
87 date = gras_os_time() * 1000000 - date;
88 printf("Creation time %d size heap : %g\n", size, date);
90 date = gras_os_time() * 1000000;
91 for (j = 0; j < MAX_TEST; j++) {
94 test_reset_heap(&heap, size);
96 val = xbt_heap_maxkey(heap);
98 xbt_heap_push(heap, NULL, 3.0 * val);
100 date = gras_os_time() * 1000000 - date;
101 printf("Mean access time for a %d size heap : %g\n", size,
102 date * 1.0 / (MAX_TEST + 0.0));
107 void test_reset_heap(xbt_heap_t * heap, int size)
110 xbt_heap_free(*heap);
111 *heap = xbt_heap_new(size, NULL);
113 for (i = 0; i < size; i++) {
114 xbt_heap_push(*heap, NULL, (10.0 * rand() / (RAND_MAX + 1.0)));
123 int main(int argc, char **argv)
126 for (size = 100; size < 10000; size *= 10) {
127 test_heap_validity(size);
128 test_heap_mean_operation(size);