3 /* A few tests for the xbt_heap module */
5 /* Copyright (c) 2004 Arnaud Legrand. All rights reserved. */
7 /* This program is free software; you can redistribute it and/or modify it
8 * under the terms of the license (GNU LGPL) which comes with this package. */
14 #include "gras/virtu.h" /* time manipulation in bench */
16 #define MAX_TEST 1000000
18 int compare_double(const void *a, const void *b);
19 void test_heap_validity(int size);
20 void test_heap_mean_operation(int size);
22 int compare_double(const void *a, const void *b)
36 void test_heap_validity(int size)
38 xbt_heap_t heap = xbt_heap_new(size, NULL);
39 double *tab = calloc(size, sizeof(double));
42 for (i = 0; i < size; i++) {
43 tab[i] = (10.0 * rand() / (RAND_MAX + 1.0));
44 xbt_heap_push(heap, NULL, tab[i]);
47 qsort(tab, size, sizeof(double), compare_double);
49 for (i = 0; i < size; i++) {
50 /* printf("%lg" " ", xbt_heap_maxkey(heap)); */
51 if (xbt_heap_maxkey(heap) != tab[i]) {
52 fprintf(stderr, "Problem !\n");
59 printf("Validity test complete!\n");
62 void test_heap_mean_operation(int size)
64 xbt_heap_t heap = xbt_heap_new(size, NULL);
69 date = gras_os_time() * 1000000;
70 for (i = 0; i < size; i++)
71 xbt_heap_push(heap, NULL, (10.0 * rand() / (RAND_MAX + 1.0)));
72 date = gras_os_time() * 1000000 - date;
73 printf("Creation time %d size heap : %g\n", size, date);
75 date = gras_os_time() * 1000000;
76 for (j = 0; j < MAX_TEST; j++) {
77 val = xbt_heap_maxkey(heap);
79 xbt_heap_push(heap, NULL, 3.0 * val);
81 date = gras_os_time() * 1000000 - date;
82 printf("Mean access time for a %d size heap : %g\n", size,
83 date * 1.0 / (MAX_TEST + 0.0));
88 int main(int argc, char **argv)
91 for (size = 100; size < 10000; size *= 10) {
92 test_heap_validity(size);
93 test_heap_mean_operation(size);